-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathast.h
More file actions
180 lines (144 loc) · 3.44 KB
/
Copy pathast.h
File metadata and controls
180 lines (144 loc) · 3.44 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
#ifndef AST_H
#define AST_H
#include <stdbool.h>
#include "token.h"
typedef enum {
AST_MODULE,
AST_BLOCK,
AST_EXPR_STMT,
AST_ASSIGN_STMT,
AST_RETURN_STMT,
AST_IF_STMT,
AST_FOR_STMT,
AST_WHILE_STMT,
AST_FUNCTION_DEF,
AST_CLASS_DEF,
AST_PASS_STMT,
AST_BREAK_STMT,
AST_CONTINUE_STMT,
AST_IMPORT_STMT,
AST_BINARY_EXPR,
AST_UNARY_EXPR,
AST_LITERAL_EXPR,
AST_IDENTIFIER_EXPR,
AST_GROUPING_EXPR,
AST_CALL_EXPR,
AST_MEMBER_EXPR,
AST_LIST_EXPR,
AST_DICT_EXPR,
AST_INDEX_EXPR
} AstNodeType;
typedef struct AstNode AstNode;
typedef struct {
AstNode** items;
int count;
int capacity;
} AstNodeArray;
typedef struct {
Token* items;
int count;
int capacity;
} TokenList;
struct AstNode {
AstNodeType type;
Token token;
const char* sourcePath;
union {
struct {
AstNodeArray statements;
} module;
struct {
AstNodeArray statements;
} block;
struct {
AstNode* expression;
} exprStmt;
struct {
AstNode* target;
AstNode* value;
} assignStmt;
struct {
AstNode* value;
} returnStmt;
struct {
AstNode* condition;
AstNode* thenBlock;
AstNode* elseBranch;
} ifStmt;
struct {
AstNode* target;
AstNode* iterable;
AstNode* body;
} forStmt;
struct {
AstNode* condition;
AstNode* body;
} whileStmt;
struct {
Token name;
TokenList parameters;
AstNode* body;
} functionDef;
struct {
Token name;
AstNode* body;
} classDef;
struct {
Token path;
Token alias;
bool hasAlias;
} importStmt;
struct {
Token op;
AstNode* left;
AstNode* right;
} binaryExpr;
struct {
Token op;
AstNode* operand;
} unaryExpr;
struct {
Token literal;
} literalExpr;
struct {
Token name;
} identifierExpr;
struct {
AstNode* expression;
} groupingExpr;
struct {
AstNode* callee;
AstNodeArray arguments;
} callExpr;
struct {
AstNode* object;
Token member;
} memberExpr;
struct {
AstNodeArray elements;
} listExpr;
struct {
AstNodeArray keys;
AstNodeArray values;
} dictExpr;
struct {
AstNode* object;
AstNode* index;
} indexExpr;
} as;
};
void initAstNodeArray(AstNodeArray* array);
void pushAstNode(AstNodeArray* array, AstNode* node);
void freeAstNodeArray(AstNodeArray* array);
void initTokenList(TokenList* list);
void pushTokenList(TokenList* list, Token token);
void freeTokenList(TokenList* list);
AstNode* newAstNode(AstNodeType type, Token token);
AstNode* makeBinaryNode(Token op, AstNode* left, AstNode* right);
AstNode* makeUnaryNode(Token op, AstNode* operand);
AstNode* makeIdentifierNode(Token name);
AstNode* makeLiteralNode(Token literal);
void annotateAstSourcePath(AstNode* node, const char* sourcePath);
void printAst(const AstNode* node, int depth);
void freeAst(AstNode* node);
#endif