-Draw a finite automata for a for loop by the rules of Java or C. Begin with a test plan containing at least 10 cases (add rows to the table); the test plan should include various good cases and bad (i.e., not a valid for loop). Try to think of unusual special cases (good and bad); bad cases that are close to good case make strong tests.

Test plan structure:

case #	description of test case	for loop	OK?
1
2
3
4
5
6
7
8
9
10

-Draw FA

-Grammar

Create a grammar for a for loop, starting at the level of . Then give a parse tree for three of your valid for loops from the first part of the exercise.