This is just my experimenting with tokenization, parsing and, especially, interpreters.
The very first attempts were made with an interpreter for arithmetic expressions and one for lambda calculus.
There's an ongoing attempt to formalize a very simple functional language with support for recursion and - obviously - high order functions.
naighes/ocaml-interpreters
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|