Let G = ({S}, {a, b}, R, S) be a context free grammar where the rule set R is…
PYQ GATE 2003
Let G = ({S}, {a, b}, R, S) be a context free grammar where the rule set R is S → a S b | SS | ε Which of the following statements is true?
- A.
G is not ambiguous
- B.
There exist x, y ∈ L (G) such that xy ∉ L(G)
- C.
There is a deterministic pushdown automaton that accepts L(G)
- D.
We can find a deterministic finite state automaton that accepts L(G)
Attempted by 65 students.
Sign up free to check your answer
Sign up freeLoading lesson…

