How do you resolve the parser warnings about Shift-Reduce and Reduce-Reduce conflicts? You revise your lexer to not break apart lexemes. There is no way to resolve these warnings without changing the grammar of the language. You traverse your AST with in-order traversal. You specify a precedence for the grammar rules. Question 3 (2 points) What best describes the concept of Abstract Syntax Tree? The ultimate output of a parser. A hierarchical representation of syntactic analysis of a specific program. A Parsing Tree with some redundant nodes optionally removed. All of the above. Which of the following grammars accepts any arbitrary sequence of space-separated words "fizz" and "buzz"? ::=""::="fizz"|"buzz"::=""::="fizz"|"buzz"::="fizz""buzz" All of the above Question 5 ( 2 points) Consider the following grammar: ::=([az]+) "->" Which statement is true about this grammar? It can produce more than one distinct ASTs for the same program. This grammar is incomplete. The set of programs accepted by this grammar is finite. The grammar is complete, but the set of accepted programs is empty (i.e., there is no program that can be accepted by this grammar)