Given a grammar in CNF, we can prove that for a sentence of length n, the number of derivation steps for a shift reduce parser is 3n − 1.
our tagset-preserving transformation also introduces rules of the form (b), which explains why the number of derivation steps may vary from 2n − 1 to 3n − 1.