static int equal(SEXP expr1, SEXP expr2)
{
if (TYPEOF(expr1) == TYPEOF(expr2)) {
switch(TYPEOF(expr1)) {
case NILSXP:
return 1;
case SYMSXP:
return expr1 == expr2;
case LGLSXP:
case INTSXP:
return INTEGER(expr1)[0] == INTEGER(expr2)[0];
case REALSXP:
return REAL(expr1)[0] == REAL(expr2)[0];
case CPLXSXP:
return COMPLEX(expr1)[0].r == COMPLEX(expr2)[0].r
&& COMPLEX(expr1)[0].i == COMPLEX(expr2)[0].i;
case LANGSXP:
case LISTSXP:
return equal(CAR(expr1), CAR(expr2))
&& equal(CDR(expr1), CDR(expr2));
default:
InvalidExpression("equal");
}
}
return 0;
}
static int FindSubexprs(SEXP expr, SEXP exprlist, SEXP tag)
{
SEXP e;
int k;
switch(TYPEOF(expr)) {
case SYMSXP:
case LGLSXP:
case INTSXP:
case REALSXP:
case CPLXSXP:
return 0;
break;
case LISTSXP:
if (inherits(expr, "expression"))
return FindSubexprs(CAR(expr), exprlist, tag);
else { InvalidExpression("FindSubexprs"); return -1/*-Wall*/; }
break;
case LANGSXP:
if (CAR(expr) == install("(")) {
return FindSubexprs(CADR(expr), exprlist, tag);
}
else {
e = CDR(expr);
while(e != R_NilValue) {
if ((k = FindSubexprs(CAR(e), exprlist, tag)) != 0)
SETCAR(e, MakeVariable(k, tag));
e = CDR(e);
}
return Accumulate(expr, exprlist);
}
break;
default:
InvalidExpression("FindSubexprs");
return -1/*-Wall*/;
}
}
void parser(action *lexems, int size)
{
stack<StackType> stackMemory;
StackType buf;
buf.code = S;
buf.name = "";
stackMemory.push(buf);
int i = 0;
while(!stackMemory.empty())
{
bool flag = false, f = false;
buf = stackMemory.top();
if(i < size -1 ) print_el(array[i]), cout<<" ", print_el(array[i+1]);
else print_el(array[i]);
cout<<" ? ";
print_stack(stackMemory);
stackMemory.pop();
// cout<<" "<<lexems[i].id_name<<""<<endl;
if(lexems[i].code == buf.code)
{
if(lexems[i].code == id || lexems[i].code == lable) f = true, i++;
else if(lexems[i].id_name == buf.name) f = true, i++;
}
else
switch(buf.code)
{
f = false;
case S:
if(lexems[i].code == keyword && lexems[i].id_name == "$") return;
if(lexems[i].code == semicolon ) rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "dim" ) rules1(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "set") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "do") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "for") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "if") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "cin") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "cout") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "goto") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "fail") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "select") rules2(stackMemory), f = true;
if(lexems[i].code == lable) rules2(stackMemory), f = true;
if(!f) throw InvalidBegin();
break;
case X:
if(lexems[i].code == keyword && lexems[i].id_name == "dim" ) rules3(stackMemory), f = true;
if(!f) throw InvalidDeclaringVariables();
break;
case X1:
if(lexems[i].code == semicolon)
{
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "$" ) rules6(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "dim" ) rules7(stackMemory), f = true;
if(!f) rules8(stackMemory), f = true;
//if(lexems[i+1].code == keyword && lexems[i+1].id_name == "set") rules8(stackMemory), f = true;
// if(lexems[i+1].code != keyword) rules8(stackMemory), f = true;
//else rules8(stackMemory), f = true;
}
if(!f) throw InvalidType();
break;
case G:
if(lexems[i].code == id)
{
f = true;
if(lexems[i+1].code == coma) rules10(stackMemory);
else rules9(stackMemory);
}
if(!f) throw InvalidDeclaring();
break;
case TYPE:
if(lexems[i].code == keyword)
{
if(lexems[i].id_name == "BV") rules5(stackMemory), f = true;
if(lexems[i].id_name == "INT") rules4(stackMemory), f = true;
}
if(!f) throw InvalidType();
break;
case P:
if(lexems[i].code == semicolon )
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "$" ) rules11(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "case" ) rules11(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "ni" ) rules11(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "otherwise" ) rules11(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "while" ) rules11(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "od" ) rules11(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "else" ) rules11(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "fi" ) rules11(stackMemory), f = true;
if(!f) rules12(stackMemory), f = true;
if(!f) throw InvalidEnd();
break;
case O:
if(lexems[i].code == semicolon )rules13(stackMemory), f = true;
// if(lexems[i].code == keyword && lexems[i].id_name == "case") rules13(stackMemory), f = true;
// if(lexems[i].code == keyword && lexems[i].id_name == "otherwise") rules13(stackMemory), f = true;
// if(lexems[i].code == keyword && lexems[i].id_name == "ni") rules13(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "set") rules14(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "do") rules15(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "for") rules27(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "if") rules30(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "cin") rules33(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "cout") rules36(stackMemory), f = true;
if(lexems[i].code == lable)
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "$") rules39(stackMemory), f = true;
else rules40(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "goto") rules41(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "fail")
if(lexems[i+1].code == semicolon) rules42(stackMemory), f = true;
else rules43(stackMemory), f = true;
// cout<<lexems[i].id_name<<endl;
if(lexems[i].code == keyword && lexems[i].id_name == "select") rules44(stackMemory), f = true;
if(!f) throw InvalidOperator();
break;
case W:
if(lexems[i].code == semicolon) rules16(stackMemory), f = true;
if(lexems[i].code == lable) rules16(stackMemory), f = true;
if(lexems[i].code == keyword)
{
if(lexems[i].id_name == "set" || lexems[i].id_name == "do" || lexems[i].id_name == "for" ) rules16(stackMemory), f = true;
if(lexems[i].id_name == "cin" || lexems[i].id_name == "cout" ) rules16(stackMemory), f = true;
if(lexems[i].id_name == "while") rules17(stackMemory), f = true;
if(lexems[i].code == lable)rules16(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "goto") rules16(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "fail") rules16(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "select") rules16(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "if") rules16(stackMemory), f = true;
}
if(!f) throw InvalidOperatorWhile();
break;
case W1:
if(lexems[i].code == semicolon) rules18(stackMemory), f = true;
if(lexems[i].code == lable) rules18(stackMemory), f = true;
if(lexems[i].code == keyword)
{
if(lexems[i].id_name == "set" || lexems[i].id_name == "do"
|| lexems[i].id_name == "for" || lexems[i].id_name == "cout"
|| lexems[i].id_name == "cin" ) rules18(stackMemory), f = true;
if(lexems[i].id_name == "goto") rules18(stackMemory), f = true;
if(lexems[i].id_name == "if") rules18(stackMemory), f = true;
if(lexems[i].id_name == "fail") rules18(stackMemory), f = true;
if(lexems[i].id_name == "select") rules18(stackMemory), f = true;
if(lexems[i].id_name == "od") rules19(stackMemory), f = true;
}
if(!f) throw InvalidOperatorWhile();
break;
case T:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr
|| lexems[i].code == lfs || lexems[i].code == rs
|| lexems[i].code == ls) rules20(stackMemory), f = true;
if(!f) throw InvalidTest();
break;
case T1:
if(lexems[i].code == Equal) rules21(stackMemory), f = true;
if(lexems[i].code == not_equal) rules22(stackMemory), f = true;
if(lexems[i].code == more) rules23(stackMemory), f = true;
if(lexems[i].code == Less) rules24(stackMemory), f = true;
if(lexems[i].code == more_or_equal) rules25(stackMemory), f = true;
if(lexems[i].code == less_or_equal) rules26(stackMemory), f = true;
if(!f) throw InvalidRatio();
break;
case F:
if(lexems[i].code == keyword && lexems[i].id_name == "by") rules28(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "do") rules29(stackMemory), f = true;
if(!f) throw InvalidOperatorFor();
break;
case N:
if(lexems[i].code == keyword && lexems[i].id_name == "else") rules31(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "fi") rules32(stackMemory), f = true;
if(!f) throw InvalidOperatorIf();
break;
case I:
if(lexems[i].code == semicolon ) rules34(stackMemory), f = true;
if(lexems[i].code == in ) rules35(stackMemory), f = true;
if(!f) throw InvalidOperatorCin();
break;
case U:
if(lexems[i].code == semicolon ) rules37(stackMemory), f = true;
if(lexems[i].code == out ) rules38(stackMemory), f = true;
if(!f) throw InvalidOperatorCout();
break;
case K:
if(lexems[i].code == keyword && lexems[i].id_name == "case") rules45(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "otherwise") rules46(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "ni") rules47(stackMemory), f = true;
if(!f) throw InvalidOperatorSelect();
break;
case E:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr
|| lexems[i].code == lfs || lexems[i].code == rs
|| lexems[i].code == ls) rules48(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case A:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr
|| lexems[i].code == lfs || lexems[i].code == rs
|| lexems[i].code == ls) rules49(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case B:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr
|| lexems[i].code == lfs || lexems[i].code == rs
|| lexems[i].code == ls) rules50(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case D:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr
|| lexems[i].code == lfs || lexems[i].code == rs
|| lexems[i].code == ls) rules51(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case H:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr
|| lexems[i].code == lfs || lexems[i].code == rs
|| lexems[i].code == ls) rules52(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case J:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr
|| lexems[i].code == lfs ) rules55(stackMemory), f = true;
if(lexems[i].code == rs) rules53(stackMemory), f = true;
if(lexems[i].code == ls) rules54(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case L:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr) rules57(stackMemory), f = true;
if(lexems[i].code == lfs) rules56(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case Z:
if(lexems[i].code == id) rules59(stackMemory), f = true;
if(lexems[i].code == CONST) rules60(stackMemory), f = true;
if(lexems[i].code == lbr) rules61(stackMemory), f = true;
if(lexems[i].code == otr) rules58(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case ID:
if(lexems[i].code == id)
{
if(lexems[i+1].code == AND) rules77(stackMemory), f = true;
if(lexems[i+1].code == OR) rules78(stackMemory), f = true;
if(lexems[i+1].code == Xor) rules79(stackMemory), f = true;
if(lexems[i+1].code == ssh) rules80(stackMemory), f = true;
if(lexems[i+1].code == sl) rules81(stackMemory), f = true;
if(lexems[i+1].code == conc) rules82(stackMemory), f = true;
if(lexems[i+1].code == scolar) rules83(stackMemory), f = true;
if(lexems[i+1].code == sp) rules84(stackMemory), f = true;
if(lexems[i+1].code == multy) rules85(stackMemory), f = true;
if(lexems[i+1].code == DEV) rules86(stackMemory), f = true;
if(lexems[i+1].code == MOD) rules87(stackMemory), f = true;
if(lexems[i+1].code == add) rules88(stackMemory), f = true;
if(lexems[i+1].code == sub) rules89(stackMemory), f = true;
if(!f) rules90(stackMemory), f = true;
}
if(!f) throw InvalidExpression();
break;
case C:
if(lexems[i].code == CONST)
{
if(lexems[i+1].code == AND) rules92(stackMemory), f = true;
if(lexems[i+1].code == OR) rules93(stackMemory), f = true;
if(lexems[i+1].code == Xor) rules94(stackMemory), f = true;
if(lexems[i+1].code == ssh) rules95(stackMemory), f = true;
if(lexems[i+1].code == sl) rules96(stackMemory), f = true;
if(lexems[i+1].code == conc) rules97(stackMemory), f = true;
if(lexems[i+1].code == scolar) rules98(stackMemory), f = true;
if(lexems[i+1].code == sp) rules99(stackMemory), f = true;
if(lexems[i+1].code == multy) rules100(stackMemory), f = true;
if(lexems[i+1].code == DEV) rules101(stackMemory), f = true;
if(lexems[i+1].code == MOD) rules102(stackMemory), f = true;
if(lexems[i+1].code == add) rules103(stackMemory), f = true;
if(lexems[i+1].code == sub) rules104(stackMemory), f = true;
if(!f) rules105(stackMemory), f = true;
}
if(!f) throw InvalidExpression();
break;
case SH:
if(lexems[i].code == rbr)
{
if(lexems[i+1].code == AND) rules62(stackMemory), f = true;
if(lexems[i+1].code == OR) rules63(stackMemory), f = true;
if(lexems[i+1].code == Xor) rules64(stackMemory), f = true;
if(lexems[i+1].code == ssh) rules65(stackMemory), f = true;
if(lexems[i+1].code == sl) rules66(stackMemory), f = true;
if(lexems[i+1].code == conc) rules67(stackMemory), f = true;
if(lexems[i+1].code == scolar) rules68(stackMemory), f = true;
if(lexems[i+1].code == sp) rules69(stackMemory), f = true;
if(lexems[i+1].code == multy) rules70(stackMemory), f = true;
if(lexems[i+1].code == DEV) rules71(stackMemory), f = true;
if(lexems[i+1].code == MOD) rules72(stackMemory), f = true;
if(lexems[i+1].code == add) rules73(stackMemory), f = true;
if(lexems[i+1].code == sub) rules74(stackMemory), f = true;
if(!f) rules75(stackMemory), f = true;
}
if(!f) throw InvalidExpression();
break;
case G1:
if(lexems[i].code == id)
{
f = true;
if(lexems[i+1].code == coma) rules107(stackMemory);
else rules106(stackMemory);
}
if(!f) throw InvalidDeclaring();
break;
default: cout<<"ERRRRORRRRR"<<endl; return;
}
}
cout<<lexems[i].id_name<<""<<endl;
if(lexems[i].id_name == "$" && stackMemory.empty()) cout<<"acc"<<endl;
else cout<<"fail"<<endl;
}
