#include "symtable.h"
#include "chelper.h"
#include "tree.h"
+
+ #define MAX(A,B) (A > B ? A : B)
%}
%start Input
* geht nicht, weil verschachtelte macros deaktiviert sind */
@end
-@autoinh s
+/* beschreibung der attribute
+ * s:
+ * f:
+ * gparamges:
+ * parms:
+ * node:
+ * imm:
+ * exprcount:
+ * sin:
+ * sout:
+ */
+@autoinh s gparamges
@autosyn node imm
@attributes { char *name; } IDENT
@attributes { long val; } NUM
-@attributes { struct symbol *f; int parms; } Parms
+@attributes { struct symbol *f; int paramges; int parms; } Parms
@attributes { struct symbol *f; } FeldID Structdef Program
-@attributes { struct symbol *s; } Methoddef Statseq Exprs
-@attributes { struct symbol *s; struct treenode *node; short imm; } Expr Minusterm Term
-@attributes { struct symbol *s; struct treenode *node; } Lexpr Multerm Orterm Feld
-@attributes { struct symbol *sin; struct symbol *sout; struct treenode *node; } Statement
+@attributes { struct symbol *s; } Methoddef
+@attributes { struct symbol *s; int gparamges; } Statseq Exprs
+@attributes { struct symbol *s; int gparamges; struct treenode *node; short imm; int exprcount; } Expr Minusterm Term
+@attributes { struct symbol *s; int gparamges; struct treenode *node; int exprcount; } Orterm Multerm
+@attributes { struct symbol *s; int gparamges; struct treenode *node; } Lexpr Feld
+@attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; } Statement
@traversal @postorder c
@traversal @preorder reg
@{
@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@);
@}
;
IDENT Parms
@{
@i @Parms.1.parms@ = @Parms.parms@ + 1;
+ @i @Parms.0.paramges@ = @Parms.1.paramges@;
@i @Parms.0.f@ = tab_add_symbol(@Parms.1.f@, @IDENT.name@, S_PARM, 1, @Parms.parms@);
@}
|
@{
@i @Parms.f@ = tab_new();
+ @i @Parms.paramges@ = @Parms.parms@;
@}
;
@{
statinout()
xxputsin(@Expr.s@,)
- @i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL);
- @reg @Statement.node@->reg = next_reg((char *)NULL, 0); @Expr.node@->reg = @Statement.node@->reg;
+ @i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL, @Expr.exprcount@+1); if(@Expr.gparamges@ + @Expr.exprcount@ + 1 > 7) { fprintf(stderr, "RETURN: zu hohe tiefe (gparamges: %i, exprcount: %i, gesamt %i [maximal: 7])\n", @Expr.gparamges@, @Expr.exprcount@+1, @Expr.gparamges@+@Expr.exprcount@+1); }
+ @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, 0, @Expr.gparamges@);
@}
;
Term
@{
@reg @Term.node@->reg = @Expr.node@->reg;
+ @i @Expr.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Expr)- Term\n");
@}
| NOT Term
@{
@i @Expr.node@ = TREENULL;
+ @i @Expr.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Expr)- NOT Term\n");
@}
| Term Minusterm
@{
- @i @Expr.node@ = new_node(O_SUB, @Minusterm.node@, @Term.node@);
+ @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.imm@ = @Term.imm@ && @Minusterm.imm@;
@reg {
/* TODO */
- fprintf(stderr, "at_expr: Minusterm.imm \"%i\", Term.imm \"%i\"\n", @Minusterm.imm@, @Term.imm@);
- #if 0
- if(@Minusterm.imm@) {
- @Minusterm.node@->reg = @Expr.node@->reg;
- @Term.node@->reg = next_reg(@Minusterm.node@->reg, @Expr.node@->skip);
- @Minusterm.node@->skip = 1;
- } else {
- #endif
- @Term.node@->reg = @Expr.node@->reg;
- @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip);
+ @Term.node@->reg = @Expr.node@->reg;
+ @Term.node@->skip = 0;
+ @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip, @Expr.gparamges@);
}
@}
| Term Multerm
@{
@i @Expr.node@ = TREENULL;
+ @i @Expr.exprcount@ = @Term.exprcount@ + @Multerm.exprcount@; fprintf(stderr, "(Expr)- Term Multerm\n");
@}
| Term Orterm
@{
@i @Expr.node@ = TREENULL;
+ @i @Expr.exprcount@ = @Term.exprcount@ + @Orterm.exprcount@; fprintf(stderr, "(Expr)- Term Orterm\n");
@}
| Term '<' Term
@{
@i @Expr.node@ = TREENULL;
/* das is bloedsinn atm */ @i @Expr.imm@ = @Term.0.imm@ && @Term.1.imm@;
+ @i @Expr.exprcount@ = @Term.0.exprcount@ + @Term.1.exprcount@; fprintf(stderr, "(Expr)- Term < Term\n");
@}
| Term '=' Term
@{
@i @Expr.node@ = TREENULL;
/* das is bloedsinn atm */ @i @Expr.imm@ = @Term.0.imm@ && @Term.1.imm@;
+ @i @Expr.exprcount@ = @Term.0.exprcount@ + @Term.1.exprcount@; fprintf(stderr, "(Expr)- Term = Term\n");
@}
;
Minusterm:
'-' Term Minusterm
@{
- @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@);
+ @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.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);
+ @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.node@->skip, @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");
+ /* TODO */
+ /* TODO: imm */
@i @Multerm.node@ = TREENULL;
@}
| '*' Term
@{
+ @i @Multerm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Multerm)- - Term\n");
+ /* TODO */
@i @Multerm.node@ = TREENULL;
@}
;
Orterm:
OR Term Orterm
@{
+ @i @Orterm.0.exprcount@ = @Term.exprcount@ + @Orterm.1.exprcount@; fprintf(stderr, "(Orterm)- - Term Orterm\n");
+ /* TODO */
+ /* TODO: imm */
@i @Orterm.node@ = TREENULL;
@}
| OR Term
@{
+ @i @Orterm.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Orterm)- - Term\n");
+ /* TODO */
@i @Orterm.node@ = TREENULL;
@}
'(' Expr ')'
@{
@i @Term.node@ = @Expr.node@;
+ @i @Term.exprcount@ = 1 + @Expr.exprcount@; fprintf(stderr, "(Term)- ( Expr )\n");
@}
| NUM
@{
- @i @Term.node@ = new_number(@NUM.val@);
+ @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- NUM\n");
+ @i @Term.node@ = new_number(@NUM.val@, @Term.exprcount@);
@i @Term.imm@ = 1;
@}
| '-' NUM
@{
- @i @Term.node@ = new_number(-1 * (@NUM.val@));
+ @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- - NUM\n");
+ @i @Term.node@ = new_number(-1 * (@NUM.val@), @Term.exprcount@);
@i @Term.imm@ = 1;
@}
| THIS
@{
- @i @Term.node@ = new_param(O_ID, TREENULL, TREENULL, 0);
+ @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.imm@ = 0;
@}
| IDENT
@{
@c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
- @i @Term.node@ = new_param(O_ID, TREENULL, TREENULL, tab_lookup(@Term.s@, @IDENT.name@, S_PARM) == SYMNULL ? -1 : tab_lookup(@Term.s@, @IDENT.name@, S_PARM)->param_index);
+ @i @Term.exprcount@ = 0; fprintf(stderr, "(Term)- IDENT\n");
+ @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@);
@i @Term.imm@ = 0;
@}
@{
@i @Term.node@ = TREENULL;
@i @Term.imm@ = 0;
+ /*TODO*/@i @Term.exprcount@ = 0;
@}
| IDENT '(' Exprs ')'
@{
@i @Term.node@ = TREENULL;
@i @Term.imm@ = 0;
+ /*TODO*/@i @Term.exprcount@ = 0;
@}
| Term '.' IDENT '(' Exprs ')'
@{
@i @Term.node@ = TREENULL;
@i @Term.imm@ = 0;
+ /*TODO*/@i @Term.exprcount@ = 0;
@}
;
Exprs:
Expr ',' Exprs
+ /* TODO: exprcount uppen */
| Expr
|
;