\emph{Parsing} is the search for a derivation tree for a given word.

    For context-free grammars, 
    parsing is possible in \alert{$O(|w|^3)$} time.\\
    (Here $|w|$ is the length of the input word.)
  For every context-free grammar $G$:
      there exists an algorithm and $C \ge 0$ such that  
    \item for every word $w$,
          the algorithm determines in at most 
            \alert{$C \cdot |w|^3$ steps}
          whether $w \in L(G)$ and a derivation tree if $w \in L(G)$.