  We continue our study of ordered context-free grammars, a grammar formalism
that places an order on the parse trees produced by the corresponding
context-free grammar. In particular, we simplify our previous definition of a
derivation of a string for a given ordered context-free grammar, and present a
parsing algorithm, using shared packed parse forests, with time complexity
O(n^4), where n is the length of the input string being parsed.
