Abstract
Grammar testing is discussed in the context of grammar engineering (i.e., software engineering for grammars). We propose a gen- eralisation of the known rule coverage for grammars, that is, context-dependent branch coverage. We investigate grammar testing, especially coverage analysis, test set generation, and integration of testing and grammar transformations. Grammar recovery is chosen as a subfield of grammar engineering to illustrate the developed concepts. Grammar recovery is concerned with the derivation of a language’s grammar from some available resource such as a semi-formal language reference.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. L. Bird and C. U. Munoz. Automatic generation of random self-checking test cases. IBM Systems Journal, 22(3):229–245, 1983.
A. Boujarwah and K. Saleh. Compiler test suite: evaluation and use in an automated test environment. Information and Software Technology, 36(10):607–614, 1994.
M. Brand, M. Sellink, and C. Verhoef. Current parsing techniques in software renovation considered harmful. In S. Tilley and G. Visaggio, editors, Proceedings of the sixth International Workshop on Program Comprehension, pages 108–117, 1998.
C. J. Burgess. The Automated Generation of Test Cases for Compilers. Software Testing, Verification and Reliability, 4(2):81–99, jun 1994.
M. de Jonge and J. Visser. Grammars as Contracts. In Proc. of GCSE 2000, LNCS, Erfurt, Germany, 2001. Springer-Verlag. to appear.
G. Ferrand. The Notions of Symptom and Error in Declarative Diagnosis of Logic Programs. In P. Fritzon, editor, Automated and Algorithmic Debugging, First International Workshop, AADEBUG’93, volume 749 of Lecture Notes in Computer Science, pages 40–57. Springer-Verlag, 3-5 May 1993.
J. Harm and R. Lammel. Two-dimensional Approximation Coverage. Informatica, 24(3), 2000.
J. Heering, P. R. H. Hendriks, P. Klint, and J. Rekers. The syntax definition formalism SDF — Reference manual. SIGPLAN Notices, 24(11):43–75, 1989.
W. E. Howden. Weak mutation testing and completeness of test sets. IEEE Transactions on Software Engineering, 8(4):371–379, July 1982.
IBM Corporation. VS COBOL II Application Programming Language Reference, 1993. Release 4, Document number GC26-4047-07.
R. Lammel and C. Verhoef. VS COBOL II Grammar Version 1.0.3. http://www.cwi.nl/~ralf/grammars, 1999-2001.
R. Lammel and C. Verhoef. Semi-automatic Grammar Recovery. Submitted, available at http://www.cwi.nl/~ralf/, July 2000.
P. Purdom. A sentence generator for testing parsers. BIT, 12(3):366–375, 1972.
J. Rekers. Parser Generation for Interactive Environments. PhD thesis, University of Amsterdam, 1992.
M. Sellink and C. Verhoef. Development, assessment, and reengineering of language descriptions. In J. Ebert and C. Verhoef, editors, Proceedings of the Fourth European Conference on Software Maintenance and Reengineering, pages 151–160. IEEE Computer Society, March 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lämmel, R. (2001). Grammar Testing. In: Hussmann, H. (eds) Fundamental Approaches to Software Engineering. FASE 2001. Lecture Notes in Computer Science, vol 2029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45314-8_15
Download citation
DOI: https://doi.org/10.1007/3-540-45314-8_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41863-4
Online ISBN: 978-3-540-45314-7
eBook Packages: Springer Book Archive