This leaves open the possibility of the existence of an algorithm that is polynomial in the grammar size but has an additional exponential term in the time complexity expression.
such an algorithm, if it exists, cannot be generated by application of the GHR optimization to the baseline parser.