1. The problem statement, all variables and given/known data Grammar 'G' is any context-free grammar without any λ productions or unit productions. Let k be the max number of symbols on the right side of any production in P. Prove that there's an equivalent grammar in Chomsky Normal Form with no more than (k − 1)|P| + |T| production rules. 3. The attempt at a solution There isn't a single similar proof to this anywhere on the internet. There are a lot of basic proofs like proving any CFG can be converted to CNF but nothing this involved. None of the proofs in my textbook involve minimizing production rules either. Productions in CNF can only be like A -> BC or A- > a, so this would be a factor. I dunno what else to do, should this proof be constructive or inductive?