/
语法分析.cpp
177 lines (174 loc) · 3.06 KB
/
语法分析.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
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <string.h>
#include <ctype.h>
using namespace std;
void AVE();
void EVE();
void TVE();
void E1VE();
void T1VE();
void FVE();
void VVE();
char Slice[50],n='1';
char Table[50][3];
int Sign,symbolly;
int List_n=0;
void AVE()
{
VVE();
if(Slice[symbolly]==':'&&Slice[symbolly+1]=='=')
{
symbolly=symbolly+2;
EVE();
printf("%s:=%s",Table[List_n-2],Table[List_n-1]);
printf(" (:=,%s,-,%s)\n",Table[List_n-1],Table[List_n-2]);
}
else
{
printf("The assignment Symbol spelling mistakes!\n");
Sign=1;
exit(0);
}
}
void VVE()
{
if(islower(Slice[symbolly]))
{
Table[List_n][0]=Slice[symbolly];
Table[List_n][1]='\0';
List_n=List_n+1;
symbolly=symbolly+1;
}
else
{
printf("Operand Errors!\n");
Sign=1;
exit(0);
}
}
void EVE() //E -> TE'
{
if(Sign==0)
{
TVE();
E1VE();
}
}
void TVE()
{
if(Sign==0)
{
FVE();
T1VE();
}
}
void E1VE()
{
int pie;
if(Sign==0)
{
if(Slice[symbolly] == '+'||Slice[symbolly]=='-')
{
pie=symbolly;
symbolly=symbolly+1;
TVE();
char chr[3];
chr[0]='T';
chr[1]=n;
chr[2]='\0';
if(Slice[pie]=='+')
{
printf("%s:=%s+%s",chr,Table[List_n-2],Table[List_n-1]); //输出三地址代码
printf(" (+,%s,%s,%s)\n", Table[List_n-2],Table[List_n-1],chr); //输出四元式
}
else
{
printf("%s:=%s-%s",chr,Table[List_n-2],Table[List_n-1]); //输出三地址代码
printf(" (-,%s,%s,%s)\n", Table[List_n-2],Table[List_n-1],chr); //输出四元式
}
strcpy(Table[List_n-2],chr);
n=n+1;
List_n--;
E1VE();
}
}
}
void T1VE()
{
int pie;
if(Sign==0)
{
if(Slice[symbolly]=='*'||Slice[symbolly] =='/')
{
pie=symbolly;
symbolly++;
FVE();
char chr[3];
chr[0]='T';
chr[1]=n;
chr[2]='\0';
if(Slice[pie] == '*')
{
printf("%s:=%s*%s",chr,Table[List_n-2],Table[List_n-1]);
printf(" (*,%s,%s,%s)\n", Table[List_n-2],Table[List_n-1],chr);
}
else
{
printf("%s:=%s/%s",chr,Table[List_n-2],Table[List_n-1]);
printf(" (/,%s,%s,%s)\n", Table[List_n-2],Table[List_n-1],chr);
}
strcpy(Table[List_n-2],chr);
List_n--;
n=n+1;
T1VE();
}
}
}
void FVE()
{
if(Sign==0)
{
if(Slice[symbolly]=='(')
{
symbolly=symbolly+1;
EVE();
if(Slice[symbolly]==')')
symbolly=symbolly+1;
else
{
Sign=1;
printf("ERROR!\n");
exit(0);
}
}
else if(islower(Slice[symbolly]))
{
VVE();
}
else
{
Sign=1;
printf("ERROR!\n");
exit(0);
}
}
}
int main()
{
Sign = 0;
symbolly=0;
scanf("%s",&Slice);
if(Slice[0] == '\0')
{
return 0;
}
AVE();
if(Slice[symbolly]!='\0'&&Sign==0)
{
printf("ERROR!\n");
exit(0);
}
return 0;
}