(→Problem) |
|||
Line 12: | Line 12: | ||
# Show the analysis table (stack, input, and actions) for the parsing process of the '''<tt>zyvyx</tt>''' input sequence. | # Show the analysis table (stack, input, and actions) for the parsing process of the '''<tt>zyvyx</tt>''' input sequence. | ||
− | + | = Solution = | |
[[Image:CompilersTopDownParsingExercise10.jpg|700px]] | [[Image:CompilersTopDownParsingExercise10.jpg|700px]] |
Contents |
Consider the following grammar, where S is the initial symbol and {v, w, x, y, z} is the set of terminal symbols:
S → M y S x | L y | ε L → w L | S v M → z | x