Peter Linz Edition 4 Exercise 1.2 Question 12 (Page No. 28)

Question

Give a simple description of the language generated by the grammar with productions

$S \rightarrow aA,$

$A \rightarrow bS,$

$S \rightarrow λ.$

Answer 1

The given grammar is accepting  the strings like $(\epsilon,ab,abab,ababab….\infty)$ whose regular expression is $(ab)^*$

 

 

Answer 2

L=(ab)*.