The context free grammar for the language:
$L=\{a^n b^m \mid n \leq m + 3, n \geq 0, m \geq 0 \}$ is
When m =0, n can be 0, 1,2,3 because n<=m+3
Such strings are λ, a, aa, aaa
hence D is the answer
Ans (D)
23438 Points
17108 Points
8354 Points
6314 Points
5458 Points
5008 Points
4882 Points
4390 Points
3996 Points
3840 Points
Gatecse
X->YZ , Y->XZ , ...