|Pattern 25||Tree-Based Interpreter|
This pattern executes programs by constructing an AST from the source code and walking the tree.
This tree-based interpreter pattern builds a complete scope tree before executing a program. That means it can support both statically typed languages like Java and dynamically typed languages like Python. (It can resolve all symbols statically before execution.)
The previous pattern directly executed source code, without processing it in any way. At the opposite extreme, a compiler translates source code to machine code, which we can then run natively on the processor. Per the compiler application pipeline from Chapter 1, Language Applications Cracked Open, a compiler builds an intermediate representation ...