4 The result of lexical analysis is a. b. c. d. e. a classification of the input into tokens recognizing if the input is valid in the target programming language converting from Unicode to ASClI None of the above All of the above A regular expression matcher a. b. C. d. e. Cannot count things Uses direct matching and metacharacter matching Must be deterministic Band C only A B and C 6 A BNF grammar can best enforce operator precedence with a. b. C. d. e. A precedence table Hardcoding the precedence in the parser The order of the operations in the grammar rules Rewriting the parse tree None: operator precedence must be enforced after parsing A language cannot be parsed with a recursive descent parser if it has: a. b. c. d. e. More than 20 rules Rules in the same form as a right regular grammar Left recursion Operators with the same precedence A tabular representation of the grammar rules A static variable declared inside of a class means: a. There is only one instance of that variable shared by all instances of the class b. There is only one instance of that variable shareable by all classes C. The superclass can change the static variable d. The static variable is invisible to all functions outside of the class e. The memory for the static variable will be on the heap