Bottom-Up Parsing/LALR(1) Example 1

Consider the following grammar. <text> A -> C x A | ε B -> x C y | x C C -> x B x | z </text>

1. Build the LALR(1) parser table. If conflicts exist, assume YACC's behavior.
2. Show the differences to LR(0) and SLR(1) parsers.
3. Compact the parse table, eliminating and propagating reductions.
4. Show the stack and input states, as well as the parser actions, for the sequence xxzxx.

• Solution