language-design

Design operators end-to-end by defining token types in the lexer, adding parsing rules with precedence climbing, creating AST node types as discriminated unions, and implementing evaluation logic in the tree-walk interpreter with proper scope management.

Recursive-descent parsing maps grammar rules to functions that consume tokens and build AST nodes. Each rule function handles its construct's precedence, delegates to lower-precedence functions, and returns structured nodes for the interpreter to evaluate.

Define new nodes as discriminated union variants, update the parser to construct them, then add corresponding evaluation cases in the tree-walk interpreter with access to the environment for scope and variable lookup.

Tokenization converts source text into a token stream, the parser consumes tokens and builds an abstract syntax tree following grammar rules, and the AST represents the syntactic structure the interpreter executes.

Yes. Add token types to the lexer, extend parsing rules for the new syntax, define AST variants for semantic nodes, and integrate evaluation logic into the interpreter's existing environment and scope system.

The interpreter maintains environments that map names to values. Scope is managed by creating child environments for blocks and functions, allowing variable binding, lookup, and isolation across nested contexts.