(→Solution) |
(→Solution) |
||
Line 14: | Line 14: | ||
== Solution == | == Solution == | ||
− | [[Image:CompilersTopDownParsingExercise7.jpg| | + | [[Image:CompilersTopDownParsingExercise7.jpg|500px]] |
[[category:Teaching]] | [[category:Teaching]] | ||
[[category:Compilers]] | [[category:Compilers]] |
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 | (eps)