The context free grammar given by \(S \rightarrow XYX \\ X \rightarrow aX \mid…

PYQ UGC NET 2015

The context free grammar given by

S→XYXX→aX∣bX∣λY→bbbS \rightarrow XYX \\ X \rightarrow aX \mid bX \mid \lambda \\ Y \rightarrow bbb

generates the language which is defined by regular expression:

  1. A.

    (a+b)∗bbb(a+b)^*bbb

  2. B.

    abbb(a+b)∗abbb(a+b)^*

  3. C.

    (a+b)∗(bbb)(a+b)∗(a+b)^*(bbb)(a+b)^*

  4. D.

    (a+b)(bbb)(a+b)∗(a+b)(bbb)(a+b)^*

Attempted by 59 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…