* Test Case Generator
@ 1989-08-14 16:54 James S. Marr
1989-08-16 14:32 ` ryer
0 siblings, 1 reply; 2+ messages in thread
From: James S. Marr @ 1989-08-14 16:54 UTC (permalink / raw)
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)
^ permalink raw reply [flat|nested] 2+ messages in thread
* Re: Test Case Generator
1989-08-14 16:54 Test Case Generator James S. Marr
@ 1989-08-16 14:32 ` ryer
0 siblings, 0 replies; 2+ messages in thread
From: ryer @ 1989-08-16 14:32 UTC (permalink / raw)
Intermetrics developed a test case generator much like you describe.
It inputs a BNF and outputs immense numbers of test cases. We use
it internally for compiler testing (Intermetrics does compilers for
Ada, C, Modula, and many other languages).
The tool was described in an article in "Software Practice and Experience"
in January 1989. It is titled "Independent Testing of Compiler
Phases Using a Test-Case Generator", by Homer and Schooler.
Mike Ryer
Intermetrics, Inc.
(617) 661-1840
^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~1989-08-16 14:32 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1989-08-14 16:54 Test Case Generator James S. Marr
1989-08-16 14:32 ` ryer
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox