article

Automatic correction of syntax-errors in programming languages

Author:

J. -P. LévyAuthors Info & Claims

Acta Informatica, Volume 4, Issue 3

Pages 271 - 292

https://doi.org/10.1007/BF00288730

Published: 01 September 1975 Publication History

Abstract

A formal model for automatic error-correction is presented. It considers clusters of errors, using a local context to determine the corrections. The process can be embedded in left-to-right recognizers. The recognizer is used for standard syntax checking. When an error is detected, an error correction mechanism is activated which, by a limited backward then forward move, determines the possible corrections. An important aspect of this process is that it does not slow down the parsing of correct programs.

References

[1]

Conway, M. E.: Design of a separable transition diagram compiler. Comm. ACM 6, 396---408 (1963)

Digital Library

[2]

Conway, R. W., Maxwell, W. L.: CORC, the Cornell computing language. Comm. ACM 6, 317---321 (1963)

Digital Library

[3]

Conway, R. W., Wilcox, T. R.: Design and implementation of a diagnostic compiler PL/1. Comm. ACM 16, 169---179 (1973)

Digital Library

[4]

Conway, R. W. et al.: PL/C. A high performance subset of PL/1. Cornell University, Department of Computer Science, TR 70-55, 1970

[5]

DeRemer, F. L.: Simple LR(k) grammars. Comm. ACM 14, 453---460 (1971)

Digital Library

[6]

Earley, J.: An efficient context-free parsing algorithm. Comm. ACM 13, 94---102 (1970)

Digital Library

[7]

Feldman, J., Gries, D.: Translator writing systems. Comm. ACM 11, 77---113 (1968)

Digital Library

[8]

Ginsburg, S., Greibach, S., Hopcroft, J. E.: Studies in Abstract Families of Languages. Memoirs of the American Mathematical Society, No. 87, Providence (R.I.): American Mathematical Society 1969

[9]

Gries, D.: Compiler construction for digital computers. New York-London: J. Wíley and Sons 1971

[10]

Hamming, R. W.: Error-detecting and error-correcting codes. Bell System Technical Journal 29, 147---160 (1950)

[11]

Hopcroft, J. E., Ullman, J. D.: An approach to a unified theory of automata. Bell System Technical Journal 46, 1793---1829 (1967)

[12]

Hopcroft, J. E., Ullman, J. D.: Formal languages and their relation to automata. Reading (Mass.): Addison-Wesley 1969

[13]

Lévy, J.-P.: Automatic correction of syntax errors in programming languages. Cornell University, Department of Computer Science, Ph. D. thesis, December 1971

[14]

Lyon, G.: Syntax-directed least error analysis for context-free languages: A practical approach. Comm. ACM 17, 3---14 (1974)

Digital Library

[15]

Morgan, H. L.: Spelling correction in system programs. Comm. ACM 13, 90---94 (1970)

Digital Library

[16]

Tixer, V.: Recursive functions of regular expressions in language analysis. Stanford University, Department of Computer Science, Technical Report CS 58, March 1967

[17]

Wagner, R.: Order-n correction for regular languages. Comm. ACM 17, 265---268 (1974)

Digital Library

[18]

Walker, R. J.: An instruction manual for CUPL. Cornell University, Department of Computer Science, July 1967

[19]

Wilcox, T. R.: Generating machine code for high level programming languages. Cornell University, Department of Computer Science, Ph. D. thesis, September 1971

Cited By

ADORNI GPOGGI AFERRARI G(1997)Attribute grammars as a robust technical basis for a human-computer interaction general purpose architectureInternational Journal of Human-Computer Studies10.1006/ijhc.1997.014647:4(531-563)Online publication date: 1-Oct-1997
https://dl.acm.org/doi/10.1006/ijhc.1997.0146
Mauney JFischer C(1982)A forward move algorithm for LL and LR parsersACM SIGPLAN Notices10.1145/872726.80698217:6(79-87)Online publication date: 1-Jun-1982
https://dl.acm.org/doi/10.1145/872726.806982
Mauney JFischer CWhite JAllen F(1982)A forward move algorithm for LL and LR parsersProceedings of the 1982 SIGPLAN symposium on Compiler construction10.1145/800230.806982(79-87)Online publication date: 23-Jun-1982
https://dl.acm.org/doi/10.1145/800230.806982
Show More Cited By

Index Terms

Automatic correction of syntax-errors in programming languages
1. Theory of computation
  1. Formal languages and automata theory

Index terms have been assigned to the content through auto-classification.

Recommendations

Automatic Correction of Syntax Errors in Programming Languages
Locally minimum-distance correction of syntax errors in programming languages
ACM '80: Proceedings of the ACM 1980 annual conference

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 ...
Stochastic Syntax-Directed Translation Schemata for Correction of Errors in Context-Free Languages

A formal method of correcting errors of changed, deleted, and inserted terminals in the strings of a context-free language is considered. Grammars generating strings containing these errors are first constructed from a known grammar for the language; ...

Comments

Information & Contributors

Information

Published In

cover image Acta Informatica

Acta Informatica Volume 4, Issue 3

September 1975

88 pages

ISSN:0001-5903

Issue’s Table of Contents

Copyright © Copyright © 1975 Springer-Verlag.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 September 1975

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

ADORNI GPOGGI AFERRARI G(1997)Attribute grammars as a robust technical basis for a human-computer interaction general purpose architectureInternational Journal of Human-Computer Studies10.1006/ijhc.1997.014647:4(531-563)Online publication date: 1-Oct-1997
https://dl.acm.org/doi/10.1006/ijhc.1997.0146
Mauney JFischer C(1982)A forward move algorithm for LL and LR parsersACM SIGPLAN Notices10.1145/872726.80698217:6(79-87)Online publication date: 1-Jun-1982
https://dl.acm.org/doi/10.1145/872726.806982
Mauney JFischer CWhite JAllen F(1982)A forward move algorithm for LL and LR parsersProceedings of the 1982 SIGPLAN symposium on Compiler construction10.1145/800230.806982(79-87)Online publication date: 23-Jun-1982
https://dl.acm.org/doi/10.1145/800230.806982
Tai KBradshaw CSherman G(1980)Locally minimum-distance correction of syntax errors in programming languagesProceedings of the ACM 1980 annual conference10.1145/800176.809969(204-210)Online publication date: 1-Jan-1980
https://dl.acm.org/doi/10.1145/800176.809969
Tai K(1980)Predictors of Context-Free GrammarsSIAM Journal on Computing10.1137/02090499:3(653-664)Online publication date: 1-Aug-1980
https://dl.acm.org/doi/10.1137/0209049
Tanaka EKing-Sun Fu (1978)Error-Correcting Parsers for Formal LanguagesIEEE Transactions on Computers10.1109/TC.1978.167516027:7(605-616)Online publication date: 1-Jul-1978
https://dl.acm.org/doi/10.1109/TC.1978.1675160
Lewi JVlaminck KHuens JHuybrechts M(1978)The ELL(1) parser generator and the error recovery mechanismActa Informatica10.1007/BF0026431710:3(209-228)Online publication date: 1-Sep-1978
https://dl.acm.org/doi/10.1007/BF00264317

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents