-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathAST.h
More file actions
337 lines (299 loc) · 6.86 KB
/
AST.h
File metadata and controls
337 lines (299 loc) · 6.86 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
/**
* Copyright (C) 2017 ARCS lab - All Rights Reserved
* You may use, distribute and modify this code under the
* terms of the ARCS license
*
* You should have received a copy of the ARCS license with
* this file. If not, please write to: jhpark@arcs.skku.edu
*
* Freely use this source code, but not allowed for any
* commercial uses.
*/
#ifndef AST_H
#define AST_H
typedef char bool;
#define true 1
#define false 0
/**
* Before you started..
*
* This file is a header file to implement the Abstract Syntax Tree(AST).
* You have to use the following structs as the nodes of the tree.
* This file will be included in bison implementation and tree walker.
* There are some informations that helps you using this header easly.
* So we recommend you to read carefully not olny this comment,
* but also those written in each line.
*
* First of all, all nodes are designed to target the visitor model.
* There are two models of tree walkers; visitor and listener.
* In visitor model, the developer controls the order of tree walks one by one.
* You are developer in this case.
* For example, when the tree walker program meets "Expr - Expr",
* you have to make the program visit the right-hand side first at this time.
*
* The next information is how to implement "List" structs.
* All structs of List is implemented in linked list.
* The variable named "prev" connect between node.
* The reason not using "next" variable is related to the execution model of Bison.
* Bison tool is designed for visiting leaf node first.
* It means that the parser will stack the nodes up while generating AST.
*/
typedef enum
{eInt, eFloat, eClass} Type_e;
typedef enum
{eExpr, eAssign, eRet, eWhile, eDo, eFor, eIf, eCompound, eSemi} Stmt_e;
typedef enum
{eOper, eRef, eIntnum, eFloatnum} Expr_e;
typedef enum
{eUn, eAddi, eMult, eRela, eEqlt, eBracket} Oper_e;
typedef enum
{eVar, eCall} Ref_e;
typedef enum
{eNegative} Unop_e;
typedef enum
{ePlus, eMinus} Addi_e;
typedef enum
{eMul, eDiv} Mult_e;
typedef enum
{eLT, eGT, eLE, eGE} Rela_e;
typedef enum
{eEQ, eNE} Eqlt_e;
typedef enum
{eNon, eAsInt, eAsFloat} Assign_e;
// Program := (ClassList)? (ClassMethod)? MainFunc
struct Program {
struct Class *_class;
struct ClassMethodDef *classMethodDef;
struct MainFunc *mainFunc;
};
// ClassList := (Class)+
// Class := class id { (private : Member)? (public : Member)? }
struct Class {
char *id;
struct Member *priMember;
struct Member *pubMember;
struct Class *prev;
};
// Member := (VarDeclList)? (MethodDeclList)? (MethodDefList)?
struct Member {
struct VarDecl *varDecl;
struct MethodDecl *methodDecl;
struct MethodDef *methodDef;
};
// VarDeclList := (VarDecl)+
// VarDecl := Type Ident (= (intnum|floatnum))? ;
struct VarDecl {
struct Type *type;
struct Ident *ident;
Assign_e assignType;
union {
int intnum;
float floatnum;
} assigner;
struct VarDecl *prev;
};
// MethodDeclList := (MethodDecl)+
// MethodDecl := Type id ( (ParamList)? ) ;
struct MethodDecl {
char *id;
struct Type *type;
struct Param *param;
struct MethodDecl *prev;
};
// MethodDefList := (MethodDef)+
// MethodDef := Type id ( (ParamList)? ) CompoundStmt
struct MethodDef {
char *id;
struct Type *type;
struct Param *param;
struct CompoundStmt *compoundStmt;
struct MethodDef *prev;
};
// ClassMethodList := (ClassMethodDef)+
// ClassMethodDef := Type id :: id ( (ParamList)? ) CompoundStmt
struct ClassMethodDef {
struct Type *type;
char *className;
char *methodName;
struct Param *param;
struct CompoundStmt *compoundStmt;
struct ClassMethodDef *prev;
};
// MainFunc := int main ( ) CompoundStmt
struct MainFunc {
struct CompoundStmt *compoundStmt;
};
// ParamList := Param (, Param)*
// Param := Type Ident
struct Param {
struct Type *type;
struct Ident *ident;
struct Param *prev;
};
// Ident := id
// | id [ intnum ]
struct Ident {
char *id;
int len; // 0 if scalar
};
// Type := int
// | float
// | id
struct Type {
char *id; // NULL unless class type
Type_e e;
};
// CompoundStmt := { (VarDeclList)? (StmtList)? }
struct CompoundStmt {
struct VarDecl *varDecl;
struct Stmt *stmt;
};
// StmtList := (Stmt)+
// Stmt := ExprStmt
// | AssignStmt
// | RetStmt
// | WhileStmt
// | DoStmt
// | ForStmt
// | IfStmt
// | CompoundStmt
// | ;
struct Stmt {
Stmt_e e;
union {
struct ExprStmt *exprStmt;
struct AssignStmt *assignStmt;
struct RetStmt *retStmt;
struct WhileStmt *whileStmt;
struct DoStmt *doStmt;
struct ForStmt *forStmt;
struct IfStmt *ifStmt;
struct CompoundStmt *compoundStmt;
} type;
struct Stmt *prev;
};
// ExprStmt := Expr ;
struct ExprStmt {
struct Expr *expr;
};
// AssignStmt := RefVarExpr = Expr ;
struct AssignStmt {
struct RefVarExpr *refVarExpr;
struct Expr *expr;
};
// RetStmt := return (Expr)? ;
struct RetStmt {
struct Expr *expr;
};
// WhileStmt := while ( Expr ) Stmt
struct WhileStmt {
struct Expr *cond;
struct Stmt *body;
};
// DoStmt := do Stmt while ( Expr ) ;
struct DoStmt {
struct Expr *cond;
struct Stmt *body;
};
// ForStmt := for ( Expr ; Expr ; Expr ) Stmt
struct ForStmt {
struct Expr *init, *cond, *incr;
struct Stmt *body;
};
// IfStmt := if ( Expr ) Stmt (else Stmt)?
struct IfStmt {
struct Expr *cond;
struct Stmt *ifBody;
struct Stmt *elseBody;
};
// Expr := OperExpr
// | RefExpr
// | intnum
// | floatnum
struct Expr {
Expr_e e;
union {
struct OperExpr *operExpr;
struct RefExpr *refExpr;
int intnum;
float floatnum;
} type;
};
// OperExpr := unop Expr
// | Expr addiop Expr
// | Expr multop Expr
// | Expr relaop Expr
// | Expr eqltop Expr
// | ( Expr )
struct OperExpr {
Oper_e e;
union {
struct UnOp *un;
struct AddiOp *addi;
struct MultOp *mult;
struct RelaOp *rela;
struct EqltOp *eqlt;
struct Expr *bracket;
} type;
};
// RefExpr := RefVarExpr
// | RefCallExpr
struct RefExpr {
Ref_e e;
union {
struct RefVarExpr *refVarExpr;
struct RefCallExpr *refCallExpr;
} type;
};
// RefVarExpr := (RefExpr .)? IdentExpr
struct RefVarExpr {
struct RefExpr *refExpr;
struct IdentExpr *identExpr;
};
// RefCallExpr := (RefExpr .)? CallExpr
struct RefCallExpr {
struct RefExpr *refExpr;
struct CallExpr *callExpr;
};
// IdentExpr := id [ Expr ]
// | id
struct IdentExpr {
char *id;
struct Expr *expr; // NULL if scalar
};
// CallExpr := id ( (ArgList)? )
struct CallExpr {
char *id;
struct Arg *arg;
};
// ArgList := Expr (, Expr)*
struct Arg {
struct Expr *expr;
struct Arg *prev;
};
/** Following definitions are additional structs for OperExpr. **/
struct UnOp {
Unop_e e;
struct Expr *expr;
};
struct AddiOp {
Addi_e e;
struct Expr *lhs;
struct Expr *rhs;
};
struct MultOp {
Mult_e e;
struct Expr *lhs;
struct Expr *rhs;
};
struct RelaOp {
Rela_e e;
struct Expr *lhs;
struct Expr *rhs;
};
struct EqltOp {
Eqlt_e e;
struct Expr *lhs;
struct Expr *rhs;
};
#endif