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
|
package bjc.utils.parserutils.pratt.blocks;
import java.util.function.UnaryOperator;
import bjc.utils.data.ITree;
import bjc.utils.data.Tree;
import bjc.utils.parserutils.ParserException;
import bjc.utils.parserutils.pratt.ParseBlock;
import bjc.utils.parserutils.pratt.ParserContext;
import bjc.utils.parserutils.pratt.Token;
/**
* A parse block that can parse a sequnce of zero or more occurances of another
* block.
*
* @author bjculkin
*
* @param <K>
* The key type of the tokens.
*
* @param <V>
* The value type of the tokens.
*
* @param <C>
* The state type of the parser.
*/
public class RepeatingParseBlock<K, V, C> implements ParseBlock<K, V, C> {
private ParseBlock<K, V, C> innerBlock;
private K delim;
private K term;
private UnaryOperator<C> onDelim;
private Token<K, V> mark;
/**
* Create a new repeating block.
*
* @param inner
* The inner block for elements.
*
* @param delimiter
* The token that delimits elements in the sequence.
*
* @param terminator
* The token that terminates the sequence.
*
* @param marker
* The token to use as the node in the AST.
*
* @param action
* The action to apply to the state after every
* delimiter.
*/
public RepeatingParseBlock(ParseBlock<K, V, C> inner, K delimiter, K terminator, Token<K, V> marker,
UnaryOperator<C> action) {
super();
if (inner == null)
throw new NullPointerException("Inner block must not be null");
else if (delimiter == null)
throw new NullPointerException("Delimiter must not be null");
else if (terminator == null) throw new NullPointerException("Terminator must not be null");
innerBlock = inner;
delim = delimiter;
term = terminator;
mark = marker;
onDelim = action;
}
@Override
public ITree<Token<K, V>> parse(ParserContext<K, V, C> ctx) throws ParserException {
ITree<Token<K, V>> ret = new Tree<>(mark);
Token<K, V> tok = ctx.tokens.current();
while (!tok.getKey().equals(term)) {
ITree<Token<K, V>> kid = innerBlock.parse(ctx);
ret.addChild(kid);
tok = ctx.tokens.current();
ctx.tokens.expect(delim, term);
if (onDelim != null) ctx.state = onDelim.apply(ctx.state);
}
return ret;
}
}
|
