From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.5-pre1
Date: 1 Sep 93 04:14:04 GMT
From: dog.ee.lbl.gov!overload.lbl.gov!agate!spool.mu.edu!uwm.edu!linac!uchinews
!cs.umd.edu!not-for-mail@ucbvax.Berkeley.EDU  (Alex Blakemore)
Subject: Re: Ada abstract syntax tree, and semantic description
Message-ID: <2617ic$720@seine.cs.umd.edu>
List-Id: <comp.lang.ada>

In article <36872@hacgate.SCG.HAC.COM> liang@abend.hrl (Peter Liang) writes:
> 	Does anyone know any formal description about constructing an 
> abstract syntax tree for parsed ada program, and is there any formal
> semantic description for ada?

this isnt exactly what you asked for, but if you want a pragmatic
and standard way to examine an Ada attributed AST, then check out ASIS

ftp ajpo.sei.cmu.edu
cd /public/asis
ls

-- 
Alex Blakemore       alex@cs.umd.edu        NeXT mail accepted
--------------------------------------------------------------
"Without an engaged and motivated human being at the keyboard,
the computer is just another dumb box."      William Raspberry