A sentence generator for testing parsers

DOI10.1007/BF01932308zbMATH Open0242.68015OpenAlexW4243412374MaRDI QIDQ5653549FDOQ5653549

Authors: Paul Walton jun. Purdom 

Publication date: 1972

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01932308

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cites Work

• EULER: A generalization of ALGOL and its formal definition: Part 1
• Simple LR(k) grammars

Cited In (5)

• Automation of broad sanity test generation
• Using abstract models for the generation of test data with a complex structure
• A random testing approach using pushdown automata
• Generation of positive and negative tests for parsers
• Automated Generation of Positive and Negative Tests for Parsers

Uses Software

• Euler

This page was built for publication: A sentence generator for testing parsers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5653549)