递归下降语法分析器

C/C++ 二月 14, 2020

递归下降语法分析器

文章字数 157k 阅读约需 2:23 阅读次数 1000000

自己写的递归下降语法分析器(很遗憾没能生成语法树)
测试代码的链接:https://github.com/HanJiaxing521/HanJiaxing521.github.io/blob/master/2020/02/14/rdcheck/test.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
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
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
/**
* rdcheck.cpp: Don't generate syntax tree
* author: Justin Han
* time: 2019/11/22
*/

#include <stdio.h>
#include <string.h>
/**
* define the VN
*/
#define A program
#define A1 A1
#define B external_declaration
#define C decl_or_stmt
#define C1 C1
#define D declarator_list
#define D1 D1
#define E intstr_list
#define E1 E1
#define F initializer
#define G declarator
#define G1 G1
#define G2 G2
#define G3 G3
#define G4 G4
#define H parameter_list
#define H1 H1
#define I parameter
#define J Type
#define K statement
#define K1 K1
#define K2 K2
#define K3 K3
#define L statement_list
#define L1 L1
#define M expression_statement
#define N expr
#define O cmp_expr
#define O1 O1
#define P add_expr
#define P1 P1
#define P2 P2
#define Q mul_expr
#define Q1 Q1
#define Q2 Q2
#define R primary_expr
#define R1 R1
#define R2 R2
#define R3 R3
#define S expr_list
#define S1 S1
#define T id_list
#define T1 T1

/**
* define class-numbers of symbols
*/
#define ALPHABET 0
#define DEGIT 1
#define WHITESPACE 2
#define SEPCHAR 3
#define MATHCHAR 4
#define STRING 5

/**
* define classes of symbols
*/
const char alphabet[52] = { 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k',
'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 'A', 'B',
'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R',
'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z' };
const char degit[10] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9' };
const char whitespace[3] = { ' ', '\n', '\t' };
const char sepchar[10] = { '{', '}', ';', ',', '.', '(', ')' ,'"', '[', ']' };
const char mathchar[9] = { '>', '<', '=', '+', '-', '|', '/', '*', '%' };

/*define class-numbers of words
* INT 19
* FLOAT 20
* STRING 21
* SPECIAL_WORD sepchar_subscript_index+30
* MATHCHAR mathchar_subscript_index+40
* ID 22
* annotation 23
*/

/**
* define IDs and mathwords
*/
const char* tokens[19] = { "args", "class", "else", "for", "if", "int", "main", "new", "out", "package", "private", "public", "print", "println", "return", "static", "String", "System", "void" };
const char* mathWords[17] = { ">", "<", "=", "+", "-", "|", "/", "*", "%", ">=", "<=", "++", "--", "==" ,"||", "-=", "+=" };

/**
* define the VT
* n NUMBER
* s STRING
* i ID
* a INT
* b STR
* c VOID
* d IF
* e ELSE
* f WHILE
* g RETURN
* h PRINT
* j SCAN
* k CMP
* l ASSIGN
*/

