Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Crafting a compiler
Programming for artificial intelligence: methods, tools and applications
Programming for artificial intelligence: methods, tools and applications
A simple, fast, and effective LL(1) error repair algorithm
Acta Informatica
Locally Least-Cost Error Recovery in Earley's Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Syntax-directed least-errors analysis for context-free languages: a practical approach
Communications of the ACM
An error-correcting parse algorithm
Communications of the ACM
Automatic Correction of Syntax Errors in Programming Languages
Automatic Correction of Syntax Errors in Programming Languages
Error detection and recovery for syntax directed compiler systems
Error detection and recovery for syntax directed compiler systems
Syntax-directed error recovery for compilers
Syntax-directed error recovery for compilers
Locally least-cost error correctors for context-free and context-sensitive parsers.
Locally least-cost error correctors for context-free and context-sensitive parsers.
On failure of the pruning technique in “Error repair in shift-reduce parsers”
ACM Transactions on Programming Languages and Systems (TOPLAS)
Error repair with validation in LR-based parsing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Repairing syntax errors in LR-based parsers
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Regional Least-Cost Error Repair
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
MEET DB2: automated database migration evaluation
Proceedings of the VLDB Endowment
Natural and Flexible Error Recovery for Generated Modular Language Environments
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.02 |
Local error repair of strings during CFG parsing requires the insertion and deletion of symbols in the region of a syntax error to produce a string that is error free. Rather than precalculating tables at parser generation time to assist in finding such repairs, this article shows how such repairs can be found during shift-reduce parsing by using the parsing tables themselves. This results in a substantial space saving over methods that require precalculated tables. Furthermore, the article shows how the method can be integrated with lookahead to avoid finding repairs that immediately result in further syntax errors. The article presents the results of experiments on a version of the LALR(1)-based parser generator Bison to which the algorithm was added.