Consider the following grammar, where **B** 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.
- 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
**bacy**input sequence.

Solução completa |
---|