README
¶
some
🚧 Work in Progress 🚧
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!
Features
- 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.
Documentation
¶
There is no documentation for this package.
Source Files
Directories
¶
| Path | Synopsis |
|---|---|
|
package lexer takes source code as input and outputs tokens that represents the source code
|
package lexer takes source code as input and outputs tokens that represents the source code |
|
package repl creates a READ EVAL PRINT LOOP
|
package repl creates a READ EVAL PRINT LOOP |
|
package token defines small categorisable data structures that are fed into a parser
|
package token defines small categorisable data structures that are fed into a parser |
Click to show internal directories.
Click to hide internal directories.