Parsing the tokens

A parsing algorithm analyzes a stream of tokens (produced by the lexer during tokenization) and determines whether they conform to the grammar of the language. The goal is to construct a parse tree (or syntax tree) that represents the hierarchical structure of the input based on the grammar rules.

Constructing the parse tree

For more info visit the dotlr library docs