An Alternative Formulation of Cocke-Younger-Kasami's Algorithm
P.R.J. Asveld · University of Twente Research Information · 1993
We provide a reformulation of Cocke-Younger-Kasami's algorithm for recognizing context-free languages in which there are no references either to indices of table entries or to the length of the input string. Some top-down analogues of this functional approach are discussed as well.