-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathParser.java
More file actions
777 lines (694 loc) · 27.7 KB
/
Parser.java
File metadata and controls
777 lines (694 loc) · 27.7 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
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
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
public class Parser {
Filter filter;
List<InterpreterError> errors;
public Parser(Filter filter, List<InterpreterError> errors) {
this.filter = filter;
this.errors = errors;
}
// compilationUnit = { decl | stmnt } EOF
// sync part of First(decl) + First(stmnt) + EOF
CUNode compilationUnit() throws IOException{
CUNode result = new CUNode();
Set<Token.Type> sync = new HashSet<>();
sync.add(Token.Type.EOF);
sync.add(Token.Type.KEYBOOL);
sync.add(Token.Type.KEYFA);
sync.add(Token.Type.KEYINT);
sync.add(Token.Type.KEYMAP);
sync.add(Token.Type.KEYRA);
sync.add(Token.Type.KEYRANGE);
sync.add(Token.Type.KEYSET);
sync.add(Token.Type.KEYSTATE);
sync.add(Token.Type.KEYTRANSITION);
sync.add(Token.Type.IFSTART);
sync.add(Token.Type.WHILE);
sync.add(Token.Type.PRINT);
sync.add(Token.Type.SEM);
sync.add(Token.Type.BLOCKSTART);
while(filter.getToken().kind != Token.Type.EOF)
{
try{
// Declaration
if(filter.getToken().isKeyType())
result.add(decl(sync));
else //Statement
result.add(stmnt(sync));
}catch(ParserError error){}
}
return result;
}
// decl = type IDENTIFIER SEM
// sync: SEM
DeclNode decl(Set<Token.Type> synco) throws IOException, ParserError{
Set<Token.Type> sync = new HashSet<>(synco);
sync.add(Token.Type.SEM);
Token typ = null;
Token name = null;
Token sem = null;
try{
typ = filter.getToken();
if(typ.kind == Token.Type.KEYMAP)
return mapDecl(sync);
if(typ.kind == Token.Type.KEYSET)
return setDecl(sync);
filter.matchToken(); //typ
name = filter.getToken();
filter.matchToken(Token.Type.IDENTIFIER, sync);
sem = filter.getToken();
filter.matchToken(Token.Type.SEM, sync);
}catch(ParserError error){
if(filter.getToken().kind == Token.Type.SEM){
filter.matchToken();
return new DeclNode(typ,null,name,sem);
}
else throw error;
}
return new DeclNode(typ,null,name,sem);
}
DeclNode mapDecl(Set<Token.Type> sync) throws IOException, ParserError{
// Map<type,type>
// KEYMAP "<" type COMMA type ">"
Token typ = null;
Token name = null;
Token sem = null;
List<Token> genericTypes = new ArrayList<Token>();
try{
typ = filter.getToken();
filter.matchToken();
filter.matchToken(Token.Type.COMP,sync); // <
if(filter.getToken().isKeyType()){
genericTypes.add(filter.getToken());
filter.matchToken(); //first Type
}else// No KeyType received
filter.matchToken(Token.Type.TYPE, sync);
filter.matchToken(Token.Type.COMMA, sync); // ,
if(filter.getToken().isKeyType()){
genericTypes.add(filter.getToken());
filter.matchToken(); //second Type
}else// No KeyType received
filter.matchToken(Token.Type.TYPE, sync);
filter.matchToken(Token.Type.COMP, sync); // >
name = filter.getToken();
filter.matchToken(Token.Type.IDENTIFIER, sync);
sem = filter.getToken();
filter.matchToken(Token.Type.SEM, sync);
}catch(ParserError error){
if(filter.getToken().kind == Token.Type.SEM){
filter.matchToken();
return new DeclNode(typ,genericTypes,name,sem);
}
else throw error;
}
return new DeclNode(typ,genericTypes,name,sem);
}
DeclNode setDecl(Set<Token.Type> sync) throws IOException, ParserError{
// Set<type>
// KEYSET "<" type ">"
Token typ = null;
Token name = null;
Token sem = null;
List<Token> genericTypes = new ArrayList<Token>();
try{
typ = filter.getToken();
filter.matchToken();
filter.matchToken(Token.Type.COMP,sync); // <
if(filter.getToken().isKeyType()){
genericTypes.add(filter.getToken());
filter.matchToken(); //first Type
}else// No KeyType received
filter.matchToken(Token.Type.TYPE, sync);
filter.matchToken(Token.Type.COMP, sync); // >
name = filter.getToken();
filter.matchToken(Token.Type.IDENTIFIER, sync);
sem = filter.getToken();
filter.matchToken(Token.Type.SEM, sync);
}catch(ParserError error){
if(filter.getToken().kind == Token.Type.SEM){
filter.matchToken();
return new DeclNode(typ,genericTypes,name,sem);
}
else throw error;
}
return new DeclNode(typ,genericTypes,name,sem);
}
// stmnt = ifStmnt | whileStmnt | exprStmnt | emptyStmnt | block
// | printStmnt
// no syncs
StmntNode stmnt(Set<Token.Type> synco) throws IOException, ParserError {
Token.Type kind = filter.getToken().kind;
StmntNode res = null;
if (kind == Token.Type.IFSTART) res=ifStmnt(synco);
else if (kind == Token.Type.WHILE) res=whileStmnt(synco);
else if (kind == Token.Type.BLOCKSTART) res=block(synco);
else if (kind == Token.Type.PRINT) res=printStmnt(synco);
else if (kind == Token.Type.SEM) {
res = new EmptyStmntNode(filter.getToken());
filter.matchToken();
}
else res=exprStmnt(synco);
return res;
}
// ifStmnt = "if" "(" expr ")" stmnt [ "else" stmnt ]
// sync: ^ else, First(stmnt)
IfNode ifStmnt(Set<Token.Type> synco) throws IOException, ParserError {
Set<Token.Type> sync = new HashSet<>(synco);
sync.add(Token.Type.ELSE);
sync.add(Token.Type.IFSTART);
sync.add(Token.Type.WHILE);
sync.add(Token.Type.PRINT);
sync.add(Token.Type.BLOCKSTART);
sync.add(Token.Type.SEM);
ExprNode expr = null;
StmntNode stmnt = null;
StmntNode elseStmnt = null;
Token start = filter.getToken();
filter.matchToken(); // must be "if"
toElse: {
try {
filter.matchToken(Token.Type.BRACKETSTART, sync);
expr = expr(sync);
filter.matchToken(Token.Type.BRACKETEND, sync);
} catch (ParserError error) {
if (filter.getToken().kind == Token.Type.ELSE) break toElse;
else if (filter.getToken().kind == Token.Type.IFSTART || filter.getToken().kind == Token.Type.WHILE
|| filter.getToken().kind == Token.Type.PRINT || filter.getToken().kind == Token.Type.SEM
|| filter.getToken().kind == Token.Type.BLOCKSTART) ;
else throw error;
}
sync = new HashSet<>(synco);
sync.add(Token.Type.ELSE);
try {
stmnt = stmnt(sync);
} catch (ParserError error) {
if (filter.getToken().kind == Token.Type.ELSE) ;
else throw error;
}
}
if (filter.getToken().kind == Token.Type.ELSE) {
filter.matchToken();
elseStmnt=stmnt(synco);
}
return new IfNode(start, expr, stmnt, elseStmnt);
}
// whileStmnt = "while" "(" expr ")" stmnt
// sync: ^ else, First(stmnt)
WhileNode whileStmnt(Set<Token.Type> synco) throws IOException, ParserError {
Set<Token.Type> sync = new HashSet<>(synco);
sync.add(Token.Type.IFSTART);
sync.add(Token.Type.WHILE);
sync.add(Token.Type.PRINT);
sync.add(Token.Type.BLOCKSTART);
sync.add(Token.Type.SEM);
ExprNode expr = null;
StmntNode stmnt = null;
Token start = filter.getToken();
filter.matchToken(); // must be "while"
try {
filter.matchToken(Token.Type.BRACKETSTART,sync);
expr = expr(sync);
filter.matchToken(Token.Type.BRACKETEND,sync);
} catch (ParserError error) {
if (filter.getToken().kind == Token.Type.IFSTART || filter.getToken().kind == Token.Type.WHILE
|| filter.getToken().kind == Token.Type.PRINT || filter.getToken().kind == Token.Type.SEM
|| filter.getToken().kind == Token.Type.BLOCKSTART) ;
else throw error;
}
stmnt=stmnt(synco);
return new WhileNode(start,expr,stmnt);
}
// block = "{" { decl | stmnt } "}"
// sync: First(decl) + first(stmnt) + "}"
BlockNode block(Set<Token.Type> synco) throws IOException, ParserError {
Set<Token.Type> sync = new HashSet<>();
sync.add(Token.Type.BLOCKEND);
sync.add(Token.Type.KEYINT);
sync.add(Token.Type.IFSTART);
sync.add(Token.Type.WHILE);
sync.add(Token.Type.PRINT);
sync.add(Token.Type.SEM);
sync.add(Token.Type.BLOCKSTART);
Token start = filter.getToken();
BlockNode res = new BlockNode(start,null);
filter.matchToken(); // must be "{"
toBlockend: while (filter.getToken().kind != Token.Type.BLOCKEND
&& filter.getToken().kind != Token.Type.EOF
) {
try {
if (filter.getToken().isKeyType())
res.add(decl(sync));
else res.add(stmnt(sync));
} catch (ParserError error) {
if (filter.getToken().kind == Token.Type.BLOCKEND) break toBlockend;
else if (filter.getToken().kind == Token.Type.IFSTART || filter.getToken().kind == Token.Type.WHILE
|| filter.getToken().kind == Token.Type.PRINT || filter.getToken().kind == Token.Type.SEM
|| filter.getToken().kind == Token.Type.BLOCKSTART) ;
else throw error;
}
}
sync = new HashSet<>(synco);
sync.add(Token.Type.BLOCKEND);
try {
res.end = filter.getToken();
filter.matchToken(Token.Type.BLOCKEND, sync);
} catch (ParserError error) {
if (filter.getToken().kind == Token.Type.BLOCKEND) filter.matchToken();
else throw error;
}
return res;
}
// printStmnt = "print" expr ";"
// sync: ";"
PrintNode printStmnt(Set<Token.Type> synco) throws IOException, ParserError {
Set<Token.Type> sync = new HashSet<>(synco);
sync.add(Token.Type.SEM);
Token start = filter.getToken();
Token end = null;
ExprNode expr = null;
filter.matchToken();
try {
expr = expr(sync);
end = filter.getToken();
filter.matchToken(Token.Type.SEM,sync);
} catch (ParserError error) {
if (filter.getToken().kind == Token.Type.SEM) {
filter.matchToken();
return null;
}
else throw error;
}
return new PrintNode(start,end,expr);
}
// exprStmnt = expr ";"
// sync: ";"
ExprStmntNode exprStmnt(Set<Token.Type> synco) throws IOException, ParserError {
Set<Token.Type> sync = new HashSet<>(synco);
sync.add(Token.Type.SEM);
Token end = null;
ExprNode expr = null;
try {
expr = expr(sync);
//expr = expr(sync);
end = filter.getToken();
filter.matchToken(Token.Type.SEM, sync);
} catch (ParserError error) {
if (filter.getToken().kind == Token.Type.SEM) ;
else throw error;
}
return new ExprStmntNode(expr, end);
}
// expr = {!} set
ExprNode expr(Set<Token.Type> synco) throws IOException, ParserError {
Set<Token.Type> sync = new HashSet<>();
ExprNode res = null;
Token test = filter.getToken();
if(filter.getToken().kind == Token.Type.BOOLNEG){
Token op = filter.getToken();
filter.matchToken();
ExprNode exp = set(synco);
res = new UnOpNode(op,exp);
}else {
res = set(synco);
}
return res;
}
// set = IDENTIFIER "=" expr | comp
// sync: ^ "="
ExprNode set(Set<Token.Type> synco) throws IOException, ParserError {
Set<Token.Type> sync = new HashSet<>();
sync.add(Token.Type.SETTO);
ExprNode res = null;
if (filter.getToken(1).kind == Token.Type.SETTO) {
ExprNode left = null;
ExprNode right = null;
Token op = null;
try {
op = filter.getToken(1);
left = new IdentifierNode(filter.getToken());
filter.matchToken(Token.Type.IDENTIFIER, sync);
} catch (ParserError error) {
// ignore whatever there is on the left hand side
}
filter.matchToken();
right = expr(synco);
res = new BinOpNode(op,left,right);
}
else res = comp(synco);
return res;
}
// comp = sum "<" sum | sum
// sync: ^ "<"
ExprNode comp(Set<Token.Type> synco) throws IOException, ParserError {
Set<Token.Type> sync = new HashSet<>(synco);
sync.add(Token.Type.COMP);
ExprNode res = null;
try {
res = sum(sync);
} catch (ParserError error) {
if (filter.getToken().kind == Token.Type.COMP
|| filter.getToken().kind == Token.Type.AND
|| filter.getToken().kind == Token.Type.OR) ;
else throw error;
}
if (filter.getToken().kind == Token.Type.COMP
|| filter.getToken().kind == Token.Type.AND
|| filter.getToken().kind == Token.Type.OR) {
ExprNode left = res;
Token op = filter.getToken();
filter.matchToken();
ExprNode right = sum(synco);
res = new BinOpNode(op,left,right);
}
return res;
}
// sum = { prod { ("+"|"-") prod } }
// no syncs ???
ExprNode sum(Set<Token.Type> synco) throws IOException, ParserError {
ExprNode res = prod(synco);
while (filter.getToken().kind == Token.Type.POP
|| filter.getToken().kind == Token.Type.DACH) {
Token op = filter.getToken();
filter.matchToken();
ExprNode left = res;
ExprNode right = prod(synco);
res = new BinOpNode(op,left,right);
}
return res;
}
// prod = { transition { ("*"|"/"|"%") atom } }
// sync: ^ "*" ...
ExprNode prod(Set<Token.Type> synco) throws IOException, ParserError {
Set<Token.Type> sync = new HashSet<>(synco);
sync.add(Token.Type.LOP);
ExprNode res = null;
try {
res = transition(sync);
} catch (ParserError error) {
if (filter.getToken().kind == Token.Type.LOP) ;
else throw error;
}
while (filter.getToken().kind == Token.Type.LOP) {
Token op = filter.getToken();
filter.matchToken();
ExprNode left = res;
ExprNode right = atom(synco);
res = new BinOpNode(op,left,right);
}
return res;
}
// transition = { postfix { -- sum --> atom }}
ExprNode transition(Set<Token.Type> synco) throws IOException, ParserError{
Set<Token.Type> sync = new HashSet<>(synco);
ExprNode res = null;
try{
res = postfix(sync);
}catch(ParserError error){
throw error;
}
if(filter.getToken().kind == Token.Type.TRANSSTART){
filter.matchToken(); // --
ExprNode r = expr(synco); // Range
filter.matchToken(Token.Type.TRANSEND,synco); // -->
ExprNode stateB = atom(synco); //State
res = new TransitionNode(res,r,stateB);
}
else if(filter.getToken().kind == Token.Type.TRANSEPSI){
filter.matchToken(); // --->
ExprNode stateB = atom(synco); //State
res = new TransitionNode(res,stateB);
}
return res;
}
// postfix = atom {++|--}
ExprNode postfix(Set<Token.Type> synco) throws IOException, ParserError{
Set<Token.Type> sync = new HashSet<>(synco);
ExprNode res = null;
try{
res = atom(sync);
}catch(ParserError error){
throw error;
}
if(filter.getToken().kind == Token.Type.INC
|| filter.getToken().kind == Token.Type.DEC){
Token op = filter.getToken();
filter.matchToken();
ExprNode a = res;
res = new UnOpNode(op, a);
}
return res;
}
// atom = INT | BOOL | STRING | CHAR | RANGE | STATE | TRANSITION | FA | RA
// | SET | MAP | ARRAY
// | IDENTIFIER | ("+"|"-") atom | "(" expr ")"
// no syncs
ExprNode atom(Set<Token.Type> synco) throws IOException, ParserError {
ExprNode res = null;
if (filter.getToken().kind == Token.Type.INT) {
res = new NumberINode(filter.getToken());
filter.matchToken();
}
else if (filter.getToken().kind == Token.Type.BOOL){
res = new BoolNode(filter.getToken());
filter.matchToken();
}
else if (filter.getToken().kind == Token.Type.STRING){
res = new StringNode(filter.getToken());
filter.matchToken();
}
else if (filter.getToken().kind == Token.Type.CHAR){
res = new CharNode(filter.getToken());
filter.matchToken();
}
else if (filter.getToken().kind == Token.Type.SQUAREBRACKETOPEN){
//Range
filter.matchToken();
Pair<ExprNode,ExprNode> range;
List<Pair<ExprNode,ExprNode>> entries = new ArrayList<Pair<ExprNode,ExprNode>>();
while(filter.getToken().kind != Token.Type.SQUAREBRACKETCLOSE){
if(filter.getToken(1).kind == Token.Type.POP){ // -
ExprNode l = atom(synco);
filter.matchToken(); // -
ExprNode r = atom(synco);
range = new Pair<ExprNode,ExprNode>(l,r);
}else{
range = new Pair<ExprNode,ExprNode>(expr(synco),null);
}
entries.add(range);
if(filter.getToken().kind == Token.Type.COMMA)
filter.matchToken();
}
filter.matchToken(); // ]
res = new RangeNode(entries);
}
else if(filter.getToken().kind == Token.Type.MAPARRAYSTART){
Token start = filter.getToken();
filter.matchToken();
if(filter.getToken(1).kind == Token.Type.MAPDELI){
//Map
//Element:Value
List<Pair<ExprNode,ExprNode>> elements = new ArrayList<Pair<ExprNode,ExprNode>>();
Pair<ExprNode,ExprNode> pair;
while(filter.getToken().kind != Token.Type.MAPARRAYEND){
ExprNode l = expr(synco);
filter.matchToken(Token.Type.MAPDELI, synco);
ExprNode r = expr(synco);
if(!(filter.getToken().kind == Token.Type.MAPARRAYEND))
filter.matchToken(Token.Type.COMMA, synco);
pair = new Pair<ExprNode,ExprNode>(l,r);
elements.add(pair);
}
filter.matchToken(); // ]]
res = new MapNode(start,elements);
}else{
//Array
List<ExprNode> elements = new ArrayList<ExprNode>();
while(filter.getToken().kind != Token.Type.MAPARRAYEND){
elements.add(expr(synco));
if(filter.getToken().kind != Token.Type.MAPARRAYEND)
filter.matchToken(Token.Type.COMMA, synco);
}
filter.matchToken(); // ]]
res = new ArrayNode(start,elements);
}
}
else if(filter.getToken().kind == Token.Type.BLOCKSTART){
//Set
Token start = filter.getToken();
filter.matchToken();
List<ExprNode> elements = new ArrayList<ExprNode>();
while(filter.getToken().kind != Token.Type.BLOCKEND){
elements.add(expr(synco));
if(filter.getToken().kind != Token.Type.BLOCKEND)
filter.matchToken(Token.Type.COMMA,synco);
}
filter.matchToken(); // }
res = new SetNode(start,elements);
}
else if (filter.getToken().kind == Token.Type.STATE
|| filter.getToken().kind == Token.Type.STATEACC){
StateNode stateA;
Token content = filter.getToken();
filter.matchToken();
if(filter.getToken().kind == Token.Type.STATEACC){
stateA = new StateNode(content, true);
filter.matchToken();
}
else
stateA = new StateNode(content,false);
res = stateA;
}
else if (filter.getToken().kind == Token.Type.FASTART){
filter.matchToken();
if(filter.getToken().kind == Token.Type.RE_SLASH){
//RA with REGEX
filter.matchToken();
RegularExpressionNode ra = RA(synco);
res = new FiniteAutomataNode(ra);
}else{
//FA with <STATE,SET<TRANSITION>>
ExprNode state = expr(synco);
filter.matchToken(Token.Type.COMMA, synco);
ExprNode set = expr(synco);
res = new FiniteAutomataNode(state,set);
}
filter.matchToken(Token.Type.FAEND, synco);
}
else if (filter.getToken().kind == Token.Type.IDENTIFIER) {
res = new IdentifierNode(filter.getToken());
filter.matchToken();
}
else if (filter.getToken().kind == Token.Type.POP) {
Token op = filter.getToken();
filter.matchToken();
res = new UnOpNode(op, atom(synco));
}
else if (filter.getToken().kind == Token.Type.BRACKETSTART) {
filter.matchToken();
res = expr(synco);
filter.matchToken(Token.Type.BRACKETEND, synco);
}
else {
Token currentToken = filter.getToken();
ParserError error = new ParserError(currentToken, "Expression expected");
errors.add(error);
// panic !!!
while (!synco.contains(filter.getToken().kind)) filter.matchToken();
throw error;
}
return res;
}
/*
RA -> Or
Or -> Concat ("|" Concat)*
Concat -> Star (Star)*
Star -> RegAtom { "*" | "+" | "?" }
Atom -> <RegLiteral> | "(" Or ")" | "[" <RegLiteral> "-" <RegLiteral> "]"
*/
// RA -> Or
RegularExpressionNode RA(Set<Token.Type> synco) throws IOException, ParserError{
Set<Token.Type> sync = new HashSet<>(synco);
sync.add(Token.Type.LOP);
RegularExpressionNode res;
res = or(sync);
filter.matchToken(Token.Type.RE_SLASH, sync);
/*try{
res = or(sync);
}catch(ParserError error){
if(filter.getToken().kind == Token.Type.RE_SLASH);
else throw error;
}
filter.matchToken(Token.Type.RE_SLASH, sync);*/
return res;
}
// Or -> Concat ("|" Concat)*
RegularExpressionNode or(Set<Token.Type> synco) throws IOException, ParserError{
RegularExpressionNode res;
res = concat(synco);
while(filter.getToken().kind == Token.Type.RE_OR){
filter.matchToken();
RegularExpressionNode reB = concat(synco);
RegularExpressionNode reA = res;
res = new OrNode(reA,reB);
}
return res;
}
// Concat -> Star (Star)*
RegularExpressionNode concat(Set<Token.Type> synco) throws IOException, ParserError{
RegularExpressionNode res;
res = star(synco);
//Dont Concat when Slash, Or, Star, Opt, Plus
while(filter.getToken().kind != Token.Type.RE_SLASH
&& filter.getToken().kind != Token.Type.RE_OR
&& filter.getToken().kind != Token.Type.RE_COVER
&& filter.getToken().kind != Token.Type.RE_PLUS
&& filter.getToken().kind != Token.Type.RE_BRACKETCLOSE){
RegularExpressionNode reB = star(synco);
RegularExpressionNode reA = res;
res = new ConcatNode(reA,reB);
}
return res;
}
// Star -> RegAtom { "*" | "+" | "?" }
RegularExpressionNode star(Set<Token.Type> synco) throws IOException, ParserError{
RegularExpressionNode res;
res = regatom(synco);
if(filter.getToken().kind == Token.Type.RE_COVER){ // *
RegularExpressionNode e = res;
res = new StarNode(e);
filter.matchToken();
}else if(filter.getToken().kind == Token.Type.RE_OPT){ // ?
//Option: e | empty
RegularExpressionNode e = res;
res = new OrNode(e, new EmptyWordNode(e));
filter.matchToken();
}else if(filter.getToken().kind == Token.Type.RE_PLUS){ // +
//PosKleen: e concat e*
RegularExpressionNode e = res;
StarNode star = new StarNode(e);
res = new ConcatNode(e,star);
filter.matchToken();
}
return res;
}
//RegAtom -> <RegLiteral> | "(" Or ")" | "[" <RegLiteral> "-" <RegLiteral> "]"
RegularExpressionNode regatom(Set<Token.Type> sync) throws IOException, ParserError{
RegularExpressionNode res;
if(filter.getToken().kind == Token.Type.RE_MARK){
filter.matchToken();
Token first = filter.getToken();
filter.matchToken(Token.Type.RE_CHAR, sync);
res = new RangeExprNode(first,first);
Token next = null;
while(filter.getToken().kind != Token.Type.RE_MARK){
next = filter.getToken();
filter.matchToken(Token.Type.RE_CHAR, sync);
RegularExpressionNode temp = res;
res = new ConcatNode(temp, new RangeExprNode(next,next));
}
filter.matchToken();
}else if(filter.getToken().kind == Token.Type.RE_BRACKETOPEN){
filter.matchToken();
res = or(sync);
filter.matchToken(Token.Type.RE_BRACKETCLOSE, sync);
}else if(filter.getToken().kind == Token.Type.RE_SBOPEN){
filter.matchToken();
Token raA = filter.getToken();
filter.matchToken(Token.Type.RE_CHAR, sync);
filter.matchToken(Token.Type.RE_RANGE, sync);
Token raB = filter.getToken();
filter.matchToken(Token.Type.RE_CHAR, sync);
filter.matchToken(Token.Type.RE_SBCLOSE, sync);
res = new RangeExprNode(raA,raB);
}else{
Token currentToken = filter.getToken();
ParserError error = new ParserError(currentToken, "REGEX Parser error");
errors.add(error);
throw error;
}
return res;
}
}