An attribute grammar for Ada

  • Authors:
  • S. Drossopoulou;J. Uhl;G. Persch;G. Goos;M. Dausmann;G. Winterstein

  • Affiliations:
  • Universltät Karlsruhe, Inst. f. Informatlk II, Postfach 6380, D-7500 Karleruhe 1;Universltät Karlsruhe, Inst. f. Informatlk II, Postfach 6380, D-7500 Karleruhe 1;Universltät Karlsruhe, Inst. f. Informatlk II, Postfach 6380, D-7500 Karleruhe 1;Universltät Karlsruhe, Inst. f. Informatlk II, Postfach 6380, D-7500 Karleruhe 1;Universltät Karlsruhe, Inst. f. Informatlk II, Postfach 6380, D-7500 Karleruhe 1;Universltät Karlsruhe, Inst. f. Informatlk II, Postfach 6380, D-7500 Karleruhe 1

  • Venue:
  • SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
  • Year:
  • 1982

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe the development of a formal specification of the static semantics of Ada in form of an attribute grammar. This specification is complete, and was tested extensively with automatically generated equivalent Pascal programs. From this specification we systematically developed the semantic analysis part of our Ada Compiler Front End. We outline the general proceeding when specifying semantic analysis with attribute grammars and then discuss to some extent examples about declaration elaboration and overloading resolution. CR Categories and Subject Descriptors: D.3.1 [Programming Languages]: Formal definitions and Theory - semantics; D.3.4 [Programming Languages]: Processors - Translator writing systems and compiler generators; F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languages - algebraic approaches to semantics.