Q9

MCQ1 mark, −0.33

Consider the following context-free grammar $G$ , where $S, A$ , and $B$ are the variables (non-terminals), $a$ and $b$ are the terminal symbols, $S$ is the start variable, and the rules of $G$ are described as:

\begin{array}{l} S \rightarrow a a B \mid A b b \\ A \rightarrow a \mid a A \\ B \rightarrow b \mid b B \end{array}

Which ONE of the languages $L(G)$ is accepted by $G$ ?

(A)

$L(G)=\left\{a^{2} b^{n} \mid n \geq 1\right\} \cup\left\{a^{n} b^{2} \mid n \geq 1\right\}$

(B)

$L(G)=\left\{a^{n} b^{2 n} \mid n \geq 1\right\} \cup\left\{a^{2 n} b^{n} \mid n \geq 1\right\}$

(C)

$L(G)=\left\{a^{n} b^{n} \mid n \geq 1\right\}$

(D)

$L(G)=\left\{a^{2 n} b^{2 n} \mid n \geq 1\right\}$

Loading…