-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsemantic.c
245 lines (200 loc) · 5.13 KB
/
semantic.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
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "list.h" //order matters
#include "tree.h"
#include "symtab.h"
#include "semantic.h"
#include "y.tab.h" //list of constants
// check that an identifier exists when used
list_t *semantic_lookup( scope_t *top_scope, char *name ){
list_t *p = global_scope_search( top_scope, name );
if ( p == NULL ){
fprintf( stderr, "ERROR: name(%s) used but undeclared\n", name );
exit(1);
}
return p;
}
//Set all types in a list of identifiers
void semantic_set_type( tree_t *id_list, int type_val ){ //visit all leaves, and insert
if ( id_list == NULL ) return;
tree_t *left, *right;
left = id_list->left;
right = id_list->right;
if (left == NULL && right == NULL ){ //bottom node
id_list->attribute.sval->type = type_val; //pointer into symbol table
fprintf( stderr, "[SET_TYPE: %s, %d]\n", id_list->attribute.sval->name, id_list->attribute.sval->type );
}
//set type of right child (ID)
else if( right != NULL ){
right->attribute.sval->type = type_val; //pointer into symbol table
fprintf( stderr, "[SET_TYPE: %s, %d]\n", right->attribute.sval->name, right->attribute.sval->type );
semantic_set_type(left, type_val );
}
}
//returns the type of a tree
int type_of( tree_t *t ){
if( t == NULL ) return TYPE_ERROR;
int left_type, right_type;
switch( t->type ){
case ID:
return t->attribute.sval->type; //not recommended
break;
//could be ADDOP, MULOP, etc
case INUM:
return INTEGRAL;
break;
case RNUM:
return RATIONAL;
break;
case ADDOP:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in ADDOP\n");
exit(1);
}
return left_type;
case MULOP:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in MULOP\n");
exit(1);
}
return left_type;
case RELOP:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in RELOP\n");
exit(1);
}
return left_type;
/*
case LT:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in LT\n");
exit(1);
}
return left_type;
case LE:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in LE\n");
exit(1);
}
return left_type;
case GT:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in GT\n");
exit(1);
}
return left_type;
case GE:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in GE\n");
exit(1);
}
return left_type;
case EQ:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in EQ\n");
exit(1);
}
return left_type;
case NE:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in NE\n");
exit(1);
}
return left_type;
case PLUS:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in PLUS\n");
exit(1);
}
return left_type;
case MINUS:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in MINUS\n");
exit(1);
}
return left_type;
case OR:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in OR\n");
exit(1);
}
return left_type;
case STAR:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in STAR\n");
exit(1);
}
return left_type;
case SLASH:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in SLASH\n");
exit(1);
}
return left_type;
case DIV:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in DIV\n");
exit(1);
}
return left_type;
case MOD:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in MOD\n");
exit(1);
}
return left_type;
case AND:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in AND\n");
exit(1);
}
return left_type;
case NOT:
left_type = type_of(t->left);
right_type = type_of(t->right);
if ( left_type != right_type ){
fprintf( stderr, "ERROR: type mismatch in NOT\n");
exit(1);
}
return left_type;
*/
default:
return TYPE_ERROR;
break;
}
}