-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathScanner.java
More file actions
702 lines (664 loc) · 15.4 KB
/
Scanner.java
File metadata and controls
702 lines (664 loc) · 15.4 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
package cop5556sp17;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;
import java.util.Collections;
public class Scanner {
/**
* Kind enum
*/
public static enum Kind {
IDENT(""), INT_LIT(""), KW_INTEGER("integer"), KW_BOOLEAN("boolean"),
KW_IMAGE("image"), KW_URL("url"), KW_FILE("file"), KW_FRAME("frame"),
KW_WHILE("while"), KW_IF("if"), KW_TRUE("true"), KW_FALSE("false"),
SEMI(";"), COMMA(","), LPAREN("("), RPAREN(")"), LBRACE("{"),
RBRACE("}"), ARROW("->"), BARARROW("|->"), OR("|"), AND("&"),
EQUAL("=="), NOTEQUAL("!="), LT("<"), GT(">"), LE("<="), GE(">="),
PLUS("+"), MINUS("-"), TIMES("*"), DIV("/"), MOD("%"), NOT("!"),
ASSIGN("<-"), OP_BLUR("blur"), OP_GRAY("gray"), OP_CONVOLVE("convolve"),
KW_SCREENHEIGHT("screenheight"), KW_SCREENWIDTH("screenwidth"),
OP_WIDTH("width"), OP_HEIGHT("height"), KW_XLOC("xloc"), KW_YLOC("yloc"),
KW_HIDE("hide"), KW_SHOW("show"), KW_MOVE("move"), OP_SLEEP("sleep"),
KW_SCALE("scale"), EOF("eof");
Kind(String text) {
this.text = text;
}
final String text;
String getText() {
return text;
}
}
public static enum State {
START,
IN_IDENT,
IN_DIGIT,
AFTER_EQ,
AFTER_NOT,
AFTER_LESS,
AFTER_GREAT,
AFTER_OR,
AFTER_MINUS,
AFTER_SLASH,
IN_COMMENT,
END_COMMENT
}
/**
* Thrown by Scanner when an illegal character is encountered
*/
@SuppressWarnings("serial")
public static class IllegalCharException extends Exception {
public IllegalCharException(String message) {
super(message);
}
}
/**
* Thrown by Scanner when an int literal is not a value that can be represented by an int.
*/
@SuppressWarnings("serial")
public static class IllegalNumberException extends Exception {
public IllegalNumberException(String message){
super(message);
}
}
/**
* Holds the line and position in the line of a token.
*/
static class LinePos {
public final int line;
public final int posInLine;
public LinePos(int line, int posInLine) {
super();
this.line = line;
this.posInLine = posInLine;
}
@Override
public String toString() {
return "LinePos [line=" + line + ", posInLine=" + posInLine + "]";
}
}
public class Token {
public final Kind kind;
public final int pos; //position in input array
public final int length;
//returns the text of this Token
public String getText() {
//TODO IMPLEMENT THIS
if(this.kind == Kind.IDENT)
{
return chars.substring(pos, pos+length);
}
else if(this.kind == Kind.INT_LIT)
{
return chars.substring(pos,pos+length);
}
else
{
return this.kind.getText();
}
}
//returns a LinePos object representing the line and column of this Token
LinePos getLinePos(){
//TODO IMPLEMENT THIS
int index =0;
if(linenos.isEmpty())
{
return (new LinePos(0,pos));
}
else
{
LinePos lpos;
index = Collections.binarySearch(linenos,pos);
if(index == 0)
{
lpos = new LinePos(0,pos);
}
else
{
lpos = new LinePos(Math.abs(index+2),pos-linenos.get(Math.abs(index+2))-1);
}
return lpos;
}
}
Token(Kind kind, int pos, int length) {
this.kind = kind;
this.pos = pos;
this.length = length;
}
/**
* Precondition: kind = Kind.INT_LIT, the text can be represented with a Java int.
* Note that the validity of the input should have been checked when the Token was created.
* So the exception should never be thrown.
*
* @return int value of this token, which should represent an INT_LIT
* @throws NumberFormatException
*/
public int intVal() throws NumberFormatException{
//TODO IMPLEMENT THIS
String str = chars.substring(pos,pos+length);
int val = Integer.parseInt(str);
return val;
}
public boolean isKind(Kind kind)
{
for(Kind itr : Kind.values())
{
if(itr.equals(kind))
{
return true;
}
}
return false;
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + getOuterType().hashCode();
result = prime * result + ((kind == null) ? 0 : kind.hashCode());
result = prime * result + length;
result = prime * result + pos;
return result;
}
@Override
public boolean equals(Object obj) {
if (this == obj) {
return true;
}
if (obj == null) {
return false;
}
if (!(obj instanceof Token)) {
return false;
}
Token other = (Token) obj;
if (!getOuterType().equals(other.getOuterType())) {
return false;
}
if (kind != other.kind) {
return false;
}
if (length != other.length) {
return false;
}
if (pos != other.pos) {
return false;
}
return true;
}
private Scanner getOuterType() {
return Scanner.this;
}
}
Scanner(String chars) {
this.chars = chars;
tokens = new ArrayList<Token>();
linenos = new ArrayList<Integer>();
keywords = new HashMap<String, Kind>();
for(Kind token : Kind.values())
{
String str = token.getText();
if(str.length()>0 && Character.isLetter(str.charAt(0)) && !str.equals("eof"))
{
keywords.put(token.getText(),token);
}
}
}
/**
* Initializes Scanner object by traversing chars and adding tokens to tokens list.
*
* @return this scanner
* @throws IllegalCharException
* @throws IllegalNumberException
*/
public Scanner scan() throws IllegalCharException, IllegalNumberException {
int pos = 0;
//TODO IMPLEMENT THIS!!!!
int length = chars.length();
linenos.add(0);
State state = State.START;
int startPos =0;
boolean isBar = false;
//boolean isNot = false;
//boolean isLess = false;
//boolean isGreat = false;
//int count_eq =0;
int ch;
while(pos <= length)
{
ch = pos<length? chars.charAt(pos):-1;
switch(state)
{
case START:
{
pos = skipWhiteSpace(pos);
ch = pos<chars.length()? chars.charAt(pos):-1;
startPos = pos;
isBar = false;
//isNot = false;
//isLess = false;
//isGreat = false;
//count_eq =0;
switch(ch)
{
case -1:
{
pos++;
}break;
case ';':
{
tokens.add(new Token(Kind.SEMI,startPos,1));pos++;
}break;
case ',':
{
tokens.add(new Token(Kind.COMMA,startPos,1));pos++;
}break;
case ')':
{
tokens.add(new Token(Kind.RPAREN,startPos,1));pos++;
}break;
case '(':
{
tokens.add(new Token(Kind.LPAREN,startPos,1));pos++;
}break;
case '{':
{
tokens.add(new Token(Kind.LBRACE,startPos,1));pos++;
}break;
case '}':
{
tokens.add(new Token(Kind.RBRACE,startPos,1));pos++;
}break;
case '&':
{
tokens.add(new Token(Kind.AND,startPos,1));pos++;
}break;
case '+':
{
tokens.add(new Token(Kind.PLUS,startPos,1));pos++;
}break;
case '*':
{
tokens.add(new Token(Kind.TIMES,startPos,1));pos++;
}break;
case '%':
{
tokens.add(new Token(Kind.MOD,startPos,1));pos++;
}break;
case '0':
{
tokens.add(new Token(Kind.INT_LIT,startPos,1));pos++;
}break;
case '=':
{
state = State.AFTER_EQ;pos++;
}break;
case '|':
{
state = State.AFTER_OR;pos++;
isBar = true;
}break;
case '!':
{
state = State.AFTER_NOT;pos++;
//isNot = true;
}break;
case '<':
{
state = State.AFTER_LESS;pos++;
//isLess = true;
}break;
case '>':
{
state = State.AFTER_GREAT;pos++;
//isGreat = true;
}break;
case '-':
{
state = State.AFTER_MINUS;pos++;
}break;
case '/':
{
state = State.AFTER_SLASH;pos++;
}break;
default:
{
if(Character.isDigit(ch))
{
state = State.IN_DIGIT;pos++;
}
else if(Character.isJavaIdentifierStart(ch))
{
state = State.IN_IDENT;
pos++;
}
else
{
throw new IllegalCharException("illegal char" + ch + "at pos"+pos);
}
}break;
}
}break;
case AFTER_EQ:
{
if(ch == '=')
{
/*if(isLess)
{
count_eq++;pos++;state = State.AFTER_EQ;
}
else if(isGreat)
{
count_eq++;pos++;state = State.AFTER_EQ;
}
else if(isNot)
{
count_eq++;pos++;state = State.AFTER_EQ;
}
else*/
{
tokens.add(new Token(Kind.EQUAL,startPos,2));pos++;state = State.START;
}
}
else
{
/*if(isLess)
{
if(count_eq %2 ==0)
{
tokens.add(new Token(Kind.LT,startPos,1));
int num = count_eq /2;
for(int i =1;i<=num;i++)
{
tokens.add(new Token(Kind.EQUAL,startPos+1+2*(i-1),2));
}
}
else
{
tokens.add(new Token(Kind.LE,startPos,2));
int num = (count_eq-1)/2;
for(int i=1;i<=num;i++)
{
tokens.add(new Token(Kind.EQUAL,startPos+2*i,2));
}
}
state = State.START;
}
else if(isGreat)
{
if(count_eq %2 ==0)
{
tokens.add(new Token(Kind.GT,startPos,1));
int num = count_eq /2;
for(int i =1;i<=num;i++)
{
tokens.add(new Token(Kind.EQUAL,startPos+1+2*(i-1),2));
}
}
else
{
tokens.add(new Token(Kind.GE,startPos,2));
int num = (count_eq-1)/2;
for(int i=1;i<=num;i++)
{
tokens.add(new Token(Kind.EQUAL,startPos+2*i,2));
}
}
state = State.START;
}
else if(isNot)
{
if(count_eq %2 ==0)
{
tokens.add(new Token(Kind.NOT,startPos,1));
int num = count_eq /2;
for(int i =1;i<=num;i++)
{
tokens.add(new Token(Kind.EQUAL,startPos+1+2*(i-1),2));
}
}
else
{
tokens.add(new Token(Kind.NOTEQUAL,startPos,2));
int num = (count_eq-1)/2;
for(int i=1;i<=num;i++)
{
tokens.add(new Token(Kind.EQUAL,startPos+2*i,2));
}
}
state = State.START;
}
else*/
{
throw new IllegalCharException("illegal char " + '=' + " at pos " + (pos-1));
}
}
}break;
case AFTER_OR:
{
if(ch == '-')
{
state = State.AFTER_MINUS;pos++;
}
else
{
tokens.add(new Token(Kind.OR,startPos,1));state = State.START;
}
}break;
case AFTER_MINUS:
{
if(ch == '>')
{
if(isBar)
{
tokens.add(new Token(Kind.BARARROW,startPos,3));pos++;state = State.START;
}
else
{
tokens.add(new Token(Kind.ARROW,startPos,2));pos++;state = State.START;
}
}
else
{
if(isBar)
{
tokens.add(new Token(Kind.OR,startPos,1));
tokens.add(new Token(Kind.MINUS,startPos+1,1));state = State.START;
}
else
{
tokens.add(new Token(Kind.MINUS,startPos,1));state = State.START;
}
}
}break;
case AFTER_NOT:
{
if(ch == '=')
{
//count_eq++;
//state = State.AFTER_EQ;pos++;
tokens.add(new Token(Kind.NOTEQUAL,startPos,2));state = State.START;pos++;
}
else
{
tokens.add(new Token(Kind.NOT,startPos,1));state = State.START;
}
}break;
case AFTER_LESS:
{
if(ch == '=')
{
//count_eq++;
//state = State.AFTER_EQ;pos++;
tokens.add(new Token(Kind.LE,startPos,2));state = State.START;pos++;
}
else if(ch == '-')
{
tokens.add(new Token(Kind.ASSIGN,startPos,2));pos++;state = State.START;
}
else
{
tokens.add(new Token(Kind.LT,startPos,1));state = State.START;
}
}break;
case AFTER_GREAT:
{
if(ch == '=')
{
//count_eq++;
//state = State.AFTER_EQ;pos++;
tokens.add(new Token(Kind.GE,startPos,2));state = State.START;pos++;
}
else
{
tokens.add(new Token(Kind.GT,startPos,1));state = State.START;
}
}break;
case AFTER_SLASH:
{
if(ch == '*')
{
state = State.IN_COMMENT;pos++;
}
else
{
tokens.add(new Token(Kind.DIV,startPos,1));state = State.START;
}
}break;
case IN_COMMENT:
{
if(Character.isWhitespace(ch))
{
if(ch == '\n')
{
linenos.add(pos);
}
pos++;
}
else if(ch == '*')
{
state = State.END_COMMENT;
pos++;
}
else
{
pos++;
}
}break;
case END_COMMENT:
{
if(ch == '/')
{
pos++;
state = State.START;
}
else
{
state = State.IN_COMMENT;
}
}break;
case IN_IDENT:
{
if(Character.isJavaIdentifierPart(ch))
{
pos++;
}
else
{
String identifier = chars.substring(startPos, pos);
Kind token = keywords.get(identifier);
if(token == null)
{
tokens.add(new Token(Kind.IDENT,startPos,pos-startPos));state = State.START;
}
else
{
tokens.add(new Token(token,startPos,pos-startPos));state = State.START;
}
}
}break;
case IN_DIGIT:
{
if(Character.isDigit(ch))
{
pos++;
}
else
{
String identifier = chars.substring(startPos, pos);
try{
int val = Integer.parseInt(identifier);
}
catch(NumberFormatException e)
{
throw new IllegalNumberException("illegal number " + identifier + " at pos " + (pos-1));
}
tokens.add(new Token(Kind.INT_LIT,startPos,pos-startPos));state = State.START;
}
}break;
}
if(ch == -1)
{
tokens.add(new Token(Kind.EOF,pos,0));
break;
}
}
return this;
}
public int skipWhiteSpace(int pos)
{
int ch;
while(true)
{
ch = pos<chars.length()? chars.charAt(pos):-1;
if(Character.isWhitespace(ch))
{
if(ch == '\n')
{
linenos.add(pos);
}
pos++;
}
else
{
break;
}
}
return pos;
}
final ArrayList<Token> tokens;
final ArrayList<Integer> linenos;
final String chars;
int tokenNum=0;
private static Map<String, Kind> keywords;
/*
* Return the next token in the token list and update the state so that
* the next call will return the Token..
*/
public Token nextToken() {
if (tokenNum >= tokens.size())
return null;
return tokens.get(tokenNum++);
}
/*
* Return the next token in the token list without updating the state.
* (So the following call to next will return the same token.)
*/
public Token peek(){
if (tokenNum >= tokens.size())
return null;
return tokens.get(tokenNum);
}
/**
* Returns a LinePos object containing the line and position in line of the
* given token.
*
* Line numbers start counting at 0
*
* @param t
* @return
*/
public LinePos getLinePos(Token t) {
//TODO IMPLEMENT THIS
return t.getLinePos();
}
}