An Automatic Generator for Compiler Testing

A new method for testing compilers is presented. The compiler is exercized by compilable programs, automatically generated by a test generator. The generator is driven by a tabular description of the source language. This description is in a formalism which nicely extends context-free grammars in a context-dependent direction, but still retains the structure and readability of BNF. The generator produces a set of programs which cover all grammatical constructions of the source language, unless user supplied directives instruct otherwise. The programs generated can also be used to evaluate the performance of different compilers of the same source language.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  J. C. Huang,et al.  An Approach to Program Testing , 1975, CSUR.

[3]  Alfred V. Aho,et al.  Principles of Compiler Design , 1977 .

[4]  David H. D. Warren.  Logic programming and compiler writing , 1980, Softw. Pract. Exp..

[5]  Rainer Parchmann,et al.  IO-Macrolanguages and Attributed Translations , 1977, Inf. Control..

[6]  John F. Wakerly,et al.  The programming language PASCAL , 1979, Microprocessors and microsystems.

[7]  B. J. Mailloux,et al.  Report of Algorithmic Language ALGOL 68 , 1969 .

[8]  Charlie Bass,et al.  Report on the Programming Language PLZ/SYS , 1978, Springer New York.

[9]  Olivier Lecarme.  Usability and portability of a compiler writing system , 1975, Methods of Algorithmic Language Implementation.

[10]  Michael J. Fischer,et al.  Grammars with Macro-Like Productions , 1968, SWAT.

[11]  K. V. Hanford,et al.  Automatic Generation of Test Cases , 1970, IBM Syst. J..

[12]  Carlo Ghezzi,et al.  Compiler testing using a sentence generator , 1980, Softw. Pract. Exp..

[13]  Paul Walton Purdom,et al.  A sentence generator for testing parsers , 1972 .

[14]  David Gries,et al.  Compiler Construction for Digital Computers , 1971 .