Bytecode VM, dynamic number package, and R7RS compliant Scheme implementation.
Ava Affine
3a0a141738
This commit adds a new datatype: the quickmap. It provides an extremely fast but relatively high collision string hash to whatever key hashmap. This is optimized purely for variable names, and is intended to use for variable name lookup during (eval ...) or (string->symbol ...) if I must implement that. The hashmap is bucketed, with a set number of buckets (199 in this case). Each bucket is preallocated at initialization containing an empty vector. There will only ever be one of these initialized as it is only to contain globally accessible names. The interface provides new, get, remove, contains_key, insert, and an iterator implementation. Unit tests are included and CI is updated. Signed-off-by: Ava Affine <ava@sunnypup.io> |
||
|---|---|---|
| decomposer | ||
| mycelium | ||
| .gitignore | ||
| .gitlab-ci.yml | ||
| Cargo.lock | ||
| Cargo.toml | ||
| LICENSE | ||
| readme.md | ||
Mycelium
Mycelium aims to provide an efficient compiled to intermediate bytecode implementation of R7RS Scheme as well as a virtual machine that will execute such bytecode.
Two major use cases are at the forefront of mind when designing and implementing this project: a POSIX shell interpreter as well as a compiled to bytecode language for running on ESP32 devices.
Current Status
Currently the lexer and parser are implemented. On an X86 machine equipped with 64GB RAM and an AMD Ryzen 7900 CPU this lexer and parser are capable of creating a fully validated abstract syntax tree from approximately 11200 lines of handwritten scheme in about 55 milliseconds on average.
Currently the bytecode VM and its instruction set are next to implement.