-
Notifications
You must be signed in to change notification settings - Fork 0
/
cool.y
343 lines (277 loc) · 10.3 KB
/
cool.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
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
/*
* cool.y
* Parser definition for the COOL language.
*
*/
%{
#include <iostream>
#include "cool-tree.h"
#include "stringtab.h"
#include "utilities.h"
extern char *curr_filename;
/* Locations */
#define YYLTYPE int /* the type of locations */
#define cool_yylloc curr_lineno /* use the curr_lineno from the lexer
for the location of tokens */
extern int node_lineno; /* set before constructing a tree node
to whatever you want the line number
for the tree node to be */
#define YYLLOC_DEFAULT(Current, Rhs, N) \
Current = Rhs[1]; \
node_lineno = Current;
#define SET_NODELOC(Current) \
node_lineno = Current;
/* IMPORTANT NOTE ON LINE NUMBERS
*********************************
* The above definitions and macros cause every terminal in your grammar to
* have the line number supplied by the lexer. The only task you have to
* implement for line numbers to work correctly, is to use SET_NODELOC()
* before constructing any constructs from non-terminals in your grammar.
* Example: Consider you are matching on the following very restrictive
* (fictional) construct that matches a plus between two integer constants.
* (SUCH A RULE SHOULD NOT BE PART OF YOUR PARSER):
plus_consts : INT_CONST '+' INT_CONST
* where INT_CONST is a terminal for an integer constant. Now, a correct
* action for this rule that attaches the correct line number to plus_const
* would look like the following:
plus_consts : INT_CONST '+' INT_CONST
{
// Set the line number of the current non-terminal:
// ***********************************************
// You can access the line numbers of the i'th item with @i, just
// like you acess the value of the i'th exporession with $i.
//
// Here, we choose the line number of the last INT_CONST (@3) as the
// line number of the resulting expression (@$). You are free to pick
// any reasonable line as the line number of non-terminals. If you
// omit the statement @$=..., bison has default rules for deciding which
// line number to use. Check the manual for details if you are interested.
@$ = @3;
// Observe that we call SET_NODELOC(@3); this will set the global variable
// node_lineno to @3. Since the constructor call "plus" uses the value of
// this global, the plus node will now have the correct line number.
SET_NODELOC(@3);
// construct the result node:
$$ = plus(int_const($1), int_const($3));
}
*/
void yyerror(char *s); /* defined below; called for each parse error */
extern int yylex(); /* the entry point to the lexer */
/************************************************************************/
/* DONT CHANGE ANYTHING IN THIS SECTION */
Program ast_root; /* the result of the parse */
Classes parse_results; /* for use in semantic analysis */
int omerrs = 0; /* number of errors in lexing and parsing */
%}
/* A union of all the types that can be the result of parsing actions. */
%union {
Boolean boolean;
Symbol symbol;
Program program;
Class_ class_;
Classes classes;
Feature feature;
Features features;
Formal formal;
Formals formals;
Case case_;
Cases cases;
Expression expression;
Expressions expressions;
char *error_msg;
}
/*
Declare the terminals; a few have types for associated lexemes.
The token ERROR is never used in the parser; thus, it is a parse
error when the lexer returns it.
The integer following token declaration is the numeric constant used
to represent that token internally. Typically, Bison generates these
on its own, but we give explicit numbers to prevent version parity
problems (bison 1.25 and earlier start at 258, later versions -- at
257)
*/
%token CLASS 258 ELSE 259 FI 260 IF 261 IN 262
%token INHERITS 263 LET 264 LOOP 265 POOL 266 THEN 267 WHILE 268
%token CASE 269 ESAC 270 OF 271 DARROW 272 NEW 273 ISVOID 274
%token <symbol> STR_CONST 275 INT_CONST 276
%token <boolean> BOOL_CONST 277
%token <symbol> TYPEID 278 OBJECTID 279
%token ASSIGN 280 NOT 281 LE 282 ERROR 283
/* DON'T CHANGE ANYTHING ABOVE THIS LINE, OR YOUR PARSER WONT WORK */
/**************************************************************************/
/* Complete the nonterminal list below, giving a type for the semantic
value of each non terminal. (See section 3.6 in the bison
documentation for details). */
/* Declare types for the grammar's non-terminals. */
%type <program> program
%type <classes> class_list
%type <class_> class
%type <expression> expr
%type <expressions> expr_list
%type <expressions> args_expr
%type <expression> let_expr
%type <formal> formal
%type <formals> formals
/* You will want to change the following line. */
%type <feature> feature
%type <features> features
%type <features> feature_list
%type <case_> case_branch
%type <cases> cases
/* Precedence declarations go here. */
%right ASSIGN
%left NOT
%nonassoc LE '<' '='
%left '+' '-'
%left '*' '/'
%left ISVOID
%left '~'
%left '@'
%left '.'
%%
/*
Save the root of the abstract syntax tree in a global variable.
*/
program : class_list { @$ = @1; ast_root = program($1); }
;
class_list
: class /* single class */
{ $$ = single_Classes($1);
parse_results = $$; }
| class_list class /* several classes */
{ $$ = append_Classes($1,single_Classes($2));
parse_results = $$; }
;
/* If no parent is specified, the class inherits from the Object class. */
class : CLASS TYPEID '{' feature_list '}' ';'
{ $$ = class_($2,idtable.add_string("Object"),$4,
stringtable.add_string(curr_filename)); }
| CLASS TYPEID INHERITS TYPEID '{' feature_list '}' ';'
{ $$ = class_($2,$4,$6,stringtable.add_string(curr_filename));}
| CLASS TYPEID '{' error '}' ';' { yyclearin; $$ = NULL; }
| CLASS error '{' feature_list '}' ';' { yyclearin; $$ = NULL; }
| CLASS error '{' error '}' ';' { yyclearin; $$ = NULL; }
| CLASS error
| error;
/* Formals */
formals : formal
{ $$ = single_Formals($1); }
| formals ',' formal
{ $$ = append_Formals($1, single_Formals($3)); }
| { $$ = nil_Formals(); };
formal : OBJECTID ':' TYPEID
{ $$ = formal($1,$3); };
/* multiple expressions (separated by semicolons) */
expr_list : expr ';'
{ $$ = single_Expressions($1);}
| expr_list expr ';'
{ $$ = append_Expressions($1,single_Expressions($2));}
| error ';'
{ yyclearin; $$ = NULL; };
/* expression list for arguments (separated by commas) */
args_expr : expr
{ $$ = single_Expressions($1); }
| args_expr ',' expr
{ $$ = append_Expressions($1, single_Expressions($3)); }
| {$$ = nil_Expressions();};
expr : OBJECTID ASSIGN expr
{ $$ = assign($1,$3); }
/* Operators */
| expr '+' expr
{ $$ = plus($1,$3); }
| expr '-' expr
{ $$ = sub($1,$3); }
| expr '*' expr
{ $$ = mul($1,$3); }
| expr '/' expr
{ $$ = divide($1,$3); }
| expr '<' expr
{ $$ = lt($1,$3); }
| expr '=' expr
{ $$ = eq($1,$3); }
| expr LE expr
{ $$ = leq($1,$3); }
| NOT expr
{ $$ = comp($2); }
| '~' expr
{ $$ = neg($2); }
| LET let_expr
{ $$ = $2; }
| CASE expr OF cases ESAC
{ $$ = typcase($2,$4); }
| '{' expr_list '}'
{ $$ = block($2); }
| OBJECTID
{ $$ = object($1); }
| expr '.' OBJECTID '(' args_expr ')'
{ $$ = dispatch($1,$3,$5); }
| expr '@' TYPEID '.' OBJECTID '(' args_expr ')'
{ $$ = static_dispatch($1,$3,$5,$7); }
| OBJECTID '(' args_expr ')'
{ $$ = dispatch(object(idtable.add_string("self")),$1,$3); }
| ISVOID expr
{ $$ = isvoid($2); }
| NEW TYPEID
{ $$ = new_($2); }
| INT_CONST
{ $$ = int_const($1); }
| STR_CONST
{ $$ = string_const($1); }
| BOOL_CONST
{ $$ = bool_const($1); }
/* Conditionals */
| IF expr THEN expr ELSE expr FI
{ $$ = cond($2,$4,$6); }
| WHILE expr LOOP expr POOL
{ $$ = loop($2,$4); }
| '(' expr ')'
{ $$ = $2; };
let_expr : OBJECTID ':' TYPEID IN expr
{ $$ = let($1, $3, no_expr(), $5); }
| OBJECTID ':' TYPEID ASSIGN expr IN expr
{ $$ = let($1, $3, $5, $7); }
| OBJECTID ':' TYPEID ',' let_expr
{ $$ = let($1, $3, no_expr(), $5); }
| OBJECTID ':' TYPEID ASSIGN expr ',' let_expr
{ $$ = let($1, $3, $5, $7); }
| error IN expr { yyclearin; $$ = NULL; }
| error ',' let_expr { yyclearin; $$ = NULL; };
/*case and cases */
case_branch : OBJECTID ':' TYPEID DARROW expr ';'
{ $$ = branch($1,$3,$5); };
cases : case_branch
{ $$ = single_Cases($1); }
| cases case_branch
{ $$ = append_Cases($1, single_Cases($2)); }
/* Feature list may be empty, but no empty features in list. */
feature_list: features /* empty */
{ $$ = $1; }
| { $$ = nil_Features(); }
| error ;
/*feature and features */
features : feature ';'
{ $$ = single_Features($1); }
| features feature ';'
{ $$ = append_Features($1, single_Features($2)); }
| error ';'
{ yyclearin; $$ = NULL; };
feature : OBJECTID '(' formals ')' ':' TYPEID '{' expr '}'
{ $$ = method($1,$3,$6,$8); }
| OBJECTID ':' TYPEID
{ $$ = attr($1,$3,no_expr()); }
| OBJECTID ':' TYPEID ASSIGN expr
{ $$ = attr($1,$3,$5); }
| error;
/* end of grammar */
%%
/* This function is called automatically when Bison detects a parse error. */
void yyerror(char *s)
{
extern int curr_lineno;
cerr << "\"" << curr_filename << "\", line " << curr_lineno << ": " \
<< s << " at or near ";
print_cool_token(yychar);
cerr << endl;
omerrs++;
if(omerrs>50) {fprintf(stdout, "More than 50 errors\n"); exit(1);}
}