codea: not inkl. optimierung

[uebersetzerbau-ss10.git] / codea / code.bfe

diff --git a/codea/code.bfe b/codea/code.bfe
index 53d61c6c0b30bc3dcaccaec6616e6c2a1ed89cdc..5cdd1804015a291c47c05e00adeabc615b5cb027 100644 (file)
--- a/codea/code.bfe
+++ b/codea/code.bfe
@@ -70,7 +70,7 @@ void gen_eqless(struct treenode *bnode, char *op, short e0, short e1)
 %}
 
 %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 O_FIELD=11
+%term O_RET=1 O_NULL=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
 
 %%
 
@@ -101,6 +101,8 @@ expr: O_LESS(imm,expr)  # 3 # gen_eqless(bnode, "l", 0, 1);
 expr: O_EQ(exprno,exprno) # 3 # gen_eqless(bnode, "e", 1, 1);
 expr: O_EQ(exprno,imm)    # 3 # gen_eqless(bnode, "e", 1, 0);
 expr: O_EQ(imm,exprno)    # 3 # gen_eqless(bnode, "e", 0, 1);
+expr: O_EQ(nexpr,O_NULL)  # 0 #
+expr: O_EQ(exprno,O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0);
 
 expr: O_FIELD(exprno) # 1 # KIDREG2PARM(0); printf("\tmovq %li(%%%s), %%%s\n", bnode->soffset * 8, KID_REG(0), BN_REG);
 
@@ -108,6 +110,8 @@ expr: O_FIELD(exprno) # 1 # KIDREG2PARM(0); printf("\tmovq %li(%%%s), %%%s\n", b
 exprno: O_ID # 0 # /* brauchen wir nicht 'zwischenlagern', weil nur gelesen wird */
 exprno: expr
 
+nexpr: O_EQ(expr,O_NULL) # 0 #
+
 
 imm: O_ADD(imm,imm)  # 0 # BN_VAL = KID_VAL(0) + KID_VAL(1);
 imm: O_SUB(imm,imm)  # 0 # BN_VAL = KID_VAL(0) - KID_VAL(1);