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; int lblcnt_in; int lblcnt_out; int reallblcnt; } Elsestat
51 @attributes { struct symbol *s; int gparamges; struct treenode *node; short imm; } Expr Minusterm Multerm Orterm Feld Term
52 @attributes { struct symbol *s; int gparamges; struct treenode *node; } Lexpr
53 @attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; int vars; int lblcnt_in; int lblcnt_out; } Statement
55 @traversal @postorder c
56 @traversal @preorder reg
57 @traversal @preorder gen
63 @i @Program.f@ = tab_new();
64 @gen printf("\t.text\n");
71 @i @Methoddef.s@ = @Program.0.f@;
72 @i @Program.1.f@ = @Program.0.f@;
75 | Structdef ';' Program
77 @i @Program.1.f@ = tab_merge(@Program.0.f@, @Structdef.f@, 1);
83 METHOD IDENT '(' Parms ')' Statseq END
86 @i @Statseq.s@ = tab_merge(@Methoddef.s@, @Parms.f@, 0);
87 @i @Statseq.gparamges@ = @Parms.paramges@;
88 @i @Statseq.lblcnt_in@ = 0;
89 @gen func_header(@IDENT.name@);
96 @i @Structdef.f@ = @FeldID.f@;
97 @i @FeldID.offsetcount@ = 0;
102 /* lokale Vars werden in Statement in die tabelle eingefuegt */
105 @i @Parms.1.parms@ = @Parms.0.parms@ + 1;
106 @i @Parms.0.paramges@ = @Parms.1.paramges@;
107 @i @Parms.0.f@ = tab_add_symbol(@Parms.1.f@, @IDENT.name@, S_PARM, 1, @Parms.parms@, -1);
112 @i @Parms.f@ = tab_new();
113 @i @Parms.paramges@ = @Parms.parms@;
120 @i @FeldID.1.offsetcount@ = @FeldID.0.offsetcount@ + 1;
121 @i @FeldID.0.f@ = tab_add_symbol(@FeldID.1.f@, @IDENT.name@, S_FIELD, 1, -1, @FeldID.0.offsetcount@);
126 @i @FeldID.f@ = tab_new();
131 Statement ';' Statseq
133 @i @Statement.sin@ = @Statseq.0.s@;
134 @i @Statement.lblcnt_in@ = @Statseq.0.lblcnt_in@;
136 @i @Statseq.1.s@ = @Statement.sout@;
137 @i @Statseq.1.lblcnt_in@ = @Statement.lblcnt_out@;
138 @i @Statseq.1.gparamges@ = @Statseq.0.gparamges@ + @Statement.vars@;
140 @i @Statseq.0.lblcnt_out@ = @Statseq.1.lblcnt_out@;
145 @i @Statseq.0.lblcnt_out@ = @Statseq.0.lblcnt_in@;
156 @i @Statement.node@ = new_node(O_ASSIGN, @Expr.node@, @Lexpr.node@);
157 @i @Statement.vars@ = 0;
158 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
159 @reg @Lexpr.node@->reg = next_reg(@Expr.node@->reg, @Expr.gparamges@);
161 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
164 | VAR IDENT ASSIGN Expr
166 /* tab_clone ist hier noetig, vgl. folgendes statement
167 * > var x := x - 1; */
168 @i @Statement.sout@ = tab_add_symbol(tab_clone(@Statement.sin@), @IDENT.name@, S_VAR, 1, @Statement.gparamges@, -1);
172 @i @Statement.node@ = new_node(O_ASSIGN, @Expr.node@, new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, @Statement.gparamges@));
173 @i @Statement.vars@ = 1;
174 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
176 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
184 @i @Statement.node@ = TREENULL;
185 @i @Statement.vars@ = 0;
188 | IF Expr THEN Statseq END
191 @i @Statseq.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
192 @i @Statement.lblcnt_out@ = @Statseq.lblcnt_out@;
194 xxputsin(@Statseq.s@,)
196 @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
197 @i @Statement.vars@ = 0;
199 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
201 printf(".%s_ifstart_%d:\n", get_func_name(), @Statement.lblcnt_in@);
202 write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
203 /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
204 printf("\tjz .%s_ifend_%d\n", get_func_name(), @Statement.lblcnt_in@);
206 @gen @revorder(1) printf(".%s_ifend_%d:\n", get_func_name(), @Statement.lblcnt_in@);
209 | IF Expr THEN Statseq Elsestat END
212 @i @Statseq.0.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
213 @i @Elsestat.lblcnt_in@ = @Statseq.lblcnt_out@;
214 @i @Statement.lblcnt_out@ = @Elsestat.lblcnt_out@;
216 /* im Elsestat muss noch ein label numeriert werden */
217 @i @Elsestat.reallblcnt@ = @Statement.lblcnt_in@;
220 xxputsin(@Statseq.0.s@,)
221 xxputsin(@Elsestat.s@,)
223 @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
224 @i @Statement.vars@ = 0;
226 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
228 printf(".%s_ifstart_%d:\n", get_func_name(), @Statement.lblcnt_in@);
229 write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
230 /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
231 printf("\tjz .%s_ifelse_%d\n", get_func_name(), @Statement.lblcnt_in@);
233 @gen @revorder(1) printf(".%s_ifend_%d:\n", get_func_name(), @Statement.lblcnt_in@);
236 | WHILE Expr DO Statseq END
239 @i @Statseq.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
240 @i @Statement.lblcnt_out@ = @Statseq.lblcnt_out@;
242 xxputsin(@Statseq.s@,)
244 @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
245 @i @Statement.vars@ = 0;
247 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
249 printf(".%s_whilestart_%d:\n", get_func_name(), @Statement.lblcnt_in@);
250 write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
251 /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
252 printf("\tjz .%s_whileend_%d\n", get_func_name(), @Statement.lblcnt_in@);
254 @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@);
263 @i @Statement.vars@ = 0;
264 @i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL);
265 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
267 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
274 @i @Statseq.lblcnt_in@ = @Elsestat.lblcnt_in@;
275 @i @Elsestat.lblcnt_out@ = @Statseq.lblcnt_out@;
277 @gen printf("\tjmp .%s_ifend_%d\n.%s_ifelse_%d:\n", get_func_name(), @Elsestat.reallblcnt@, get_func_name(), @Elsestat.reallblcnt@);
283 @c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
285 /* TODO: selbe Code wie bei Term/IDENT -- schoener machen! */
287 @Lexpr.node@ = TREENULL;
288 if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
289 /* es handelt sich um ein feldzugriff auf this */
290 @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);
291 } else { /* param oder var */
292 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;
293 @Lexpr.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
297 @reg if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
298 /* TODO: kein schoener hack? */
299 @Lexpr.node@->kids[0]->reg = @Lexpr.node@->reg;
308 @c check(@Feld.s@, @IDENT.name@, S_FIELD);
309 @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);
311 @reg @Term.node@->reg = next_reg(@Feld.node@->reg, @Term.gparamges@);
318 @reg @Term.node@->reg = @Expr.node@->reg;
323 @i @Expr.node@ = new_node(O_EQ, @Term.node@, new_node(O_NULL, TREENULL, TREENULL));
325 @reg @Term.node@->reg = @Expr.node@->reg;
330 @i @Expr.node@ = new_node(O_SUB, @Term.node@, @Minusterm.node@);
331 @i @Expr.imm@ = @Term.imm@ && @Minusterm.imm@;
334 if(!(@Expr.node@->kids[0] == TREENULL && @Expr.node@->kids[1] == TREENULL)) {
335 @Term.node@->reg = @Expr.node@->reg;
336 if(@Minusterm.imm@) {
337 @Minusterm.node@->reg = @Expr.node@->reg;
339 @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
347 @i @Expr.node@ = new_node(O_MUL, @Term.node@, @Multerm.node@);
348 @i @Expr.imm@ = @Term.imm@ && @Multerm.imm@;
351 @Term.node@->reg = @Expr.node@->reg;
353 @Multerm.node@->reg = @Expr.node@->reg;
355 @Multerm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
362 @i @Expr.node@ = new_node(O_OR, @Term.node@, @Orterm.node@);
363 @i @Expr.imm@ = @Term.imm@ && @Orterm.imm@;
366 @Term.node@->reg = @Expr.node@->reg;
367 @Orterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
373 @i @Expr.node@ = new_node(O_LESS, @Term.0.node@, @Term.1.node@);
374 @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
377 @Term.0.node@->reg = @Expr.node@->reg;
378 @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
384 @i @Expr.node@ = new_node(O_EQ, @Term.0.node@, @Term.1.node@);
385 @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
388 @Term.0.node@->reg = @Expr.node@->reg;
389 @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
397 @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@);
398 @i @Minusterm.0.imm@ = @Term.imm@ && @Minusterm.1.imm@;
401 @Minusterm.1.node@->reg = @Minusterm.node@->reg;
402 if(@Minusterm.1.imm@) {
403 @Term.node@->reg = @Minusterm.node@->reg;
405 @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.gparamges@);
412 @reg @Term.node@->reg = @Minusterm.node@->reg;
419 @i @Multerm.node@ = new_node(O_MUL, @Multerm.1.node@, @Term.node@);
420 @i @Multerm.0.imm@ = @Term.imm@ && @Multerm.1.imm@;
423 @Multerm.1.node@->reg = @Multerm.node@->reg;
424 if(@Multerm.1.imm@) {
425 @Term.node@->reg = @Multerm.node@->reg;
427 @Term.node@->reg = next_reg(@Multerm.1.node@->reg, @Multerm.gparamges@);
434 @reg @Term.node@->reg = @Multerm.node@->reg;
441 @i @Orterm.node@ = new_node(O_OR, @Orterm.1.node@, @Term.node@);
442 @i @Orterm.0.imm@ = @Term.imm@ && @Orterm.1.imm@;
445 @Orterm.1.node@->reg = @Orterm.node@->reg;
447 @Term.node@->reg = @Orterm.node@->reg;
449 @Term.node@->reg = next_reg(@Orterm.1.node@->reg, @Orterm.gparamges@);
455 @reg @Term.node@->reg = @Orterm.node@->reg;
463 @i @Term.node@ = @Expr.node@;
468 @i @Term.node@ = new_number(@NUM.val@);
474 @i @Term.node@ = new_number(-1 * (@NUM.val@));
480 @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0);
486 @c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
490 @Term.node@ = TREENULL;
491 if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
492 /* es handelt sich um ein feldzugriff auf this */
493 @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);
494 } else { /* param oder var */
495 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;
496 @Term.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
500 @reg if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
501 /* TODO: kein schoener hack? */
502 @Term.node@->kids[0]->reg = @Term.node@->reg;
508 @i @Term.node@ = @Feld.node@;
512 | IDENT '(' Exprs ')'
514 @i @Term.node@ = TREENULL;
518 | Term '.' IDENT '(' Exprs ')'
520 @i @Term.node@ = TREENULL;
536 int yyerror(char *error_text)
538 fprintf(stderr,"Zeile %i: %s\n", yylineno, error_text);
542 int main(int argc, char **argv)