#define KIDV(A) bnode->kids[A]->val
#define BNR bnode->reg
#define BNV bnode->val
+#define KIDPARM(A) if(bnode->kids[A]->param_index > -1) { bnode->kids[A]->reg = param_reg(bnode->kids[A]->param_index); }
#include <stdio.h>
#include <stdlib.h>
expr: O_ID # 1 # if(bnode->param_index > -1) move(param_reg(bnode->param_index), BNR);
expr: imm # 1 # moveimm(BNV, BNR);
-expr: O_SUB(expr,expr) # 1 # printf("\tsubq %%%s, %%%s\n", KIDR(0), KIDR(1));
-expr: O_SUB(imm,expr) # 2 # printf("\tsubq $%li, %%%s\n", KIDV(0), KIDR(1)); move(KIDR(1), BNR);
-expr: O_SUB(expr,imm) # 3 # moveimm(KIDV(1), BNR); printf("\tsubq %%%s, %%%s\n", KIDR(0), BNR);
+expr: O_SUB(expr,exprno) # 1 # KIDPARM(1); printf("\tsubq %%%s, %%%s\n", KIDR(1), KIDR(0));
+expr: O_SUB(expr,imm) # 2 # printf("\tsubq $%li, %%%s\n", KIDV(1), KIDR(0)); move(KIDR(0), BNR);
+expr: O_SUB(imm,exprno) # 3 # moveimm(KIDV(0), BNR); KIDPARM(1); printf("\tsubq %%%s, %%%s\n", KIDR(1), BNR);
-expr: O_ADD(expr,expr) # 1 # printf("\taddq %%%s, %%%s\n", KIDR(1), KIDR(0));
+expr: O_ADD(expr,exprno) # 1 # KIDPARM(1); printf("\taddq %%%s, %%%s\n", KIDR(1), KIDR(0));
expr: O_ADD(imm,expr) # 1 # printf("\taddq $%li, %%%s\n", KIDV(1), KIDR(0)); move(KIDR(0), BNR);
expr: O_ADD(expr,imm) # 1 # printf("\taddq $%li, %%%s\n", KIDV(1), KIDR(0)); move(KIDR(0), BNR);
+exprno: O_ID # 0 # /* brauchen wir nicht 'zwischenlagern', weil nur gelesen wird */
+exprno: expr
+
imm: O_ADD(imm,imm) # 0 # BNV = KIDV(0)+KIDV(1);
-imm: O_SUB(imm,imm) # 0 # BNV = KIDV(1)-KIDV(0);
+imm: O_SUB(imm,imm) # 0 # BNV = KIDV(0)-KIDV(1);
imm: O_NUM # 0 #
%%