Comparison of Context-free Grammars Based on Parsing Generated Test Data

Status
To appear in Post-proceedings of SLE 2011.

Authors
Bernd Fischer, Ralf Lämmel, and Vadim Zaytsev

Abstract
There exist a number of software engineering scenarios that essentially involve equivalence or correspondence assertions for some of the context-free grammars in the scenarios. For instance, when applying grammar transformations during parser development---be it for the sake of disambiguation or grammar-class compliance---one would like to preserve the generated language. Even though equivalence is generally undecidable for context-free grammars, we have developed an automated approach that is practically useful in revealing evidence of nonequivalence of grammars and discovering correspondence mappings for grammar nonterminals. The approach is based on systematic test data generation and parsing. We discuss two studies that show how the approach is used in comparing grammars of open source Java parsers as well as grammars from the course work for a compiler construction class.

Keywords

grammar-based testing, test data generation, coverage criteria, grammar equivalence, parsing, compiler construction, course work

Bibtex entry 
@misc{FischLZ11,
  author    = {Bernd Fischer, Ralf L{\"a}mmel, and Vadim Zaytsev},
  title     = "{Comparison of Context-free Grammars Based on Parsing Generated Test Data}",
  year      = {2011},
  note      = "20 pages. Online since 16 April 2011. To appear in Proceedings of SLE 2011"
}

Downloads and links