9 #define MAX(A,B) (A > B ? A : B)
13 %token STRUCT END METHOD VAR IF THEN ELSE WHILE DO RETURN NOT OR THIS IDENT NUM ASSIGN
16 @i xx = @Statement.sin@;
20 @i @Statement.sout@ = @Statement.sin@;
22 *> xxputsin(@Statement.sout@,)
23 * geht nicht, weil verschachtelte macros deaktiviert sind */
26 @macro lblcountinout()
27 @i @Statement.lblcnt_out@ = @Statement.lblcnt_in@;
30 /* beschreibung der attribute
32 * f: symboltabelle fuer quirks mit structur und parameter
33 * gparamges: anzahl der parameter in einer methode
34 * parms: parametercounter
35 * node: baum fuer iburg
36 * sin: symboltabelle fuer statement ("eingabe")
37 * sout: symboltabelle die aus einem statement wieder rauskommt ("ausgabe")
42 @attributes { char *name; } IDENT
43 @attributes { long val; } NUM
44 @attributes { struct symbol *f; int paramges; int parms; } Parms
45 @attributes { struct symbol *f; } Program Structdef;
46 @attributes { struct symbol *f; int offsetcount; } FeldID
47 @attributes { struct symbol *s; } Methoddef
48 @attributes { struct symbol *s; int gparamges; } Exprs
49 @attributes { struct symbol *s; int gparamges; int lblcnt_in; int lblcnt_out; } Statseq
50 @attributes { struct symbol *s; int gparamges; struct treenode *node; short imm; } Expr Minusterm Multerm Orterm Feld Term
51 @attributes { struct symbol *s; int gparamges; struct treenode *node; } Lexpr
52 @attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; int vars; int lblcnt_in; int lblcnt_out; } Statement
54 @traversal @postorder c
55 @traversal @preorder reg
56 @traversal @preorder gen
62 @i @Program.f@ = tab_new();
63 @gen printf("\t.text\n");
70 @i @Methoddef.s@ = @Program.0.f@;
71 @i @Program.1.f@ = @Program.0.f@;
74 | Structdef ';' Program
76 @i @Program.1.f@ = tab_merge(@Program.0.f@, @Structdef.f@, 1);
82 METHOD IDENT '(' Parms ')' Statseq END
85 @i @Statseq.s@ = tab_merge(@Methoddef.s@, @Parms.f@, 0);
86 @i @Statseq.gparamges@ = @Parms.paramges@;
87 @i @Statseq.lblcnt_in@ = 0;
88 @gen func_header(@IDENT.name@);
95 @i @Structdef.f@ = @FeldID.f@;
96 @i @FeldID.offsetcount@ = 0;
101 /* lokale Vars werden in Statement in die tabelle eingefuegt */
104 @i @Parms.1.parms@ = @Parms.0.parms@ + 1;
105 @i @Parms.0.paramges@ = @Parms.1.paramges@;
106 @i @Parms.0.f@ = tab_add_symbol(@Parms.1.f@, @IDENT.name@, S_PARM, 1, @Parms.parms@, -1);
111 @i @Parms.f@ = tab_new();
112 @i @Parms.paramges@ = @Parms.parms@;
119 @i @FeldID.1.offsetcount@ = @FeldID.0.offsetcount@ + 1;
120 @i @FeldID.0.f@ = tab_add_symbol(@FeldID.1.f@, @IDENT.name@, S_FIELD, 1, -1, @FeldID.0.offsetcount@);
125 @i @FeldID.f@ = tab_new();
130 Statement ';' Statseq
132 @i @Statement.sin@ = @Statseq.0.s@;
133 @i @Statement.lblcnt_in@ = @Statseq.0.lblcnt_in@;
135 @i @Statseq.1.s@ = @Statement.sout@;
136 @i @Statseq.1.lblcnt_in@ = @Statement.lblcnt_out@;
137 @i @Statseq.1.gparamges@ = @Statseq.0.gparamges@ + @Statement.vars@;
139 @i @Statseq.0.lblcnt_out@ = @Statseq.1.lblcnt_out@;
144 @i @Statseq.0.lblcnt_out@ = @Statseq.0.lblcnt_in@;
155 @i @Statement.node@ = new_node(O_ASSIGN, @Lexpr.node@, @Expr.node@);
156 @i @Statement.vars@ = 0;
157 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
159 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
162 | VAR IDENT ASSIGN Expr
164 /* tab_clone ist hier noetig, vgl. folgendes statement
165 * > var x := x - 1; */
166 @i @Statement.sout@ = tab_add_symbol(tab_clone(@Statement.sin@), @IDENT.name@, S_VAR, 1, @Statement.gparamges@, -1);
170 @i @Statement.node@ = new_node(O_ASSIGN, new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, @Statement.gparamges@), @Expr.node@);
171 @i @Statement.vars@ = 1;
172 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
174 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
182 @i @Statement.node@ = TREENULL;
183 @i @Statement.vars@ = 0;
186 | IF Expr THEN Statseq END
189 @i @Statseq.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
190 @i @Statement.lblcnt_out@ = @Statseq.lblcnt_out@;
192 xxputsin(@Statseq.s@,)
194 @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
195 @i @Statement.vars@ = 0;
197 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
199 write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
200 /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
201 printf("\ttest %s1, %%rax\n\tjz %s_ifend_%d\n", "$", get_func_name(), @Statement.lblcnt_in@);
203 @gen @revorder(1) printf("%s_ifend_%d:\n", get_func_name(), @Statement.lblcnt_in@);
206 | IF Expr THEN Statseq ELSE Statseq END
211 @i @Statseq.0.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
212 @i @Statseq.1.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
214 xxputsin(@Statseq.0.s@,)
215 xxputsin(@Statseq.1.s@,)
216 @i @Statement.node@ = TREENULL;
217 @i @Statement.vars@ = 0;
220 | WHILE Expr DO Statseq END
225 @i @Statseq.0.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
227 xxputsin(@Statseq.s@,)
228 @i @Statement.node@ = TREENULL;
229 @i @Statement.vars@ = 0;
238 @i @Statement.vars@ = 0;
239 @i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL);
240 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
242 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
249 @c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
251 /* TODO: selbe Code wie bei Term/IDENT -- schoener machen! */
253 @Lexpr.node@ = TREENULL;
254 if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
255 /* es handelt sich um ein feldzugriff auf this */
256 @Lexpr.node@ = new_field(@IDENT.name@, new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0), TREENULL, tab_lookup(@Lexpr.s@, @IDENT.name@, S_FIELD) == SYMNULL ? -1 : tab_lookup(@Lexpr.s@, @IDENT.name@, S_FIELD)->soffset);
257 } else { /* param oder var */
258 int tmp = tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL ? -1 : tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM)->param_index;
259 @Lexpr.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
263 @reg if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
264 /* TODO: kein schoener hack? */
265 @Lexpr.node@->kids[0]->reg = @Lexpr.node@->reg;
274 @c check(@Feld.s@, @IDENT.name@, S_FIELD);
275 @i @Feld.node@ = new_field(@IDENT.name@, @Term.node@, TREENULL, tab_lookup(@Feld.s@, @IDENT.name@, S_FIELD) == SYMNULL ? -1 : tab_lookup(@Feld.s@, @IDENT.name@, S_FIELD)->soffset);
277 @reg @Term.node@->reg = @Feld.node@->reg;
284 @reg @Term.node@->reg = @Expr.node@->reg;
289 @i @Expr.node@ = new_node(O_EQ, @Term.node@, new_node(O_NULL, TREENULL, TREENULL));
291 @reg @Term.node@->reg = @Expr.node@->reg;
296 @i @Expr.node@ = new_node(O_SUB, @Term.node@, @Minusterm.node@);
297 @i @Expr.imm@ = @Term.imm@ && @Minusterm.imm@;
300 if(!(@Expr.node@->kids[0] == TREENULL && @Expr.node@->kids[1] == TREENULL)) {
301 @Term.node@->reg = @Expr.node@->reg;
302 if(@Minusterm.imm@) {
303 @Minusterm.node@->reg = @Expr.node@->reg;
305 @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
313 @i @Expr.node@ = new_node(O_MUL, @Term.node@, @Multerm.node@);
314 @i @Expr.imm@ = @Term.imm@ && @Multerm.imm@;
317 @Term.node@->reg = @Expr.node@->reg;
319 @Multerm.node@->reg = @Expr.node@->reg;
321 @Multerm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
328 @i @Expr.node@ = new_node(O_OR, @Term.node@, @Orterm.node@);
329 @i @Expr.imm@ = @Term.imm@ && @Orterm.imm@;
332 @Term.node@->reg = @Expr.node@->reg;
333 @Orterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
339 @i @Expr.node@ = new_node(O_LESS, @Term.0.node@, @Term.1.node@);
340 @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
343 @Term.0.node@->reg = @Expr.node@->reg;
344 @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
350 @i @Expr.node@ = new_node(O_EQ, @Term.0.node@, @Term.1.node@);
351 @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
354 @Term.0.node@->reg = @Expr.node@->reg;
355 @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
363 @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@);
364 @i @Minusterm.0.imm@ = @Term.imm@ && @Minusterm.1.imm@;
367 @Minusterm.1.node@->reg = @Minusterm.node@->reg;
368 if(@Minusterm.1.imm@) {
369 @Term.node@->reg = @Minusterm.node@->reg;
371 @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.gparamges@);
378 @reg @Term.node@->reg = @Minusterm.node@->reg;
385 @i @Multerm.node@ = new_node(O_MUL, @Multerm.1.node@, @Term.node@);
386 @i @Multerm.0.imm@ = @Term.imm@ && @Multerm.1.imm@;
389 @Multerm.1.node@->reg = @Multerm.node@->reg;
390 if(@Multerm.1.imm@) {
391 @Term.node@->reg = @Multerm.node@->reg;
393 @Term.node@->reg = next_reg(@Multerm.1.node@->reg, @Multerm.gparamges@);
400 @reg @Term.node@->reg = @Multerm.node@->reg;
407 @i @Orterm.node@ = new_node(O_OR, @Orterm.1.node@, @Term.node@);
408 @i @Orterm.0.imm@ = @Term.imm@ && @Orterm.1.imm@;
411 @Orterm.1.node@->reg = @Orterm.node@->reg;
413 @Term.node@->reg = @Orterm.node@->reg;
415 @Term.node@->reg = next_reg(@Orterm.1.node@->reg, @Orterm.gparamges@);
421 @reg @Term.node@->reg = @Orterm.node@->reg;
429 @i @Term.node@ = @Expr.node@;
434 @i @Term.node@ = new_number(@NUM.val@);
440 @i @Term.node@ = new_number(-1 * (@NUM.val@));
446 @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0);
452 @c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
456 @Term.node@ = TREENULL;
457 if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
458 /* es handelt sich um ein feldzugriff auf this */
459 @Term.node@ = new_field(@IDENT.name@, new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0), TREENULL, tab_lookup(@Term.s@, @IDENT.name@, S_FIELD) == SYMNULL ? -1 : tab_lookup(@Term.s@, @IDENT.name@, S_FIELD)->soffset);
460 } else { /* param oder var */
461 int tmp = tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL ? -1 : tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM)->param_index;
462 @Term.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
466 @reg if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
467 /* TODO: kein schoener hack? */
468 @Term.node@->kids[0]->reg = @Term.node@->reg;
474 @i @Term.node@ = @Feld.node@;
478 | IDENT '(' Exprs ')'
480 @i @Term.node@ = TREENULL;
484 | Term '.' IDENT '(' Exprs ')'
486 @i @Term.node@ = TREENULL;
502 int yyerror(char *error_text)
504 fprintf(stderr,"Zeile %i: %s\n", yylineno, error_text);
508 int main(int argc, char **argv)