Let G = ({S}, {a, b}, R, S) be a context free grammar where the rule set R is…

GATE · 2003 · CS

1. A.

   G is not ambiguous

2. B.

   There exist x, y ∈ L (G) such that xy ∉ L(G)

3. C.

   There is a deterministic pushdown automaton that accepts L(G)

4. D.

   We can find a deterministic finite state automaton that accepts L(G)

Attempted by 38 students.

The worked solution is available to enrolled students.

Video solution available to enrolled students.