-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathast_visitor.cpp
More file actions
executable file
·268 lines (223 loc) · 6.21 KB
/
ast_visitor.cpp
File metadata and controls
executable file
·268 lines (223 loc) · 6.21 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
#include "node.h"
#include "exceptions.h"
#include "ast.h"
#include "ast_visitor.h"
ASTVisitor::ASTVisitor() {
}
ASTVisitor::~ASTVisitor() {
}
void ASTVisitor::visit_unit(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_variable_declaration(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_struct_type(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_union_type(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_basic_type(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_declarator_list(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_named_declarator(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_pointer_declarator(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_array_declarator(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_function_definition(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_function_declaration(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_function_parameter_list(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_function_parameter(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_statement_list(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_empty_statement(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_expression_statement(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_return_statement(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_return_expression_statement(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_while_statement(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_do_while_statement(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_for_statement(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_if_statement(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_if_else_statement(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_struct_type_definition(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_union_type_definition(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_field_definition_list(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_binary_expression(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_unary_expression(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_postfix_expression(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_conditional_expression(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_cast_expression(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_function_call_expression(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_field_ref_expression(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_indirect_field_ref_expression(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_array_element_ref_expression(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_argument_expression_list(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_variable_ref(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_literal_value(Node *n) {
visit_children(n);
}
void ASTVisitor::visit_implicit_conversion(Node *n) {
visit_children(n);
}
void ASTVisitor::visit(Node *n) {
// assume that any node with a tag value less than 1000
// is a token
if (n->get_tag() < 1000) {
visit_token(n);
return;
}
switch (n->get_tag()) {
case AST_UNIT:
visit_unit(n); break;
case AST_VARIABLE_DECLARATION:
visit_variable_declaration(n); break;
case AST_STRUCT_TYPE:
visit_struct_type(n); break;
case AST_UNION_TYPE:
visit_union_type(n); break;
case AST_BASIC_TYPE:
visit_basic_type(n); break;
case AST_DECLARATOR_LIST:
visit_declarator_list(n); break;
case AST_NAMED_DECLARATOR:
visit_named_declarator(n); break;
case AST_POINTER_DECLARATOR:
visit_pointer_declarator(n); break;
case AST_ARRAY_DECLARATOR:
visit_array_declarator(n); break;
case AST_FUNCTION_DEFINITION:
visit_function_definition(n); break;
case AST_FUNCTION_DECLARATION:
visit_function_declaration(n); break;
case AST_FUNCTION_PARAMETER_LIST:
visit_function_parameter_list(n); break;
case AST_FUNCTION_PARAMETER:
visit_function_parameter(n); break;
case AST_STATEMENT_LIST:
visit_statement_list(n); break;
case AST_EMPTY_STATEMENT:
visit_empty_statement(n); break;
case AST_EXPRESSION_STATEMENT:
visit_expression_statement(n); break;
case AST_RETURN_STATEMENT:
visit_return_statement(n); break;
case AST_RETURN_EXPRESSION_STATEMENT:
visit_return_expression_statement(n); break;
case AST_WHILE_STATEMENT:
visit_while_statement(n); break;
case AST_DO_WHILE_STATEMENT:
visit_do_while_statement(n); break;
case AST_FOR_STATEMENT:
visit_for_statement(n); break;
case AST_IF_STATEMENT:
visit_if_statement(n); break;
case AST_IF_ELSE_STATEMENT:
visit_if_else_statement(n); break;
case AST_STRUCT_TYPE_DEFINITION:
visit_struct_type_definition(n); break;
case AST_UNION_TYPE_DEFINITION:
visit_union_type_definition(n); break;
case AST_FIELD_DEFINITION_LIST:
visit_field_definition_list(n); break;
case AST_BINARY_EXPRESSION:
visit_binary_expression(n); break;
case AST_UNARY_EXPRESSION:
visit_unary_expression(n); break;
case AST_POSTFIX_EXPRESSION:
visit_postfix_expression(n); break;
case AST_CONDITIONAL_EXPRESSION:
visit_conditional_expression(n); break;
case AST_CAST_EXPRESSION:
visit_cast_expression(n); break;
case AST_FUNCTION_CALL_EXPRESSION:
visit_function_call_expression(n); break;
case AST_FIELD_REF_EXPRESSION:
visit_field_ref_expression(n); break;
case AST_INDIRECT_FIELD_REF_EXPRESSION:
visit_indirect_field_ref_expression(n); break;
case AST_ARRAY_ELEMENT_REF_EXPRESSION:
visit_array_element_ref_expression(n); break;
case AST_ARGUMENT_EXPRESSION_LIST:
visit_argument_expression_list(n); break;
case AST_VARIABLE_REF:
visit_variable_ref(n); break;
case AST_LITERAL_VALUE:
visit_literal_value(n); break;
case AST_IMPLICIT_CONVERSION:
visit_implicit_conversion(n); break;
default:
RuntimeError::raise("Unknown AST node tag %d", n->get_tag());
}
}
void ASTVisitor::visit_children(Node *n) {
for (auto i = n->cbegin(); i != n->cend(); ++i) {
visit(*i);
}
}
void ASTVisitor::visit_token(Node *n) {
// default implementation does nothing
}