Reference no: EM133365139
Question: Let G = (V, E, R, S) be a context-free grammar, where:
V = {(, ), a, ., S, A), E = {(, ), ., a }
R = {S→(), S→a, S→(A), A→S, A→ S.A}
(a) Apply Heuristic rules (1) and/or (2) to G. Let G be the resulting grammar
(b) Construct a deterministic pushdown automata M accepting L(G)$
(c) Study the computation of M on the string ((()).a)