@techreport{R-88-09, TITLE = {Incremental Symbol Processing}, AUTHOR = {Peter Fritzson}, YEAR = {1988}, NUMBER = {R-88-09}, INSTITUTION = ida, ADDRESS = idaaddr, ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-88-09+abstr}, ABSTRACT = {This paper introduces a general entity-relational model for incremental symbol processing. Previous models have either been non-incremental, or if incremental they have usually been language-specific, or too simple to handle complex languages. 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 difference between incremental symbol processing and symbol processing in conventional compilers is also discussed in the paper.}, IDANR = {LiTH-IDA-R-88-09}