Recall that the job of the Parser is to convert the tokens emitted by the Lexer into an Abstract Syntax Tree $($AST$)$ which represents the structural meaning of the code. For example, the expressions $1+2*3$ and $1*2+3$ are similar, but their AST's are quite different due to operator precedence: