Uploaded bydgsbu
PPT, PDF2,445 views

tracing a recursive factorial function in assembly language

The document traces the step-by-step process of calculating the factorial of 3 using a recursive algorithm on a simple CPU. It initializes registers and memory locations, pushes parameters onto the stack, recursively calls the factorial function, and pops values off the stack until it reaches the base case and returns the result.

Embed presentation

Downloaded 35 times
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... r1 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... r1 3 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... r1 3 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 100 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 CPU Registers Memory ??? r1 r13 r14 100 101 102 103 104 105 r15 100 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 100 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 100 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 100 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 100 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 100,101 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 100,101 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 3 100 101 102 103 104 105 r15 100,101 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 3 100 101 102 103 104 105 r15 100,101,102 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 3 03 100 101 102 103 104 105 r15 100,101,102 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3, 2 03 r1 r13 r14 3 03 100 101 102 103 104 105 r15 100,101,102 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03 r1 r13 r14 3 03 100 101 102 103 104 105 r15 100,101,102 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03,15 r1 r13 r14 3 03 100 101 102 103 104 105 r15 100,101,102 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03,15 r1 r13 r14 3 03 100 101 102 103 104 105 r15 100,101,102 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03,15 r1 r13 r14 3 03 100 101 102 103 104 105 r15 100,101,102 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03,15 r1 r13 r14 3 03 100 101 102 103 104 105 r15 100,101,102,103 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03,15 r1 r13 r14 3 03 2 100 101 102 103 104 105 r15 100,101,102,103 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03,15 r1 r13 r14 3 03 2 100 101 102 103 104 105 100,101,102,103, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03,15 r1 r13 r14 3 03 2 15 100 101 102 103 104 105 100,101,102,103, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1 03,15 r1 r13 r14 3 03 2 15 100 101 102 103 104 105 100,101,102,103, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1 03,15,15 r1 r13 r14 3 03 2 15 100 101 102 103 104 105 100,101,102,103, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1 03,15,15 r1 r13 r14 3 03 2 15 100 101 102 103 104 105 100,101,102,103, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1 03,15,15 r1 r13 r14 3 03 2 15 100 101 102 103 104 105 100,101,102,103, 104,105 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1 03,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1 03,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1 03,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 03,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 03,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 03,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 1 03,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 1 03,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 1 03,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 1 03,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 1 03,15,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 1 03,15,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1 1 03,15,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1 1 03,15,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1 1,1 03,15,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1 1,1 03,15,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1 1,1 03,15,15,15,15, 15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1 1,1 03,15,15,15,15, 15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2 1,1 03,15,15,15,15, 15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2 1,1 03,15,15,15,15, 15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2 1,1,2 03,15,15,15,15, 15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2 1,1,2 03,15,15,15,15, 15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2 1,1,2 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2 1,1,2 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102,101 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2,3 1,1,2 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102,101 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2,3 1,1,2 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102,101, 100 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2,3 1,1,2,6 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102,101, 100 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2,3 1,1,2,6 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102,101, 100 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2,3 1,1,2,6 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102,101, 100 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2,3 1,1,2,6 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102,101, 100 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4

More Related Content

PPT
커널코드분석 20140621(head.s restart)
byDongpyo Lee
 
PPT
Removal Of Recursion
byRicha Sharma
 
PPT
Government resources
byKatie Avery
 
PPT
computer notes - Data Structures - 14
byecomputernotes
 
PPT
Computer notes - Recursive
byecomputernotes
 
PPTX
Tutorial practica
byMiguel Angel Alva Pumarejo
 
PPTX
practica 7
byMiguel Angel Alva Pumarejo
 
PPTX
Presentacion
byMiguel Angel Alva Pumarejo
 
커널코드분석 20140621(head.s restart)
byDongpyo Lee
 
Removal Of Recursion
byRicha Sharma
 
Government resources
byKatie Avery
 
computer notes - Data Structures - 14
byecomputernotes
 
Computer notes - Recursive
byecomputernotes
 
Tutorial practica
byMiguel Angel Alva Pumarejo
 
practica 7
byMiguel Angel Alva Pumarejo
 
Presentacion
byMiguel Angel Alva Pumarejo
 

Viewers also liked

PDF
Learn Japanesse
byLisbeth Herrera
 
PPTX
Kaspersky Kesb ep10 no_cm_v01a
byIgor Pandzic
 
PPTX
Info ars napredno google pretrazivanje
byIgor Pandzic
 
PPTX
Ikt udruzenje Pk FBiH - 02-12-2014 - jahorina
byIgor Pandzic
 
