|Parser testing while grammar rules are unknown email@example.com (0x0badf00d) (2009-03-15)|
|Re: Parser testing while grammar rules are unknown firstname.lastname@example.org (russell kym horsell) (2009-03-15)|
|Re: Parser testing while grammar rules are unknown cfc@shell01.TheWorld.com (Chris F Clark) (2009-03-15)|
|Re: Parser testing while grammar rules are unknown email@example.com (Martin Ward) (2009-03-16)|
|Date:||Sun, 15 Mar 2009 00:49:20 +0200|
|Posted-Date:||14 Mar 2009 19:34:43 EDT|
I'm sorry if this group is not relevant. I'll be thankful for any idea,
on where to look for answer.
Let's say, we have language somehow similar to ADA. And we have a parser
/compiler for this language. And we know it contain bugs.
We do not have grammar rules for language, instead, we have a tons of
source code written in this language.
We would like to test parser against possible bugs. We could take source
code, alter it slightly and pass to parser and see, if it will return
error. Or, we could apply Markov chains algorithm (which could alter
human readable texts into humorous): but this is not seems very good
Are there something ready and known?
Return to the
Search the comp.compilers archives again.