-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathGroup.java
433 lines (412 loc) · 9.43 KB
/
Group.java
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
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
package edu.lsu.cct.piraha;
import java.io.PrintWriter;
import java.util.LinkedList;
import java.util.Stack;
public class Group implements Cloneable {
String patternName, text;
int begin, end;
Group replacement;
public void setReplacement(Group replacement) {
if(replacement.getPatternName().equals(patternName))
this.replacement = replacement;
else
throw new MatchException("replacement group does not have patternName='"+patternName+"'");
}
public int getBegin() {
if(replacement != null)
return replacement.getBegin();
return begin;
}
public int getEnd() {
if(replacement != null)
replacement.getEnd();
return end;
}
LinkedList<Group> subMatches;
Stack<LinkedList<Group>> savedMatches;
public int groupCount() {
if(replacement != null)
return replacement.groupCount();
if(subMatches == null)
return 0;
return subMatches.size();
}
public Group group(int n) {
if(replacement != null)
return replacement.group(n);
return subMatches.get(n);
}
Group() {}
public final static LinkedList<Group> emptyList = new LinkedList<Group>();
public static Group make(String lookup, String value) {
return new Group(lookup,0,value.length(),emptyList,value);
}
public Group(String lookup, int before, int after, LinkedList<Group> matches,String text) {
this.patternName = lookup;
this.begin = before;
this.end = after;
this.subMatches = matches;
this.text = text;
}
public Group(String patternName, Group m) {
this.patternName = patternName;
this.begin = m.begin;
this.end = m.end;
this.subMatches = m.subMatches;
this.text = m.text;
}
Group(Group g) {
subMatches = new LinkedList<Group>();
this.patternName = "$empty";
this.text = "$empty";
subMatches.add(g);
}
public Group(String lookup, int b, int e, String text) {
this.patternName = lookup;
this.begin = b;
this.end = e;
this.text = text;
}
public Group group() {
if(replacement != null)
return replacement.group();
return new Group(patternName,begin,end,subMatches,text);
}
public String substring(String text) {
if(replacement != null)
return replacement.substring(text);
return text.substring(begin,end);
}
public Near near() {
Near near = new Near();
near.text = text;
for(int i=0;i<text.length() && i<begin;i++) {
if(text.charAt(i)=='\n') {
near.lineNum++;
near.startOfLine = i;
}
}
near.pos = begin - near.startOfLine;
near.endOfLine = begin;
//for(near.endOfLine = begin; near.endOfLine < text.length();near.endOfLine++)
for(int n = begin;n < text.length();n++) {
if(text.charAt(near.endOfLine) == '\n') {
near.endOfLine = n;
break;
}
}
return near;
}
public String substring() {
if(replacement != null)
return replacement.substring();
if(begin < 0 || end < 0) return "";
return text.substring(begin,end);
}
public String getPatternName() {
return patternName;
}
public char charAt(int i) {
if(replacement != null)
return replacement.charAt(i);
return text.charAt(i);
}
public String getText() {
if(replacement != null)
return replacement.text;
return text;
}
public String toString() {
return getPatternName()+"="+substring();
}
public void dumpMatchesXML() {
if(replacement != null)
dumpMatchesXML();
else {
dumpMatchesXML(DebugOutput.out);
DebugOutput.out.pw.flush();
}
}
public void dumpMatchesXML(DebugOutput out) {
dumpMatchesXML(out,false);
}
/**
* If showText is true, then a complete copy of the input
* will be present inside a <text></text> element in the root node.
* @param out
* @param showText
*/
public void dumpMatchesXML(DebugOutput out,boolean showText) {
if(replacement != null) {
replacement.dumpMatches(out);
} else {
out.print("<");
out.print(getPatternName());
out.print(" start='");
out.print(begin);
out.print("' end='");
out.print(end);
out.print("' line='");
out.print(getLineNum());
out.print("'>");
if(groupCount()==0) {
out.print(xmlText(substring()));
} else {
out.println();
out.indent++;
try {
for(Group match : subMatches) {
match.dumpMatchesXML(out);
}
} finally {
out.indent--;
}
}
if(showText) {
out.print("<text>");
out.print(xmlText(substring()));
out.println("</text>");
}
out.print("</");
out.print(getPatternName());
out.println(">");
}
}
private int getLineNum() {
int num = 1;
for(int i=0;i<begin;i++)
if(text.charAt(i)=='\n')
num++;
return num;
}
public void dumpMatchesPython(String var,DebugOutput out) {
out.print(""+var+"=");
dumpMatchesPython(out);
out.println();
}
public void dumpMatchesPerl(String var,DebugOutput out) {
out.print(var+"=");
dumpMatchesPerl(out);
out.println(";");
}
public void dumpMatchesPerl(DebugOutput out) {
if(replacement != null) {
replacement.dumpMatches(out);
} else {
out.print("{name=>'");
out.print(getPatternName());
out.print("', start=>'");
out.print(begin);
out.print("', end=>'");
out.print(end);
out.print("', line=>'");
out.print(getLineNum());
out.print("'");
if(groupCount()==0) {
out.print(", text=>\"");
out.print(escText(substring()));
out.print('"');
} else {
out.print(", children=>[");
out.println();
out.indent++;
try {
boolean first = true;
for(Group match : subMatches) {
if(first) {
first = false;
} else {
out.println(",");
}
match.dumpMatchesPerl(out);
}
} finally {
out.indent = out.indent-1;
}
out.print("]");
}
out.print("}");
}
}
public void dumpMatchesPython(DebugOutput out) {
if(replacement != null) {
replacement.dumpMatches(out);
} else {
out.print("{'name':'");
out.print(getPatternName());
out.print("', 'start':'");
out.print(begin);
out.print("', 'end':'");
out.print(end);
out.print("', 'line':'");
out.print(getLineNum());
out.print("'");
if(groupCount()==0) {
out.print(", 'text':'");
out.print(escText(substring()));
out.print("'");
} else {
out.print(", 'children':[");
out.println();
out.indent++;
try {
boolean first = true;
for(Group match : subMatches) {
if(first) {
first = false;
} else {
out.println(",");
}
match.dumpMatchesPython(out);
}
} finally {
out.indent = out.indent-1;
}
out.print("]");
}
out.print("}");
}
}
public String escText(String s) {
StringBuffer sb = new StringBuffer();
for(int i=0;i<s.length();i++) {
char c = s.charAt(i);
sb.append(escChar(c));
}
return sb.toString();
}
public static String escChar(char c) {
if(c == '\\')
return "\\\\";
if(c == '\n')
return "\\n";
if(c == '\r')
return "\\r";
if(c == '\t')
return "\\t";
if(c == '"')
return "\\\"";
if(c == '\'')
return "\\'";
// Needed for translation to perl data
// structures, but a problem for everything
// else. It shouldn't be here.
// if(c == '$')
// return "\\$";
if(c == '@')
return "\\@";
if(c == '%')
return "\\%";
if(c >= ' ' && c <= '~')
return Character.toString(c);
return "\\x"+Integer.toHexString(c);
}
public void dumpMatches() {
if(replacement != null) {
replacement.dumpMatches();
} else {
dumpMatches(DebugOutput.out);
DebugOutput.out.pw.flush();
}
}
public void dumpMatches(DebugOutput out) {
if(replacement != null) {
replacement.dumpMatches(out);
} else {
out.print(getPatternName());
if(groupCount()==0) {
out.print("=(");
out.outs(substring());
out.println(")");
} else {
out.println(":");
out.indent+=2;
try {
for(int i=0;i<groupCount();i++) {
Group match = group(i);
out.print("[");
out.print(i);
out.print("] ");
match.dumpMatches(out);
}
} finally {
out.indent-=2;
}
}
}
}
private static String xmlText(String str) {
StringBuffer sb = new StringBuffer();
for(int i=0;i<str.length();i++) {
char c = str.charAt(i);
if(c == '<')
sb.append("<");
else if(c == '>')
sb.append(">");
else if(c == '&')
sb.append("&");
else if(c == '"')
sb.append(""");
else if(c <= 13 || c > 127)
sb.append("&#"+(int)c+";");
else
sb.append(c);
}
return sb.toString();
}
public void generate(PrintWriter pw) {
if(replacement != null) {
replacement.generate(pw);
} else {
int children = groupCount();
if(children == 0) {
pw.print(substring());
} else {
pw.print(text.substring(begin,group(0).begin));
for(int i=0;i<children;i++) {
group(i).generate(pw);
}
pw.print(text.substring(group(children-1).end,end));
}
}
}
public Group get(String... args) {
return get(0,args);
}
private Group get(int index, String[] args) {
if(index >= args.length)
return this;
String pn = args[index];
for(int i=0;i<groupCount();i++) {
if(pn.equals(group(i).getPatternName())) {
Group g = group(i).get(index+1,args);
if(g != null)
return g;
}
}
return null;
}
public boolean equals(Object o) {
if(o instanceof Group) {
Group g = (Group)o;
if(g.begin != begin || g.end != end || g.groupCount() != groupCount())
return false;
if(!g.patternName.equals(patternName))
return false;
for(int j=0;j<groupCount();j++) {
if(!group(j).equals(g.group(j)))
return false;
}
return true;
}
return false;
}
public int getLine() {
int n = 1;
for(int i=0;i<begin;i++) {
if(text.charAt(i)=='\n')
n++;
}
return n;
}
}