Parser2a Java files; send message for more info

you will implement a solution that parses the expressions of our language. This is the partial (expressions only) second step in the compilation/interpretation process which receives the tokens produced by the Lexer in the previous part and turns them into an Abstract Syntax Tree (AST). The AST is a tree-based representation of our language.

The Crafting Interpreters link below is highly recommend to help you understand both the parsing process as well as the implementation approach we are using, including our usage of peek and match.