Let sigma a b For each of the following languages find a gr

Let sigma = {a, b}. For each of the following languages, find a grammar that generates it. b) L_2 = {a^3n b^2n: n greaterthanorequalto 2}

Solution

The grammar for the above given language is as follows:

G={S,{a,b},P,F}

where

S is starting state

a,b is set of terminals

P is the set of production rules

and F is the final state.

S -> aaaaaabbbb|aaaaaaSbbbb