Automata: Conversion from CFG to CNF

Question

Convert the following context free grammar into Chomsky Normal Form:

$S \rightarrow ASA | aB$

$A \rightarrow B | S$

$B \rightarrow b |  \epsilon$

Does the appearance of starting symbol S at RHS impacts the conversion from CFG to CNF?

Comments

@manu00x

no need for that..

---

@nitis

see the following screenshot taken from the book "Introduction to theory of computation" by Michael Sipser.

---

https://gateoverflow.in/188159/chomskey-normal-form?show=188159#q188159