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
48 treenode *node; int vars; } Statement
50 @traversal @postorder c
51 @traversal @preorder reg
52 @traversal @preorder gen
58 @i @Program.f@ = tab_new();
59 @gen 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 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 @i @Statseq.1.gparamges@ = @Statseq.0.gparamges@ + @Statement.vars@;
141 @i @Statement.node@ = new_node(O_ASSIGN, @Lexpr.node@, @Expr.node@);
142 @i @Statement.vars@ = 0;
143 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
145 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
148 | VAR IDENT ASSIGN Expr
150 /* tab_clone ist hier noetig, vgl. folgendes statement
151 * > var x := x - 1; */
152 @i @Statement.sout@ = tab_add_symbol(tab_clone(@Statement.sin@), @IDENT.name@, S_VAR, 1, @Statement.gparamges@, -1);
155 @i @Statement.node@ = new_node(O_ASSIGN, new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, @Statement.gparamges@), @Expr.node@);
156 @i @Statement.vars@ = 1;
157 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
159 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
166 @i @Statement.node@ = TREENULL;
167 @i @Statement.vars@ = 0;
170 | IF Expr THEN Statseq END
174 xxputsin(@Statseq.s@,)
175 @i @Statement.node@ = TREENULL;
176 @i @Statement.vars@ = 0;
179 | IF Expr THEN Statseq ELSE Statseq END
183 xxputsin(@Statseq.0.s@,)
184 xxputsin(@Statseq.1.s@,)
185 @i @Statement.node@ = TREENULL;
186 @i @Statement.vars@ = 0;
189 | WHILE Expr DO Statseq END
193 xxputsin(@Statseq.s@,)
194 @i @Statement.node@ = TREENULL;
195 @i @Statement.vars@ = 0;
202 @i @Statement.vars@ = 0;
203 @i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL);
204 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
206 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
213 @c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
215 /* TODO: selbe Code wie bei Term/IDENT -- schoener machen! */
217 @Lexpr.node@ = TREENULL;
218 if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
219 /* es handelt sich um ein feldzugriff auf this */
220 @Lexpr.node@ = new_field(@IDENT.name@, new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0), TREENULL, tab_lookup(@Lexpr.s@, @IDENT.name@, S_FIELD) == SYMNULL ? -1 : tab_lookup(@Lexpr.s@, @IDENT.name@, S_FIELD)->soffset);
221 } else { /* param oder var */
222 int tmp = tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL ? -1 : tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM)->param_index;
223 @Lexpr.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
227 @reg if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
228 /* TODO: kein schoener hack? */
229 @Lexpr.node@->kids[0]->reg = @Lexpr.node@->reg;
238 @c check(@Feld.s@, @IDENT.name@, S_FIELD);
239 @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);
241 @reg @Term.node@->reg = @Feld.node@->reg;
248 @reg @Term.node@->reg = @Expr.node@->reg;
253 @i @Expr.node@ = new_node(O_EQ, @Term.node@, new_node(O_NULL, TREENULL, TREENULL));
255 @reg @Term.node@->reg = @Expr.node@->reg;
260 @i @Expr.node@ = new_node(O_SUB, @Term.node@, @Minusterm.node@);
261 @i @Expr.imm@ = @Term.imm@ && @Minusterm.imm@;
264 if(!(@Expr.node@->kids[0] == TREENULL && @Expr.node@->kids[1] == TREENULL)) {
265 @Term.node@->reg = @Expr.node@->reg;
266 if(@Minusterm.imm@) {
267 @Minusterm.node@->reg = @Expr.node@->reg;
269 @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
277 @i @Expr.node@ = new_node(O_MUL, @Term.node@, @Multerm.node@);
278 @i @Expr.imm@ = @Term.imm@ && @Multerm.imm@;
281 @Term.node@->reg = @Expr.node@->reg;
283 @Multerm.node@->reg = @Expr.node@->reg;
285 @Multerm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
292 @i @Expr.node@ = new_node(O_OR, @Term.node@, @Orterm.node@);
293 @i @Expr.imm@ = @Term.imm@ && @Orterm.imm@;
296 @Term.node@->reg = @Expr.node@->reg;
297 @Orterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
303 @i @Expr.node@ = new_node(O_LESS, @Term.0.node@, @Term.1.node@);
304 @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
307 @Term.0.node@->reg = @Expr.node@->reg;
308 @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
314 @i @Expr.node@ = new_node(O_EQ, @Term.0.node@, @Term.1.node@);
315 @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
318 @Term.0.node@->reg = @Expr.node@->reg;
319 @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
327 @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@);
328 @i @Minusterm.0.imm@ = @Term.imm@ && @Minusterm.1.imm@;
331 @Minusterm.1.node@->reg = @Minusterm.node@->reg;
332 if(@Minusterm.1.imm@) {
333 @Term.node@->reg = @Minusterm.node@->reg;
335 @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.gparamges@);
342 @reg @Term.node@->reg = @Minusterm.node@->reg;
349 @i @Multerm.node@ = new_node(O_MUL, @Multerm.1.node@, @Term.node@);
350 @i @Multerm.0.imm@ = @Term.imm@ && @Multerm.1.imm@;
353 @Multerm.1.node@->reg = @Multerm.node@->reg;
354 if(@Multerm.1.imm@) {
355 @Term.node@->reg = @Multerm.node@->reg;
357 @Term.node@->reg = next_reg(@Multerm.1.node@->reg, @Multerm.gparamges@);
364 @reg @Term.node@->reg = @Multerm.node@->reg;
371 @i @Orterm.node@ = new_node(O_OR, @Orterm.1.node@, @Term.node@);
372 @i @Orterm.0.imm@ = @Term.imm@ && @Orterm.1.imm@;
375 @Orterm.1.node@->reg = @Orterm.node@->reg;
377 @Term.node@->reg = @Orterm.node@->reg;
379 @Term.node@->reg = next_reg(@Orterm.1.node@->reg, @Orterm.gparamges@);
385 @reg @Term.node@->reg = @Orterm.node@->reg;
393 @i @Term.node@ = @Expr.node@;
398 @i @Term.node@ = new_number(@NUM.val@);
404 @i @Term.node@ = new_number(-1 * (@NUM.val@));
410 @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0);
416 @c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
420 @Term.node@ = TREENULL;
421 if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
422 /* es handelt sich um ein feldzugriff auf this */
423 @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);
424 } else { /* param oder var */
425 int tmp = tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL ? -1 : tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM)->param_index;
426 @Term.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
430 @reg if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
431 /* TODO: kein schoener hack? */
432 @Term.node@->kids[0]->reg = @Term.node@->reg;
438 @i @Term.node@ = @Feld.node@;
442 | IDENT '(' Exprs ')'
444 @i @Term.node@ = TREENULL;
448 | Term '.' IDENT '(' Exprs ')'
450 @i @Term.node@ = TREENULL;
466 int yyerror(char *error_text)
468 fprintf(stderr,"Zeile %i: %s\n", yylineno, error_text);
472 int main(int argc, char **argv)