Please see attachment This is Coding in GoLang and C language
 https://golang.org/ref/spec Write a finite automaton or a Grammar for a language that accepts all words starting with an alphabet character that is not {for, while, if, int}, words can contain alphanumeric characters? What Would the regular expression for the above problem be? For the following problems treat ‘PrimaryExpr’ as a TERMINAL SYMBOL: Write the 5 smallest valid for loops in GoLang Write all switch statements in GoLang that have 3,5 and 7 terminals Write all if statements in GoLang that have 3, and 4 terminals Draw a DFA that is defined by a language L that contains all possible integer literals in C Draw a DFA that is defined by a language L that contains all possible floating-point literals in C Draw a DFA that is defined by a language L that contains all possible rune literals in GoLang Draw and detail the compilation process and state what mechanisms are used by each phase to take in input and pass it to the next phase What is the pattern form each type of numerical literal this string can produce: /d+.?d*|.d+/ How would you rewrite it without short cut key d and + Important  **** For any problem outside of 7 write functions code that would determine this.******