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 i
a) (a) L(G) = {1, 2, 3, 4}
(b) (b) G is ambiguous because it generates the same string by different parse trees.
(c) (c) S -> E, E -> E + E | E * E | (E) | 1 | 2 | 3 | 4