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
|
%{
#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include "node.h"
static void yyerror(const char*);
int yylex(void);
static enum operator addop_to_oper(const char *op);
static enum operator mulop_to_oper(const char *op);
static enum operator relop_to_oper(const char *op);
static enum operator boolop_to_oper(const char *op);
extern int lineno;
struct node *root_node;
%}
%start start
%token ID NUM INT VOID IF ELSE WHILE FOR RETURN PTR
%token DEREF ADDROF NEGATE NOT ADDOP MULOP RELOP BOOLOP ASSIGN
%left ASSIGN
%left BOOLOP
%left RELOP
%left ADDOP
%left MULOP
%left NOT NEGATE DEREF ADDROF
%type <id> ID NUM ADDOP MULOP RELOP BOOLOP
%type <node> toplevel toplevel_decl var_decl func_decl parameter_list parameter block
%type <node> statement statement_list open_statement matched_statement other_statement
%type <node> expression atom_expr expression_list
%type <type> type INT VOID
%union {
char *id;
struct node *node;
struct type *type;
}
%destructor { free($$); } <id>
%destructor { node_delete_recursive($$); } <node>
%%
start: toplevel {
root_node = $1;
} ;
toplevel: toplevel_decl toplevel {
$$ = node_make_2(N_LIST, $1, $2);
}
| toplevel_decl {
$$ = $1;
} ;
toplevel_decl: var_decl | func_decl ;
var_decl: type ID ASSIGN expression ';' {
$$ = node_make_1(N_VAR_DECL_INIT, $4);
$$->rtype = $1;
$$->name = $2;
}
| type ID ';' {
$$ = node_make_0(N_VAR_DECL);
$$->rtype = $1;
$$->name = $2;
} ;
func_decl: type ID '(' parameter_list ')' block {
$$ = node_make_2(N_FUNC_DECL, $4, $6);
$$->rtype = $1;
$$->name = $2;
} ;
type: type PTR { $$ = type_ptr($1); }
| INT { $$ = type_int(16); }
| VOID { $$ = type_void(); } ;
parameter_list: parameter {
$$ = node_make_2(N_LIST, $1, node_make_0(N_LIST_END));
}
| parameter ',' parameter_list {
$$ = node_make_2(N_LIST, $1, $3);
} ;
parameter: type ID {
$$ = node_make_0(N_VAR_DECL);
$$->rtype = $1;
$$->name = $2;
} ;
block: '{' statement_list '}' {
$$ = node_make_1(N_BLOCK, $2);
} ;
statement_list: statement {
$$ = node_make_2(N_LIST, $1, node_make_0(N_LIST_END));
}
| statement statement_list {
$$ = node_make_2(N_LIST, $1, $2);
} ;
statement: open_statement | matched_statement ;
open_statement: IF '(' expression ')' statement {
$$ = node_make_3(N_IF, $3, $5, node_make_0(N_LIST_END));
}
| IF '(' expression ')' matched_statement ELSE open_statement {
$$ = node_make_3(N_IF, $3, $5, $7);
}
| WHILE '(' expression ')' open_statement {
$$ = node_make_2(N_WHILE, $3, $5);
}
/*| FOR '(' statement ';' expression ';' statement ')' open_statement {
$$ = node_make_1(N_BLOCK,
node_make_list(
$3, node_make_2(N_WHILE, $5, node_make_list($9, $7))));
}*/ ;
matched_statement:
IF '(' expression ')' matched_statement ELSE matched_statement {
$$ = node_make_3(N_IF, $3, $5, $7);
}
| WHILE '(' expression ')' matched_statement {
$$ = node_make_2(N_WHILE, $3, $5);
}
/*| FOR '(' statement ';' expression ';' statement ')' matched_statement {
$$ = node_make_1(N_BLOCK,
node_make_list(
$3, node_make_2(N_WHILE, $5, node_make_list($9, $7))));
}*/
| other_statement ;
other_statement:
var_decl | expression ';' | block
| RETURN ';' {
$$ = node_make_0(N_RETURN);
}
| RETURN expression ';' {
$$ = node_make_1(N_RETURNV, $2);
} ;
expression: atom_expr
| NOT expression { $$ = node_make_1(N_UNOP, $2); $$->oper = OP_NOT; }
| NEGATE expression { $$ = node_make_1(N_UNOP, $2); $$->oper = OP_NEG; }
| DEREF expression { $$ = node_make_1(N_UNOP, $2); $$->oper = OP_DEREF; }
| ADDROF expression { $$ = node_make_1(N_UNOP, $2); $$->oper = OP_ADDROF; }
| expression ADDOP expression {
$$ = node_make_2(N_BINOP, $1, $3);
$$->oper = addop_to_oper($2);
free($2);
}
| expression MULOP expression {
$$ = node_make_2(N_BINOP, $1, $3);
$$->oper = mulop_to_oper($2);
free($2);
}
| expression RELOP expression {
$$ = node_make_2(N_BINOP, $1, $3);
$$->oper = relop_to_oper($2);
free($2);
}
| expression BOOLOP expression {
$$ = node_make_2(N_BINOP, $1, $3);
$$->oper = boolop_to_oper($2);
free($2);
}
| atom_expr ASSIGN expression {
$$ = node_make_2(N_BINOP, $1, $3);
$$->oper = OP_ASSIGN;
} ;
atom_expr: NUM {
$$ = node_make_0(N_NUM);
$$->value = strtol($1, NULL, 10);
free($1);
}
| ID {
$$ = node_make_0(N_VAR);
$$->name = $1;
}
| '(' expression ')' {
$$ = $2;
}
| ID '(' expression_list ')' {
$$ = node_make_1(N_CALL, $3);
$$->name = $1;
}
| atom_expr '[' expression ']' {
$$ = node_make_1(N_UNOP, node_make_2(N_BINOP, $1, $3));
$$->child2->oper = OP_ADD;
$$->oper = OP_DEREF;
} ;
expression_list: expression {
$$ = node_make_2(N_LIST, $1, node_make_0(N_LIST_END));
}
| expression ',' expression_list {
$$ = node_make_2(N_LIST, $1, $3);
} ;
%%
static void yyerror(const char *s) {
fprintf(stderr, "Parse error: %s\n", s);
exit(1);
}
static enum operator addop_to_oper(const char *op) {
if (strcmp(op, "+") == 0) return OP_ADD;
else if (strcmp(op, "-") == 0) return OP_SUB;
else assert(false);
}
static enum operator mulop_to_oper(const char *op) {
if (strcmp(op, "*") == 0) return OP_MUL;
else if (strcmp(op, "/") == 0) return OP_DIV;
else if (strcmp(op, "%") == 0) return OP_MOD;
else assert(false);
}
static enum operator relop_to_oper(const char *op) {
if (strcmp(op, "==") == 0) return OP_EQ;
else if (strcmp(op, "!=") == 0) return OP_NEQ;
else if (strcmp(op, "<") == 0) return OP_LT;
else if (strcmp(op, ">") == 0) return OP_GT;
else if (strcmp(op, "<=") == 0) return OP_LEQ;
else if (strcmp(op, ">=") == 0) return OP_GEQ;
else assert(false);
}
static enum operator boolop_to_oper(const char *op) {
if (strcmp(op, "&&") == 0) return OP_AND;
else if (strcmp(op, "||") == 0) return OP_OR;
else assert(false);
}
/* vim:et:ts=4:sw=4
*/
|
