blob: 7a136064a52e434ddcb38d77b82e3f10648a3a91 (
plain)
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
|
module primitives.core;
import std.stdio;
import std.variant;
import std.conv : to;
import std.algorithm : map;
import state.stack;
bool handle(Token token) {
return token.visit!(
(int ) => false,
(bool ) => false,
(string word) => handle(word),
(DList!int ) => false
);
}
private {
bool handle(string word) {
switch ( word ) {
case "+" : binary_op_add; break;
case "*" : binary_op_multiply; break;
case "/" : binary_op_divide; break;
case "%" : binary_op_modulo; break;
case "." : unary_op_io_print; break;
case "pop" : unary_op_stack_pop; break;
case "dup" : unary_op_stack_dup; break;
case "swp" : binary_op_stack_swp; break;
case "ovr" : binary_op_stack_ovr; break;
case ":" : binary_op_vector_cons; break;
case "rot" : ternary_op_stack_rot; break;
case "true" : nullary_op_value_bool(true); break;
case "false" : nullary_op_value_bool(false); break;
case "not" : unary_op_negate; break;
case "and" : binary_cond_and; break;
case "or" : binary_cond_or; break;
case "<" : binary_cond_lt; break;
case "=" : binary_cond_eq; break;
case "#" : debug_print_stack; break;
default : return false;
}
return true;
}
void binary_op_add() {
int b = stack.pop.get!int;
stack.pop.tryVisit!(
(int a) => stack.push(a + b),
(DList!int v) => stack.push(v[].map!(x => x + b).to!(DList!int))
);
}
void binary_op_multiply() {
int b = stack.pop.get!int;
stack.pop.tryVisit!(
(int a) => stack.push(a * b),
(DList!int v) => stack.push(v[].map!(x => x * b).to!(DList!int))
);
}
void binary_op_divide() {
int b = stack.pop.get!int;
int a = stack.pop.get!int;
if ( b == 0 ) {
throw new Exception("division by 0 undefined");
} else {
stack.push(a / b);
}
}
void binary_op_modulo() {
int b = stack.pop.get!int;
int a = stack.pop.get!int;
if ( b == 0 ) {
throw new Exception("modulo 0 undefined");
} else {
stack.push(a % b);
}
}
void binary_op_vector_cons() {
int b = stack.pop.get!int;
stack.pop.tryVisit!(
(int a) => stack.push(DList!int(a, b)),
(DList!int v) => stack.push(v ~ b)
);
}
void unary_op_io_print() {
stack.top.visit!(
(int x) => writeln(x),
(bool b) => writeln(b),
(string word) => writeln(word),
(DList!int v) => writeln(v[])
);
}
void unary_op_stack_pop() {
stack.pop;
}
void unary_op_stack_dup() {
stack.push(stack.top);
}
void binary_op_stack_swp() {
auto b = stack.pop;
auto a = stack.pop;
stack.push(b);
stack.push(a);
}
void binary_op_stack_ovr() {
auto b = stack.pop;
auto a = stack.pop;
stack.push(a);
stack.push(b);
stack.push(a);
}
void ternary_op_stack_rot() {
auto c = stack.pop;
auto b = stack.pop;
auto a = stack.pop;
stack.push(b);
stack.push(c);
stack.push(a);
}
void nullary_op_value_bool(bool value) {
stack.push(Token(value));
}
void unary_op_negate() {
bool a = stack.pop.get!bool;
stack.push(Token(!a));
}
void binary_cond_and() {
bool b = stack.pop.get!bool;
bool a = stack.pop.get!bool;
stack.push(Token(a && b));
}
void binary_cond_or() {
bool b = stack.pop.get!bool;
bool a = stack.pop.get!bool;
stack.push(Token(a || b));
}
void binary_cond_lt() {
int b = stack.pop.get!int;
int a = stack.pop.get!int;
stack.push(a < b);
}
void binary_cond_eq() {
auto b = stack.pop;
auto a = stack.pop;
stack.push(a == b);
}
void debug_print_stack() {
writeln(stack[]);
}
}
|
