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=-0.0 required=3.0 tests=BAYES_40 autolearn=ham
	autolearn_force=no version=3.4.5-pre1
Date: 2 Sep 93 19:43:48 GMT
From: sarge!sarge!esther@uunet.uu.net  (Esther Lumsdon)
Subject: Re: Ada abstract syntax tree, and semantic description
Message-ID: <esther.746999028@sarge>
List-Id: <comp.lang.ada>

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?
>	Thanks for information.

Lecture Notes in Computer Science,  _DIANA_  An Intermediate Language for Ada
Edited by G. Goos, W.A. Wulf, A. Evans, Jr., and K. J. Butler
Springer-Verlag publisher, ISBN 3-540-12695-3 and ISBN 0-387-12695-3
This is a revised edition.
-- 
-- Esther Lumsdon, not speaking for Verdix.   esther@verdix.com
"It's time to cut bait and talk turkey.  It takes 2 snakes to cross a
puddle. You have to bale hay while the tractor is warm."
  ---- either H. Ross Perot or Dave Barry