This project is an ongoing effort to build a lightweight, tree-walking interpreter with a focus on efficiency, modularity, and usability. Current priorities include refining the execution model for better performance, improving AST traversal, and enhancing documentation to make the project more accessible for learners and future contributors. Feedback and discussions are welcome!
- Simple syntax.
- Variable bindings.
- Data types: integers, booleans.
- Arithmetic expressions.
- Built-in functions (yet to be decided$^*$).
- First class functions.
- Recursion.
- Higher order functions.
- Closures.
- Collection data structures: strings, array, hash tables.