This example demonstrates the execution model of the Defoe by computing the following set of expressions.

- a = x + y - z
b = x + y - 2 * z

c = x + y - 3 * z

- Line # Code Comments
1. add r4 = r1, r2 // r4 = x + y

2. shl r5 = r3, 1 // r5 = z 1, i.e. z * 2

3. mul r6 = r3, 3 ; // r6 = z * 3. Stop bit.

4. sub r32 = r4, r3 // r5 = a = gets x + y - z

5. sub r33 = r4, r5 ; // r33 = b = x + y - 2 * z.

// Stop bit.

6. sub r34 = r4, r6 ; // r34 = c = x + y - 3 * z.

// Stop bit.