-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathvirtual_machine.sf
94 lines (78 loc) · 1.67 KB
/
virtual_machine.sf
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#!/usr/bin/ruby
#
## Inspired by Tom Hudson: https://www.youtube.com/watch?v=GjGRhIl0xWs
#
enum (
PUSH,
ADD,
PRINT,
HALT,
JMPLT,
);
struct Op {
String name,
Number nargs,
}
var ops = Hash.new(
PUSH, Op("push", 1),
ADD, Op("add", 0),
PRINT, Op("print", 0),
HALT, Op("halt", 0),
JMPLT, Op("jmplt", 2),
);
class VM {
has code = []
has pc = 0
has stack = []
has sp = -1
method trace {
var op = ops{code[pc]};
var args = code.slice(pc+1, op.nargs);
printf("%04d:%-10s%20s%40s\n", pc, op.name, args, stack);
}
method run(c=[]) {
code = c;
loop {
# Trace
self.trace();
# Fetch
var op = code[pc++];
# Decode
given(op) {
when (PUSH) {
var val = code[pc++];
stack[++sp] = val;
}
when (ADD) {
var a = stack[sp--];
var b = stack[sp--];
stack[++sp] = a+b;
}
when (PRINT) {
var val = stack[sp--];
say val;
}
when (JMPLT) {
var lt = code[pc++];
var addr = code[pc++];
if (stack[sp] < lt) {
pc = addr;
}
}
when (HALT) {
return();
}
}
}
}
}
var code = [
PUSH, 2,
PUSH, 3,
ADD,
JMPLT, 10, 2,
PRINT,
HALT,
];
var v = VM();
v.run(code);