Zusammenfassung
Einige notwendige Eigenschaften von Programmen sind nicht durch eine kontextfreie Grammatik beschreibbar. Diese Eigenschaften werden durch Prädikate auf Kontextinformation, sogenannte Kontextbedingungen, beschrieben. Dazu gehören die Deklariertheitseigenschaften und die Typkonsistenz. Beide hängen von den Gültigkeits- und Sichtbarkeitsregeln der Programmiersprache ab.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literaturhinweise
D.A. Watt. Contextual Constraints. In [Lor84], 1984
B.H. Krieg. Formal Definition of the Block Concept and Some Im-plementation Models. MS. Thesis, Cornell University, 1971.
T.J. Penello, F.L. DeRemer, R. Myers. A Simplified Operator Identification Scheme for Ada. In ACM SIGPLAN Notices 15(7,8), pp. 82–87, 1980
R. Hindley. The Principal Type Scheme of an Object in Combinatory Logic. In Transactions of the AMS 146, pp. 29–60, 1969.
R. Milner. A Theory of Type Polymorphism in Programming. In Journal of Computer and System Sciences 17, pp. 348–375, 1978
L.Damas, R. Milner. Principal Type Schemes for Functional Pro- gramms. In 9th ACM Symp. on Principles of Programming Languages, pp. 207–212, 1982.
D.E. Knuth. Semantics of Context free Languages. In Math. Sys-tems Theory 2, pp. 127–145, 1968
D.E. Knuth. Semantics of Context free Languages. Correction in Math. Systems Theory 5, pp. 95–96, 1971
M. Jazayeri, W. Ogden, W. Rounds. The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars. In Communications of the ACM 18, pp. 697–706, 1975.
K. Kennedy, S.K. Warren. Automatic Generation of Efficient Eval- uators for Attribute Grammars. In Proc. 3rd ACM Symp. on Principles of Programming Languages, pp. 32–49, 1976
U. Kastens. Ordered Attribute Grammars. In Acta Informatica 13(3), pp. 229–256, 1980
H. (Riffs) Nielson. Computation Sequences: A Way to Characterize Classes of Attribute Grammars. In Acta Informatica 19, pp. 255268, 1983.
J. Engelfriet, G. Filé. Simple Multi—visit Attribute Grammars. In Journal of Computer and System Sciences 24, pp. 283–314, 1982.
R. Giegerich, R. Wilhelm. Counter-one-pass Features in One-pass Compilation: a Formalization Using Attribute Grammars. In Information Processing Letters 7(6), pp. 279–284, 1978.
D.A. Watt. The Parsing Problem for Affix Grammars. In Acta Informatica 8, pp. 1–20, 1977.
P. Lipps, M. Olk, U. Möncke, R. Wilhelm. Attribute (Re)evaluation in the OPTRAN System. In Acta Informatica 26, pp. 213–239, 1988.
B. Courcelle. Attribute Grammars: Definitions, Analysis of Depen- dencies. In [Lor84], 1984
J. Engelfriet. Attribute Grammars: Attribute Evaluation Methods. In [Lor84], 1984
H. Alblas. Attribute Evaluation Methods. In H. Alblas, B. Melichar (Hrsg.), Proc. International Summer School on Attribute Grammars, Applications and Systems, LNCS 545. Springer, 1991.
P.Deransart, M. Jourdan, B. Lorho. Attribute Grammars, Defini- tions, Systems and Bibliography, LNCS 323. Springer, 1988
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wilhelm, R., Maurer, D. (1992). Semantische Analyse. In: Übersetzerbau. Springer-Lehrbuch. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-00077-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-00077-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-00078-6
Online ISBN: 978-3-662-00077-9
eBook Packages: Springer Book Archive