Context Free Language to Chomsky Normal Form Converter

This Converter was created from the construction given in Theorem 2.9 (page 109) of Introduction to the Theory of Computation by Michael Sipster.
It converts a given context free language to an equivalent language in Chomsky normal form.

Input a context free language

Uppercase letters are assumed to be variables/non-terminals, any other symbol is considered to be a terminal (lowercase letters, numbers, symbols, etc).

The converter will make absolutely no attempt to validate your input or handle errors gracefully.