Bytecode VM, dynamic number package, and R7RS compliant Scheme implementation.
Ava Affine
ddb49788af
All checks were successful
per-push tests / build (push) Successful in 47s
per-push tests / test-utility (push) Successful in 53s
per-push tests / test-frontend (push) Successful in 59s
per-push tests / test-backend (push) Successful in 43s
per-push tests / timed-decomposer-parse (push) Successful in 51s
The following instructions are modified to act on strings: - INDEX: Now pulls a char out at index - SUBSL: Now pulls a substring out of a source string - INSER: Now inserts a char into a string at index - LENGTH: Now returns length of a string In addition to the above instructions, additional instructions are now implemented to handle strings: - CONCAT: appends a string onto another string - S_APPEND: appends a char on to the end of a string Fixes: #38 Signed-off-by: Ava Affine <ava@sunnypup.io> |
||
|---|---|---|
| .forgejo/workflows | ||
| decomposer | ||
| hyphae | ||
| mycelium | ||
| organelle | ||
| snippets | ||
| .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.