-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsemantic.c
More file actions
343 lines (285 loc) · 8.05 KB
/
semantic.c
File metadata and controls
343 lines (285 loc) · 8.05 KB
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
#include "semantic.h"
#include "ast.h"
/************************ Build the symbol table ************************/
void initTable()
{
varHead = (Var *)malloc(sizeof(Var));
varHead->next = NULL;
varTail = varHead;
funcHead = (Func *)malloc(sizeof(Func));
funcHead->next = NULL;
funcTail = funcHead;
pNum = 1;
add_var("write");
funcDefine(-3, G_iVarCurIndex, 0);
add_var("write_param");
pNum = 0;
add_var("read");
funcDefine(-2, G_iVarCurIndex, 0);
add_var("read_param");
strucHead = (Struc *)malloc(sizeof(Struc));
strucHead->next = NULL;
strucTail = strucHead;
}
void destroyTable()
{
Var* pVar;
Func* pFun;
Struc* pStruc;
while(varHead != NULL){
pVar = varHead->next;
free(varHead);
varHead = pVar;
}
while(funcHead != NULL){
pFun = funcHead->next;
free(funcHead);
funcHead = pFun;
}
while(strucHead != NULL){
pStruc = strucHead->next;
free(strucHead);
strucHead = pStruc;
}
}
/*=================Variable symbol table==============*/
void varTable(int index, int deminsion, int *size)
{
Var *pVar = (Var *)malloc(sizeof(Var));
pVar->nameIndex = index;
pVar->deminsion = deminsion;
for(int i = 0; i < deminsion; i++)
pVar->size[deminsion - i] = size[i];
deminsion = 0;
pVar->level = -1;
pVar->next = varHead->next;
varHead->next = pVar;
//printf("%d %s\n", temp->index, G_Var[temp->index].mark);
}
void addType(int type){
Var* pVar = varHead->next;
int i;
for(i = 0; i< listNum && pVar!=NULL; i++){
pVar->type = type;
pVar = pVar->next;
}
decNum += listNum;
listNum = 0;
}
void addLevel(int level){
Var* pVar = varHead->next;
int i;
for(i = 0; i< decNum && pVar!=NULL; i++){
pVar->level = level;
pVar = pVar->next;
}
decNum = 0;
}
Var* varFind(int index)
{
Var* pVar = varHead->next;
while(pVar != NULL){
if(!strcmp(G_Var[pVar->nameIndex].mark, G_Var[index].mark)){
return pVar; //return 1 while existing
}
pVar = pVar->next;
}
return NULL;
}
int varType(int index)
{
Var* pVar = (Var *)malloc(sizeof(Var));
pVar = varHead->next;
while(pVar != NULL){
if(!strcmp(G_Var[pVar->nameIndex].mark, G_Var[index].mark))
return pVar->type;
pVar = pVar->next;
}
return -1;
}
int varDeminsion(int index)
{
Var* pVar = (Var *)malloc(sizeof(Var));
pVar = varHead->next;
while(pVar != NULL){
if(!strcmp(G_Var[pVar->nameIndex].mark, G_Var[index].mark))
return pVar->deminsion;
pVar = pVar->next;
}
return -1;
}
int sameLevel(int index)
{
Var* pVar = varHead->next;
while(pVar != NULL){
if(!strcmp(G_Var[pVar->nameIndex].mark, G_Var[index].mark) && pVar->level == -1)
return 1;
pVar = pVar->next;
}
return 0;
}
/*=================Function symbol table==============*/
void funcDeclare(int type, int index, int line)
{
Func *pFunc = (Func *)malloc(sizeof(Func));
pFunc->tag = 1;
pFunc->type = type;
pFunc->nameIndex = index;
pFunc->line = line;
pFunc->pnum = pNum;
pNum = 0; //Clear the number of arguments
funcTail->next = pFunc;
funcTail = pFunc;
pFunc->next = NULL;
}
void funcDefine(int type, int index, int line)
{
Func *pFunc = (Func *)malloc(sizeof(Func));
pFunc->tag = 2;
pFunc->type = type;
pFunc->nameIndex = index;
pFunc->line = line;
pFunc->pnum = pNum;
pNum = 0; //Clear the number of arguments
if(pFunc->type!=0 && rtype!=0 && rtype != pFunc->type){
error = true;
printf("Semantic Error at Line %d: Type mismatched for return.\n", yylineno);
}
funcTail->next = pFunc;
funcTail = pFunc;
pFunc->next = NULL;
}
Func* funcFind(int index)
{
int flag=0;
Func* pFun = funcHead->next;
while(pFun!=NULL){
if(!strcmp(G_Var[pFun->nameIndex].mark, G_Var[index].mark))
return pFun; //return 1 while existing
pFun = pFun->next;
}
return NULL;
}
/* Find whether there is a function that's only declaration no definition*/
void undefFunc()
{
Func* pFun = funcHead->next;
while(pFun != NULL){
if(pFun->tag == 1){
error = true;
printf("Semantic Error at Line %d: Undefined function \"%s\".\n", pFun->line, G_Var[pFun->nameIndex].mark);
}
pFun = pFun->next;
}
}
int funcType(int index)
{
Func* pFun = funcHead->next;
while(pFun != NULL){
if(!strcmp(G_Var[pFun->nameIndex].mark, G_Var[index].mark))
return pFun->type;
pFun = pFun->next;
}
return -1;
}
int paraNum(int index)
{
Func* pFun = funcHead->next;
while(pFun != NULL){
if(!strcmp(G_Var[pFun->nameIndex].mark, G_Var[index].mark))
return pFun->pnum;
pFun = pFun->next;
}
return -1;
}
/*==================Struct symbol table==============*/
void strucTable(int num,...)
{
va_list valist;
Struc *pStruc = (Struc *)malloc(sizeof(Struc));/
Node *temp = (Node *)malloc(sizeof(Node));
pStruc->memNum = memNum;
memNum = 0;
va_start(valist, num); // Initialize parameters which number is num
temp = va_arg(valist, Node*); // Take the second node in the variable length parameter list
pStruc->nameIndex = temp->index;
strucTail->next = pStruc;
strucTail = pStruc;
pStruc->next = NULL;
}
Struc* strucFind(int index)
{
Struc* pStruc = strucHead->next;
while(pStruc != NULL){
if(!strcmp(G_Var[pStruc->nameIndex].mark, G_Var[index].mark))
return pStruc;
pStruc = pStruc->next;
}
return NULL;
}
int strucMem(int type, int index){
int i;
Struc* pStruc = strucHead->next;
while(pStruc != NULL){
if(!strcmp(G_Var[pStruc->nameIndex].mark, G_Var[type].mark)){
for(i = 1; i <= pStruc->memNum; i++){
// printf("%s %s\n\n\n\n", G_Var[pStruc->nameIndex + i].mark, G_Var[index].mark);
if(!strcmp(G_Var[pStruc->nameIndex + i].mark, G_Var[index].mark))
return 1;
}
}
pStruc = pStruc->next;
}
return 0;
}
int strucMatch(int type1, int type2)
{
int i = 0, num = 0;
Struc* pStruc1 = strucHead->next;
Struc* pStruc2 = strucHead->next;
for(; pStruc1 != NULL; pStruc1 = pStruc1->next){
for(pStruc2 = pStruc1->next; pStruc2 != NULL; pStruc2 = pStruc2->next){
if(pStruc1->memNum == pStruc2->memNum){
num = pStruc1->memNum;
for(i = 1; i <= num; i++){
//printf("%d %s %s %d %d\n\n\n\n", num, G_Var[pStruc1->nameIndex + i].mark, G_Var[pStruc2->nameIndex + i].mark, varType(pStruc1->nameIndex + i), varType(pStruc2->nameIndex + i));
if(varType(pStruc1->nameIndex + i) != varType(pStruc2->nameIndex + i))
return 0;
}
if(i > num)
return 1;
}
}
}
return 0;
}
/* Get the size of the structure */
int structSize(Struc* pStruc)
{
int count = 0;
for(int i = 1; i <= pStruc->memNum; i++){
Var *pVar = varFind(pStruc->nameIndex + i);
if(pVar->size == 0)
count +=4;
else{
for(int j = 0; j < pVar->deminsion; j++)
count += pVar->size[j] * 4;
}
}
return count;
}
/* Get the offset of a domain (which must be present in the structure) from the head within the structure. */
int structOffset(Struc* pStruc, int index){
int count = 0;
for(int i = 1; i <= pStruc->memNum; i++){
Var *pVar = varFind(pStruc->nameIndex + i);
if(pVar->deminsion == 0)
count += 4;
else{
for(int j = 0; j < pVar->deminsion; j++)
count += pVar->size[j] * 4;
}
if(!strcmp(G_Var[pVar->nameIndex].mark, G_Var[index].mark))
return count;
}
}