Eberhard Bertsch

Learn More
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(More)
We discuss a bottom-up parsing technique based on delayed reductions, and investigate its capabilities and limitations. Some non-LR(k) grammars, for any k, are handled deterministically by this method. Surprisingly, and counter-intuitively from the viewpoint of LR(k), increase of delay may lead to decrease of determinism. We also present a variant that uses(More)