Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Testing strategy for compiler kuangpma@gmail.com (kuangpma) (2010-06-16) |
| Re: Testing strategy for compiler gah@ugcs.caltech.edu (glen herrmannsfeldt) (2010-06-17) |
| Re: Testing strategy for compiler zaimoni@zaimoni.com (Kenneth 'Bessarion' Boyd) (2010-06-17) |
| Re: Testing strategy for compiler ott@mirix.org (Matthias-Christian Ott) (2010-06-18) |
| Re: Testing strategy for compiler gene.ressler@gmail.com (Gene) (2010-06-18) |
| Re: Testing strategy for compiler gneuner2@comcast.net (George Neuner) (2010-06-18) |
| Re: Testing strategy for compiler gah@ugcs.caltech.edu (glen herrmannsfeldt) (2010-06-18) |
| [13 later articles] |
| From: | kuangpma <kuangpma@gmail.com> |
| Newsgroups: | comp.compilers |
| Date: | Wed, 16 Jun 2010 07:18:20 -0700 (PDT) |
| Organization: | Compilers Central |
| Keywords: | testing, question, comment |
| Posted-Date: | 17 Jun 2010 13:18:20 EDT |
Folks,
Say I have written a hand crafted lexer/parser/code gen.... to make a
complete compiler. The question is how to test it? Since user can have
millions possible ways of writing their program (with many different
types of syntax errors) and it is difficult to test all the possible
cases. So is there any good ways to test the compiler? How do those
big guys (MS/Borland...) tested their compiler? Thanks.
[Doing a thorough test of a manually written parser is extremely hard,
particularly making sure that it rejects everything invalid that you
might not have thought of. That's one of the main reasons to use scanner
and parser generators, you can be reasonably confident that the language
it accepts matches the grammar you gave it. -John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.