|Syntax Directed Test Generation firstname.lastname@example.org (1997-04-22)|
|Re: Syntax Directed Test Generation email@example.com (Charles Fiterman) (1997-04-30)|
|Re: Syntax Directed Test Generation firstname.lastname@example.org (1997-05-03)|
|Re: Syntax Directed Test Generation email@example.com (1997-05-04)|
|Syntax Directed Test Generation Dave@occl-cam.demon.co.uk (Dave Lloyd) (1997-05-04)|
|Re: Syntax Directed Test Generation firstname.lastname@example.org (1997-05-08)|
|Re: Syntax Directed Test Generation email@example.com (1997-05-08)|
|From:||firstname.lastname@example.org (Chuck Swart)|
|Date:||22 Apr 1997 21:22:29 -0400|
|Organization:||Analogy, Inc., Beaverton OR|
I am interested in the following problem: Given a grammar in BNF (or
perhaps EBNF) automatically generate a set of test cases which will
cause all productions in the grammar to be used when these test cases
Altthough there are some interesting issues (such as how to deal with
terminals, iterations in EBNF, unreachable productions, and
productions which can't yield terminal strings, etc,) this seems like
a fairly obvious problem which probably has already been investigated.
I would appreciate pointers to work in this area.
Thanks in advance,
[I've seen work on generating test cases, but I don't recall anything that
attempts to provide code coverage of a rule-based parser. -John]
Return to the
Search the comp.compilers archives again.