Theory of Computation208010 marksNumerical: CFG to Chomsky Normal FormChomsky Normal Form
Define context free grammar with an example. Explain with example, how context free grammar is converted to Chomsky Normal Form.
Define context free grammar with an example. Explain with example, how context free grammar is converted to Chomsky Normal Form.[10]
This is a theory and derivation question. The only structural data needed is the grammar chosen for the worked example, which is: $$ \begin{aligned} S &\to ASB \mid \varepsilon\ A &\to aAS \mid a\ B &\to SbS \mid A \mid bb \end{aligned} $$ No data is missing; the question is fully answerable. -...