(→Problem) |
|||
Line 6: | Line 6: | ||
X -> a | X -> a | ||
A -> X c A e | M b | A -> X c A e | M b | ||
− | M -> A c | X c d | | + | M -> A c | X c d | ε |
# 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. |
Contents |
Consider the following grammar, where A is the initial symbol and {a,b,c,d,e} is the set of terminal symbols:
X -> a A -> X c A e | M b M -> A c | X c d | ε