Bottom-Up Parsing/Exercise 10: LALR(1): Difference between revisions
From Wiki**3
Created page with "== Problema == 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..." |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
== Problema == | == Problema == | ||
Consider the following grammar, where S is the initial symbol and { e, i, x } is the set of terminal symbols: | Consider the following grammar, where S is the initial symbol and '''{ e, i, x }''' is the set of terminal symbols: | ||
<text> | <source lang="text"> | ||
S | S → i S | i S e S | x | ||
</ | </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. | ||
| Line 11: | Line 11: | ||
== Solução == | == Solução == | ||
{{CollapsedCode|Solução completa| | |||
[[image:sis.png]] | |||
}} | |||
[[category:Compiladores]] | [[category:Compiladores]] | ||
[[category:Ensino]] | [[category:Ensino]] | ||
Latest revision as of 09:49, 2 May 2024
Problema
Consider the following grammar, where S is the initial symbol and { e, i, x } is the set of terminal symbols:
S → i S | i S e S | x
- 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
| Solução completa |
|---|
|
|
