However, even if this cubic time transformation is not performed, we can show that the (theoretical) throughput of the parser for % cannot be less than the throughput of the parser for .
if we consider the parsers for and % and if we recall the end of Section 2, it is easy to show that the degrees, say and g , of their polynomial parse times are such that t ¼ .