Consider the following grammar.
<text>
A -> C x A | ϵ
B -> x C y | x C
C -> x B x | z
</text>
- Build the LALR(1) parser table. If conflicts exist, assume YACC's behavior.
- Show the differences to LR(0) and SLR(1) parsers.
- Compact the parse table, eliminating and propagating reductins.
- Show the stack and input states, as well as the parser actions, for the sequence xxzxx.