Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
A simple, fast, and effective LL(1) error repair algorithm
Acta Informatica
Error repair in shift-reduce parsers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Java Software Solutions: Foundations of Program Design with Cdrom
Java Software Solutions: Foundations of Program Design with Cdrom
Automatic error recovery for lr parsers in theory and practice (syntax errors, parsers)
Automatic error recovery for lr parsers in theory and practice (syntax errors, parsers)
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 |
When a compiler encounters a syntax error, it usually attempts to restart parsing to check the remainder of the input for any further errors. One common method of recovering from syntax errors is to repair the incorrect input string, allowing parsing to continue. This research presents a language independent method for repairing the input string to an LALR(1) parser. The method results in much faster repairs in general than an existing method, enabling some errors to be repaired that were previously too costly. Results are based on repairing syntax errors in Java programs from first year computer science students.