parser

[petersalex27]

Implement parser. high level: convert token stream (from lexical analysis) to AST

[petersalex27]

Parsing algorithm?

• What will work well for functional languages similar to Haskell?/what does Haskell use?

[petersalex27]

Parsing is currently being done in two passes.

First Pass:

• Handles directives/annotations
• Groups tokens into syntactic sections: (declarations, definitions, typings, types, etc., etc.)
• Parses imports, uses, and module line
• Requests imported/used modules and integrates information contained in those (this info is required to correctly parse the second pass)
• Removes indentation, second pass of parser works with a more abstract version that already knows that sections

Second Pass:

• Parses each of the sections from the first pass
• More tradition parsing--has precedence, associativity, and applies the more fine grained grammar rules