Noncorrecting syntax error recovery
- 1 July 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 7 (3) , 478-489
- https://doi.org/10.1145/3916.4019
Abstract
A parser must be able to continue parsing after encountering a syntactic error to check the remainder of the input. To achieve this, it is not necessary to perform corrections on either the input text or the stack contents. A formal framework is provided in which noncorrecting syntax error recovery concepts are defined and investigated. The simplicity of these concepts allows the statement of provable properties, such as the absence of spurious error messages or the avoidance of skipping input text. These properties are due to the fact that no assumptions about the nature of the errors need be made to continue parsing.Keywords
This publication has 5 references indexed in Scilit:
- Locally Least-Cost Error Recovery in Earley's AlgorithmACM Transactions on Programming Languages and Systems, 1981
- Methods for the automatic construction of error correcting parsersActa Informatica, 1980
- Error recovery for Simple LR(k) parsersPublished by Association for Computing Machinery (ACM) ,1976
- Syntax-directed least-errors analysis for context-free languagesCommunications of the ACM, 1974
- Bounded context syntactic analysisCommunications of the ACM, 1964