Question

State lemma 1 for converting a CFG to GNF.

Answer 1

Convert the grammar into CNF. If the given grammar is not in CNF, convert it to CNF. ...

Eliminate left recursion from grammar if it exists. If CFG contains left recursion, eliminate them. ...

Convert the production rules into GNF form. If any production rule is not in the GNF form, convert them.