1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
# Simple recursive fibonacci implementation, roughly equivalent to:
#
# int fibonacci (int arg)
# {
# if (arg < 2)
# return arg
# return fibonacci (arg-1) + fibonacci (arg-2)
# }
# Initial state:
# stack: [arg]
# 0:
DUP
# stack: [arg, arg]
# 1:
PUSH_CONST 2
# stack: [arg, arg, 2]
# 2:
BINARY_COMPARE_LT
# stack: [arg, (arg < 2)]
# 3:
JUMP_ABS_IF_TRUE 13
# stack: [arg]
# 4:
DUP
# stack: [arg, arg]
# 5:
PUSH_CONST 1
# stack: [arg, arg, 1]
# 6:
BINARY_SUBTRACT
# stack: [arg, (arg - 1)
# 7:
RECURSE
# stack: [arg, fib(arg - 1)]
# 8:
ROT
# stack: [fib(arg - 1), arg]
# 9:
PUSH_CONST 2
# stack: [fib(arg - 1), arg, 2]
# 10:
BINARY_SUBTRACT
# stack: [fib(arg - 1), arg, (arg - 2)
# 11:
RECURSE
# stack: [fib(arg - 1), fib(arg - 1)]
# 12:
BINARY_ADD
# stack: [fib(arg - 1) + fib(arg - 1)]
# 13:
RETURN
|
