Design (LLD) Compiler - Machine Coding

This is the minimum required to show a functioning compiler.

1. Lexical Analysis (Scanner):

   • Regex-based tokenization of keywords (var, print), identifiers, numbers, and operators.

   • Handling of whitespace and basic delimiters (;, (, )).

2. Syntax Analysis (Recursive Descent Parser):

   • Expression Handling: Implementation of operator precedence (e.g., Multiplication before Addition).

   • Statement Parsing: Support for variable declarations and print statements.

3. Abstract Syntax Tree (AST):

   • A clean node hierarchy (e.g., BinaryOpNode, LiteralNode, VariableNode).

4. Basic Interpreter:

   • A visitor that traverses the AST and executes the logic immediately using a simple Global Symbol Table (Map of String to Value).

Solution