Abstract
This paper outlines a denotational semantics like method for defining the statically decideable context conditions that Ada programs must satisfy. The resulting definition illustrates representational & operational abstraction by — in contrast to conventional attribute/affix grammar methods — not referring to any compiler realization.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bundgaard, J., Schultz, L. (1980). A denotational (static) semantics method for defining Ada context conditions. In: Bjørner, D., Nest, O.N. (eds) Towards a Formal Description of Ada. Lecture Notes in Computer Science, vol 98. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10283-3_2
Download citation
DOI: https://doi.org/10.1007/3-540-10283-3_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10283-0
Online ISBN: 978-3-540-38415-1
eBook Packages: Springer Book Archive