In the syntax analysis phase of the compiler, we take the tokens generated by the lexical analyzer and produce a tree like representation of it, called the parse tree. We then use this parse tree to verify and check the syntax.
Example parse tree for the express a=b+c