Interpreter pattern

The Interpreter design pattern is one of the twenty-three well-known GoF design patterns that describe how to solve recurring design problems to design flexible and reusable object-oriented software, that is, objects that are easier to implement, change, test, and reuse. What problems can the Interpreter design pattern solve? Source: • A grammar for a simple language should be defined • so that sentences in the language can be interpreted. When a problem occurs very often, it could be considered to represent it as a sentence in a simple language (Domain Specific Languages) so that an interpreter can solve the problem by interpreting the sentence. For example, when many different or complex search expressions must be specified. Implementing (hard-wiring) them directly into a class is inflexible because it commits the class to particular expressions and makes it impossible to specify new expressions or change existing ones independently from (without having to change) the class. What solution does the Interpreter design pattern describe? • Define a grammar for a simple language by defining an Expression class hierarchy and implementing an interpret() operation. • Represent a sentence in the language by an abstract syntax tree (AST) made up of Expression instances. • Interpret a sentence by calling interpret() on the AST. The expression objects are composed recursively into a composite/tree structure that is called abstract syntax tree (see Composite pattern). The Interpreter pattern doesn't describe how to build an abstract syntax tree. This can be done either manually by a client or automatically by a parser. See also the UML class and object diagram below. == Uses ==

• Specialized database query languages such as SQL. • Specialized computer languages that are often used to describe communication protocols. • Most general-purpose computer languages actually incorporate several specialized languages. == Structure ==

UML class and object diagram In the above UML class diagram, the Client class refers to the common AbstractExpression interface for interpreting an expression interpret(context). The TerminalExpression class has no children and interprets an expression directly. The NonTerminalExpression class maintains a container of child expressions (expressions) and forwards interpret requests to these expressions. The object collaboration diagram shows the run-time interactions: The Client object sends an interpret request to the abstract syntax tree. The request is forwarded to (performed on) all objects downwards the tree structure. The NonTerminalExpression objects (ntExpr1,ntExpr2) forward the request to their child expressions. The TerminalExpression objects (tExpr1,tExpr2,…) perform the interpretation directly. UML class diagram == Example ==

This C++23 implementation is based on the pre C++98 sample code in the book. import std; using String = std::string; template using TreeMap = std::map; template using UniquePtr = std::unique_ptr; class BooleanExpression { public: BooleanExpression() = default; virtual ~BooleanExpression() = default; virtual bool evaluate(Context&) = 0; virtual UniquePtr replace(String&, BooleanExpression&) = 0; virtual UniquePtr copy() const = 0; }; class VariableExpression; class Context { private: TreeMap m; public: Context() = default; nodiscard bool lookup(const VariableExpression* key) const { return m.at(key); } void assign(VariableExpression* key, bool value) { m[key] = value; } }; class VariableExpression : public BooleanExpression { private: String name; public: VariableExpression(const String& name): name{name} {} virtual ~VariableExpression() = default; nodiscard virtual bool evaluate(Context& context) const { return context.lookup(this); } nodiscard virtual UniquePtr replace(const String& name, BooleanExpression& exp) { if (this->name == name) { return std::make_unique(exp.copy()); } else { return std::make_unique(name); } } nodiscard virtual UniquePtr copy() const { return std::make_unique(name); } VariableExpression(const VariableExpression&) = delete; VariableExpression& operator=(const VariableExpression&) = delete; }; class AndExpression : public BooleanExpression { private: UniquePtr operand1; UniquePtr operand2; public: AndExpression(UniquePtr op1, UniquePtr op2): operand1{std::move(op1)}, operand{std::move(op2)} {} virtual ~AndExpression() = default; nodiscard virtual bool evaluate(Context& context) const { return operand1->evaluate(context) && operand2->evaluate(context); } nodiscard virtual UniquePtr replace(const String& name, BooleanExpression& exp) const { return std::make_unique( operand1->replace(name, exp), operand2->replace(name, exp) ); } nodiscard virtual UniquePtr copy() const { return std::make_unique(operand1->copy(), operand2->copy()); } AndExpression(const AndExpression&) = delete; AndExpression& operator=(const AndExpression&) = delete; }; int main(int argc, char* argv[]) { UniquePtr expression; Context context; UniquePtr x = std::make_unique("X"); UniquePtr y = std::make_unique("Y"); UniquePtr expression; = std::make_unique(x, y); context.assign(x.get(), false); context.assign(y.get(), true); bool result = expression->evaluate(context); std::println("{}", result); context.assign(x.get(), true); context.assign(y.get(), true); result = expression->evaluate(context); std::println("{}", result); return 0; } The program output is: 0 1 == See also ==