S rightarrow aAB A rightarrow baAba B rightarrow Bblambda Fi

S rightarrow aAB A rightarrow baA/ba B rightarrow Bb/lambda Find a grammar that generates language L = {a^m b^n: m, n greaterthanorequalto 0 Find a grammar that generates language L ={b^n + 2 a^n: n greaterthanorequalto 0 Find a grammar that generates language L = {b^m a^n: m. n

Solution

1) S -> aS | B
B -> bB |

S is the start symbol.

2) S -> bbP
P -> bPa |

S is the start symbol.

2) B -> bB | S
S -> bSa |

B is the start symbol.