Automatic error recovery for LR parsers
Communications of the ACM
Syntax-directed least-errors analysis for context-free languages: a practical approach
Communications of the ACM
Practical syntactic error recovery
Communications of the ACM
An efficient context-free parsing algorithm
Communications of the ACM
A forward move algorithm for LR error recovery
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An efficient insertion-only error-corrector for LL(1) parsers
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
Automatic correction of syntax errors in programming languages
Automatic correction of syntax errors in programming languages
Syntax driven error recovery in top-down parsing.
Syntax driven error recovery in top-down parsing.
Determining the extent of lookahead in syntactic error repair
ACM Transactions on Programming Languages and Systems (TOPLAS)
A bibliography on syntax error handling in context free languages
ACM SIGPLAN Notices
A Syntax-Error-Handling Technique and Its Experimental Analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery
ACM Transactions on Programming Languages and Systems (TOPLAS)
Practical error recovery in LR parsing
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A forward move algorithm for LL and LR parsers
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Locally minimum-distance correction of syntax errors in programming languages
ACM '80 Proceedings of the ACM 1980 annual conference
A formal frame for robust parsing
Theoretical Computer Science - Implementation and application of automata
Robust parsing using dynamic programming
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Natural and flexible error recovery for generated parsers
SLE'09 Proceedings of the Second international conference on Software Language Engineering
LR techniques for handling syntax errors
Computer Languages
Error handling in a parallel LR substring parser
Computer Languages
Improving IDE recommendations by considering global implications of existing recommendations
Proceedings of the 34th International Conference on Software Engineering
Natural and Flexible Error Recovery for Generated Modular Language Environments
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
Described is a method for syntactic error recovery that is compatible with deterministic parsing methods and that is able to recover from many errors more quickly than do other schemes because it performs global context recovery. The method relies on fiducial symbols, which are typically reserved key words of a language, to provide mileposts for error recovery. The method has been applied to LL(1) parsers, for which a detailed algorithm is given, and informally proved correct. The algorithm will always recover and return control to the parser if the text being analyzed satisfies only minimal requirements: that it contains one or more occurrences of fiducial symbols following the point at which an error is detected. Tables needed for error recovery have been automatically generated, along with parsing tables, by a parser constructor for the LL(1) grammars.A theoretical characterization of fiducial symbols is given, and the utility of this characterization in practice is discussed. It has been applied to a grammar for the programming language Pascal to aid in selection of a set of fiducial symbols. The error recovery scheme has been tested on a set of student-written Pascal program texts and is compared with other error recovery strategies.