jmarr@afit.af.mil (James S. Marr) (08/11/89)
I am interested in any information related to generating compiler
validation tests for a given language. In particular, I would like
to know if any research has been done in the area of automatic
generation of combinations of compiler validation tests; using
the language BNF description as an input, the objective being to
analyze the BNF and produce a list of "recommended" combinations of
tests. For example, two language features may work fine when tested
independently, but may fail if tested in combination. Obviously such
generation of combinations would require some way for the user to
specify how such combinations should be chosen. I would like to know
if anyone has knowledge of any work done along these lines. Please
mail responses directly to me. If there are any significant replies, I
will summarize in a future article.
Thanks!
Jim Marr (jmarr@afit-ab.arpa)
[I'd think that given the current state of the compiling art, any language
describable in BNF should be parsed by a parser derived mechanically from
that BNF, so you're not likely to run into many compiler bugs related
directly to the syntax. I can imagine that other sorts of automatic test
generation would be useful. Anybody have something to report? -John]
--
Send compilers articles to compilers@ima.isc.com or, perhaps, Levine@YALE.EDU
{ decvax | harvard | yale | bbn }!ima. Meta-mail to ima!compilers-request.
Please send responses to the author of the message, not the poster.