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
|
package bjc.dicelang.v2;
import bjc.utils.funcdata.FunctionalList;
import bjc.utils.funcdata.FunctionalMap;
import bjc.utils.funcdata.IList;
import bjc.utils.funcdata.IMap;
import java.util.Deque;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Set;
import static bjc.dicelang.v2.Token.Type.*;
public class Shunter {
// The binary operators and their
// priorities
private IMap<Token.Type, Integer> ops;
// Unary operators that can only be
// applied to non-operator tokens
private Set<Token.Type> unaryAdjectives;
// Unary operators that con only be
// applied to operator tokens
private Set<Token.Type> unaryAdverbs;
private final int MATH_PREC = 20;
private final int DICE_PREC = 10;
private final int EXPR_PREC = 0;
public Shunter() {
ops = new FunctionalMap<>();
unaryAdjectives = new HashSet<>();
unaryAdverbs = new HashSet<>();
ops.put(ADD, 0 + MATH_PREC);
ops.put(SUBTRACT, 0 + MATH_PREC);
ops.put(MULTIPLY, 1 + MATH_PREC);
ops.put(IDIVIDE, 1 + MATH_PREC);
ops.put(DIVIDE, 1 + MATH_PREC);
ops.put(DICEGROUP, 0 + DICE_PREC);
ops.put(DICECONCAT, 1 + DICE_PREC);
ops.put(DICELIST, 2 + DICE_PREC);
ops.put(LET, 0 + EXPR_PREC);
ops.put(BIND, 1 + EXPR_PREC);
}
public boolean shuntTokens(IList<Token> tks, IList<Token> returned) {
Deque<Token> opStack = new LinkedList<>();
boolean unaryMode = false;
Deque<Token> unaryOps = new LinkedList<>();
Deque<Token> currReturned = new LinkedList<>();
for(Token tk : tks.toIterable()) {
if(unaryMode) {
if(unaryAdjectives.contains(tk.type) || unaryAdverbs.contains(tk.type)) {
unaryOps.push(tk);
continue;
}
Token currOperator = unaryOps.peek();
if(unaryAdjectives.contains(currOperator.type)) {
boolean isOp = ops.containsKey(tk.type)
|| unaryAdverbs.contains(tk.type)
|| unaryAdjectives.contains(tk.type);
if(isOp) {
System.out.printf("\tError: Unary operator %s is an"
+ " adjective, not an adverb (can't be applied"
+ " to operator %s)\n", currOperator, tk );
return false;
}
currReturned.addLast(tk);
currReturned.addLast(unaryOps.pop());
} else if (unaryAdverbs.contains(currOperator.type)) {
if(opStack.size() < 1) {
System.out.printf("\tError: Unary operators %s is an adverb,"
+ " but there is no operator to apply it to\n");
}
Token currOperand = opStack.peek();
boolean isOp = ops.containsKey(currOperand.type)
|| unaryAdverbs.contains(currOperand.type)
|| unaryAdjectives.contains(currOperand.type);
if(!isOp) {
System.out.printf("\tError: Unary operator %s is an adverb,"
+ " not an adjective (can't be applied to operand %s)\n",
currOperator, tk);
return false;
}
currReturned.addLast(tk);
currReturned.addLast(unaryOps.pop());
}
if(unaryOps.isEmpty()) unaryMode = false;
} else {
if(unaryAdjectives.contains(tk.type) || unaryAdverbs.contains(tk.type)) {
unaryMode = true;
unaryOps.add(tk);
continue;
} else if(ops.containsKey(tk.type)) {
while(!opStack.isEmpty()
&& isHigherPrec(tk.type, opStack.peek().type)) {
currReturned.addLast(opStack.pop());
}
opStack.push(tk);
} else if(tk.type == OPAREN || tk.type == OBRACE) {
opStack.push(tk);
if(tk.type == OBRACE)
currReturned.addLast(tk);
} else if(tk.type == CPAREN || tk.type == CBRACE) {
Token matching = null;
switch(tk.type) {
case CPAREN:
matching = new Token(OPAREN, tk.intValue);
break;
case CBRACE:
matching = new Token(OBRACE, tk.intValue);
break;
default:
break;
}
if(!opStack.contains(matching)) {
System.out.printf("\tError: Could not find matching grouping "
+ tk.type);
return false;
}
while(!opStack.peek().equals(matching)) {
currReturned.addLast(opStack.pop());
}
if(tk.type == CBRACE) {
currReturned.addLast(tk);
}
opStack.pop();
} else if(tk.type == GROUPSEP) {
IList<Token> group = new FunctionalList<>();
while(currReturned.size() != 0 && !currReturned.peek().isGrouper()) {
group.add(currReturned.pop());
}
while(opStack.size() != 0 && !opStack.peek().isGrouper()) {
group.add(opStack.pop());
}
if(currReturned.size() == 0) {
System.out.println("\tERROR: Didn't find grouper for group seperator to attach to");
return false;
}
currReturned.addLast(new Token(TOKGROUP, group));
} else {
currReturned.addLast(tk);
}
}
}
// Flush leftover operators
while(!opStack.isEmpty()) {
currReturned.addLast(opStack.pop());
}
for(Token tk : currReturned) {
returned.add(tk);
}
return true;
}
private boolean isHigherPrec(Token.Type left, Token.Type right) {
boolean exists = ops.containsKey(right);
// If it doesn't, the left is higher precedence.
if (!exists) {
return false;
}
int rightPrecedence = ops.get(right);
int leftPrecedence = ops.get(left);
return rightPrecedence >= leftPrecedence;
}
}
|
