We know that y ≤ a + b since Y was formed from A and B.
so parsing X → Y C also takes no more time than the original rule X → A B C. By induction over the number of subsets, a rule having any number of subsets on the righthand side can be converted into a series of binary rules.