/**
* Define the FIRST set
*/
const char FIRST_A[3] = { 'a','b','c' };
const char FIRST_A1[4] = { 'a','b','c','\n' };
const char FIRST_B[3] = { 'a','b','c' };
const char FIRST_C[3] = { '{',',',';' };
const char FIRST_C1[16] = { 'a','b','c','{',';','i','(','n','s','-','d','f','g','h','j','}' };
const char FIRST_D[1] = { 'i' };
const char FIRST_D1[2] = { ',','\n' };
const char FIRST_E[2] = { 'n','s' };
const char FIRST_E1[2] = { ',', '\n' };
const char FIRST_F[2] = { 'n','s' };
const char FIRST_G[1] = { 'i' };
const char FIRST_G1[4] = { '=','(','[','\n' };
const char FIRST_G2[4] = { ')','a','b','c' };
const char FIRST_G3[6] = { ']','i','(','n','s','-' };
const char FIRST_G4[2] = { '{','\n' };
const char FIRST_H[3] = { 'a','b','c' };
const char FIRST_H1[2] = { ',','\n' };
const char FIRST_I[3] = {'a','b','c'};
const char FIRST_J[3] = { 'a','b','c' };
const char FIRST_K[15] = { 'a','b','c','{',';','i','(','n','s','-','d','f','g','h','j' };
const char FIRST_K1[2] = { 'e','\n' };
const char FIRST_K2[] = { ';','i','(','n','s','-' };
const char FIRST_K3[] = { ';','i','(','n','s','-' };
const char FIRST_L[] = { 'a','b','c','{',';','i','(','n','s','-','d','f','g','h','j' };
const char FIRST_L1[] = { 'a','b','c','{',';','i','(','n','s','-','d','f','g','h','j' ,'\n' };
const char FIRST_M[] = { ';','i','(','n','s','-' };
const char FIRST_N[] = { 'i','(','n','s','-' };
const char FIRST_O[] = { 'i','(','n','s','-' };
const char FIRST_O1[] = { 'k','\n' };
const char FIRST_P[] = { 'i','(','n','s','-' };
const char FIRST_P1[] = { '+','-' };
const char FIRST_P2[] = { 'i','(','n','s','-','+'};
const char FIRST_Q[] = { 'i','(','n','s','-' };
const char FIRST_Q1[] = { '*','/','%' };
const char FIRST_Q2[] = { '*','/','%','\n' };
const char FIRST_R[] = { 'i','(','n','s' };
const char FIRST_R1[] = { '(','l','=','[','\n' };
const char FIRST_R2[] = { 'i','(',')','n','s','-' };
const char FIRST_R3[] = { '=','\n' };
const char FIRST_S[] = { 'i','(','n','s','-' };
const char FIRST_S1[] = { ',','\n' };
const char FIRST_T[] = { 'i' };
const char FIRST_T1[] = { ',','\n' };

/**
* Define the FOLLOW set
*/
const char FOLLOW_A[] = { '#' };
const char FOLLOW_A1[] = { '#' };
const char FOLLOW_B[] = { 'a','b','c','#' };
const char FOLLOW_C[] = { 'a','b','c','#' };
const char FOLLOW_C1[] = { 'a','b','c','#' };
const char FOLLOW_D[] = { ';' };
const char FOLLOW_D1[] = { ';' };
const char FOLLOW_E[] = { '}' };
const char FOLLOW_E1[] = { '}' };
const char FOLLOW_F[] = { '}',',' };
const char FOLLOW_G[] = { ';','{',',' };
const char FOLLOW_G1[] = { ';','{',',' };
const char FOLLOW_G2[] = { ';','{',',' };
const char FOLLOW_G3[] = { ';','{',',' };
const char FOLLOW_G4[] = { ';','{',',' };
const char FOLLOW_H[] = { ')' };
const char FOLLOW_H1[] = { ')' };
const char FOLLOW_I[] = { ',',')' };
const char FOLLOW_J[] = { 'i' };
const char FOLLOW_K[] = { '}','e','a','b','c','{',';','i','(','n','s','-','d','f','g','h','j' };
const char FOLLOW_K1[] = { '}','e','a','b','c','{',';','i','(','n','s','-','d','f','g','h','j' };
const char FOLLOW_K2[] = { '}','e','a','b','c','{',';','i','(','n','s','-','d','f','g','h','j' };
const char FOLLOW_K3[] = { '}','e','a','b','c','{',';','i','(','n','s','-','d','f','g','h','j' };
const char FOLLOw_L[] = { '}' };
const char FOLLOW_L1[] = { '}' };
const char FOLLOW_M[] = { '}','e','a','b','c','{',';','i','(','n','s','-','d','f','g','h','j' };
const char FOLLOW_N[] = { ']',')',';','{',',','*','/','%','i','(','n','s','-','k' ,'+' };
const char FOLLOW_O[] = { ']',')',';','{',',','*','/','%','i','(','n','s','-','k' ,'+' };
const char FOLLOW_O1[] = { ']',')',';','{',',','*','/','%','i','(','n','s','-','k' ,'+' };
const char FOLLOW_P[] = { ']',')',';','{',',','*','/','%','i','(','n','s','-','k' ,'+' };
const char FOLLOW_P1[] = { ']',')',';','{',',','*','/','%','i','(','n','s','-','k' ,'+' };
const char FOLLOW_P2[] = { ']',')',';','{',',','*','/','%','i','(','n','s','-','k' ,'+' };
const char FOLLOW_Q[] = { ']',')',';','i','(','n','s','-','k','{',',','+','*','/','%' };
const char FOLLOW_Q1[] = { ']',')',';','*','/','%','i','(','n','s','-','k','{',',','+' };
const char FOLLOW_Q2[] = { ']',')',';','i','(','n','s','-','k','{',',','+','*','/','%' };
const char FOLLOW_R[] = { ']',')',';','*','/','%','i','(','n','s','-','k','{',',' ,'+'};
const char FOLLOW_R1[] = { ']',')',';','*','/','%','i','(','n','s','-','k','{',',' ,'+'};
const char FOLLOW_R2[] = { ']',')',';','*','/','%','i','(','n','s','-','k','{',',' ,'+'};
const char FOLLOW_R3[] = { ']',')',';','*','/','%','i','(','n','s','-','k','{',',' ,'+'};
const char FOLLOW_S[] = { ';',')' };
const char FOLLOW_S1[] = { ';',')' };
const char FOLLOW_T[] = { ';' };
const char FOLLOW_T1[] = { ';' };

