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 /* beschreibung der attribute
39 @attributes { char *name; } IDENT
40 @attributes { long val; } NUM
41 @attributes { struct symbol *f; int paramges; int parms; } Parms
42 @attributes { struct symbol *f; } FeldID Structdef Program
43 @attributes { struct symbol *s; } Methoddef
44 @attributes { struct symbol *s; int gparamges; } Statseq Exprs
45 @attributes { struct symbol *s; int gparamges; struct treenode *node; int exprcount; } Expr Minusterm Term Multerm Orterm
46 @attributes { struct symbol *s; int gparamges; struct treenode *node; } Lexpr Feld
47 @attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; } Statement
49 @traversal @postorder c
50 @traversal @preorder reg
51 @traversal @postorder gen
57 @i @Program.f@ = tab_new();
58 @gen @revorder(1) printf("\t.text\n");
65 @i @Methoddef.s@ = @Program.0.f@;
66 @i @Program.1.f@ = @Program.0.f@;
69 | Structdef ';' Program
71 @i @Program.1.f@ = tab_merge(@Program.0.f@, @Structdef.f@, 1);
77 METHOD IDENT '(' Parms ')' Statseq END
80 @i @Statseq.s@ = tab_merge(@Methoddef.s@, @Parms.f@, 0);
81 @i @Statseq.gparamges@ = @Parms.paramges@;
82 @gen @revorder(1) func_header(@IDENT.name@);
89 @i @Structdef.f@ = @FeldID.f@;
94 /* lokale Vars werden in Statement in die tabelle eingefuegt */
97 @i @Parms.1.parms@ = @Parms.parms@ + 1;
98 @i @Parms.0.paramges@ = @Parms.1.paramges@;
99 @i @Parms.0.f@ = tab_add_symbol(@Parms.1.f@, @IDENT.name@, S_PARM, 1, @Parms.parms@);
104 @i @Parms.f@ = tab_new();
105 @i @Parms.paramges@ = @Parms.parms@;
112 @i @FeldID.0.f@ = tab_add_symbol(@FeldID.1.f@, @IDENT.name@, S_FIELD, 1, -1);
117 @i @FeldID.f@ = tab_new();
122 Statement ';' Statseq
124 @i @Statement.sin@ = @Statseq.0.s@;
125 @i @Statseq.1.s@ = @Statement.sout@;
126 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
138 @i @Statement.node@ = TREENULL;
141 | VAR IDENT ASSIGN Expr
143 /* tab_clone ist hier noetig, vgl. folgendes statement
144 * > var x := x - 1; */
145 @i @Statement.sout@ = tab_add_symbol(tab_clone(@Statement.sin@), @IDENT.name@, S_VAR, 1, -1);
147 @i @Statement.node@ = TREENULL;
154 @i @Statement.node@ = TREENULL;
157 | IF Expr THEN Statseq END
161 xxputsin(@Statseq.s@,)
162 @i @Statement.node@ = TREENULL;
165 | IF Expr THEN Statseq ELSE Statseq END
169 xxputsin(@Statseq.0.s@,)
170 xxputsin(@Statseq.1.s@,)
171 @i @Statement.node@ = TREENULL;
174 | WHILE Expr DO Statseq END
178 xxputsin(@Statseq.s@,)
179 @i @Statement.node@ = TREENULL;
186 @i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL, @Expr.exprcount@+1); fprintf(stderr, "RETURN: %s (gparamges: %i, exprcount: %i, gesamt %i [maximal: 7])\n", @Expr.gparamges@ + @Expr.exprcount@ + 1 > 7 ? "zu hohe tiefe" : "tiefe passt", @Expr.gparamges@, @Expr.exprcount@+1, @Expr.gparamges@+@Expr.exprcount@+1);
187 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, 0, @Expr.gparamges@);
194 @i @Lexpr.node@ = TREENULL;
195 @c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
203 @c check(@Feld.s@, @IDENT.name@, S_FIELD);
204 @i @Feld.node@ = TREENULL;
211 @reg @Term.node@->reg = @Expr.node@->reg;
212 @i @Expr.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Expr)- Term\n");
217 @i @Expr.node@ = TREENULL;
218 @i @Expr.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Expr)- NOT Term\n");
223 @i @Expr.exprcount@ = @Term.exprcount@ + @Minusterm.exprcount@; fprintf(stderr, "(Expr)- Term Minusterm\n");
224 @i @Expr.node@ = new_node(O_SUB, @Term.node@, @Minusterm.node@, @Expr.exprcount@);
228 @Term.node@->reg = @Expr.node@->reg;
229 @Term.node@->skip = 0;
230 @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
236 @i @Expr.exprcount@ = @Term.exprcount@ + @Multerm.exprcount@; fprintf(stderr, "(Expr)- Term Multerm\n");
237 @i @Expr.node@ = new_node(O_MUL, @Term.node@, @Multerm.node@, @Expr.exprcount@);
241 @Term.node@->reg = @Expr.node@->reg;
242 @Term.node@->skip = 0;
243 @Multerm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
249 @i @Expr.exprcount@ = @Term.exprcount@ + @Orterm.exprcount@; fprintf(stderr, "(Expr)- Term Orterm\n");
250 @i @Expr.node@ = new_node(O_OR, @Term.node@, @Orterm.node@, @Expr.exprcount@);
254 @Term.node@->reg = @Expr.node@->reg;
255 @Term.node@->skip = 0;
256 @Orterm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
262 @i @Expr.node@ = TREENULL;
263 @i @Expr.exprcount@ = @Term.0.exprcount@ + @Term.1.exprcount@; fprintf(stderr, "(Expr)- Term < Term\n");
268 @i @Expr.node@ = TREENULL;
269 @i @Expr.exprcount@ = @Term.0.exprcount@ + @Term.1.exprcount@; fprintf(stderr, "(Expr)- Term = Term\n");
276 @i @Minusterm.0.exprcount@ = @Term.exprcount@ + @Minusterm.1.exprcount@; fprintf(stderr, "(Minusterm)- - Term Minusterm\n");
277 @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@, @Minusterm.0.exprcount@);
280 @Minusterm.1.node@->reg = @Minusterm.node@->reg;
281 @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.node@->skip, @Minusterm.gparamges@);
287 @i @Minusterm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Minusterm)- - Term\n");
288 @reg @Term.node@->reg = @Minusterm.node@->reg;
295 @i @Multerm.0.exprcount@ = @Term.exprcount@ + @Multerm.1.exprcount@; fprintf(stderr, "(Multerm)- - Term Multerm\n");
296 @i @Multerm.node@ = new_node(O_MUL, @Multerm.1.node@, @Term.node@, @Multerm.0.exprcount@);
299 @Multerm.1.node@->reg = @Multerm.node@->reg;
300 @Term.node@->reg = next_reg(@Multerm.1.node@->reg, @Multerm.node@->skip, @Multerm.gparamges@);
306 @i @Multerm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Multerm)- - Term\n");
307 @reg @Term.node@->reg = @Multerm.node@->reg;
314 @i @Orterm.0.exprcount@ = @Term.exprcount@ + @Orterm.1.exprcount@; fprintf(stderr, "(Orterm)- - Term Orterm\n");
315 @i @Orterm.node@ = new_node(O_OR, @Orterm.1.node@, @Term.node@, @Orterm.0.exprcount@);
318 @Orterm.1.node@->reg = @Orterm.node@->reg;
319 @Term.node@->reg = next_reg(@Orterm.1.node@->reg, @Orterm.node@->skip, @Orterm.gparamges@);
324 @i @Orterm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Orterm)- - Term\n");
325 @reg @Term.node@->reg = @Orterm.node@->reg;
333 @i @Term.node@ = @Expr.node@;
334 @i @Term.exprcount@ = 1 + @Expr.exprcount@; fprintf(stderr, "(Term)- ( Expr )\n");
339 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- NUM\n");
340 @i @Term.node@ = new_number(@NUM.val@, @Term.exprcount@);
345 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- - NUM\n");
346 @i @Term.node@ = new_number(-1 * (@NUM.val@), @Term.exprcount@);
351 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- THIS\n");
352 @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0, @Term.exprcount@);
357 @c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
358 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- IDENT\n");
359 @i @Term.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tab_lookup(@Term.s@, @IDENT.name@, S_PARM) == SYMNULL ? -1 : tab_lookup(@Term.s@, @IDENT.name@, S_PARM)->param_index, @Term.exprcount@);
364 @i @Term.node@ = TREENULL;
365 /*TODO*/@i @Term.exprcount@ = 0;
368 | IDENT '(' Exprs ')'
370 @i @Term.node@ = TREENULL;
371 /*TODO*/@i @Term.exprcount@ = 0;
374 | Term '.' IDENT '(' Exprs ')'
376 @i @Term.node@ = TREENULL;
377 /*TODO*/@i @Term.exprcount@ = 0;
384 /* TODO: exprcount uppen */
393 int yyerror(char *error_text)
395 fprintf(stderr,"Zeile %i: %s\n", yylineno, error_text);
399 int main(int argc, char **argv)