The computational complexity of the resulting parser is polynomial in the length of the input string, with the degree of the polynomial being the number of distinct endpoints in the most complex production.
for input of length n, the complexity is O(n c ) for some constant c which depends on the grammar.