PDF
Còpia de taula de fitxers
byzire22
 
PPTX
Team 5 Website Presentation Rough Draft.
byKKmck
 
PPT
Want to know how to find a reliable locksmith
byninzmiller
 
PPT
Digitalna agenda Dalibor Drljača
byIgor Pandzic
 
PDF
Projekat web Igor Pandžić
byIgor Pandzic
 
PPTX
My magazine pitch
bykatiess07
 
PPTX
Connect to Community Old Town
byaruban21
 
PPTX
Copyright & fair use
byakirkpatri
 
Learn Japanesse
byLisbeth Herrera
 
Kaspersky Kesb ep10 no_cm_v01a
byIgor Pandzic
 
Info ars napredno google pretrazivanje
byIgor Pandzic
 
Ikt udruzenje Pk FBiH - 02-12-2014 - jahorina
byIgor Pandzic
 
Còpia de taula de fitxers
byzire22
 
Team 5 Website Presentation Rough Draft.
byKKmck
 
Want to know how to find a reliable locksmith
byninzmiller
 
Digitalna agenda Dalibor Drljača
byIgor Pandzic
 
Projekat web Igor Pandžić
byIgor Pandzic
 
My magazine pitch
bykatiess07
 
Connect to Community Old Town
byaruban21
 
Copyright & fair use
byakirkpatri
 

Similar to tracing a recursive factorial function in assembly language

PPTX
Chapter_04_ARM_Assembly ARM assembly language is the low-level programming.pptx
byElisée Ndjabu
 
PPTX
Chapter_04_ARM_Assembly.pptx ARM ASSEMBLY CODE
byNagarathnaRajur2
 
PPTX
stack.pptx
byKalimuthuVelappan
 
PDF
Data Structure - Lecture 2 - Recursion Stack Queue.pdf
bydonotreply20
 
PPT
chapter2- Machine Instructions and Programs.ppt
bysandipsahgbs12345
 
PDF
ARM procedure calling conventions and recursion
byStephan Cadene
 
PPT
Ilfak Guilfanov - Decompiler internals: Microcode [rooted2018]
byRootedCON
 
PPTX
Android virtual machine internals
byShaul Rosenzwieg
 
PDF
reductio [ad absurdum]
byShakacon
 
PPT
computer organization and architecture presentation
byDrVasanthi3
 
PDF
Cse115 lecture08repetitionstructures part02
byMd. Ashikur Rahman
 
PPT
PattPatelCh05.ppt
byDipakShow2
 
PDF
Creating a Fibonacci Generator in Assembly - by Willem van Ketwich
byWillem van Ketwich
 
PPTX
Presentation on Elementary data structures
byKuber Chandra
 
PDF
Virtual machine and javascript engine
byDuoyi Wu
 
PDF
Recursion For the Rest of Us (CS Fundamentals Series)
byHaseeb Qureshi
 
DOCX
Loops
byInternational Islamic University
 
PDF
Fix assembly Code new peoblem on call printf gt .pdf
byrchopra4
 
PPT
Al2ed chapter2
byAbdullelah Al-Fahad
 
PPTX
data structure with algoritham vtu 2 module 1st sem 2023.pptx
byhemanthkumar40680
 
Chapter_04_ARM_Assembly ARM assembly language is the low-level programming.pptx
byElisée Ndjabu
 
Chapter_04_ARM_Assembly.pptx ARM ASSEMBLY CODE
byNagarathnaRajur2
 
stack.pptx
byKalimuthuVelappan
 
Data Structure - Lecture 2 - Recursion Stack Queue.pdf
bydonotreply20
 
chapter2- Machine Instructions and Programs.ppt
bysandipsahgbs12345
 
ARM procedure calling conventions and recursion
byStephan Cadene
 
Ilfak Guilfanov - Decompiler internals: Microcode [rooted2018]
byRootedCON
 
Android virtual machine internals
byShaul Rosenzwieg
 
reductio [ad absurdum]
byShakacon
 
computer organization and architecture presentation
byDrVasanthi3
 
Cse115 lecture08repetitionstructures part02
byMd. Ashikur Rahman
 
PattPatelCh05.ppt
byDipakShow2
 
Creating a Fibonacci Generator in Assembly - by Willem van Ketwich
byWillem van Ketwich
 
Presentation on Elementary data structures
byKuber Chandra
 
Virtual machine and javascript engine
byDuoyi Wu
 
Recursion For the Rest of Us (CS Fundamentals Series)
byHaseeb Qureshi
 
Loops
byInternational Islamic University
 
