2010 8th IEEE International Conference on Software Engineering and Formal Methods 2010
DOI: 10.1109/sefm.2010.21
|View full text |Cite
|
Sign up to set email alerts
|

A Toolkit for Generating Sentences from Context-Free Grammars

Abstract: Producing sentences from a grammar, according to various criteria, is required in many applications. It is also a basic building block for grammar engineering. This paper presents a toolkit for context-free grammars, which mainly consists of several algorithms for sentence generation or enumeration and for coverage analysis for context-free grammars. The toolkit deals with general context-free grammars. Besides providing implementations of algorithms, the toolkit also provides a simple graphical user interface… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 20 publications
0
8
0
Order By: Relevance
“…The CFG specified in was implemented using the CFG Java tool (Xu et al, 2011). We used this tool for three main reasons: our grammar engine implementation was done in Java, so we wanted a Java tool as well; we wanted a small CFG implementation for reasonable performance; and their tool extended Purdom's algorithm to fulfill Context-Dependent Rule Coverage (CDRC), which generates more and simpler sentences.…”
Section: Implementation Of the Grammar Enginementioning
confidence: 99%
“…The CFG specified in was implemented using the CFG Java tool (Xu et al, 2011). We used this tool for three main reasons: our grammar engine implementation was done in Java, so we wanted a Java tool as well; we wanted a small CFG implementation for reasonable performance; and their tool extended Purdom's algorithm to fulfill Context-Dependent Rule Coverage (CDRC), which generates more and simpler sentences.…”
Section: Implementation Of the Grammar Enginementioning
confidence: 99%
“…We implemented the algorithms for verbalization and pluralization presented in (Byamugisha et al, 2016a;Byamugisha et al, 2016c) as a Java application. The CFG specified in (Byamugisha et al, 2016b) was implemented using the CFG Java tool (Xu et al, 2011). We used this tool for three main reasons: our grammar engine implementation was done in Java, so we wanted a Java tool as well; we wanted a small CFG implementation for reasonable performance; and their tool extended Purdom's algorithm to fulfill Context-Dependent Rule Coverage (CDRC), which generates more and simpler sentences.…”
Section: Implementation Of the Grammar Enginementioning
confidence: 99%
“…Test generation from a grammar is frequently used for generating structured inputs for example in [6] for testing parser or refactoring engines [7]. A generic tool exploiting coverage criteria for generating test data from grammars has been proposed in [8]. In [9][10] [11] several approaches for random testing from grammar specifications are proposed.…”
Section: A Related Workmentioning
confidence: 99%