Abstract
One of the parts occurring in a compiler generating system is the parser generator module. Our approach to error recovery generation can be considered as an extension of this module such that not only the tables for the syntax analysis but also the tables for error handling are computed. These tables essentially consist of pairs of elements of the alphabet — called braces — which allow — to select a program segment which contains the point of the error and — to determine the reduction goal of the selected program segment.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Literature
Koster, C.H.A.: A Compiler Compiler Mathematisch Centrum Amsterdam MR 127, 1971, AFFIX Grammars. In Peck (Ed.), ALGOL68 Implementation, North Holland 1971
Wilhelm, R.: Syntax und Semantikspezifikation in der Eingabe-sprache für einen Compiler Compiler. Abteilung Mathematik an der Technischen Universität München, Bericht Nr. 7301 System documentation 3.6, Project MUG
Lévy, J-P.: Automatic Correction of Syntax Errors in Programming Languages. Acta Informatica 4, 271–292 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Ciesinger, J. (1976). Generating Error Recovery in a Compiler Generating System. In: Schneider, HJ., Nagl, M. (eds) Programmiersprachen. Informatik-Fachberichte, vol 1. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-66319-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-66319-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07619-3
Online ISBN: 978-3-642-66319-2
eBook Packages: Springer Book Archive