From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: * X-Spam-Status: No, score=1.1 required=5.0 tests=BAYES_20,INVALID_DATE autolearn=no autolearn_force=no version=3.4.4 Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: $Revision: 1.6.2.16 $; site ada-uts.UUCP Path: utzoo!watmath!clyde!burl!ulysses!bellcore!decvax!cca!ada-uts!stt From: stt@ada-uts.UUCP Newsgroups: net.lang.ada Subject: Re: Re: use of DIANA in current compiler Message-ID: <4700017@ada-uts.UUCP> Date: Fri, 31-Jan-86 14:34:00 EST Article-I.D.: ada-uts.4700017 Posted: Fri Jan 31 14:34:00 1986 Date-Received: Mon, 3-Feb-86 05:39:44 EST References: <478@gymble.UUCP> Nf-ID: #R:gymble:-47800:ada-uts:4700017:000:866 Nf-From: ada-uts!stt Jan 31 14:34:00 1986 List-Id: The Intermetrics Byron(tm)/Ada compiler has been prevalidated, and finished the validation process (though still waiting for the certificate). We use a variant of Diana (no one uses "pure" Diana as far as I know), with an IDL class structure which is better partitioned so it can be mapped onto Ada variant record types (IDL is the notation used to define the Diana abstraction). Our access package contains a procedure and function per attribute for setting and getting attribute values, given a "locator" for the appropriate class of Diana node. It also includes generators and other primitives for iterating and building sequences of Diana nodes. General purpose Diana tree-walking packages are built by a separate IDL-based tool called "Bonsai." S. Tucker Taft (617) 661-1840 Intermetrics, Inc. Ada Systems Division 733 Concord Avenue Cambridge, MA 02138