Question 15 If all the attribute values in a parse tree of an attribute grammar have been computed, the tree is said to be: non-deterministic ambiguous undefined fully attributed Question 17 It's possible to write a grammar that is both unambiguous and incorporates the semantics of operator precedence. True False Question 20 A.PL B. Short Code Match each clue with its corresponding programming language. - A list of commands in a file . Artificial intelligence and theorem proving - Automatic programming . Automatically incrementing address registers - Best of ALGOL, FORTRAN and COBOL C. Speedcoding D. Script E. LISP Question 21 Which of the following are elements of attribute grammars? (Mark all that apply) predicate functions attribute computation functions identity functions attributes