@end
/* beschreibung der attribute
- * s:
- * f:
- * gparamges:
- * parms:
- * node:
- * exprcount:
- * sin:
- * sout:
+ * s: symboltabelle
+ * f: symboltabelle fuer quirks mit structur und parameter
+ * gparamges: anzahl der parameter in einer methode
+ * parms: parametercounter
+ * node: baum fuer iburg
+ * sin: symboltabelle fuer statement ("eingabe")
+ * sout: symboltabelle die aus einem statement wieder rauskommt ("ausgabe")
*/
@autoinh s gparamges
-@autosyn node
+@autosyn node imm
@attributes { char *name; } IDENT
@attributes { long val; } NUM
@attributes { struct symbol *f; int offsetcount; } FeldID
@attributes { struct symbol *s; } Methoddef
@attributes { struct symbol *s; int gparamges; } Statseq Exprs
-@attributes { struct symbol *s; int gparamges; struct treenode *node; int exprcount; } Expr Minusterm Multerm Orterm Feld Term
+@attributes { struct symbol *s; int gparamges; struct treenode *node; short imm; } Expr Minusterm Multerm Orterm Feld Term
@attributes { struct symbol *s; int gparamges; struct treenode *node; } Lexpr
@attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; } Statement
@traversal @postorder c
@traversal @preorder reg
-@traversal @postorder gen
+@traversal @preorder gen
%%
Input:
Program
@{
@i @Program.f@ = tab_new();
- @gen @revorder(1) printf("\t.text\n");
+ @gen printf("\t.text\n");
@}
;
@i @Parms.parms@ = 1;
@i @Statseq.s@ = tab_merge(@Methoddef.s@, @Parms.f@, 0);
@i @Statseq.gparamges@ = @Parms.paramges@;
- @gen @revorder(1) func_header(@IDENT.name@);
+ @gen func_header(@IDENT.name@);
@}
;
@{
statinout()
xxputsin(@Expr.s@,)
- @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);
- @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, 0, @Expr.gparamges@);
+ @i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL);
+ @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
@}
;
Feld: Term '.' IDENT
@{
@c check(@Feld.s@, @IDENT.name@, S_FIELD);
- @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@);
+ @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);
- @i @Feld.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Feld)- Term.IDENT\n");
@reg @Term.node@->reg = @Feld.node@->reg;
@}
;
Term
@{
@reg @Term.node@->reg = @Expr.node@->reg;
- @i @Expr.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Expr)- Term\n");
@}
| NOT Term
@{
- @i @Expr.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Expr)- NOT Term\n");
- @i @Expr.node@ = new_node(O_EQ, @Term.node@, new_node(O_NULL, TREENULL, TREENULL, @Expr.exprcount@), @Expr.exprcount@);
+ @i @Expr.node@ = new_node(O_EQ, @Term.node@, new_node(O_NULL, TREENULL, TREENULL));
@reg @Term.node@->reg = @Expr.node@->reg;
@}
| Term Minusterm
@{
- @i @Expr.exprcount@ = @Term.exprcount@ + @Minusterm.exprcount@; fprintf(stderr, "(Expr)- Term Minusterm\n");
- @i @Expr.node@ = new_node(O_SUB, @Term.node@, @Minusterm.node@, @Expr.exprcount@);
+ @i @Expr.node@ = new_node(O_SUB, @Term.node@, @Minusterm.node@);
+ @i @Expr.imm@ = @Term.imm@ && @Minusterm.imm@;
@reg {
- /* TODO */
- @Term.node@->reg = @Expr.node@->reg;
- @Term.node@->skip = 0;
- @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
+ if(!(@Expr.node@->kids[0] == TREENULL && @Expr.node@->kids[1] == TREENULL)) {
+ @Term.node@->reg = @Expr.node@->reg;
+ if(@Minusterm.imm@) {
+ @Minusterm.node@->reg = @Expr.node@->reg;
+ } else {
+ @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
+ }
+ }
}
@}
| Term Multerm
@{
- @i @Expr.exprcount@ = @Term.exprcount@ + @Multerm.exprcount@; fprintf(stderr, "(Expr)- Term Multerm\n");
- @i @Expr.node@ = new_node(O_MUL, @Term.node@, @Multerm.node@, @Expr.exprcount@);
+ @i @Expr.node@ = new_node(O_MUL, @Term.node@, @Multerm.node@);
+ @i @Expr.imm@ = @Term.imm@ && @Multerm.imm@;
@reg {
- /* TODO */
@Term.node@->reg = @Expr.node@->reg;
- @Term.node@->skip = 0;
- @Multerm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
+ if(@Term.imm@) {
+ @Multerm.node@->reg = @Expr.node@->reg;
+ } else {
+ @Multerm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
+ }
}
@}
| Term Orterm
@{
- @i @Expr.exprcount@ = @Term.exprcount@ + @Orterm.exprcount@; fprintf(stderr, "(Expr)- Term Orterm\n");
- @i @Expr.node@ = new_node(O_OR, @Term.node@, @Orterm.node@, @Expr.exprcount@);
+ @i @Expr.node@ = new_node(O_OR, @Term.node@, @Orterm.node@);
+ @i @Expr.imm@ = @Term.imm@ && @Orterm.imm@;
@reg {
- /* TODO */
@Term.node@->reg = @Expr.node@->reg;
- @Term.node@->skip = 0;
- @Orterm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
+ @Orterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
}
@}
| Term '<' Term
@{
- @i @Expr.exprcount@ = @Term.0.exprcount@ + @Term.1.exprcount@; fprintf(stderr, "(Expr)- Term < Term\n");
- @i @Expr.node@ = new_node(O_LESS, @Term.0.node@, @Term.1.node@, @Expr.exprcount@);
+ @i @Expr.node@ = new_node(O_LESS, @Term.0.node@, @Term.1.node@);
+ @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
@reg {
@Term.0.node@->reg = @Expr.node@->reg;
- @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
+ @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
}
@}
| Term '=' Term
@{
- @i @Expr.exprcount@ = @Term.0.exprcount@ + @Term.1.exprcount@; fprintf(stderr, "(Expr)- Term = Term\n");
- @i @Expr.node@ = new_node(O_EQ, @Term.0.node@, @Term.1.node@, @Expr.exprcount@);
+ @i @Expr.node@ = new_node(O_EQ, @Term.0.node@, @Term.1.node@);
+ @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
@reg {
@Term.0.node@->reg = @Expr.node@->reg;
- @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
+ @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
}
@}
;
Minusterm:
'-' Term Minusterm
@{
- @i @Minusterm.0.exprcount@ = @Term.exprcount@ + @Minusterm.1.exprcount@; fprintf(stderr, "(Minusterm)- - Term Minusterm\n");
- @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@, @Minusterm.0.exprcount@);
+ @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@);
+ @i @Minusterm.0.imm@ = @Term.imm@ && @Minusterm.1.imm@;
@reg {
@Minusterm.1.node@->reg = @Minusterm.node@->reg;
- @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.node@->skip, @Minusterm.gparamges@);
+ if(@Minusterm.1.imm@) {
+ @Term.node@->reg = @Minusterm.node@->reg;
+ } else {
+ @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.gparamges@);
+ }
}
@}
| '-' Term
@{
- @i @Minusterm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Minusterm)- - Term\n");
@reg @Term.node@->reg = @Minusterm.node@->reg;
@}
;
Multerm:
'*' Term Multerm
@{
- @i @Multerm.0.exprcount@ = @Term.exprcount@ + @Multerm.1.exprcount@; fprintf(stderr, "(Multerm)- - Term Multerm\n");
- @i @Multerm.node@ = new_node(O_MUL, @Multerm.1.node@, @Term.node@, @Multerm.0.exprcount@);
+ @i @Multerm.node@ = new_node(O_MUL, @Multerm.1.node@, @Term.node@);
+ @i @Multerm.0.imm@ = @Term.imm@ && @Multerm.1.imm@;
@reg {
@Multerm.1.node@->reg = @Multerm.node@->reg;
- @Term.node@->reg = next_reg(@Multerm.1.node@->reg, @Multerm.node@->skip, @Multerm.gparamges@);
+ if(@Multerm.1.imm@) {
+ @Term.node@->reg = @Multerm.node@->reg;
+ } else {
+ @Term.node@->reg = next_reg(@Multerm.1.node@->reg, @Multerm.gparamges@);
+ }
}
@}
| '*' Term
@{
- @i @Multerm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Multerm)- - Term\n");
@reg @Term.node@->reg = @Multerm.node@->reg;
@}
;
Orterm:
OR Term Orterm
@{
- @i @Orterm.0.exprcount@ = @Term.exprcount@ + @Orterm.1.exprcount@; fprintf(stderr, "(Orterm)- - Term Orterm\n");
- @i @Orterm.node@ = new_node(O_OR, @Orterm.1.node@, @Term.node@, @Orterm.0.exprcount@);
+ @i @Orterm.node@ = new_node(O_OR, @Orterm.1.node@, @Term.node@);
+ @i @Orterm.0.imm@ = @Term.imm@ && @Orterm.1.imm@;
@reg {
@Orterm.1.node@->reg = @Orterm.node@->reg;
- @Term.node@->reg = next_reg(@Orterm.1.node@->reg, @Orterm.node@->skip, @Orterm.gparamges@);
+ if(@Orterm.1.imm@) {
+ @Term.node@->reg = @Orterm.node@->reg;
+ } else {
+ @Term.node@->reg = next_reg(@Orterm.1.node@->reg, @Orterm.gparamges@);
+ }
}
@}
| OR Term
@{
- @i @Orterm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Orterm)- - Term\n");
@reg @Term.node@->reg = @Orterm.node@->reg;
@}
'(' Expr ')'
@{
@i @Term.node@ = @Expr.node@;
- @i @Term.exprcount@ = 1 + @Expr.exprcount@; fprintf(stderr, "(Term)- ( Expr )\n");
@}
| NUM
@{
- @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- NUM\n");
- @i @Term.node@ = new_number(@NUM.val@, @Term.exprcount@);
+ @i @Term.node@ = new_number(@NUM.val@);
+ @i @Term.imm@ = 1;
@}
| '-' NUM
@{
- @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- - NUM\n");
- @i @Term.node@ = new_number(-1 * (@NUM.val@), @Term.exprcount@);
+ @i @Term.node@ = new_number(-1 * (@NUM.val@));
+ @i @Term.imm@ = 1;
@}
| THIS
@{
- @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- THIS\n");
- @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0, @Term.exprcount@);
+ @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0);
+ @i @Term.imm@ = 0;
@}
| IDENT
@{
@c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
- @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- IDENT\n");
+ @i @Term.imm@ = 0;
@i {
@Term.node@ = TREENULL;
if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
/* es handelt sich um ein feldzugriff auf this */
- @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@);
+ @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);
} else { /* param oder var */
- @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@);
+ @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);
}
}
| Feld
@{
@i @Term.node@ = @Feld.node@;
- /*TODO*/@i @Term.exprcount@ = 0;
+ @i @Term.imm@ = 0;
@}
| IDENT '(' Exprs ')'
@{
@i @Term.node@ = TREENULL;
- /*TODO*/@i @Term.exprcount@ = 0;
+ @i @Term.imm@ = 0;
@}
| Term '.' IDENT '(' Exprs ')'
@{
@i @Term.node@ = TREENULL;
- /*TODO*/@i @Term.exprcount@ = 0;
+ @i @Term.imm@ = 0;
@}
;
Exprs:
Expr ',' Exprs
- /* TODO: exprcount uppen */
| Expr
|
;
projects / uebersetzerbau-ss10.git / blobdiff