-
Notifications
You must be signed in to change notification settings - Fork 1
/
parser.cpp
291 lines (255 loc) · 6.32 KB
/
parser.cpp
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
#include "parser.hpp"
std::map<int, std::string> Parsing::types;
char Parsing::buf[BUF_SZ];
shared_ptr<ProgASTNode> Parser::program(){
auto res = make_shared<ProgASTNode>();
while(peek() == T_INT || peek() == T_VOID || peek() == T_DEF){
if(peek() == T_DEF)
res->append(decfunc());
else if(peek() == T_INT || peek() == T_VOID)
res->append(decvar());
else
unexpected();
}
expect(EOF);
return res;
}
shared_ptr<TypeASTNode> Parser::type(){
if(peek() == T_INT) {
consume(T_INT);
return make_shared<TypeASTNode>(make_shared<ASTNode>("int"));
}
else if(peek() == T_VOID) {
consume(T_VOID);
return make_shared<TypeASTNode>(make_shared<ASTNode>("void"));
}
else unexpected();
throw runtime_error("parsing recursion error");
}
shared_ptr<DecvarASTNode> Parser::decvar(){
auto t = type();
expect(T_ID);
auto id = consume_node<IdASTNode>();
auto var = make_shared<VarASTNode>(id, t);
shared_ptr<DecvarASTNode> res;
if(peek() == '='){
consume('=');
res = make_shared<DecvarASTNode>(var, expr());
} else {
res = make_shared<DecvarASTNode>(var);
}
consume(';');
return res;
}
shared_ptr<DecfuncASTNode> Parser::decfunc(){
consume(T_DEF);
auto t = type();
expect(T_ID);
auto id = consume_node<IdASTNode>();
auto var = make_shared<VarASTNode>(id, t);
auto list = make_shared<ParamsASTNode>();
consume('(');
if(peek() != ')')
list = params();
consume(')');
consume('{');
shared_ptr<BlockASTNode> code = block();
consume('}');
return make_shared<DecfuncASTNode>(var, list, code);
}
shared_ptr<ParamsASTNode> Parser::params(){
auto res = make_shared<ParamsASTNode>();
res->append(params1());
while(peek() == ','){
consume(',');
res->append(params1());
}
return res;
}
shared_ptr<VarASTNode> Parser::params1(){
auto t = type();
expect(T_ID);
return make_shared<VarASTNode>(consume_node<IdASTNode>(), t);
}
shared_ptr<BlockASTNode> Parser::block(){
auto res = make_shared<BlockASTNode>();
while(peek() == T_INT || peek() == T_VOID)
res->append_declaration(decvar());
while(peek() != '}')
res->append_statement(statement());
return res;
}
shared_ptr<ASTNode> Parser::statement(){
if(peek() == T_IF)
return conditional();
else if(peek() == T_WHILE)
return loop();
else if(peek() == T_RETURN){
auto res = returns();
consume(';');
return res;
} else if(peek() == T_BREAK || peek() == T_CONTINUE){
if(peek() == T_BREAK){
consume(T_BREAK);
consume(';');
return make_shared<BreakASTNode>();
} else{
consume(T_CONTINUE);
consume(';');
return make_shared<ContinueASTNode>();
}
} else if(peek() == T_ID){
consume(T_ID);
if(peek() == '('){
unconsume();
auto res = funccall();
consume(';');
return res;
} else {
unconsume();
auto res = assign();
consume(';');
return res;
}
} else unexpected();
throw runtime_error("parsing recursion error");
}
shared_ptr<WhileASTNode> Parser::loop(){
consume(T_WHILE);
consume('(');
auto ex = expr();
consume(')');
consume('{');
auto code = block();
consume('}');
return make_shared<WhileASTNode>(ex, code);
}
shared_ptr<IfASTNode> Parser::conditional(){
consume(T_IF);
consume('(');
auto ex = expr();
consume(')');
consume('{');
auto code = block();
consume('}');
if(peek() == T_ELSE){
consume(T_ELSE);
consume('{');
auto code2 = block();
consume('}');
return make_shared<IfASTNode>(ex, code, code2);
} else {
return make_shared<IfASTNode>(ex, code);
}
}
shared_ptr<ReturnASTNode> Parser::returns(){
consume(T_RETURN);
if(peek() != ';')
return make_shared<ReturnASTNode>(expr());
else
return make_shared<ReturnASTNode>();
}
shared_ptr<AssignASTNode> Parser::assign(){
expect(T_ID);
auto id = consume_node<IdASTNode>();
consume('=');
return make_shared<AssignASTNode>(id, expr());
}
shared_ptr<ASTNode> Parser::expr(){
auto res = expr0();
while(peek() == T_OR){
auto op = consume_node<ASTNode>();
res = make_shared<BinASTNode>(res, expr0(), op);
}
return res;
}
shared_ptr<ASTNode> Parser::expr0(){
auto res = expr1();
while(peek() == T_AND){
auto op = consume_node<ASTNode>();
res = make_shared<BinASTNode>(res, expr1(), op);
}
return res;
}
shared_ptr<ASTNode> Parser::expr1(){
auto res = expr2();
while(peek() == T_EQ || peek() == T_NEQ){
auto op = consume_node<ASTNode>();
res = make_shared<BinASTNode>(res, expr2(), op);
}
return res;
}
shared_ptr<ASTNode> Parser::expr2(){
auto res = expr3();
while(peek() == '<' || peek() == '>'
|| peek() == T_LEQ || peek() == T_GEQ){
auto op = consume_node<ASTNode>();
res = make_shared<BinASTNode>(res, expr3(), op);
}
return res;
}
shared_ptr<ASTNode> Parser::expr3(){
auto res = expr4();
while(peek() == '+' || peek() == '-'){
auto op = consume_node<ASTNode>();
res = make_shared<BinASTNode>(res, expr4(), op);
}
return res;
}
shared_ptr<ASTNode> Parser::expr4(){
auto res = expr5();
while(peek() == '*' || peek() == '/'){
auto op = consume_node<ASTNode>();
res = make_shared<BinASTNode>(res, expr5(), op);
}
return res;
}
shared_ptr<ASTNode> Parser::expr5(){
if(peek() == '-' || peek() == '!'){
auto op = consume_node<ASTNode>();
return make_shared<UnASTNode>(expr5(), op);
} else if(peek() == '('){
consume('(');
auto res = expr();
consume(')');
return res;
} else if(peek() == T_DEC){
return consume_node<DecASTNode>();
} else if(peek() == T_ID){
return expr_name();
} else unexpected();
throw runtime_error("parsing recursion error");
}
shared_ptr<ASTNode> Parser::expr_name(){
consume(T_ID);
if(peek() == '('){
unconsume();
return funccall();
} else {
unconsume();
return expr_id();
}
}
shared_ptr<IdASTNode> Parser::expr_id(){
return consume_node<IdASTNode>();
}
shared_ptr<CallASTNode> Parser::funccall(){
expect(T_ID);
auto id = consume_node<IdASTNode>();
auto ar = make_shared<ArgsASTNode>();
consume('(');
if(peek() != ')'){
ar = args();
}
consume(')');
return make_shared<CallASTNode>(id, ar);
}
shared_ptr<ArgsASTNode> Parser::args(){
auto res = make_shared<ArgsASTNode>();
res->append(expr());
while(peek() == ','){
consume();
res->append(expr());
}
return res;
}