Consider the production rules of grammar G: \(\begin{array}{l} \mathrm{S}…

PYQ UGC NET 2022

Consider the production rules of grammar G:

S→AbBA→aAb∣λB→bB∣λ\begin{array}{l} \mathrm{S} \rightarrow \mathrm{AbB} \\ \mathrm{A} \rightarrow \mathrm{aAb} \mid \lambda \\ \mathrm{B} \rightarrow \mathrm{bB} \mid \lambda \end{array}

Which of the following language 𝐿 is generated by grammer 𝐺 ?

  1. A.

    L={anbm:n≥0,m>n}\text L=\left\{a^{n} b^{m}: n \geq 0, m>n\right\}

  2. B.

    L={anbm:n≥0,m≥0}\text L=\left\{a^{n} b^{m}: n \geq 0, m \geq 0\right\}

  3. C.

    L={anbm:n≥m}L=\left\{a^{n} b^{m}: n \geq m\right\}

  4. D.

    L={anbm:n≥m,m>0}L=\left\{a^{n} b^{m}: n \geq m, m>0\right\}

Attempted by 65 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…