/**
* The symbolList, symbol to be matched and its index
*/
char sym = '0';
int i = 0;
char result[5000];

/**
* transform char to string
*/
char* toString(char ch)
{
char str[2];
str[0] = ch;
str[1] = 0;
return str;
}

/**
* generate symbols
*/
char* token(char* symbol, int charClass)
{
char ch = '0';

if (charClass == 0)
if (strcmp(symbol, "int") == 0)
ch = 'a';
else if (strcmp(symbol, "str") == 0)
ch = 'b';
else if (strcmp(symbol, "void") == 0)
ch = 'c';
else if (strcmp(symbol, "if") == 0)
ch = 'd';
else if (strcmp(symbol, "else") == 0)
ch = 'e';
else if (strcmp(symbol, "while") == 0)
ch = 'f';
else if (strcmp(symbol, "return") == 0)
ch = 'g';
else if (strcmp(symbol, "print") == 0)
ch = 'h';
else if (strcmp(symbol, "scan") == 0)
ch = 'j';
else
ch = 'i';

else if (charClass == 11 || charClass == 12)
ch = 'n';

else if (charClass == 3)
{
for (int i = 0; i < 10; i++)
if (strcmp(symbol, toString(sepchar[i])) == 0)
{
ch = sepchar[i];
}
}

else if (charClass == 4)
{
for (int i = 0; i < 17; i++)
if (strcmp(symbol, ">") == 0 || strcmp(symbol, "<") == 0 || strcmp(symbol, ">=") == 0 || strcmp(symbol, "<=") == 0 || strcmp(symbol, "==") == 0)
ch = 'k';
else if (strcmp(symbol, mathWords[i]) == 0)
{
ch = mathWords[i][0];
break;
}

}

else if (charClass == 5)
ch = 's';

return toString(ch);
}

// Judge class-names of symbols
int type(char ch)
{
for (int i = 0; i < 52; i++)
if (ch == alphabet[i])
return ALPHABET;

for (int i = 0; i < 10; i++)
if (ch == degit[i])
return DEGIT;

for (int i = 0; i < 3; i++)
if (ch == whitespace[i])
return WHITESPACE;

for (int i = 0; i < 10; i++)
if (ch == sepchar[i])
if (ch == '"')
return STRING;
else
return SEPCHAR;

for (int i = 0; i < 9; i++)
if (ch == mathchar[i])
return MATHCHAR;
}

