|How to verify a parser from the language grammar email@example.com (Shahid Alam) (2007-01-09)|
|Re: How to verify a parser from the language grammar cfc@shell01.TheWorld.com (Chris F Clark) (2007-01-11)|
|Re: How to verify a parser from the language grammar firstname.lastname@example.org (2007-01-11)|
|From:||Shahid Alam <email@example.com>|
|Date:||9 Jan 2007 20:07:08 -0500|
|Organization:||Carleton University, Ottawa, Canada|
|Keywords:||parse, testing, question|
|Posted-Date:||09 Jan 2007 20:07:08 EST|
Does anybody know of any tool that lets you validate and verify your
parser (hand implemented) from the BNF grammar of the language.
[I doubt it. It's wouldn't be hard to contrive test cases that
exercise all of the rules in a BNF grammar, but how are you going to
test that the parser rejects everything that's not in the grammar?
Return to the
Search the comp.compilers archives again.