A new analysis of LALR formalisms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient computation of the locally least-cost insertion string for the LR error repair
Information Processing Letters
Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
Parsing theory volume 2: LR(K) and LL(K) parsing
Parsing theory volume 2: LR(K) and LL(K) parsing
A simple, fast, and effective LL(1) error repair algorithm
Acta Informatica
An efficient computation of right context for LR-based error repair
Information Processing Letters
Error repair in shift-reduce parsers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Computation of LALR(1) Look-Ahead Sets
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)
A forward move algorithm for LL and LR parsers
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Generalizing recognition of an individual dialect in program analysis and transformation
Proceedings of the 2007 ACM symposium on Applied computing
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
| Hi-index | 0.00 |
When the compiler encounters an error symbol in an erroneous input, the local error-repair method repairs the input by either inserting a repair string before the error symbol or deleting the error symbol. Although the extended FMQ of Fischer et al. and the method of McKenzie et al. report the improved quality of diagnostic messages, they suffer from redundant parse stack configurations.This article proposes an efficient LR error-recovery method, with validation-removing repairs that give the same validation result as a previously considered, lower-cost repair. Moreover, its execution speed is proportional to the length of the stack configuration. The algorithm is implemented on a Bison, GNU LALR(1), parser generating system. Experimental results are presented.