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
28 * f: symboltabelle fuer quirks mit structur und parameter
29 * gparamges: anzahl der parameter in einer methode
30 * parms: parametercounter
31 * node: baum fuer iburg
32 * sin: symboltabelle fuer statement ("eingabe")
33 * sout: symboltabelle die aus einem statement wieder rauskommt ("ausgabe")
38 @attributes { char *name; } IDENT
39 @attributes { long val; } NUM
40 @attributes { struct symbol *f; int paramges; int parms; } Parms
41 @attributes { struct symbol *f; } Program Structdef;
42 @attributes { struct symbol *f; int offsetcount; } FeldID
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; short imm; } Expr Minusterm Multerm Orterm Feld Term
46 @attributes { struct symbol *s; int gparamges; struct treenode *node; } Lexpr
47 @attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; } Statement
49 @traversal @postorder c
50 @traversal @preorder reg
51 @traversal @preorder gen
57 @i @Program.f@ = tab_new();
58 @gen 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 func_header(@IDENT.name@);
89 @i @Structdef.f@ = @FeldID.f@;
90 @i @FeldID.offsetcount@ = 0;
95 /* lokale Vars werden in Statement in die tabelle eingefuegt */
98 @i @Parms.1.parms@ = @Parms.0.parms@ + 1;
99 @i @Parms.0.paramges@ = @Parms.1.paramges@;
100 @i @Parms.0.f@ = tab_add_symbol(@Parms.1.f@, @IDENT.name@, S_PARM, 1, @Parms.parms@, -1);
105 @i @Parms.f@ = tab_new();
106 @i @Parms.paramges@ = @Parms.parms@;
113 @i @FeldID.1.offsetcount@ = @FeldID.0.offsetcount@ + 1;
114 @i @FeldID.0.f@ = tab_add_symbol(@FeldID.1.f@, @IDENT.name@, S_FIELD, 1, -1, @FeldID.0.offsetcount@);
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, -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);
189 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
196 @i @Lexpr.node@ = TREENULL;
197 @c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
199 /* TODO fuer zuweisungen ... (codeb?) */
207 @c check(@Feld.s@, @IDENT.name@, S_FIELD);
208 @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);
210 @reg @Term.node@->reg = @Feld.node@->reg;
217 @reg @Term.node@->reg = @Expr.node@->reg;
222 @i @Expr.node@ = new_node(O_EQ, @Term.node@, new_node(O_NULL, TREENULL, TREENULL));
224 @reg @Term.node@->reg = @Expr.node@->reg;
229 @i @Expr.node@ = new_node(O_SUB, @Term.node@, @Minusterm.node@);
230 @i @Expr.imm@ = @Term.imm@ && @Minusterm.imm@;
233 if(!(@Expr.node@->kids[0] == TREENULL && @Expr.node@->kids[1] == TREENULL)) {
234 @Term.node@->reg = @Expr.node@->reg;
235 if(@Minusterm.imm@) {
236 @Minusterm.node@->reg = @Expr.node@->reg;
238 @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
246 @i @Expr.node@ = new_node(O_MUL, @Term.node@, @Multerm.node@);
247 @i @Expr.imm@ = @Term.imm@ && @Multerm.imm@;
250 @Term.node@->reg = @Expr.node@->reg;
252 @Multerm.node@->reg = @Expr.node@->reg;
254 @Multerm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
261 @i @Expr.node@ = new_node(O_OR, @Term.node@, @Orterm.node@);
262 @i @Expr.imm@ = @Term.imm@ && @Orterm.imm@;
265 @Term.node@->reg = @Expr.node@->reg;
266 @Orterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
272 @i @Expr.node@ = new_node(O_LESS, @Term.0.node@, @Term.1.node@);
273 @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
276 @Term.0.node@->reg = @Expr.node@->reg;
277 @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
283 @i @Expr.node@ = new_node(O_EQ, @Term.0.node@, @Term.1.node@);
284 @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
287 @Term.0.node@->reg = @Expr.node@->reg;
288 @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
296 @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@);
297 @i @Minusterm.0.imm@ = @Term.imm@ && @Minusterm.1.imm@;
300 @Minusterm.1.node@->reg = @Minusterm.node@->reg;
301 if(@Minusterm.1.imm@) {
302 @Term.node@->reg = @Minusterm.node@->reg;
304 @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.gparamges@);
311 @reg @Term.node@->reg = @Minusterm.node@->reg;
318 @i @Multerm.node@ = new_node(O_MUL, @Multerm.1.node@, @Term.node@);
319 @i @Multerm.0.imm@ = @Term.imm@ && @Multerm.1.imm@;
322 @Multerm.1.node@->reg = @Multerm.node@->reg;
323 if(@Multerm.1.imm@) {
324 @Term.node@->reg = @Multerm.node@->reg;
326 @Term.node@->reg = next_reg(@Multerm.1.node@->reg, @Multerm.gparamges@);
333 @reg @Term.node@->reg = @Multerm.node@->reg;
340 @i @Orterm.node@ = new_node(O_OR, @Orterm.1.node@, @Term.node@);
341 @i @Orterm.0.imm@ = @Term.imm@ && @Orterm.1.imm@;
344 @Orterm.1.node@->reg = @Orterm.node@->reg;
346 @Term.node@->reg = @Orterm.node@->reg;
348 @Term.node@->reg = next_reg(@Orterm.1.node@->reg, @Orterm.gparamges@);
354 @reg @Term.node@->reg = @Orterm.node@->reg;
362 @i @Term.node@ = @Expr.node@;
367 @i @Term.node@ = new_number(@NUM.val@);
373 @i @Term.node@ = new_number(-1 * (@NUM.val@));
379 @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0);
385 @c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
389 @Term.node@ = TREENULL;
390 if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
391 /* es handelt sich um ein feldzugriff auf this */
392 @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);
393 } else { /* param oder var */
394 @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);
398 @reg if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
399 /* TODO: kein schoener hack? */
400 @Term.node@->kids[0]->reg = @Term.node@->reg;
406 @i @Term.node@ = @Feld.node@;
410 | IDENT '(' Exprs ')'
412 @i @Term.node@ = TREENULL;
416 | Term '.' IDENT '(' Exprs ')'
418 @i @Term.node@ = TREENULL;
434 int yyerror(char *error_text)
436 fprintf(stderr,"Zeile %i: %s\n", yylineno, error_text);
440 int main(int argc, char **argv)