Bottom-Up Parsing/Exercise 17: LALR(1): Difference between revisions
From Wiki**3
| Line 1: | Line 1: | ||
== Problema == | == Problema == | ||
Consider the following grammar, where ''' | Consider the following grammar, where '''X''' is the initial symbol and '''{ a, b, c }''' is the set of terminal symbols: | ||
<source lang="text"> | <source lang="text"> | ||
X → X Y c | X a | a | X → X Y c | X a | a | ||
Revision as of 13:46, 7 May 2024
Problema
Consider the following grammar, where X is the initial symbol and { a, b, c } is the set of terminal symbols:
X → X Y c | X a | a
Y → a | 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 aabc (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
Solução
Note-se que a solução apresentada é para SLR(1) e LALR(1) (a vermelho).
| Solução completa |
|---|
