This paper describes the implementation of an efficient runtime representation for the Ada programming language. This runtime system addresses issues of type representation, package representation, and stack frame organization but does not implement Ada tasking. The structure of the runtime system is discussed in detail. In implementing this system, considerable experience was gained using two intermediate representations of Ada: 1) a high level intermediate form designed for Ada (DIANA), and 2) a low level intermediate form used by the portable C compiler. The utility of both representations is assessed.
Experiences with Ada Code Generation
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
The Engineering Library
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).