• The parser obtains a string of tokens from the lexical analyzer, and verifies that the string of token names can be generated by the grammar for the source language. • We expect the parser to report any syntax errors and to recover from commonly occurring errors to continue processing the remainder of the program. • The parser constructs a parse tree and passes it to the rest of the compiler for further processing.
• top-down or bottom-up parsers. • As implied by their names, top-down methods build parse trees from the top (root) to the bottom (leaves) , while bottom-up methods start from the leaves and work their way up to the root. • In either case, the input to the parser is scanned from left to right, one symbol at a time.
Representative Grammars • E represents expressions consisting of terms separated by + signs, T represents terms consisting of factors separated by * signs, and F represents factors that can be either parenthesized expressions or identifiers. • Expression grammar belongs to the class of LR grammars that are suitable for bottom-up parsing. • It cannot be used for top-down parsing because it is left recursive. The following non-left-recursive variant of the expression grammar will be used for top-down parsing.