Bottom-Up Parsing/LALR(1) Example 1: Difference between revisions
From Wiki**3
< Bottom-Up Parsing
No edit summary |
No edit summary |
||
| Line 8: | Line 8: | ||
# Build the LALR(1) parser table. If conflicts exist, assume YACC's behavior. | # Build the LALR(1) parser table. If conflicts exist, assume YACC's behavior. | ||
# Show the differences to LR(0) and SLR(1) parsers. | # Show the differences to LR(0) and SLR(1) parsers. | ||
# Compact the parse table, eliminating and propagating | # Compact the parse table, eliminating and propagating reductions. | ||
# Show the stack and input states, as well as the parser actions, for the sequence '''xxzxx'''. | # Show the stack and input states, as well as the parser actions, for the sequence '''xxzxx'''. | ||
Revision as of 14:37, 6 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 reductions.
- Show the stack and input states, as well as the parser actions, for the sequence xxzxx.