It can be shown that for any context$-$free grammar, we can create parser that runs in time.

$O(n^3)$

$O(n^2)$

$O(nlogn)$

$O(n)$