Correction: If you want the parse tree, GLR and Earley can have O(n^4) time complexity it seems: http://cstheory.stackexchange.com/questions/22621/complexity-o

Correction: If you want the parse tree, GLR and Earley can have O(n^4) time complexity it seems: http://cstheory.stackexchange.com/questions/22621/complexity-of-a-glr-parser-on-an-ambiguous-grammar http://cstheory.stackexchange.com/questions/22621/complexity...