-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLexer.cpp
More file actions
458 lines (441 loc) · 11.3 KB
/
Copy pathLexer.cpp
File metadata and controls
458 lines (441 loc) · 11.3 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
#include <string>
#include <vector>
#include <regex>
#include "Lexer.h"
/**
* 词法分析器(Lexer)
*/
/**
* nextToken()方法
*
* */
Token Lexer::nextToken()
{
// state = State::START;
tokenString = "";
char ch;
while (pos < source.length()) // state != State::DONE)
{
ch = source[pos]; // source是整个代码字符串,pos是当前字符位置
switch (state)
{
case State::START:
// ... 处理初始状态 ...
// 情况1:当前字符是数字
if (isdigit(ch))
{
read();
state = State::IN_NUM;
tokenString += ch;
}
// 情况2:当前字符是字母
else if (isalpha(ch))
{
read();
state = State::IN_ID;
tokenString += ch;
}
// 情况3:当前字符是空白字符
else if (isspace(ch))
{
// 忽略空白字符
skipWhitespace();
}
// 情况4:当前字符是注释
else if (ch == '/')
{
bool devide = skipComment();
if (devide)
{
state = State::START;
return Token(TokenType::DIVIDE, "/");
}
}
// 情况5:当前字符是文件末尾
else if (ch == '\0')
{
state = State::DONE;
// 生成END_OF_FILE token
return Token(TokenType::END_OF_FILE, tokenString);
}
// 情况6:当前字符是其他字符
else
{
return handleSymbol();
}
break;
case State::IN_NUM:
if (isdigit(ch))
{
read();
tokenString += ch;
} else if(isalpha(ch)) // 数字后面跟字母,报错
{
read();
tokenString += ch;
state = State::IN_ERROR;
return Token{TokenType::INVALID, tokenString};
} else
{
state = State::START;
return Token{TokenType::NUMBER, tokenString};
}
break;
case State::IN_ID:
// 识别标识符,字母开头之后可以是字母或数字
if (isalnum(ch) || isdigit(ch))
{
read();
tokenString += ch;
if(pos == source.length())
{
state = State::START;
if(tokenString == "END")
return Token(TokenType::END, tokenString);
else if(tokenString == "IF")
return Token(TokenType::IF, tokenString);
else if(tokenString == "THEN")
return Token(TokenType::THEN, tokenString);
else if(tokenString == "WHILE")
return Token(TokenType::WHILE, tokenString);
else if(tokenString == "DO")
return Token(TokenType::DO, tokenString);
else if(tokenString == "BEGIN")
return Token(TokenType::BEGIN, tokenString);
else if(tokenString == "END")
return Token(TokenType::END, tokenString);
else if(tokenString == "VAR")
return Token(TokenType::VAR, tokenString);
else if(tokenString == "CONST")
return Token(TokenType::CONST, tokenString);
else
return Token(TokenType::IDENTIFIER, tokenString);
}
}
else
{
state = State::START;
// 检查是否为关键字
std::string upperValue = tokenString;
auto kw = keywords.find(upperValue);
if (kw != keywords.end())
{
return Token(kw->second, upperValue);
}
else
{
return Token(TokenType::IDENTIFIER, tokenString);
}
}
break;
// 处理 :=
case State::IN_ASSIGN:
// 处理赋值符号
if (ch == '=')
{
read();
tokenString += ch;
state = State::START;
return Token{TokenType::ASSIGN, tokenString};
}
else
{
state = State::START;
return Token{TokenType::INVALID, tokenString};
}
break;
// 处理<, <=, <>
case State::IN_LESS:
if (ch == '=')
{
read();
tokenString += ch;
state = State::START;
return Token{TokenType::LESS_EQUAL, tokenString};
}
else if (ch == '>')
{
read();
tokenString += ch;
state = State::START;
return Token{TokenType::NOT_EQUAL, tokenString};
}
else
{
state = State::START;
return Token{TokenType::LESS, tokenString};
}
break;
// 处理>, >=
case State::IN_GREATER:
if (ch == '=')
{
read();
tokenString += ch;
state = State::START;
return Token{TokenType::GREATER_EQUAL, tokenString};
}
else
{
state = State::START;
return Token{TokenType::GREATER, tokenString};
}
break;
default:
// 错误处理
throw std::runtime_error("Lexer Error: Invalid State");
}
}
return Token(TokenType::END_OF_FILE, "");
}
Token Lexer::handleSymbol()
{
char ch = source[pos];
read();
switch (ch)
{
case '+':
return Token(TokenType::PLUS, "+");
case '-':
return Token(TokenType::MINUS, "-");
case '*':
return Token(TokenType::MULTIPLY, "*");
//case '/':
/*
if (source[pos] == '/')
{
// 单行注释,跳过直到行末
while (!isAtEnd() && peek() != '\n')
{
read();
}
}
else if (source[pos] == '*')
{
// 多行注释,跳过直到 '*
while (!isAtEnd())
{
if (peek() == '*' && peekNext() == '/')
{
// 跳过结束的 '*
read();
read();
break;
}
if (peek() == '\n')
{
line++;
column = 1;
}
else
{
column++;
}
read();
}
}
else*/
//return Token(TokenType::DIVIDE, "/");
case '(':
return Token(TokenType::LEFT_PAREN, "(");
case ')':
return Token(TokenType::RIGHT_PAREN, ")");
case ';':
return Token(TokenType::SEMICOLON, ";");
case ',':
return Token(TokenType::COMMA, ",");
case ':':
if (source[pos] == '=')
{
read();
return Token(TokenType::ASSIGN, ":=");
}
else
{
return Token(TokenType::INVALID, ":");
}
case '<':
if (source[pos] == '=')
{
read();
return Token(TokenType::LESS_EQUAL, "<=");
}
else if (source[pos] == '>')
{
read();
return Token(TokenType::NOT_EQUAL, "<>");
}
else
{
return Token(TokenType::LESS, "<");
}
case '>':
if (source[pos] == '=')
{
read();
return Token(TokenType::GREATER_EQUAL, ">=");
}
else
{
return Token(TokenType::GREATER, ">");
}
case '=':
if (source[pos] == '=')
{
read();
return Token(TokenType::EQUAL, "==");
}
else
{
return Token(TokenType::ASSIGN, "=");
}
case '!':
if (source[pos] == '=')
{
read();
return Token(TokenType::NOT_EQUAL, "!=");
}
else
{
return Token(TokenType::INVALID, "!");
}
default:
return Token(TokenType::INVALID, std::string(1, ch));
}
}
/*
std::vector<Token> Lexer::tokenize()
{
Token token = nextToken();
while (token.type != TokenType::END_OF_FILE)
{
tokens.push_back(token);
token = nextToken();
}
return tokens;
}
void Lexer::ungetNextChar()
{
if (!source.empty())
{
pos--;
}
}
void Lexer::addToken(TokenType type, const std::string &value)
{
tokens.push_back({type, value, line, column});
}
void Lexer::addToken(TokenType type)
{
addToken(type, "");
}
*/
void Lexer::read()
{
if (source[pos] == '\n')
{
line++;
column = 1;
}
else
{
column++;
}
pos++;
}
bool Lexer::match(char expected)
{
if (isAtEnd())
return false;
if (source[pos] != expected)
return false;
pos++;
column++; // 更新列号
return true;
}
// 跳过空白字符
void Lexer::skipWhitespace()
{
while (!isAtEnd())
{
char ch = peek();
switch (ch)
{
case ' ':
case '\r':
case '\t':
column++;
break;
case '\n':
line++;
column = 1;
break;
default:
return;
}
pos++;
}
state = State::START;
}
// 跳过注释
bool Lexer::skipComment()
{
bool devide = true;
if (match('/'))
{
if (match('/'))
{
devide = false;
// 单行注释,跳过直到行末
while (!isAtEnd() && peek() != '\n')
{
read();
}
}
else if (match('*'))
{
devide = false;
// 多行注释,跳过直到 '*/'
while (!isAtEnd())
{
if (peek() == '*' && peekNext() == '/')
{
// 跳过结束的 '*/'
read();
read();
break;
}
if (peek() == '\n')
{
line++;
column = 1;
}
else
{
column++;
}
read();
}
}
}
return devide;
}
// 判断是否到达代码末尾
bool Lexer::isAtEnd() const
{
return pos >= source.length();
}
// 查看下一个字符
char Lexer::peek() const
{
if (isAtEnd())
return '\0';
return source[pos];
}
// 查看下一个字符的下一个字符
char Lexer::peekNext() const
{
if (pos + 1 >= source.length())
return '\0';
return source[pos + 1];
}