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
|
package bjc.dicelang.v1.ast;
import bjc.dicelang.v1.ast.nodes.IDiceASTNode;
import bjc.dicelang.v1.ast.nodes.OperatorDiceNode;
import bjc.dicelang.v1.ast.nodes.VariableDiceNode;
import bjc.utils.data.IHolder;
import bjc.utils.data.ITree;
import bjc.utils.data.Identity;
import bjc.utils.data.TopDownTransformResult;
import bjc.utils.data.Tree;
import bjc.utils.funcdata.IMap;
/**
* Sanitize the references in an AST so that a variable that refers to itself in
* its definition has the occurance of it replaced with its previous definition
*
* @author ben
*
*/
public class DiceASTReferenceSanitizer {
private static ITree<IDiceASTNode> doSanitize(ITree<IDiceASTNode> ast,
IMap<String, ITree<IDiceASTNode>> enviroment) {
if(ast.getChildrenCount() != 2)
throw new UnsupportedOperationException("Assignment must have two arguments.");
ITree<IDiceASTNode> nameTree = ast.getChild(0);
ITree<IDiceASTNode> valueTree = ast.getChild(1);
if(!DiceASTUtils.containsSimpleVariable(nameTree)) {
if(nameTree.getHead() == OperatorDiceNode.ARRAY) {
IHolder<Boolean> allSimpleVariables = new Identity<>(true);
nameTree.doForChildren((child) -> {
if(allSimpleVariables.getValue()) {
boolean isSimple = DiceASTUtils.containsSimpleVariable(child);
allSimpleVariables.replace(isSimple);
}
});
if(!allSimpleVariables.getValue()) throw new UnsupportedOperationException(
"Array assignment must be between variables and"
+ " a expression/array of expressions");
if(valueTree.getHead() == OperatorDiceNode.ARRAY) {
if(nameTree.getChildrenCount() != valueTree.getChildrenCount())
throw new UnsupportedOperationException(
"Array assignment between arrays must be"
+ " between two arrays of equal length");
}
} else
throw new UnsupportedOperationException(
"Assignment must be between a variable and a expression");
}
if(nameTree.getHead() == OperatorDiceNode.ARRAY) {
if(valueTree.getHead() == OperatorDiceNode.ARRAY) {
IHolder<Integer> childCounter = new Identity<>(0);
ITree<IDiceASTNode> returnTree = new Tree<>(OperatorDiceNode.ARRAY);
nameTree.doForChildren((child) -> {
String variableName = child.transformHead((node) -> {
return ((VariableDiceNode) node).getVariable();
});
ITree<IDiceASTNode> currentValue = valueTree.getChild(childCounter.getValue());
ITree<IDiceASTNode> sanitizedSubtree = doSingleSanitize(ast, enviroment, child,
currentValue, variableName);
if(sanitizedSubtree == null) {
ITree<IDiceASTNode> oldTree = new Tree<>(ast.getHead(), child,
currentValue);
returnTree.addChild(oldTree);
} else {
returnTree.addChild(sanitizedSubtree);
}
childCounter.transform((count) -> count + 1);
});
return returnTree;
}
ITree<IDiceASTNode> returnTree = new Tree<>(OperatorDiceNode.ARRAY);
nameTree.doForChildren((child) -> {
String variableName = child
.transformHead((node) -> ((VariableDiceNode) node).getVariable());
ITree<IDiceASTNode> sanitizedChild = doSingleSanitize(ast, enviroment, child, valueTree,
variableName);
if(sanitizedChild == null) {
ITree<IDiceASTNode> oldTree = new Tree<>(ast.getHead(), child, valueTree);
returnTree.addChild(oldTree);
} else {
returnTree.addChild(sanitizedChild);
}
});
return returnTree;
}
String variableName = nameTree.transformHead((node) -> ((VariableDiceNode) node).getVariable());
ITree<IDiceASTNode> sanitizedTree = doSingleSanitize(ast, enviroment, nameTree, valueTree,
variableName);
if(sanitizedTree == null) return ast;
return sanitizedTree;
}
private static ITree<IDiceASTNode> doSingleSanitize(ITree<IDiceASTNode> ast,
IMap<String, ITree<IDiceASTNode>> enviroment, ITree<IDiceASTNode> nameTree,
ITree<IDiceASTNode> valueTree, String variableName) {
if(enviroment.containsKey(variableName)) {
// @ is a meta-variable standing for the left side of an
// assignment
ITree<IDiceASTNode> oldVal = enviroment.put("@", enviroment.get(variableName));
// We should always inline out references to last,
// because it
// will always change
ITree<IDiceASTNode> inlinedValue = DiceASTInliner.selectiveInline(valueTree, enviroment,
variableName, "last", "@");
if(oldVal != null) {
enviroment.put("@", oldVal);
} else {
enviroment.remove("@");
}
return new Tree<>(ast.getHead(), nameTree, inlinedValue);
}
return null;
}
/**
* Sanitize the references in an AST
*
* @param ast
* @param enviroment
* @return The sanitized AST
*/
public static ITree<IDiceASTNode> sanitize(ITree<IDiceASTNode> ast,
IMap<String, ITree<IDiceASTNode>> enviroment) {
return ast.topDownTransform(DiceASTReferenceSanitizer::shouldSanitize, (subTree) -> {
return doSanitize(subTree, enviroment);
});
}
private static TopDownTransformResult shouldSanitize(IDiceASTNode node) {
if(!node.isOperator()) return TopDownTransformResult.SKIP;
switch((OperatorDiceNode) node) {
case ASSIGN:
return TopDownTransformResult.TRANSFORM;
case ARRAY:
case LET:
return TopDownTransformResult.PASSTHROUGH;
case ADD:
case COMPOUND:
case DIVIDE:
case GROUP:
case MULTIPLY:
case SUBTRACT:
default:
return TopDownTransformResult.SKIP;
}
}
}
|
