Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
A practical method for LR and LL syntactic error diagnosis and recovery
ACM Transactions on Programming Languages and Systems (TOPLAS)
Crafting a compiler
Compiler design in C
UNIX Vol. II
A simple, fast, and effective LL(1) error repair algorithm
Acta Informatica
A practical minimum distance method for syntax error handling
Computer Languages
Very fast YACC-compatible parsers (for very little effort)
Software—Practice & Experience
The String-to-String Correction Problem
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Locally Least-Cost Error Recovery in Earley's Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic error recovery for LR parsers
Communications of the ACM
Practical syntactic error recovery
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
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Practical error recovery in LR parsing
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Locally least-cost error correctors for context-free and context-sensitive parsers.
Locally least-cost error correctors for context-free and context-sensitive parsers.
Least-cost syntactic error repair using extended right context
Least-cost syntactic error repair using extended right context
A General Method for Transforming Standard Parsers into Error-Repair Parsers
CICLing '09 Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing
Theoretical Computer Science
Natural and Flexible Error Recovery for Generated Modular Language Environments
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
This article reports on an error-repair algorithm for LR parsers. It locally inserts, deletes or shifts symbols at the positions where errors are detected, thus modifying the right context in order to resume parsing on a valid piece of input. This method improves on others in that it does not require the user to provide additional information about the repair process, it does not require precalculation of auxiliary tables, and it can be easily integrated into existing LR parser generators. A Yacc-based implementation is presented along with some experimental results and comparisons with other well-known methods.