A context-free grammar G is in Chomsky normal
form if every rule is of the form:
A −→ BC
A −→ a
where a is a terminal, A, B, C are nonterminals, and
B, C may not be the start variable (the axiom).
We are going to learn in this tutorial how to convert CFG to CNF
I wish you Good Luck. If you have any query then my contact details are given below.