Difference between revisions of "Top-Down Parsing/Exercise 9"
From Wiki**3
< Top-Down Parsing
(→Problem) |
|||
| Line 6: | Line 6: | ||
C -> v | C -> v | ||
A -> B x | z C A y | A -> B x | z C A y | ||
| − | B -> A v | z C w | | + | B -> A v | z C w | ε |
# 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. | ||
Latest revision as of 14:27, 29 April 2024
Contents[hide] |
Problem
Consider the following grammar, where A is the initial symbol and {v,x,y,z} is the set of terminal symbols:
C -> v A -> B x | z C A y B -> A v | z C w | ε
- 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 zvxy input sequence.
Solution
