A sentence generator for testing parsers |
| |
| Authors: | Paul Purdom |
| |
| Institution: | (1) Computer Science Department, Indiana University, 47401 Bloomington, Indiana, USA |
| |
| Abstract: | A fast algorithm is given to produce a small set of short sentences from a context free grammar such that each production of the grammar is used at least once. The sentences are useful for testing parsing programs and for debugging grammars (finding errors in a grammar which causes it to specify some language other than the one intended). Some experimental results from using the sentences to test some automatically generated simpleLR(1) parsers are also given. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
