Convert the Grammar into Chomsky Normal Form and Greibach Normal Form X→ abT |bTa T aTb b

Show that grammar is  ambiguous

4. Construct a Chomsky normal form grammar for L(G) for the following cfg G: G=({S,B}, {a,b,c,d}, {S→BdSaSaS|BSS|b, B->cSda|S|dcb}, S). Note: You must first remove all unit productions.

Convert the following Grammar to Chomsky normal form, upload a docx of your solution:   S → aS |  Sb   |  bT | U T → Ta | cUc  | V  | null U → aUa | S  |  null V → dV | d   Please only provide the normal form :

Construct a Chomsky normal form grammar for L(G) for the following cfg G: G=({S,B}, {a,b,c,d}, {S→Sb|Ba, B→BdBc|S|ɛ}, S). Note: You must first remove all & and all unit productions.