Construct the CFG for the given language. Illustrate the parse tree, Leftmost

derivation and right most derivation for the given string.

a$)L=\{\begin{array}{c}{a}^{\text{'}}b{c}^x|ji+k\end{array}$ and $\{$:$i,j,k0\}$

b$)$ R$.$E $=0011$

Construct the CFG for the given language. Illustrate the parse tree, Leftmost

derivation and right most derivation for the given string.

a$)L=\{a^n{b}^{2n}|n>0\}$

b$)L=\{\begin{array}{c}{0}^{a}10^c|a+c=b\end{array}$ and $\{$:$a,b,c0\}$

c$)L=\{a^n{b}^{}{c}^n|n,m>0\}$

Find the CNF for the given CFG$.$

$S$ASB$|E$

$A$aAS$|a$

$BSBS|A|bb$

Find the CNF for the given CFG$.$

$SAB|AC$

$A$Bab$|E$

$B$BAa$|E$

Construct a grammar in Chomsky Normal Form for the following $,$

C $\}.\{$a$,$ b$\},$ P$,$ S$).$ Show the intermediate steps in construction.

$S$ABC

$ABC|a$

$B$bAC$|$

$C$cAB$|$

Convert to Greibach Normal Form for the given grammar $G=\{\begin{array}{cc}\text{:}{A}_1,& A_2\\ 0,& 1\\ P\end{array},$

$A_1).$ where the $P$ consists of the following.

$A_1{A}_3{A}_2|0$

$A_2{A}_1{A}_1|1$

Convert to Greibach Normal Form for the given grammar $G=\{\begin{array}{ccc}{A}_1,& A_2,& A_3\\ 0,& 1\end{array},$

$P.$ A$1),$ where th