Question

The context free grammar given by
$S\to XYX$
$X\to aX|bX|\lambda$
$Y\to bbb$
Generates the language which is defined by regular expression:

Answer 1

Option (c)

$S\to XYX$
$X\to aX|bX|\lambda$
$\text{i.e.}(a+b{)}^{\ast }$
$Y\to bbb$
$S\to (a+b{)}^{\ast }(bbb\left)\right(a+b{)}^{\ast }$

So, option (c) is correct.