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
|
package bjc.pratt.commands;
import bjc.pratt.NonInitialCommand;
import bjc.pratt.ParseBlock;
import bjc.pratt.ParserContext;
import bjc.pratt.Token;
import bjc.utils.data.ITree;
import bjc.utils.data.Tree;
import bjc.utils.parserutils.ParserException;
/**
* A non-initial command that delegates all of the work to a {@link ParseBlock}
*
* @author bjculkin
*
* @param <K>
* The token key type.
*
* @param <V>
* The token value type.
*
* @param <C>
* The parser state type.
*/
public class BlockNonInitialCommand<K, V, C> extends NonInitialCommand<K, V, C> {
private final ParseBlock<K, V, C> innr;
private final int lftBind;
private final int nxtBind;
private final Token<K, V> trm;
/**
* Create a new non-initial command that delegates to a parse block.
*
* @param inner
* The parse block to delegate to.
*
* @param leftBind
* The left binding power (precedence).
*
* @param rightBind
* The right binding power (associativity control).
*
* @param term
* The token to use as the node in the AST.
*/
public BlockNonInitialCommand(final ParseBlock<K, V, C> inner, final int leftBind, final int rightBind,
final Token<K, V> term) {
innr = inner;
lftBind = leftBind;
nxtBind = rightBind;
trm = term;
}
@Override
public ITree<Token<K, V>> denote(final ITree<Token<K, V>> operand, final Token<K, V> operator,
final ParserContext<K, V, C> ctx) throws ParserException {
final ITree<Token<K, V>> expression = innr.parse(ctx);
return new Tree<>(trm, expression);
}
@Override
public int leftBinding() {
return lftBind;
}
@Override
public int nextBinding() {
return nxtBind;
}
}
|
