-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLexer.cpp
648 lines (559 loc) · 15.1 KB
/
Lexer.cpp
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
#include "Lexer.h"
#include "Parser.h"
#include "Source.h"
using namespace Jet;
std::map<TokenType, std::string> Jet::TokenToString;
class LexerStatic
{
public:
std::map<std::string, TokenType> operators;
std::map<std::string, TokenType> keywords;
std::map<char, std::vector<std::pair<std::string, TokenType>>> operatorsearch;
LexerStatic()
{
//math and assignment
operators["="] = TokenType::Assign;
operators["+"] = TokenType::Plus;
operators["-"] = TokenType::Minus;
operators["*"] = TokenType::Asterisk;
operators["/"] = TokenType::Slash;
operators["%"] = TokenType::Modulo;
operators["&&"] = TokenType::And;
operators["||"] = TokenType::Or;
operators["!"] = TokenType::Not;
operators["|"] = TokenType::BOr;//or
operators["&"] = TokenType::BAnd;//and
operators["^"] = TokenType::Xor;//xor
operators["~"] = TokenType::BNot;//binary not
operators["<<"] = TokenType::LeftShift;
operators[">>"] = TokenType::RightShift;
//grouping
operators["("] = TokenType::LeftParen;
operators[")"] = TokenType::RightParen;
operators["{"] = TokenType::LeftBrace;
operators["}"] = TokenType::RightBrace;
//array stuff
operators["["] = TokenType::LeftBracket;
operators["]"] = TokenType::RightBracket;
//operators["[]"] = TokenType::DoubleBracket;
//object stuff
operators["."] = TokenType::Dot;
operators[":"] = TokenType::Colon;
operators[";"] = TokenType::Semicolon;
operators[","] = TokenType::Comma;
operators["::"] = TokenType::Scope;
operators["++"] = TokenType::Increment;
operators["--"] = TokenType::Decrement;
//operator + equals sign
operators["+="] = TokenType::AddAssign;
operators["-="] = TokenType::SubtractAssign;
operators["*="] = TokenType::MultiplyAssign;
operators["/="] = TokenType::DivideAssign;
operators["&="] = TokenType::AndAssign;
operators["|="] = TokenType::OrAssign;
operators["^="] = TokenType::XorAssign;
//boolean logic
operators["!="] = TokenType::NotEqual;
operators["=="] = TokenType::Equals;
//comparisons
operators["<"] = TokenType::LessThan;
operators[">"] = TokenType::GreaterThan;
operators["<="] = TokenType::LessThanEqual;
operators[">="] = TokenType::GreaterThanEqual;
//special stuff
operators["<>"] = TokenType::Swap;
operators["\""] = TokenType::String;
operators["..."] = TokenType::Ellipses;
//comments
operators["//"] = TokenType::LineComment;
operators["-[["] = TokenType::BlockString;
//operators["]]-"] = TokenType::CommentEnd;
operators["/*"] = TokenType::CommentBegin;
operators["*/"] = TokenType::CommentEnd;
//dereference member
operators["->"] = TokenType::Pointy;
operators["!<"] = TokenType::TemplateBegin;
//keywords
keywords["while"] = TokenType::While;
keywords["if"] = TokenType::If;
keywords["elseif"] = TokenType::ElseIf;
keywords["else"] = TokenType::Else;
keywords["fun"] = TokenType::Function;
keywords["virtual"] = TokenType::Virtual;
keywords["return"] = TokenType::Ret;
keywords["for"] = TokenType::For;
keywords["let"] = TokenType::Let;
keywords["break"] = TokenType::Break;
keywords["continue"] = TokenType::Continue;
keywords["null"] = TokenType::Null;
keywords["yield"] = TokenType::Yield;
keywords["generator"] = TokenType::Generator;
keywords["resume"] = TokenType::Resume;
keywords["match"] = TokenType::Match;
keywords["switch"] = TokenType::Switch;
keywords["case"] = TokenType::Case;
keywords["default"] = TokenType::Default;
keywords["trait"] = TokenType::Trait;
keywords["union"] = TokenType::Union;
keywords["extern"] = TokenType::Extern;
keywords["struct"] = TokenType::Struct;
keywords["class"] = TokenType::Class;
keywords["namespace"] = TokenType::Namespace;
keywords["enum"] = TokenType::Enum;
//internal "functions"
keywords["sizeof"] = TokenType::SizeOf;
keywords["offsetof"] = TokenType::OffsetOf;
keywords["typeof"] = TokenType::TypeOf;
keywords["new"] = TokenType::New;
keywords["free"] = TokenType::Free;
keywords["typedef"] = TokenType::Typedef;
operators["#if"] = TokenType::IfMacro;
operators["#else"] = TokenType::ElseMacro;
operators["#elseif"] = TokenType::ElseIfMacro;
operators["#endif"] = TokenType::EndIfMacro;
operators["//!@!"] = TokenType::LocationMacro;
//keywords["const"] = TokenType::Const;
//keywords["operator"] = TokenType::Operator;
for (auto ii = operators.begin(); ii != operators.end(); ii++)
{
TokenToString[ii->second] = ii->first;
//build search structure
auto t = operatorsearch.find(ii->first[0]);
if (t != operatorsearch.end())
{
t->second.push_back(std::pair<std::string, TokenType>(ii->first, ii->second));
}
else
{
operatorsearch[ii->first[0]] = std::vector<std::pair<std::string, TokenType>>();
operatorsearch[ii->first[0]].push_back(std::pair<std::string, TokenType>(ii->first, ii->second));
}
}
for (auto ii : keywords)
TokenToString[ii.second] = ii.first;
TokenToString[TokenType::Name] = "name";
}
};
bool Jet::IsLetter(char c)
{
return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '_';
}
bool Jet::IsNumber(char c)
{
return (c >= '0' && c <= '9');
}
Lexer::Lexer(Source* source, DiagnosticBuilder* diag, const std::map<std::string, bool>& defines)
{
this->diag = diag;
this->last_index = 0;
this->src = source;
this->defines = defines;
}
//can move to functions at some point
void ParseKeyword(const std::string& string)
{
}
Token Lexer::Next()
{
static LexerStatic ls;
while (src->IsAtEnd() == false)
{
int trivia_length = src->GetIndex() - this->last_index;
const char* t_ptr = src->GetSubstring(src->GetIndex(), 0);
int column = src->column;
char c = src->ConsumeChar();
std::string str;
str += c;
bool found = false; unsigned int len = 0;
TokenType toktype;
auto iter = ls.operatorsearch.find(str[0]);
if (iter != ls.operatorsearch.end())
{
for (auto ii : iter->second)
{
if (ii.first.length() > src->Remaining())
continue;
//pick the longest matching operator/keyword
if (ii.first.length() <= len)
continue;
//check if the characters match the operator/keyword
if (src->IsOperator(ii.first))
{
len = ii.first.length();
str = ii.first;
toktype = ii.second;
found = true;
}
}
}
else
{
found = false;
}
if (found)
{
for (unsigned int i = 0; i < len - 1; i++)
src->ConsumeChar();
//remove these use of operators
if (toktype == TokenType::LineComment)
{
//go to next line
char c = src->ConsumeChar();
while (c != '\n' && c != 0)
{
c = src->ConsumeChar();
}
if (c == 0)
break;
continue;
}
else if (toktype == TokenType::CommentBegin)
{
int startline = src->linenumber;
while (true)
{
char c = src->ConsumeChar();
if (c == '*' && src->PeekChar() == '/')
{
src->ConsumeChar();
break;
}
else if (c == 0)
{
diag->Error("Missing end to comment block starting at line " + std::to_string(startline), Token(t_ptr, 0, src->linenumber, column, TokenType::String, ""));
throw 7;
}
}
continue;
}
else if (toktype == TokenType::String)
{
std::string txt;
//int start = index;
while (src->IsAtEnd() == false)
{
char p = src->PeekChar();
if (p == '\\')
{
src->ConsumeChar();
//handle escape sequences
char c = src->ConsumeChar();
switch (c)
{
case 'n':
txt.push_back('\n');
break;
case 'b':
txt.push_back('\b');
break;
case 't':
txt.push_back('\t');
break;
case '\\':
txt.push_back('\\');
break;
case '"':
txt.push_back('"');
break;
case '0':
txt.push_back(0);
break;
default:
std::string ch;
ch += c;
diag->Error("Invalid Escape Sequence '\\" + ch/*text.substr(index - 1, 1)*/ + "'", Token(t_ptr, 0, src->linenumber, src->column - 2, TokenType::String, std::string("\\") + ch));
throw 7;
}
}
else if (p == '"')
{
src->ConsumeChar();
break;
}
else
{
txt.push_back(src->ConsumeChar());
}
}
this->last_index = src->GetIndex();
return Token(t_ptr, trivia_length, src->linenumber, column, toktype, txt);
}
else if (toktype == TokenType::BlockString)
{
diag->Error("Block Strings Not Implemented", Token(t_ptr, 0, src->linenumber, column, TokenType::String, ""));
throw 7;
/*std::string txt;
int start = index;
while (src->IsAtEnd() == false)//index < text.length())
{
if (text[index] == '\\')
{
//handle escape sequences
char c = text[index + 1];
switch (c)
{
case 'n':
txt.push_back('\n');
break;
case 'b':
txt.push_back('\b');
break;
case 't':
txt.push_back('\t');
break;
case '\\':
txt.push_back('\\');
break;
case '"':
txt.push_back('"');
break;
default:
ParserError("Invalid Escape Sequence '\\" + text.substr(index + 1, 1) + "'", Token(src->linenumber, src->column, TokenType::String, ""));
//throw CompilerException(filename, this->linenumber, "Invalid Escape Sequence '\\" + text.substr(index + 1, 1) + "'");
}
index += 2;
}
else if (text[index] == ']' && text[index + 1] == ']' && text[index + 2] == '-')
{
break;
}
else
{
txt.push_back(text[index++]);
}
}
index += 3;
return Token(src->linenumber, src->column, TokenType::String, txt);*/
}
else if (toktype == TokenType::IfMacro)
{
src->ConsumeChar();
std::string condition;
while (true)
{
char c = src->PeekChar();
if (IsLetter(c) || IsNumber(c) || c == '_')
{
condition += c;
src->ConsumeChar();
}
else
break;
}
ifstack.push_back(condition);
bool is_true = true;// this->defines[condition];
if (is_true)
continue;
//read until we find and else or end if
while (true)
{
char c = src->PeekChar();
if (c != '#')
src->ConsumeChar();
else
{
//see if its an else or end if
break;
}
}
continue;
}
else if (toktype == TokenType::ElseMacro)
{
if (ifstack.size() == 0)
{
diag->Error("#else without matching #if", Token());
throw 7;
}
continue;//just parse it for now
}
else if (toktype == TokenType::EndIfMacro)
{
if (ifstack.size() > 0)
ifstack.pop_back();
else
{
diag->Error("#endif without matching #if", Token());
throw 7;
}
continue;
}
else if (toktype == TokenType::LocationMacro)
{
//parse to the end of the line and throw out for now, eventually going to use this to set
//the line number
std::string location;
char c = src->EatChar();
while (c != '\n' && c != 0)
{
location += c;
c = src->EatChar();
}
//extract the line number from the end, start by finding last of @
int index = location.find_last_of('@');
std::string line = location.substr(index+1);
int lnum = std::atoi(line.c_str());
src->SetCurrentLine(lnum);
if (c == 0)
break;
continue;
}
this->last_index = src->GetIndex();
return Token(t_ptr, trivia_length, src->linenumber, column, toktype, str);
}
else if (IsLetter(c) || c == '_')//word
{
std::string name;
name += c;
while (true)
{
char c = src->PeekChar();
if (!(IsLetter(c) || c == '_'))
if (!IsNumber(c))
break;
name += src->ConsumeChar();
}
this->last_index = src->GetIndex();
//check if it is a keyword
auto keyword = ls.keywords.find(name);
if (keyword != ls.keywords.end())//is keyword?
return Token(t_ptr, trivia_length, src->linenumber, column, keyword->second, name);
else//just a variable name
return Token(t_ptr, trivia_length, src->linenumber, column, TokenType::Name, name);
}
else if (IsNumber(c))//number
{
//finish adding different literal types
if (c != '0')
{
std::string num;
num += c;
while (true)
{
char c = src->PeekChar();
if (c == 'f')
{
num += src->ConsumeChar();
break;
}
if (!(c == '.' || IsNumber(c)))
break;
num += src->ConsumeChar();
}
this->last_index = src->GetIndex();
return Token(t_ptr, trivia_length, src->linenumber, column, TokenType::Number, num);
}
else
{
//ok, its possibly some kind of non base ten literal
std::string num;
num += c;
char c = src->PeekChar();
num += c;
switch (c)
{
case 'b':
{
src->ConsumeChar();
while (true)
{
char c = src->PeekChar();
if (!(c == '.' || c == '0' || c == '1'))// IsNumber(c)))
break;
num += src->ConsumeChar();
}
this->last_index = src->GetIndex();
return Token(t_ptr, trivia_length, src->linenumber, column, TokenType::Number, num);
}
case 'x'://hex literal
{
src->ConsumeChar();
while (true)
{
char c = src->PeekChar();
if (!(c == '.' || IsNumber(c) || (c <= 'f' && c >= 'a') || (c <= 'F' && c >= 'A')))
break;
num += src->ConsumeChar();
}
this->last_index = src->GetIndex();
return Token(t_ptr, trivia_length, src->linenumber, column, TokenType::Number, num);
}
default:
{
while (true)
{
char c = src->PeekChar();
if (!(c == '.' || IsNumber(c)))
break;
str += src->ConsumeChar();
}
this->last_index = src->GetIndex();
return Token(t_ptr, trivia_length, src->linenumber, column, TokenType::Number, str);
}
}
}
}
else if (c == '\'')
{
char cc = src->ConsumeChar();
if (cc == '\\')
{
//handle the escape sequence
cc = src->ConsumeChar();
switch (cc)
{
case 'n':
cc = '\n';
break;
case 'b':
cc = '\b';
break;
case 't':
cc = '\t';
break;
case '\\':
cc = '\\';
break;
case '\'':
cc = '\'';
break;
default:
{
std::string ch;
ch += cc;
diag->Error("Invalid Escape Sequence '\\" + ch/*text.substr(index - 1, 1)*/ + "'", Token(t_ptr, 0, src->linenumber, src->column - 2, TokenType::String, std::string("\\") + ch));
throw 7;
}
}
}
std::string num = std::to_string((int)cc);
char endc = src->ConsumeChar();
if (endc != '\'')
{
diag->Error("Closing ' expected for character literal.", Token(t_ptr, 0, src->linenumber, column, TokenType::String, ""));
throw 7;
}
this->last_index = src->GetIndex();
return Token(t_ptr, trivia_length, src->linenumber, column, TokenType::Number, num);
}
else
{
//character to ignore like whitespace
if (c == ' ' || c == '\t' || c == '\n' || c == '\r')
continue;
else
{
diag->Error("Unexpected character: '" + str + "'", Token(t_ptr, 0, src->linenumber, column, TokenType::String, ""));
throw 7;
}
}
}
int trivia_length = src->GetIndex() - this->last_index;
this->last_index = src->GetIndex();
if (this->ifstack.size() > 0)
{
diag->Error("#if without matching #endif", Token());
throw 7;
}
return Token(src->GetLinePointer(1) + src->GetLength(), trivia_length, src->linenumber, src->column, TokenType::EoF, "");
}