With left-branching and right-branching recursive partitionings, parsing tends to be faster than with the other recursive partitionings.
in many cases we do not observe the predicted asymptotic differences, which may be due to larger grammar sizes.