(Created page with "= Problem = Consider the following grammar, where '''A''' is the initial symbol and '''{x, y, z}''' is the set of terminal symbols: A → B y | x | ε B → A x | C z C...") |
|||
Line 3: | Line 3: | ||
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: | ||
− | + | X → c | |
− | + | A → a A | B x | X | |
− | + | B → b | B | |
# Examine the grammar and rewrite it so that an LL(1) predictive parser can be built for the corresponding language. | # Examine the grammar and rewrite it so that an LL(1) predictive parser can be built for the corresponding language. |
Consider the following grammar, where A is the initial symbol and {x, y, z} is the set of terminal symbols:
X → c A → a A | B x | X B → b | B
Solução completa |
---|