thus inheriting its complexity upper bound of ''O''(n^2.3728596).Conversely, Lillian Lee has shown O(n^3-?) Boolean matrix multiplication to be reducible to O(n^3-3?) CFG parsing, thus establishing some kind of lower bound for the latter.

Practical uses of context-free languages require also to produce a derivation tree that exhibits the structure that the grammar associates with the given string. The process