Revision as of 09:43, 14 April 2015

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 → x | ε

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 xzyxy input sequence.

@@ Line 1: / Line 1: @@
 = Problem =
-Consider the following grammar, where '''<tt>S</tt>''' is the initial symbol and '''<tt>{v, w, x, y, z}</tt>''' 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:
-  S → M y S x | L y | ε
+  A → B y | x | ε
-  L → w L | S v
+  B → A x | C z
-  M → z | x
+  C → x | ε
 # 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 '''<tt>zyvyx</tt>''' input sequence.
+# Show the analysis table (stack, input, and actions) for the parsing process of the '''xzyxy''' input sequence.
 = Solution =