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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
|
package bjc.dicelang.v2;
import bjc.utils.data.ITree;
import bjc.utils.data.Tree;
import bjc.utils.data.TopDownTransformIterator;
import bjc.utils.data.TopDownTransformResult;
import java.util.Iterator;
import java.util.function.Consumer;
import static bjc.dicelang.v2.Errors.ErrorKey.*;
import static bjc.dicelang.v2.EvaluatorResult.Type.*;
public class Evaluator {
private static class Context {
public Consumer<Iterator<ITree<Node>>> thunk;
public boolean isDebug;
}
private static Node FAIL() {
return new Node(Node.Type.RESULT, new EvaluatorResult(EvaluatorResult.Type.FAILURE));
}
private static Node FAIL(ITree<Node> orig) {
return new Node(Node.Type.RESULT, new EvaluatorResult(EvaluatorResult.Type.FAILURE, orig));
}
private static Node FAIL(Node orig) {
return new Node(Node.Type.RESULT, new EvaluatorResult(EvaluatorResult.Type.FAILURE, orig));
}
private static Node FAIL(EvaluatorResult res) {
return new Node(Node.Type.RESULT, new EvaluatorResult(EvaluatorResult.Type.FAILURE, new Node(Node.Type.RESULT, res)));
}
private DiceLangEngine eng;
public Evaluator(DiceLangEngine en) {
eng = en;
}
public EvaluatorResult evaluate(ITree<Node> comm) {
Context ctx = new Context();
ctx.isDebug = false;
ctx.thunk = (itr) -> {
// Deliberately finish the iterator, but ignore results. It's only for stepwise evaluation
// but we don't know if stepping the iterator causes something to happen
while(itr.hasNext()) itr.next();
};
return comm.topDownTransform(this::pickEvaluationType,
(node) -> this.evaluateNode(node, ctx)).getHead().resultVal;
}
public Iterator<ITree<Node>> stepDebug(ITree<Node> comm) {
Context ctx = new Context();
ctx.isDebug = true;
return new TopDownTransformIterator<>(this::pickEvaluationType, (node, thnk) -> {
ctx.thunk = thnk;
return this.evaluateNode(node, ctx);
}, comm);
}
private TopDownTransformResult pickEvaluationType(Node nd) {
switch(nd.type) {
case UNARYOP:
switch(nd.operatorType) {
case COERCE:
return TopDownTransformResult.RTRANSFORM;
default:
return TopDownTransformResult.PUSHDOWN;
}
default:
return TopDownTransformResult.PUSHDOWN;
}
}
private ITree<Node> evaluateNode(ITree<Node> ast, Context ctx) {
switch(ast.getHead().type) {
case UNARYOP:
return evaluateUnaryOp(ast, ctx);
case BINOP:
return evaluateBinaryOp(ast, ctx);
case TOKREF:
return evaluateTokenRef(ast.getHead().tokenVal, ctx);
case ROOT:
return ast.getChild(ast.getChildrenCount() - 1);
default:
Errors.inst.printError(EK_EVAL_INVNODE, ast.getHead().type.toString());
return new Tree<>(FAIL(ast));
}
}
private ITree<Node> evaluateUnaryOp(ITree<Node> ast, Context ctx) {
switch(ast.getHead().operatorType) {
case COERCE:
if(ast.getChildrenCount() != 1) {
Errors.inst.printError(EK_EVAL_UNUNARY, Integer.toString(ast.getChildrenCount()));
return new Tree<>(FAIL(ast));
}
break;
default:
Errors.inst.printError(EK_EVAL_INVUNARY, ast.getHead().operatorType.toString());
return new Tree<>(FAIL(ast));
}
// @TODO remove me
return new Tree<>(FAIL(ast));
}
private ITree<Node> evaluateBinaryOp(ITree<Node> ast, Context ctx) {
Token.Type binOp = ast.getHead().operatorType;
if(ast.getChildrenCount() != 2) {
Errors.inst.printError(EK_EVAL_INVBIN, Integer.toString(ast.getChildrenCount()));
return new Tree<>(FAIL(ast));
}
ITree<Node> left = ast.getChild(0);
ITree<Node> right = ast.getChild(1);
switch(binOp) {
case ADD:
case SUBTRACT:
case MULTIPLY:
case DIVIDE:
case IDIVIDE:
return evaluateMathBinary(binOp,
left.getHead().resultVal, right.getHead().resultVal,
ctx);
case DICEGROUP:
case DICECONCAT:
case DICELIST:
return evaluateDiceBinary(binOp,
left.getHead().resultVal, right.getHead().resultVal,
ctx);
default:
Errors.inst.printError(EK_EVAL_UNBIN, binOp.toString());
return new Tree<>(FAIL(ast));
}
}
private ITree<Node> evaluateDiceBinary(Token.Type op,
EvaluatorResult left, EvaluatorResult right, Context ctx) {
EvaluatorResult res = null;
switch(op) {
case DICEGROUP:
if(left.type == DICE && !left.diceVal.isList) {
if(right.type == DICE && !right.diceVal.isList) {
res = new EvaluatorResult(DICE,
new DiceBox.SimpleDie(left.diceVal.scalar, right.diceVal.scalar));
} else if (right.type == INT) {
res = new EvaluatorResult(DICE, new DiceBox.SimpleDie(left.diceVal.scalar, right.intVal));
} else {
Errors.inst.printError(EK_EVAL_INVDGROUP, right.type.toString());
return new Tree<>(FAIL(right));
}
} else if(left.type == INT) {
if(right.type == DICE && !right.diceVal.isList) {
res = new EvaluatorResult(DICE, new DiceBox.SimpleDie(left.intVal, right.diceVal.scalar));
} else if (right.type == INT) {
res = new EvaluatorResult(DICE, new DiceBox.SimpleDie(left.intVal, right.intVal));
} else {
Errors.inst.printError(EK_EVAL_INVDGROUP, right.type.toString());
return new Tree<>(FAIL(right));
}
} else {
Errors.inst.printError(EK_EVAL_INVDGROUP, left.type.toString());
return new Tree<>(FAIL(left));
}
case DICECONCAT:
if(left.type != DICE || left.diceVal.isList) {
Errors.inst.printError(EK_EVAL_INVDICE, left.type.toString());
return new Tree<>(FAIL(left));
} else if(right.type != DICE || right.diceVal.isList) {
Errors.inst.printError(EK_EVAL_INVDICE, right.type.toString());
return new Tree<>(FAIL(right));
} else {
res = new EvaluatorResult(DICE,
new DiceBox.CompoundDie(left.diceVal.scalar, right.diceVal.scalar));
}
break;
case DICELIST:
if(left.type != DICE || left.diceVal.isList) {
Errors.inst.printError(EK_EVAL_INVDICE, left.type.toString());
return new Tree<>(FAIL(left));
} else if(right.type != DICE || right.diceVal.isList) {
Errors.inst.printError(EK_EVAL_INVDICE, right.type.toString());
return new Tree<>(FAIL(right));
} else {
res = new EvaluatorResult(DICE,
new DiceBox.SimpleDieList(left.diceVal.scalar, right.diceVal.scalar));
}
break;
default:
Errors.inst.printError(EK_EVAL_UNDICE, op.toString());
return new Tree<>(FAIL());
}
return new Tree<>(new Node(Node.Type.RESULT, res));
}
private ITree<Node> evaluateMathBinary(Token.Type op,
EvaluatorResult left, EvaluatorResult right, Context ctx) {
if(left.type == EvaluatorResult.Type.DICE || right.type == EvaluatorResult.Type.DICE) {
System.out.println("\tEVALUATOR ERROR: Math on dice isn't supported yet");
return new Tree<>(FAIL());
} else if(left.type == EvaluatorResult.Type.STRING || right.type == EvaluatorResult.Type.STRING) {
Errors.inst.printError(EK_EVAL_STRINGMATH);
return new Tree<>(FAIL());
} else if(left.type == EvaluatorResult.Type.FAILURE || right.type == EvaluatorResult.Type.FAILURE) {
return new Tree<>(FAIL());
} else if(left.type == EvaluatorResult.Type.INT && right.type != EvaluatorResult.Type.INT) {
Errors.inst.printError(EK_EVAL_MISMATH);
return new Tree<>(FAIL(right));
} else if(left.type == EvaluatorResult.Type.FLOAT && right.type != EvaluatorResult.Type.FLOAT) {
Errors.inst.printError(EK_EVAL_MISMATH);
return new Tree<>(FAIL(right));
} else if(right.type == EvaluatorResult.Type.INT && left.type != EvaluatorResult.Type.INT) {
Errors.inst.printError(EK_EVAL_MISMATH);
return new Tree<>(FAIL(left));
} else if(right.type == EvaluatorResult.Type.FLOAT && left.type != EvaluatorResult.Type.FLOAT) {
Errors.inst.printError(EK_EVAL_MISMATH);
return new Tree<>(FAIL(left));
}
EvaluatorResult res = null;
switch(op) {
case ADD:
if(left.type == EvaluatorResult.Type.INT) {
res = new EvaluatorResult(EvaluatorResult.Type.INT, left.intVal + right.intVal);
} else {
res = new EvaluatorResult(EvaluatorResult.Type.FLOAT, left.floatVal + right.floatVal);
}
break;
case SUBTRACT:
if(left.type == EvaluatorResult.Type.INT) {
res = new EvaluatorResult(EvaluatorResult.Type.INT, left.intVal - right.intVal);
} else {
res = new EvaluatorResult(EvaluatorResult.Type.FLOAT, left.floatVal - right.floatVal);
}
break;
case MULTIPLY:
if(left.type == EvaluatorResult.Type.INT) {
res = new EvaluatorResult(EvaluatorResult.Type.INT, left.intVal * right.intVal);
} else {
res = new EvaluatorResult(EvaluatorResult.Type.FLOAT, left.floatVal * right.floatVal);
}
break;
case DIVIDE:
if(left.type == EvaluatorResult.Type.INT) {
if(right.intVal == 0) {
Errors.inst.printError(EK_EVAL_DIVZERO);
res = new EvaluatorResult(EvaluatorResult.Type.FAILURE, right);
} else {
res = new EvaluatorResult(EvaluatorResult.Type.FLOAT, left.intVal / right.intVal);
}
} else {
if(right.floatVal == 0) {
Errors.inst.printError(EK_EVAL_DIVZERO);
res = new EvaluatorResult(EvaluatorResult.Type.FAILURE, right);
} else {
res = new EvaluatorResult(EvaluatorResult.Type.FLOAT, left.floatVal / right.floatVal);
}
}
break;
case IDIVIDE:
if(left.type == EvaluatorResult.Type.INT) {
if(right.intVal == 0) {
Errors.inst.printError(EK_EVAL_DIVZERO);
res = new EvaluatorResult(EvaluatorResult.Type.FAILURE, right);
} else {
res = new EvaluatorResult(EvaluatorResult.Type.INT, (int) (left.intVal / right.intVal));
}
} else {
if(right.floatVal == 0) {
Errors.inst.printError(EK_EVAL_DIVZERO);
res = new EvaluatorResult(EvaluatorResult.Type.FAILURE, right);
} else {
res = new EvaluatorResult(EvaluatorResult.Type.INT, (int) (left.floatVal / right.floatVal));
}
}
break;
default:
Errors.inst.printError(EK_EVAL_UNMATH, op.toString());
return new Tree<>(FAIL());
}
return new Tree<>(new Node(Node.Type.RESULT, res));
}
private ITree<Node> evaluateTokenRef(Token tk, Context ctx) {
EvaluatorResult res = null;
switch(tk.type) {
case INT_LIT:
res = new EvaluatorResult(EvaluatorResult.Type.INT, tk.intValue);
break;
case FLOAT_LIT:
res = new EvaluatorResult(EvaluatorResult.Type.FLOAT, tk.floatValue);
break;
case DICE_LIT:
res = new EvaluatorResult(EvaluatorResult.Type.DICE, tk.diceValue);
break;
case STRING_LIT:
res = new EvaluatorResult(EvaluatorResult.Type.STRING, eng.stringLits.get((int)(tk.intValue)));
break;
default:
Errors.inst.printError(EK_EVAL_UNTOK, tk.type.toString());
res = new EvaluatorResult(EvaluatorResult.Type.FAILURE);
}
return new Tree<>(new Node(Node.Type.RESULT, res));
}
}
|