Fix assembly Code new peoblem on call printf gt .pdf
byrchopra4
 
Al2ed chapter2
byAbdullelah Al-Fahad
 
data structure with algoritham vtu 2 module 1st sem 2023.pptx
byhemanthkumar40680
 

Recently uploaded

PDF
First Semester BCA Exam 2025 – Constitution Values – 1 Solved Answers.pdf
byKuvempu University
 
PPTX
CHAPTER NO. 05 DIURETICS PHARMACOGNOSY.pptx
byGanu Gavade
 
PPTX
SIZE REDUCTION Prepared By: Ms. Vaishnavi Ghormade
byvaishnavighormade199
 
PPTX
CHAPTER NO.6 PLANT FIBRES USED AS SURGICAL DRESSINGS.pptx
byGanu Gavade
 
PPTX
CHAPTER NO. 09 HCP BY GG LABORATORY CLINICAL TEST
byGanu Gavade
 
PDF
Introduction to Pharmacology-Definition, scope, Historical landmark Nature an...
byvidyampatil443
 
PPTX
Capacity Building Programme for Teachers on Equitable and Inclusive Education
byMUKHTAR133762
 
PDF
Pharmaceutical Biotechnology unitI Notes
byBhagyashree Prakash Gajbhare
 
PPTX
How to use sorted() method in Odoo 18
byCeline George
 
PPTX
How to use filtered() method in Odoo 18
byCeline George
 
PDF
Application of ICT Lecture 5 ICT in Personal Finance and Shopping.pdf
byKhalil Khan Marwat
 
PDF
how to write your (written) research instruments
byThelma Villaflores
 
PDF
Application of ICT Lecture 2 Basic ICT Productivity Tools.pdf
byKhalil Khan Marwat
 
PPTX
No Storage Needed! Odoo Cross-Docking
byCeline George
 
PPTX
SPECIAL STSAINS USED IN HISTOPATHOLOGY.pptx
byKISMAT ALI
 
PPTX
How to Configure Discount Code in Odoo 18 Sales
byCeline George
 
PPTX
How to Manage Sorting Cart by Category in Odoo 18 POS
byCeline George
 
PDF
PROBLEM SLOVING AND PYTHON PROGRAMMING Unit 1.pdf
byA R SIVANESH M.E., (Ph.D)
 
PPTX
DIGITAL TRANSFORMATION MODULE KEY POINTS
byLisa Harris
 
PPTX
English 8 Q3 Wk6.pptx prewriting opinion editorial article
byjacquelyncastre03
 
First Semester BCA Exam 2025 – Constitution Values – 1 Solved Answers.pdf
byKuvempu University
 
CHAPTER NO. 05 DIURETICS PHARMACOGNOSY.pptx
byGanu Gavade
 
SIZE REDUCTION Prepared By: Ms. Vaishnavi Ghormade
byvaishnavighormade199
 
CHAPTER NO.6 PLANT FIBRES USED AS SURGICAL DRESSINGS.pptx
byGanu Gavade
 
CHAPTER NO. 09 HCP BY GG LABORATORY CLINICAL TEST
byGanu Gavade
 
Introduction to Pharmacology-Definition, scope, Historical landmark Nature an...
byvidyampatil443
 
Capacity Building Programme for Teachers on Equitable and Inclusive Education
byMUKHTAR133762
 
Pharmaceutical Biotechnology unitI Notes
byBhagyashree Prakash Gajbhare
 
How to use sorted() method in Odoo 18
byCeline George
 
How to use filtered() method in Odoo 18
byCeline George
 
Application of ICT Lecture 5 ICT in Personal Finance and Shopping.pdf
byKhalil Khan Marwat
 
how to write your (written) research instruments
byThelma Villaflores
 
Application of ICT Lecture 2 Basic ICT Productivity Tools.pdf
byKhalil Khan Marwat
 
No Storage Needed! Odoo Cross-Docking
byCeline George
 
SPECIAL STSAINS USED IN HISTOPATHOLOGY.pptx
byKISMAT ALI
 
How to Configure Discount Code in Odoo 18 Sales
byCeline George
 
How to Manage Sorting Cart by Category in Odoo 18 POS
byCeline George
 
PROBLEM SLOVING AND PYTHON PROGRAMMING Unit 1.pdf
byA R SIVANESH M.E., (Ph.D)
 
DIGITAL TRANSFORMATION MODULE KEY POINTS
byLisa Harris
 
English 8 Q3 Wk6.pptx prewriting opinion editorial article
byjacquelyncastre03
 

