Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site ucbvax.BERKELEY.EDU
Path: utzoo!decvax!decwrl!amdcad!lll-crg!ucdavis!ucbvax!ailist
From: cugini@NBS-VMS.ARPA ("CUGINI, JOHN")
Newsgroups: mod.ai
Subject: automatic testing of parsers
Message-ID: <8602140613.AA12069@ucbvax.berkeley.edu>
Date: Thu, 13-Feb-86 10:52:00 EST
Article-I.D.: ucbvax.8602140613.AA12069
Posted: Thu Feb 13 10:52:00 1986
Date-Received: Sat, 15-Feb-86 01:35:42 EST
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: "CUGINI, JOHN" <cugini@nbs-vms.ARPA>
Organization: The ARPA Internet
Lines: 12
Approved: ailist@sri-ai.arpa

From: "CUGINI, JOHN" <cugini@nbs-vms.ARPA>


Do any systems exist which can accept a body of BNF (or some other
syntactic production rules), and then generate or enumerate test
cases to be run against an alleged parser of that BNF?

Thanks in advance for any help...

John Cugini <Cugini@NBS-VMS> 
National Bureau of Standards
------