(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...") |
|||
(2 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
= Problem = | = Problem = | ||
− | Consider the following grammar, where '''A''' is the initial symbol and '''{x, y | + | Consider the following grammar, where '''A''' is the initial symbol and '''{a, b, c, x, y}''' is the set of terminal symbols: |
− | + | X → c | |
− | + | A → a A | B x | X | |
− | + | B → b B | A y | |
# 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. | ||
# Compute the FIRST and FOLLOW sets for all non-terminal symbols in the new grammar and build the parse table. | # Compute the FIRST and FOLLOW sets for all non-terminal symbols in the new grammar and build the parse table. | ||
− | # Show the analysis table (stack, input, and actions) for the parsing process of the ''' | + | # Show the analysis table (stack, input, and actions) for the parsing process of the '''acyx''' input sequence. |
= Solution = | = Solution = |
Consider the following grammar, where A is the initial symbol and {a, b, c, x, y} is the set of terminal symbols:
X → c A → a A | B x | X B → b B | A y
Solução completa |
---|