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?
see the following screenshot taken from the book "Introduction to theory of computation" by Michael Sipser.
All these PYQ blogs and standard videos blogs...