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@;
31 @i @Statement.vars_out@ = @Statement.vars_in@;
34 /* beschreibung der attribute
36 * f: symboltabelle fuer quirks mit structur und parameter
37 * gparamges: anzahl der parameter in einer methode
38 * parms: parametercounter
39 * node: baum fuer iburg
40 * sin: symboltabelle fuer statement ("eingabe")
41 * sout: symboltabelle die aus einem statement wieder rauskommt ("ausgabe")
44 @autosyn node imm call
46 @attributes { char *name; } IDENT
47 @attributes { long val; } NUM
48 @attributes { struct symbol *f; int paramges; int parms; } Parms
49 @attributes { struct symbol *f; } Program Structdef;
50 @attributes { struct symbol *f; int offsetcount; } FeldID
51 @attributes { struct symbol *s; } Methoddef
52 @attributes { struct symbol *s; int gparamges; } Exprs
53 @attributes { struct symbol *s; int gparamges; int lblcnt_in; int lblcnt_out; int vars_in; int vars_out; int call; } Statseq
54 @attributes { struct symbol *s; int gparamges; int lblcnt_in; int lblcnt_out; int reallblcnt; int vars_in; int vars_out; int call; } Elsestat
55 @attributes { struct symbol *s; int gparamges; struct treenode *node; short imm; int call; } Expr Minusterm Multerm Orterm Feld Term
56 @attributes { struct symbol *s; int gparamges; struct treenode *node; } Lexpr
57 @attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; int vars_in; int vars_out; int lblcnt_in; int lblcnt_out; int call; } Statement
59 @traversal @postorder c
60 @traversal @preorder reg
61 @traversal @preorder gen
67 @i @Program.f@ = tab_new();
68 @gen printf("\t.text\n");
75 @i @Methoddef.s@ = @Program.0.f@;
76 @i @Program.1.f@ = @Program.0.f@;
79 | Structdef ';' Program
81 @i @Program.1.f@ = tab_merge(@Program.0.f@, @Structdef.f@, 1);
87 METHOD IDENT '(' Parms ')' Statseq END
90 @i @Statseq.s@ = tab_merge(@Methoddef.s@, @Parms.f@, 0);
91 @i @Statseq.vars_in@ = 0;
92 @i @Statseq.gparamges@ = @Parms.paramges@;
93 @i @Statseq.lblcnt_in@ = 0;
94 @gen func_header(@IDENT.name@, @Statseq.vars_out@, @Parms.paramges@, @Statseq.call@);
101 @i @Structdef.f@ = @FeldID.f@;
102 @i @FeldID.offsetcount@ = 0;
107 /* lokale Vars werden in Statement in die tabelle eingefuegt */
110 @i @Parms.1.parms@ = @Parms.0.parms@ + 1;
111 @i @Parms.0.paramges@ = @Parms.1.paramges@;
112 @i @Parms.0.f@ = tab_add_symbol(@Parms.1.f@, @IDENT.name@, S_PARM, 1, @Parms.parms@, -1);
117 @i @Parms.f@ = tab_new();
118 @i @Parms.paramges@ = @Parms.parms@;
125 @i @FeldID.1.offsetcount@ = @FeldID.0.offsetcount@ + 1;
126 @i @FeldID.0.f@ = tab_add_symbol(@FeldID.1.f@, @IDENT.name@, S_FIELD, 1, -1, @FeldID.0.offsetcount@);
131 @i @FeldID.f@ = tab_new();
136 Statement ';' Statseq
138 @i @Statement.sin@ = @Statseq.0.s@;
139 @i @Statement.lblcnt_in@ = @Statseq.0.lblcnt_in@;
141 @i @Statseq.1.s@ = @Statement.sout@;
142 @i @Statseq.1.lblcnt_in@ = @Statement.lblcnt_out@;
143 @i @Statseq.1.gparamges@ = @Statseq.0.gparamges@;
145 @i @Statement.vars_in@ = @Statseq.0.vars_in@;
146 @i @Statseq.1.vars_in@ = @Statement.vars_out@;
148 @i @Statseq.0.lblcnt_out@ = @Statseq.1.lblcnt_out@;
149 @i @Statseq.0.vars_out@ = @Statseq.1.vars_out@;
151 @i @Statseq.0.call@ = @Statement.call@ || @Statseq.1.call@;
156 @i @Statseq.0.lblcnt_out@ = @Statseq.0.lblcnt_in@;
157 @i @Statseq.0.vars_out@ = @Statseq.0.vars_in@;
158 @i @Statseq.0.call@ = 0;
170 @i @Statement.node@ = new_node(O_ASSIGN, @Expr.node@, @Lexpr.node@);
171 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
172 @reg @Lexpr.node@->reg = next_reg(@Expr.node@->reg, @Expr.gparamges@);
174 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
177 | VAR IDENT ASSIGN Expr
179 /* tab_clone ist hier noetig, vgl. folgendes statement
180 * > var x := x - 1; */
181 @i @Statement.sout@ = tab_add_symbol(tab_clone(@Statement.sin@), @IDENT.name@, S_VAR, 1, @Statement.gparamges@ + @Statement.vars_in@, -1);
184 @i @Statement.vars_out@ = @Statement.vars_in@ + 1;
188 @i @Statement.node@ = new_node(O_ASSIGN, @Expr.node@, new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, @Statement.gparamges@ + @Statement.vars_in@));
189 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
191 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
200 @i @Statement.node@ = TREENULL;
203 | IF Expr THEN Statseq END
206 @i @Statseq.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
207 @i @Statement.lblcnt_out@ = @Statseq.lblcnt_out@;
209 @i @Statseq.vars_in@ = @Statement.vars_in@;
210 @i @Statement.vars_out@ = @Statseq.vars_out@;
212 @i @Statement.call@ = @Expr.call@ || @Statseq.call@;
215 xxputsin(@Statseq.s@,)
217 @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
219 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
221 printf(".%s_ifstart_%d:\n", get_func_name(), @Statement.lblcnt_in@);
222 write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
223 /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
224 printf("\tjz .%s_ifend_%d\n", get_func_name(), @Statement.lblcnt_in@);
226 @gen @revorder(1) printf(".%s_ifend_%d:\n", get_func_name(), @Statement.lblcnt_in@);
229 | IF Expr THEN Statseq Elsestat END
232 @i @Statseq.0.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
233 @i @Elsestat.lblcnt_in@ = @Statseq.lblcnt_out@;
234 @i @Statement.lblcnt_out@ = @Elsestat.lblcnt_out@;
236 /* im Elsestat muss noch ein label numeriert werden */
237 @i @Elsestat.reallblcnt@ = @Statement.lblcnt_in@;
239 @i @Statseq.vars_in@ = @Statement.vars_in@;
240 @i @Elsestat.vars_in@ = @Statement.vars_in@;
241 @i @Statement.vars_out@ = MAX(@Statseq.vars_out@, @Elsestat.vars_out@);
243 @i @Statement.call@ = @Expr.call@ || @Statseq.call@ || @Elsestat.call@;
246 xxputsin(@Statseq.0.s@,)
247 xxputsin(@Elsestat.s@,)
249 @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
251 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
253 printf(".%s_ifstart_%d:\n", get_func_name(), @Statement.lblcnt_in@);
254 write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
255 /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
256 printf("\tjz .%s_ifelse_%d\n", get_func_name(), @Statement.lblcnt_in@);
258 @gen @revorder(1) printf(".%s_ifend_%d:\n", get_func_name(), @Statement.lblcnt_in@);
261 | WHILE Expr DO Statseq END
264 @i @Statseq.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
265 @i @Statement.lblcnt_out@ = @Statseq.lblcnt_out@;
267 @i @Statseq.vars_in@ = @Statement.vars_in@;
268 @i @Statement.vars_out@ = @Statseq.vars_out@;
270 @i @Statement.call@ = @Expr.call@ || @Statseq.call@;
273 xxputsin(@Statseq.s@,)
275 @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
277 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
279 printf(".%s_whilestart_%d:\n", get_func_name(), @Statement.lblcnt_in@);
280 write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
281 /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
282 printf("\tjz .%s_whileend_%d\n", get_func_name(), @Statement.lblcnt_in@);
284 @gen @revorder(1) printf("\tjmp .%s_whilestart_%d\n.%s_whileend_%d:\n", get_func_name(), @Statement.lblcnt_in@, get_func_name(), @Statement.lblcnt_in@);
294 @i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL);
295 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
297 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1); func_footer();
304 @i @Statseq.lblcnt_in@ = @Elsestat.lblcnt_in@;
305 @i @Elsestat.lblcnt_out@ = @Statseq.lblcnt_out@;
307 @i @Statseq.vars_in@ = @Elsestat.vars_in@;
308 @i @Elsestat.vars_out@ = @Statseq.vars_out@;
310 @gen printf("\tjmp .%s_ifend_%d\n.%s_ifelse_%d:\n", get_func_name(), @Elsestat.reallblcnt@, get_func_name(), @Elsestat.reallblcnt@);
316 @c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
318 /* TODO: selbe Code wie bei Term/IDENT -- schoener machen! */
320 @Lexpr.node@ = TREENULL;
321 if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
322 /* es handelt sich um ein feldzugriff auf this */
323 @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);
324 } else { /* param oder var */
325 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;
326 @Lexpr.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
330 @reg if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
331 /* TODO: kein schoener hack? */
332 @Lexpr.node@->kids[0]->reg = @Lexpr.node@->reg;
341 @c check(@Feld.s@, @IDENT.name@, S_FIELD);
342 @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);
344 @reg @Term.node@->reg = next_reg(@Feld.node@->reg, @Term.gparamges@);
351 @reg @Term.node@->reg = @Expr.node@->reg;
356 @i @Expr.node@ = new_node(O_BOOL, new_node(O_EQ, @Term.node@, new_node(O_NULL, TREENULL, TREENULL)), TREENULL);
358 @reg @Term.node@->reg = @Expr.node@->kids[0]->reg = @Expr.node@->reg;
363 @i @Expr.node@ = new_node(O_SUB, @Term.node@, @Minusterm.node@);
364 @i @Expr.imm@ = @Term.imm@ && @Minusterm.imm@;
365 @i @Expr.call@ = @Term.call@ || @Minusterm.call@;
368 if(!(@Expr.node@->kids[0] == TREENULL && @Expr.node@->kids[1] == TREENULL)) {
369 @Term.node@->reg = @Expr.node@->reg;
370 if(@Minusterm.imm@) {
371 @Minusterm.node@->reg = @Expr.node@->reg;
373 @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
381 @i @Expr.node@ = new_node(O_MUL, @Term.node@, @Multerm.node@);
382 @i @Expr.imm@ = @Term.imm@ && @Multerm.imm@;
383 @i @Expr.call@ = @Term.call@ || @Multerm.call@;
386 @Term.node@->reg = @Expr.node@->reg;
388 @Multerm.node@->reg = @Expr.node@->reg;
390 @Multerm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
397 @i @Expr.node@ = new_node(O_OR, @Term.node@, @Orterm.node@);
398 @i @Expr.imm@ = @Term.imm@ && @Orterm.imm@;
399 @i @Expr.call@ = @Term.call@ || @Orterm.call@;
402 @Term.node@->reg = @Expr.node@->reg;
403 @Orterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
409 @i @Expr.node@ = new_node(O_BOOL, new_node(O_LESS, @Term.0.node@, @Term.1.node@), TREENULL);
410 @i @Expr.imm@ = @Term.0.imm@ && @Term.1.imm@;
411 @i @Expr.call@ = @Term.0.call@ || @Term.1.call@;
414 @Term.0.node@->reg = @Expr.node@->kids[0]->reg = @Expr.node@->reg;
415 @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
421 @i @Expr.node@ = new_node(O_BOOL, new_node(O_EQ, @Term.0.node@, @Term.1.node@), TREENULL);
422 @i @Expr.imm@ = @Term.0.imm@ && @Term.1.imm@;
423 @i @Expr.call@ = @Term.0.call@ || @Term.1.call@;
426 @Term.0.node@->reg = @Expr.node@->kids[0]->reg = @Expr.node@->reg;
427 @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
435 @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@);
436 @i @Minusterm.0.imm@ = @Term.imm@ && @Minusterm.1.imm@;
437 @i @Minusterm.0.call@ = @Term.call@ || @Minusterm.1.call@;
440 @Minusterm.1.node@->reg = @Minusterm.node@->reg;
441 if(@Minusterm.1.imm@) {
442 @Term.node@->reg = @Minusterm.node@->reg;
444 @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.gparamges@);
451 @reg @Term.node@->reg = @Minusterm.node@->reg;
458 @i @Multerm.node@ = new_node(O_MUL, @Multerm.1.node@, @Term.node@);
459 @i @Multerm.0.imm@ = @Term.imm@ && @Multerm.1.imm@;
460 @i @Multerm.0.call@ = @Term.call@ || @Multerm.1.call@;
463 @Multerm.1.node@->reg = @Multerm.node@->reg;
464 if(@Multerm.1.imm@) {
465 @Term.node@->reg = @Multerm.node@->reg;
467 @Term.node@->reg = next_reg(@Multerm.1.node@->reg, @Multerm.gparamges@);
474 @reg @Term.node@->reg = @Multerm.node@->reg;
481 @i @Orterm.node@ = new_node(O_OR, @Orterm.1.node@, @Term.node@);
482 @i @Orterm.0.imm@ = @Term.imm@ && @Orterm.1.imm@;
483 @i @Orterm.0.call@ = @Term.call@ || @Orterm.1.call@;
486 @Orterm.1.node@->reg = @Orterm.node@->reg;
488 @Term.node@->reg = @Orterm.node@->reg;
490 @Term.node@->reg = next_reg(@Orterm.1.node@->reg, @Orterm.gparamges@);
496 @reg @Term.node@->reg = @Orterm.node@->reg;
504 @i @Term.node@ = @Expr.node@;
509 @i @Term.node@ = new_number(@NUM.val@);
516 @i @Term.node@ = new_number(-1 * (@NUM.val@));
523 @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0);
530 @c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
535 @Term.node@ = TREENULL;
536 if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
537 /* es handelt sich um ein feldzugriff auf this */
538 @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);
539 } else { /* param oder var */
540 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;
541 @Term.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
545 @reg if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
546 /* TODO: kein schoener hack? */
547 @Term.node@->kids[0]->reg = @Term.node@->reg;
553 @i @Term.node@ = @Feld.node@;
557 | IDENT '(' Exprs ')'
559 @i @Term.node@ = new_call(@IDENT.name@, TREENULL, TREENULL);
564 | Term '.' IDENT '(' Exprs ')'
566 @i @Term.node@ = new_node(O_CALL, TREENULL, TREENULL);
583 int yyerror(char *error_text)
585 fprintf(stderr,"Zeile %i: %s\n", yylineno, error_text);
589 int main(int argc, char **argv)