AsAssumptions $...$

Alphabet$=\{$a$,$b$\}$

L$1=\{$a$^$nb$^$n:n$0$ n$$mod$3=0\}$

L$2=\{$a$^$nb$^$m:n$0$ m$0$ n$=$m$1\}$

To do in this exercise $...$

Find a$$context$$free grammar$$G$$such that$$L$($G$)=$L$1$L$2.$

Save your$$context$$free grammar$$as a$$JFLAP$.$jff$$file$,$ and submit that$.$jff$$file to Canvas as your solution to this exercise.

$$sumptions $...$

Alphabet$=\{$a$,$b$\}$

L$=\{$a$^$nb$^$n:n$0$ n$$mod$3=0\}$

To do in this exercise $...$

Find a$$context$$free grammar$$G$$such that$$L$($G$)=$L$,$ the$$star$-$closure$$of$$L$.$