Assignment 2 – Questions and Answers

Due Thursday 4/18 1:59pm

In this assignment, B refers to the little boolean language from chapter 1.

Exercise 1. Prove that a B program evaluates to f if it doesn’t contain a t, that is if t does not appear in B, evalr(B) = f.

Exercise 2. Prove that a B program evaluates to t if it contains a t, that is if t appears in B, evalr(B) = t.

Deliverables: Please bring your solutions to class or drop them at Christos’s office.