Bottom-Up Parsing/LALR(1) Example 1: Difference between revisions
From Wiki**3
< Bottom-Up Parsing
(New page: 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 dif...) |
(No difference)
|
Revision as of 08:51, 5 May 2008
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.