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; } Program Structdef;
43 @attributes { struct symbol *f; int offsetcount; } FeldID
44 @attributes { struct symbol *s; } Methoddef
45 @attributes { struct symbol *s; int gparamges; } Statseq Exprs
46 @attributes { struct symbol *s; int gparamges; struct treenode *node; int exprcount; short imm; } Expr Minusterm Multerm Orterm Feld Term
47 @attributes { struct symbol *s; int gparamges; struct treenode *node; } Lexpr
48 @attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; } Statement
50 @traversal @postorder c
51 @traversal @preorder reg
52 @traversal @postorder gen
58 @i @Program.f@ = tab_new();
59 @gen @revorder(1) printf("\t.text\n");
66 @i @Methoddef.s@ = @Program.0.f@;
67 @i @Program.1.f@ = @Program.0.f@;
70 | Structdef ';' Program
72 @i @Program.1.f@ = tab_merge(@Program.0.f@, @Structdef.f@, 1);
78 METHOD IDENT '(' Parms ')' Statseq END
81 @i @Statseq.s@ = tab_merge(@Methoddef.s@, @Parms.f@, 0);
82 @i @Statseq.gparamges@ = @Parms.paramges@;
83 @gen @revorder(1) func_header(@IDENT.name@);
90 @i @Structdef.f@ = @FeldID.f@;
91 @i @FeldID.offsetcount@ = 0;
96 /* lokale Vars werden in Statement in die tabelle eingefuegt */
99 @i @Parms.1.parms@ = @Parms.0.parms@ + 1;
100 @i @Parms.0.paramges@ = @Parms.1.paramges@;
101 @i @Parms.0.f@ = tab_add_symbol(@Parms.1.f@, @IDENT.name@, S_PARM, 1, @Parms.parms@, -1);
106 @i @Parms.f@ = tab_new();
107 @i @Parms.paramges@ = @Parms.parms@;
114 @i @FeldID.1.offsetcount@ = @FeldID.0.offsetcount@ + 1;
115 @i @FeldID.0.f@ = tab_add_symbol(@FeldID.1.f@, @IDENT.name@, S_FIELD, 1, -1, @FeldID.0.offsetcount@);
120 @i @FeldID.f@ = tab_new();
125 Statement ';' Statseq
127 @i @Statement.sin@ = @Statseq.0.s@;
128 @i @Statseq.1.s@ = @Statement.sout@;
129 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
141 @i @Statement.node@ = TREENULL;
144 | VAR IDENT ASSIGN Expr
146 /* tab_clone ist hier noetig, vgl. folgendes statement
147 * > var x := x - 1; */
148 @i @Statement.sout@ = tab_add_symbol(tab_clone(@Statement.sin@), @IDENT.name@, S_VAR, 1, -1, -1);
150 @i @Statement.node@ = TREENULL;
157 @i @Statement.node@ = TREENULL;
160 | IF Expr THEN Statseq END
164 xxputsin(@Statseq.s@,)
165 @i @Statement.node@ = TREENULL;
168 | IF Expr THEN Statseq ELSE Statseq END
172 xxputsin(@Statseq.0.s@,)
173 xxputsin(@Statseq.1.s@,)
174 @i @Statement.node@ = TREENULL;
177 | WHILE Expr DO Statseq END
181 xxputsin(@Statseq.s@,)
182 @i @Statement.node@ = TREENULL;
189 @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);
190 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, 0, @Expr.gparamges@);
197 @i @Lexpr.node@ = TREENULL;
198 @c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
200 /* TODO fuer zuweisungen ... (codeb?) */
208 @c check(@Feld.s@, @IDENT.name@, S_FIELD);
209 @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, @Feld.exprcount@);
211 @i @Feld.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Feld)- Term.IDENT\n");
212 @reg @Term.node@->reg = @Feld.node@->reg;
219 @reg @Term.node@->reg = @Expr.node@->reg;
220 @i @Expr.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Expr)- Term\n");
225 @i @Expr.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Expr)- NOT Term\n");
226 @i @Expr.node@ = new_node(O_EQ, @Term.node@, new_node(O_NULL, TREENULL, TREENULL, @Expr.exprcount@), @Expr.exprcount@);
228 @reg @Term.node@->reg = @Expr.node@->reg;
233 @i @Expr.exprcount@ = @Term.exprcount@ + @Minusterm.exprcount@; fprintf(stderr, "(Expr)- Term Minusterm\n");
234 @i @Expr.node@ = new_node(O_SUB, @Term.node@, @Minusterm.node@, @Expr.exprcount@);
235 @i @Expr.imm@ = @Term.imm@ && @Minusterm.imm@;
239 if(!(@Expr.node@->kids[0] == TREENULL && @Expr.node@->kids[1] == TREENULL)) {
240 @Term.node@->reg = @Expr.node@->reg;
241 @Term.node@->skip = 0;
242 @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
249 @i @Expr.exprcount@ = @Term.exprcount@ + @Multerm.exprcount@; fprintf(stderr, "(Expr)- Term Multerm\n");
250 @i @Expr.node@ = new_node(O_MUL, @Term.node@, @Multerm.node@, @Expr.exprcount@);
251 @i @Expr.imm@ = @Term.imm@ && @Multerm.imm@;
255 @Term.node@->reg = @Expr.node@->reg;
256 @Term.node@->skip = 0;
257 @Multerm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
263 @i @Expr.exprcount@ = @Term.exprcount@ + @Orterm.exprcount@; fprintf(stderr, "(Expr)- Term Orterm\n");
264 @i @Expr.node@ = new_node(O_OR, @Term.node@, @Orterm.node@, @Expr.exprcount@);
265 @i @Expr.imm@ = @Term.imm@ && @Orterm.imm@;
269 @Term.node@->reg = @Expr.node@->reg;
270 @Term.node@->skip = 0;
271 @Orterm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
277 @i @Expr.exprcount@ = @Term.0.exprcount@ + @Term.1.exprcount@; fprintf(stderr, "(Expr)- Term < Term\n");
278 @i @Expr.node@ = new_node(O_LESS, @Term.0.node@, @Term.1.node@, @Expr.exprcount@);
279 @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
282 @Term.0.node@->reg = @Expr.node@->reg;
283 @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
289 @i @Expr.exprcount@ = @Term.0.exprcount@ + @Term.1.exprcount@; fprintf(stderr, "(Expr)- Term = Term\n");
290 @i @Expr.node@ = new_node(O_EQ, @Term.0.node@, @Term.1.node@, @Expr.exprcount@);
291 @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
294 @Term.0.node@->reg = @Expr.node@->reg;
295 @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
303 @i @Minusterm.0.exprcount@ = @Term.exprcount@ + @Minusterm.1.exprcount@; fprintf(stderr, "(Minusterm)- - Term Minusterm\n");
304 @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@, @Minusterm.0.exprcount@);
305 @i @Minusterm.0.imm@ = @Term.imm@ && @Minusterm.1.imm@;
308 @Minusterm.1.node@->reg = @Minusterm.node@->reg;
309 if(@Minusterm.1.imm@) {
310 @Term.node@->reg = @Minusterm.node@->reg;
312 @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.node@->skip, @Minusterm.gparamges@);
319 @i @Minusterm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Minusterm)- - Term\n");
320 @reg @Term.node@->reg = @Minusterm.node@->reg;
327 @i @Multerm.0.exprcount@ = @Term.exprcount@ + @Multerm.1.exprcount@; fprintf(stderr, "(Multerm)- - Term Multerm\n");
328 @i @Multerm.node@ = new_node(O_MUL, @Multerm.1.node@, @Term.node@, @Multerm.0.exprcount@);
329 @i @Multerm.0.imm@ = @Term.imm@ && @Multerm.1.imm@;
332 @Multerm.1.node@->reg = @Multerm.node@->reg;
333 if(@Multerm.1.imm@) {
334 @Term.node@->reg = @Multerm.node@->reg;
336 @Term.node@->reg = next_reg(@Multerm.1.node@->reg, @Multerm.node@->skip, @Multerm.gparamges@);
343 @i @Multerm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Multerm)- - Term\n");
344 @reg @Term.node@->reg = @Multerm.node@->reg;
351 @i @Orterm.0.exprcount@ = @Term.exprcount@ + @Orterm.1.exprcount@; fprintf(stderr, "(Orterm)- - Term Orterm\n");
352 @i @Orterm.node@ = new_node(O_OR, @Orterm.1.node@, @Term.node@, @Orterm.0.exprcount@);
353 @i @Orterm.0.imm@ = @Term.imm@ && @Orterm.1.imm@;
356 @Orterm.1.node@->reg = @Orterm.node@->reg;
358 @Term.node@->reg = @Orterm.node@->reg;
360 @Term.node@->reg = next_reg(@Orterm.1.node@->reg, @Orterm.node@->skip, @Orterm.gparamges@);
366 @i @Orterm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Orterm)- - Term\n");
367 @reg @Term.node@->reg = @Orterm.node@->reg;
375 @i @Term.node@ = @Expr.node@;
376 @i @Term.exprcount@ = 1 + @Expr.exprcount@; fprintf(stderr, "(Term)- ( Expr )\n");
381 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- NUM\n");
382 @i @Term.node@ = new_number(@NUM.val@, @Term.exprcount@);
388 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- - NUM\n");
389 @i @Term.node@ = new_number(-1 * (@NUM.val@), @Term.exprcount@);
395 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- THIS\n");
396 @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0, @Term.exprcount@);
402 @c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
404 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- IDENT\n");
407 @Term.node@ = TREENULL;
408 if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
409 /* es handelt sich um ein feldzugriff auf this */
410 @Term.node@ = new_field(@IDENT.name@, new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0, @Term.exprcount@), TREENULL, tab_lookup(@Term.s@, @IDENT.name@, S_FIELD) == SYMNULL ? -1 : tab_lookup(@Term.s@, @IDENT.name@, S_FIELD)->soffset, @Term.exprcount@);
411 } else { /* param oder var */
412 @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@);
416 @reg if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
417 /* TODO: kein schoener hack? */
418 @Term.node@->kids[0]->reg = @Term.node@->reg;
424 @i @Term.node@ = @Feld.node@;
425 /*TODO*/@i @Term.exprcount@ = 0;
429 | IDENT '(' Exprs ')'
431 @i @Term.node@ = TREENULL;
432 /*TODO*/@i @Term.exprcount@ = 0;
436 | Term '.' IDENT '(' Exprs ')'
438 @i @Term.node@ = TREENULL;
439 /*TODO*/@i @Term.exprcount@ = 0;
447 /* TODO: exprcount uppen */
456 int yyerror(char *error_text)
458 fprintf(stderr,"Zeile %i: %s\n", yylineno, error_text);
462 int main(int argc, char **argv)