Question 1 Left associativity is expressed as right recursion and right associativity is expressed as left recursion. True False Question 3 Denotational descriptions provide an excellent way to describe languages precisely, so they have proven very useful to language users. True False Question 4 Portability refers to how easily a program can be moved from one machine to another. True False Question 5 Consequences of the incomplete sematnics specifications of programming languages include (Mark all that apply): programmers know precisely what language statements mean before they use them commercial compilers are never generated automatically from language descriptions programs are rarely proven correct without testing we keep designing new programming languages to patch up design ambiguities Question 12 Match each term with its definition. - inference rule A. the "result" clause in a conditional statement - antecedent B. the "hypothetical" clause in a conditional statement - consequent C. a method for inferring truth axiom D. a logical statement assumed to be true Question 14 Which of the following IS NOT a programming domain discussed in our textbook? artificial intelligence edutainment scientific applications web software Question 22 BNF is NOT sufficiently powerful to describe which of the following: lists of similar constructs the order in which constructs must appear nested structures to any depth denotational semantics Question 23 Attribute computation functions are also called: identify functions static semantics semantic functions grammar rules Question 25 Extended BNF (EBNF) enhances the descriptive power of BNF. True False Question 11 Using denotational languages to automatically generate compilers is commonplace. True False