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
|
package bjc.utils.parserutils;
import java.util.Map;
import java.util.function.BinaryOperator;
import java.util.function.Consumer;
import java.util.function.Function;
import bjc.utils.funcdata.ITreePart.TreeLinearizationMethod;
/**
* A simple binary tree meant for use as an AST
*
* @author ben
*
* @param <T>
* The type of token in this AST
*/
public class AST<T> {
private T token;
private AST<T> left;
private AST<T> right;
/**
* Create a new leaf AST node
*
* @param tokn
* The token in this node
*/
public AST(T tokn) {
token = tokn;
left = null;
right = null;
}
/**
* Create a new AST node with the specified data and children
*
* @param tokn
* The token in this node
* @param left
* The left child of this AST
* @param right
* The right child of this AST
*/
public AST(T tokn, AST<T> lft, AST<T> rght) {
token = tokn;
left = lft;
right = rght;
}
public void traverse(TreeLinearizationMethod tlm, Consumer<T> con) {
switch (tlm) {
case INORDER:
left.traverse(tlm, con);
con.accept(token);
right.traverse(tlm, con);
break;
case POSTORDER:
left.traverse(tlm, con);
right.traverse(tlm, con);
con.accept(token);
break;
case PREORDER:
con.accept(token);
left.traverse(tlm, con);
right.traverse(tlm, con);
break;
default:
throw new IllegalArgumentException(
"Got a invalid tree linearizer " + tlm + ". WAT");
}
}
/**
* Collapse this tree into a single node
*
* @param tokenTransform
* The function to transform nodes into data
* @param nodeTransform
* A map of functions for operator collapsing
* @param resultTransform
* The function for transforming the result
* @return The collapsed value of the tree
*/
public <E, T2> E collapse(Function<T, T2> tokenTransform,
Map<T, BinaryOperator<T2>> nodeTransform,
Function<T2, E> resultTransform) {
return resultTransform
.apply(internalCollapse(tokenTransform, nodeTransform));
}
/*
* Internal recursive collapser
*/
private <T2> T2 internalCollapse(Function<T, T2> tokenTransform,
Map<T, BinaryOperator<T2>> nodeTransform) {
if (left == null && right == null) {
return tokenTransform.apply(token);
} else {
T2 leftCollapsed = left.internalCollapse(tokenTransform,
nodeTransform);
T2 rightCollapsed = right.internalCollapse(tokenTransform,
nodeTransform);
return nodeTransform.get(token).apply(leftCollapsed,
rightCollapsed);
}
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
internalToString(sb, -1);
return sb.toString();
}
private void internalToString(StringBuilder sb, int indentLevel) {
indentNLevels(sb, indentLevel);
if (left == null && right == null) {
sb.append("Node: ");
sb.append(token.toString());
sb.append("\n");
} else {
sb.append("Node: ");
sb.append(token.toString());
sb.append("\n");
// indentNLevels(sb, indentLevel + 2);
//
// sb.append("Left: \n");
left.internalToString(sb, indentLevel + 2);
//
// indentNLevels(sb, indentLevel + 2);
//
// sb.append("Right: \n");
right.internalToString(sb, indentLevel + 2);
}
}
private void indentNLevels(StringBuilder sb, int n) {
for (int i = 0; i <= n; i++) {
sb.append("\t");
}
}
}
|
