|
|
| Line 1: |
Line 1: |
| == Problema ==
| | #REDIRECT [[ist:Bottom-Up Parsing/Example 10: LALR(1)]] |
| | |
| Consider the following grammar, where S is the initial symbol and { e, i, x } is the set of terminal symbols:
| |
| <text>
| |
| S -> i S | i S e S | x
| |
| </text>
| |
| # 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 '''ixixex''' (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
| |
| # Is this an SLR(1) grammar? Why?
| |
| | |
| == Solução ==
| |
| | |
| {{CollapsedCode|Solução completa|
| |
| [[image:sis.png]]
| |
| }}
| |
| | |
| [[category:Compiladores]]
| |
| [[category:Ensino]]
| |