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.8 required=5.0 tests=BAYES_00,INVALID_DATE,
	MSGID_SHORT autolearn=no autolearn_force=no version=3.4.4
Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!rutgers!gatech!bloom-beacon!usc!cs.utexas.edu!wasatch!helios.ee.lbl.gov!ncis.tis.llnl.gov!blackbird!jmarr
From: jmarr@blackbird.afit.af.mil (James S. Marr)
Newsgroups: comp.lang.ada
Subject: Test Case Generator
Message-ID: <1286@blackbird.afit.af.mil>
Date: 14 Aug 89 16:54:03 GMT
Organization: Air Force Institute of Technology; WPAFB, OH
List-Id: <comp.lang.ada>


I'm interested in any information related to grammar-driven compiler
test generation.  In particular, I'd like to investigate methods
for generating compiler tests of combinations of Ada language features.
I'd appreciate references to any work that has been done in this
or related areas.  Currently, I'm developing tools to analyze the Ada
BNF description.  Next, I must determine how to identify "recommended"
combinations of language features that should be tested together.
I welcome any suggestions as to what methods I should use.  
Thanks!

Jim Marr (jmarr@galaxy.afit.af.mil)