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=0.6 required=5.0 tests=BAYES_05,INVALID_DATE,
	MSGID_SHORT autolearn=no autolearn_force=no version=3.4.4
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site csu-cs.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!think!harvard!seismo!hao!denelcor!csu-cs!rro
From: rro@csu-cs.UUCP (Rod Oldehoeft)
Newsgroups: net.lang.ada
Subject: Ada grammar wanted
Message-ID: <2688@csu-cs.UUCP>
Date: Mon, 29-Jul-85 16:06:22 EDT
Article-I.D.: csu-cs.2688
Posted: Mon Jul 29 16:06:22 1985
Date-Received: Wed, 31-Jul-85 05:27:31 EDT
Distribution: net
Organization: Colo State Univ - CS Dept, Ft Collins, CO
List-Id: <comp.lang.ada>

My apologies for any duplication of recent requests or missed
responses; news has just been revived here.

This is a request for a grammar for Ada expressed in yacc (or eyacc)
format.  We're doing some investigations into grammars and the
characteristics of the languages they define . . . pretty weird, eh?
Anyway, we're interested in a grammar with actions if possible.

If there is a followup implementation of the rest of the compiler,
some data about the size of the source code involved will be needed.

If, wildly enough, there is a complete implementation starting from a
yacc grammar, we would like to know some data about the size of
runtime libraries.

I know about the grammar published in SIGPLAN Notices; since it's not
online and has no actions, we make this request.

Since news service is intermittent lately, please respond by email or
conventionally to:

Rod Oldehoeft
Computer Science Dept.
Colorado State University
Fort Collins, CO  80523
303/491-7017
...{hao!hplabs}!csu-cs!rro