-
Notifications
You must be signed in to change notification settings - Fork 6
/
MJLexer.java
886 lines (785 loc) · 24.9 KB
/
MJLexer.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
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
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
/* The following code was generated by JFlex 1.4.3 on 2/1/23, 7:22 PM */
/*
* Copyright (C) 2018 Danijel Askov
*
* This file is part of MicroJava Compiler.
*
* MicroJava Compiler is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* MicroJava Compiler is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
package askov.schoolprojects.compilerconstruction.mjcompiler;
import java_cup.runtime.Symbol;
import askov.schoolprojects.compilerconstruction.mjcompiler.loggers.LexicalErrorMJLogger;
/**
* This class is a scanner generated by
* <a href="http://www.jflex.de/">JFlex</a> 1.4.3
* on 2/1/23, 7:22 PM from the specification file
* <tt>src/main/spec/mjlexer.flex</tt>
*/
class MJLexer implements java_cup.runtime.Scanner {
/** This character denotes the end of file */
public static final int YYEOF = -1;
/** initial size of the lookahead buffer */
private static final int ZZ_BUFFERSIZE = 16384;
/** lexical states */
public static final int YYINITIAL = 0;
/**
* ZZ_LEXSTATE[l] is the state in the DFA for the lexical state l
* ZZ_LEXSTATE[l+1] is the state in the DFA for the lexical state l
* at the beginning of a line
* l is of the form l = 2*k, k a non negative integer
*/
private static final int ZZ_LEXSTATE[] = {
0, 0
};
/**
* Translates characters to character classes
*/
private static final String ZZ_CMAP_PACKED =
"\10\0\2\3\1\2\1\0\1\3\1\1\22\0\1\10\1\46\3\7"+
"\1\44\1\51\1\6\1\56\1\57\1\43\1\41\1\54\1\42\1\55"+
"\1\4\12\5\1\7\1\53\1\47\1\45\1\50\2\7\32\21\1\60"+
"\1\7\1\61\1\7\1\22\1\7\1\16\1\27\1\31\1\35\1\14"+
"\1\15\1\25\1\37\1\32\1\21\1\30\1\17\1\26\1\33\1\24"+
"\1\23\1\21\1\12\1\20\1\11\1\13\1\36\1\34\1\40\2\21"+
"\1\62\1\52\1\63\1\7\uff81\0";
/**
* Translates characters to character classes
*/
private static final char [] ZZ_CMAP = zzUnpackCMap(ZZ_CMAP_PACKED);
/**
* Translates DFA states to action switch labels.
*/
private static final int [] ZZ_ACTION = zzUnpackAction();
private static final String ZZ_ACTION_PACKED_0 =
"\1\0\1\1\2\2\1\3\1\4\1\1\15\5\1\6"+
"\1\7\1\10\1\11\1\12\1\1\1\13\1\14\2\1"+
"\1\15\1\16\1\17\1\20\1\21\1\22\1\23\1\24"+
"\1\25\1\2\1\0\11\5\1\26\2\5\1\27\1\5"+
"\1\30\1\31\1\32\1\33\1\34\1\35\1\36\1\37"+
"\1\40\13\5\1\41\2\5\1\42\1\5\1\43\1\44"+
"\10\5\1\45\3\5\1\46\1\47\1\50\1\5\1\51"+
"\1\52\1\53\3\5\1\54\1\55\1\5\1\56";
private static int [] zzUnpackAction() {
int [] result = new int[108];
int offset = 0;
offset = zzUnpackAction(ZZ_ACTION_PACKED_0, offset, result);
return result;
}
private static int zzUnpackAction(String packed, int offset, int [] result) {
int i = 0; /* index in packed string */
int j = offset; /* index in unpacked array */
int l = packed.length();
while (i < l) {
int count = packed.charAt(i++);
int value = packed.charAt(i++);
do result[j++] = value; while (--count > 0);
}
return j;
}
/**
* Translates a state to a row index in the transition table
*/
private static final int [] ZZ_ROWMAP = zzUnpackRowMap();
private static final String ZZ_ROWMAP_PACKED_0 =
"\0\0\0\64\0\150\0\64\0\234\0\320\0\u0104\0\u0138"+
"\0\u016c\0\u01a0\0\u01d4\0\u0208\0\u023c\0\u0270\0\u02a4\0\u02d8"+
"\0\u030c\0\u0340\0\u0374\0\u03a8\0\u03dc\0\u0410\0\64\0\64"+
"\0\u0444\0\u0478\0\u04ac\0\u04e0\0\u0514\0\u0548\0\64\0\64"+
"\0\64\0\64\0\64\0\64\0\64\0\64\0\64\0\u057c"+
"\0\u05b0\0\u05e4\0\u0618\0\u064c\0\u0680\0\u06b4\0\u06e8\0\u071c"+
"\0\u0750\0\u0784\0\u01a0\0\u07b8\0\u07ec\0\u01a0\0\u0820\0\64"+
"\0\64\0\64\0\64\0\64\0\64\0\64\0\64\0\64"+
"\0\u0854\0\u0888\0\u08bc\0\u08f0\0\u0924\0\u0958\0\u098c\0\u09c0"+
"\0\u09f4\0\u0a28\0\u0a5c\0\u01a0\0\u0a90\0\u0ac4\0\u01a0\0\u0af8"+
"\0\u01a0\0\u01a0\0\u0b2c\0\u0b60\0\u0b94\0\u0bc8\0\u0bfc\0\u0c30"+
"\0\u0c64\0\u0c98\0\u01a0\0\u0ccc\0\u0d00\0\u0d34\0\u01a0\0\u01a0"+
"\0\u01a0\0\u0d68\0\u01a0\0\u01a0\0\u01a0\0\u0d9c\0\u0dd0\0\u0e04"+
"\0\u01a0\0\u01a0\0\u0e38\0\u01a0";
private static int [] zzUnpackRowMap() {
int [] result = new int[108];
int offset = 0;
offset = zzUnpackRowMap(ZZ_ROWMAP_PACKED_0, offset, result);
return result;
}
private static int zzUnpackRowMap(String packed, int offset, int [] result) {
int i = 0; /* index in packed string */
int j = offset; /* index in unpacked array */
int l = packed.length();
while (i < l) {
int high = packed.charAt(i++) << 16;
result[j++] = high | packed.charAt(i++);
}
return j;
}
/**
* The transition table of the DFA
*/
private static final int [] ZZ_TRANS = zzUnpackTrans();
private static final String ZZ_TRANS_PACKED_0 =
"\1\2\1\3\2\4\1\5\1\6\1\7\1\2\1\4"+
"\1\10\1\11\1\12\1\13\1\14\4\12\1\2\1\15"+
"\3\12\1\16\1\12\1\17\1\20\1\21\1\22\1\23"+
"\1\24\2\12\1\25\1\26\1\27\1\30\1\31\1\32"+
"\1\33\1\34\1\35\1\36\1\37\1\40\1\41\1\42"+
"\1\43\1\44\1\45\1\46\1\47\66\0\1\4\65\0"+
"\1\50\64\0\1\6\62\0\60\51\5\0\1\12\3\0"+
"\1\12\1\52\26\12\30\0\1\12\3\0\3\12\1\53"+
"\24\12\30\0\1\12\3\0\30\12\30\0\1\12\3\0"+
"\6\12\1\54\20\12\1\55\30\0\1\12\3\0\5\12"+
"\1\56\22\12\30\0\1\12\3\0\1\12\1\57\26\12"+
"\30\0\1\12\3\0\1\12\1\60\26\12\30\0\1\12"+
"\3\0\6\12\1\61\4\12\1\62\14\12\30\0\1\12"+
"\3\0\4\12\1\63\23\12\30\0\1\12\3\0\3\12"+
"\1\64\24\12\30\0\1\12\3\0\26\12\1\65\1\12"+
"\30\0\1\12\3\0\13\12\1\66\14\12\30\0\1\12"+
"\3\0\13\12\1\67\14\12\64\0\1\70\64\0\1\71"+
"\66\0\1\72\63\0\1\73\63\0\1\74\63\0\1\75"+
"\67\0\1\76\64\0\1\77\11\0\1\50\1\3\1\4"+
"\61\50\6\0\1\100\62\0\1\12\3\0\2\12\1\101"+
"\25\12\30\0\1\12\3\0\1\102\4\12\1\103\22\12"+
"\30\0\1\12\3\0\7\12\1\104\20\12\30\0\1\12"+
"\3\0\1\105\27\12\30\0\1\12\3\0\6\12\1\106"+
"\21\12\30\0\1\12\3\0\13\12\1\107\5\12\1\110"+
"\6\12\30\0\1\12\3\0\3\12\1\111\24\12\30\0"+
"\1\12\3\0\5\12\1\112\22\12\30\0\1\12\3\0"+
"\22\12\1\113\5\12\30\0\1\12\3\0\23\12\1\114"+
"\4\12\30\0\1\12\3\0\21\12\1\115\6\12\30\0"+
"\1\12\3\0\21\12\1\116\6\12\30\0\1\12\3\0"+
"\3\12\1\117\24\12\30\0\1\12\3\0\2\12\1\120"+
"\25\12\30\0\1\12\3\0\24\12\1\121\3\12\30\0"+
"\1\12\3\0\3\12\1\122\24\12\30\0\1\12\3\0"+
"\3\12\1\123\24\12\30\0\1\12\3\0\7\12\1\101"+
"\20\12\30\0\1\12\3\0\14\12\1\124\13\12\30\0"+
"\1\12\3\0\22\12\1\125\5\12\30\0\1\12\3\0"+
"\5\12\1\126\22\12\30\0\1\12\3\0\7\12\1\127"+
"\20\12\30\0\1\12\3\0\1\130\6\12\1\131\20\12"+
"\30\0\1\12\3\0\6\12\1\132\21\12\30\0\1\12"+
"\3\0\24\12\1\133\3\12\30\0\1\12\3\0\1\12"+
"\1\134\26\12\30\0\1\12\3\0\22\12\1\135\5\12"+
"\30\0\1\12\3\0\1\12\1\136\26\12\30\0\1\12"+
"\3\0\1\137\27\12\30\0\1\12\3\0\17\12\1\140"+
"\10\12\30\0\1\12\3\0\7\12\1\141\20\12\30\0"+
"\1\12\3\0\21\12\1\142\6\12\30\0\1\12\3\0"+
"\1\143\27\12\30\0\1\12\3\0\3\12\1\144\24\12"+
"\30\0\1\12\3\0\22\12\1\145\5\12\30\0\1\12"+
"\3\0\24\12\1\146\3\12\30\0\1\12\3\0\5\12"+
"\1\147\22\12\30\0\1\12\3\0\22\12\1\150\5\12"+
"\30\0\1\12\3\0\7\12\1\151\20\12\30\0\1\12"+
"\3\0\15\12\1\152\12\12\30\0\1\12\3\0\2\12"+
"\1\153\25\12\30\0\1\12\3\0\3\12\1\154\24\12"+
"\23\0";
private static int [] zzUnpackTrans() {
int [] result = new int[3692];
int offset = 0;
offset = zzUnpackTrans(ZZ_TRANS_PACKED_0, offset, result);
return result;
}
private static int zzUnpackTrans(String packed, int offset, int [] result) {
int i = 0; /* index in packed string */
int j = offset; /* index in unpacked array */
int l = packed.length();
while (i < l) {
int count = packed.charAt(i++);
int value = packed.charAt(i++);
value--;
do result[j++] = value; while (--count > 0);
}
return j;
}
/* error codes */
private static final int ZZ_UNKNOWN_ERROR = 0;
private static final int ZZ_NO_MATCH = 1;
private static final int ZZ_PUSHBACK_2BIG = 2;
/* error messages for the codes above */
private static final String ZZ_ERROR_MSG[] = {
"Unkown internal scanner error",
"Error: could not match input",
"Error: pushback value was too large"
};
/**
* ZZ_ATTRIBUTE[aState] contains the attributes of state <code>aState</code>
*/
private static final int [] ZZ_ATTRIBUTE = zzUnpackAttribute();
private static final String ZZ_ATTRIBUTE_PACKED_0 =
"\1\0\1\11\1\1\1\11\22\1\2\11\6\1\11\11"+
"\1\1\1\0\16\1\11\11\54\1";
private static int [] zzUnpackAttribute() {
int [] result = new int[108];
int offset = 0;
offset = zzUnpackAttribute(ZZ_ATTRIBUTE_PACKED_0, offset, result);
return result;
}
private static int zzUnpackAttribute(String packed, int offset, int [] result) {
int i = 0; /* index in packed string */
int j = offset; /* index in unpacked array */
int l = packed.length();
while (i < l) {
int count = packed.charAt(i++);
int value = packed.charAt(i++);
do result[j++] = value; while (--count > 0);
}
return j;
}
/** the input device */
private java.io.Reader zzReader;
/** the current state of the DFA */
private int zzState;
/** the current lexical state */
private int zzLexicalState = YYINITIAL;
/** this buffer contains the current text to be matched and is
the source of the yytext() string */
private char zzBuffer[] = new char[ZZ_BUFFERSIZE];
/** the textposition at the last accepting state */
private int zzMarkedPos;
/** the current text position in the buffer */
private int zzCurrentPos;
/** startRead marks the beginning of the yytext() string in the buffer */
private int zzStartRead;
/** endRead marks the last character in the buffer, that has been read
from input */
private int zzEndRead;
/** number of newlines encountered up to the start of the matched text */
private int yyline;
/** the number of characters up to the start of the matched text */
private int yychar;
/**
* the number of characters from the last newline up to the start of the
* matched text
*/
private int yycolumn;
/**
* zzAtBOL == true <=> the scanner is currently at the beginning of a line
*/
private boolean zzAtBOL = true;
/** zzAtEOF == true <=> the scanner is at the EOF */
private boolean zzAtEOF;
/** denotes if the user-EOF-code has already been executed */
private boolean zzEOFDone;
/* user code: */
LexicalErrorMJLogger lexicalErrorMJLogger = new LexicalErrorMJLogger();
private Symbol newSymbol(int type) {
return new Symbol(type, yyline + 1, yycolumn + 1);
}
private Symbol newSymbol(int type, Object value) {
return new Symbol(type, yyline + 1, yycolumn + 1, value);
}
/**
* Creates a new scanner
* There is also a java.io.InputStream version of this constructor.
*
* @param in the java.io.Reader to read input from.
*/
MJLexer(java.io.Reader in) {
this.zzReader = in;
}
/**
* Creates a new scanner.
* There is also java.io.Reader version of this constructor.
*
* @param in the java.io.Inputstream to read input from.
*/
MJLexer(java.io.InputStream in) {
this(new java.io.InputStreamReader(in));
}
/**
* Unpacks the compressed character translation table.
*
* @param packed the packed character translation table
* @return the unpacked character translation table
*/
private static char [] zzUnpackCMap(String packed) {
char [] map = new char[0x10000];
int i = 0; /* index in packed string */
int j = 0; /* index in unpacked array */
while (i < 130) {
int count = packed.charAt(i++);
char value = packed.charAt(i++);
do map[j++] = value; while (--count > 0);
}
return map;
}
/**
* Refills the input buffer.
*
* @return <code>false</code>, iff there was new input.
*
* @exception java.io.IOException if any I/O-Error occurs
*/
private boolean zzRefill() throws java.io.IOException {
/* first: make room (if you can) */
if (zzStartRead > 0) {
System.arraycopy(zzBuffer, zzStartRead,
zzBuffer, 0,
zzEndRead-zzStartRead);
/* translate stored positions */
zzEndRead-= zzStartRead;
zzCurrentPos-= zzStartRead;
zzMarkedPos-= zzStartRead;
zzStartRead = 0;
}
/* is the buffer big enough? */
if (zzCurrentPos >= zzBuffer.length) {
/* if not: blow it up */
char newBuffer[] = new char[zzCurrentPos*2];
System.arraycopy(zzBuffer, 0, newBuffer, 0, zzBuffer.length);
zzBuffer = newBuffer;
}
/* finally: fill the buffer with new input */
int numRead = zzReader.read(zzBuffer, zzEndRead,
zzBuffer.length-zzEndRead);
if (numRead > 0) {
zzEndRead+= numRead;
return false;
}
// unlikely but not impossible: read 0 characters, but not at end of stream
if (numRead == 0) {
int c = zzReader.read();
if (c == -1) {
return true;
} else {
zzBuffer[zzEndRead++] = (char) c;
return false;
}
}
// numRead < 0
return true;
}
/**
* Closes the input stream.
*/
public final void yyclose() throws java.io.IOException {
zzAtEOF = true; /* indicate end of file */
zzEndRead = zzStartRead; /* invalidate buffer */
if (zzReader != null)
zzReader.close();
}
/**
* Resets the scanner to read from a new input stream.
* Does not close the old reader.
*
* All internal variables are reset, the old input stream
* <b>cannot</b> be reused (internal buffer is discarded and lost).
* Lexical state is set to <tt>ZZ_INITIAL</tt>.
*
* @param reader the new input stream
*/
public final void yyreset(java.io.Reader reader) {
zzReader = reader;
zzAtBOL = true;
zzAtEOF = false;
zzEOFDone = false;
zzEndRead = zzStartRead = 0;
zzCurrentPos = zzMarkedPos = 0;
yyline = yychar = yycolumn = 0;
zzLexicalState = YYINITIAL;
}
/**
* Returns the current lexical state.
*/
public final int yystate() {
return zzLexicalState;
}
/**
* Enters a new lexical state
*
* @param newState the new lexical state
*/
public final void yybegin(int newState) {
zzLexicalState = newState;
}
/**
* Returns the text matched by the current regular expression.
*/
public final String yytext() {
return new String( zzBuffer, zzStartRead, zzMarkedPos-zzStartRead );
}
/**
* Returns the character at position <tt>pos</tt> from the
* matched text.
*
* It is equivalent to yytext().charAt(pos), but faster
*
* @param pos the position of the character to fetch.
* A value from 0 to yylength()-1.
*
* @return the character at position pos
*/
public final char yycharat(int pos) {
return zzBuffer[zzStartRead+pos];
}
/**
* Returns the length of the matched text region.
*/
public final int yylength() {
return zzMarkedPos-zzStartRead;
}
/**
* Reports an error that occured while scanning.
*
* In a wellformed scanner (no or only correct usage of
* yypushback(int) and a match-all fallback rule) this method
* will only be called with things that "Can't Possibly Happen".
* If this method is called, something is seriously wrong
* (e.g. a JFlex bug producing a faulty scanner etc.).
*
* Usual syntax/scanner level error handling should be done
* in error fallback rules.
*
* @param errorCode the code of the errormessage to display
*/
private void zzScanError(int errorCode) {
String message;
try {
message = ZZ_ERROR_MSG[errorCode];
}
catch (ArrayIndexOutOfBoundsException e) {
message = ZZ_ERROR_MSG[ZZ_UNKNOWN_ERROR];
}
throw new Error(message);
}
/**
* Pushes the specified amount of characters back into the input stream.
*
* They will be read again by then next call of the scanning method
*
* @param number the number of characters to be read again.
* This number must not be greater than yylength()!
*/
public void yypushback(int number) {
if ( number > yylength() )
zzScanError(ZZ_PUSHBACK_2BIG);
zzMarkedPos -= number;
}
/**
* Contains user EOF-code, which will be executed exactly once,
* when the end of file is reached
*/
private void zzDoEOF() throws java.io.IOException {
if (!zzEOFDone) {
zzEOFDone = true;
yyclose();
}
}
/**
* Resumes scanning until the next regular expression is matched,
* the end of input is encountered or an I/O-Error occurs.
*
* @return the next token
* @exception java.io.IOException if any I/O-Error occurs
*/
public java_cup.runtime.Symbol next_token() throws java.io.IOException {
int zzInput;
int zzAction;
// cached fields:
int zzCurrentPosL;
int zzMarkedPosL;
int zzEndReadL = zzEndRead;
char [] zzBufferL = zzBuffer;
char [] zzCMapL = ZZ_CMAP;
int [] zzTransL = ZZ_TRANS;
int [] zzRowMapL = ZZ_ROWMAP;
int [] zzAttrL = ZZ_ATTRIBUTE;
while (true) {
zzMarkedPosL = zzMarkedPos;
boolean zzR = false;
for (zzCurrentPosL = zzStartRead; zzCurrentPosL < zzMarkedPosL;
zzCurrentPosL++) {
switch (zzBufferL[zzCurrentPosL]) {
case '\u000B':
case '\u000C':
case '\u0085':
case '\u2028':
case '\u2029':
yyline++;
yycolumn = 0;
zzR = false;
break;
case '\r':
yyline++;
yycolumn = 0;
zzR = true;
break;
case '\n':
if (zzR)
zzR = false;
else {
yyline++;
yycolumn = 0;
}
break;
default:
zzR = false;
yycolumn++;
}
}
if (zzR) {
// peek one character ahead if it is \n (if we have counted one line too much)
boolean zzPeek;
if (zzMarkedPosL < zzEndReadL)
zzPeek = zzBufferL[zzMarkedPosL] == '\n';
else if (zzAtEOF)
zzPeek = false;
else {
boolean eof = zzRefill();
zzEndReadL = zzEndRead;
zzMarkedPosL = zzMarkedPos;
zzBufferL = zzBuffer;
if (eof)
zzPeek = false;
else
zzPeek = zzBufferL[zzMarkedPosL] == '\n';
}
if (zzPeek) yyline--;
}
zzAction = -1;
zzCurrentPosL = zzCurrentPos = zzStartRead = zzMarkedPosL;
zzState = ZZ_LEXSTATE[zzLexicalState];
zzForAction: {
while (true) {
if (zzCurrentPosL < zzEndReadL)
zzInput = zzBufferL[zzCurrentPosL++];
else if (zzAtEOF) {
zzInput = YYEOF;
break zzForAction;
}
else {
// store back cached positions
zzCurrentPos = zzCurrentPosL;
zzMarkedPos = zzMarkedPosL;
boolean eof = zzRefill();
// get translated positions and possibly new buffer
zzCurrentPosL = zzCurrentPos;
zzMarkedPosL = zzMarkedPos;
zzBufferL = zzBuffer;
zzEndReadL = zzEndRead;
if (eof) {
zzInput = YYEOF;
break zzForAction;
}
else {
zzInput = zzBufferL[zzCurrentPosL++];
}
}
int zzNext = zzTransL[ zzRowMapL[zzState] + zzCMapL[zzInput] ];
if (zzNext == -1) break zzForAction;
zzState = zzNext;
int zzAttributes = zzAttrL[zzState];
if ( (zzAttributes & 1) == 1 ) {
zzAction = zzState;
zzMarkedPosL = zzCurrentPosL;
if ( (zzAttributes & 8) == 8 ) break zzForAction;
}
}
}
// store back cached position
zzMarkedPos = zzMarkedPosL;
switch (zzAction < 0 ? zzAction : ZZ_ACTION[zzAction]) {
case 2:
{ /* ignore */
}
case 47: break;
case 38:
{ return newSymbol(sym.PRINT);
}
case 48: break;
case 32:
{ return newSymbol(sym.CHAR, new Character(yytext().charAt(1)));
}
case 49: break;
case 10:
{ return newSymbol(sym.ASSIGN);
}
case 50: break;
case 22:
{ return newSymbol(sym.IF);
}
case 51: break;
case 43:
{ return newSymbol(sym.RETURN);
}
case 52: break;
case 13:
{ return newSymbol(sym.SEMI);
}
case 53: break;
case 41:
{ return newSymbol(sym.CONST);
}
case 54: break;
case 31:
{ return newSymbol(sym.OR);
}
case 55: break;
case 14:
{ return newSymbol(sym.COMMA);
}
case 56: break;
case 26:
{ return newSymbol(sym.EQ);
}
case 57: break;
case 15:
{ return newSymbol(sym.DOT);
}
case 58: break;
case 34:
{ return newSymbol(sym.BOOL, Boolean.valueOf(yytext()));
}
case 59: break;
case 25:
{ return newSymbol(sym.DECR);
}
case 60: break;
case 4:
{ return newSymbol(sym.INT, new Integer(yytext()));
}
case 61: break;
case 45:
{ return newSymbol(sym.PROGRAM);
}
case 62: break;
case 40:
{ return newSymbol(sym.CLASS);
}
case 63: break;
case 28:
{ return newSymbol(sym.LEQ);
}
case 64: break;
case 35:
{ return newSymbol(sym.READ);
}
case 65: break;
case 16:
{ return newSymbol(sym.LPAREN);
}
case 66: break;
case 24:
{ return newSymbol(sym.INCR);
}
case 67: break;
case 21:
{ return newSymbol(sym.RBRACE);
}
case 68: break;
case 30:
{ return newSymbol(sym.AND);
}
case 69: break;
case 3:
{ return newSymbol(sym.DIV);
}
case 70: break;
case 5:
{ return newSymbol(sym.IDENT, yytext());
}
case 71: break;
case 9:
{ return newSymbol(sym.MOD);
}
case 72: break;
case 1:
{ lexicalErrorMJLogger.log(yytext(), yyline + 1, yycolumn + 1); return newSymbol(sym.ERROR);
}
case 73: break;
case 29:
{ return newSymbol(sym.GEQ);
}
case 74: break;
case 44:
{ return newSymbol(sym.EXTENDS);
}
case 75: break;
case 12:
{ return newSymbol(sym.GT);
}
case 76: break;
case 11:
{ return newSymbol(sym.LT);
}
case 77: break;
case 46:
{ return newSymbol(sym.CONTINUE);
}
case 78: break;
case 27:
{ return newSymbol(sym.NEQ);
}
case 79: break;
case 18:
{ return newSymbol(sym.LBRACKET);
}
case 80: break;
case 8:
{ return newSymbol(sym.TIMES);
}
case 81: break;
case 6:
{ return newSymbol(sym.PLUS);
}
case 82: break;
case 39:
{ return newSymbol(sym.BREAK);
}
case 83: break;
case 42:
{ return newSymbol(sym.WHILE);
}
case 84: break;
case 17:
{ return newSymbol(sym.RPAREN);
}
case 85: break;
case 37:
{ return newSymbol(sym.VOID);
}
case 86: break;
case 36:
{ return newSymbol(sym.ELSE);
}
case 87: break;
case 20:
{ return newSymbol(sym.LBRACE);
}
case 88: break;
case 19:
{ return newSymbol(sym.RBRACKET);
}
case 89: break;
case 23:
{ return newSymbol(sym.DO);
}
case 90: break;
case 33:
{ return newSymbol(sym.NEW);
}
case 91: break;
case 7:
{ return newSymbol(sym.MINUS);
}
case 92: break;
default:
if (zzInput == YYEOF && zzStartRead == zzCurrentPos) {
zzAtEOF = true;
zzDoEOF();
{ return newSymbol(sym.EOF);
}
}
else {
zzScanError(ZZ_NO_MATCH);
}
}
}
}
}