Dynamic programming parsing algorithms for PCFGs require O(m 2 ) dynamic programming states, where m is the length of the sentence, so an n-best parsing algorithm requires O(nm 2 ).
things get much worse when the grammar is bilexicalized.