Abstract
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.
This research was supported by the National Swedish Board for Technical Development
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
United States Department of Defense, “Reference Manual for the Ada Programming Language”, ANSI/MIL-STD-1815A/1983, February 17, 1983.
Rolf Bahlke, Gregor Snelting: “The PSG System: From Formal Language Definitions to Interactive Programming Environments”, TOPLAS Vol 8, No 4, October 1986.
T. P. Baker: “A One-Pass Algorithm for Overload Resolution in Ada”, ACM TRansactions on Programming Languages and Systems, Vol. 4, No 4, Oct. 1982, pp 601–614.
G M Birtwistle, O-J Dahl, B Myhrhaug, K Nygaard: “Simula Begin”, 391 pp, AUERBACH Publishers Inc, Philadelpia, Pa., 1973.
Peter Pin-Shan Chen “The Entity-Relationship Model — Towards a Unified View of Data”, ACM Transactions on Database Systems, Vol. 1, No. 1, March 1976.
Reidar Conradi and Dag Wanvik, “Mechanisms and Tools for Separate Compilation”, Technical Report No 25/85, Nov 1985, The University of Trondheim, Division of Computer Science, N-7034 Trondheim-NTH.
Peter Fritzson, “Symbolic Debugging Through Incremental Compilation in an Integrated Environment”, The Journal of Systems and Software 3, 285–294 (1983).
“The Architecture of an Incremental Programming Environment and some Notions of Consistency” Workshop on Software Engineering Environments for Programming-in-the-Large, Harwichport, Massachusetts, June 9–12, 1985.
Allen Goldberg and Gordon Kotik: “Knowledge-Based Programming: An Overview of Data Structure Selection and Control Structure Refinement”, KES.U.83.7, November 1983, Kestrel Institute, 1801 Page Mill Road, Palo Alto, CA 94304. Also in: Software Validation, H.L. Hausen, Ed., North-Holland, 1984.
Samuel P. Harbison and Guy L. Steele Jr., “C — A Reference Manual”, Prentice-Hall, 1984.
Roger Hoover: “Dynamically Bypassing Copy Rule Chains in Attribute Grammars”, 13:th Annual ACM Symposium on the Principles of Programming Languages, St. Petersburg, Florida, Jan 1986.
Susan Horwitz, Tim Teitelbaum: “Generating Editing Environments Based on Relations and Attributes”, ACM Transactions on Programming Languages and Systems, Vol. 8, No. 4, October 1986.
M. A. Linton: “Implementing Relational Views of Programs” In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments (Pittsburgh, Pa., April 1984), ACM New York, 132–140.
Robert Paige, Shaye Koenig: “Finite Differencing of Computable Expressions”, TOPLAS 4.3, July 1982, pp 402–454.
“Private communication on the Rational Incremental Ada Compiler” Rational, 1501 Salado Drive, Mountain View, California 94043.
James E. Archer, Michael T. Devlin: “Rationals Experience Using Ada for Very Large Systems”, Proc of the First International Conference on Ada Programming Language Applications for the NASA Space Station, Houston, Texas, June 2–5, 1986.
Reasoning Systems: “RefineTM User's Guide”, Version 2.0, September 1987. Reasoning Systems Inc., 1801 Page Mill Rd., Palo Alto, CA 94304.
Steven P. Reiss, “Generation of Compiler Symbol Processing Mechanisms from Specifications”, ACM TOPLAS 5.2 April 1983.
Thomas W. Reps: “Generating Language-Based Environments”, The MIT Press, Massachusetts Institute of Technology, Cambridge, Massachusets 02142
Douglas Smith, Gordon Kotik, Stephen Westfold: “Research on Knowledge-Based Software Environments at Kestrel Institute”, IEEE Trans. on Software Engineering, Vol SE-11, No 11, Nov 1985.
J. Uhl, S. Drossopoulou, G. Persch, G. Goos, M. Dausmann, G. Winterstein, W. Kirchgässner: “An Attribute Grammar for the Semantic Analysis of Ada”, IX, 511 pages, Lecture Notes in Computer Science, Springer Verlag, 1982.
Stanley B. Zdonik and Peter Wegner, “A Database Approach to Languages, Libraries and Environments”, Workshop on Software Engineering Environments for Programming-in-the-Large, Harwichport, Massachusetts, June 9–12, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-51364-7_2
Download citation
DOI: https://doi.org/10.1007/3-540-51364-7_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51364-3
Online ISBN: 978-3-540-46200-2
eBook Packages: Springer Book Archive