Skip to content

AST #2

@hkr-droid

Description

@hkr-droid

I want to make sure I've got the roadmap straight. We want to

  1. parse scheme into an abstract syntax tree
  2. 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.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions