$(2$pts$)$ Show that

$SaS|bS|cA,$

$AaA|bS|$

is an s$-$grammar.

$2.(3$pts$)$ Eliminate the variable B from the grammar

$S$aSB$|bB,|$

$BaA|b|$

$(4$pts$)$ Eliminate all useless productions from the grammar

$SaS|AB\frac{|}{},$

$AbA,$

$BAA$

What language does this grammar generate?

$4.(4$pts$)$ Eliminate all $\frac{?}{}-$productions from

$S$AaB$|aaB,|$

$A\frac{}{},$

$B$bbA$\frac{|}{}|$

$(4$pts$)$ Transform the grammar with productions

$S$ baAB

$A$bAB$\frac{|}{}|$

$B$BAa$|A\frac{|}{}$

into Chomsky normal form.

$6.(3$pts$)$ Convert the grammar

$Sab|aS|aaS|aSS|$

into Greibach normal form.