Syntax-directed least-errors analysis for context-free languages: a practical approach
Communications of the ACM
Practical syntactic error recovery
Communications of the ACM
Design and implementation of a diagnostic compiler for PL/I
Communications of the ACM
Use of transition matrices in compiling
Communications of the ACM
An error-correcting parse algorithm
Communications of the ACM
Compiler Design Theory
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Compiler Construction for Digital Computers
Compiler Construction for Digital Computers
Context-free error analysis by evaluation of algebraic power series
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Error detection and recovery for syntax directed compiler systems
Error detection and recovery for syntax directed compiler systems
Automatic correction of syntax errors in programming languages
Automatic correction of syntax errors in programming languages
Syntax-directed error recovery for compilers
Syntax-directed error recovery for compilers
Syntax error detection, correction and recovery in parsers
Syntax error detection, correction and recovery in parsers
A bibliography on syntax error handling in context free languages
ACM SIGPLAN Notices
Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Drive Parsers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Locally Least-Cost Error Recovery in Earley's Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
A simple recovery-only procedure for simple precedence parsers
Communications of the ACM
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
| Hi-index | 0.02 |
An LL(1)-based error-corrector which operates by "insertion-only" is studied. The corrector is able to correct and parse any input string. It is efficient (linear in space and time requirements) and chooses least-cost insertions (as defined by the user) in correcting syntax errors. Moreover, the error-corrector can be generated automatically from the grammar and a table of terminal symbol insertion costs. The class of LL(1) grammars correctable by this method contains (with minor modifications) grammars used to specify most common programming languages. Preliminary results suggest that this method can be used to advantage in LL(1)-driven compilers.