Context free languages


#1

contruct a reduced grammar equivalent to the grammar
S->aAa
A->Sb | bCC | DaA
C->abb | DD
E->aC
D->aDA


#2