Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.compilers    |    Compiler construction, theory, etc. (Mod    |    2,753 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 1,601 of 2,753    |
|    0x0badf00d to All    |
|    Parser testing while grammar rules are u    |
|    15 Mar 09 00:49:20    |
      From: 0x0badf00d@gmail.com              Hi.              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       solution.       Are there something ready and known?              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca