%{
#define BFEHAX

#define KIDR(A) bnode->kids[A]->reg
#define KIDV(A) bnode->kids[A]->val
#define BNR bnode->reg
#define BNV bnode->val

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "tree.h"
#include "chelper.h"

%}

%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

%%

begin: ret # 0 # printf("// end\n");
ret: O_RET(expr) # 2 # move(BNR, "rax"); ret();

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 # fprintf(stderr, "osub0\n"); printf("\tsubq %%%s, %%%s\n", KIDR(0), KIDR(1));
expr: O_SUB(imm,expr) # 2 # fprintf(stderr, "osub1\n"); printf("\tsubq $%li, %%%s\n", KIDV(0), KIDR(1)); move(KIDR(1), BNR);
expr: O_SUB(expr,imm) # 3 # fprintf(stderr, "osub2\n"); moveimm(KIDV(1), BNR); printf("\tsubq %%%s, %%%s\n", KIDR(0), BNR);

expr: O_ADD(expr,expr) # 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(0), KIDR(1)); move(KIDR(1), BNR);


imm: O_ADD(imm,imm) # 0 # BNV = KIDV(0)+KIDV(1);
imm: O_SUB(imm,imm) # 0 # BNV = KIDV(1)-KIDV(0);
imm: O_NUM # 0 #

%%

/* vim: filetype=c
 */