I want to make sure I've got the roadmap straight. We want to
- parse scheme into an abstract syntax tree
- somehow convert that syntax tree to erlang-core? this is perhaps under the banner of code generation in a compilers course?
In the first case it sounds like we can get the AST from whatever lambda calc we want, e.g. PCF. The grammar's already written for us. So we'd just need to write the parser from strings to sexps to AST.
I vote we use Ocaml :3.
Still unsure about 2 though.
I want to make sure I've got the roadmap straight. We want to
In the first case it sounds like we can get the AST from whatever lambda calc we want, e.g. PCF. The grammar's already written for us. So we'd just need to write the parser from strings to sexps to AST.
I vote we use Ocaml :3.
Still unsure about 2 though.