This repository was archived by the owner on Aug 15, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathJavaLexer.h
983 lines (860 loc) · 33 KB
/
JavaLexer.h
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
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
////////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2007 IBM Corporation.
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// which accompanies this distribution, and is available at
// http://www.eclipse.org/legal/epl-v10.html
//
//Contributors:
// Philippe Charles ([email protected]) - initial API and implementation
////////////////////////////////////////////////////////////////////////////////
//#line 123 "LexerTemplateF.gi
//#line 128 "LexerTemplateF.gi
#pragma once
#include <iostream>
#include "IPrsStream.h"
#include "Object.h"
#include "ParseTable.h"
#include "RuleAction.h"
#include "stringex.h"
#include "Token.h"
#include "JavaLexersym.h"
#include "JavaLexerprs.h"
#include "JavaKWLexer.h"
#include "LexParser.h"
#include "LpgLexStream.h"
struct JavaLexer :public Object ,public RuleAction
{
struct JavaLexerLpgLexStream;
JavaLexerLpgLexStream * lexStream = nullptr;
~JavaLexer(){
delete lexStream;
delete lexParser;
}
inline static ParseTable* prs = new JavaLexerprs();
ParseTable* getParseTable() { return prs; }
LexParser* lexParser = new LexParser();
LexParser* getParser() { return lexParser; }
int getToken(int i) { return lexParser->getToken(i); }
int getRhsFirstTokenIndex(int i) { return lexParser->getFirstToken(i); }
int getRhsLastTokenIndex(int i) { return lexParser->getLastToken(i); }
int getLeftSpan() { return lexParser->getToken(1); }
int getRightSpan() { return lexParser->getLastToken(); }
void resetKeywordLexer()
{
if (kwLexer == nullptr)
this->kwLexer = new JavaKWLexer(lexStream->getInputChars(), JavaParsersym::TK_IDENTIFIER);
else this->kwLexer->setInput(lexStream->getInputChars());
}
void reset(const std::wstring& filename, int tab)
{
delete lexStream;
lexStream = new JavaLexerLpgLexStream(filename, tab);
lexParser->reset((ILexStream*) lexStream, prs, this);
resetKeywordLexer();
}
void reset(shared_ptr_wstring input_chars, const std::wstring& filename)
{
reset(input_chars, filename, 1);
}
void reset(shared_ptr_wstring input_chars, const std::wstring& filename, int tab)
{
delete lexStream;
lexStream = new JavaLexerLpgLexStream(input_chars, filename, tab);
lexParser->reset((ILexStream*) lexStream, prs, this);
resetKeywordLexer();
}
JavaLexer(const std::wstring& filename, int tab)
{
reset(filename, tab);
}
JavaLexer(shared_ptr_wstring input_chars, const std::wstring& filename, int tab)
{
reset(input_chars, filename, tab);
}
JavaLexer(shared_ptr_wstring input_chars, const std::wstring& filename)
{
reset(input_chars, filename, 1);
}
JavaLexer() {}
ILexStream* getILexStream() { return lexStream; }
/**
* @deprecated replaced by {@link #getILexStream()}
*/
ILexStream* getLexStream() { return lexStream; }
void initializeLexer(IPrsStream *prsStream, int start_offset, int end_offset)
{
if (!lexStream->getInputChars())
throw std::exception("LexStream was not initialized");
lexStream->setPrsStream(prsStream);
prsStream->makeToken(start_offset, end_offset, 0); // Token list must start with a bad token
}
void addEOF(IPrsStream *prsStream, int end_offset)
{
prsStream->makeToken(end_offset, end_offset, JavaParsersym::TK_EOF_TOKEN); // and end with the end of file token
prsStream->setStreamLength(prsStream->getSize());
}
void lexer(IPrsStream *prsStream)
{
lexer(nullptr, prsStream);
}
void lexer(Monitor *monitor, IPrsStream *prsStream)
{
initializeLexer(prsStream, 0, -1);
lexParser->parseCharacters(monitor); // Lex the input characters
addEOF(prsStream, lexStream->getStreamIndex());
}
void lexer(IPrsStream *prsStream, int start_offset, int end_offset)
{
lexer(nullptr, prsStream, start_offset, end_offset);
}
void lexer(Monitor* monitor, IPrsStream *prsStream, int start_offset, int end_offset)
{
if (start_offset <= 1)
initializeLexer(prsStream, 0, -1);
else initializeLexer(prsStream, start_offset - 1, start_offset - 1);
lexParser->parseCharacters(monitor, start_offset, end_offset);
addEOF(prsStream, (end_offset >= lexStream->getStreamIndex() ? lexStream->getStreamIndex() : end_offset + 1));
}
IPrsStream::Range *incrementalLexer(shared_ptr_wstring input_chars, int start_change_offset, int end_change_offset) {
int offset_adjustment = input_chars.size() - lexStream->getStreamLength();
//*System.out.println("The offset adjustment is " + offset_adjustment);
if (start_change_offset <= 0 && start_change_offset < input_chars.size())
{
std::string str = "The start offset ";
std::stringex format;
format.format("%d", (start_change_offset));
str += format;
str += " is out of bounds for range 0..";
format.format("%d", (input_chars.size() - 1));
str += format;
throw std::out_of_range(str);
}
if (end_change_offset <= 0 && end_change_offset < input_chars.size())
{
std::string str = "The end offset ";
std::stringex format;
format.format("%d", (end_change_offset));
str += format;
str += " is out of bounds for range 0..";
format.format("%d", (input_chars.size() - 1));
str += format;
}
//
// Get the potential list of tokens to be rescanned
//
Tuple<IToken*> affected_tokens = lexStream->getIPrsStream()->incrementalResetAtCharacterOffset(start_change_offset);
//
// If the change occured between the first two affected tokens (or adjunct) and not immediately
// on the characted after the first token (or adjunct), restart the scanning after the first
// affected token. Otherwise, rescan the first token.
//
int affected_index = 0;
int repair_offset = start_change_offset;
if (affected_tokens.size() > 0) {
auto _token_0 = affected_tokens.get(0);
if (_token_0->getEndOffset() + 1 < start_change_offset)
{
repair_offset = _token_0->getEndOffset() + 1;
if (dynamic_cast<Token*>(_token_0))
{
lexStream->getIPrsStream()->makeToken(_token_0, 0);
}
else {
lexStream->getIPrsStream()->makeAdjunct(_token_0, 0);
}
affected_index++;
}
else
{
repair_offset = _token_0->getStartOffset();
}
}
lexStream->setInputChars(input_chars);
lexStream->setStreamLength(input_chars.size());
lexStream->computeLineOffsets(repair_offset);
int first_new_token_index = lexStream->getIPrsStream()->getTokens().size(),
first_new_adjunct_index = lexStream->getIPrsStream()->getAdjuncts().size();
resetKeywordLexer();
lexParser->resetTokenStream(repair_offset);
int next_offset;
do {
//*System.out.println("Scanning token starting at " + (lexStream->peek() - 1));
next_offset = lexParser->incrementalParseCharacters();
//*System.out.print("***Remaining string: \"");
//*for (int i = next_offset; i < input_chars.length; i++)
//*System.out.print(input_chars[i]);
//*System.out.println("\"");
while (affected_index < affected_tokens.size() &&
affected_tokens.get(affected_index)->getStartOffset() + offset_adjustment < next_offset)
//*{
//*System.out.println("---Skipping token " + affected_index + ": \"" + affected_tokens.get(affected_index).toString() +
//*"\" starting at adjusted offset " + (affected_tokens.get(affected_index).getStartOffset() + offset_adjustment));
affected_index++;
//*}
} while(next_offset <= end_change_offset && // still in the damage region and ...
(affected_index < affected_tokens.size() && // not resynchronized with a token in the list of affected tokens
affected_tokens.get(affected_index)->getStartOffset() + offset_adjustment != next_offset));
//
// If any new tokens were added, compute the first and the last one.
//
IToken* first_new_token = nullptr;
IToken* last_new_token = nullptr;
if (first_new_token_index < lexStream->getIPrsStream()->getTokens().size()) {
first_new_token = lexStream->getIPrsStream()->getTokenAt(first_new_token_index);
last_new_token = lexStream->getIPrsStream()->getTokenAt(lexStream->getIPrsStream()->getTokens().size() - 1);
}
//
// If an adjunct was added prior to the first real token, chose it instead as the first token.
// Similarly, if adjucts were added after the last token, chose the last adjunct added as the last token.
//
if (first_new_adjunct_index < lexStream->getIPrsStream()->getAdjuncts().size()) {
if (first_new_token == nullptr ||
lexStream->getIPrsStream()->getAdjunctAt(first_new_adjunct_index)->getStartOffset() <
first_new_token->getStartOffset()) {
first_new_token = lexStream->getIPrsStream()->getAdjunctAt(first_new_adjunct_index);
}
if (last_new_token == nullptr ||
lexStream->getIPrsStream()->getAdjunctAt(lexStream->getIPrsStream()->getAdjuncts().size() - 1)->getEndOffset() >
last_new_token->getEndOffset()) {
last_new_token = lexStream->getIPrsStream()->getAdjunctAt(lexStream->getIPrsStream()->getAdjuncts().size() - 1);
}
}
//
// For all remainng tokens (and adjuncts) in the list of affected tokens add them to the
// list of tokens (and adjuncts).
//
for (int i = affected_index; i < affected_tokens.size(); i++) {
if ( dynamic_cast< Token*>(affected_tokens.get(i)) )
lexStream->getIPrsStream()->makeToken(affected_tokens.get(i), offset_adjustment);
else lexStream->getIPrsStream()->makeAdjunct(affected_tokens.get(i), offset_adjustment);
//*System.out.println("+++Added affected token " + i + ": \"" + affected_tokens.get(i).toString() +
//*"\" starting at adjusted offset " + (affected_tokens.get(i).getStartOffset() + offset_adjustment));
}
return new IPrsStream::Range(lexStream->getIPrsStream(), first_new_token, last_new_token);
}
/**
* If a parse stream was not passed to this Lexical analyser then we
* simply report a lexical error. Otherwise, we produce a bad token.
*/
void reportLexicalError(int startLoc, int endLoc) {
IPrsStream* prs_stream = lexStream->getIPrsStream();
if (prs_stream == nullptr)
lexStream->reportLexicalError(startLoc, endLoc);
else {
//
// Remove any token that may have been processed that fall in the
// range of the lexical error... then add one error token that spans
// the error range.
//
for (int i = prs_stream->getSize() - 1; i > 0; i--) {
if (prs_stream->getStartOffset(i) >= startLoc)
prs_stream->removeLastToken();
else break;
}
prs_stream->makeToken(startLoc, endLoc, 0); // add an error token to the prsStream
}
}
//#line 5 "LexerBasicMapF.gi
//
// The Lexer contains an array of characters as the input stream to be parsed.
// There are methods to retrieve and classify characters.
// The lexparser "token" is implemented simply as the index of the next character in the array.
// The Lexer extends the abstract class LpgLexStream with an implementation of the abstract
// method getKind. The template defines the Lexer class and the lexer() method.
// A driver creates the action class, "Lexer", passing an Option object to the constructor.
//
JavaKWLexer *kwLexer= nullptr;
bool printTokens =false;
static const int ECLIPSE_TAB_VALUE = 4;
int* getKeywordKinds() { return kwLexer->getKeywordKinds(); }
/**
* @deprecated function replaced by {@link #reset(char [] content, const std::wstring& filename)}
*/
void initialize(shared_ptr_wstring content, const std::wstring& filename)
{
reset(content, filename);
}
void makeToken(int left_token, int right_token, int kind)
{
lexStream->makeToken(left_token, right_token, kind);
}
void makeToken(int kind)
{
int startOffset = getLeftSpan(),
endOffset = getRightSpan();
lexStream->makeToken(startOffset, endOffset, kind);
if (printTokens) printValue(startOffset, endOffset);
}
void makeComment(int kind)
{
int startOffset = getLeftSpan(),
endOffset = getRightSpan();
lexStream->getIPrsStream()->makeAdjunct(startOffset, endOffset, kind);
}
void skipToken()
{
if (printTokens) printValue(getLeftSpan(), getRightSpan());
}
void checkForKeyWord()
{
int startOffset = getLeftSpan(),
endOffset = getRightSpan(),
kwKind = kwLexer->lexer(startOffset, endOffset);
lexStream->makeToken(startOffset, endOffset, kwKind);
if (printTokens) printValue(startOffset, endOffset);
}
//
// This flavor of checkForKeyWord is necessary when the default kind
// (which is returned when the keyword filter doesn't match) is something
// other than _IDENTIFIER.
//
void checkForKeyWord(int defaultKind)
{
int startOffset = getLeftSpan(),
endOffset = getRightSpan(),
kwKind = kwLexer->lexer(startOffset, endOffset);
if (kwKind == JavaParsersym::TK_IDENTIFIER)
kwKind = defaultKind;
lexStream->makeToken(startOffset, endOffset, kwKind);
if (printTokens) printValue(startOffset, endOffset);
}
void printValue(int startOffset, int endOffset)
{
auto input = lexStream->getInputChars().data();
std::wstring s(input + startOffset,input + startOffset+ endOffset - startOffset + 1);
std::wcout << (s) << std::endl ;
}
//
//
//
struct JavaLexerLpgLexStream :public LpgLexStream
{
inline static int tokenKind[] =
{
JavaLexersym::Char_CtlCharNotWS, // 000 0x00
JavaLexersym::Char_CtlCharNotWS, // 001 0x01
JavaLexersym::Char_CtlCharNotWS, // 002 0x02
JavaLexersym::Char_CtlCharNotWS, // 003 0x03
JavaLexersym::Char_CtlCharNotWS, // 004 0x04
JavaLexersym::Char_CtlCharNotWS, // 005 0x05
JavaLexersym::Char_CtlCharNotWS, // 006 0x06
JavaLexersym::Char_CtlCharNotWS, // 007 0x07
JavaLexersym::Char_CtlCharNotWS, // 008 0x08
JavaLexersym::Char_HT, // 009 0x09
JavaLexersym::Char_LF, // 010 0x0A
JavaLexersym::Char_CtlCharNotWS, // 011 0x0B
JavaLexersym::Char_FF, // 012 0x0C
JavaLexersym::Char_CR, // 013 0x0D
JavaLexersym::Char_CtlCharNotWS, // 014 0x0E
JavaLexersym::Char_CtlCharNotWS, // 015 0x0F
JavaLexersym::Char_CtlCharNotWS, // 016 0x10
JavaLexersym::Char_CtlCharNotWS, // 017 0x11
JavaLexersym::Char_CtlCharNotWS, // 018 0x12
JavaLexersym::Char_CtlCharNotWS, // 019 0x13
JavaLexersym::Char_CtlCharNotWS, // 020 0x14
JavaLexersym::Char_CtlCharNotWS, // 021 0x15
JavaLexersym::Char_CtlCharNotWS, // 022 0x16
JavaLexersym::Char_CtlCharNotWS, // 023 0x17
JavaLexersym::Char_CtlCharNotWS, // 024 0x18
JavaLexersym::Char_CtlCharNotWS, // 025 0x19
JavaLexersym::Char_CtlCharNotWS, // 026 0x1A
JavaLexersym::Char_CtlCharNotWS, // 027 0x1B
JavaLexersym::Char_CtlCharNotWS, // 028 0x1C
JavaLexersym::Char_CtlCharNotWS, // 029 0x1D
JavaLexersym::Char_CtlCharNotWS, // 030 0x1E
JavaLexersym::Char_CtlCharNotWS, // 031 0x1F
JavaLexersym::Char_Space, // 032 0x20
JavaLexersym::Char_Exclamation, // 033 0x21
JavaLexersym::Char_DoubleQuote, // 034 0x22
JavaLexersym::Char_Sharp, // 035 0x23
JavaLexersym::Char_DollarSign, // 036 0x24
JavaLexersym::Char_Percent, // 037 0x25
JavaLexersym::Char_Ampersand, // 038 0x26
JavaLexersym::Char_SingleQuote, // 039 0x27
JavaLexersym::Char_LeftParen, // 040 0x28
JavaLexersym::Char_RightParen, // 041 0x29
JavaLexersym::Char_Star, // 042 0x2A
JavaLexersym::Char_Plus, // 043 0x2B
JavaLexersym::Char_Comma, // 044 0x2C
JavaLexersym::Char_Minus, // 045 0x2D
JavaLexersym::Char_Dot, // 046 0x2E
JavaLexersym::Char_Slash, // 047 0x2F
JavaLexersym::Char_0, // 048 0x30
JavaLexersym::Char_1, // 049 0x31
JavaLexersym::Char_2, // 050 0x32
JavaLexersym::Char_3, // 051 0x33
JavaLexersym::Char_4, // 052 0x34
JavaLexersym::Char_5, // 053 0x35
JavaLexersym::Char_6, // 054 0x36
JavaLexersym::Char_7, // 055 0x37
JavaLexersym::Char_8, // 056 0x38
JavaLexersym::Char_9, // 057 0x39
JavaLexersym::Char_Colon, // 058 0x3A
JavaLexersym::Char_SemiColon, // 059 0x3B
JavaLexersym::Char_LessThan, // 060 0x3C
JavaLexersym::Char_Equal, // 061 0x3D
JavaLexersym::Char_GreaterThan, // 062 0x3E
JavaLexersym::Char_QuestionMark, // 063 0x3F
JavaLexersym::Char_AtSign, // 064 0x40
JavaLexersym::Char_A, // 065 0x41
JavaLexersym::Char_B, // 066 0x42
JavaLexersym::Char_C, // 067 0x43
JavaLexersym::Char_D, // 068 0x44
JavaLexersym::Char_E, // 069 0x45
JavaLexersym::Char_F, // 070 0x46
JavaLexersym::Char_G, // 071 0x47
JavaLexersym::Char_H, // 072 0x48
JavaLexersym::Char_I, // 073 0x49
JavaLexersym::Char_J, // 074 0x4A
JavaLexersym::Char_K, // 075 0x4B
JavaLexersym::Char_L, // 076 0x4C
JavaLexersym::Char_M, // 077 0x4D
JavaLexersym::Char_N, // 078 0x4E
JavaLexersym::Char_O, // 079 0x4F
JavaLexersym::Char_P, // 080 0x50
JavaLexersym::Char_Q, // 081 0x51
JavaLexersym::Char_R, // 082 0x52
JavaLexersym::Char_S, // 083 0x53
JavaLexersym::Char_T, // 084 0x54
JavaLexersym::Char_U, // 085 0x55
JavaLexersym::Char_V, // 086 0x56
JavaLexersym::Char_W, // 087 0x57
JavaLexersym::Char_X, // 088 0x58
JavaLexersym::Char_Y, // 089 0x59
JavaLexersym::Char_Z, // 090 0x5A
JavaLexersym::Char_LeftBracket, // 091 0x5B
JavaLexersym::Char_BackSlash, // 092 0x5C
JavaLexersym::Char_RightBracket, // 093 0x5D
JavaLexersym::Char_Caret, // 094 0x5E
JavaLexersym::Char__, // 095 0x5F
JavaLexersym::Char_BackQuote, // 096 0x60
JavaLexersym::Char_a, // 097 0x61
JavaLexersym::Char_b, // 098 0x62
JavaLexersym::Char_c, // 099 0x63
JavaLexersym::Char_d, // 100 0x64
JavaLexersym::Char_e, // 101 0x65
JavaLexersym::Char_f, // 102 0x66
JavaLexersym::Char_g, // 103 0x67
JavaLexersym::Char_h, // 104 0x68
JavaLexersym::Char_i, // 105 0x69
JavaLexersym::Char_j, // 106 0x6A
JavaLexersym::Char_k, // 107 0x6B
JavaLexersym::Char_l, // 108 0x6C
JavaLexersym::Char_m, // 109 0x6D
JavaLexersym::Char_n, // 110 0x6E
JavaLexersym::Char_o, // 111 0x6F
JavaLexersym::Char_p, // 112 0x70
JavaLexersym::Char_q, // 113 0x71
JavaLexersym::Char_r, // 114 0x72
JavaLexersym::Char_s, // 115 0x73
JavaLexersym::Char_t, // 116 0x74
JavaLexersym::Char_u, // 117 0x75
JavaLexersym::Char_v, // 118 0x76
JavaLexersym::Char_w, // 119 0x77
JavaLexersym::Char_x, // 120 0x78
JavaLexersym::Char_y, // 121 0x79
JavaLexersym::Char_z, // 122 0x7A
JavaLexersym::Char_LeftBrace, // 123 0x7B
JavaLexersym::Char_VerticalBar, // 124 0x7C
JavaLexersym::Char_RightBrace, // 125 0x7D
JavaLexersym::Char_Tilde, // 126 0x7E
JavaLexersym::Char_AfterASCII, // for all chars in range 128..65534
JavaLexersym::Char_EOF // for '\uffff' or 65535
};
int getKind(int i) // Classify character at ith location
{
int c = (i >= getStreamLength() ? 0xffff : getCharValue(i));
return (c < 128 // ASCII Character
? tokenKind[c]
: c == 0xffff
? JavaLexersym::Char_EOF
: JavaLexersym::Char_AfterASCII);
}
std::vector<std::wstring> orderedExportedSymbols() { return JavaParsersym::orderedTerminalSymbols; }
JavaLexerLpgLexStream(const std::wstring& filename, int tab):LpgLexStream(filename, tab)
{
}
JavaLexerLpgLexStream(shared_ptr_wstring input_chars, const std::wstring& filename, int tab):LpgLexStream(input_chars, filename, tab)
{
}
JavaLexerLpgLexStream(shared_ptr_wstring input_chars, const std::wstring& filename):LpgLexStream(input_chars, filename, 1)
{
}
};
//#line 412 "LexerTemplateF.gi
void ruleAction(int ruleNumber)
{
switch(ruleNumber)
{
//
// Rule 1: Token ::= Identifier
//
case 1: {
checkForKeyWord();
break;
}
//
// Rule 2: Token ::= " SLBody "
//
case 2: {
makeToken(JavaParsersym::TK_StringLiteral);
break;
}
//
// Rule 3: Token ::= ' NotSQ '
//
case 3: {
makeToken(JavaParsersym::TK_CharacterLiteral);
break;
}
//
// Rule 4: Token ::= IntegerLiteral
//
case 4: {
makeToken(JavaParsersym::TK_IntegerLiteral);
break;
}
//
// Rule 5: Token ::= FloatingPointLiteral
//
case 5: {
makeToken(JavaParsersym::TK_FloatingPointLiteral);
break;
}
//
// Rule 6: Token ::= DoubleLiteral
//
case 6: {
makeToken(JavaParsersym::TK_DoubleLiteral);
break;
}
//
// Rule 7: Token ::= / * Inside Stars /
//
case 7: {
skipToken();
break;
}
//
// Rule 8: Token ::= SLC
//
case 8: {
skipToken();
break;
}
//
// Rule 9: Token ::= WS
//
case 9: {
skipToken();
break;
}
//
// Rule 10: Token ::= +
//
case 10: {
makeToken(JavaParsersym::TK_PLUS);
break;
}
//
// Rule 11: Token ::= -
//
case 11: {
makeToken(JavaParsersym::TK_MINUS);
break;
}
//
// Rule 12: Token ::= *
//
case 12: {
makeToken(JavaParsersym::TK_MULTIPLY);
break;
}
//
// Rule 13: Token ::= /
//
case 13: {
makeToken(JavaParsersym::TK_DIVIDE);
break;
}
//
// Rule 14: Token ::= (
//
case 14: {
makeToken(JavaParsersym::TK_LPAREN);
break;
}
//
// Rule 15: Token ::= )
//
case 15: {
makeToken(JavaParsersym::TK_RPAREN);
break;
}
//
// Rule 16: Token ::= =
//
case 16: {
makeToken(JavaParsersym::TK_EQUAL);
break;
}
//
// Rule 17: Token ::= ,
//
case 17: {
makeToken(JavaParsersym::TK_COMMA);
break;
}
//
// Rule 18: Token ::= :
//
case 18: {
makeToken(JavaParsersym::TK_COLON);
break;
}
//
// Rule 19: Token ::= ;
//
case 19: {
makeToken(JavaParsersym::TK_SEMICOLON);
break;
}
//
// Rule 20: Token ::= ^
//
case 20: {
makeToken(JavaParsersym::TK_XOR);
break;
}
//
// Rule 21: Token ::= %
//
case 21: {
makeToken(JavaParsersym::TK_REMAINDER);
break;
}
//
// Rule 22: Token ::= ~
//
case 22: {
makeToken(JavaParsersym::TK_TWIDDLE);
break;
}
//
// Rule 23: Token ::= |
//
case 23: {
makeToken(JavaParsersym::TK_OR);
break;
}
//
// Rule 24: Token ::= &
//
case 24: {
makeToken(JavaParsersym::TK_AND);
break;
}
//
// Rule 25: Token ::= <
//
case 25: {
makeToken(JavaParsersym::TK_LESS);
break;
}
//
// Rule 26: Token ::= >
//
case 26: {
makeToken(JavaParsersym::TK_GREATER);
break;
}
//
// Rule 27: Token ::= .
//
case 27: {
makeToken(JavaParsersym::TK_DOT);
break;
}
//
// Rule 28: Token ::= !
//
case 28: {
makeToken(JavaParsersym::TK_NOT);
break;
}
//
// Rule 29: Token ::= [
//
case 29: {
makeToken(JavaParsersym::TK_LBRACKET);
break;
}
//
// Rule 30: Token ::= ]
//
case 30: {
makeToken(JavaParsersym::TK_RBRACKET);
break;
}
//
// Rule 31: Token ::= {
//
case 31: {
makeToken(JavaParsersym::TK_LBRACE);
break;
}
//
// Rule 32: Token ::= }
//
case 32: {
makeToken(JavaParsersym::TK_RBRACE);
break;
}
//
// Rule 33: Token ::= ?
//
case 33: {
makeToken(JavaParsersym::TK_QUESTION);
break;
}
//
// Rule 34: Token ::= @
//
case 34: {
makeToken(JavaParsersym::TK_AT);
break;
}
//
// Rule 35: Token ::= + +
//
case 35: {
makeToken(JavaParsersym::TK_PLUS_PLUS);
break;
}
//
// Rule 36: Token ::= - -
//
case 36: {
makeToken(JavaParsersym::TK_MINUS_MINUS);
break;
}
//
// Rule 37: Token ::= = =
//
case 37: {
makeToken(JavaParsersym::TK_EQUAL_EQUAL);
break;
}
//
// Rule 38: Token ::= < =
//
case 38: {
makeToken(JavaParsersym::TK_LESS_EQUAL);
break;
}
//
// Rule 39: Token ::= ! =
//
case 39: {
makeToken(JavaParsersym::TK_NOT_EQUAL);
break;
}
//
// Rule 40: Token ::= < <
//
case 40: {
makeToken(JavaParsersym::TK_LEFT_SHIFT);
break;
}
//
// Rule 41: Token ::= + =
//
case 41: {
makeToken(JavaParsersym::TK_PLUS_EQUAL);
break;
}
//
// Rule 42: Token ::= - =
//
case 42: {
makeToken(JavaParsersym::TK_MINUS_EQUAL);
break;
}
//
// Rule 43: Token ::= * =
//
case 43: {
makeToken(JavaParsersym::TK_MULTIPLY_EQUAL);
break;
}
//
// Rule 44: Token ::= / =
//
case 44: {
makeToken(JavaParsersym::TK_DIVIDE_EQUAL);
break;
}
//
// Rule 45: Token ::= & =
//
case 45: {
makeToken(JavaParsersym::TK_AND_EQUAL);
break;
}
//
// Rule 46: Token ::= | =
//
case 46: {
makeToken(JavaParsersym::TK_OR_EQUAL);
break;
}
//
// Rule 47: Token ::= ^ =
//
case 47: {
makeToken(JavaParsersym::TK_XOR_EQUAL);
break;
}
//
// Rule 48: Token ::= % =
//
case 48: {
makeToken(JavaParsersym::TK_REMAINDER_EQUAL);
break;
}
//
// Rule 49: Token ::= < < =
//
case 49: {
makeToken(JavaParsersym::TK_LEFT_SHIFT_EQUAL);
break;
}
//
// Rule 50: Token ::= | |
//
case 50: {
makeToken(JavaParsersym::TK_OR_OR);
break;
}
//
// Rule 51: Token ::= & &
//
case 51: {
makeToken(JavaParsersym::TK_AND_AND);
break;
}
//
// Rule 52: Token ::= . . .
//
case 52: {
makeToken(JavaParsersym::TK_ELLIPSIS);
break;
}
//#line 416 "LexerTemplateF.gi
default:
break;
}
return;
}
};