Discussion Forum
Que.  The context free grammar given by S→XYX X→aXbXλ Y→bbb generates the language which is defined by regular expression: 
a.  (a+b)*bbb 
b.  abbb(a+b)* 
c.  (a+b)*(bbb)(a+b)* 
d.  (a+b)(bbb)(a+b)* 
Answer:(a+b)*(bbb)(a+b)* 
Revathi :(March 07, 2018)
The context free grammar given by
S→XYX X→aXbXλ Y→bbb generates the language which is defined by regular expression: I dont understand.can any one help me out 
Click to Add Comment 
Robin :(October 14, 2018)
Kindly solve this question

Click to Add Comment 