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
|
#include "sem_check.h"
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "y.tab.h"
#include "pc.h"
extern scope *cur_scope;
void check_id(s, n)
scope *s;
char *n;
{
char buf[100];
if (scope_search(s, n)) {
snprintf(buf, 100, "\"%s\" already defined in scope...\n", n);
yyerror(buf);
}
}
node* check_exists(s, n)
scope *s;
char *n;
{
node *tmp;
char buf[100];
if(!(tmp = scope_search_all(s,n))) {
snprintf(buf, 100, "Cannot find \"%s\"\n", n);
yyerror(buf);
}
return tmp;
}
int check_ret_type(t)
ptree *t;
{
char buf[100];
int type;
ptree *tmp;
if (!t)
fprintf(stderr, "TYPE: %d\n", t->type);
switch (t->type) {
case ID:
if (!(t->attr.nval))
yyerror("Missing ID\n");
return t->attr.nval->var_type;
case ADDOP :
case MULOP :
if (!(t->r && t->l))
yyerror("Missing nodes\n");
if (t->attr.opval == AND || t->attr.opval == OR) {
if(t->l->ret_type == BOOL && t->r->ret_type ==BOOL)
return BOOL;
else {
type = t->l->ret_type == BOOL ?
t->r->ret_type : t->l->ret_type;
snprintf(buf, 100, "Mismached types:"
"Cannot use boolean "
"operator on type %s\n",
pretty_type(type));
break;
}
}
if (t->r->ret_type == t->l->ret_type)
return t->r->ret_type;
else
snprintf(buf, 100, "Mismached types: "
"Type %s "
"cannot be used with type %s\n",
pretty_type(t->r->ret_type),
pretty_type(t->l->ret_type));
break;
case RELOP :
if (!(t->r && t->l))
yyerror("Missing nodes\n");
if (t->r->ret_type == t->l->ret_type)
return BOOL;
else
snprintf(buf, 100, "Mismached types: "
"Type %s "
"cannot be compared to type %s\n",
pretty_type(t->r->ret_type),
pretty_type(t->l->ret_type));
break;
case NOT:
if (t->l && t->l->ret_type == BOOL)
return BOOL;
yyerror("NOT needs bool input\n");
break;
case INUM:
return INT;
case RNUM:
return REAL;
case ASSIGNOP:
if (!(t->r && t->l))
yyerror("Incomplete parse tree\n");
if (t->l->ret_type == t->r->ret_type){
tmp = t->l->type == ARRAY_ACCESS ? t->l->l : t->l;
snprintf(buf, 100, "WHERES THE ERROR\n");
if(!(scope_safe_search(cur_scope,
tmp->attr.nval->name))) {
snprintf(buf, 100, "Cannot find \"%s\"\n",
tmp->attr.nval->name);
break;
} else {
return 1;
}
} else
snprintf(buf, 100, "Mismached types: "
"Cannot assign type %s "
"to variable \"%s\" of type %s\n",
pretty_type(t->r->ret_type),
t->l->attr.nval->name,
pretty_type(t->l->attr.nval->var_type));
break;
case ARRAY_ACCESS:
if (!(t->r && t->l && t->l->attr.nval))
yyerror("Incorrect Array Access\n");
if (t->r->ret_type != INT) {
snprintf(buf, 100, "Cannot access array"
"with type %s\n",
pretty_type(t->r->ret_type));
break;
}
type = t->l->attr.nval->var_type;
if (type == ARRAY - INT || type == ARRAY - REAL)
return ARRAY - type;
snprintf(buf, 100, "%s is not an array (has type: %s)\n",
t->l->attr.nval->name,
pretty_type(type));
break;
case IF:
case WHILE:
if (!(t->r && t->l))
yyerror("Incomplete parse tree\n");
if (t->l->ret_type != BOOL)
yyerror("If condition must be of type BOOL\n");
return 1;
case FOR:
/*
FOR (0)
/ \
TD(0) STATEMENT(0)
/ \
ASSIGNOP(0) INUM(INT)
*/
if (!(t->r && t->l))
yyerror("Missing nodes\n");
if (t->l->ret_type == 1 && t->r->ret_type == 1)
return 1;
snprintf(buf, 100, "Incorrect types in for statement...\n");
break;
case TO:
case DT:
if (!(t->r && t->l))
yyerror("Missing nodes\n");
if (t->l->ret_type == 1 && t->r->ret_type == INT)
return 1;
snprintf(buf, 100, "Incorrect types HERE...\n");
case SUB:
return t->l->ret_type;
break;
case PCALL:
case FCALL:
if (t->l && t->l->attr.nval)
return t->l->attr.nval->var_type;
default:
return -200;
snprintf(buf, 100, "Unknown tree node: %d...\n", t->type);
}
yyerror(buf);
return -1;
}
void check_call(t)
ptree *t;
{
int argc, *argv;
if (!(t && (t->type == FCALL || t->type == PCALL)))
yyerror("Tree is not a function call\n");
if (!(t->l && t->l->attr.nval && t->l->attr.nval->func_info))
yyerror("Incorrect Call Tree\n");
if (!(strcmp(t->l->attr.nval->name, "write") && strcmp(t->l->attr.nval->name, "read")))
return;
argc = t->l->attr.nval->func_info->argc;
if (t->l->attr.nval->func_info->argc != count_args(t->r))
/*TODO add info about expected argument count*/
yyerror("Incorrect argument count");
assert(argv = malloc(sizeof(int) * argc));
get_call_types(t->r, argv, argc);
if (memcmp(argv, t->l->attr.nval->func_info->argv, argc * sizeof(int)))
/*TODO add info on which argument causes error*/
yyerror("Incorrect types in fuction arguments");
free(argv);
argv = NULL;
}
int func_ret(t, name)
ptree *t;
char *name;
{
if (!t)
return 0;
if (t->type == ASSIGNOP && t->l)
if (t->l->type == ID && !strcmp(t->l->attr.nval->name, name))
return 1;
return func_ret(t->l, name) || func_ret(t->r, name);
}
void check_func_return(t,name)
ptree *t;
char *name;
{
char buf[100];
if (!func_ret(t,name)) {
snprintf(buf, 100, "Function %s does not return a value\n",
name);
yyerror(buf);
}
}
|
