-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathParser.java
More file actions
235 lines (204 loc) · 6.83 KB
/
Parser.java
File metadata and controls
235 lines (204 loc) · 6.83 KB
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
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
import java.util.ArrayList;
import java.util.List;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
// Boolean operator parser
public class Parser {
private List<String> expr = null;
private static List<String> tokenize(String expr) {
List<String> tokens = new ArrayList<String>();
Pattern p = Pattern.compile("\\[([^\\]]+)\\]");
Matcher m = p.matcher(expr);
while (m.find()) {
tokens.add(m.group(1));
}
return tokens;
}
private static List<String> sublist(List<String> l, int s, int e) {
List<String> ret = new ArrayList<String>();
for (int i = s; i < e; i++) {
ret.add(l.get(i));
}
return ret;
}
private static List<Integer> find(List<String> l, String s) {
List<Integer> ret = new ArrayList<Integer>();
for (int i = 0; i < l.size(); i++) {
if (l.get(i).equals(s)) {
ret.add(new Integer(i));
}
}
return ret;
}
// validate expression
private static boolean isValidUnaryOpExpr(List<String> expr, String operator) {
List<Integer> indices = find(expr, operator);
for (int index : indices) {
if (index != 0) {
continue;
}
List<String> rest = sublist(expr, index + 1, expr.size());
if (rest.size() == 0) {
continue;
}
if (isValidExpr(rest)) {
for (int i = 0; i < rest.size(); i++) {
expr.set(index + i + 1, rest.get(i));
}
expr.set(index, "!");
return true;
}
}
return false;
}
private static boolean isValidBinaryOpExpr(List<String> expr, String operator) {
List<Integer> indices = find(expr, operator);
for (int index : indices) {
if (index == -1) {
continue;
}
List<String> firstHalf = sublist(expr, 0, index);
if (firstHalf.size() == 0) {
continue;
}
List<String> secondHalf = sublist(expr, index + 1, expr.size());
if (secondHalf.size() == 0) {
continue;
}
if (isValidExpr(firstHalf) && isValidExpr(secondHalf)) {
for (int i = 0; i < firstHalf.size(); i++) {
expr.set(i, firstHalf.get(i));
}
for (int i = 0; i < secondHalf.size(); i++) {
expr.set(index + i + 1, secondHalf.get(i));
}
if (operator.equals("and")) {
expr.set(index, "&&");
}
if (operator.equals("or")) {
expr.set(index, "||");
}
return true;
}
}
return false;
}
private static boolean isValidAndExpr(List<String> expr) {
return isValidBinaryOpExpr(expr, "and");
}
private static boolean isValidOrExpr(List<String> expr) {
return isValidBinaryOpExpr(expr, "or");
}
private static boolean isValidNotExpr(List<String> expr) {
return isValidUnaryOpExpr(expr, "not");
}
private static boolean isValidAlias(List<String> expr) {
if (expr.size() == 1) {
return true;
}
return false;
}
private static boolean isValidExpr(List<String> expr) {
return isValidAlias(expr) || isValidNotExpr(expr) || isValidAndExpr(expr) || isValidOrExpr(expr);
}
// evaluate expression
private static boolean isAndExpr(String expr) {
return expr.indexOf("&&") != -1;
}
private static boolean isOrExpr(String expr) {
return expr.indexOf("||") != -1;
}
private static boolean isNotExpr(String expr) {
return expr.indexOf("!") != -1;
}
private static boolean evalAlias(String expr) {
return Boolean.valueOf(expr);
}
private static boolean evalAndExpr(String expr) {
int index = expr.indexOf("&&");
String firstHalf = expr.substring(0, index);
String secondHalf = expr.substring(index + 2);
return evalExpr(firstHalf) && evalExpr(secondHalf);
}
private static boolean evalOrExpr(String expr) {
int index = expr.indexOf("||");
String firstHalf = expr.substring(0, index);
String secondHalf = expr.substring(index + 2);
return evalExpr(firstHalf) || evalExpr(secondHalf);
}
private static boolean evalNotExpr(String expr) {
return !evalExpr(expr.substring(expr.indexOf("!") + 1));
}
private static boolean evalExpr(String expr) {
if (isAndExpr(expr)) {
return evalAndExpr(expr);
} else if (isOrExpr(expr)) {
return evalOrExpr(expr);
} else if (isNotExpr(expr)) {
return evalNotExpr(expr);
} else {
return evalAlias(expr);
}
}
// public API
public String toString() {
return expr.toString();
}
public void parse(String expr) {
List<String> tokens = tokenize(expr);
if (isValidExpr(tokens)) {
this.expr = tokens;
}
}
public boolean eval(String var, boolean val) {
for (int i = 0; i < expr.size(); i++) {
if (expr.get(i).equals(var)) {
expr.set(i, Boolean.toString(val));
}
}
StringBuffer sb = new StringBuffer();
for (String s : expr) {
sb.append(s);
}
return evalExpr(sb.toString());
}
// Examples
public static void main(String[] args) {
String[] expression1 = {
"[a][and][a]",
"[a][or][a]",
"[not][a]",
"[not][not][a]",
"[not][a][and][a]",
"[not][a][and][not][a]",
"[not][a][or][a]",
"[not][a][or][not][a]",
"[not][not][a][and][a]",
"[not][not][a][or][a]"
};
for (String e : expression1) {
Parser p = new Parser();
p.parse(e);
System.out.println(p.toString());
System.out.println(p.eval("a", true));
}
String[] expression2 = {
"[and][and][and]",
"[and][or][and]",
"[not][and]",
"[not][not][and]",
"[not][and][and][and]",
"[not][and][and][not][and]",
"[not][and][or][and]",
"[not][and][or][not][and]",
"[not][not][and][and][and]",
"[not][not][and][or][and]"
};
for (String e : expression2) {
Parser p = new Parser();
p.parse(e);
System.out.println(p.toString());
System.out.println(p.eval("and", false));
}
}
}