Syntax-directed least-errors analysis for context-free languages
- 1 January 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 17 (1) , 3-14
- https://doi.org/10.1145/360767.360771
Abstract
A least-errors recognizer is developed informally using the well-known recognizer of Earley, along with elements of Bellman's dynamic programming. The analyzer takes a general class of context-free grammars as drivers, and any finite string as input. Recognition consists of a least-errors count for a corrected version of the input relative to the driver grammar. The algorithm design emphasizes practical aspects which help in programming it.Keywords
This publication has 10 references indexed in Scilit:
- Context-free error analysis by evaluation of algebraic power seriesPublished by Association for Computing Machinery (ACM) ,1973
- Adaptive correction of program statementsCommunications of the ACM, 1973
- Formal development of correct algorithmsACM SIGACT News, 1972
- Optimization of error recovery in syntax-directed parsing algorithmsACM SIGPLAN Notices, 1970
- An efficient context-free parsing algorithmCommunications of the ACM, 1970
- Translator writing systemsCommunications of the ACM, 1968
- Recognition and parsing of context-free languages in time n3Information and Control, 1967
- EULERCommunications of the ACM, 1966
- An error-correcting parse algorithmCommunications of the ACM, 1963
- Design of a separable transition-diagram compilerCommunications of the ACM, 1963