Abstract
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.
Similar content being viewed by others
References
Fischer, C.N., Mauney, J.: A simple, fast, and effective LL(1) error repair algorithm. Acta Inf.29, 109–120 (1992)
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)
Graham, S.L., Haley, C.B., Joy, W.N.: Practical LR error recovery. SIGPLAN Not.14, 168–175 (1979)
Mauney, J.: Least-cost error repair using extended right context. PhD. Thesis, University of Wisconsin (1983)
Nederhof, M.J., Bertsch, E.: Linear-time suffix recognition for deterministic languages (submitted for publication)
Sippu, S., Soisalon-Soininen, E.: Parsing Theory. Berlin: Springer, Vol. I (1988); Vol. II (1990)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bertsch, E. An observation on suffix redundancy in LL(1) error repair. Acta Informatica 33, 631–639 (1996). https://doi.org/10.1007/BF03036468
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF03036468