Computer Science, asked by Destroyer8616, 8 months ago

State lemma 2 for converting a cfg to gnf

Answers

Answered by Anonymous
44

Answer:

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.

Similar questions