| Related articles |
|---|
| How to verify a parser from the language grammar salam3@connect.carleton.ca (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 torbenm@app-0.diku.dk (2007-01-11) |
| From: | Shahid Alam <salam3@connect.carleton.ca> |
| Newsgroups: | comp.compilers |
| 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 |
Hi,
Does anybody know of any tool that lets you validate and verify your
parser (hand implemented) from the BNF grammar of the language.
-- Shahid
[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?
-John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.