⚙️ Compiler Pipeline (2D)
Source → tokens → AST → evaluated result — a real lexer and recursive-descent parser.
Tokenize
Parse → AST
Evaluate
simple
nested parens
variables
foldable
unary minus
Tokens:
—
AST nodes:
—
AST depth:
—
Result:
—
1 · Token stream (lexer)
2 · Abstract syntax tree (recursive-descent parser)
3 · Evaluation
—