nsider the following grammar: tate in your own words what kinds of sentences (strings) these productions describe. ive 3 examples of valid strings, and 3 examples of invalid strings, according to the gra rite a lexical analyzer (scanner) program for this BNF. (20 points) This scanner should prompt the user to input a string, then output a list of tokens a line, from the input string according to the above grammar. If something is "wrong should output an error message of some kind and abandon the scan. HINT: This grammar has a special property: every lexeme consists of exactly one c scanner will be much simpler than the one shown in 4.2 of your textbook. You mav example, or your Week 4 recognizer solution, for ideas about how to implement t EVIDENCE