In other words, there can be a production which can be binarized with a parsing complexity that is minimal while its fan-out is sub-optimal.
we focus on parsing complexity rather than fan-out in this work, since parsing complexity determines the actual time complexity of parsing with a grammar.