Abstract
The paper describes a new, declarative method for the formal specification of visibility rules. In contrast to common methods that are based on the specification of a symboltable (or environment), of appropriate update operations and of passing rules, the presented method is related to visibility descriptions in language reports. It consists of three steps: First, the program entities are specified, i.e. the candidates for the meaning of an identifier; the next step defines the ranges where the program entities are valid or hidden; finally, visibility is expressed in terms of these ranges. To formally define the semantics of these visibility specifications, a modeltheoretic view of abstract syntaxtrees is sketched. Using this framework, we give a fixpoint semantics for such specifications.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
ANSI. Pascal Computer Programming Language, ansi/ieee 770 x3.97-1983 edition, 1983.
H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.
Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Annals of pure and applied logic, 32, 1986.
N. D. Jones, editor. Semantics-Directed Compiler Generation, volume 94 of Lecture Notes in Computer Science. Springer Verlag, 1980.
M. Odersky. A New Approach to Formal Language Definition and its Application to Oberon. PhD thesis, Swiss Federal Institute of Technology (ETH) Zürich, 1989. Diss. ETH No. 8938.
A. Poetzsch-Heffter. Context-dependent Syntax of programming languages: A New Specification Method and its Application. PhD thesis, Technische Universität München, 1991. (to appear in german).
S. Reiss. Generation of compiler symbol processing mechanisms from specifications. ACM Transactions on Programming Languages and Systems, 5(2), 1983.
G. Snelting and W. Henhapl. Unification in many-sorted algebras as a device for incremental semantic analysis. Conference Record of the Thirteenth ACM Symposium on Principles of Programming Languages, 1986.
A. Tarski. A lattice-theoretical fixpoint theorem and its application. Pacific Journal of Mathematics, 5, 1955.
J. Uhl and andere. An Attribute Grammar for the Semantic Analysis of Ada. Lecture Notes in Computer Science 139, 1982.
J. Uhl. Spezifikation von Programmiersprachen und Übersetzern, volume 161 of GMD-Bericht. R. Oldenbourg Verlag, 1986.
D. A. Watt. Contextual constraints. In B. Lorho, editor, Methods and Tools for Compiler Construction, pages 45–80. Cambridge University Press, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poetzsch-Heffter, A. (1991). Logic-based specification of visibility rules. In: Maluszyński, J., Wirsing, M. (eds) Programming Language Implementation and Logic Programming. PLILP 1991. Lecture Notes in Computer Science, vol 528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54444-5_88
Download citation
DOI: https://doi.org/10.1007/3-540-54444-5_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54444-9
Online ISBN: 978-3-540-38362-8
eBook Packages: Springer Book Archive