/**
* generate symbolList
*/
char* tokenise(char* symbolList, char* symbol, char* fileName)
{
FILE* fp;
char ch;

//如果没有找到文件,给出提升并退出
if ((fp = fopen(fileName, "rt")) == NULL)
{
printf("没有找到文件,按任意键退出");
getchar();
exit(1);
}

ch = fgetc(fp);
while (ch != EOF)
{
switch (type(ch))
{

case WHITESPACE:
ch = fgetc(fp);
break;

case ALPHABET:
strcat(symbol, toString(ch));
ch = fgetc(fp);
while (type(ch) == 0 || type(ch) == 1)
{
strcat(symbol, toString(ch));
ch = fgetc(fp);
}
strcat(symbolList, token(symbol, ALPHABET));
symbol[0] = '\0';
break;

case DEGIT:
strcat(symbol, toString(ch));
ch = fgetc(fp);
int isFloat = 11;
while (type(ch) == 1)
{
strcat(symbol, toString(ch));
ch = fgetc(fp);
}
if (ch == '.')
{
isFloat = 12;
strcat(symbol, toString(ch));
ch = fgetc(fp);
while (type(ch) == 1)
{
strcat(symbol, toString(ch));
ch = fgetc(fp);
}
}
strcat(symbolList, token(symbol, isFloat));
symbol[0] = '\0';
break;

case MATHCHAR:
strcat(symbol, toString(ch));
ch = fgetc(fp);
if (type(ch) == 4)
{
strcat(symbol, toString(ch));
ch = fgetc(fp);
}
if (strcmp(symbol, "//") == 0)
while (ch != '\n')
ch = fgetc(fp);
else
strcat(symbolList, token(symbol, MATHCHAR));
symbol[0] = '\0';
break;

case SEPCHAR:
strcat(symbol, toString(ch));
ch = fgetc(fp);
strcat(symbolList, token(symbol, SEPCHAR));
symbol[0] = '\0';
break;

case STRING:
ch = fgetc(fp);
while (ch != '"')
{
strcat(symbol, toString(ch));
ch = fgetc(fp);
}
strcat(symbolList, token(symbol, STRING));
ch = fgetc(fp);
symbol[0] = '\0';
break;

default:
printf("ERROR: Unknown Char: %c\n", ch);
ch = fgetc(fp);
break;
}
}

fclose(fp);
strcat(symbolList, "#");

return symbolList;
}

/**
* Judge if an atom in an array
*/
int isIn(char ch, char array[], int len)
{
for (int i = 0; i < len; i++)
{
if (ch == array[i])
return 1;
}
return 0;
}

/**
* take the next symbol
*/
void advance()
{
sym = result[i];
printf("%c", sym);
i++;
}

/**
* error function
*/
void error()
{
printf("error");
exit(0);
}

/**
* define the generation functions
*/

void A();
void A1();
void B();
void C();
void C1();
void D();
void D1();
void E();
void E1();
void F();
void G();
void G1();
void G2();
void G3();
void G4();
void H();
void H1();
void I();
void J();
void K();
void K1();
void K2();
void K3();
void L();
void L1();
void M();
void N();
void O();
void O1();
void P();
void P1();
void P2();
void Q();
void Q1();
void Q2();
void R();
void R1();
void R2();
void R3();
void S();
void S1();
void T();
void T1();

void J()
{
if (sym == 'a')
advance();
else if (sym == 'b')
advance();
else if (sym == 'c')
advance();
else
error();
}

void I()
{
J();
if (sym == 'i')
advance();
else
error();
}

void H1()
{
if (sym == ',')
{
advance();
I();
H1();
}
else if (isIn(sym, FOLLOW_H1, sizeof(FOLLOW_H1)/sizeof(FOLLOW_H1[0])))
;
else
error();
}

void H()
{
I();
H1();
}

void G4()
{
if (sym == '=')
{
advance();
if (sym == '{')
advance();
else
error();
E();
if (sym == '}')
advance();
else
error();
}
else if (isIn(sym, FOLLOW_G4, sizeof(FOLLOW_G4)/sizeof(FOLLOW_G4[0])))
;
else
error();
}

void G3()
{
if (isIn(sym, FIRST_N, sizeof(FIRST_N)/sizeof(FIRST_N[0])))
{
N();
if (sym == ']')
advance();
else
error();
G4();
}
else if (sym == ']')
{
advance();
G4();
}
else
error();
}

