Interpreter pattern in LLD - System Design Exercise

Design: Interpreter Pattern Implementation

In scope: Designing the interpreter pattern structure, expression parsing, evaluation, and extensibility. Out of scope: Complex language parsing, error recovery, or integration with external systems.

Functional Requirements

FR1: Design a system that can interpret and evaluate simple expressions.

FR2: Support basic operations like addition, subtraction, multiplication, and division.

FR3: Allow easy extension to add new operations or expression types.

FR4: Provide a way to parse input strings into expression trees.

FR5: Evaluate expressions to produce a numeric result.

Non-Functional Requirements

NFR1: The system should handle expressions with up to 100 operations efficiently.

NFR2: Evaluation latency should be under 50ms for typical expressions.

NFR3: The design should be modular to support future extensions without modifying existing code.

NFR4: Memory usage should be optimized for embedded or low-resource environments.

Think Before You Design

Questions to Ask

❓ Question 1

❓ Question 2

❓ Question 3

❓ Question 4

❓ Question 5

Key Components

Abstract Expression interface or class

Terminal Expressions for numbers or literals

Non-terminal Expressions for operations (add, subtract, etc.)

Parser component to convert input strings into expression trees

Context or environment if variables or state are needed

Design Patterns

Interpreter pattern for expression evaluation

Composite pattern to represent expression trees

Factory pattern for creating expression objects

Visitor pattern for extending operations without modifying expressions

Reference Architecture

Input String --> Parser --> Expression Tree (Composite of Terminal and Non-terminal Expressions) --> Interpreter (Evaluate) --> Result

Components

Expression Interface

Abstract class or interface

Defines the interpret method for all expressions

TerminalExpression

Class

Represents numeric literals; returns their value on interpret

NonTerminalExpression

Class

Represents operations like add, subtract; interprets by combining child expressions

Parser

Class

Parses input strings into expression trees composed of Expression objects

Request Flow

1. User inputs an expression string (e.g., "3 + 5 * 2")

2. Parser reads the string and builds an expression tree using Terminal and NonTerminal expressions

3. The root expression's interpret method is called

4. Interpret method recursively evaluates child expressions and applies operations

5. Final numeric result is returned to the user

Database Schema

Not applicable as this is an in-memory pattern implementation without persistent storage.

Scaling Discussion

Bottlenecks

Parsing complex or very large expressions may be slow or memory intensive

Adding many new operations could complicate the expression hierarchy

Evaluation of deeply nested expressions may cause stack overflow or performance issues

Solutions

Optimize parser with iterative parsing or tokenization to reduce memory use

Use the Visitor pattern to add new operations without modifying existing expression classes

Implement tail-recursion optimization or iterative evaluation to handle deep expression trees

Interview Tips

Time: Spend 10 minutes explaining the problem and clarifying requirements, 20 minutes designing the expression classes and parser, 10 minutes discussing extensibility and scaling.

Explain how the Interpreter pattern models grammar rules as classes

Show how the Composite pattern helps represent nested expressions

Discuss how the parser converts strings into expression trees

Highlight extensibility by adding new expression types without changing existing code

Mention performance considerations for parsing and evaluation

Practice

1. What is the main purpose of the Interpreter pattern in system design?

easy

A. To manage user authentication and authorization

B. To define a grammar for a simple language and interpret sentences in that language

C. To store data persistently in a database

D. To create multiple threads for parallel processing

Solution

1. Step 1: Understand the role of the Interpreter pattern

   The Interpreter pattern defines a way to evaluate sentences in a language by representing grammar rules as classes.

2. Step 2: Match the purpose with options

   Only To define a grammar for a simple language and interpret sentences in that language correctly describes defining a grammar and interpreting sentences, which is the core of the Interpreter pattern.

3. Final Answer:

   To define a grammar for a simple language and interpret sentences in that language -> Option B

4. Quick Check:

   Interpreter pattern = Define grammar and interpret [OK]

Hint: Interpreter pattern = grammar + interpretation [OK]

Common Mistakes:

• Confusing Interpreter with concurrency patterns
• Thinking it manages data storage
• Mixing it up with security patterns

2. Which of the following is the correct way to define an interpret() method in an expression interface for the Interpreter pattern?

easy

A. def interpret(context): return self

B. def interpret(): return context

C. def interpret(self): return None

D. def interpret(self, context): pass

