Q51

MCQ2 marks, −0.5

Let $G=\left(\left\{S\right\}, \left\{a,b\right\},R,S\right)$ be a context free grammar where the rule set R is $S \to a S b \mid S S \mid \epsilon$ Which of the following statements is true?

(A)

$G$ is not ambiguous

(B)

There exist $x, y \in L(G)$ such that $xy \notin 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)$

Loading…