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.
|Number of pages||4|
|Journal||Bulletin of the European Association for Theoretical Computer Science|
|Publication status||Published - 1994|
- HMI-SLT: Speech and Language Technology
- Context-free grammar
- Normal form