| commit | 5337c2bc7ab93112e7edd4c772d98987ba596e49 | [log] [tgz] |
|---|---|---|
| author | Sketch🕴️ <skallywag@sketch.dev> | Sat Feb 28 20:37:00 2026 +0400 |
| committer | Sketch🕴️ <skallywag@sketch.dev> | Sat Feb 28 20:37:00 2026 +0400 |
| tree | 6e65b6d1f29c19b04742b9f035c5f65776fbfb4b | |
| parent | c3ec07d0e6f21f3a78888b5128c1f331c5533a99 [diff] |
ast: add Ident, FuncCall nodes and Statement interface (ExprStmt, FuncDef)
- Ident{Name}: variable reference node (sealed, implements Node)
- FuncCall{Name, Args}: function call node (sealed, implements Node)
- Statement interface: sealed, for top-level REPL input
- ExprStmt{Expr}: wraps expression as statement
- FuncDef{Name, Params, Body}: function definition statement
A math expression evaluator with an interactive REPL, written in Go.
+, -, *, /.5 syntax)* and / bind tighter than + and -)go build -o matheval ./cmd/matheval
Run the REPL:
./matheval
Then type expressions:
>> 2 + 3 * 4 14 >> (2 + 3) * 4 20 >> 7 / 2 3.5 >> 1 / 0 error: division by zero
Press Ctrl+D (EOF) to exit.
You can also pipe input:
echo "2 + 3" | ./matheval
Input string → Lexer → Parser → AST → Evaluator → Result
| Package | Responsibility |
|---|---|
token | Token types and data structures |
lexer | Tokenizes input string |
ast | AST node types (NumberLit, BinaryExpr) |
parser | Recursive-descent parser |
evaluator | Walks AST and computes result |
repl | Read-eval-print loop |
expr → term (('+' | '-') term)*
term → factor (('*' | '/') factor)*
factor → NUMBER | '(' expr ')'
go test ./...
This runs unit tests for each package plus integration tests covering the full pipeline.