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
40 @attributes { char *name; } IDENT
41 @attributes { long val; } NUM
42 @attributes { struct symbol *f; int paramges; int parms; } Parms
43 @attributes { struct symbol *f; } FeldID Structdef Program
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; short imm; int exprcount; } Expr Minusterm Term
47 @attributes { struct symbol *s; int gparamges; struct treenode *node; int exprcount; } Orterm Multerm
48 @attributes { struct symbol *s; int gparamges; struct treenode *node; } Lexpr Feld
49 @attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; } Statement
51 @traversal @postorder c
52 @traversal @preorder reg
53 @traversal @postorder gen
59 @i @Program.f@ = tab_new();
60 @gen @revorder(1) printf("\t.text\n");
67 @i @Methoddef.s@ = @Program.0.f@;
68 @i @Program.1.f@ = @Program.0.f@;
71 | Structdef ';' Program
73 @i @Program.1.f@ = tab_merge(@Program.0.f@, @Structdef.f@, 1);
79 METHOD IDENT '(' Parms ')' Statseq END
82 @i @Statseq.s@ = tab_merge(@Methoddef.s@, @Parms.f@, 0);
83 @i @Statseq.gparamges@ = @Parms.paramges@;
84 @gen @revorder(1) func_header(@IDENT.name@);
91 @i @Structdef.f@ = @FeldID.f@;
96 /* lokale Vars werden in Statement in die tabelle eingefuegt */
99 @i @Parms.1.parms@ = @Parms.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@);
106 @i @Parms.f@ = tab_new();
107 @i @Parms.paramges@ = @Parms.parms@;
114 @i @FeldID.0.f@ = tab_add_symbol(@FeldID.1.f@, @IDENT.name@, S_FIELD, 1, -1);
119 @i @FeldID.f@ = tab_new();
124 Statement ';' Statseq
126 @i @Statement.sin@ = @Statseq.0.s@;
127 @i @Statseq.1.s@ = @Statement.sout@;
128 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
140 @i @Statement.node@ = TREENULL;
143 | VAR IDENT ASSIGN Expr
145 /* tab_clone ist hier noetig, vgl. folgendes statement
146 * > var x := x - 1; */
147 @i @Statement.sout@ = tab_add_symbol(tab_clone(@Statement.sin@), @IDENT.name@, S_VAR, 1, -1);
149 @i @Statement.node@ = TREENULL;
156 @i @Statement.node@ = TREENULL;
159 | IF Expr THEN Statseq END
163 xxputsin(@Statseq.s@,)
164 @i @Statement.node@ = TREENULL;
167 | IF Expr THEN Statseq ELSE Statseq END
171 xxputsin(@Statseq.0.s@,)
172 xxputsin(@Statseq.1.s@,)
173 @i @Statement.node@ = TREENULL;
176 | WHILE Expr DO Statseq END
180 xxputsin(@Statseq.s@,)
181 @i @Statement.node@ = TREENULL;
188 @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);
189 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, 0, @Expr.gparamges@);
196 @i @Lexpr.node@ = TREENULL;
197 @c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
205 @c check(@Feld.s@, @IDENT.name@, S_FIELD);
206 @i @Feld.node@ = TREENULL;
213 @reg @Term.node@->reg = @Expr.node@->reg;
214 @i @Expr.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Expr)- Term\n");
219 @i @Expr.node@ = TREENULL;
220 @i @Expr.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Expr)- NOT Term\n");
225 @i @Expr.exprcount@ = @Term.exprcount@ + @Minusterm.exprcount@; fprintf(stderr, "(Expr)- Term Minusterm\n");
226 @i @Expr.node@ = new_node(O_SUB, @Term.node@, @Minusterm.node@, @Expr.exprcount@);
227 @i @Expr.imm@ = @Term.imm@ && @Minusterm.imm@;
231 @Term.node@->reg = @Expr.node@->reg;
232 @Term.node@->skip = 0;
233 @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
239 @i @Expr.node@ = TREENULL;
240 @i @Expr.exprcount@ = @Term.exprcount@ + @Multerm.exprcount@; fprintf(stderr, "(Expr)- Term Multerm\n");
245 @i @Expr.node@ = TREENULL;
246 @i @Expr.exprcount@ = @Term.exprcount@ + @Orterm.exprcount@; fprintf(stderr, "(Expr)- Term Orterm\n");
251 @i @Expr.node@ = TREENULL;
252 /* das is bloedsinn atm */ @i @Expr.imm@ = @Term.0.imm@ && @Term.1.imm@;
253 @i @Expr.exprcount@ = @Term.0.exprcount@ + @Term.1.exprcount@; fprintf(stderr, "(Expr)- Term < Term\n");
258 @i @Expr.node@ = TREENULL;
259 /* das is bloedsinn atm */ @i @Expr.imm@ = @Term.0.imm@ && @Term.1.imm@;
260 @i @Expr.exprcount@ = @Term.0.exprcount@ + @Term.1.exprcount@; fprintf(stderr, "(Expr)- Term = Term\n");
267 @i @Minusterm.0.exprcount@ = @Term.exprcount@ + @Minusterm.1.exprcount@; fprintf(stderr, "(Minusterm)- - Term Minusterm\n");
268 @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@, @Minusterm.0.exprcount@);
269 @i @Minusterm.imm@ = @Term.imm@ && @Minusterm.1.imm@;
272 @Minusterm.1.node@->reg = @Minusterm.node@->reg;
273 @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.node@->skip, @Minusterm.gparamges@);
279 @i @Minusterm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Minusterm)- - Term\n");
280 @reg @Term.node@->reg = @Minusterm.node@->reg;
287 @i @Multerm.0.exprcount@ = @Term.exprcount@ + @Multerm.1.exprcount@; fprintf(stderr, "(Multerm)- - Term Multerm\n");
290 @i @Multerm.node@ = TREENULL;
295 @i @Multerm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Multerm)- - Term\n");
297 @i @Multerm.node@ = TREENULL;
304 @i @Orterm.0.exprcount@ = @Term.exprcount@ + @Orterm.1.exprcount@; fprintf(stderr, "(Orterm)- - Term Orterm\n");
307 @i @Orterm.node@ = TREENULL;
311 @i @Orterm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Orterm)- - Term\n");
313 @i @Orterm.node@ = TREENULL;
321 @i @Term.node@ = @Expr.node@;
322 @i @Term.exprcount@ = 1 + @Expr.exprcount@; fprintf(stderr, "(Term)- ( Expr )\n");
327 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- NUM\n");
328 @i @Term.node@ = new_number(@NUM.val@, @Term.exprcount@);
334 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- - NUM\n");
335 @i @Term.node@ = new_number(-1 * (@NUM.val@), @Term.exprcount@);
341 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- THIS\n");
342 @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0, @Term.exprcount@);
348 @c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
349 @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- IDENT\n");
350 @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@);
356 @i @Term.node@ = TREENULL;
358 /*TODO*/@i @Term.exprcount@ = 0;
361 | IDENT '(' Exprs ')'
363 @i @Term.node@ = TREENULL;
365 /*TODO*/@i @Term.exprcount@ = 0;
368 | Term '.' IDENT '(' Exprs ')'
370 @i @Term.node@ = TREENULL;
372 /*TODO*/@i @Term.exprcount@ = 0;
379 /* TODO: exprcount uppen */
388 int yyerror(char *error_text)
390 fprintf(stderr,"Zeile %i: %s\n", yylineno, error_text);
394 int main(int argc, char **argv)