-
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlexer.cpp
More file actions
executable file
·657 lines (531 loc) · 12.4 KB
/
lexer.cpp
File metadata and controls
executable file
·657 lines (531 loc) · 12.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
#define _CRT_SECURE_NO_WARNINGS
#include "baseparser.h"
//
static const char *_internalTokenLexemes[] =
{
"error",
"EOF",
"integer value",
"float value",
"char value",
"string literal",
"identifier"
};
static_assert(ARRAY_SIZE(_internalTokenLexemes) == (TV_USER - TV_ERROR), "lexeme table mismatch");
//======================================================================
//
//======================================================================
LexicalAnalyzer::LexicalAnalyzer(TokenTable *aTokenTable, BaseParser *pParser, YYSTYPE *pyylval)
{
assert(aTokenTable);
assert(pParser);
assert(pyylval);
m_pParser = pParser;
m_yylval = pyylval;
m_iTotalLinesParsed = 0;
// add tokens to table
for (; aTokenTable->lexeme; aTokenTable++)
m_tokenTable[aTokenTable->lexeme] = aTokenTable->token;
compare_function = strcmp;
m_bCaseSensitive = true;
// setup lexical analysis defaults
m_bUnixComments = false;
m_bCPPComments = false;
m_bCStyleComments = false;
m_bASMComments = false;
m_bHexNumbers = false;
m_bCharLiterals = false;
//m_iCurrentSourceLineIndex = -1;
}
//======================================================================
// Return the next character from the input
//======================================================================
int LexicalAnalyzer::getChar()
{
m_fdStack.back().column++;
// get new line if necessary
// if (m_iCurrentSourceLineIndex == -1)
// fgets(m_szCurrentSourceLineText, sizeof(m_szCurrentSourceLineText), m_fdStack.back().fdDocument);
// if parsing files get next file char
if (m_fdStack.back().fdDocument)
{
return fgetc(m_fdStack.back().fdDocument);
}
// otherwise return data from memory ptr
int c = *m_fdStack.back().pTextData;
m_fdStack.back().pTextData++;
return c;
}
//======================================================================
// Put the character back to the input
//======================================================================
int LexicalAnalyzer::ungetChar(int c)
{
m_fdStack.back().column--;
// if parsing files put back file char
if (m_fdStack.back().fdDocument)
return ungetc(c, m_fdStack.back().fdDocument);
// otherwise put back data to memory ptr
m_fdStack.back().pTextData--;
return 0;
}
//
//
//
void LexicalAnalyzer::yyerror(const char *s)
{
puts(s);
fflush(stdout);
exit(-1);
}
//
//
//
void LexicalAnalyzer::yywarning(const char *s)
{
puts(s);
fflush(stdout);
}
//
//
//
void LexicalAnalyzer::caseSensitive(bool onoff /*= true*/)
{
#ifdef _WIN32
compare_function = (onoff) ? strcmp : _stricmp;
#else
compare_function = (onoff) ? strcmp : strcasecmp;
#endif
m_bCaseSensitive = onoff;
}
//===============================================================
//
//===============================================================
const char *LexicalAnalyzer::getLexemeFromToken(int token)
{
// look for single char tokens
if (token < 256)
return (char*)token;
// look for internal tokens
if (token > 255 && token < TV_USER)
return _internalTokenLexemes[token - 256];
// look for user tokens
auto iter = m_tokenTable.begin();
for (; iter != m_tokenTable.end(); iter++)
{
if (iter->second == token)
return iter->first.c_str();
}
return "(unknown token)";
}
//======================================================================
//
//======================================================================
int LexicalAnalyzer::popFile()
{
// if we were processing a file, close it
if (m_fdStack.back().fdDocument)
{
// fclose(m_fdStack.back().fdDocument);
// m_fdStack.back().fdDocument = nullptr;
m_fdStack.pop_back();
if (m_fdStack.size() == 0)
return EOF;
return 0;
}
// if we were processing in-memory data, release it
freeData(m_fdStack.back().pUserData);
m_fdStack.back().pUserData = nullptr;
// we assume the pTextData is a subset of the pUserData,
// and was freed when the data was freed
m_fdStack.back().pTextData = nullptr;
m_fdStack.pop_back();
if (m_fdStack.size() == 0)
return EOF;
return 0;
}
// this is a no-op meant to be overridden in derived classes
void LexicalAnalyzer::freeData(void *pUserData)
{
if (pUserData)
assert(false);
}
//======================================================================
// Begin processing the given file, pushing the current file onto the
// file descriptor stack.
//======================================================================
int LexicalAnalyzer::pushFile(const char *theFile)
{
assert(theFile);
m_fdStack.push_back(FDNode());
assert(m_fdStack.back().fdDocument == nullptr);
FILE *pFile = fopen(theFile, "rt");
if (nullptr == pFile)
return -1;
m_fdStack.back().fdDocument = pFile;
if (!m_fdStack.back().fdDocument)
return -1;
m_fdStack.back().filename = theFile;
m_fdStack.back().yylineno = 1;
return 0;
}
//======================================================================
//
//======================================================================
int LexicalAnalyzer::setData(char *theData, const char *fileName, void *pUserData)
{
assert(theData);
m_fdStack.push_back(FDNode());
assert(m_fdStack.back().pTextData == nullptr);
m_fdStack.back().pTextData = theData;
if (!m_fdStack.back().pTextData)
return -1;
// hold onto this for later
m_fdStack.back().pUserData = pUserData;
m_fdStack.back().filename = fileName;
m_fdStack.back().yylineno = 1;
return 0;
}
//======================================================================
// valid characters for Identifiers
//======================================================================
bool LexicalAnalyzer::isidval(int c)
{
// removed: c == '.' || c == '!' || c == '&' || ((char)c) == '�'
if (isalnum(c) || c == '_')
return true;
return false;
}
//======================================================================
// characters which are considered to be whitespace
//======================================================================
bool LexicalAnalyzer::iswhitespace(int c)
{
return (c == ' ' || c == '\t' || c == '\n' || c == '\r') ? true : false;
}
// copy until EOF
void LexicalAnalyzer::copyToEOF(FILE *fout)
{
int chr;
assert(fout);
while ((chr = getChar()) != EOF)
{
fputc(chr, fout);
}
}
// copy until char with nesting
void LexicalAnalyzer::copyUntilChar(int endChar, int nestChar, FILE *fout)
{
int chr;
int nestCount = 1;
assert(fout);
do
{
chr = getChar();
if (chr == nestChar)
nestCount++;
if (chr == endChar)
nestCount--;
if (nestCount)
fputc(chr, fout);
} while (nestCount);
// put back the last character
ungetChar(chr);
}
//
void LexicalAnalyzer::copyUntilChar(int endChar, int nestChar, char *buf)
{
int chr;
int nestCount = 1;
assert(buf);
do
{
chr = getChar();
if (chr == nestChar)
nestCount++;
if (chr == endChar)
nestCount--;
if (nestCount)
*buf++ = chr;
} while (nestCount);
// make sure its ASCIIZ
*buf = 0;
// put back the last character
ungetChar(chr);
}
// skip any leading WS
int LexicalAnalyzer::skipLeadingWhiteSpace()
{
int chr;
do
{
chr = getChar();
if (chr == '\n')
{
m_fdStack.back().column = 0;
m_fdStack.back().yylineno++;
m_iTotalLinesParsed++;
}
} while (iswhitespace(chr));
return chr;
}
//
//
//
int LexicalAnalyzer::backslash(int c)
{
static char translation_tab[] = "b\bf\fn\nr\rt\t";
if (c != '\\')
return c;
c = getChar();
if (islower(c) && strchr(translation_tab, c))
return strchr(translation_tab, c)[1];
return c;
}
//
//
//
void LexicalAnalyzer::skipToEOL(void)
{
int c;
// skip to EOL
do {
c = getChar();
} while (c != '\n' && c != EOF);
// put last character back
ungetChar(c);
}
//
//
//
void LexicalAnalyzer::cstyle_comment(void)
{
int c;
// skip to EOL
for (c = getChar(); c != EOF; c = getChar())
{
if (c == '*')
{
if (follow('/', 1, 0))
return;
}
}
}
//
//
//
int LexicalAnalyzer::follow(int expect, int ifyes, int ifno)
{
int chr;
chr = getChar();
if (chr == expect)
return ifyes;
ungetChar(chr);
return ifno;
}
//
//
//
int LexicalAnalyzer::getNumber()
{
int c;
char buf[DEFAULT_NUM_BUF];
char *bufptr = buf;
int base = 10;
// look for hex numbers
c = getChar();
if (c == '0' && (follow('X', 1, 0) || follow('x', 1, 0)))
base = 16;
else if (c == '-' || c == '+')
*bufptr++ = c;
else
ungetChar(c);
if (base == 16)
{
while (isxdigit(c = getChar()))
*bufptr++ = c;
}
else
{
while (isdigit((c = getChar())) || c == '.')
*bufptr++ = c;
}
// need to put back the last character
ungetChar(c);
// make sure string is asciiz
*bufptr = '\0';
// handle floats and ints
if (!strchr(buf, '.'))
{
// m_yylval->ival = strtoul(buf, nullptr, base);
m_yylval->ival = strtol(buf, nullptr, base);
// m_yylval->ival = atol(buf);
return TV_INTVAL;
}
else
{
m_yylval->fval = (float)atof(buf);
return TV_FLOATVAL;
}
}
//
//
//
int LexicalAnalyzer::getCharLiteral()
{
int c;
c = backslash(getChar());
m_yylval->char_val = c;
c = getChar();
if (c != '\'')
yyerror("missing single quote");
return TV_CHARVAL;
}
//
//
//
int LexicalAnalyzer::getStringLiteral()
{
SymbolEntry *sym;
int c;
char buf[DEFAULT_TEXT_BUF];
char *cptr = buf;
c = getChar();
while (c != '"' && cptr < &buf[sizeof(buf)])
{
if (c == '\n' || c == EOF)
yyerror("missing quote");
// build up our string, translating escape chars
*cptr++ = backslash(c);
c = getChar();
}
// make sure its asciiz
*cptr = '\0';
sym = m_pParser->lookupSymbol(buf);
if (!sym)
{
sym = m_pParser->installSymbol(buf, stStringLiteral);
if (!sym)
yyerror("making symbol table entry");
sym->srcLine = getLineNumber();
sym->srcFile = getFile();
}
m_yylval->sym = sym;
return TV_STRING;
}
//
//
//
int LexicalAnalyzer::getKeyword()
{
return 0;
}
//
//
//
int LexicalAnalyzer::specialTokens(int chr)
{
switch (chr)
{
// we reached end of current file, but could be a nested include so pop
// file descriptor stack and try to continue
case 0:
case EOF:
if (popFile() == EOF)
return TV_DONE;
// call ourselves again to get the next token
return yylex();
default:
return chr;
}
}
//======================================================================
// Generic Lexical analyzer routine
//======================================================================
int LexicalAnalyzer::yylex()
{
int chr;
char buf[DEFAULT_TEXT_BUF];
char *pBuf = buf;
SymbolEntry *sym;
yylex01:
// skip any leading WS
chr = skipLeadingWhiteSpace();
// process Unix conf style comments
if (m_bUnixComments && chr == '#')
{
skipToEOL();
goto yylex01;
}
// handle C++ style comments
if (m_bCPPComments && chr == '/')
{
if (follow('/', 1, 0))
{
skipToEOL();
goto yylex01;
}
}
// handle C style comments
if (m_bCStyleComments && chr == '/')
{
if (follow('*', 1, 0))
{
cstyle_comment();
goto yylex01;
}
}
// handle ASM style comments
if (m_bASMComments && chr == ';')
{
skipToEOL();
goto yylex01;
}
// look for a number value
if (isdigit(chr) || chr == '-' || chr == '+')
{
ungetChar(chr);
return getNumber();
}
// look for char literals
if (chr == '\'')
{
return getCharLiteral();
}
// look for string literals
if (chr == '"')
{
return getStringLiteral();
}
// look for keywords or ID
if (isalpha(chr) || chr == '_')
{
// get the token
do
{
*pBuf++ = ((char)chr);
} while ((chr = getChar()) != EOF && isidval(chr));
ungetChar(chr);
// make sure its asciiz
*pBuf = 0;
// search token table for possible match
auto iterTokens = m_tokenTable.find(buf);
if (iterTokens != m_tokenTable.end())
{
return iterTokens->second;
}
// create or return symbol if it is already in symbol table
sym = m_pParser->lookupSymbol(buf);
if (!sym)
{
sym = m_pParser->installSymbol(buf, stUndef);
if (!sym)
yyerror("making symbol table entry");
sym->srcLine = getLineNumber();
sym->srcFile = getFile();
}
m_yylval->sym = sym;
return TV_ID;
}
return specialTokens(chr);
}