Question

Exercise 4 . 4 . 6 : A grammar is e-free if no production body is e (called an e-productiori). Give an algorithm to convert any grammar into an e-free grammar that generates the same language (with the possible exception of the empty string — no e-free grammar can generate e). b) Apply your algorithm to the grammar S aSbS 1 bSaS | e. Hint: First find all the nonterminals that are nullable, meaning that they generate e, perhaps by a long derivation.

Answer 1

Explanation:

jsjsowoenbrnejwoowkebvrvfvrbj

sjwiiekeejej

nawjjqiwoeororo