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
|
package bjc.utils.parserutils.pratt;
import bjc.utils.data.ITree;
import bjc.utils.data.Tree;
import bjc.utils.parserutils.ParserException;
/**
* * Contains factory methods for producing common implementations of
* {@link NullCommand}
*
* @author EVE
*
*/
public class NullCommands {
private static abstract class AbstractNullCommand<K, V, C> extends NullCommand<K, V, C> {
@Override
public ITree<Token<K, V>> nullDenotation(Token<K, V> operator, ParserContext<K, V, C> ctx)
throws ParserException {
// tokens.next();
return intNullDenotation(operator, ctx);
}
protected abstract ITree<Token<K, V>> intNullDenotation(Token<K, V> operator, ParserContext<K, V, C> ctx)
throws ParserException;
}
private static class UnaryCommand<K, V, C> extends AbstractNullCommand<K, V, C> {
private final int nullPwer;
public UnaryCommand(int nullPower) {
nullPwer = nullPower;
}
@Override
protected ITree<Token<K, V>> intNullDenotation(Token<K, V> operator, ParserContext<K, V, C> ctx)
throws ParserException {
ITree<Token<K, V>> opr = ctx.parse.parseExpression(nullPwer, ctx.tokens, ctx.state, false);
return new Tree<>(operator, opr);
}
}
private static class GroupingCommand<K, V, C> extends AbstractNullCommand<K, V, C> {
private K term;
private Token<K, V> mark;
private int inner;
public GroupingCommand(int innerPrec, K terminator, Token<K, V> marker) {
inner = innerPrec;
term = terminator;
mark = marker;
}
@SuppressWarnings("unchecked")
@Override
protected ITree<Token<K, V>> intNullDenotation(Token<K, V> operator, ParserContext<K, V, C> ctx)
throws ParserException {
ITree<Token<K, V>> opr = ctx.parse.parseExpression(inner, ctx.tokens, ctx.state, false);
ctx.tokens.expect(term);
return new Tree<>(mark, opr);
}
}
private static class LeafCommand<K, V, C> extends NullCommand<K, V, C> {
@Override
public ITree<Token<K, V>> nullDenotation(Token<K, V> operator, ParserContext<K, V, C> ctx)
throws ParserException {
return new Tree<>(operator);
}
}
private static class ConstantCommand<K, V, C> extends NullCommand<K, V, C> {
private ITree<Token<K, V>> val;
public ConstantCommand(ITree<Token<K, V>> con) {
val = con;
}
@Override
public ITree<Token<K, V>> nullDenotation(Token<K, V> operator, ParserContext<K, V, C> ctx)
throws ParserException {
return val;
}
}
private static class PreTernaryCommand<K, V, C> extends AbstractNullCommand<K, V, C> {
private int cond1;
private int block1;
private int block2;
private K mark1;
private K mark2;
private Token<K, V> term;
public PreTernaryCommand(int cond1, int block1, int block2, K mark1, K mark2, Token<K, V> term) {
super();
this.cond1 = cond1;
this.block1 = block1;
this.block2 = block2;
this.mark1 = mark1;
this.mark2 = mark2;
this.term = term;
}
@SuppressWarnings("unchecked")
@Override
protected ITree<Token<K, V>> intNullDenotation(Token<K, V> operator, ParserContext<K, V, C> ctx)
throws ParserException {
ITree<Token<K, V>> cond = ctx.parse.parseExpression(cond1, ctx.tokens, ctx.state, false);
ctx.tokens.expect(mark1);
ITree<Token<K, V>> fstBlock = ctx.parse.parseExpression(block1, ctx.tokens, ctx.state, false);
ctx.tokens.expect(mark2);
ITree<Token<K, V>> sndBlock = ctx.parse.parseExpression(block2, ctx.tokens, ctx.state, false);
return new Tree<>(term, cond, fstBlock, sndBlock);
}
}
/**
* Create a new unary operator.
*
* @param precedence
* The precedence of the operator.
*
* @return A command implementing that operator.
*/
public static <K, V, C> NullCommand<K, V, C> unary(int precedence) {
return new UnaryCommand<>(precedence);
}
/**
* Create a new grouping operator.
*
* @param precedence
* The precedence of the expression in the operator.
*
* @param term
* The type that closes the group.
*
* @param mark
* The token for the AST node of the group.
*
* @return A command implementing the operator.
*/
public static <K, V, C> NullCommand<K, V, C> grouping(int precedence, K term, Token<K, V> mark) {
return new GroupingCommand<>(precedence, term, mark);
}
/**
* Create a new leaf operator.
*
* @return A command implementing the operator.
*/
public static <K, V, C> NullCommand<K, V, C> leaf() {
return new LeafCommand<>();
}
/**
* Create a new pre-ternary operator, like an if-then-else statement.
*
* @param cond1
* The priority of the first block.
*
* @param block1
* The priority of the second block.
*
* @param block2
* The priority of the third block.
*
* @param mark1
* The marker that ends the first block.
*
* @param mark2
* The marker that ends the second block.
*
* @param term
* The token for the AST node of the group.
*
* @return A command implementing the operator.
*/
public static <K, V, C> NullCommand<K, V, C> preTernary(int cond1, int block1, int block2, K mark1, K mark2,
Token<K, V> term) {
return new PreTernaryCommand<>(cond1, block1, block2, mark1, mark2, term);
}
/**
* Create a new named constant.
*
* @param val
* The value of the constant.
*
* @return A command implementing the constant.
*/
public static <K, V, C> NullCommand<K, V, C> constant(ITree<Token<K, V>> val) {
return new ConstantCommand<>(val);
}
}
|
