ACM Computing Surveys (CSUR)
Practical syntactic error recovery
Communications of the ACM
Communications of the ACM
Systematic Programming: An Introduction
Systematic Programming: An Introduction
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
A practical method for LR and LL syntactic error diagnosis and recovery
ACM Transactions on Programming Languages and Systems (TOPLAS)
An LR substring parser for noncorrecting syntax error recovery
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
A bibliography on syntax error handling in context free languages
ACM SIGPLAN Notices
Controlled grammatic ambiguity
ACM Transactions on Programming Languages and Systems (TOPLAS)
A portable syntactic error recovery scheme for LR(1) parsers
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Drive Parsers
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Construction of Stack-Controlling LR Parsers for Regular Right Part Grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Syntax-Error-Handling Technique and Its Experimental Analysis
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
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Repairing syntax errors in LR parsers
ACM Transactions on Programming Languages and Systems (TOPLAS)
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
Global context recovery: A new strategy for parser recovery from syntax errors
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
A practical method for syntactic error diagnosis and recovery
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
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
Practical Scope Recovery Using Bridge Parsing
Software Language Engineering
Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications
Natural and flexible error recovery for generated parsers
SLE'09 Proceedings of the Second international conference on Software Language Engineering
On the role of error productions in syntactic error correction
Computer Languages
LR techniques for handling syntax errors
Computer Languages
A statistical analysis of syntax errors
Computer Languages
Error handling in a parallel LR substring parser
Computer Languages
Automated evaluation of syntax error recovery
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
Natural and Flexible Error Recovery for Generated Modular Language Environments
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
A "forward move algorithm", and some of its formal properties, is presented for use in a practical syntactic error recovery scheme for LR parsers. The algorithm finds "valid fragment" (comparable to a valid prefix) just to the right of a point of error detection. For expositional purposes the algorithm is presented as parsing arbitrarily far beyond the point of error detection in a "parallel" mode, as long as all parses agree on the read or reduce action to be taken at each parse step. In practice the forward move is achieved serially by adding "recovery states" to the LR machine. Based on the formal properties of the forward move we propose an error recovery algorithm that uses the accumulated right context. The performance of the recovery algorithm is illustrated in a specific case and discussed in general.