Incremental symbol processing

  • Peter Fritzson
Conference paper

DOI: 10.1007/3-540-51364-7_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 371)
Cite this paper as:
Fritzson P. (1989) Incremental symbol processing. In: Hammer D. (eds) Compiler Compilers and High Speed Compilation. CCHSC 1988. Lecture Notes in Computer Science, vol 371. Springer, Berlin, Heidelberg


This paper introduces a novel entity-relational model for incremental symbol processing. This model forms the basis for the generation of efficient symbol processing mechanisms from high-level declarative specifications and query expressions, using program transformation techniques such as data type refinement.

The model is conceptually simple, but powerful enough to model languages of the complexity of Ada. The new model is compared to earlier, more restricted, incremental hierarchical symbol table models. The differences between symbol processing in conventional compilers and incremental symbol processing are also discussed.

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Peter Fritzson
    • 1
  1. 1.Department of Computer and Information ScienceLinköping UniversityLinköpingSweden

Personalised recommendations