-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgrammarTree.cpp
1655 lines (1597 loc) · 35.4 KB
/
grammarTree.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
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
#include "wordAna.h"
#include "grammerTree.h"
#include "derror.h"
#include "funcStack.h"
#include "runStack.h"
#include <iostream>
#include<cstdio>
#include <vector>
#include <stdexcept>
using namespace std;
vector<string> strlist;
vector<int> lnolist; //应该让判断类型与原来的东西分离开
int addN;
void* globalAddr;
bool findit;
treetype word2treeType(types ori) {
if (ori == IDENFR)
return rawIDENFR;
else if (ori == INTCON)
return rawINTCON;
else if (ori == CHARCON)
return rawCHARCON;
else if (ori == STRCON)
return rawSTRCON;
else if (ori == CONSTTK)
return rawCONSTTK;
else if (ori == INTTK)
return rawINTTK;
else if (ori == CHARTK)
return rawCHARTK;
else if (ori == VOIDTK)
return rawVOIDTK;
else if (ori == MAINTK)
return rawMAINTK;
else if (ori == IFTK)
return rawIFTK;
else if (ori == ELSETK)
return rawELSETK;
else if (ori == DOTK)
return rawDOTK;
else if (ori == WHILETK)
return rawWHILETK;
else if (ori == FORTK)
return rawFORTK;
else if (ori == SCANFTK)
return rawSCANFTK;
else if (ori == PRINTFTK)
return rawPRINTFTK;
else if (ori == RETURNTK)
return rawRETURNTK;
else if (ori == PLUS)
return rawPLUS;
else if (ori == MINU)
return rawMINU;
else if (ori == MULT)
return rawMULT;
else if (ori == DIV)
return rawDIV;
else if (ori == LSS)
return rawLSS;
else if (ori == LEQ)
return rawLEQ;
else if (ori == GRE)
return rawGRE;
else if (ori == GEQ)
return rawGEQ;
else if (ori == EQL)
return rawEQL;
else if (ori == NEQ)
return rawNEQ;
else if (ori == ASSIGN)
return rawASSIGN;
else if (ori == SEMICN)
return rawSEMICN;
else if (ori == COMMA)
return rawCOMMA;
else if (ori == LPARENT)
return rawLPARENT;
else if (ori == RPARENT)
return rawRPARENT;
else if (ori == LBRACK)
return rawLBRACK;
else if (ori == RBRACK)
return rawRBRACK;
else if (ori == LBRACE)
return rawLBRACE;
else if (ori == RBRACE)
return rawRBRACE;
else
return NONE;
}
int findUint(vector<treetype>& oriList, int begin) {
try {
if (oriList.at(begin) == rawINTCON) {
std::cout<<"uint"<<endl;
findit = true;
return begin + 1;
}
findit = false;
return begin;
}
catch (out_of_range& exc) {
return begin;
}
}
int findInt(vector<treetype>& oriList, int begin) {
try {
int pos = begin;
if (oriList.at(pos) == rawPLUS || oriList.at(pos) == rawMINU) {
pos++;
}
int posbuf = findUint(oriList, pos);
if (!findit)
return begin;
std::cout<<"int "<<endl;
findit = true;
return posbuf;
}
catch (out_of_range& exc) {
return begin;
}
}
int findConstTk(vector<treetype>& oriList, int begin) {
try {
if (oriList.at(begin) == rawCONSTTK) {
findit = true;
return begin + 1;
}
findit = false;
return begin;
}
catch (out_of_range& exc) {
return begin;
}
}
int findConstDef(vector<treetype>& oriList, int begin) {
try {
datatype tp;
int pos = begin;
if (oriList.at(begin) == rawINTTK) {
tp = datatype::dINT;
pos = begin + 1;
if (oriList.at(pos) != rawIDENFR || oriList.at(pos + 1) != rawASSIGN)
{
findit = false;
return begin;
}
runStack nowenv = myrunStack.top();
myrunStack.pop();
record newone(strlist.at(pos), CONST, tp);
try {
nowenv.writeStack(newone);
}
catch (myexception ex) {
ex.lineno = lnolist.at(begin + 1);
ex.msg = "变量名重定义";
ex.pntMsg();
}
pos += 2;
int posbuf = findInt(oriList, pos);
if (!findit) {
myexception ex('o', lnolist.at(pos), "常量定义后应该为整数");
ex.pntMsg();
myrunStack.push(nowenv);
while (oriList.at(pos) != rawCOMMA && oriList.at(pos) != rawSEMICN &&
lnolist.at(pos) == lnolist.at(pos-1)) pos++;
posbuf = pos;
}
pos = posbuf;
while (oriList.at(pos) == rawCOMMA) {
pos++;
if (oriList.at(pos) != rawIDENFR || oriList.at(pos + 1) != rawASSIGN)
{
myrunStack.push(nowenv);
findit = false;
return begin;
}
record newone(strlist.at(pos), CONST, tp);
try {
nowenv.writeStack(newone);
}
catch (myexception ex) {
ex.lineno = lnolist.at(begin + 1);
ex.msg = "变量名重定义";
ex.pntMsg();
}
pos += 2;
posbuf = findInt(oriList, pos);
if (!findit) {
myexception ex('o', lnolist.at(pos), "常量定义后应该为整数");
ex.pntMsg();
myrunStack.push(nowenv);
while (oriList.at(pos) != rawCOMMA && oriList.at(pos) != rawSEMICN &&
lnolist.at(pos) == lnolist.at(pos - 1)) pos++;
posbuf = pos;
}
pos = posbuf;
}
myrunStack.push(nowenv);
pos--;//这里pos停留在最后匹配到整数上
std::cout<<"constDef "<<endl;
findit = true;
return pos + 1;
}
else if (oriList.at(begin) == rawCHARTK) {
tp = datatype::dCHAR;
pos = begin + 1;
if (oriList.at(pos) != rawIDENFR || oriList.at(pos + 1) != rawASSIGN)
{
findit = false;
return begin;
}
runStack nowenv = myrunStack.top();
myrunStack.pop();
string name = strlist.at(pos);
record newone(name, CONST, tp);
try {
nowenv.writeStack(newone);
}
catch (myexception ex) {
ex.lineno = lnolist.at(begin + 1);
ex.msg = "变量名重定义";
ex.pntMsg();
}
pos = pos + 2;
if (oriList.at(pos) != rawCHARCON) {
myexception ex('o', lnolist.at(pos), "此处必须是字符常量");
ex.pntMsg();
while (oriList.at(pos) != rawCOMMA && oriList.at(pos) != rawSEMICN &&
lnolist.at(pos) == lnolist.at(pos - 1)) pos++;
pos--;
}
pos++;
while (oriList.at(pos) == rawCOMMA) {
pos++;
if (oriList.at(pos) != rawIDENFR || oriList.at(pos + 1) != rawASSIGN)
{
myrunStack.push(nowenv);
findit = false;
return begin;
}
name = strlist.at(pos);
pos = pos + 2;
if (oriList.at(pos) != rawCHARCON) {
myexception ex('o', lnolist.at(pos), "此处必须是字符常量");
ex.pntMsg();
while (oriList.at(pos) != rawCOMMA && oriList.at(pos) != rawSEMICN &&
lnolist.at(pos) == lnolist.at(pos - 1)) pos++;
pos--;
}
pos++;
record newone(name, CONST, tp);
try {
nowenv.writeStack(newone);
}
catch (myexception ex) {
ex.lineno = lnolist.at(begin + 1);
ex.msg = "变量名重定义";
ex.pntMsg();
}
}
myrunStack.push(nowenv);
pos--;//这里pos停留在最后匹配到整数上
std::cout<<"constDef "<<endl;
findit = true;
return pos + 1;
}
else
return begin;
}
catch (out_of_range& exc) {
return begin;
}
}
int findConstDeclare(vector<treetype>& oriList, int begin) {
try {
int pos = findConstTk(oriList, begin);
if (!findit) {
return begin;
}
pos = findConstDef(oriList, pos);
if (!findit) return begin;
if (oriList.at(pos) != rawSEMICN)
{
findit = true;
myexception ex('k', lnolist.at(pos), "应为分号");
ex.pntMsg();
pos--;
}
pos++;
int posbuf = findConstTk(oriList, pos);
while (findit) {
pos = posbuf;
pos = findConstDef(oriList, pos);
if (oriList.at(pos) != rawSEMICN)
{
myexception ex('k', lnolist.at(pos), "应为分号");
ex.pntMsg();
pos--;
}
pos++;
posbuf = findConstTk(oriList, pos);
}
std::cout<<"constDeclare"<<endl;
findit = true;
return pos;
}
catch (out_of_range& exc) {
return begin;
}
}
int findVarDef(vector<treetype>& oriList, int begin) {
try {
runStack nowenv = myrunStack.top();
datatype tp;
if (oriList.at(begin) != rawCHARTK && oriList.at(begin) != rawINTTK) {
findit = false;
return begin;
}
tp = (oriList.at(begin) == rawCHARTK) ? datatype::dCHAR : datatype::dINT;
int pos = begin + 1;
if (oriList.at(pos) != rawIDENFR || oriList.at(pos+1) == rawLPARENT) {
findit = false;
return begin;
}
string name = strlist.at(pos);
pos++;
myrunStack.pop();
if (oriList.at(pos) == rawLBRACK) {
pos++;
int posbuf = findUint(oriList, pos);
int len = -1;
if (!findit) {
myexception ex('i', lnolist.at(pos), "数组定义中下标必须是整数哦");
ex.pntMsg();
pos = posbuf;
while (oriList.at(pos) != rawRBRACK &&
oriList.at(pos) != rawCOMMA &&
oriList.at(pos) != rawSEMICN &&
lnolist.at(pos) == lnolist.at(pos - 1)) {
pos++;
}
}
else {
len = atoi(strlist.at(pos).c_str());
}
pos = posbuf;
if (oriList.at(pos) != rawRBRACK) {
myexception ex('m', lnolist.at(pos), "应为]");
ex.pntMsg();
pos--;
}
arrayTem temp(len, 1, tp, globalAddr);
record newone(name, VAR, dARRAY);
newone.addr = temp;
try {
nowenv.writeStack(newone);
}
catch (myexception ex) {
ex.lineno = lnolist.at(begin + 1);
ex.msg = "变量名重定义";
ex.pntMsg();
}
pos++;
}
else {
record newone(name, VAR, tp);
try {
nowenv.writeStack(newone);
}
catch (myexception ex) {
ex.lineno = lnolist.at(begin + 1);
ex.msg = "变量名重定义";
ex.pntMsg();
}
}
while (oriList.at(pos) == rawCOMMA) {
pos++;
if (oriList.at(pos) != rawIDENFR) {
myrunStack.push(nowenv);
findit = false;
return begin;
}
name = strlist.at(pos);
pos++;
if (oriList.at(pos) == rawLBRACK) {
pos++;
int posbuf = findUint(oriList, pos);
int len = -1;
if (!findit) {
myexception ex('i', lnolist.at(pos), "数组定义中下标必须是整数哦");
ex.pntMsg();
pos = posbuf;
while (oriList.at(pos) != rawRBRACK &&
oriList.at(pos) != rawCOMMA &&
oriList.at(pos) != rawSEMICN &&
lnolist.at(pos) == lnolist.at(pos - 1)) {
pos++;
}
}
else {
len = atoi(strlist.at(pos).c_str());
}
pos = posbuf;
if (oriList.at(pos) != rawRBRACK) {
myexception ex('m', lnolist.at(pos), "应为]");
ex.pntMsg();
pos--;
}
arrayTem temp(len, 1, tp, globalAddr);
record newone(name, VAR, dARRAY);
newone.addr = temp;
try {
nowenv.writeStack(newone);
}
catch (myexception ex) {
ex.lineno = lnolist.at(begin + 1);
ex.msg = "变量名重定义";
ex.pntMsg();
}
pos++;
}
else {
record newone(name, VAR, tp);
try {
nowenv.writeStack(newone);
}
catch (myexception ex) {
ex.lineno = lnolist.at(begin + 1);
ex.msg = "变量名重定义";
ex.pntMsg();
}
}
}
myrunStack.push(nowenv);
std::cout<<"varDef"<<endl;
findit = true;
return pos;//返回值都是一个新的开始
}
catch (out_of_range& exc) {
return begin;
}
}
int findComplexSentence(vector<treetype>& oriList, int begin) {
try {
int pos = findConstDeclare(oriList, begin);
findit = true;
pos = findVarDeclare(oriList, pos);
findit = true;
pos = findSentenceList(oriList, pos);
if (!findit) return begin;
std::cout<<"复合语句 "<<endl;
findit = true;
return pos;
}
catch (out_of_range& exc) {
return begin;
}
}
int findVarDeclare(vector<treetype>& oriList, int begin) {
try {
int posbuf = begin;
int pos = findVarDef(oriList, begin);
if (!findit) return begin;
if (oriList.at(pos) != rawSEMICN)
{
myexception ex('k', lnolist.at(pos), "应为分号");
ex.pntMsg();
pos--;
}
pos++;
posbuf = pos;
pos = findVarDef(oriList, posbuf);
while (findit) {
if (oriList.at(pos) != rawSEMICN)
{
myexception ex('k', lnolist.at(pos), "应为分号");
ex.pntMsg();
pos--;
}
pos++;
posbuf = pos;
pos = findVarDef(oriList, posbuf);
}
std::cout<<"变量声明 "<<endl;
findit = true;
return pos;
}
catch (out_of_range& exc) {
return begin;
}
}
int findDeclareHead(vector<treetype>& oriList, int begin, funcRecord& newF) {
try {
treetype first = oriList.at(begin);
if (first != rawINTTK && first != rawCHARTK) {
findit = false;
return begin;
}
newF.returnT = (first == rawINTTK) ? datatype::dINT: datatype::dCHAR;
if (oriList.at(begin + 1) != rawIDENFR) {
findit = false;
return begin;
}
newF.name = strlist.at(begin + 1);
std::cout<<"声明头部 "<<endl;
findit = true;
return begin + 2;
}
catch (out_of_range& exc) {
return begin;
}
}
int findParamList(vector<treetype>& oriList, int begin, funcRecord& newF, runStack& env) {
try {
int pos = begin;
vector<datatype> paraL;
if (oriList.at(pos) != rawINTTK && oriList.at(pos) != rawCHARTK) {
newF.paraList = paraL;
std::cout<<"参数列表"<<endl;
findit = true;
return pos ;
}
datatype buf = (oriList.at(pos) == rawINTTK) ? datatype::dINT : datatype::dCHAR;
paraL.push_back(buf);
pos++;
if (oriList.at(pos) != rawIDENFR) {
//std::cout << "invalid gramma in paralist, don't know how to deal" << endl;
findit = false;
return begin;
}
record newrec(strlist.at(pos), VAR, buf);
try {
env.writeStack(newrec);
}
catch (myexception ex) {
ex.lineno = lnolist.at(pos);
ex.pntMsg();
}
pos++;
while (oriList.at(pos) == rawCOMMA) {
pos++;
if (oriList.at(pos) != rawINTTK && oriList.at(pos) != rawCHARTK)
{
findit = false;
return begin;
}
buf = (oriList.at(pos) == rawINTTK) ? datatype::dINT : datatype::dCHAR;
paraL.push_back(buf);
pos++;
if (oriList.at(pos) != rawIDENFR) {
findit = false;
return begin;
}
record newrec(strlist.at(pos), VAR, buf);
try {
env.writeStack(newrec);
}
catch (myexception ex) {
ex.lineno = lnolist.at(pos);
ex.pntMsg();
}
pos++;
}
newF.paraList = paraL;
std::cout<<"参数表 "<<endl;
findit = true;
return pos ;
}
catch (out_of_range& exc) {
return begin;
}
}
int findFuncReturnDef(vector<treetype>& oriList, int begin) {
try {
funcRecord newF;
int pos = findDeclareHead(oriList, begin, newF);
if (!findit || oriList.at(pos) != rawLPARENT)
{
findit = false;
return begin;
}
pos++;
runStack nowenv = myrunStack.top();
runStack newenv(&nowenv);
newenv.father = &newF;
pos = findParamList(oriList, pos, newF, newenv); //就算是空的，也必须表示出来吗？？？？？大概是的
if (!findit) return begin;
try {
put_check(newF);
}
catch (myexception ex) {
ex.lineno = lnolist.at(pos - 1);
ex.pntMsg();
}
if (oriList.at(pos) != rawRPARENT) {
myexception ex('l', lnolist.at(pos), "参数表的右括号出现吧！");
ex.pntMsg();
pos--;//为了和原来的代码架构适应
}
if (oriList.at(pos + 1) != rawLBRACE) {
findit = false;
return begin;
}
pos += 2;
myrunStack.push(newenv);
pos = findComplexSentence(oriList, pos);
myrunStack.pop();//不管是不是找到了其语句都要弹出
try {
if (newF.rtN == 0) {
throw myexception('h', lnolist.at(pos - 1), "该函数缺少return 语句");
}
}
catch (myexception ex) {
ex.pntMsg();
}
if (!findit || oriList.at(pos) != rawRBRACE) {
findit = false;
return begin;
}
std::cout<<"有返回值函数定义 "<<endl;
findit = true;
return pos + 1;
}
catch (out_of_range& exc) {
return begin;
}
}
int findSentenceList(vector<treetype>& oriList, int begin) {
try {
int pos = findSentence(oriList, begin);
int posbuf = begin;
while (pos != posbuf) {
posbuf = pos;
pos = findSentence(oriList, posbuf);
}
std::cout<<"语句列 "<<endl;
findit = true;//可以为0次
return pos;
}
catch (out_of_range& exc) {
return begin;
}
}
int findFactor(vector<treetype>& oriList, int begin, datatype &tp) {
try {
int pos = begin;
if (oriList.at(begin) == rawCHARCON) {
tp = datatype::dCHAR;
std::cout<<"因子 "<<endl;
findit = true;
return begin + 1;
}
else if (oriList.at(begin) == rawIDENFR) {
int posbuf = findUseFunc(oriList, begin, tp);
if (!findit) {
runStack nowenv = myrunStack.top();
record rebuf;
try {
rebuf = nowenv.findRecord(strlist.at(begin));
tp = rebuf.typeD;
}
catch (myexception ex) {
tp = dINT;
ex.lineno = lnolist.at(begin);
ex.msg = "未定义的变量";
ex.pntMsg();
}
if (tp == dARRAY) {
tp = dINT; // 计算返回也没有错,当地址来看
//throw myexception('c', lnolist.at(begin + 1), "该变量是一个数组，返回dARRAY可能导致出错");
}
if (oriList.at(begin + 1) == rawLBRACK) {
if (rebuf.typeD != dARRAY) {
/*myexception ex('c', lnolist.at(begin), "虽然名字被定义了，但它不是数组");
ex.pntMsg();*/
tp = dINT;
}
else {
tp = rebuf.addr.tp;
}
datatype tp2;
pos = findExpress(oriList, pos + 2, tp2);
if (!findit) return begin;
if (tp2 != datatype::dINT) {
myexception ex('i', lnolist.at(pos - 1), "数组下标不是整形表达式");
ex.pntMsg();
}
if (oriList.at(pos) != rawRBRACK)
{
myexception ex('m', lnolist.at(pos), "应为]");
ex.pntMsg();
pos--;
}
std::cout << "因子 " << endl;
findit = true;
return pos + 1;
}
else {
std::cout << "因子" << endl;
findit = true;
return pos + 1;
}
}
else {
if (tp == datatype::dVOID) {
//error! 调用了void函数作为因子
}
std::cout<<"因子 "<<endl;
findit = true;
return posbuf ;
}
}
else if (oriList.at(begin) == rawLPARENT) {
pos = begin + 1;
pos = findExpress(oriList, pos, tp);
if (!findit) return begin;
if (oriList.at(pos) != rawRPARENT)
{
myexception ex('l', lnolist.at(pos), "因子缺少）");
ex.pntMsg();
pos--;
}
std::cout<<"因子 "<<endl;
findit = true;
return pos + 1;
}
else {
int posbuf = findInt(oriList, pos);
if (!findit) {
return begin;
}
else {
std::cout<<"因子 "<<endl;
findit = true;
return posbuf ;
}
}
}
catch (out_of_range& exc) {
return begin;
}
}
int findItem(vector<treetype>& oriList, int begin, datatype& tp) {
try {
datatype tpbuf;
int pos = findFactor(oriList, begin, tp);
if (!findit) {
return begin;
}
while (oriList.at(pos) == rawMULT || oriList.at(pos) == rawDIV) {
pos++;
pos = findFactor(oriList, pos, tpbuf);
if (!findit) return begin;
tp = (tpbuf == datatype::dINT) ? datatype::dINT : tp;
}
std::cout << "item" << endl;
findit = true;
return pos ;
}
catch (out_of_range& exc) {
return begin;
}
}
int findExpress(vector<treetype>& oriList, int begin, datatype& tp) {
try {
tp = datatype::dINT;
datatype tpbuf;
int pos = begin;
if (oriList.at(begin) == rawPLUS || oriList.at(begin) == rawMINU) {
pos++;
}
int posbuf = findItem(oriList, pos, tp);
if (!findit) {
findit = false;
return begin;
}
pos = posbuf;
while (oriList.at(pos) == rawPLUS || oriList.at(pos) == rawMINU) {
pos++;
pos = findItem(oriList, pos, tpbuf);
if (findit = false)
return begin; //默认不存在用+-结尾的表达式
tp = (tpbuf == datatype::dINT) ? datatype::dINT : tp;
}
std::cout<<"项 "<<endl;
findit = true;
return pos ;
}
catch (out_of_range& exc) {
return begin;
}
}
int findCondition(vector<treetype>& oriList, int begin) {
try {
int pos = begin;
datatype tp;
pos = findExpress(oriList, pos, tp);
if (!findit) return begin;
if (tp != datatype::dINT) {
myexception ex('f', lnolist.at(pos - 1), "条件中的表达式必须是整形的");
ex.pntMsg();
}
if (oriList.at(pos) >= rawLSS && oriList.at(pos) <= rawNEQ) {
pos++;
pos = findExpress(oriList, pos, tp);
if (!findit) return begin;
if (tp != datatype::dINT) {
myexception ex('f', lnolist.at(pos - 1), "条件中的表达式必须是整形的");
ex.pntMsg();
}
}
std::cout<<"条件 "<<endl;
findit = true;
return pos ;
}
catch (out_of_range& exc) {
return begin;
}
}
int findStep(vector<treetype>& oriList, int begin) {
try {
int pos = begin;
pos = findUint(oriList, begin);
if (findit) {
std::cout<<"步长 "<<endl;
findit = true;
return pos ;
}
return begin;
}
catch (out_of_range& exc) {
return begin;
}
}
int findIfS(vector<treetype>& oriList, int begin) {
try {
if (oriList.at(begin) != rawIFTK || oriList.at(begin + 1) != rawLPARENT) {
findit = false;
return begin;
}
int pos = begin + 2;
pos = findCondition(oriList, pos);
if (!findit) return begin;
if (oriList.at(pos) != rawRPARENT)
{
myexception ex('l', lnolist.at(pos), "if 条件的)");
ex.pntMsg();
pos--;
}
pos++;
pos = findSentence(oriList, pos);
if (!findit)
return begin;
if (oriList.at(pos) == rawELSETK) {
pos++;
pos = findSentence(oriList, pos);
if (!findit)
return begin;
}
std::cout<<"条件语句"<<endl;
findit = true;
return pos ;
}
catch (out_of_range& exc) {
return begin;
}
}
int findWhileS(vector<treetype>& oriList, int begin) {
try {
if (oriList.at(begin) != rawWHILETK || oriList.at(begin + 1) != rawLPARENT)
{
findit = false;
return begin;
}
int pos = begin + 2;
pos = findCondition(oriList, pos);
if (!findit) return begin;
if (oriList.at(pos) != rawRPARENT)
{
myexception ex('l', lnolist.at(pos), "while 条件的)");
ex.pntMsg();
pos--;
}
pos++;
pos = findSentence(oriList, pos);
if (!findit) return begin;
std::cout<<"循环语句 "<<endl;
findit = true;
return pos;
}
catch (out_of_range& exc) {
return begin;
}
}
int findDoS(vector<treetype>& oriList, int begin) {
try {
if (oriList.at(begin) != rawDOTK)
{
findit = false;
return begin;
}
int pos = begin + 1;
pos = findSentence(oriList, pos);
if (!findit)
return begin;
if (oriList.at(pos) != rawWHILETK) {
myexception ex('n', lnolist.at(pos), "do-while缺少while");////////////////////////////????how to jump??
ex.pntMsg();
pos--;
}
if (oriList.at(pos + 1) != rawLPARENT)
{
findit = false;
return begin;
}
pos += 2;
pos = findCondition(oriList, pos);
if (!findit) return begin;
if ( oriList.at(pos) != rawRPARENT)
{
myexception ex('l', lnolist.at(pos), "do 条件的)");
ex.pntMsg();
pos--;
}
std::cout<<"循环语句"<<endl;
findit = true;
return pos + 1;
}
catch (out_of_range& exc) {
return begin;
}
}
int findForS(vector<treetype>& oriList, int begin) {
try {
if (oriList.at(begin) != rawFORTK || oriList.at(begin + 1) != rawLPARENT
|| oriList.at(begin + 2) != rawIDENFR || oriList.at(begin + 3) != rawASSIGN)
{
findit = false;
return begin;
}
runStack nowenv = myrunStack.top();
try {
nowenv.findRecord(strlist.at(begin + 2), false);
}
catch (myexception ex) {
ex.lineno = lnolist.at(begin + 2);
ex.pntMsg();
}
int pos = begin + 4;
datatype tp;
pos = findExpress(oriList, pos, tp);
if (!findit)
return begin;
if (oriList.at(pos) != rawSEMICN)
{
myexception ex('k', lnolist.at(pos), "应为分号");
ex.pntMsg();
pos--;
}
pos++;
pos = findCondition(oriList, pos);
if (!findit) return false;
else if (oriList.at(pos) != rawSEMICN) {
myexception ex('k', lnolist.at(pos), "应为分号");
ex.pntMsg();
pos--;
}
if (oriList.at(pos + 1) != rawIDENFR