A system often has a fixed set of inputs that can take on a variety of values. Grammar-based test generation employs generative CFG which can create a set of inputs to a system in a specific format. For example, a generative grammar can create a serie...
A system often has a fixed set of inputs that can take on a variety of values. Grammar-based test generation employs generative CFG which can create a set of inputs to a system in a specific format. For example, a generative grammar can create a series of programs to be interpreted by the analytic grammar. There are situations where a grammar developer may want to reduce the number of test cases generated by the system. A number of control mechanism has been developed to prune the number of test cases generated while still producing a test set that covers the majority of inputs the system. This paper presents and categorizes various solutions for the problems and shortcomings of CFGs as generators.