Solution

1. Step 1: Recall the method signature for interpret in Interpreter pattern

   The interpret method usually takes a context parameter and is defined as an instance method with self.

2. Step 2: Compare options with correct signature

   def interpret(self, context): pass correctly defines interpret(self, context) with a placeholder pass, matching the pattern's interface.

3. Final Answer:

   def interpret(self, context): pass -> Option D

4. Quick Check:

   interpret method = instance method with context parameter [OK]

Hint: interpret() needs self and context parameters [OK]

Common Mistakes:

• Omitting self parameter in method
• Not passing context argument
• Returning wrong values or missing parameters

3. Given the following Python-like pseudocode for an Interpreter pattern, what will be the output?

class TerminalExpression:
    def __init__(self, data):
        self.data = data
    def interpret(self, context):
        return self.data in context

class AndExpression:
    def __init__(self, expr1, expr2):
        self.expr1 = expr1
        self.expr2 = expr2
    def interpret(self, context):
        return self.expr1.interpret(context) and self.expr2.interpret(context)

expr1 = TerminalExpression('apple')
expr2 = TerminalExpression('banana')
and_expr = AndExpression(expr1, expr2)
print(and_expr.interpret(['apple', 'banana', 'cherry']))

medium

A. True

B. False

C. Error due to missing method

D. None

Solution

1. Step 1: Evaluate TerminalExpression interpret calls

   expr1.interpret checks if 'apple' is in the list ['apple', 'banana', 'cherry'] -> True. expr2.interpret checks if 'banana' is in the list -> True.

2. Step 2: Evaluate AndExpression interpret

   AndExpression returns True if both expr1 and expr2 interpret return True. Both are True, so result is True.

3. Final Answer:

   True -> Option A

4. Quick Check:

   Both terms in list -> True [OK]

Hint: AND expression true only if both sub-expressions true [OK]

Common Mistakes:

• Assuming 'in' checks keys instead of values
• Confusing AND with OR logic
• Forgetting to return boolean result

4. In the following code snippet implementing the Interpreter pattern, what is the error?

class OrExpression:
    def __init__(self, expr1, expr2):
        self.expr1 = expr1
        self.expr2 = expr2
    def interpret(self, context):
        return self.expr1.interpret(context) | self.expr2.interpret(context)

medium

A. Using bitwise OR operator instead of logical OR

B. Missing return statement in interpret method

C. Incorrect constructor parameters

D. interpret method missing context parameter

Solution

1. Step 1: Identify operator used in interpret method

   The code uses the bitwise OR operator '|' instead of the logical OR operator 'or' for boolean logic.

2. Step 2: Explain why this is an error

   Bitwise OR can cause unexpected results with booleans and is not the intended logical operation for combining expressions.

3. Final Answer:

   Using bitwise OR operator instead of logical OR -> Option A

4. Quick Check:

   Logical OR needs 'or', not '|' [OK]

Hint: Use 'or' for logical OR, not '|' [OK]

Common Mistakes:

• Confusing bitwise and logical operators
• Forgetting to return a value
• Incorrect method signatures

5. You want to design a system using the Interpreter pattern to evaluate complex search queries combining keywords with AND, OR, and NOT. Which design approach best supports scalability and easy extension?

hard

A. Store all queries as strings and parse them manually each time without classes

B. Use a single class with many if-else statements to handle all expression types

C. Create separate classes for TerminalExpression, AndExpression, OrExpression, and NotExpression implementing a common interface

D. Implement only TerminalExpression and handle AND/OR/NOT outside the interpreter

Solution

1. Step 1: Identify design principles for Interpreter pattern

   Using separate classes for each expression type following a common interface allows modularity and easy extension.

2. Step 2: Evaluate options for scalability and maintainability

   Create separate classes for TerminalExpression, AndExpression, OrExpression, and NotExpression implementing a common interface supports adding new expressions without changing existing code, unlike monolithic if-else or manual parsing.

3. Final Answer:

   Create separate classes for TerminalExpression, AndExpression, OrExpression, and NotExpression implementing a common interface -> Option C

4. Quick Check:

   Separate classes + common interface = scalable design [OK]

Hint: Use separate classes per expression type for easy extension [OK]

Common Mistakes:

• Using one class with complex conditionals
• Parsing strings manually every time
• Handling logic outside interpreter classes