The String-to-String Correction Problem
Journal of the ACM (JACM)
An Extension of the String-to-String Correction Problem
Journal of the ACM (JACM)
Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Drive Parsers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic error recovery for LR parsers
Communications of the ACM
Syntax-directed least-errors analysis for context-free languages: a practical approach
Communications of the ACM
Practical syntactic error recovery
Communications of the ACM
Design and implementation of a diagnostic compiler for PL/I
Communications of the ACM
An error-correcting parse algorithm
Communications of the ACM
A forward move algorithm for LR error recovery
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Compiler Construction for Digital Computers
Compiler Construction for Digital Computers
On the complexity of the Extended String-to-String Correction Problem
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
Fault-tolerant string processing by pattern mapping
ACM '77 Proceedings of the 1977 annual conference
A bibliography on syntax error handling in context free languages
ACM SIGPLAN Notices
| Hi-index | 0.00 |
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. Several previous error correction methods are shown to be special cases of this model. A general algorithm for this model is given. An efficient LL(1) error correction algorithm for this model is also provided. Possible extensions of this model and future research are discussed.