@end
@autoinh s
-@autosyn node imm
+@autosyn node imm exprcount
@attributes { char *name; } IDENT
@attributes { long val; } NUM
@attributes { struct symbol *f; 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; short imm; int exprcount; } 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
@{
@i @Statement.sin@ = @Statseq.0.s@;
@i @Statseq.1.s@ = @Statement.sout@;
- @gen burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
+ @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
@}
|
@{
statinout()
xxputsin(@Expr.s@,)
- @i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL);
+ @i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL, 0);
@reg @Statement.node@->reg = next_reg((char *)NULL, 0); @Expr.node@->reg = @Statement.node@->reg;
@}
;
@{
@c check(@Feld.s@, @IDENT.name@, S_FIELD);
@i @Feld.node@ = TREENULL;
- @reg fprintf(stderr, "w00t8\n");
@}
;
Term
@{
@reg @Term.node@->reg = @Expr.node@->reg;
+ @i @Expr.exprcount@ = 1 + @Term.exprcount@; fprintf(stderr, "(Expr)- Term\n");
@}
| NOT Term
@{
- @i @Expr.node@ = TREENULL; fprintf(stderr, "w00t2\n");
+ @i @Expr.node@ = TREENULL;
+ @i @Expr.exprcount@ = 1 + @Term.exprcount@; fprintf(stderr, "(Expr)- NOT Term\n");
@}
| Term Minusterm
@{
- @i @Expr.node@ = new_node(O_SUB, @Minusterm.node@, @Term.node@);
+ @i @Expr.exprcount@ = 1 + @Term.exprcount@ + @Minusterm.exprcount@; fprintf(stderr, "(Expr)- Term Minusterm\n");
+ @i @Expr.node@ = new_node(O_SUB, @Minusterm.node@, @Term.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 = 1;
+ @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.node@->skip);
}
@}
| Term Multerm
@{
- @i @Expr.node@ = TREENULL; fprintf(stderr, "w00t4\n");
+ @i @Expr.node@ = TREENULL;
+ @i @Expr.exprcount@ = 1 + @Term.exprcount@; fprintf(stderr, "(Expr)- Term Multerm\n");
@}
| Term Orterm
@{
- @i @Expr.node@ = TREENULL; fprintf(stderr, "w00t5\n");
+ @i @Expr.node@ = TREENULL;
+ @i @Expr.exprcount@ = 1 + @Term.exprcount@; fprintf(stderr, "(Expr)- Term OrTerm\n");
@}
| Term '<' Term
@{
- @i @Expr.node@ = TREENULL; fprintf(stderr, "w00t6\n");
+ @i @Expr.node@ = TREENULL;
/* das is bloedsinn atm */ @i @Expr.imm@ = @Term.0.imm@ && @Term.1.imm@;
+ @i @Expr.exprcount@ = 1 + @Term.0.exprcount@ + @Term.1.exprcount@; fprintf(stderr, "(Expr)- Term < Term\n");
@}
| Term '=' Term
@{
- @i @Expr.node@ = TREENULL; fprintf(stderr, "w00t7\n");
+ @i @Expr.node@ = TREENULL;
/* das is bloedsinn atm */ @i @Expr.imm@ = @Term.0.imm@ && @Term.1.imm@;
+ @i @Expr.exprcount@ = 1 + @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@ = 1 + @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 {
| '-' Term
@{
+ @i @Minusterm.exprcount@ = 1 + @Term.exprcount@; fprintf(stderr, "(Minusterm)- - Term\n");
@reg @Term.node@->reg = @Minusterm.node@->reg;
@}
;
'*' Term Multerm
@{
@i @Multerm.node@ = TREENULL;
- @reg fprintf(stderr, "mul1\n");
@}
| '*' Term
@{
@i @Multerm.node@ = TREENULL;
- @reg fprintf(stderr, "mul2\n");
@}
;
OR Term Orterm
@{
@i @Orterm.node@ = TREENULL;
- @reg fprintf(stderr, "or1\n");
@}
| OR Term
@{
@i @Orterm.node@ = TREENULL;
- @reg fprintf(stderr, "or2\n");
@}
;
'(' Expr ')'
@{
@i @Term.node@ = @Expr.node@;
+ @i @Term.exprcount@ = @Expr.exprcount@ + 1; fprintf(stderr, "(Term)- ( Expr )\n");
@}
| NUM
@{
- @i @Term.node@ = new_number(@NUM.val@);
+ @i @Term.exprcount@ = 1; 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@ = 1; 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@ = 1; 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@ = 1; 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@ = 1;
@}
| IDENT '(' Exprs ')'
@{
@i @Term.node@ = TREENULL;
@i @Term.imm@ = 0;
+ /*TODO*/@i @Term.exprcount@ = 1;
@}
| Term '.' IDENT '(' Exprs ')'
@{
@i @Term.node@ = TREENULL;
@i @Term.imm@ = 0;
+ /*TODO*/@i @Term.exprcount@ = 1;
@}
;