December 2021
Beginner
840 pages
47h 29m
English
Define a function evaluate-expression that accepts only a list argument, which represents a logical expression; applies the logical operators in the input expression; and returns a list of all intermediate results, including the final return value of the expression, which can be either #t or #f.
The expressions are represented as a parenthesized combination of #t (representing true), #f (representing false), ∼ (representing not), V (representing or), and & (representing and). In the absence of parentheses, normal precedence rules hold: ∼ has the highest precedence, & has the second highest, and V has the lowest. Assume left-to-right associativity. For instance, the expression is equivalent to . No two ...