Hi Mathew, I have thought about creating such a tool, on a number of occasions, but have yet to get around to it.
You could probably create one, yourself, if you have a spare day or two. I think, the main complication would be needing to collect the ! and & expressions as you generate the string, and then match the expressions against the final candidate string at the appropriate positions. If one of the ! or & expressions fails, then the generated string is not actually part of your language. As an optimization, you could restart the generation process with a partially generated string, if a final candidate is invalid. Regards, Orlando On Thu, Sep 4, 2014 at 7:54 PM, mathew palsberg <matpalsb...@gmail.com> wrote: > Hello, > I recently built a small language with PEG. I now want to test my language > with random generated(not necessarily meaningful) programs. Does anybody > know a tool that given a PEG grammar, it generates random sequences that > satisfy the given grammar? > > Thanks; > > > _______________________________________________ > PEG mailing list > PEG@lists.csail.mit.edu > https://lists.csail.mit.edu/mailman/listinfo/peg > >
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
