/* original parser id follows */ /* yysccsid[] = "@(#)yaccpar 1.9 (Berkeley) 02/21/93" */ /* (use YYMAJOR/YYMINOR for ifdefs dependent on parser version) */ #define YYBYACC 1 #define YYMAJOR 1 #define YYMINOR 9 #define YYCHECK "yyyymmdd" #define YYEMPTY (-1) #define yyclearin (yychar = YYEMPTY) #define yyerrok (yyerrflag = 0) #define YYRECOVERING() (yyerrflag != 0) #define YYENOMEM (-2) #define YYEOF 0 #undef YYBTYACC #define YYBTYACC 0 #define YYDEBUGSTR YYPREFIX "debug" #ifndef yyparse #define yyparse expr.oxout_parse #endif /* yyparse */ #ifndef yylex #define yylex expr.oxout_lex #endif /* yylex */ #ifndef yyerror #define yyerror expr.oxout_error #endif /* yyerror */ #ifndef yychar #define yychar expr.oxout_char #endif /* yychar */ #ifndef yyval #define yyval expr.oxout_val #endif /* yyval */ #ifndef yylval #define yylval expr.oxout_lval #endif /* yylval */ #ifndef yydebug #define yydebug expr.oxout_debug #endif /* yydebug */ #ifndef yynerrs #define yynerrs expr.oxout_nerrs #endif /* yynerrs */ #ifndef yyerrflag #define yyerrflag expr.oxout_errflag #endif /* yyerrflag */ #ifndef yylhs #define yylhs expr.oxout_lhs #endif /* yylhs */ #ifndef yylen #define yylen expr.oxout_len #endif /* yylen */ #ifndef yydefred #define yydefred expr.oxout_defred #endif /* yydefred */ #ifndef yystos #define yystos expr.oxout_stos #endif /* yystos */ #ifndef yydgoto #define yydgoto expr.oxout_dgoto #endif /* yydgoto */ #ifndef yysindex #define yysindex expr.oxout_sindex #endif /* yysindex */ #ifndef yyrindex #define yyrindex expr.oxout_rindex #endif /* yyrindex */ #ifndef yygindex #define yygindex expr.oxout_gindex #endif /* yygindex */ #ifndef yytable #define yytable expr.oxout_table #endif /* yytable */ #ifndef yycheck #define yycheck expr.oxout_check #endif /* yycheck */ #ifndef yyname #define yyname expr.oxout_name #endif /* yyname */ #ifndef yyrule #define yyrule expr.oxout_rule #endif /* yyrule */ #if YYBTYACC #ifndef yycindex #define yycindex expr.oxout_cindex #endif /* yycindex */ #ifndef yyctable #define yyctable expr.oxout_ctable #endif /* yyctable */ #endif /* YYBTYACC */ #define YYPREFIX "expr.oxout_" #define YYPURE 0 #line 5 "expr.oxout.y" #include #include #line 8 "expr.Y" #include "expr.oxout.h" #include extern int yylex(void); extern void yyerror(const char *); #line 27 "expr.oxout.y" #include #define yyyR USHRT_MAX #ifdef YYSTYPE #undef YYSTYPE_IS_DECLARED #define YYSTYPE_IS_DECLARED 1 #endif #ifndef YYSTYPE_IS_DECLARED #define YYSTYPE_IS_DECLARED 1 #line 31 "expr.oxout.y" typedef union { struct yyyOxAttrbs { struct yyyStackItem *yyyOxStackItem; } yyyOxAttrbs; } YYSTYPE; #endif /* !YYSTYPE_IS_DECLARED */ #line 38 "expr.oxout.y" #include #include static int yyyYok = 1; extern yyyFT yyyRCIL[]; void yyyExecuteRRsection(yyyGNT *rootNode); void yyyYoxInit(void); void yyyDecorate(void); struct yyyOxAttrbs; /* hack required to compensate for 'msta' behavior */ void yyyGenIntNode(long yyyProdNum, int yyyRHSlength, int yyyNattrbs, struct yyyOxAttrbs *yyval_OxAttrbs, ...); void yyyAdjustINRC(long yyyProdNum, int yyyRHSlength, long startP, long stopP, struct yyyOxAttrbs *yyval_OxAttrbs, ...); void yyyCheckUnsolvedInstTrav(yyyGNT *rootNode,long *nNZrc,long *cycleSum); void yyyUnsolvedInstSearchTrav(yyyGNT *pNode); void yyyUnsolvedInstSearchTravAux(yyyGNT *pNode); void yyyabort(void); #line 166 "expr.oxout.tab.c" /* compatibility with bison */ #ifdef YYPARSE_PARAM /* compatibility with FreeBSD */ # ifdef YYPARSE_PARAM_TYPE # define YYPARSE_DECL() yyparse(YYPARSE_PARAM_TYPE YYPARSE_PARAM) # else # define YYPARSE_DECL() yyparse(void *YYPARSE_PARAM) # endif #else # define YYPARSE_DECL() yyparse(void) #endif /* Parameters sent to lex. */ #ifdef YYLEX_PARAM # define YYLEX_DECL() yylex(void *YYLEX_PARAM) # define YYLEX yylex(YYLEX_PARAM) #else # define YYLEX_DECL() yylex(void) # define YYLEX yylex() #endif /* Parameters sent to yyerror. */ #ifndef YYERROR_DECL #define YYERROR_DECL() yyerror(const char *s) #endif #ifndef YYERROR_CALL #define YYERROR_CALL(msg) yyerror(msg) #endif extern int YYPARSE_DECL(); #define ID 257 #define CONST 258 #define YYERRCODE 256 typedef int YYINT; static const YYINT expr.oxout_lhs[] = { -1, 2, 0, 1, 3, 3, 3, 3, 3, 3, 3, }; static const YYINT expr.oxout_len[] = { 2, 0, 2, 1, 3, 3, 3, 3, 3, 1, 1, }; static const YYINT expr.oxout_defred[] = { 1, 0, 0, 9, 10, 0, 2, 0, 0, 0, 0, 0, 0, 8, 0, 0, 4, 0, }; #if defined(YYDESTRUCT_CALL) || defined(YYSTYPE_TOSTRING) static const YYINT expr.oxout_stos[] = { 0, 260, 262, 257, 258, 40, 261, 263, 263, 43, 45, 42, 47, 41, 263, 263, 263, 263, }; #endif /* YYDESTRUCT_CALL || YYSTYPE_TOSTRING */ static const YYINT expr.oxout_dgoto[] = { 1, 6, 2, 7, }; static const YYINT expr.oxout_sindex[] = { 0, 0, -40, 0, 0, -40, 0, -18, -24, -40, -40, -40, -40, 0, -37, -37, 0, -39, }; static const YYINT expr.oxout_rindex[] = { 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 2, 8, 0, 1, }; #if YYBTYACC static const YYINT expr.oxout_cindex[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, }; #endif static const YYINT expr.oxout_gindex[] = { 0, 0, 0, 4, }; #define YYTABLESIZE 218 static const YYINT expr.oxout_table[] = { 5, 6, 5, 11, 0, 11, 3, 0, 7, 8, 12, 0, 0, 14, 15, 16, 17, 13, 11, 9, 0, 10, 0, 12, 11, 9, 0, 10, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 5, 6, 5, 6, 5, 6, 7, 0, 7, 0, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 4, }; static const YYINT expr.oxout_check[] = { 40, 0, 0, 42, -1, 42, 0, -1, 0, 5, 47, -1, -1, 9, 10, 11, 12, 41, 42, 43, -1, 45, -1, 47, 42, 43, -1, 45, -1, 47, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 41, 41, 43, 43, 45, 45, 47, 41, -1, 43, -1, 45, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 257, 258, }; #if YYBTYACC static const YYINT expr.oxout_ctable[] = { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, }; #endif #define YYFINAL 1 #ifndef YYDEBUG #define YYDEBUG 0 #endif #define YYMAXTOKEN 258 #define YYUNDFTOKEN 264 #define YYTRANSLATE(a) ((a) > YYMAXTOKEN ? YYUNDFTOKEN : (a)) #if YYDEBUG static const char *const expr.oxout_name[] = { "$end",0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,"'('","')'","'*'","'+'",0,"'-'",0,"'/'",0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,"error","ID", "CONST","$accept","yyyAugNonterm","s","$$1","expr","illegal-symbol", }; static const char *const expr.oxout_rule[] = { "$accept : yyyAugNonterm", "$$1 :", "yyyAugNonterm : $$1 s", "s : expr", "expr : expr '*' expr", "expr : expr '+' expr", "expr : expr '/' expr", "expr : expr '-' expr", "expr : '(' expr ')'", "expr : ID", "expr : CONST", }; #endif #if YYDEBUG int yydebug; #endif int yyerrflag; int yychar; YYSTYPE yyval; YYSTYPE yylval; int yynerrs; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) YYLTYPE yyloc; /* position returned by actions */ YYLTYPE yylloc; /* position from the lexer */ #endif #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) #ifndef YYLLOC_DEFAULT #define YYLLOC_DEFAULT(loc, rhs, n) \ do \ { \ if (n == 0) \ { \ (loc).first_line = YYRHSLOC(rhs, 0).last_line; \ (loc).first_column = YYRHSLOC(rhs, 0).last_column; \ (loc).last_line = YYRHSLOC(rhs, 0).last_line; \ (loc).last_column = YYRHSLOC(rhs, 0).last_column; \ } \ else \ { \ (loc).first_line = YYRHSLOC(rhs, 1).first_line; \ (loc).first_column = YYRHSLOC(rhs, 1).first_column; \ (loc).last_line = YYRHSLOC(rhs, n).last_line; \ (loc).last_column = YYRHSLOC(rhs, n).last_column; \ } \ } while (0) #endif /* YYLLOC_DEFAULT */ #endif /* defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) */ #if YYBTYACC #ifndef YYLVQUEUEGROWTH #define YYLVQUEUEGROWTH 32 #endif #endif /* YYBTYACC */ /* define the initial stack-sizes */ #ifdef YYSTACKSIZE #undef YYMAXDEPTH #define YYMAXDEPTH YYSTACKSIZE #else #ifdef YYMAXDEPTH #define YYSTACKSIZE YYMAXDEPTH #else #define YYSTACKSIZE 10000 #define YYMAXDEPTH 10000 #endif #endif #ifndef YYINITSTACKSIZE #define YYINITSTACKSIZE 200 #endif typedef struct { unsigned stacksize; YYINT *s_base; YYINT *s_mark; YYINT *s_last; YYSTYPE *l_base; YYSTYPE *l_mark; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) YYLTYPE *p_base; YYLTYPE *p_mark; #endif } YYSTACKDATA; #if YYBTYACC struct YYParseState_s { struct YYParseState_s *save; /* Previously saved parser state */ YYSTACKDATA yystack; /* saved parser stack */ int state; /* saved parser state */ int errflag; /* saved error recovery status */ int lexeme; /* saved index of the conflict lexeme in the lexical queue */ YYINT ctry; /* saved index in yyctable[] for this conflict */ }; typedef struct YYParseState_s YYParseState; #endif /* YYBTYACC */ /* variables for the parser stack */ static YYSTACKDATA yystack; #if YYBTYACC /* Current parser state */ static YYParseState *yyps = 0; /* yypath != NULL: do the full parse, starting at *yypath parser state. */ static YYParseState *yypath = 0; /* Base of the lexical value queue */ static YYSTYPE *yylvals = 0; /* Current position at lexical value queue */ static YYSTYPE *yylvp = 0; /* End position of lexical value queue */ static YYSTYPE *yylve = 0; /* The last allocated position at the lexical value queue */ static YYSTYPE *yylvlim = 0; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) /* Base of the lexical position queue */ static YYLTYPE *yylpsns = 0; /* Current position at lexical position queue */ static YYLTYPE *yylpp = 0; /* End position of lexical position queue */ static YYLTYPE *yylpe = 0; /* The last allocated position at the lexical position queue */ static YYLTYPE *yylplim = 0; #endif /* Current position at lexical token queue */ static YYINT *yylexp = 0; static YYINT *yylexemes = 0; #endif /* YYBTYACC */ #line 53 "expr.Y" int yyparse(void); int main() {yyparse(); } #line 138 "expr.oxout.y" long yyySSALspaceSize = 20000; long yyyRSmaxSize = 1000; long yyyTravStackMaxSize = 2000; struct yyySolvedSAlistCell {yyyWAT attrbNum; long next; }; #define yyyLambdaSSAL 0 long yyySSALCfreeList = yyyLambdaSSAL; long yyyNewSSALC = 1; struct yyySolvedSAlistCell *yyySSALspace; long yyyNbytesStackStg; yyyFT yyyRCIL[1]; short yyyIIIEL[] = {0, 0,2,6,10,14,18,22,24, }; long yyyIIEL[] = { 0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0, 1,1, }; long yyyIEL[] = { 0,0,0, }; yyyFT yyyEntL[1]; void yyyfatal(char *msg) {fputs(msg,stderr);exit(-1);} #define yyySSALof 'S' #define yyyRSof 'q' #define yyyTSof 't' void yyyHandleOverflow(char which) {char *msg1,*msg2; long oldSize,newSize; switch(which) { case yyySSALof : msg1 = "SSAL overflow: "; oldSize = yyySSALspaceSize; break; case yyyRSof : msg1 = "ready set overflow: "; oldSize = yyyRSmaxSize; break; case yyyTSof : msg1 = "traversal stack overflow: "; oldSize = yyyTravStackMaxSize; break; default :; } newSize = (3*oldSize)/2; if (newSize < 100) newSize = 100; fputs(msg1,stderr); fprintf(stderr,"size was %ld.\n",oldSize); msg2 = " Have to modify evaluator: -Y%c%ld.\n"; fprintf(stderr,msg2,which,newSize); exit(-1); } void yyySignalEnts(yyyGNT *node,long startP,long stopP) {yyyGNT *dumNode; while (startP < stopP) { if (!yyyEntL[startP]) dumNode = node; else dumNode = (node->cL)[yyyEntL[startP]-1]; if (!(--((dumNode->refCountList)[yyyEntL[startP+1]] ) ) ) { if (++yyyRSTop == yyyAfterRS) {yyyHandleOverflow(yyyRSof); break; } yyyRSTop->node = dumNode; yyyRSTop->whichSym = yyyEntL[startP]; yyyRSTop->wa = yyyEntL[startP+1]; } startP += 2; } } void yyySolveAndSignal() { long yyyiDum,*yyypL; int yyyws,yyywa; yyyGNT *yyyRSTopN,*yyyRefN; yyyParent yyyRSTopNp; yyyRSTopNp = (yyyRSTopN = yyyRSTop->node)->parent; yyyRefN= (yyyws = (yyyRSTop->whichSym))?yyyRSTopNp.noderef:yyyRSTopN; yyywa = yyyRSTop->wa; yyyRSTop--; switch(yyyRefN->prodNum) { case 1: /***yacc rule 1***/ switch (yyyws) { } break; case 2: /***yacc rule 2***/ switch (yyyws) { } break; case 3: /***yacc rule 3***/ switch (yyyws) { } break; case 4: /***yacc rule 4***/ switch (yyyws) { } break; case 5: /***yacc rule 5***/ switch (yyyws) { } break; case 6: /***yacc rule 6***/ switch (yyyws) { } break; case 7: /***yacc rule 7***/ switch (yyyws) { case 1: /**/ switch (yyywa) { } break; } break; case 8: /***yacc rule 8***/ switch (yyyws) { case 1: /**/ switch (yyywa) { } break; } break; } /* switch */ if (yyyws) /* the just-solved instance was inherited. */ {if (yyyRSTopN->prodNum) {yyyiDum = yyyIIEL[yyyIIIEL[yyyRSTopN->prodNum]] + yyywa; yyySignalEnts(yyyRSTopN,yyyIEL[yyyiDum], yyyIEL[yyyiDum+1] ); } } else /* the just-solved instance was synthesized. */ {if (!(yyyRSTopN->parentIsStack)) /* node has a parent. */ {yyyiDum = yyyIIEL[yyyIIIEL[yyyRSTopNp.noderef->prodNum] + yyyRSTopN->whichSym ] + yyywa; yyySignalEnts(yyyRSTopNp.noderef, yyyIEL[yyyiDum], yyyIEL[yyyiDum+1] ); } else /* node is still on the stack--it has no parent yet. */ {yyypL = &(yyyRSTopNp.stackref->solvedSAlist); if (yyySSALCfreeList == yyyLambdaSSAL) {yyySSALspace[yyyNewSSALC].next = *yyypL; if ((*yyypL = yyyNewSSALC++) == yyySSALspaceSize) yyyHandleOverflow(yyySSALof); } else {yyyiDum = yyySSALCfreeList; yyySSALCfreeList = yyySSALspace[yyySSALCfreeList].next; yyySSALspace[yyyiDum].next = *yyypL; *yyypL = yyyiDum; } yyySSALspace[*yyypL].attrbNum = yyywa; } } } /* yyySolveAndSignal */ #define condStg unsigned int conds; #define yyyClearConds {yyyTST->conds = 0;} #define yyySetCond(n) {yyyTST->conds += (1<<(n));} #define yyyCond(n) ((yyyTST->conds & (1<<(n)))?1:0) struct yyyTravStackItem {yyyGNT *node; char isReady; condStg }; void yyyDoTraversals(yyyGNT *rootNode) {struct yyyTravStackItem *yyyTravStack,*yyyTST,*yyyAfterTravStack; yyyGNT *yyyTSTn,**yyyCLptr2; int yyyi,yyyRL,yyyPass; int i; if (!yyyYok) return; if ((yyyTravStack = ((struct yyyTravStackItem *) calloc((size_t)yyyTravStackMaxSize, (size_t)sizeof(struct yyyTravStackItem) ) ) ) == (struct yyyTravStackItem *)NULL ) {fputs("malloc error in traversal stack allocation\n",stderr); exit(-1); } yyyAfterTravStack = yyyTravStack + yyyTravStackMaxSize; yyyTravStack++; for (yyyi=0; yyyi<2; yyyi++) { yyyTST = yyyTravStack; yyyTST->node = rootNode; yyyTST->isReady = 0; yyyClearConds while(yyyTST >= yyyTravStack) {yyyTSTn = yyyTST->node; if (yyyTST->isReady) {yyyPass = 1; goto yyyTravSwitch; yyyTpop: yyyTST--; } else {yyyPass = 0; goto yyyTravSwitch; yyyTpush: yyyTST->isReady = 1; if (yyyTSTn->prodNum) {if (yyyRL) {yyyCLptr2 = yyyTSTn->cL; i = yyyTSTn->cLlen; while (i--) {if (++yyyTST == yyyAfterTravStack) yyyHandleOverflow(yyyTSof); else {yyyTST->node = *yyyCLptr2; yyyTST->isReady = 0; yyyClearConds } yyyCLptr2++; } } /* right to left */ else /* left to right */ {i = yyyTSTn->cLlen; yyyCLptr2 = yyyTSTn->cL + i; while (i--) {yyyCLptr2--; if (++yyyTST == yyyAfterTravStack) yyyHandleOverflow(yyyTSof); else {yyyTST->node = *yyyCLptr2; yyyTST->isReady = 0; yyyClearConds } } } /* left to right */ } } /* else */ continue; yyyTravSwitch: switch(yyyTSTn->prodNum) { case 1: switch(yyyi) { case 0: switch(yyyPass) { case 0: yyyRL = 0;yyySetCond(0) if (! #line 24 "expr.Y" (1) #line 444 "expr.oxout.y" ) yyySetCond(1) yyySetCond(2) case 1: if (yyyCond(0) != yyyPass) { #line 24 "expr.Y" #line 453 "expr.oxout.y" } if (yyyCond(1) != yyyPass) { #line 24 "expr.Y" printf("\n"); #line 459 "expr.oxout.y" } if (yyyCond(2) != yyyPass) { #line 25 "expr.Y" printf("prefix: "); #line 465 "expr.oxout.y" } break; } break; case 1: switch(yyyPass) { case 0: yyyRL = 0; if ( #line 23 "expr.Y" (1) #line 477 "expr.oxout.y" ) yyySetCond(2) case 1: if (yyyCond(0) != yyyPass) { #line 22 "expr.Y" printf("\n"); #line 486 "expr.oxout.y" } if (yyyCond(1) != yyyPass) { #line 23 "expr.Y" #line 491 "expr.oxout.y" } if (yyyCond(2) != yyyPass) { #line 23 "expr.Y" printf("postfix: ")/* missing ; */ #line 497 "expr.oxout.y" } break; } break; } break; case 2: switch(yyyi) { case 0: switch(yyyPass) { case 0: yyyRL = 0;yyySetCond(0) case 1: if (yyyCond(0) != yyyPass) { #line 29 "expr.Y" printf(" * "); #line 518 "expr.oxout.y" } break; } break; case 1: switch(yyyPass) { case 0: yyyRL = 0; case 1: if (yyyCond(0) != yyyPass) { #line 28 "expr.Y" printf(" * "); #line 533 "expr.oxout.y" } break; } break; } break; case 3: switch(yyyi) { case 0: switch(yyyPass) { case 0: yyyRL = 0;yyySetCond(0) case 1: if (yyyCond(0) != yyyPass) { #line 32 "expr.Y" printf(" + "); #line 554 "expr.oxout.y" } break; } break; case 1: switch(yyyPass) { case 0: yyyRL = 0; case 1: if (yyyCond(0) != yyyPass) { #line 33 "expr.Y" printf(" + "); #line 569 "expr.oxout.y" } break; } break; } break; case 4: switch(yyyi) { case 0: switch(yyyPass) { case 0: yyyRL = 0;yyySetCond(0) case 1: if (yyyCond(0) != yyyPass) { #line 37 "expr.Y" printf(" / "); #line 590 "expr.oxout.y" } break; } break; case 1: switch(yyyPass) { case 0: yyyRL = 0; case 1: if (yyyCond(0) != yyyPass) { #line 36 "expr.Y" printf(" / "); #line 605 "expr.oxout.y" } break; } break; } break; case 5: switch(yyyi) { case 0: switch(yyyPass) { case 0: yyyRL = 0;yyySetCond(0) case 1: if (yyyCond(0) != yyyPass) { #line 41 "expr.Y" printf(" - "); #line 626 "expr.oxout.y" } break; } break; case 1: switch(yyyPass) { case 0: yyyRL = 0; case 1: if (yyyCond(0) != yyyPass) { #line 40 "expr.Y" printf(" - "); #line 641 "expr.oxout.y" } break; } break; } break; case 6: switch(yyyi) { case 0: switch(yyyPass) { case 0: yyyRL = 0; case 1: break; } break; case 1: switch(yyyPass) { case 0: yyyRL = 0; case 1: break; } break; } break; case 7: switch(yyyi) { case 0: switch(yyyPass) { case 0: yyyRL = 0;yyySetCond(0) case 1: if (yyyCond(0) != yyyPass) { #line 46 "expr.Y" printf(" %s ",yyyTSTn->cL[0]->yyyAttrbs.yyyAttrb1.lexeme); #line 685 "expr.oxout.y" } break; } break; case 1: switch(yyyPass) { case 0: yyyRL = 0; case 1: if (yyyCond(0) != yyyPass) { #line 45 "expr.Y" printf(" %s ",yyyTSTn->cL[0]->yyyAttrbs.yyyAttrb1.lexeme); #line 700 "expr.oxout.y" } break; } break; } break; case 8: switch(yyyi) { case 0: switch(yyyPass) { case 0: yyyRL = 0;yyySetCond(0) case 1: if (yyyCond(0) != yyyPass) { #line 50 "expr.Y" printf(" %s ",yyyTSTn->cL[0]->yyyAttrbs.yyyAttrb1.lexeme); #line 721 "expr.oxout.y" } break; } break; case 1: switch(yyyPass) { case 0: yyyRL = 0; case 1: if (yyyCond(0) != yyyPass) { #line 49 "expr.Y" printf(" %s ",yyyTSTn->cL[0]->yyyAttrbs.yyyAttrb1.lexeme); #line 736 "expr.oxout.y" } break; } break; } break; } /* switch */ if (yyyPass) goto yyyTpop; else goto yyyTpush; } /* while */ } /* for */ } /* yyyDoTraversals */ void yyyExecuteRRsection(yyyGNT *rootNode) { int yyyi; long cycleSum = 0; long nNZrc = 0; if (!yyyYok) return; yyyCheckUnsolvedInstTrav(rootNode,&nNZrc,&cycleSum); if (nNZrc) { fputs("\n\n\n**********\n",stderr); fputs("cycle detected in completed parse tree",stderr); fputs(" after decoration.\n",stderr); #if CYCLE_VERBOSE fprintf(stderr, "number of unsolved attribute instances == %ld.\n", nNZrc ); fprintf(stderr, "total number of remaining dependencies == %ld.\n", cycleSum ); fputs("average number of remaining dependencies\n",stderr); fprintf(stderr," per unsolved instance == %f.\n", ((float)(cycleSum)/(float)(nNZrc)) ); #endif fprintf(stderr, "searching parse tree for %ld unsolved instances:\n", nNZrc ); yyyUnsolvedInstSearchTravAux(rootNode); } yyyDoTraversals(rootNode); } /* yyyExecuteRRsection */ yyyWAT yyyLRCIL[2] = {0,0, }; void yyyYoxInit(void) { static int yyyInitDone = 0; if (yyyInitDone) return; if ((yyyRS = (struct yyyRSitem *) calloc((size_t)(yyyRSmaxSize+1), (size_t)sizeof(struct yyyRSitem)) ) == ((struct yyyRSitem *) NULL) ) yyyfatal("malloc error in ox ready set space allocation\n"); yyyRS++; yyyAfterRS = yyyRS + yyyRSmaxSize; if ((yyySSALspace = (struct yyySolvedSAlistCell *) calloc((size_t)(yyySSALspaceSize+1), (size_t)sizeof(struct yyySolvedSAlistCell)) ) == ((struct yyySolvedSAlistCell *) NULL) ) yyyfatal("malloc error in stack solved list space allocation\n"); yyyInitDone = 1; yyyRSTop = yyyRS - 1; } /* yyyYoxInit */ void yyyDecorate(void) { while (yyyRSTop >= yyyRS) yyySolveAndSignal(); } void yyyGenIntNode(long yyyProdNum, int yyyRHSlength, int yyyNattrbs, struct yyyOxAttrbs *yyval_OxAttrbs, ...) {yyyWST i; yyySIT **yyyOxStackItem = &yyval_OxAttrbs->yyyOxStackItem; yyyGNT *gnpDum; va_list ap; *yyyOxStackItem = (yyySIT *) malloc((size_t)sizeof(yyySIT)); if (*yyyOxStackItem == (yyySIT *) NULL) yyyfatal("malloc error in ox yacc semantic stack space allocation\n"); (*yyyOxStackItem)->node = (yyyGNT *) malloc((size_t)sizeof(yyyGNT)); if ((*yyyOxStackItem)->node == (yyyGNT *) NULL) yyyfatal("malloc error in ox node space allocation\n"); (*yyyOxStackItem)->solvedSAlist = yyyLambdaSSAL; (*yyyOxStackItem)->node->parent.stackref = *yyyOxStackItem; (*yyyOxStackItem)->node->parentIsStack = 1; (*yyyOxStackItem)->node->cLlen = yyyRHSlength; (*yyyOxStackItem)->node->cL = (yyyGNT **) calloc((size_t)yyyRHSlength, (size_t)sizeof(yyyGNT *)); if ((*yyyOxStackItem)->node->cL == (yyyGNT **) NULL) yyyfatal("malloc error in ox child list space allocation\n"); (*yyyOxStackItem)->node->refCountListLen = yyyNattrbs; (*yyyOxStackItem)->node->refCountList = (yyyRCT *) calloc((size_t)yyyNattrbs, (size_t)sizeof(yyyRCT)); if ((*yyyOxStackItem)->node->refCountList == (yyyRCT *) NULL) yyyfatal("malloc error in ox reference count list space allocation\n"); (*yyyOxStackItem)->node->prodNum = yyyProdNum; va_start(ap, yyval_OxAttrbs); for (i=1;i<=yyyRHSlength;i++) {yyySIT *yaccStDum = va_arg(ap,struct yyyOxAttrbs *)->yyyOxStackItem; gnpDum = (*yyyOxStackItem)->node->cL[i-1] = yaccStDum->node; gnpDum->whichSym = i; gnpDum->parent.noderef = (*yyyOxStackItem)->node; gnpDum->parentIsStack = 0; } va_end(ap); } #define yyyDECORfREQ 50 void yyyAdjustINRC(long yyyProdNum, int yyyRHSlength, long startP, long stopP, struct yyyOxAttrbs *yyval_OxAttrbs, ...) {yyyWST i; yyySIT *yyyOxStackItem = yyval_OxAttrbs->yyyOxStackItem; long SSALptr,SSALptrHead,*cPtrPtr; long *pL; yyyGNT *gnpDum; long iTemp; long nextP; static unsigned short intNodeCount = yyyDECORfREQ; va_list ap; nextP = startP; while (nextP < stopP) {if (yyyRCIL[nextP] == yyyR) {(yyyOxStackItem->node->refCountList)[yyyRCIL[nextP+1]] = yyyRCIL[nextP+2]; } else {(((yyyOxStackItem->node->cL)[yyyRCIL[nextP]])->refCountList)[yyyRCIL[nextP+1]] = yyyRCIL[nextP+2]; } nextP += 3; } pL = yyyIIEL + yyyIIIEL[yyyProdNum]; va_start(ap, yyval_OxAttrbs); for (i=1;i<=yyyRHSlength;i++) {yyySIT *yaccStDum = va_arg(ap,struct yyyOxAttrbs *)->yyyOxStackItem; pL++; SSALptrHead = SSALptr = *(cPtrPtr = &(yaccStDum->solvedSAlist)); if (SSALptr != yyyLambdaSSAL) {*cPtrPtr = yyyLambdaSSAL; do { iTemp = (*pL+yyySSALspace[SSALptr].attrbNum); yyySignalEnts(yyyOxStackItem->node, yyyIEL[iTemp], yyyIEL[iTemp+1] ); SSALptr = *(cPtrPtr = &(yyySSALspace[SSALptr].next)); } while (SSALptr != yyyLambdaSSAL); *cPtrPtr = yyySSALCfreeList; yyySSALCfreeList = SSALptrHead; } } va_end(ap); nextP = startP + 2; while (nextP < stopP) {if (!yyyRCIL[nextP]) {if (yyyRCIL[nextP-2] == yyyR) {pL = &(yyyOxStackItem->solvedSAlist); if (yyySSALCfreeList == yyyLambdaSSAL) {yyySSALspace[yyyNewSSALC].next = *pL; if ((*pL = yyyNewSSALC++) == yyySSALspaceSize) yyyHandleOverflow(yyySSALof); } else {iTemp = yyySSALCfreeList; yyySSALCfreeList = yyySSALspace[yyySSALCfreeList].next; yyySSALspace[iTemp].next = *pL; *pL = iTemp; } yyySSALspace[*pL].attrbNum = yyyRCIL[nextP-1]; } else {if ((gnpDum = (yyyOxStackItem->node->cL)[yyyRCIL[nextP-2]])->prodNum != 0) { iTemp = yyyIIEL[yyyIIIEL[gnpDum->prodNum]] + yyyRCIL[nextP-1]; yyySignalEnts(gnpDum, yyyIEL[iTemp], yyyIEL[iTemp+1] ); } } } nextP += 3; } if (!--intNodeCount) {intNodeCount = yyyDECORfREQ; yyyDecorate(); } } void yyyGenLeaf(int nAttrbs,int typeNum,long startP,long stopP,YYSTYPE *yylval) {yyyRCT *rcPdum; yyySIT **yyyOxStackItem = &yylval->yyyOxAttrbs.yyyOxStackItem; (*yyyOxStackItem) = (yyySIT *) malloc((size_t)sizeof(yyySIT)); if ((*yyyOxStackItem) == (yyySIT *) NULL) yyyfatal("malloc error in ox yacc semantic stack space allocation\n"); (*yyyOxStackItem)->node = (yyyGNT *) malloc((size_t)sizeof(yyyGNT)) ; if ((*yyyOxStackItem)->node == (yyyGNT *) NULL) yyyfatal("malloc error in ox node space allocation\n"); (*yyyOxStackItem)->solvedSAlist = yyyLambdaSSAL; (*yyyOxStackItem)->node->parent.stackref = *yyyOxStackItem; (*yyyOxStackItem)->node->parentIsStack = 1; (*yyyOxStackItem)->node->cLlen = 0; (*yyyOxStackItem)->node->cL = (yyyGNT **)NULL; (*yyyOxStackItem)->node->refCountListLen = nAttrbs; rcPdum = (*yyyOxStackItem)->node->refCountList = (yyyRCT *) calloc((size_t)nAttrbs, (size_t)sizeof(yyyRCT)); if (rcPdum == (yyyRCT *) NULL) yyyfatal("malloc error in ox reference count list space allocation\n"); while (startP < stopP) rcPdum[yyyLRCIL[startP++]] = 0; (*yyyOxStackItem)->node->prodNum = 0; (*yyyOxStackItem)->node->whichSym = 0; } void yyyabort(void) {yyyYok = 0; } #define yyyLastProdNum 8 #define yyyNsorts 1 int yyyProdsInd[] = { 0, 0, 2, 6, 10, 14, 18, 22, 24, 26, }; int yyyProds[][2] = { { 116, 0},{ 462, 0},{ 462, 0},{ 462, 0},{ 412, 0}, { 462, 0},{ 462, 0},{ 462, 0},{ 420, 0},{ 462, 0}, { 462, 0},{ 462, 0},{ 452, 0},{ 462, 0},{ 462, 0}, { 462, 0},{ 436, 0},{ 462, 0},{ 462, 0},{ 396, 0}, { 462, 0},{ 404, 0},{ 462, 0},{ 619, 1},{ 462, 0}, { 567, 1}, }; int yyySortsInd[] = { 0, 0, 1, }; int yyySorts[] = { 413, }; char *yyyStringTab[] = { 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,"s",0,0,0, 0,0,"y",0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,"LRpre",0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,"'('",0,0,0, 0,0,0,0,"')'", 0,0,0,0,0, 0,0,"'*'","lexeme",0, 0,0,0,0,0, "'+'",0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,"'-'",0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,"'/'",0,0, 0,0,0,0,0, 0,0,"expr",0,0, 0,0,0,0,0, 0,0,0,0,0, 0,"printf",0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,"CONST","LRpost",0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,"ID", 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0, }; #define yyySizeofProd(num) (yyyProdsInd[(num)+1] - yyyProdsInd[(num)]) #define yyyGSoccurStr(prodNum,symPos) \ (yyyStringTab[yyyProds[yyyProdsInd[(prodNum)] + (symPos)][0]]) #define yyySizeofSort(num) (yyySortsInd[(num)+1] - yyySortsInd[(num)]) #define yyySortOf(prodNum,symPos) \ (yyyProds[yyyProdsInd[(prodNum)] + (symPos)][1]) #define yyyAttrbStr(prodNum,symPos,attrbNum) \ (yyyStringTab[yyySorts[yyySortsInd[yyySortOf(prodNum,symPos)] + \ (attrbNum) \ ] \ ] \ ) void yyyShowProd(int i) {int j,nSyms; nSyms = yyySizeofProd(i); for (j=0; j\n",stderr); else putc('\n',stderr); } } } void yyyCheckNodeInstancesSolved(yyyGNT *np) {int mysort,sortSize,i,prodNum,symPos,inTerminalNode; int nUnsolvedInsts = 0; if (np->prodNum != 0) {inTerminalNode = 0; prodNum = np->prodNum; symPos = 0; } else {inTerminalNode = 1; prodNum = np->parent.noderef->prodNum; symPos = np->whichSym; } mysort = yyySortOf(prodNum,symPos); sortSize = yyySizeofSort(mysort); for (i=0; irefCountList)[i] != 0) nUnsolvedInsts += 1; if (nUnsolvedInsts) {fprintf(stderr, "\nFound node that has %d unsolved attribute instance(s).\n", nUnsolvedInsts ); fprintf(stderr,"Node is labeled \"%s\".\n", yyyGSoccurStr(prodNum,symPos)); if (inTerminalNode) {fputs("Node is terminal. Its parent production is:\n ",stderr); yyyShowProd(prodNum); } else {fputs("Node is nonterminal. ",stderr); if (!(np->parentIsStack)) {fprintf(stderr, "Node is %dth child in its parent production:\n ", np->whichSym ); yyyShowProd(np->parent.noderef->prodNum); } fputs("Node is on left hand side of this production:\n ",stderr); yyyShowProd(np->prodNum); } fputs("The following instances are unsolved:\n",stderr); for (i=0; irefCountList)[i] != 0) fprintf(stderr," %-16s still has %1d dependencies.\n", yyyAttrbStr(prodNum,symPos,i),(np->refCountList)[i]); } } void yyyCheckUnsolvedInstTrav(yyyGNT *pNode,long *nNZrc,long *cycleSum) {yyyGNT **yyyCLpdum; yyyRCT *rcp; int i; /* visit the refCountList of each node in the tree, and sum the non-zero refCounts */ rcp = pNode->refCountList; i = pNode->refCountListLen; while (i--) if (*rcp++) {*cycleSum += *(rcp - 1); (*nNZrc)++;} yyyCLpdum = pNode->cL; i = pNode->cLlen; while (i--) { yyyCheckUnsolvedInstTrav(*yyyCLpdum,nNZrc,cycleSum); yyyCLpdum++; } } void yyyUnsolvedInstSearchTravAux(yyyGNT *pNode) {yyyGNT **yyyCLpdum; int i; yyyCheckNodeInstancesSolved(pNode); yyyCLpdum = pNode->cL; i = pNode->cLlen; while (i--) { yyyUnsolvedInstSearchTravAux(*yyyCLpdum); yyyCLpdum++; } } void yyyUnsolvedInstSearchTrav(yyyGNT *pNode) {yyyGNT **yyyCLpdum; int i; yyyCLpdum = pNode->cL; i = pNode->cLlen; while (i--) { yyyUnsolvedInstSearchTravAux(*yyyCLpdum); yyyCLpdum++; } } #line 1797 "expr.oxout.tab.c" /* For use in generated program */ #define yydepth (int)(yystack.s_mark - yystack.s_base) #if YYBTYACC #define yytrial (yyps->save) #endif /* YYBTYACC */ #if YYDEBUG #include /* needed for printf */ #endif #include /* needed for malloc, etc */ #include /* needed for memset */ /* allocate initial stack or double stack size, up to YYMAXDEPTH */ static int yygrowstack(YYSTACKDATA *data) { int i; unsigned newsize; YYINT *newss; YYSTYPE *newvs; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) YYLTYPE *newps; #endif if ((newsize = data->stacksize) == 0) newsize = YYINITSTACKSIZE; else if (newsize >= YYMAXDEPTH) return YYENOMEM; else if ((newsize *= 2) > YYMAXDEPTH) newsize = YYMAXDEPTH; i = (int) (data->s_mark - data->s_base); newss = (YYINT *)realloc(data->s_base, newsize * sizeof(*newss)); if (newss == 0) return YYENOMEM; data->s_base = newss; data->s_mark = newss + i; newvs = (YYSTYPE *)realloc(data->l_base, newsize * sizeof(*newvs)); if (newvs == 0) return YYENOMEM; data->l_base = newvs; data->l_mark = newvs + i; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) newps = (YYLTYPE *)realloc(data->p_base, newsize * sizeof(*newps)); if (newps == 0) return YYENOMEM; data->p_base = newps; data->p_mark = newps + i; #endif data->stacksize = newsize; data->s_last = data->s_base + newsize - 1; #if YYDEBUG if (yydebug) fprintf(stderr, "%sdebug: stack size increased to %d\n", YYPREFIX, newsize); #endif return 0; } #if YYPURE || defined(YY_NO_LEAKS) static void yyfreestack(YYSTACKDATA *data) { free(data->s_base); free(data->l_base); #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) free(data->p_base); #endif memset(data, 0, sizeof(*data)); } #else #define yyfreestack(data) /* nothing */ #endif /* YYPURE || defined(YY_NO_LEAKS) */ #if YYBTYACC static YYParseState * yyNewState(unsigned size) { YYParseState *p = (YYParseState *) malloc(sizeof(YYParseState)); if (p == NULL) return NULL; p->yystack.stacksize = size; if (size == 0) { p->yystack.s_base = NULL; p->yystack.l_base = NULL; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) p->yystack.p_base = NULL; #endif return p; } p->yystack.s_base = (YYINT *) malloc(size * sizeof(YYINT)); if (p->yystack.s_base == NULL) return NULL; p->yystack.l_base = (YYSTYPE *) malloc(size * sizeof(YYSTYPE)); if (p->yystack.l_base == NULL) return NULL; memset(p->yystack.l_base, 0, size * sizeof(YYSTYPE)); #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) p->yystack.p_base = (YYLTYPE *) malloc(size * sizeof(YYLTYPE)); if (p->yystack.p_base == NULL) return NULL; memset(p->yystack.p_base, 0, size * sizeof(YYLTYPE)); #endif return p; } static void yyFreeState(YYParseState *p) { yyfreestack(&p->yystack); free(p); } #endif /* YYBTYACC */ #define YYABORT goto yyabort #define YYREJECT goto yyabort #define YYACCEPT goto yyaccept #define YYERROR goto yyerrlab #if YYBTYACC #define YYVALID do { if (yyps->save) goto yyvalid; } while(0) #define YYVALID_NESTED do { if (yyps->save && \ yyps->save->save == 0) goto yyvalid; } while(0) #endif /* YYBTYACC */ int YYPARSE_DECL() { int yym, yyn, yystate, yyresult; #if YYBTYACC int yynewerrflag; YYParseState *yyerrctx = NULL; #endif /* YYBTYACC */ #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) YYLTYPE yyerror_loc_range[3]; /* position of error start/end (0 unused) */ #endif #if YYDEBUG const char *yys; if ((yys = getenv("YYDEBUG")) != 0) { yyn = *yys; if (yyn >= '0' && yyn <= '9') yydebug = yyn - '0'; } if (yydebug) fprintf(stderr, "%sdebug[<# of symbols on state stack>]\n", YYPREFIX); #endif #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) memset(yyerror_loc_range, 0, sizeof(yyerror_loc_range)); #endif #if YYBTYACC yyps = yyNewState(0); if (yyps == 0) goto yyenomem; yyps->save = 0; #endif /* YYBTYACC */ yym = 0; yyn = 0; yynerrs = 0; yyerrflag = 0; yychar = YYEMPTY; yystate = 0; #if YYPURE memset(&yystack, 0, sizeof(yystack)); #endif if (yystack.s_base == NULL && yygrowstack(&yystack) == YYENOMEM) goto yyoverflow; yystack.s_mark = yystack.s_base; yystack.l_mark = yystack.l_base; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yystack.p_mark = yystack.p_base; #endif yystate = 0; *yystack.s_mark = 0; yyloop: if ((yyn = yydefred[yystate]) != 0) goto yyreduce; if (yychar < 0) { #if YYBTYACC do { if (yylvp < yylve) { /* we're currently re-reading tokens */ yylval = *yylvp++; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yylloc = *yylpp++; #endif yychar = *yylexp++; break; } if (yyps->save) { /* in trial mode; save scanner results for future parse attempts */ if (yylvp == yylvlim) { /* Enlarge lexical value queue */ size_t p = (size_t) (yylvp - yylvals); size_t s = (size_t) (yylvlim - yylvals); s += YYLVQUEUEGROWTH; if ((yylexemes = (YYINT *)realloc(yylexemes, s * sizeof(YYINT))) == NULL) goto yyenomem; if ((yylvals = (YYSTYPE *)realloc(yylvals, s * sizeof(YYSTYPE))) == NULL) goto yyenomem; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) if ((yylpsns = (YYLTYPE *)realloc(yylpsns, s * sizeof(YYLTYPE))) == NULL) goto yyenomem; #endif yylvp = yylve = yylvals + p; yylvlim = yylvals + s; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yylpp = yylpe = yylpsns + p; yylplim = yylpsns + s; #endif yylexp = yylexemes + p; } *yylexp = (YYINT) YYLEX; *yylvp++ = yylval; yylve++; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) *yylpp++ = yylloc; yylpe++; #endif yychar = *yylexp++; break; } /* normal operation, no conflict encountered */ #endif /* YYBTYACC */ yychar = YYLEX; #if YYBTYACC } while (0); #endif /* YYBTYACC */ if (yychar < 0) yychar = YYEOF; #if YYDEBUG if (yydebug) { if ((yys = yyname[YYTRANSLATE(yychar)]) == NULL) yys = yyname[YYUNDFTOKEN]; fprintf(stderr, "%s[%d]: state %d, reading token %d (%s)", YYDEBUGSTR, yydepth, yystate, yychar, yys); #ifdef YYSTYPE_TOSTRING #if YYBTYACC if (!yytrial) #endif /* YYBTYACC */ fprintf(stderr, " <%s>", YYSTYPE_TOSTRING(yychar, yylval)); #endif fputc('\n', stderr); } #endif } #if YYBTYACC /* Do we have a conflict? */ if (((yyn = yycindex[yystate]) != 0) && (yyn += yychar) >= 0 && yyn <= YYTABLESIZE && yycheck[yyn] == (YYINT) yychar) { YYINT ctry; if (yypath) { YYParseState *save; #if YYDEBUG if (yydebug) fprintf(stderr, "%s[%d]: CONFLICT in state %d: following successful trial parse\n", YYDEBUGSTR, yydepth, yystate); #endif /* Switch to the next conflict context */ save = yypath; yypath = save->save; save->save = NULL; ctry = save->ctry; if (save->state != yystate) YYABORT; yyFreeState(save); } else { /* Unresolved conflict - start/continue trial parse */ YYParseState *save; #if YYDEBUG if (yydebug) { fprintf(stderr, "%s[%d]: CONFLICT in state %d. ", YYDEBUGSTR, yydepth, yystate); if (yyps->save) fputs("ALREADY in conflict, continuing trial parse.\n", stderr); else fputs("Starting trial parse.\n", stderr); } #endif save = yyNewState((unsigned)(yystack.s_mark - yystack.s_base + 1)); if (save == NULL) goto yyenomem; save->save = yyps->save; save->state = yystate; save->errflag = yyerrflag; save->yystack.s_mark = save->yystack.s_base + (yystack.s_mark - yystack.s_base); memcpy (save->yystack.s_base, yystack.s_base, (size_t) (yystack.s_mark - yystack.s_base + 1) * sizeof(YYINT)); save->yystack.l_mark = save->yystack.l_base + (yystack.l_mark - yystack.l_base); memcpy (save->yystack.l_base, yystack.l_base, (size_t) (yystack.l_mark - yystack.l_base + 1) * sizeof(YYSTYPE)); #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) save->yystack.p_mark = save->yystack.p_base + (yystack.p_mark - yystack.p_base); memcpy (save->yystack.p_base, yystack.p_base, (size_t) (yystack.p_mark - yystack.p_base + 1) * sizeof(YYLTYPE)); #endif ctry = yytable[yyn]; if (yyctable[ctry] == -1) { #if YYDEBUG if (yydebug && yychar >= YYEOF) fprintf(stderr, "%s[%d]: backtracking 1 token\n", YYDEBUGSTR, yydepth); #endif ctry++; } save->ctry = ctry; if (yyps->save == NULL) { /* If this is a first conflict in the stack, start saving lexemes */ if (!yylexemes) { yylexemes = (YYINT *) malloc((YYLVQUEUEGROWTH) * sizeof(YYINT)); if (yylexemes == NULL) goto yyenomem; yylvals = (YYSTYPE *) malloc((YYLVQUEUEGROWTH) * sizeof(YYSTYPE)); if (yylvals == NULL) goto yyenomem; yylvlim = yylvals + YYLVQUEUEGROWTH; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yylpsns = (YYLTYPE *) malloc((YYLVQUEUEGROWTH) * sizeof(YYLTYPE)); if (yylpsns == NULL) goto yyenomem; yylplim = yylpsns + YYLVQUEUEGROWTH; #endif } if (yylvp == yylve) { yylvp = yylve = yylvals; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yylpp = yylpe = yylpsns; #endif yylexp = yylexemes; if (yychar >= YYEOF) { *yylve++ = yylval; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) *yylpe++ = yylloc; #endif *yylexp = (YYINT) yychar; yychar = YYEMPTY; } } } if (yychar >= YYEOF) { yylvp--; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yylpp--; #endif yylexp--; yychar = YYEMPTY; } save->lexeme = (int) (yylvp - yylvals); yyps->save = save; } if (yytable[yyn] == ctry) { #if YYDEBUG if (yydebug) fprintf(stderr, "%s[%d]: state %d, shifting to state %d\n", YYDEBUGSTR, yydepth, yystate, yyctable[ctry]); #endif if (yychar < 0) { yylvp++; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yylpp++; #endif yylexp++; } if (yystack.s_mark >= yystack.s_last && yygrowstack(&yystack) == YYENOMEM) goto yyoverflow; yystate = yyctable[ctry]; *++yystack.s_mark = (YYINT) yystate; *++yystack.l_mark = yylval; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) *++yystack.p_mark = yylloc; #endif yychar = YYEMPTY; if (yyerrflag > 0) --yyerrflag; goto yyloop; } else { yyn = yyctable[ctry]; goto yyreduce; } } /* End of code dealing with conflicts */ #endif /* YYBTYACC */ if (((yyn = yysindex[yystate]) != 0) && (yyn += yychar) >= 0 && yyn <= YYTABLESIZE && yycheck[yyn] == (YYINT) yychar) { #if YYDEBUG if (yydebug) fprintf(stderr, "%s[%d]: state %d, shifting to state %d\n", YYDEBUGSTR, yydepth, yystate, yytable[yyn]); #endif if (yystack.s_mark >= yystack.s_last && yygrowstack(&yystack) == YYENOMEM) goto yyoverflow; yystate = yytable[yyn]; *++yystack.s_mark = yytable[yyn]; *++yystack.l_mark = yylval; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) *++yystack.p_mark = yylloc; #endif yychar = YYEMPTY; if (yyerrflag > 0) --yyerrflag; goto yyloop; } if (((yyn = yyrindex[yystate]) != 0) && (yyn += yychar) >= 0 && yyn <= YYTABLESIZE && yycheck[yyn] == (YYINT) yychar) { yyn = yytable[yyn]; goto yyreduce; } if (yyerrflag != 0) goto yyinrecovery; #if YYBTYACC yynewerrflag = 1; goto yyerrhandler; goto yyerrlab; /* redundant goto avoids 'unused label' warning */ yyerrlab: /* explicit YYERROR from an action -- pop the rhs of the rule reduced * before looking for error recovery */ yystack.s_mark -= yym; yystate = *yystack.s_mark; yystack.l_mark -= yym; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yystack.p_mark -= yym; #endif yynewerrflag = 0; yyerrhandler: while (yyps->save) { int ctry; YYParseState *save = yyps->save; #if YYDEBUG if (yydebug) fprintf(stderr, "%s[%d]: ERROR in state %d, CONFLICT BACKTRACKING to state %d, %d tokens\n", YYDEBUGSTR, yydepth, yystate, yyps->save->state, (int)(yylvp - yylvals - yyps->save->lexeme)); #endif /* Memorize most forward-looking error state in case it's really an error. */ if (yyerrctx == NULL || yyerrctx->lexeme < yylvp - yylvals) { /* Free old saved error context state */ if (yyerrctx) yyFreeState(yyerrctx); /* Create and fill out new saved error context state */ yyerrctx = yyNewState((unsigned)(yystack.s_mark - yystack.s_base + 1)); if (yyerrctx == NULL) goto yyenomem; yyerrctx->save = yyps->save; yyerrctx->state = yystate; yyerrctx->errflag = yyerrflag; yyerrctx->yystack.s_mark = yyerrctx->yystack.s_base + (yystack.s_mark - yystack.s_base); memcpy (yyerrctx->yystack.s_base, yystack.s_base, (size_t) (yystack.s_mark - yystack.s_base + 1) * sizeof(YYINT)); yyerrctx->yystack.l_mark = yyerrctx->yystack.l_base + (yystack.l_mark - yystack.l_base); memcpy (yyerrctx->yystack.l_base, yystack.l_base, (size_t) (yystack.l_mark - yystack.l_base + 1) * sizeof(YYSTYPE)); #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yyerrctx->yystack.p_mark = yyerrctx->yystack.p_base + (yystack.p_mark - yystack.p_base); memcpy (yyerrctx->yystack.p_base, yystack.p_base, (size_t) (yystack.p_mark - yystack.p_base + 1) * sizeof(YYLTYPE)); #endif yyerrctx->lexeme = (int) (yylvp - yylvals); } yylvp = yylvals + save->lexeme; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yylpp = yylpsns + save->lexeme; #endif yylexp = yylexemes + save->lexeme; yychar = YYEMPTY; yystack.s_mark = yystack.s_base + (save->yystack.s_mark - save->yystack.s_base); memcpy (yystack.s_base, save->yystack.s_base, (size_t) (yystack.s_mark - yystack.s_base + 1) * sizeof(YYINT)); yystack.l_mark = yystack.l_base + (save->yystack.l_mark - save->yystack.l_base); memcpy (yystack.l_base, save->yystack.l_base, (size_t) (yystack.l_mark - yystack.l_base + 1) * sizeof(YYSTYPE)); #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yystack.p_mark = yystack.p_base + (save->yystack.p_mark - save->yystack.p_base); memcpy (yystack.p_base, save->yystack.p_base, (size_t) (yystack.p_mark - yystack.p_base + 1) * sizeof(YYLTYPE)); #endif ctry = ++save->ctry; yystate = save->state; /* We tried shift, try reduce now */ if ((yyn = yyctable[ctry]) >= 0) goto yyreduce; yyps->save = save->save; save->save = NULL; yyFreeState(save); /* Nothing left on the stack -- error */ if (!yyps->save) { #if YYDEBUG if (yydebug) fprintf(stderr, "%sdebug[%d,trial]: trial parse FAILED, entering ERROR mode\n", YYPREFIX, yydepth); #endif /* Restore state as it was in the most forward-advanced error */ yylvp = yylvals + yyerrctx->lexeme; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yylpp = yylpsns + yyerrctx->lexeme; #endif yylexp = yylexemes + yyerrctx->lexeme; yychar = yylexp[-1]; yylval = yylvp[-1]; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yylloc = yylpp[-1]; #endif yystack.s_mark = yystack.s_base + (yyerrctx->yystack.s_mark - yyerrctx->yystack.s_base); memcpy (yystack.s_base, yyerrctx->yystack.s_base, (size_t) (yystack.s_mark - yystack.s_base + 1) * sizeof(YYINT)); yystack.l_mark = yystack.l_base + (yyerrctx->yystack.l_mark - yyerrctx->yystack.l_base); memcpy (yystack.l_base, yyerrctx->yystack.l_base, (size_t) (yystack.l_mark - yystack.l_base + 1) * sizeof(YYSTYPE)); #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yystack.p_mark = yystack.p_base + (yyerrctx->yystack.p_mark - yyerrctx->yystack.p_base); memcpy (yystack.p_base, yyerrctx->yystack.p_base, (size_t) (yystack.p_mark - yystack.p_base + 1) * sizeof(YYLTYPE)); #endif yystate = yyerrctx->state; yyFreeState(yyerrctx); yyerrctx = NULL; } yynewerrflag = 1; } if (yynewerrflag == 0) goto yyinrecovery; #endif /* YYBTYACC */ YYERROR_CALL("syntax error"); #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yyerror_loc_range[1] = yylloc; /* lookahead position is error start position */ #endif #if !YYBTYACC goto yyerrlab; /* redundant goto avoids 'unused label' warning */ yyerrlab: #endif ++yynerrs; yyinrecovery: if (yyerrflag < 3) { yyerrflag = 3; for (;;) { if (((yyn = yysindex[*yystack.s_mark]) != 0) && (yyn += YYERRCODE) >= 0 && yyn <= YYTABLESIZE && yycheck[yyn] == (YYINT) YYERRCODE) { #if YYDEBUG if (yydebug) fprintf(stderr, "%s[%d]: state %d, error recovery shifting to state %d\n", YYDEBUGSTR, yydepth, *yystack.s_mark, yytable[yyn]); #endif if (yystack.s_mark >= yystack.s_last && yygrowstack(&yystack) == YYENOMEM) goto yyoverflow; yystate = yytable[yyn]; *++yystack.s_mark = yytable[yyn]; *++yystack.l_mark = yylval; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) /* lookahead position is error end position */ yyerror_loc_range[2] = yylloc; YYLLOC_DEFAULT(yyloc, yyerror_loc_range, 2); /* position of error span */ *++yystack.p_mark = yyloc; #endif goto yyloop; } else { #if YYDEBUG if (yydebug) fprintf(stderr, "%s[%d]: error recovery discarding state %d\n", YYDEBUGSTR, yydepth, *yystack.s_mark); #endif if (yystack.s_mark <= yystack.s_base) goto yyabort; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) /* the current TOS position is the error start position */ yyerror_loc_range[1] = *yystack.p_mark; #endif #if defined(YYDESTRUCT_CALL) #if YYBTYACC if (!yytrial) #endif /* YYBTYACC */ #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) YYDESTRUCT_CALL("error: discarding state", yystos[*yystack.s_mark], yystack.l_mark, yystack.p_mark); #else YYDESTRUCT_CALL("error: discarding state", yystos[*yystack.s_mark], yystack.l_mark); #endif /* defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) */ #endif /* defined(YYDESTRUCT_CALL) */ --yystack.s_mark; --yystack.l_mark; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) --yystack.p_mark; #endif } } } else { if (yychar == YYEOF) goto yyabort; #if YYDEBUG if (yydebug) { if ((yys = yyname[YYTRANSLATE(yychar)]) == NULL) yys = yyname[YYUNDFTOKEN]; fprintf(stderr, "%s[%d]: state %d, error recovery discarding token %d (%s)\n", YYDEBUGSTR, yydepth, yystate, yychar, yys); } #endif #if defined(YYDESTRUCT_CALL) #if YYBTYACC if (!yytrial) #endif /* YYBTYACC */ #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) YYDESTRUCT_CALL("error: discarding token", yychar, &yylval, &yylloc); #else YYDESTRUCT_CALL("error: discarding token", yychar, &yylval); #endif /* defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) */ #endif /* defined(YYDESTRUCT_CALL) */ yychar = YYEMPTY; goto yyloop; } yyreduce: yym = yylen[yyn]; #if YYDEBUG if (yydebug) { fprintf(stderr, "%s[%d]: state %d, reducing by rule %d (%s)", YYDEBUGSTR, yydepth, yystate, yyn, yyrule[yyn]); #ifdef YYSTYPE_TOSTRING #if YYBTYACC if (!yytrial) #endif /* YYBTYACC */ if (yym > 0) { int i; fputc('<', stderr); for (i = yym; i > 0; i--) { if (i != yym) fputs(", ", stderr); fputs(YYSTYPE_TOSTRING(yystos[yystack.s_mark[1-i]], yystack.l_mark[1-i]), stderr); } fputc('>', stderr); } #endif fputc('\n', stderr); } #endif if (yym > 0) yyval = yystack.l_mark[1-yym]; else memset(&yyval, 0, sizeof yyval); #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) /* Perform position reduction */ memset(&yyloc, 0, sizeof(yyloc)); #if YYBTYACC if (!yytrial) #endif /* YYBTYACC */ { YYLLOC_DEFAULT(yyloc, &yystack.p_mark[-yym], yym); /* just in case YYERROR is invoked within the action, save the start of the rhs as the error start position */ yyerror_loc_range[1] = yystack.p_mark[1-yym]; } #endif switch (yyn) { case 1: #line 64 "expr.oxout.y" {yyyYoxInit();} break; case 2: #line 66 "expr.oxout.y" { yyyDecorate(); yyyExecuteRRsection(yystack.l_mark[0].yyyOxAttrbs.yyyOxStackItem->node); } break; case 3: #line 73 "expr.oxout.y" {if(yyyYok){ yyyGenIntNode(1,1,0,&yyval.yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs); yyyAdjustINRC(1,1,0,0,&yyval.yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs);}} break; case 4: #line 80 "expr.oxout.y" {if(yyyYok){ yyyGenIntNode(2,3,0,&yyval.yyyOxAttrbs,&yystack.l_mark[-2].yyyOxAttrbs,&yystack.l_mark[-1].yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs); yyyAdjustINRC(2,3,0,0,&yyval.yyyOxAttrbs,&yystack.l_mark[-2].yyyOxAttrbs,&yystack.l_mark[-1].yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs);}} break; case 5: #line 87 "expr.oxout.y" {if(yyyYok){ yyyGenIntNode(3,3,0,&yyval.yyyOxAttrbs,&yystack.l_mark[-2].yyyOxAttrbs,&yystack.l_mark[-1].yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs); yyyAdjustINRC(3,3,0,0,&yyval.yyyOxAttrbs,&yystack.l_mark[-2].yyyOxAttrbs,&yystack.l_mark[-1].yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs);}} break; case 6: #line 94 "expr.oxout.y" {if(yyyYok){ yyyGenIntNode(4,3,0,&yyval.yyyOxAttrbs,&yystack.l_mark[-2].yyyOxAttrbs,&yystack.l_mark[-1].yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs); yyyAdjustINRC(4,3,0,0,&yyval.yyyOxAttrbs,&yystack.l_mark[-2].yyyOxAttrbs,&yystack.l_mark[-1].yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs);}} break; case 7: #line 101 "expr.oxout.y" {if(yyyYok){ yyyGenIntNode(5,3,0,&yyval.yyyOxAttrbs,&yystack.l_mark[-2].yyyOxAttrbs,&yystack.l_mark[-1].yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs); yyyAdjustINRC(5,3,0,0,&yyval.yyyOxAttrbs,&yystack.l_mark[-2].yyyOxAttrbs,&yystack.l_mark[-1].yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs);}} break; case 8: #line 108 "expr.oxout.y" {if(yyyYok){ yyyGenIntNode(6,3,0,&yyval.yyyOxAttrbs,&yystack.l_mark[-2].yyyOxAttrbs,&yystack.l_mark[-1].yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs); yyyAdjustINRC(6,3,0,0,&yyval.yyyOxAttrbs,&yystack.l_mark[-2].yyyOxAttrbs,&yystack.l_mark[-1].yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs);}} break; case 9: #line 114 "expr.oxout.y" {if(yyyYok){ yyyGenIntNode(7,1,0,&yyval.yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs); yyyAdjustINRC(7,1,0,0,&yyval.yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs);}} break; case 10: #line 121 "expr.oxout.y" {if(yyyYok){ yyyGenIntNode(8,1,0,&yyval.yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs); yyyAdjustINRC(8,1,0,0,&yyval.yyyOxAttrbs,&yystack.l_mark[0].yyyOxAttrbs);}} break; #line 2525 "expr.oxout.tab.c" default: break; } yystack.s_mark -= yym; yystate = *yystack.s_mark; yystack.l_mark -= yym; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yystack.p_mark -= yym; #endif yym = yylhs[yyn]; if (yystate == 0 && yym == 0) { #if YYDEBUG if (yydebug) { fprintf(stderr, "%s[%d]: after reduction, ", YYDEBUGSTR, yydepth); #ifdef YYSTYPE_TOSTRING #if YYBTYACC if (!yytrial) #endif /* YYBTYACC */ fprintf(stderr, "result is <%s>, ", YYSTYPE_TOSTRING(yystos[YYFINAL], yyval)); #endif fprintf(stderr, "shifting from state 0 to final state %d\n", YYFINAL); } #endif yystate = YYFINAL; *++yystack.s_mark = YYFINAL; *++yystack.l_mark = yyval; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) *++yystack.p_mark = yyloc; #endif if (yychar < 0) { #if YYBTYACC do { if (yylvp < yylve) { /* we're currently re-reading tokens */ yylval = *yylvp++; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yylloc = *yylpp++; #endif yychar = *yylexp++; break; } if (yyps->save) { /* in trial mode; save scanner results for future parse attempts */ if (yylvp == yylvlim) { /* Enlarge lexical value queue */ size_t p = (size_t) (yylvp - yylvals); size_t s = (size_t) (yylvlim - yylvals); s += YYLVQUEUEGROWTH; if ((yylexemes = (YYINT *)realloc(yylexemes, s * sizeof(YYINT))) == NULL) goto yyenomem; if ((yylvals = (YYSTYPE *)realloc(yylvals, s * sizeof(YYSTYPE))) == NULL) goto yyenomem; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) if ((yylpsns = (YYLTYPE *)realloc(yylpsns, s * sizeof(YYLTYPE))) == NULL) goto yyenomem; #endif yylvp = yylve = yylvals + p; yylvlim = yylvals + s; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yylpp = yylpe = yylpsns + p; yylplim = yylpsns + s; #endif yylexp = yylexemes + p; } *yylexp = (YYINT) YYLEX; *yylvp++ = yylval; yylve++; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) *yylpp++ = yylloc; yylpe++; #endif yychar = *yylexp++; break; } /* normal operation, no conflict encountered */ #endif /* YYBTYACC */ yychar = YYLEX; #if YYBTYACC } while (0); #endif /* YYBTYACC */ if (yychar < 0) yychar = YYEOF; #if YYDEBUG if (yydebug) { if ((yys = yyname[YYTRANSLATE(yychar)]) == NULL) yys = yyname[YYUNDFTOKEN]; fprintf(stderr, "%s[%d]: state %d, reading token %d (%s)\n", YYDEBUGSTR, yydepth, YYFINAL, yychar, yys); } #endif } if (yychar == YYEOF) goto yyaccept; goto yyloop; } if (((yyn = yygindex[yym]) != 0) && (yyn += yystate) >= 0 && yyn <= YYTABLESIZE && yycheck[yyn] == (YYINT) yystate) yystate = yytable[yyn]; else yystate = yydgoto[yym]; #if YYDEBUG if (yydebug) { fprintf(stderr, "%s[%d]: after reduction, ", YYDEBUGSTR, yydepth); #ifdef YYSTYPE_TOSTRING #if YYBTYACC if (!yytrial) #endif /* YYBTYACC */ fprintf(stderr, "result is <%s>, ", YYSTYPE_TOSTRING(yystos[yystate], yyval)); #endif fprintf(stderr, "shifting from state %d to state %d\n", *yystack.s_mark, yystate); } #endif if (yystack.s_mark >= yystack.s_last && yygrowstack(&yystack) == YYENOMEM) goto yyoverflow; *++yystack.s_mark = (YYINT) yystate; *++yystack.l_mark = yyval; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) *++yystack.p_mark = yyloc; #endif goto yyloop; #if YYBTYACC /* Reduction declares that this path is valid. Set yypath and do a full parse */ yyvalid: if (yypath) YYABORT; while (yyps->save) { YYParseState *save = yyps->save; yyps->save = save->save; save->save = yypath; yypath = save; } #if YYDEBUG if (yydebug) fprintf(stderr, "%s[%d]: state %d, CONFLICT trial successful, backtracking to state %d, %d tokens\n", YYDEBUGSTR, yydepth, yystate, yypath->state, (int)(yylvp - yylvals - yypath->lexeme)); #endif if (yyerrctx) { yyFreeState(yyerrctx); yyerrctx = NULL; } yylvp = yylvals + yypath->lexeme; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yylpp = yylpsns + yypath->lexeme; #endif yylexp = yylexemes + yypath->lexeme; yychar = YYEMPTY; yystack.s_mark = yystack.s_base + (yypath->yystack.s_mark - yypath->yystack.s_base); memcpy (yystack.s_base, yypath->yystack.s_base, (size_t) (yystack.s_mark - yystack.s_base + 1) * sizeof(YYINT)); yystack.l_mark = yystack.l_base + (yypath->yystack.l_mark - yypath->yystack.l_base); memcpy (yystack.l_base, yypath->yystack.l_base, (size_t) (yystack.l_mark - yystack.l_base + 1) * sizeof(YYSTYPE)); #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) yystack.p_mark = yystack.p_base + (yypath->yystack.p_mark - yypath->yystack.p_base); memcpy (yystack.p_base, yypath->yystack.p_base, (size_t) (yystack.p_mark - yystack.p_base + 1) * sizeof(YYLTYPE)); #endif yystate = yypath->state; goto yyloop; #endif /* YYBTYACC */ yyoverflow: YYERROR_CALL("yacc stack overflow"); #if YYBTYACC goto yyabort_nomem; yyenomem: YYERROR_CALL("memory exhausted"); yyabort_nomem: #endif /* YYBTYACC */ yyresult = 2; goto yyreturn; yyabort: yyresult = 1; goto yyreturn; yyaccept: #if YYBTYACC if (yyps->save) goto yyvalid; #endif /* YYBTYACC */ yyresult = 0; yyreturn: #if defined(YYDESTRUCT_CALL) if (yychar != YYEOF && yychar != YYEMPTY) #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) YYDESTRUCT_CALL("cleanup: discarding token", yychar, &yylval, &yylloc); #else YYDESTRUCT_CALL("cleanup: discarding token", yychar, &yylval); #endif /* defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) */ { YYSTYPE *pv; #if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) YYLTYPE *pp; for (pv = yystack.l_base, pp = yystack.p_base; pv <= yystack.l_mark; ++pv, ++pp) YYDESTRUCT_CALL("cleanup: discarding state", yystos[*(yystack.s_base + (pv - yystack.l_base))], pv, pp); #else for (pv = yystack.l_base; pv <= yystack.l_mark; ++pv) YYDESTRUCT_CALL("cleanup: discarding state", yystos[*(yystack.s_base + (pv - yystack.l_base))], pv); #endif /* defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) */ } #endif /* defined(YYDESTRUCT_CALL) */ #if YYBTYACC if (yyerrctx) { yyFreeState(yyerrctx); yyerrctx = NULL; } while (yyps) { YYParseState *save = yyps; yyps = save->save; save->save = NULL; yyFreeState(save); } while (yypath) { YYParseState *save = yypath; yypath = save->save; save->save = NULL; yyFreeState(save); } #endif /* YYBTYACC */ yyfreestack(&yystack); return (yyresult); }