1. Define a simple Pascal-like language by means of a BNF grammar. Then find one

1. Define a simple Pascal-like language by means of a BNF grammar. Then find one or more test sets that satisfy the syntax-driven testing criterion. Is it possible to have a test set consisting of just one program? 2. Explain how syntax-directed techniques can be applied to programs that are not language Processors. 3. Consider a cause-effect graph in which you also represent constraints (e.g.. take the graph shown in How can you represent constraints by means of a decision table?

You may also like