1 Discuss the trade-offs between Lisp-like lists and Python lists, including space/time performance and ease of verification.

2 In the Case Study for Chapter 14, we developed a program that used a stack to evaluate postfix expressions. That program assumed that the user entered syntactically correct postfix expressions and made no attempt to parse them. We also presented an algorithm in Chapter 14 to convert infix expressions to postfix expressions. By adding error handling to this algorithm, we would create a parser. In the present case study, we develop a recursive descent parser using the methods described earlier in this chapter.