void G2()
{
if (isIn(sym, FIRST_H, sizeof(FIRST_H)/sizeof(FIRST_H[1])))
{
H();
if (sym == ')')
advance();
else
error();
}
else if (sym == ')')
advance();
else
error();
}

void G1()
{
if (sym == '=')
{
advance();
N();
}
else if (sym == '(')
{
advance();
G2();
}
else if (sym == '[')
{
advance();
G3();
}
else if (isIn(sym, FOLLOW_G1, sizeof(FOLLOW_G1)/sizeof(FOLLOW_G1[0])))
;
else
error();
}

void G()
{
if (sym == 'i')
{
advance();
G1();
}
else
error();
}


void D1()
{
if (sym == ',')
{
advance();
G();
D1();
}
else if (isIn(sym, FOLLOW_D1, sizeof(FOLLOW_D1)/sizeof(FOLLOW_D1[0])))
;
else
error();
}

void D()
{
G();
D1();
}

void K3()
{
if (sym == ';')
advance();
else if (isIn(sym, FIRST_S, sizeof(FIRST_S)/sizeof(FIRST_S[0])))
{
S();
if (sym == ';')
advance();
else
error();
}
else
error();
}


void K2()
{
if (sym == ';')
advance();
else if (isIn(sym, FIRST_N, sizeof(FIRST_N)/sizeof(FIRST_N[0])))
{
N();
if (sym == ';')
advance();
else
error();
}
else
error();
}

void K()
{
if (isIn(sym, FIRST_J, sizeof(FIRST_J)/sizeof(FIRST_J[0])))
{
J();
D();
if (sym == ';')
advance();
else
error();
}
else if (sym == '{')
{
advance();
L();
if (sym == '}')
advance();
else
error();
}
else if (isIn(sym, FIRST_M, sizeof(FIRST_M)/sizeof(FIRST_M[0])))
M();
else if (sym == 'd')
{
advance();
if (sym == '(')
advance();
else
error();
N();
if (sym == ')')
advance();
else
error();
K();
K1();
}
else if (sym == 'f')
{
advance();
if (sym == '(')
advance();
else
error();
N();
if (sym == ')')
advance();
else
error();
K();
}
else if (sym == 'g')
{
advance();
K2();
}
else if (sym == 'h')
{
advance();
K3();
}
else if (sym == 'j')
{
advance();
T();
if (sym == ';')
advance();
else
error();
}
else
error();
}

void K1()
{
if (sym == 'e')
{
advance();
K();
}
else if (isIn(sym, FOLLOW_K1, sizeof(FOLLOW_K1)/sizeof(FOLLOW_K1[0])))
;
else
error();
}

void L1()
{
if (isIn(sym, FIRST_K, sizeof(FIRST_K)/sizeof(FIRST_K[0])))
{
K();
L1();
}
else if (isIn(sym, FOLLOW_L1, sizeof(FOLLOW_L1)/sizeof(FOLLOW_L1[0])))
;
else
error();
}

void L()
{
K();
L1();
}

void F()
{
if (sym == 'n')
advance();
else if (sym == 's')
advance();
else
error();
}

void E1()
{
if (sym == ',')
{
advance();
F();
E1();
}
else if (isIn(sym, FOLLOW_E1, sizeof(FOLLOW_E1)/sizeof(FOLLOW_E1[0])))
;
else
error();
}

void E()
{
F();
E1();
}



void C1()
{
if (isIn(sym, FIRST_L, sizeof(FIRST_L)/sizeof(FIRST_L[0])))
{
L();
if (sym == '}')
advance();
else
error();
}
else if (sym == '}')
advance();
else
error();
}

void C()
{
if (sym == '{')
{
advance();
C1();
}
else if (sym == ',')
{
advance();
D();
if (sym == ';')
advance();
else
error();
}
else if (sym == ';')
advance();
else
error();
}

void B()
{
J();
G();
C();
}

void A1()
{
if (isIn(sym, FIRST_B, sizeof(FIRST_B)/sizeof(FIRST_B[0])))
{
B();
A1();
}
else if (isIn(sym, FOLLOW_A1, sizeof(FOLLOW_A1)/sizeof(FOLLOW_A1[0])))
;
else
error();
}

