forked from Wilfred/babyc
-
Notifications
You must be signed in to change notification settings - Fork 2
/
babyc_parse.y
253 lines (229 loc) · 7 KB
/
babyc_parse.y
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
%{
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "../syntax.h"
#include "../stack.h"
#define YYSTYPE char*
int yyparse(void);
int yylex();
void yyerror(const char *str)
{
fprintf(stderr,"error: %s\n",str);
}
int yywrap()
{
return 1;
}
extern FILE *yyin;
Stack *syntax_stack;
%}
%token INCLUDE HEADER_NAME
%token TYPE IDENTIFIER RETURN NUMBER
%token OPEN_BRACE CLOSE_BRACE
%token IF WHILE
%token LESS_OR_EQUAL
/* Operator associativity, least precedence first.
* See http://en.cppreference.com/w/c/language/operator_precedence
*/
%left '='
%left '<'
%left '+'
%left '-'
%left '*'
%nonassoc '!'
%nonassoc '~'
%%
program:
function program
{
Syntax *top_level_syntax;
if (stack_empty(syntax_stack)) {
top_level_syntax = top_level_new();
} else if (((Syntax *)stack_peek(syntax_stack))->type != TOP_LEVEL) {
top_level_syntax = top_level_new();
} else {
top_level_syntax = stack_pop(syntax_stack);
}
list_push(top_level_syntax->top_level->declarations,
stack_pop(syntax_stack));
stack_push(syntax_stack, top_level_syntax);
}
|
;
function:
TYPE IDENTIFIER '(' parameter_list ')' OPEN_BRACE block CLOSE_BRACE
{
Syntax *current_syntax = stack_pop(syntax_stack);
// TODO: assert current_syntax has type BLOCK.
stack_push(syntax_stack, function_new((char*)$2, current_syntax));
}
;
parameter_list:
nonempty_parameter_list
|
;
nonempty_parameter_list:
TYPE IDENTIFIER ',' parameter_list
|
TYPE IDENTIFIER
;
block:
statement block
{
/* Append to the current block, or start a new block. */
Syntax *block_syntax;
if (stack_empty(syntax_stack)) {
block_syntax = block_new(list_new());
} else if (((Syntax *)stack_peek(syntax_stack))->type != BLOCK) {
block_syntax = block_new(list_new());
} else {
block_syntax = stack_pop(syntax_stack);
}
list_push(block_syntax->block->statements, stack_pop(syntax_stack));
stack_push(syntax_stack, block_syntax);
}
|
;
argument_list:
nonempty_argument_list
|
{
// Empty argument list.
stack_push(syntax_stack, function_arguments_new());
}
;
nonempty_argument_list:
expression ',' nonempty_argument_list
{
Syntax *arguments_syntax;
if (stack_empty(syntax_stack)) {
// This should be impossible, we shouldn't be able to
// parse this on its own.
assert(false);
} else if (((Syntax *)stack_peek(syntax_stack))->type != FUNCTION_ARGUMENTS) {
arguments_syntax = function_arguments_new();
} else {
arguments_syntax = stack_pop(syntax_stack);
}
list_push(arguments_syntax->function_arguments->arguments, stack_pop(syntax_stack));
stack_push(syntax_stack, arguments_syntax);
}
|
expression
{
// TODO: find a way to factor out the duplication with the above.
if (stack_empty(syntax_stack)) {
// This should be impossible, we shouldn't be able to
// parse this on its own.
assert(false);
}
Syntax *arguments_syntax = function_arguments_new();
list_push(arguments_syntax->function_arguments->arguments, stack_pop(syntax_stack));
stack_push(syntax_stack, arguments_syntax);
}
;
statement:
RETURN expression ';'
{
Syntax *current_syntax = stack_pop(syntax_stack);
stack_push(syntax_stack, return_statement_new(current_syntax));
}
|
IF '(' expression ')' OPEN_BRACE block CLOSE_BRACE
{
// TODO: else statements.
Syntax *then = stack_pop(syntax_stack);
Syntax *condition = stack_pop(syntax_stack);
stack_push(syntax_stack, if_new(condition, then));
}
|
WHILE '(' expression ')' OPEN_BRACE block CLOSE_BRACE
{
Syntax *body = stack_pop(syntax_stack);
Syntax *condition = stack_pop(syntax_stack);
stack_push(syntax_stack, while_new(condition, body));
}
|
TYPE IDENTIFIER '=' expression ';'
{
Syntax *init_value = stack_pop(syntax_stack);
stack_push(syntax_stack, define_var_new((char*)$2, init_value));
}
|
expression ';'
{
// Nothing to do, we have the AST node already.
}
;
expression:
NUMBER
{
stack_push(syntax_stack, immediate_new(atoi((char*)$1)));
free($1);
}
|
IDENTIFIER
{
stack_push(syntax_stack, variable_new((char*)$1));
}
|
IDENTIFIER '=' expression
{
Syntax *expression = stack_pop(syntax_stack);
stack_push(syntax_stack, assignment_new((char*)$1, expression));
}
|
'~' expression
{
Syntax *current_syntax = stack_pop(syntax_stack);
stack_push(syntax_stack, bitwise_negation_new(current_syntax));
}
|
'!' expression
{
Syntax *current_syntax = stack_pop(syntax_stack);
stack_push(syntax_stack, logical_negation_new(current_syntax));
}
|
expression '+' expression
{
Syntax *right = stack_pop(syntax_stack);
Syntax *left = stack_pop(syntax_stack);
stack_push(syntax_stack, addition_new(left, right));
}
|
expression '-' expression
{
Syntax *right = stack_pop(syntax_stack);
Syntax *left = stack_pop(syntax_stack);
stack_push(syntax_stack, subtraction_new(left, right));
}
|
expression '*' expression
{
Syntax *right = stack_pop(syntax_stack);
Syntax *left = stack_pop(syntax_stack);
stack_push(syntax_stack, multiplication_new(left, right));
}
|
expression '<' expression
{
Syntax *right = stack_pop(syntax_stack);
Syntax *left = stack_pop(syntax_stack);
stack_push(syntax_stack, less_than_new(left, right));
}
|
expression LESS_OR_EQUAL expression
{
Syntax *right = stack_pop(syntax_stack);
Syntax *left = stack_pop(syntax_stack);
stack_push(syntax_stack, less_or_equal_new(left, right));
}
|
IDENTIFIER '(' argument_list ')'
{
Syntax *arguments = stack_pop(syntax_stack);
stack_push(syntax_stack, function_call_new((char*)$1, arguments));
}
;