On failure of the pruning technique in “Error repair in shift-reduce parsers”

Authors:
Eberhard Bertsch;Mark-Jan Nederhof
Affiliations:
Ruhr Univ., Bochum, Germany;Univ. of Groningen, Groningen, The Netherlands
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1999

Citing 4
Cited 1

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Error repair in shift-reduce parsers

ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm

Communications of the ACM
The Java Language Specification

The Java Language Specification

Regional Least-Cost Error Repair

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

A previous article presented a technique to compute the least-cost error repair by incrementally generating configurations that result from inserting and deleting tokens a syntactically incorrect input. An additional mechanism to improve the run-time efficiency of this algorithm by pruning some of the configurations was discussed as well. In this communication we show that the pruning mechanism may lead to suboptimal repairs or may block all repairs. Certain grammatical errors in a common construct of the Java programming language also lead to the above kind of failure.