Locally minimum-distance correction of syntax errors in programming languages
Kuo‐Chung Tai · 1980
A formal model for locally minimum-distance correction of syntax errors is presented. This model is based on the assumption that errors occur in clusters which are separated by at least k correct symbols. Even if the assumption fails, this model can still be applied to produce a syntactically correct program from any input string. The value of k can be chosen by the programmer. A larger k reduces the chance that the correction made for one cluster of errors causes spurious errors in the remaining input.