For the automata pictured below, provide five distinct strings that would accepted as syntactically valid. Your answer to this does not need to be valid code in any language you've learned before (in other words, this is a fictional language). Note that the state shown in blue is the start state, and the state(s) shown in green are the accept states.

For each of the following instructions, in a given language, define an automata (through drawing) that is capable of determining that the code is valid syntactically. Your automata must also be capable of rejecting code that would not be valid.

Hint: Semantics does not matter, but your automata must consider all the valid possibilities! In the case of character classes (e.g. numbers) feel free to abbreviate.

1: Java declaration statement (int x = 5) 2: C/C++ For loop 3: Python if statement 4: Java method declaration 5: C/C++ pointer declaration statement

"B OrOCO L' L' 'A