December2015 cs Q26

0. The context free grammar given by S → XYX X → aX|bX|λ Y → bbb generates the language which is defined by regular expression:

Answer
Comment
Array

Option : C
Explanation :
S → XYX X → aX|bX|λ i.e. (a + b)* Y → bbb S → (a + b)*(bbb)(a + b)* So, option (C) is correct.

Forgot your password?

I agree with the Terms.