One simple approach to testing grammars is to derive a number of sentences from the grammar under test and to validate whether they comply with the intended ...
In this paper, we present an improved algorithm which incorporates a length control mechanism into the generation process to produce more and simpler sentences.
In this paper, we present an improved algorithm which incorporates a length control mechanism into the generation process to produce more and simpler sentences.
The purpose of the algorithm is to generate a set of sentences and the parses of the sentences such that each production in the grammar is used at least once.
Although formal specification techniques are very useful in software development, the acquisition of formal specifications is a difficult task.
Gramtest allows you to generate test cases based on arbitrary user defined grammars. Potential applications of the tool include automated fuzzing and testing.
Algorithm for Generating Short Sentences from Grammars Based ...
www.researchgate.net › ... › Grammar
This paper presents a sentence generation algorithm, which takes as input a context-free grammar and produces a set of sentences that achieves branch ...
Dec 1, 1972 · A fast algorithm is given to produce a small set of short sentences from a context free grammar such that each production of the grammar is ...
This paper presents a sentence generation algorithm, which takes as input a context-free grammar and produces a set of sentences that achieves branch coverage ...
In this paper, we describe generating grammar simplification rules from a large parallel corpus (N=141,500) containing original sentences and their simplified ...