
8.3 Research Results: Derivation of Recognition Al-
gorithms for CNF Grammars
In this section we demonstrate the derivation of several recognition algorithms for context-
free grammars. The initial specification is a standard mathematical definition for what a
recognition algorithm should do. In several steps of transformation, we derive a variety
of parallel recognizers (see Figure 8.1). In the literature there are two well-known parsing
algorithms. Cocke, Younger and Kasami, independently reported on the development
of a bottom-up parser, called CKY, that works on a restricted form of grammars called
the Chomsky-Normal-Form. Earley publishe ...