Comparison of context-free grammars based on parsing generated test data

Authors:
Bernd Fischer;Ralf Lämmel;Vadim Zaytsev
Affiliations:
Electronics and Computer Science, University of Southampton, Southampton, United Kingdom;Software Languages Team, Universität Koblenz-Landau, Koblenz, Germany;Software Analysis and Transformation Team, Centrum Wiskunde en Informatica, Amsterdam, The Netherlands
Venue:
SLE'11 Proceedings of the 4th international conference on Software Language Engineering
Year:
2011

Citing 21
Cited 1

Using production grammars in software testing

Proceedings of the 2nd conference on Domain-specific languages
Generating Test Data with Enhanced Context-Free Grammars

IEEE Software
Grammar Testing

FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Teaching Software Engineering in a Compiler Project Course

Journal on Educational Resources in Computing (JERIC)
Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))

Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))
Survey of compiler testing methods

Programming and Computing Software
A metrics suite for grammar-based software: Research Articles

Journal of Software Maintenance and Evolution: Research and Practice - Analyzing the Evolution of Large-Scale Software
The compiler course in today's curriculum: three strategies

Proceedings of the 37th SIGCSE technical symposium on Computer science education
Analysing the effectiveness of rule-coverage as a reduction criterion for test suites of grammar-based software

Empirical Software Engineering
Teaching the compilers course

ACM SIGCSE Bulletin
An Introduction to Grammar Convergence

IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Design choices in a compiler course or how to make undergraduates love formal notation

CC'08/ETAPS'08 Proceedings of the Joint European Conferences on Theory and Practice of Software 17th international conference on Compiler construction
A Pure Object-Oriented Embedding of Attribute Grammars

Electronic Notes in Theoretical Computer Science (ENTCS)
Two case studies in grammar-based test generation

Journal of Systems and Software
Tracking down the origins of ambiguity in context-free grammars

ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
EASY meta-programming with Rascal

GTTSE'09 Proceedings of the 3rd international summer school conference on Generative and transformational techniques in software engineering III
Recovering grammar relationships for the Java Language Specification

Software Quality Control
Controllable combinatorial coverage in grammar-based testing

TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Language boxes: bending the host language with modular language changes

SLE'09 Proceedings of the Second international conference on Software Language Engineering
Automated generation of positive and negative tests for parsers

FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Attribute grammar-based language extensions for java

ECOOP'07 Proceedings of the 21st European conference on Object-Oriented Programming

Negotiated grammar transformation

Proceedings of the 2012 Extreme Modeling Workshop

Quantified Score

Hi-index	0.00

Visualization

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. Our 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.