-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathformat.c
609 lines (587 loc) · 20.3 KB
/
format.c
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
//
// Created by poorpool on 2021/1/27.
//
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "scan.h"
#include "format.h"
#include "print.h"
#include "expression.h"
#include "show.h"
extern int lineNumber;
extern TokenKind tokenKind;
extern char tokenText[];
char tokenTextTmp[1024];
AstNode *root;
// 给 p 分配 n 个儿子,并把这 n 个儿子创建好
AstNode * allocSons(AstNode *p, int n) {
if (p == NULL) {
p = newNode();
}
p->num = n;
p->son = (AstNode **)malloc(n*sizeof(AstNode *));
for (int i = 0; i < n; i++) {
p->son[i] = newNode();
}
return p;
}
// 给 p 分配 n 个儿子,不创建儿子
AstNode * allocSonsWithoutMalloc(AstNode *p, int n) {
if (p == NULL) {
p = newNode();
}
p->num = n;
p->son = (AstNode **)malloc(n*sizeof(AstNode *));
for (int i = 0; i < n; i++) {
p->son[i] = NULL;
}
return p;
}
// 设置 p 的文字
AstNode * setAstNodeText(AstNode *p, const char * source) {
int len = strlen(source);
if (p->text != NULL) free(p->text);
p->text = (char *)malloc(sizeof(char)*(len + 1));
strcpy(p->text, source);
return p;
}
// 创建结点
AstNode * newNode() {
AstNode * ret = (AstNode*)malloc(sizeof(AstNode));
ret->num = 0;
ret->son = NULL;
ret->type = UNKNOWN;
ret->text = NULL;
return ret;
}
// 释放结点
void freeNode(AstNode *p) {
if (p == NULL) {
return ;
}
if (p->text != NULL) {
free(p->text);
p->text = NULL;
}
for (int i = 0; i < p->num; i++) {
freeNode(p->son[i]);
p->son[i] = NULL;
}
if (p->son != NULL) {
free(p->son);
p->son = NULL;
}
free(p);
}
AstNode * getIdentOrArray(FILE *fp, AstNode *ret, TokenKind kind) {
if (kind == IDENT) {
ret = allocSons(ret, 2);
ret->type = IDENT_OR_ARRAY;
ret->son[0] = setAstNodeText(ret->son[0], tokenText);
tokenKind = getToken(fp);
if (tokenKind == IDENT) {
panic("Identifier shouldn't be followed by identifier!");
return NULL;
}
ret->son[1] = getIdentOrArray(fp, ret->son[1], tokenKind);
return ret;
} else if (kind == LBRACKET) {
ret = allocSons(ret, 4);
ret->son[0] = setAstNodeText(ret->son[0], getTokenKindStr(LBRACKET));
tokenKind = getToken(fp);
ret->son[1] = actualExpression(fp, ret->son[1], tokenKind);
if (tokenKind != RBRACKET) {
panic("Want a ]!");
return NULL;
}
ret->son[2] = setAstNodeText(ret->son[2], getTokenKindStr(RBRACKET));
tokenKind = getToken(fp);
if (tokenKind == IDENT) {
panic("Array shouldn't be followed by identifier!");
return NULL;
}
ret->son[3] = getIdentOrArray(fp, ret->son[3], tokenKind);
return ret;
} else {
unGetToken(fp, kind);
return NULL;
}
}
// 处理形式参数序列
// 要传一个 kind 且为 int/float/char
// 会多读一个
AstNode * processFormalArgList(FILE *fp, AstNode *ret, TokenKind kind) {
if (kind == INT || kind == FLOAT || kind == CHAR) {
tokenKind = getToken(fp);
if (tokenKind != IDENT) {
panic("Want an identifier!\n");
return NULL;
}
AstNode *lson = getIdentOrArray(fp, newNode(), tokenKind);
tokenKind = getToken(fp);
if (tokenKind == COMMA) {
ret = allocSons(ret, 4);
ret->son[0] = setAstNodeText(ret->son[0], getTokenKindStr(kind));
ret->son[1] = lson;
ret->son[2] = setAstNodeText(ret->son[2], getTokenKindStr(COMMA));
tokenKind = getToken(fp);
ret->son[3] = processFormalArgList(fp, ret->son[3], tokenKind);
} else {
ret = allocSons(ret, 2);
ret->son[0] = setAstNodeText(ret->son[0], getTokenKindStr(kind));
ret->son[1] = lson;
}
return ret;
} else {
return NULL;
}
}
// 得到一个不含类型的变量序列 a, b, c;
// 不会多读
AstNode * processVarList(FILE *fp, AstNode *ret) {
ret = allocSons(ret, 3);
tokenKind = getToken(fp);
if (tokenKind != IDENT) {
panic("Want an identifier!");
return NULL;
}
ret->son[0] = getIdentOrArray(fp, ret->son[0], tokenKind);
tokenKind = getToken(fp);
if (tokenKind == COMMA) {
ret->son[1] = setAstNodeText(ret->son[1], getTokenKindStr(COMMA));
ret->son[2] = processVarList(fp, ret->son[2]);
return ret;
} else if (tokenKind == SEMI) {
ret->son[1] = setAstNodeText(ret->son[1], getTokenKindStr(SEMI));
ret->son[2] = NULL;
return ret;
} else {
panic("Want a , or ;!");
return NULL;
};
}
// 得到许多变量序列
// 最后会多读一个
AstNode * getLotsOFVarList(FILE *fp, AstNode *ret) {
tokenKind = getToken(fp);
if (tokenKind == LINE_COMMENT || tokenKind == BLOCK_COMMENT) {
ret = allocSons(ret, 2);
ret->son[0] = allocSons(ret->son[0], 2);
ret->son[0]->type = COMMENT_STATEMENT;
ret->son[0] = setAstNodeText(ret->son[0], tokenText);
ret->son[1] = getLotsOFVarList(fp, ret->son[1]);
return ret;
}
if (tokenKind != INT && tokenKind != FLOAT && tokenKind != CHAR) {
return NULL;
}
ret = allocSons(ret, 2);
ret->son[0] = allocSons(ret->son[0], 2);
ret->son[0]->type = VAR_LIST;
ret->son[0]->son[0] = setAstNodeText(ret->son[0]->son[0], getTokenKindStr(tokenKind));
ret->son[0]->son[1] = processVarList(fp, ret->son[0]->son[1]);
ret->son[1] = getLotsOFVarList(fp, ret->son[1]);
return ret;
}
// 得到许多表达式序列,用于实参
// 最后会多读一个
AstNode * getLotsOFExpressionList(FILE *fp, AstNode *ret) {
tokenKind = getToken(fp);
if (tokenKind == RP) {
freeNode(ret);
return NULL;
}
ret = allocSons(ret, 2);
ret->son[0] = allocSons(ret->son[0], 2);
ret->son[0]->son[0] = actualExpression(fp, ret->son[0]->son[0], tokenKind);
if (tokenKind != COMMA && tokenKind != RP) {
panic("Confusing expression separator!");
return NULL;
}
if (tokenKind == COMMA) {
ret->son[0]->son[1] = setAstNodeText(ret->son[0]->son[1], getTokenKindStr(COMMA));
ret->son[1] = getLotsOFExpressionList(fp, ret->son[1]);
} else {
ret->son[0]->son[1] = NULL;
ret->son[1] = NULL;
}
return ret;
}
// 处理 if,else if,else
// 不会多读
AstNode * processIf(FILE *fp, AstNode *ret, TokenKind kind) {
if (kind == IF) {
ret = allocSons(ret, 6);
ret->type = IF_STATEMENT;
ret->son[0] = setAstNodeText(ret->son[0], getTokenKindStr(IF));
tokenKind = getToken(fp);
if (tokenKind != LP) {
panic("Want a (!\n");
return NULL;
}
ret->son[1] = setAstNodeText(ret->son[1], getTokenKindStr(LP));
tokenKind = getToken(fp);
ret->son[2] = actualExpression(fp, ret->son[2], tokenKind);
if (tokenKind != RP) {
panic("Want a )!\n");
return NULL;
}
ret->son[3] = setAstNodeText(ret->son[3], getTokenKindStr(RP));
tokenKind = getToken(fp);
if (tokenKind != LBRACE) {
panic("Want a {!\n");
return NULL;
}
ret->son[4] = processCompoundStatement(fp, ret->son[4]);
tokenKind = getToken(fp);
ret->son[5] = processIf(fp, ret->son[5], tokenKind);
return ret;
} else if (kind == ELSE) {
tokenKind = getToken(fp);
if (tokenKind == IF) {
ret = allocSons(ret, 6);
ret->type = ELSE_IF_STATEMENT;
ret->son[0] = setAstNodeText(ret->son[0], "else if"); // 硬编码,,,
tokenKind = getToken(fp);
if (tokenKind != LP) {
panic("Want a (!\n");
return NULL;
}
ret->son[1] = setAstNodeText(ret->son[1], getTokenKindStr(LP));
tokenKind = getToken(fp);
ret->son[2] = actualExpression(fp, ret->son[2], tokenKind);
if (tokenKind != RP) {
panic("Want a )!\n");
return NULL;
}
ret->son[3] = setAstNodeText(ret->son[3], getTokenKindStr(RP));
tokenKind = getToken(fp);
if (tokenKind != LBRACE) {
panic("Want a {!\n");
return NULL;
}
ret->son[4] = processCompoundStatement(fp, ret->son[4]);
tokenKind = getToken(fp);
ret->son[5] = processIf(fp, ret->son[5], tokenKind);
return ret;
} else if (tokenKind == LBRACE) {
ret = allocSons(ret, 2);
ret->type = ELSE_STATEMENT;
ret->son[0] = setAstNodeText(ret->son[0], getTokenKindStr(ELSE));
ret->son[1] = processCompoundStatement(fp, ret->son[1]);
return ret;
} else {
panic("Confusing type after else!");
return NULL;
}
} else {
unGetToken(fp, kind);
return NULL;
}
}
// 处理一条语句
// 不会多读
AstNode * processSentence(FILE *fp, AstNode *ret, TokenKind kind) {
switch (kind) {
case LINE_COMMENT:
case BLOCK_COMMENT:
ret->type = COMMENT_STATEMENT;
ret = setAstNodeText(ret, tokenText);
return ret;
break;
case IF:
return processIf(fp, ret, kind);
break;
case RETURN:
ret = allocSons(ret, 3);
ret->type = RETURN_STATEMENT;
ret->son[0] = setAstNodeText(ret->son[0], getTokenKindStr(RETURN));
tokenKind = getToken(fp);
ret->son[1] = actualExpression(fp, ret->son[1], tokenKind);
if (tokenKind != SEMI) {
panic("return want a ;!");
return NULL;
}
ret->son[2] = setAstNodeText(ret->son[2], getTokenKindStr(SEMI));
return ret;
break;
case FOR:
ret = allocSons(ret, 9);
ret->type = FOR_STATEMENT;
ret->son[0] = setAstNodeText(ret->son[0], getTokenKindStr(FOR));
tokenKind = getToken(fp);
if (tokenKind != LP) {
panic("for want a (!");
return NULL;
}
ret->son[1] = setAstNodeText(ret->son[1], getTokenKindStr(LP));
tokenKind = getToken(fp);
if (tokenKind != SEMI) {
ret->son[2] = actualExpression(fp, ret->son[2], tokenKind);
} else {
ret->son[2] = NULL;
}
if (tokenKind != SEMI) {
panic("for want a ;!");
return NULL;
}
ret->son[3] = setAstNodeText(ret->son[3], getTokenKindStr(SEMI));
tokenKind = getToken(fp);
if (tokenKind != SEMI) {
ret->son[4] = actualExpression(fp, ret->son[4], tokenKind);
} else {
ret->son[4] = NULL;
}
if (tokenKind != SEMI) {
panic("for want a ;!");
return NULL;
}
ret->son[5] = setAstNodeText(ret->son[5], getTokenKindStr(SEMI));
tokenKind = getToken(fp);
if (tokenKind != RP) {
ret->son[6] = actualExpression(fp, ret->son[6], tokenKind);
} else {
ret->son[6] = NULL;
}
if (tokenKind != RP) {
panic("for want a )!");
return NULL;
}
ret->son[7] = setAstNodeText(ret->son[7], getTokenKindStr(RP));
tokenKind = getToken(fp);
if (tokenKind != LBRACE) {
panic("for want a {!");
return NULL;
}
ret->son[8] = processCompoundStatement(fp, ret->son[8]);
return ret;
break;
case WHILE:
ret = allocSons(ret, 5);
ret->type = WHILE_STATEMENT;
ret->son[0] = setAstNodeText(ret->son[0], getTokenKindStr(WHILE));
tokenKind = getToken(fp);
if (tokenKind != LP) {
panic("while want a (!");
return NULL;
}
ret->son[1] = setAstNodeText(ret->son[1], getTokenKindStr(LP));
tokenKind = getToken(fp);
ret->son[2] = actualExpression(fp, ret->son[2], tokenKind);
if (tokenKind != RP) {
panic("while want a )!");
return NULL;
}
ret->son[3] = setAstNodeText(ret->son[3], getTokenKindStr(RP));
tokenKind = getToken(fp);
if (tokenKind != LBRACE) {
panic("for want a {!");
return NULL;
}
ret->son[4] = processCompoundStatement(fp, ret->son[4]);
return ret;
break;
case BREAK:
ret = allocSons(ret, 2);
ret->type = BREAK_STATEMENT;
ret->son[0] = setAstNodeText(ret->son[0], getTokenKindStr(BREAK));
tokenKind = getToken(fp);
if (tokenKind != SEMI) {
panic("break want a ;!");
return NULL;
}
ret->son[1] = setAstNodeText(ret->son[1], getTokenKindStr(SEMI));
return ret;
break;
case CONTINUE:
ret = allocSons(ret, 2);
ret->type = CONTINUE_STATEMENT;
ret->son[0] = setAstNodeText(ret->son[0], getTokenKindStr(CONTINUE));
tokenKind = getToken(fp);
if (tokenKind != SEMI) {
panic("continue want a ;!");
return NULL;
}
ret->son[1] = setAstNodeText(ret->son[1], getTokenKindStr(SEMI));
return ret;
break;
case SEMI:
ret = allocSons(ret, 2);
ret->son[0] = NULL;
ret->son[1] = setAstNodeText(ret->son[1], getTokenKindStr(SEMI));
return ret;
break;
default:
ret = allocSons(ret, 2);
ret->son[0] = actualExpression(fp, ret->son[0], kind);
if (tokenKind != SEMI) {
panic("Want a ;!");
return NULL;
}
ret->son[1] = setAstNodeText(ret->son[1], getTokenKindStr(SEMI));
}
return ret;
}
// 得到许多语句
// 会多读
AstNode * getLotsOfSentence(FILE *fp, AstNode *ret, TokenKind kind) {
if (kind == RBRACE) {
return NULL;
} else {
ret = allocSons(ret, 2);
ret->son[0] = processSentence(fp, ret->son[0], kind);
tokenKind = getToken(fp);
ret->son[1] = getLotsOfSentence(fp, ret->son[1], tokenKind);
return ret;
}
}
// 得到 {} 包裹的复合语句
// 此时 tokenKind 一定是 LBRACE
// 不会多读
AstNode * processCompoundStatement(FILE *fp, AstNode *ret) {
ret->type = COMPOUND_STATEMENT;
ret = allocSons(ret, 4);
ret->son[0] = setAstNodeText(ret->son[0], getTokenKindStr(LBRACE));
ret->son[1] = getLotsOFVarList(fp, ret->son[1]);
ret->son[2] = getLotsOfSentence(fp, ret->son[2], tokenKind);
if (tokenKind != RBRACE) {
panic("Want a }!");
return NULL;
}
ret->son[3] = setAstNodeText(ret->son[3], getTokenKindStr(RBRACE));
return ret;
}
// 得到外部定义,有多种情况
AstNode * processExtDef(FILE *fp) {
tokenKind = getToken(fp);
AstNode * ret = newNode();
switch (tokenKind) {
case LINE_COMMENT:
case BLOCK_COMMENT:
ret->type = COMMENT_STATEMENT;
ret = setAstNodeText(ret, tokenText);
return ret;
break;
case ENDOFFILE:
return NULL;
case SHARP:
tokenKind = getToken(fp);
if (tokenKind == INCLUDE) {
ret->type = EXT_INCLUDE;
ret = allocSons(ret, 3);
ret->son[0] = setAstNodeText(ret->son[0], getTokenKindStr(SHARP));
ret->son[1] = setAstNodeText(ret->son[1], getTokenKindStr(INCLUDE));
tokenKind = getToken(fp);
if (tokenKind == STRING) {
ret->son[2] = setAstNodeText(ret->son[2], tokenText);
return ret;
} else {
freeNode(ret);
panic("Include doesn't complete!");
return NULL;
}
} else if (tokenKind == DEFINE) {
ret->type = EXT_DEFINE;
ret = allocSons(ret, 4);
ret->son[0] = setAstNodeText(ret->son[0], getTokenKindStr(SHARP));
ret->son[1] = setAstNodeText(ret->son[1], getTokenKindStr(DEFINE));
tokenKind = getToken(fp);
if (tokenKind != IDENT) {
freeNode(ret);
panic("define want a identifier!");
return NULL;
}
ret->son[2] = setAstNodeText(ret->son[2], tokenText);
getTextUntilNewLine(fp);
ret->son[3] = setAstNodeText(ret->son[3], tokenText);
return ret;
} else {
panic("Confusing #");
return NULL;
}
break;
case INT:
case FLOAT:
case CHAR:
ret = allocSons(ret, 2);
ret->son[0] = setAstNodeText(ret->son[0], getTokenKindStr(tokenKind));
tokenKind = getToken(fp);
if (tokenKind != IDENT) {
freeNode(ret);
panic("Doesn't get an identifier!");
return NULL;
}
AstNode * lson = getIdentOrArray(fp, newNode(), tokenKind);
tokenKind = getToken(fp);
if (lson->son[1] != NULL && tokenKind != COMMA && tokenKind != SEMI) {
panic("Want , or ; after array!");
return NULL;
}
if (tokenKind == COMMA || tokenKind == SEMI) {
ret->type = VAR_LIST;
ret->son[1] = allocSons(ret->son[1], 3);
ret->son[1]->son[0] = lson;
ret->son[1]->son[1] = setAstNodeText(ret->son[1]->son[1], getTokenKindStr(tokenKind));
if (tokenKind == SEMI) {
ret->son[1]->son[2] = NULL;
} else {
ret->son[1]->son[2] = processVarList(fp, ret->son[1]->son[2]);
}
return ret;
} else if (tokenKind == LP) {
ret->son[1] = allocSons(ret->son[1], 5);
ret->son[1]->son[0] = lson;
ret->son[1]->son[1] = setAstNodeText(ret->son[1]->son[1], getTokenKindStr(LP));
tokenKind = getToken(fp);
ret->son[1]->son[2] = processFormalArgList(fp, ret->son[1]->son[2], tokenKind);
// 这里不需要 getToken,因为 processFormalArgList 已经 get 过了
if (tokenKind != RP) {
freeNode(ret);
panic("Doesn't get a )!");
return NULL;
}
ret->son[1]->son[3] = setAstNodeText(ret->son[1]->son[3], getTokenKindStr(RP));
tokenKind = getToken(fp);
if (tokenKind == SEMI) {
ret->type = EXT_FUN_STATEMEMT;
ret->son[1]->son[4] = setAstNodeText(ret->son[1]->son[4], getTokenKindStr(SEMI));
} else if (tokenKind == LBRACE) {
ret->type = EXT_FUN_DEFINITION;
ret->son[1]->son[4] = processCompoundStatement(fp, ret->son[1]->son[4]);
} else {
freeNode(ret);
panic("Doesn't get a ;!");
return NULL;
}
return ret;
} else {
freeNode(ret);
panic("Confusing data type!\n");
return NULL;
}
break;
default:
panic("Confusing ext type!");
return NULL;
}
}
AstNode * processExtDefList(FILE *fp) {
AstNode *ret = newNode();
ret->type = EXT_DEF_LIST;
ret = allocSonsWithoutMalloc(ret, 2);
ret->son[0] = processExtDef(fp);
if (ret->son[0] == NULL) {
freeNode(ret);
return NULL;
}
ret->son[1] = processExtDefList(fp);
return ret;
}
void format(FILE *fp, FILE *outfp) {
root = processExtDefList(fp);
#ifdef SHOW_AST
showNode(root, 0);
#endif
printNode(outfp, root, 0);
}