Question: Consider the following grammar G: S - > E + E | E E | ( E ) S - > 1 | 2 |

Consider the following grammar G:
S -> E + E | E E |(E)
S ->1|2|3|4
(a) Give a description of L(G) using set notation.
(b) Show that G is ambiguous.
(c) Give an equivalent CFG that is not ambiguous. It suffices to give the rules. Your
CFG should not be overly complicated.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!