A system for assisting in the testing phase of compilers is described. The definition of the language to be compiled drives an automatic sentence generator. The language is described by an extended BNF grammar which can be augmented by actions to ensure contextual congruence, e.g. between definition and use of identifiers. For deep control of the structure of the produced sample the grammar can be described by step-wise refinements: the generator is iteratively applied to each level of refinement, producing at last compilable, complete programs. The implementation is described and some experimental results are reported concerning PLZ, MINIPL and some other languages
my father- in memoriam. my mother, Daniel, my sisters and brothers.- II-We describe a method for the...
Given a complete, formal description of the semantics of a programming language, it should be possib...
The correctness of the compiler is a necessary requirement for the correct operation of the software...
A system for assisting in the testing phase of compilers is described. The definition of the languag...
A tool for compiler testing is implemented. The tool is driven by a BNF grammar extended by a device...
An implementation of a sentence generator system for a compiler for PT, a subset of Pascal, is discu...
Includes bibliographical references (page 58)A compiler generator is a system which accepts the form...
The grammar formalism Labelled BNF (LBNF) and the compiler construction tool BNF Converter are intro...
It is a common practice to perform compiler testing with a set of hand-written sample programs. Howe...
This paper describes an algorithm which takes the BNF definition of the grammar of a language and co...
The goal of this project was to create an open source teaching tool along with a User Manual. The re...
Includes bibliographical references (page 57)A package of computer programs for automatically\ud gen...
The main goal of this work is to design a method of constructing a compiler based on grammar systems...
In grammar-based testing, context-free grammars may be used to generate relevant test inputs for lan...
Grammars are traditionally used to recognize or parse sentences in a language, but they can also be ...
my father- in memoriam. my mother, Daniel, my sisters and brothers.- II-We describe a method for the...
Given a complete, formal description of the semantics of a programming language, it should be possib...
The correctness of the compiler is a necessary requirement for the correct operation of the software...
A system for assisting in the testing phase of compilers is described. The definition of the languag...
A tool for compiler testing is implemented. The tool is driven by a BNF grammar extended by a device...
An implementation of a sentence generator system for a compiler for PT, a subset of Pascal, is discu...
Includes bibliographical references (page 58)A compiler generator is a system which accepts the form...
The grammar formalism Labelled BNF (LBNF) and the compiler construction tool BNF Converter are intro...
It is a common practice to perform compiler testing with a set of hand-written sample programs. Howe...
This paper describes an algorithm which takes the BNF definition of the grammar of a language and co...
The goal of this project was to create an open source teaching tool along with a User Manual. The re...
Includes bibliographical references (page 57)A package of computer programs for automatically\ud gen...
The main goal of this work is to design a method of constructing a compiler based on grammar systems...
In grammar-based testing, context-free grammars may be used to generate relevant test inputs for lan...
Grammars are traditionally used to recognize or parse sentences in a language, but they can also be ...
my father- in memoriam. my mother, Daniel, my sisters and brothers.- II-We describe a method for the...
Given a complete, formal description of the semantics of a programming language, it should be possib...
The correctness of the compiler is a necessary requirement for the correct operation of the software...