1 The internal structure of a Lisp-like list most closely resembles that of a(n)
a Array-based list
b Singly linked structure without a header node
2 Recursion can support backtracking because
a Previous states are saved on the system call stack
b Previous states are saved on a programmer-defined stack
3 A program that analyzes an expression for syntactic correctness is called a
a Scanner
b Parser
4 A program that factors a source string into words and recognizes them is called a
a Lexical analyzer
b Syntax analyzer
5 In a tail-recursive routine
a There is more work to do after a recursive call returns
b There is no work to do after a recursive call returns
