Why automatic error correctors fail

Authors:
Charles Wetherell
Affiliations:
Computing Science Group, Department of Applied Science, University of California at Davis, P.O. Box 808, L-714, Livermore, CA 94550, U.S.A.
Venue:
Computer Languages
Year:
1977

Citing 6
Cited 1

Practical syntactic error recovery

Communications of the ACM
Design and implementation of a diagnostic compiler for PL/I

Communications of the ACM
Simple LR(k) grammars

Communications of the ACM
CORC—the Cornell computing language

Communications of the ACM
Formal languages and their relation to automata

Formal languages and their relation to automata
Error correction in CORC: the Cornell Computing Language

AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I

A statistical analysis of syntax errors

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Automatic table-driven parsers often include syntactic error correctors. Such correctors must fail on a large set of languages and the failing cases are not particularly pathological. Instead of striving for ''perfect'' correctors, compiler writers should study the error patterns of the source language and work for efficient correction of common errors.