Problem Statement

Assume functions   a   and   b   return boolean values,   and further, the execution of function   b   takes considerable resources without side effects, and is to be minimized. If we needed to compute the conjunction   (and): Then it would be best to not compute the value of   b()   if the value of   a()   is computed as   false,   as the value of   x   can then only ever be   false. Similarly, if we needed to compute the disjunction (or): Then it would be best to not compute the value of   b()   if the value of   a()   is computed as   true,   as the value of   y   can then only ever be   true. Some languages will stop further computation of boolean equations as soon as the result is known, so-called   short-circuit evaluation   of boolean expressions

Create two functions named   a   and   b,   that take and return the same boolean value. The functions should also print their name whenever they are called. Calculate and assign the values of the following equations to a variable in such a way that function   b   is only called when necessary: If the language does not have short-circuit evaluation, this might be achieved with nested     if     statements.

Let's start with the solution:

global outcome
function a bool
    put "a called with" && bool & cr after outcome
    return bool
end a
function b bool
    put "b called with" && bool & cr after outcome
    return bool
end b

on mouseUp
    local tExp
    put empty into outcome
    repeat for each item op in "and,or"
        repeat for each item x in "true,false"
            put merge("a([[x]]) [[op]] b([[x]])") into tExp
            put merge(tExp && "is [[" & tExp & "]]") & cr after outcome
            put merge("a([[x]]) [[op]] b([[not x]])") into tExp
            put merge(tExp && "is [[" & tExp & "]]") & cr after outcome
        end repeat
        put cr after outcome
    end repeat
    put outcome
end mouseUp