Related articles |
---|
Test Data generation using grammar harvinderrikhi@yahoo.co.uk (2002-03-09) |
Re: Test Data generation using grammar Olivier.Ridoux@irisa.fr (Olivier Ridoux) (2002-03-17) |
Re: Test Data generation using grammar eeide@cs.utah.edu (Eric Eide) (2002-03-17) |
Re: Test Data generation using grammar gmiles@incrent.com (Gary Miles) (2002-04-21) |
Re: Test Data generation using grammar james.power@may.ie (2002-04-23) |
From: | "Gary Miles" <gmiles@incrent.com> |
Newsgroups: | comp.compilers,comp.theory |
Date: | 21 Apr 2002 19:18:47 -0400 |
Organization: | Mailgate.ORG Server - http://www.Mailgate.ORG |
References: | 02-03-026 |
Keywords: | parse, testing |
Posted-Date: | 21 Apr 2002 19:18:47 EDT |
We have researched the same problem, but with a different application.
Have a look at the old posting - Algorithm efficiently generating
L(G), for a non-selfembedding CFG G Newsgroups: comp.compilers.
[ Yes. see http://compilers.iecc.com/comparch/article/01-04-008
and http://compilers.iecc.com/comparch/article/01-04-010 and
http://compilers.iecc.com/comparch/article/01-04-015 -John]
In our application we make the grammer non-selfembedding to produce
only a finte language. That is what I assume you mean by "limit the
oputput of the grammar."
Gary Miles
http://www.incrent.com
"Harvinder Singh" <harvinderrikhi@yahoo.co.uk> wrote in message
> I am working on a program, which will be able to generate test
> data..... given the grammar of the test data. I mean to say....
Return to the
comp.compilers page.
Search the
comp.compilers archives again.