%}
%start begin
-%term O_RET=1 O_NOT=2 O_SUB=3 O_MUL=4 O_OR=5 O_LESS=6 O_EQ=7 O_ID=8 O_ADD=9 O_NUM=10
+%term O_RET=1 O_NOT=2 O_SUB=3 O_MUL=4 O_OR=5 O_LESS=6 O_EQ=7 O_ID=8 O_ADD=9 O_NUM=10 O_FIELD=11
%%
expr: O_EQ(expr,imm) # 5 # gen_eqless_ei(bnode, "e");
expr: O_EQ(imm,expr) # 5 # gen_eqless_ie(bnode, "e");
+expr: O_FIELD(exprno) # 1 # KIDREG2PARM(0); printf("\tmovq %li(%%%s), %%%s\n", bnode->soffset * 8, KID_REG(0), BN_REG);
+
exprno: O_ID # 0 # /* brauchen wir nicht 'zwischenlagern', weil nur gelesen wird */
exprno: expr
@attributes { struct symbol *f; int soffset; int offsetcount; } FeldID Structdef
@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 Term Multerm Orterm
-@attributes { struct symbol *s; int gparamges; struct treenode *node; } Lexpr Feld
+@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; } Lexpr
@attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; } Statement
@traversal @postorder c
@{
@i @Lexpr.node@ = TREENULL;
@c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
+ /* this.feldname */
+ /* TODO fuer zuweisungen ... (codeb?) */
@}
| Feld
Feld: Term '.' IDENT
@{
@c check(@Feld.s@, @IDENT.name@, S_FIELD);
- @i @Feld.node@ = TREENULL;
+ @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.exprcount@ = @Term.exprcount@; fprintf(stderr, "(Feld)- Term.IDENT\n");
+ @reg @Term.node@->reg = @Feld.node@->reg;
@}
;
| IDENT
@{
@c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
+
@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.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@);
+ } 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@);
+ }
+ }
+
+ @reg if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
+ /* TODO: kein schoener hack? */
+ @Term.node@->kids[0]->reg = @Term.node@->reg;
+ }
@}
| Feld
@{
- @i @Term.node@ = TREENULL;
+ @i @Term.node@ = @Feld.node@;
/*TODO*/@i @Term.exprcount@ = 0;
@}
return new;
}
+struct treenode *new_field(char *name, struct treenode *l, struct treenode *r, int soffset, int exprcount)
+{
+ struct treenode *new = new_node(O_FIELD, l, r, exprcount);
+
+#ifdef DDTREE
+ fprintf(stderr, "new_field: %i (soffset)\n", soffset);
+#endif
+ new->soffset = soffset;
+ new->name = name;
+ return new;
+}
+
struct treenode *new_number(long val, int exprcount)
{
struct treenode *new = _new_plain(O_NUM);
O_EQ,
O_ID,
O_ADD,
- O_NUM
+ O_NUM,
+ O_FIELD
};
static char *o_names[] = {
"O_EQ",
"O_ID",
"O_ADD",
- "O_NUM"
+ "O_NUM",
+ "O_FIELD"
};
struct treenode {
int skip;
int param_index;
int exprcount;
+ int soffset;
};
typedef struct treenode *treenodep;
struct treenode *new_node(int op, struct treenode *l, struct treenode *r, int exprcount);
struct treenode *new_number(long val, int exprcount);
struct treenode *new_param(int op, char *name, struct treenode *l, struct treenode *r, int param_index, int exprcount);
+struct treenode *new_field(char *name, struct treenode *l, struct treenode *r, int soffset, int exprcount);
void write_tree(struct treenode *node, int ident);
#endif