Q10

MCQ1 mark, −0.33

Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:

S \rightarrow abScT \mid abcT

T \rightarrow bT \mid b

Which one of the following represents the language generated by the above grammar?

(A)

$\{\left ( ab \right )^{n}\left ( cb \right )^{n} \mid n \geq 1 \}$

(B)

$\{\left ( ab \right )^{n}cb^{m_{1}}cb^{m_{2}}...cb^{m_{n}} \mid n, m_{1}, m_{2}, ..., m_{n} \geq 1 \}$

(C)

$\{\left ( ab \right )^{n}\left ( cb^{m} \right )^{n} \mid m,n \geq 1 \}$

(D)

$\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$

Loading…