-
Notifications
You must be signed in to change notification settings - Fork 3
/
lexical.cpp
590 lines (550 loc) · 10 KB
/
lexical.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
#include <iostream>
#include <fstream>
#include <string>
#include <cstring>
#include "lexical.h"
using namespace std;
char ch;
char token[100000];
int tokenI = 0;
int num; //记录整形常量
char con_ch; //记录字符型常量
char s[100000]; //记录字符串常量
enum typeId symbol;
int len_reservedWord = 13;
char reservedWord[20][10] = {
"const", "int", "char", "void", "main", "if", "else", "do", "while", "for", "scanf", "printf", "return",
};
int indexs = 0; //文件的索引
int oldIndex; //用于做恢复
int line = 1; //记录行号
string filecontent; //文件的内容
extern ofstream outputfile;
extern ofstream errorfile;
extern bool error;
bool isSpace()
{
return (ch == ' ');
}
bool isNewline()
{
return (ch == '\n');
}
bool isBlank()
{
return (ch == ' ' || ch == '\n' || ch == '\t' || ch == '\r' || ch == '\f' || ch == '\v');
}
bool isLetter()
{
return ((ch >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z') || (ch == '_'));
}
bool isDigit()
{
return (ch >= '0' && ch <= '9');
}
bool isPlus()
{
return (ch == '+');
}
bool isMinu()
{
return (ch == '-');
}
bool isMult()
{
return (ch == '*');
}
bool isDiv()
{
return (ch == '/');
}
bool isChar() {
return (isLetter() || isDigit() || isPlus() || isMinu() || isMult() || isDiv());
}
bool isLss()
{
return (ch == '<');
}
bool isGre()
{
return (ch == '>');
}
bool isExcla()
{
return (ch == '!');
}
bool isAssign()
{
return (ch == '=');
}
bool isSemicn()
{
return (ch == ';');
}
bool isComma()
{
return (ch == ',');
}
bool isLparent()
{
return (ch == '(');
}
bool isRparent()
{
return (ch == ')');
}
bool isLbrack()
{
return (ch == '[');
}
bool isRbrack()
{
return (ch == ']');
}
bool isLbrace()
{
return (ch == '{');
}
bool isRbrace()
{
return (ch == '}');
}
bool isSquo()
{
return (ch == '\'');
}
bool isDquo()
{
return (ch == '\"');
}
bool isEOF()
{
//return ch == EOF;
return indexs >= filecontent.size();
}
bool isStringChar()
{
return ((ch >= 35 && ch <= 126) || ch == 32 || ch == 33);
}
bool isFactorFellow()
{
return (isLss() || isGre() || isAssign() || isExcla()
|| isPlus() || isMinu() || isMult() || isDiv()
|| isRparent() || isRbrack() || isComma() || isSemicn());
}
void clearToken()
{ //清空token
tokenI = 0;
}
void catToken()
{ //把当前字符ch拼到token上
token[tokenI++] = ch;
}
void get_ch()
{ //读一个字符
ch = filecontent[indexs++];
if (ch == '\n') {
line++;
}
}
void retract()
{ //把字符写回到输入流
if (ch == '\n') {
line--;
}
indexs--;
}
void retractString(int old) {
for (int i = old; i < indexs; i++) {
if (filecontent[i] == '\n') {
line--;
}
}
indexs = old;
}
int reserver()
{ //查找保留字 返回-1代表是标识符 不是保留字 否则返回保留字编码
for (int i = 0; i < len_reservedWord; i++) {
if (strcmp(reservedWord[i], token) == 0) {
return i;
}
}
return -1;
}
int transNum()
{
int res = 0;
for (int i = 0; i < tokenI; i++) {
res = res * 10 + (token[i] - '0');
}
return res;
}
int getsym(int out)
{
oldIndex = indexs; //记录没有读取之前的indexs为oldIndex
clearToken();
get_ch();
while (isBlank()) {
get_ch();
}// 一直读 直到ch不是空白符
if (isEOF()) {
return -1;
}
if (isLetter()) { // 'a'-'z' 'A'-'Z' '_'
while (isLetter() || isDigit()) { //拼标识符 <标识符>::=<字母>{<字母>|<数字>}
catToken(); //把ch连接到token中
get_ch(); //读ch
}
//此时ch不再是字母或者数字了 说明标识符结束了
retract(); //回退ch
token[tokenI] = '\0';
int resultValue = reserver(); //查找保留字表
if (resultValue == -1) { //标识符
symbol = IDENFR;
}
else { //保留字
symbol = (typeId)resultValue;
}
return 1;
}
else if (isDigit()) { // '0'-'9' 数字
while (isDigit()) {
catToken();
get_ch();
}
//此时ch不再是数字了
retract();
token[tokenI] = '\0';
num = transNum();
symbol = INTCON; //整型常量
if (token[0] == '0' && tokenI > 1) {
if (out) {
errorfile << line << " a\n"; //不符合词法 有前导的0
error = true;
}
}
return 1;
}
else if (isSquo()) { // '
get_ch();
if (isChar()) {
char tmp = ch; //暂时记录
get_ch();
if (isSquo()) {
con_ch = tmp;
symbol = CHARCON; //字符常量
}
else {
//wrong! retract(); 缺少右单引号 不符合词法
if (out) {
errorfile << line << " a\n"; //不符合词法
error = true;
}
int old = indexs;
while (1) {
if (isSquo()) {
break;
}
if (isNewline()) {
retractString(old-1); //回到这个读错了的 本该是'的位置
break;
}
if (isFactorFellow()) { //, ; + - * / > < ! =
indexs--; //需要把,;退回去
break;
}
get_ch();
}
con_ch = tmp;
symbol = CHARCON; //字符常量
}
}
else {
//wrong! retract(); 字符不是a-z A-Z _+-*/
if (out) {
errorfile << line << " a\n"; //不符合词法
error = true;
}
char tmp = ch;
get_ch();
if (isSquo()) {
con_ch = tmp;
symbol = CHARCON; //字符常量
}
else {
//wrong! retract(); 缺少右单引号 不符合词法
int old = indexs;
while (1) {
if (isSquo()) {
break;
}
if (isNewline()) {
retractString(old - 1); //回到这个读错了的 本该是'的位置
break;
}
if (isFactorFellow()) { //, ; + - * / > < ! =
indexs--; //需要把,;退回去
break;
}
get_ch();
}
con_ch = tmp;
symbol = CHARCON; //字符常量
}
}
return 1;
}
else if (isDquo()) { // "
get_ch();
while (isStringChar()) {
catToken();
get_ch();
}
//此时ch不再是可以组成字符串的字符
if (isDquo()) { //遇到了结束的双引号
symbol = STRCON; //字符串常量
token[tokenI] = '\0';
strcpy(s, token); //存到s中
}
else { //wrong! retract(); 缺少右双引号 不符合词法
if (isNewline()) {
line--;
if (out) {
errorfile << line << " a\n"; //不符合词法
error = true;
}
while (1) {
indexs--;
if (filecontent[indexs] == ')') {
break;
}
tokenI--;
}
symbol = STRCON; //字符串常量
token[tokenI] = '\0';
strcpy(s, token); //存到s中
}
}
return 1;
}
else if (isPlus()) { // +
symbol = PLUS;
return 1;
}
else if (isMinu()) { // -
symbol = MINU;
return 1;
}
else if (isMult()) { // *
symbol = MULT;
return 1;
}
else if (isDiv()) { // /
symbol = DIV;
return 1;
}
else if (isLss()) { // <
get_ch();
if (isAssign()) { //<=
symbol = LEQ;
}
else {
symbol = LSS; //<
retract(); //回退
}
return 1;
}
else if (isGre()) { // >
get_ch();
if (isAssign()) { //>=
symbol = GEQ;
}
else {
symbol = GRE; //>
retract(); //回退
}
return 1;
}
else if (isExcla()) { // !
get_ch();
if (isAssign()) { // !=
symbol = NEQ;
}
else {
//wrong! retract(); !后边缺少=
retract();
if (out) {
errorfile << line << " a\n"; //不符合词法
error = true;
}
symbol = NEQ;
}
return 1;
}
else if (isAssign()) { // =
get_ch();
if (isAssign()) { //==
symbol = EQL;
}
else {
symbol = ASSIGN;
retract(); //回退
}
return 1;
}
else if (isSemicn()) { // ;
symbol = SEMICN;
return 1;
}
else if (isComma()) { // ,
symbol = COMMA;
return 1;
}
else if (isLparent()) { // (
symbol = LPARENT;
return 1;
}
else if (isRparent()) { // )
symbol = RPARENT;
return 1;
}
else if (isLbrack()) { // [
symbol = LBRACK;
return 1;
}
else if (isRbrack()) { // ]
symbol = RBRACK;
return 1;
}
else if (isLbrace()) { // {
symbol = LBRACE;
return 1;
}
else if (isRbrace()) { // }
symbol = RBRACE;
return 1;
}
else {
//wrong! retract();
if (out) {
errorfile << line << " a\n"; //不符合词法
error = true;
}
return getsym(out);
}
}
void doOutput()
{
switch (symbol) {
case IDENFR:
outputfile << "IDENFR " << token << endl;
break;
case INTCON:
outputfile << "INTCON " << token << endl;
break;
case CHARCON:
outputfile << "CHARCON " << con_ch << endl;
break;
case STRCON:
outputfile << "STRCON " << s << endl;
break;
case CONSTTK:
outputfile << "CONSTTK const" << endl;
break;
case INTTK:
outputfile << "INTTK int" << endl;
break;
case CHARTK:
outputfile << "CHARTK char" << endl;
break;
case VOIDTK:
outputfile << "VOIDTK void" << endl;
break;
case MAINTK:
outputfile << "MAINTK main" << endl;
break;
case IFTK:
outputfile << "IFTK if" << endl;
break;
case ELSETK:
outputfile << "ELSETK else" << endl;
break;
case DOTK:
outputfile << "DOTK do" << endl;
break;
case WHILETK:
outputfile << "WHILETK while" << endl;
break;
case FORTK:
outputfile << "FORTK for" << endl;
break;
case SCANFTK:
outputfile << "SCANFTK scanf" << endl;
break;
case PRINTFTK:
outputfile << "PRINTFTK printf" << endl;
break;
case RETURNTK:
outputfile << "RETURNTK return" << endl;
break;
case PLUS:
outputfile << "PLUS +" << endl;
break;
case MINU:
outputfile << "MINU -" << endl;
break;
case MULT:
outputfile << "MULT *" << endl;
break;
case DIV:
outputfile << "DIV /" << endl;
break;
case LSS:
outputfile << "LSS <" << endl;
break;
case LEQ:
outputfile << "LEQ <=" << endl;
break;
case GRE:
outputfile << "GRE >" << endl;
break;
case GEQ:
outputfile << "GEQ >=" << endl;
break;
case EQL:
outputfile << "EQL ==" << endl;
break;
case NEQ:
outputfile << "NEQ !=" << endl;
break;
case ASSIGN:
outputfile << "ASSIGN =" << endl;
break;
case SEMICN:
outputfile << "SEMICN ;" << endl;
break;
case COMMA:
outputfile << "COMMA ," << endl;
break;
case LPARENT:
outputfile << "LPARENT (" << endl;
break;
case RPARENT:
outputfile << "RPARENT )" << endl;
break;
case LBRACK:
outputfile << "LBRACK [" << endl;
break;
case RBRACK:
outputfile << "RBRACK ]" << endl;
break;
case LBRACE:
outputfile << "LBRACE {" << endl;
break;
case RBRACE:
outputfile << "RBRACE }" << endl;
break;
default:
break;
}
}