Difference between revisions of "Bottom-Up Parsing/Exercise 13: LALR(1)"
From Wiki**3
< Bottom-Up Parsing
(→Problema) |
|||
| (One intermediate revision by the same user not shown) | |||
| Line 2: | Line 2: | ||
Consider the following grammar, where A is the initial symbol and '''{ x, y, z }''' is the set of terminal symbols: | Consider the following grammar, where A is the initial symbol and '''{ x, y, z }''' is the set of terminal symbols: | ||
| − | <text> | + | <source lang="text"> |
| − | A | + | A → A B A x | A y | z |
| − | B | + | B → x | z B |
| − | </ | + | </source> |
# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table. | # Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table. | ||
# Compact the parse table, eliminating and propagating reductions. | # Compact the parse table, eliminating and propagating reductions. | ||
Latest revision as of 11:47, 2 May 2024
Problema
Consider the following grammar, where A is the initial symbol and { x, y, z } is the set of terminal symbols:
A → A B A x | A y | z
B → x | z B
- Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.
- Compact the parse table, eliminating and propagating reductions.
- Show the parsing process for input zzxzyx (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
Solução
| Solução completa |
|---|
|
|
