1. Find a grammar in Chomsky Normal form equivalent to S->aAD;A->aB/bAB; B->b, D->d.
2. Convert to Greibach Normal Form the grammar G=({A1,A2, A3},{a,b},P,A1 ) where P consists of the following. A1 ->A2 A3, A2 ->A3 A1 /b,A3 ->A1 A2 /a.
3. Construct given CFG into GNF where v={S,A},T={0,1} and P is S Æ AA/0 , AÆSS/1 4. Convert the grammar S->AB, A->BS/b, B->SA/a into Greibach NormalForm.
5. Construct a equivalent grammar G in CNF for the grammar G1 where G1 =({S,A,B},{a,b},{S->bA/aB,A->bAA/aS/a, B->aBB/bS/b}, S)
6. Obtain the Chomsky Normal Form equivalent to the grammars S ÆaAbB , A ÆaA/a, BÆbB/b