This is a Mini scheme Interpreter
made with Haskell (Alex as lexical analyser, Happy as parser).
[!] This is not a perfect language or interpreter. I just made this as term project of univ lecture.
[!] I'm stilling working on this project. So, this might be a not final version.
# first you need to download haskell compiler(ghc) - https://www.haskell.org/ghc/
# build
make
# run
Main.exe
#try example code under /Example Folder
AST.hs
: AST component data type, Symbol table data typeEnviroment.hs
: Eval & Apply working partmain.hs
: REPLTokens.x
: scanner, input file of AlexGrammar.y
: parser, input file of Happy
- haskell ghc compiler : https://www.haskell.org/ghc/
- Alex User Guide : https://www.haskell.org/alex/doc/html/index.html
- Happy User Guide : https://www.haskell.org/happy/doc/html/index.html
- How to compile lambda : https://matt.might.net/articles/closure-conversion/