Acta Informatica

, Volume 33, Issue 5, pp 631–639 | Cite as

An observation on suffix redundancy in LL(1) error repair



We give a simple grammatical characterization of the notion of suffix redundancy presented procedurally in a recent article by Fischer and Mauney. It is shown that certain properties of grammars related to suffix redundancy can be decided at parser generation time. Some suggestions concerning efficiency of repair attempts conclude the article.


Terminal Symbol Parse Time Regular Grammar Repair Attempt Error Repair 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Fischer, C.N., Mauney, J.: A simple, fast, and effective LL(1) error repair algorithm. Acta Inf.29, 109–120 (1992)MATHCrossRefGoogle Scholar
  2. [2]
    Fischer, C.N., Milton, D.R., Quiring, S.B.: Efficient LL(1) error correction and recovery using only insertions. Acta Inf.13, 141–154 (1980)MATHMathSciNetGoogle Scholar
  3. [3]
    Graham, S.L., Haley, C.B., Joy, W.N.: Practical LR error recovery. SIGPLAN Not.14, 168–175 (1979)CrossRefGoogle Scholar
  4. [4]
    Mauney, J.: Least-cost error repair using extended right context. PhD. Thesis, University of Wisconsin (1983)Google Scholar
  5. [5]
    Nederhof, M.J., Bertsch, E.: Linear-time suffix recognition for deterministic languages (submitted for publication)Google Scholar
  6. [6]
    Sippu, S., Soisalon-Soininen, E.: Parsing Theory. Berlin: Springer, Vol. I (1988); Vol. II (1990)MATHGoogle Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  1. 1.Lehrstuhl Praktische Informatik (NA 1-34)Fakultät für Mathematik der Ruhr-UniversitätBochumGermany

Personalised recommendations