-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathast.hpp
More file actions
400 lines (319 loc) · 14.2 KB
/
Copy pathast.hpp
File metadata and controls
400 lines (319 loc) · 14.2 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
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
#ifndef AST_H
#define AST_H
#include "utils.hpp"
#include "parser.hpp"
namespace ast{
enum OperatorType {
GT_OP, // Binary Greater Than
GEQ_OP, // Binary Greater Than Equal To
LT_OP, // Binary Less Than
LEQ_OP, // Binary Less Than Equal To
NEQ_OP, // Binary Inequality
EQ_OP, // Binary Equality
MUL_OP, // Binary Multiplication
ADD_OP, // Binary Add
DIV_OP, // Binary Division
SUB_OP, // Binary Subtraction
POW_OP, // Binary Exponentiation
MOD_OP, // Binary Modulo
OR_OP, // Binary Or
AND_OP, // Binary And
XOR_OP, // Binary Xor
XAND_OP, // Binary Xand
LSHIFT_OP, // Binary Left Shift Operator
RSHIFT_OP, // Binary Right Shift Operator
ARRACC_OP, // Binary Operator for Array Access
UNEG_OP, // Unary Neg
UNOT_OP, // Unary Not
PTRREF_OP, // Unary Reference
PTRDEREF_OP, // Unary Pointer Dereferencing
};
enum Access{
CONST,
VAR
};
class AtomicASTNode;
class AtomicASTNode : public ASTNode {
public:
virtual types::ATOMTYPES dataType() const = 0;
// AtomicASTNode& const_resolve() override {
// return *this;
// }
};
class Identifier: public AtomicASTNode {
public:
std::string idenName;
std::unique_ptr<types::Type> boundDataType;
ast::Access access;
int id, scopeId;
Identifier(std::string idenName): idenName(idenName) {};
Identifier(const Identifier& other) {
idenName = other.idenName;
boundDataType = types::gtc(*(other.boundDataType));
access = other.access;
id = other.id;
scopeId = other.scopeId;
}
void bind(std::unique_ptr<types::Type>&& boundDataType, Access access, int id, int scopeId) {
this->boundDataType = std::move(boundDataType);
this->access = access;
this->id = id;
this->scopeId = scopeId;
}
NodeType type() const override {
return IDEN_AST;
}
types::ATOMTYPES dataType() const override {
return types::ATOMTYPES::UNRESOLVED;
};
};
class NullValue : public AtomicASTNode {
std::unique_ptr<types::Type> dt;
public:
NullValue() : dt(std::make_unique<types::Type>(types::Null())) {}
NullValue(std::unique_ptr<types::Type>&& dt) : dt(std::move(dt)) {}
NodeType type() const override {
return NULL_AST;
}
types::ATOMTYPES dataType() const override {
return types::NULLV;
}
// functions for more information on what the enclosing data type is (dt)
};
class BoolValue : public AtomicASTNode {
public:
std::unique_ptr<types::Boolean> val;
BoolValue(std::unique_ptr<types::Boolean>&& val): val(std::move(val)) {}
NodeType type() const override {
return BOOL_AST;
}
types::ATOMTYPES dataType() const override {
return types::BOOL;
}
};
class CharValue : public AtomicASTNode {
public:
std::unique_ptr<types::Character> val;
CharValue(std::unique_ptr<types::Character>&& val): val(std::move(val)) {}
NodeType type() const override {
return CHAR_AST;
}
types::ATOMTYPES dataType() const override {
return types::CHAR_8;
}
};
// When storing the numerical values, it is important that the value we store has a type.
// We shall, by default, analyse the numerical token and assign it a type that takes the
// least amount of memory.
class NumValue : public AtomicASTNode {
public:
std::unique_ptr<types::NumberType> val;
NumValue(std::unique_ptr<types::NumberType>&& val): val(std::move(val)) {
}
NodeType type() const override {
return NUM_AST;
}
types::ATOMTYPES dataType() const override {
return val->atomicName();
};
};
class ArrValue : public ASTNode {
public:
std::vector<std::unique_ptr<ast::ASTNode>> elems;
ArrValue() {}
void addElem(std::unique_ptr<ast::ASTNode>&& elem) {
elems.push_back(std::move(elem));
}
NodeType type() const override {
return ARR_AST;
}
};
class FunctionCall : public ASTNode {
public:
std::unique_ptr<ASTNode> name;
std::vector<std::unique_ptr<ASTNode>> params;
FunctionCall(std::unique_ptr<ASTNode>&& name): name(std::move(name)) {};
NodeType type() const override {
return FUNCALL_AST;
}
void addParam(std::unique_ptr<ASTNode>&& param){
params.push_back(std::move(param));
}
};
class UnaryOperator : public ASTNode {
public:
OperatorType op;
std::unique_ptr<ASTNode> child;
UnaryOperator(OperatorType operation, std::unique_ptr<ASTNode>&& c): op(operation), child(std::move(c)) {};
NodeType type() const override {
return UOP_AST;
}
};
class BinaryOperator : public ASTNode {
public:
OperatorType op;
std::unique_ptr<ASTNode> leftChild, rightChild;
BinaryOperator(OperatorType operation, std::unique_ptr<ASTNode>&& lc, std::unique_ptr<ASTNode>&& rc): op(operation), leftChild(std::move(lc)), rightChild(std::move(rc)) {};
NodeType type() const override {
return BOP_AST;
}
};
class Assign : public ASTNode {
public:
std::unique_ptr<ASTNode> var;
std::unique_ptr<ASTNode> val;
Assign(std::unique_ptr<ASTNode>&& var, std::unique_ptr<ASTNode>&& val): var(std::move(var)), val(std::move(val)) {};
NodeType type() const override {
return ASSIGN_AST;
}
};
class LetConst: public ASTNode {
public:
std::unique_ptr<types::Type> myType;
std::unique_ptr<ASTNode> var;
std::unique_ptr<ASTNode> val;
LetConst(std::unique_ptr<ASTNode>&& var, std::unique_ptr<types::Type>&& type, std::unique_ptr<ASTNode>&& val): var(std::move(var)), myType(std::move(type)), val(std::move(val)) {};
NodeType type() const override {
return LETCONST_AST;
}
};
class LetVar: public ASTNode {
public:
std::unique_ptr<types::Type> myType;
std::unique_ptr<ASTNode> var;
std::unique_ptr<ASTNode> val;
LetVar(std::unique_ptr<ASTNode>&& var, std::unique_ptr<types::Type>&& type): var(std::move(var)), myType(std::move(type)), val(std::make_unique<NullValue>()) {};
LetVar(std::unique_ptr<ASTNode>&& var, std::unique_ptr<types::Type>&& type, std::unique_ptr<ASTNode>&& val): var(std::move(var)), myType(std::move(type)), val(std::move(val)) {};
NodeType type() const override {
return LETVAR_AST;
}
};
class LetArray: public ASTNode {
public:
std::unique_ptr<types::ArrayDeclType> myType;
std::unique_ptr<ASTNode> name;
Access access;
std::unique_ptr<ASTNode> val;
NodeType type() const override {
return LETARR_AST;
}
LetArray(std::unique_ptr<types::ArrayDeclType>&& type, std::unique_ptr<ASTNode>&& name, Access& access): myType(std::move(type)), name(std::move(name)), access(access), val(std::make_unique<NullValue>()) {};
LetArray(std::unique_ptr<types::ArrayDeclType>&& type, std::unique_ptr<ASTNode>&& name, Access& access, std::unique_ptr<ASTNode>&& val): myType(std::move(type)), name(std::move(name)), access(access), val(std::move(val)) {};
};
class LetFun: public ASTNode {
public:
std::unique_ptr<types::Type> retType;
std::unique_ptr<ASTNode> name;
std::vector<std::pair<std::unique_ptr<types::Type>, std::unique_ptr<ASTNode>>> params;
std::unique_ptr<ASTNode> body;
LetFun(std::unique_ptr<types::Type>&& retType, std::unique_ptr<ASTNode>&& name, std::unique_ptr<ASTNode>&& body): retType(std::move(retType)), name(std::move(name)), body(std::move(body)) {};
NodeType type() const override {
return LETFUN_AST;
}
void addParam(std::unique_ptr<types::Type>&& typ, std::unique_ptr<ASTNode>&& param){
params.push_back({std::move(typ), std::move(param)});
LOG("params.back().first->name()")
LOG(params.back().first->name())
}
};
class Log: public ASTNode {
public:
std::unique_ptr<ASTNode> val;
Log(std::unique_ptr<ASTNode>&& val): val(std::move(val)) {};
NodeType type() const override {
return LOG_AST;
}
};
class Return: public ASTNode {
public:
std::unique_ptr<ASTNode> val;
Return(std::unique_ptr<ASTNode>&& val): val(std::move(val)) {};
NodeType type() const override {
return RET_AST;
}
};
class Conditional: public ASTNode {
public:
std::unique_ptr<ASTNode> cond;
std::unique_ptr<ASTNode> thenBody;
std::unique_ptr<ASTNode> elseBody;
Conditional(std::unique_ptr<ASTNode>&& cond, std::unique_ptr<ASTNode>&& thenBody): cond(std::move(cond)), thenBody(std::move(thenBody)), elseBody(std::make_unique<NullValue>()) {};
Conditional(std::unique_ptr<ASTNode>&& cond, std::unique_ptr<ASTNode>&& thenBody, std::unique_ptr<ASTNode>&& elseBody): cond(std::move(cond)), thenBody(std::move(thenBody)), elseBody(std::move(elseBody)) {};
NodeType type() const override {
return COND_AST;
}
};
class Loop: public ASTNode {
public:
std::unique_ptr<ASTNode> cond;
std::unique_ptr<ASTNode> body;
Loop(std::unique_ptr<ASTNode>&& cond, std::unique_ptr<ASTNode>&& body): cond(std::move(cond)), body(std::move(body)) {};
NodeType type() const override {
return LOOP_AST;
}
};
class Block: public ASTNode {
public:
std::vector<std::unique_ptr<ASTNode>> decls;
Block() : decls(std::vector<std::unique_ptr<ASTNode>>()) {};
void addDecl(std::unique_ptr<ASTNode>&& decl){
decls.push_back(std::move(decl));
}
NodeType type() const override {
return BLOCK_AST;
}
};
class Prog: public ASTNode {
public:
std::vector<std::unique_ptr<ASTNode>> decls;
Prog() : decls(std::vector<std::unique_ptr<ASTNode>>()) {};
void addDecl(std::unique_ptr<ASTNode>&& decl){
decls.push_back(std::move(decl));
}
NodeType type() const override {
return PROG_AST;
}
};
std::unique_ptr<ASTNode> parseTreeToAST(parser::parseTree &tree);
std::unique_ptr<ASTNode> convertProg(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertBlock(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertDecl(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertStmt(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertLoop(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertCond(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertRetStmt(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertLogStmt(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertExpStmt(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertFunDecl(int node, parser::parseTree &tree);
std::pair<std::unique_ptr<types::Type>, std::unique_ptr<ASTNode>> convertDeclParam(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertVarDecl(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertConstDecl(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertVal(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertAssn(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertLoc(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertExp(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertBinaryOp(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertBinaryOpHelper(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertUnaryOp(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertFunCall(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertUnAmb(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertAtom(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertElse(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertElifs(int node, parser::parseTree &tree, std::unique_ptr<ASTNode> finElse=nullptr);
std::unique_ptr<types::Type> convertDeclType(int node, parser::parseTree &tree);
std::unique_ptr<types::Type> convertAtomType(int node, parser::parseTree &tree);
std::unique_ptr<types::Type> convertFunType(int node, parser::parseTree &tree);
std::vector<std::unique_ptr<types::Type>> convertSigParams(int node, parser::parseTree &tree);
std::unique_ptr<types::Type> convertType(int node, parser::parseTree &tree);
std::unique_ptr<types::Type> convertCompType(int node, parser::parseTree &tree);
std::unique_ptr<types::Type> convertArrType(int node, parser::parseTree &tree);
std::unique_ptr<types::Type> convertPtrType(int node, parser::parseTree &tree);
std::unique_ptr<types::Type> convertArrDeclType(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertPtrDeref(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertArrAcc(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertArr(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertPtr(int node, parser::parseTree &tree);
std::unique_ptr<ASTNode> convertChain(int node, parser::parseTree &tree);
void vizTree(const std::unique_ptr<ASTNode>& node, const std::string &prefix, bool isLast, bool postResolve = false);
}
#endif