void A()
{
B();
A1();
}

void M()
{
if (sym == ';')
advance();
else if (isIn(sym, FIRST_N, sizeof(FIRST_N)/sizeof(FIRST_N[0])))
{
N();
if (sym == ';')
advance();
else
error();
}
else
error();
}

void N()
{
O();
}

void O()
{
P();
O1();
}

void O1()
{
if (sym == 'k')
{
advance();
P();
O1();
}
else if (isIn(sym, FOLLOW_O1, sizeof(FOLLOW_O1)/sizeof(FOLLOW_O1[0])))
;
else
error();
}

void P()
{
Q();
P2();
}

void P1()
{
if (sym == '+')
{
advance();
Q();
}
else if (sym == '-')
{
advance();
Q();
}
else
error();
}

void P2()
{
if (isIn(sym, FIRST_P1, sizeof(FIRST_P1)/sizeof(FIRST_P1[0])))
{
P1();
P2();
}
else if (isIn(sym, FOLLOW_P2, sizeof(FOLLOW_P2)/sizeof(FOLLOW_P2[0])))
;
else
error;
}

void Q()
{
if (isIn(sym, FIRST_R, sizeof(FIRST_R) / sizeof(FIRST_R[0])))
{
R();
Q2();
}
else if (sym == '-')
{
advance();
R();
Q2();
}
else
error();
}

void Q1()
{
if (sym == '*')
{
advance();
R();
}
else if (sym == '/')
{
advance();
R();
}
else if (sym == '%')
{
advance();
R();
}
else
error();
}

void Q2()
{
if (isIn(sym, FIRST_Q1, sizeof(FIRST_Q1) / sizeof(FIRST_Q1[0])))
{
Q1();
Q2();
}
else if (isIn(sym, FOLLOW_Q2, sizeof(FOLLOW_Q2) / sizeof(FOLLOW_Q2[0])))
;
else
error();
}

void R()
{
if (sym == 'i')
{
advance();
R1();
}
else if (sym == '(')
{
advance();
N();
}
else if (sym == 'n')
advance();
else if (sym == 's')
advance();
else
error();
}

void R1()
{
if (sym == '(')
{
advance();
R2();
}
else if (sym == 'l')
advance();
else if (sym == '=')
{
advance();
N();
}
else if (sym == '[')
{
advance();
N();
if (sym == ']')
advance();
else
error();
R3();
}
else if (isIn(sym, FOLLOW_R1, sizeof(FOLLOW_R1) / sizeof(FOLLOW_R1[0])))
;
else
error();
}

void R2()
{
if (isIn(sym, FIRST_S, sizeof(FIRST_S) / sizeof(FIRST_S[0])))
{
S();
if (sym == ')')
advance();
else
error();
}
else if (sym == ')')
advance();
else
error();
}

void R3()
{
if (sym == '=')
{
advance();
N();
}
else if (isIn(sym, FOLLOW_R3, sizeof(FOLLOW_R3) / sizeof(FOLLOW_R3[0])))
;
else
error();
}

void S()
{
N();
S1();
}

void S1()
{
if (sym == ',')
{
advance();
N();
S1();
}
else if (isIn(sym, FOLLOW_S1, sizeof(FOLLOW_S1) / sizeof(FOLLOW_S1[0])))
;
else
error();
}

void T()
{
if (sym == 'i')
{
advance();
T1();
}
else
error;
}

void T1()
{
if (sym == ',')
{
advance();
if (sym == 'i')
advance();
else
error();
T1();
}
else if (isIn(sym, FOLLOW_T1, sizeof(FOLLOW_T1) / sizeof(FOLLOW_T1[0])))
;
else
error();
}

int main()
{
char* symbolList[6200];
symbolList[0] = '\0';
result[0] = '\0';

//char fileName[40];
char* symbol[20];
symbol[0] = '\0';

//printf("请输入源文件路径(不超过40个字符):");
//scanf("%s", &fileName);
char* fileName = "F:\\编译技术实验\\实验2\\test.c";
strcat(result, tokenise(symbolList, symbol, fileName));

advance();
A();
if (sym != '#')
error();

return 0;
}
0%