tracing a recursive factorial function in assembly language

  • 1.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... r1 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 2.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... r1 3 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 3.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... r1 3 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 100 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 4.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 CPU Registers Memory ??? r1 r13 r14 100 101 102 103 104 105 r15 100 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 5.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 100 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 6.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 100 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 7.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 100 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 8.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 100 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 9.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 100,101 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 10.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 100 101 102 103 104 105 r15 100,101 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 11.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 3 100 101 102 103 104 105 r15 100,101 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 12.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 3 100 101 102 103 104 105 r15 100,101,102 "the stack" input: x return value (the "result") return address (line #) the stack pointer r15 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 13.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... 3 03 r1 r13 r14 CPU Registers Memory 3 03 100 101 102 103 104 105 r15 100,101,102 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 14.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3, 2 03 r1 r13 r14 3 03 100 101 102 103 104 105 r15 100,101,102 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 15.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03 r1 r13 r14 3 03 100 101 102 103 104 105 r15 100,101,102 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 16.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03,15 r1 r13 r14 3 03 100 101 102 103 104 105 r15 100,101,102 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 17.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03,15 r1 r13 r14 3 03 100 101 102 103 104 105 r15 100,101,102 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 18.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03,15 r1 r13 r14 3 03 100 101 102 103 104 105 r15 100,101,102 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 19.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03,15 r1 r13 r14 3 03 100 101 102 103 104 105 r15 100,101,102,103 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 20.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03,15 r1 r13 r14 3 03 2 100 101 102 103 104 105 r15 100,101,102,103 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 21.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03,15 r1 r13 r14 3 03 2 100 101 102 103 104 105 100,101,102,103, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 22.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2 03,15 r1 r13 r14 3 03 2 15 100 101 102 103 104 105 100,101,102,103, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 23.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1 03,15 r1 r13 r14 3 03 2 15 100 101 102 103 104 105 100,101,102,103, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 24.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1 03,15,15 r1 r13 r14 3 03 2 15 100 101 102 103 104 105 100,101,102,103, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 25.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1 03,15,15 r1 r13 r14 3 03 2 15 100 101 102 103 104 105 100,101,102,103, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 26.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1 03,15,15 r1 r13 r14 3 03 2 15 100 101 102 103 104 105 100,101,102,103, 104,105 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 27.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1 03,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 28.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1 03,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 29.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1 03,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 30.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 03,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 31.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 03,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 32.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 03,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 33.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 1 03,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 34.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 1 03,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 35.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 1 03,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 36.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 1 03,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 37.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 1 03,15,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 38.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0 1 03,15,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 39.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1 1 03,15,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 40.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1 1 03,15,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 41.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1 1,1 03,15,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 42.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1 1,1 03,15,15,15,15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 43.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1 1,1 03,15,15,15,15, 15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 44.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1 1,1 03,15,15,15,15, 15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 45.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2 1,1 03,15,15,15,15, 15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 46.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2 1,1 03,15,15,15,15, 15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 47.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2 1,1,2 03,15,15,15,15, 15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 48.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2 1,1,2 03,15,15,15,15, 15 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 49.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2 1,1,2 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 50.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2 1,1,2 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102,101 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 51.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2,3 1,1,2 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102,101 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 52.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2,3 1,1,2 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102,101, 100 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 53.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2,3 1,1,2,6 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102,101, 100 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 54.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2,3 1,1,2,6 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102,101, 100 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 55.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2,3 1,1,2,6 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102,101, 100 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4
  • 56.
    main factorial store to stack recursive case load from stack base case Trace what happens for an input of 3... CPU Registers Memory 3,2,1,0,1,2,3 1,1,2,6 03,15,15,15,15, 15,03 r1 r13 r14 3 03 2 15 1 100 101 102 103 104 105 100,101,102,103, 104,105,106,105, 104,103,102,101, 100 r15 "the stack" input: x return value (the "result") return address (line #) the stack pointer 00 read r1 01 setn r15 100 02 call r14 06 03 write r13 04 halt 05 nop 06 jnez r1 09 07 setn r13 1 08 jumpr r14 09 addn r15 1 10 storer r1 r15 11 addn r15 1 12 storer r14 r15 13 addn r1 -1 14 call r14 06 15 loadr r14 r15 16 addn r15 -1 17 loadr r1 r15 18 addn r15 -1 19 mul r13 r13 r1 20 jumpr r14 106 107 It's easy to get lost! 15 Follow the line numbers below to stay on track... r15 0, 1, 2, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 9, 10, 11, 12, 13, 14, 6, 7, 8 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 3, 4