Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!think.com!mintaka!spdcc!iecc!compilers-sender
From: zeil@cs.odu.edu (Steven J. Zeil)
Newsgroups: comp.compilers
Subject: Re: YACC, going the other way
Keywords: yacc, testing
Message-ID: <1991Apr23.163353.28709@cs.odu.edu>
Date: 23 Apr 91 16:33:53 GMT
References: <1991Apr23.140427.5416@iecc.cambridge.ma.us>
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: zeil@cs.odu.edu (Steven J. Zeil)
Organization: Old Dominion University, Norfolk, VA
Lines: 17
Approved: compilers@iecc.cambridge.ma.us

In article <1991Apr23.140427.5416@iecc.cambridge.ma.us> elk@cblpn.att.com (Edwin Lewis King +1 614 860 3394) writes:
>I'm interesting in generating strings that are described by a BNF (OK,
>YACC) grammar.

I have seen references to this as a means of describing and generating
test data.  This method can be applied to many programs with heavily
structured input data, including programs that are not themselves
compilers/translators.

A reference that comes to mind is Duncan & Hutchison, "Using Atributed
Grammars to Test Designs and Implementations", in the 5th International
Conference on Software Engineering.

                                                  Steve Z
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.