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; int soffset; } Program
43 @attributes { struct symbol *f; int soffset; int offsetcount; } FeldID Structdef
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; } Expr Minusterm Term Multerm Orterm
47 @attributes { struct symbol *s; int gparamges; struct treenode *node; } Lexpr Feld
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 @i @Program.soffset@ = 0;
60 @gen @revorder(1) printf("\t.text\n");
67 @i @Methoddef.s@ = @Program.0.f@;
68 @i @Program.1.f@ = @Program.0.f@;
69 @i @Program.1.soffset@ = @Program.0.soffset@;
72 | Structdef ';' Program
74 @i @Program.1.f@ = tab_merge(@Program.0.f@, @Structdef.f@, 1);
75 @i @Structdef.offsetcount@ = @Program.0.soffset@;
76 @i @Program.1.soffset@ = @Structdef.soffset@;
82 METHOD IDENT '(' Parms ')' Statseq END
85 @i @Statseq.s@ = tab_merge(@Methoddef.s@, @Parms.f@, 0);
86 @i @Statseq.gparamges@ = @Parms.paramges@;
87 @gen @revorder(1) func_header(@IDENT.name@);
94 @i @Structdef.f@ = @FeldID.f@;
95 @i @FeldID.offsetcount@ = @Structdef.offsetcount@;
96 @i @Structdef.soffset@ = @FeldID.soffset@;
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.soffset@ = @FeldID.1.soffset@;
121 /* TODO: offset hier verwenden */
122 @i @FeldID.0.f@ = tab_add_symbol(@FeldID.1.f@, @IDENT.name@, S_FIELD, 1, -1, @FeldID.0.offsetcount@);
127 @i @FeldID.f@ = tab_new();
128 @i @FeldID.soffset@ = @FeldID.offsetcount@;
133 Statement ';' Statseq
135 @i @Statement.sin@ = @Statseq.0.s@;
136 @i @Statseq.1.s@ = @Statement.sout@;
137 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
149 @i @Statement.node@ = TREENULL;
152 | VAR IDENT ASSIGN Expr
154 /* tab_clone ist hier noetig, vgl. folgendes statement
155 * > var x := x - 1; */
156 @i @Statement.sout@ = tab_add_symbol(tab_clone(@Statement.sin@), @IDENT.name@, S_VAR, 1, -1, -1);
158 @i @Statement.node@ = TREENULL;
165 @i @Statement.node@ = TREENULL;
168 | IF Expr THEN Statseq END
172 xxputsin(@Statseq.s@,)
173 @i @Statement.node@ = TREENULL;
176 | IF Expr THEN Statseq ELSE Statseq END
180 xxputsin(@Statseq.0.s@,)
181 xxputsin(@Statseq.1.s@,)
182 @i @Statement.node@ = TREENULL;
185 | WHILE Expr DO Statseq END
189 xxputsin(@Statseq.s@,)
190 @i @Statement.node@ = TREENULL;
197 @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);
198 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, 0, @Expr.gparamges@);
205 @i @Lexpr.node@ = TREENULL;
206 @c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
214 @c check(@Feld.s@, @IDENT.name@, S_FIELD);
215 @i @Feld.node@ = TREENULL;
222 @reg @Term.node@->reg = @Expr.node@->reg;
223 @i @Expr.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Expr)- Term\n");
228 @i @Expr.node@ = TREENULL;
229 @i @Expr.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Expr)- NOT Term\n");
234 @i @Expr.exprcount@ = @Term.exprcount@ + @Minusterm.exprcount@; fprintf(stderr, "(Expr)- Term Minusterm\n");
235 @i @Expr.node@ = new_node(O_SUB, @Term.node@, @Minusterm.node@, @Expr.exprcount@);
239 @Term.node@->reg = @Expr.node@->reg;
240 @Term.node@->skip = 0;
241 @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
247 @i @Expr.exprcount@ = @Term.exprcount@ + @Multerm.exprcount@; fprintf(stderr, "(Expr)- Term Multerm\n");
248 @i @Expr.node@ = new_node(O_MUL, @Term.node@, @Multerm.node@, @Expr.exprcount@);
252 @Term.node@->reg = @Expr.node@->reg;
253 @Term.node@->skip = 0;
254 @Multerm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
260 @i @Expr.exprcount@ = @Term.exprcount@ + @Orterm.exprcount@; fprintf(stderr, "(Expr)- Term Orterm\n");
261 @i @Expr.node@ = new_node(O_OR, @Term.node@, @Orterm.node@, @Expr.exprcount@);
265 @Term.node@->reg = @Expr.node@->reg;
266 @Term.node@->skip = 0;
267 @Orterm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
273 @i @Expr.exprcount@ = @Term.0.exprcount@ + @Term.1.exprcount@; fprintf(stderr, "(Expr)- Term < Term\n");
274 @i @Expr.node@ = new_node(O_LESS, @Term.0.node@, @Term.1.node@, @Expr.exprcount@);
277 @Term.0.node@->reg = @Expr.node@->reg;
278 @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
284 @i @Expr.exprcount@ = @Term.0.exprcount@ + @Term.1.exprcount@; fprintf(stderr, "(Expr)- Term = Term\n");
285 @i @Expr.node@ = new_node(O_EQ, @Term.0.node@, @Term.1.node@, @Expr.exprcount@);
288 @Term.0.node@->reg = @Expr.node@->reg;
289 @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
297 @i @Minusterm.0.exprcount@ = @Term.exprcount@ + @Minusterm.1.exprcount@; fprintf(stderr, "(Minusterm)- - Term Minusterm\n");
298 @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@, @Minusterm.0.exprcount@);
301 @Minusterm.1.node@->reg = @Minusterm.node@->reg;
302 @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.node@->skip, @Minusterm.gparamges@);
308 @i @Minusterm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Minusterm)- - Term\n");
309 @reg @Term.node@->reg = @Minusterm.node@->reg;
316 @i @Multerm.0.exprcount@ = @Term.exprcount@ + @Multerm.1.exprcount@; fprintf(stderr, "(Multerm)- - Term Multerm\n");
317 @i @Multerm.node@ = new_node(O_MUL, @Multerm.1.node@, @Term.node@, @Multerm.0.exprcount@);
320 @Multerm.1.node@->reg = @Multerm.node@->reg;
321 @Term.node@->reg = next_reg(@Multerm.1.node@->reg, @Multerm.node@->skip, @Multerm.gparamges@);
327 @i @Multerm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Multerm)- - Term\n");
328 @reg @Term.node@->reg = @Multerm.node@->reg;
335 @i @Orterm.0.exprcount@ = @Term.exprcount@ + @Orterm.1.exprcount@; fprintf(stderr, "(Orterm)- - Term Orterm\n");
336 @i @Orterm.node@ = new_node(O_OR, @Orterm.1.node@, @Term.node@, @Orterm.0.exprcount@);
339 @Orterm.1.node@->reg = @Orterm.node@->reg;
340 @Term.node@->reg = next_reg(@Orterm.1.node@->reg, @Orterm.node@->skip, @Orterm.gparamges@);
345 @i @Orterm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Orterm)- - Term\n");
346 @reg @Term.node@->reg = @Orterm.node@->reg;
354 @i @Term.node@ = @Expr.node@;
355 @i @Term.exprcount@ = 1 + @Expr.exprcount@; fprintf(stderr, "(Term)- ( Expr )\n");
360 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- NUM\n");
361 @i @Term.node@ = new_number(@NUM.val@, @Term.exprcount@);
366 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- - NUM\n");
367 @i @Term.node@ = new_number(-1 * (@NUM.val@), @Term.exprcount@);
372 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- THIS\n");
373 @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0, @Term.exprcount@);
378 @c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
379 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- IDENT\n");
380 @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@);
385 @i @Term.node@ = TREENULL;
386 /*TODO*/@i @Term.exprcount@ = 0;
389 | IDENT '(' Exprs ')'
391 @i @Term.node@ = TREENULL;
392 /*TODO*/@i @Term.exprcount@ = 0;
395 | Term '.' IDENT '(' Exprs ')'
397 @i @Term.node@ = TREENULL;
398 /*TODO*/@i @Term.exprcount@ = 0;
405 /* TODO: exprcount uppen */
414 int yyerror(char *error_text)
416 fprintf(stderr,"Zeile %i: %s\n", yylineno, error_text);
420 int main(int argc, char **argv)