/* A Bison parser, made from mpparser.y by GNU Bison version 1.28 */ #define YYBISON 1 /* Identify Bison output. */ #define YYLSP_NEEDED #define NUMBER 257 #define END 258 #define VAR 259 #define FUNC 260 #define ID 261 #define UNARY_MINUS 262 #define YYDEBUG 1 #define YYSTYPE MPParserSymbol #define YYPARSE_PARAM formula_object #define YYLEX_PARAM formula_object #define YYERROR_VERBOSE 1 //#define YYPRINT(file, type, value) debug_print( formula_object, &yylloc, type, value ) #define yyerror(message) yyerr( message, &yylloc, formula_object ) #include "mpformula.h" #include "mpparsersymbol.h" #include "mpsymbols.h" #include #include void yyerr( const char *message, void *location_info_ptr, void *formula_ptr ); int yylex( YYSTYPE *symbol_value, void *location_info_ptr, void *formula_ptr ); #ifndef YYSTYPE #define YYSTYPE int #endif #ifndef YYLTYPE typedef struct yyltype { int timestamp; int first_line; int first_column; int last_line; int last_column; char *text; } yyltype; #define YYLTYPE yyltype #endif #include #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 52 #define YYFLAG -32768 #define YYNTBASE 21 #define YYTRANSLATE(x) ((unsigned)(x) <= 262 ? yytranslate[x] : 31) static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 9, 15, 16, 13, 11, 20, 12, 2, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 10, 19, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 17, 2, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 3, 4, 5, 6, 7, 8 }; #if YYDEBUG != 0 static const short yyprhs[] = { 0, 0, 3, 5, 7, 11, 15, 19, 23, 25, 29, 33, 35, 40, 42, 44, 46, 48, 53, 57, 61, 64, 67, 69, 73, 75, 79, 80, 82, 86, 88 }; static const short yyrhs[] = { 22, 4, 0, 24, 0, 23, 0, 24, 10, 24, 0, 23, 10, 24, 0, 24, 11, 25, 0, 24, 12, 25, 0, 25, 0, 25, 13, 26, 0, 25, 14, 26, 0, 26, 0, 26, 15, 30, 16, 0, 27, 0, 3, 0, 7, 0, 5, 0, 6, 15, 30, 16, 0, 17, 28, 18, 0, 15, 22, 16, 0, 12, 27, 0, 27, 9, 0, 29, 0, 28, 19, 29, 0, 24, 0, 29, 20, 22, 0, 0, 22, 0, 30, 20, 22, 0, 10, 0, 30, 20, 10, 0 }; #endif #if YYDEBUG != 0 static const short yyrline[] = { 0, 30, 37, 41, 52, 56, 66, 72, 77, 82, 88, 93, 102, 116, 121, 127, 133, 137, 143, 147, 150, 156, 167, 173, 191, 194, 204, 207, 210, 214, 217 }; #endif #if YYDEBUG != 0 || defined (YYERROR_VERBOSE) static const char * const yytname[] = { "$","error","$undefined.","NUMBER", "END","VAR","FUNC","ID","UNARY_MINUS","'\\''","':'","'+'","'-'","'*'","'/'", "'('","')'","'['","']'","';'","','","input","top_expr","colon_expr","expr","basic_expr", "indexed_expr","simple_expr","matrix","vector","arg_list", NULL }; #endif static const short yyr1[] = { 0, 21, 22, 22, 23, 23, 24, 24, 24, 25, 25, 25, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 28, 28, 29, 29, 30, 30, 30, 30, 30 }; static const short yyr2[] = { 0, 2, 1, 1, 3, 3, 3, 3, 1, 3, 3, 1, 4, 1, 1, 1, 1, 4, 3, 3, 2, 2, 1, 3, 1, 3, 0, 1, 3, 1, 3 }; static const short yydefact[] = { 0, 14, 16, 0, 15, 0, 0, 0, 0, 3, 2, 8, 11, 13, 26, 20, 0, 24, 0, 22, 1, 0, 0, 0, 0, 0, 0, 26, 21, 29, 27, 0, 19, 18, 0, 0, 5, 4, 6, 7, 9, 10, 0, 17, 0, 23, 25, 12, 30, 28, 0, 0, 0 }; static const short yydefgoto[] = { 50, 30, 9, 10, 11, 12, 13, 18, 19, 31 }; static const short yypact[] = { 31, -32768,-32768, -2,-32768, 31, 31, 31, 22, 32, -8, -3, 16, 38, 2, 38, 35, 12, 21, 34,-32768, 31, 31, 31, 31, 31, 31, 2,-32768,-32768,-32768, 13,-32768,-32768, 31, 31, 12, 12, -3, -3, 16, 16, 25,-32768, 15, 34,-32768,-32768,-32768,-32768, 55, 56,-32768 }; static const short yypgoto[] = {-32768, 0,-32768, -6, 26, 27, 52,-32768, 24, 33 }; #define YYLAST 60 static const short yytable[] = { 8, 17, 22, 23, 24, 1, 16, 2, 3, 4, 25, 26, 29, 14, 5, 36, 37, 6, 1, 7, 2, 3, 4, 23, 24, 48, 20, 5, 17, 43, 6, 27, 7, 44, 1, 46, 2, 3, 4, 33, 34, 47, 21, 5, 49, 44, 6, 28, 7, 38, 39, 32, 40, 41, 35, 51, 52, 15, 45, 0, 42 }; static const short yycheck[] = { 0, 7, 10, 11, 12, 3, 6, 5, 6, 7, 13, 14, 10, 15, 12, 21, 22, 15, 3, 17, 5, 6, 7, 11, 12, 10, 4, 12, 34, 16, 15, 15, 17, 20, 3, 35, 5, 6, 7, 18, 19, 16, 10, 12, 44, 20, 15, 9, 17, 23, 24, 16, 25, 26, 20, 0, 0, 5, 34, -1, 27 }; #define YYPURE 1 /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ /* This file comes from bison-1.28. */ /* Skeleton output parser for bison, Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ /* As a special exception, when this file is copied by Bison into a Bison output file, you may use that output file without restriction. This special exception was added by the Free Software Foundation in version 1.24 of Bison. */ /* This is the parser code that is written into each bison parser when the %semantic_parser declaration is not specified in the grammar. It was written by Richard Stallman by simplifying the hairy parser used when %semantic_parser is specified. */ #ifndef YYSTACK_USE_ALLOCA #ifdef alloca #define YYSTACK_USE_ALLOCA #else /* alloca not defined */ #ifdef __GNUC__ #define YYSTACK_USE_ALLOCA #define alloca __builtin_alloca #else /* not GNU C. */ #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386)) #define YYSTACK_USE_ALLOCA #include #else /* not sparc */ /* We think this test detects Watcom and Microsoft C. */ /* This used to test MSDOS, but that is a bad idea since that symbol is in the user namespace. */ #if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__) #if 0 /* No need for malloc.h, which pollutes the namespace; instead, just don't use alloca. */ #include #endif #else /* not MSDOS, or __TURBOC__ */ #if defined(_AIX) /* I don't know what this was needed for, but it pollutes the namespace. So I turned it off. rms, 2 May 1997. */ /* #include */ #pragma alloca #define YYSTACK_USE_ALLOCA #else /* not MSDOS, or __TURBOC__, or _AIX */ #if 0 #ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up, and on HPUX 10. Eventually we can turn this on. */ #define YYSTACK_USE_ALLOCA #define alloca __builtin_alloca #endif /* __hpux */ #endif #endif /* not _AIX */ #endif /* not MSDOS, or __TURBOC__ */ #endif /* not sparc */ #endif /* not GNU C */ #endif /* alloca not defined */ #endif /* YYSTACK_USE_ALLOCA not defined */ #ifdef YYSTACK_USE_ALLOCA #define YYSTACK_ALLOC alloca #else #define YYSTACK_ALLOC malloc #endif /* Note: there must be only one dollar sign in this file. It is replaced by the list of actions, each action as one case of the switch. */ #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT goto yyacceptlab #define YYABORT goto yyabortlab #define YYERROR goto yyerrlab1 /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(token, value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { yychar = (token), yylval = (value); \ yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { yyerror ("syntax error: cannot back up"); YYERROR; } \ while (0) #define YYTERROR 1 #define YYERRCODE 256 #ifndef YYPURE #define YYLEX yylex() #endif #ifdef YYPURE #ifdef YYLSP_NEEDED #ifdef YYLEX_PARAM #define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM) #else #define YYLEX yylex(&yylval, &yylloc) #endif #else /* not YYLSP_NEEDED */ #ifdef YYLEX_PARAM #define YYLEX yylex(&yylval, YYLEX_PARAM) #else #define YYLEX yylex(&yylval) #endif #endif /* not YYLSP_NEEDED */ #endif /* If nonreentrant, generate the variables here */ #ifndef YYPURE int yychar; /* the lookahead symbol */ YYSTYPE yylval; /* the semantic value of the */ /* lookahead symbol */ #ifdef YYLSP_NEEDED YYLTYPE yylloc; /* location data for the lookahead */ /* symbol */ #endif int yynerrs; /* number of parse errors so far */ #endif /* not YYPURE */ #if YYDEBUG != 0 int yydebug; /* nonzero means print parse trace */ /* Since this is uninitialized, it does not stop multiple parsers from coexisting. */ #endif /* YYINITDEPTH indicates the initial size of the parser's stacks */ #ifndef YYINITDEPTH #define YYINITDEPTH 200 #endif /* YYMAXDEPTH is the maximum size the stacks can grow to (effective only if the built-in stack extension method is used). */ #if YYMAXDEPTH == 0 #undef YYMAXDEPTH #endif #ifndef YYMAXDEPTH #define YYMAXDEPTH 10000 #endif /* Define __yy_memcpy. Note that the size argument should be passed with type unsigned int, because that is what the non-GCC definitions require. With GCC, __builtin_memcpy takes an arg of type size_t, but it can handle unsigned int. */ #if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ #define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT) #else /* not GNU C or C++ */ #ifndef __cplusplus /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_memcpy (to, from, count) char *to; char *from; unsigned int count; { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #else /* __cplusplus */ /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_memcpy (char *to, char *from, unsigned int count) { register char *t = to; register char *f = from; register int i = count; while (i-- > 0) *t++ = *f++; } #endif #endif /* The user can define YYPARSE_PARAM as the name of an argument to be passed into yyparse. The argument should have type void *. It should actually point to an object. Grammar actions can access the variable by casting it to the proper pointer type. */ #ifdef YYPARSE_PARAM #ifdef __cplusplus #define YYPARSE_PARAM_ARG void *YYPARSE_PARAM #define YYPARSE_PARAM_DECL #else /* not __cplusplus */ #define YYPARSE_PARAM_ARG YYPARSE_PARAM #define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; #endif /* not __cplusplus */ #else /* not YYPARSE_PARAM */ #define YYPARSE_PARAM_ARG #define YYPARSE_PARAM_DECL #endif /* not YYPARSE_PARAM */ /* Prevent warning if -Wstrict-prototypes. */ #ifdef __GNUC__ #ifdef YYPARSE_PARAM int yyparse (void *); #else int yyparse (void); #endif #endif int yyparse(YYPARSE_PARAM_ARG) YYPARSE_PARAM_DECL { register int yystate; register int yyn; register short *yyssp; register YYSTYPE *yyvsp; int yyerrstatus; /* number of tokens to shift before error messages enabled */ int yychar1 = 0; /* lookahead token as an internal (translated) token number */ short yyssa[YYINITDEPTH]; /* the state stack */ YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ short *yyss = yyssa; /* refer to the stacks thru separate pointers */ YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ #ifdef YYLSP_NEEDED YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ YYLTYPE *yyls = yylsa; YYLTYPE *yylsp; #define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) #else #define YYPOPSTACK (yyvsp--, yyssp--) #endif int yystacksize = YYINITDEPTH; int yyfree_stacks = 0; #ifdef YYPURE int yychar; YYSTYPE yylval; int yynerrs; #ifdef YYLSP_NEEDED YYLTYPE yylloc; #endif #endif YYSTYPE yyval; /* the variable used to return */ /* semantic values from the action */ /* routines */ int yylen; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Starting parse\n"); #endif yystate = 0; yyerrstatus = 0; yynerrs = 0; yychar = YYEMPTY; /* Cause a token to be read. */ /* Initialize stack pointers. Waste one element of value and location stack so that they stay on the same level as the state stack. The wasted elements are never initialized. */ yyssp = yyss - 1; yyvsp = yyvs; #ifdef YYLSP_NEEDED yylsp = yyls; #endif /* Push a new state, which is found in yystate . */ /* In all cases, when you get here, the value and location stacks have just been pushed. so pushing a state here evens the stacks. */ yynewstate: *++yyssp = yystate; if (yyssp >= yyss + yystacksize - 1) { /* Give user a chance to reallocate the stack */ /* Use copies of these so that the &'s don't force the real ones into memory. */ YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; #ifdef YYLSP_NEEDED YYLTYPE *yyls1 = yyls; #endif /* Get the current used size of the three stacks, in elements. */ int size = yyssp - yyss + 1; #ifdef yyoverflow /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. */ #ifdef YYLSP_NEEDED /* This used to be a conditional around just the two extra args, but that might be undefined if yyoverflow is a macro. */ yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), &yyls1, size * sizeof (*yylsp), &yystacksize); #else yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), &yystacksize); #endif yyss = yyss1; yyvs = yyvs1; #ifdef YYLSP_NEEDED yyls = yyls1; #endif #else /* no yyoverflow */ /* Extend the stack our own way. */ if (yystacksize >= YYMAXDEPTH) { yyerror("parser stack overflow"); if (yyfree_stacks) { free (yyss); free (yyvs); #ifdef YYLSP_NEEDED free (yyls); #endif } return 2; } yystacksize *= 2; if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; #ifndef YYSTACK_USE_ALLOCA yyfree_stacks = 1; #endif yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp)); __yy_memcpy ((char *)yyss, (char *)yyss1, size * (unsigned int) sizeof (*yyssp)); yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp)); __yy_memcpy ((char *)yyvs, (char *)yyvs1, size * (unsigned int) sizeof (*yyvsp)); #ifdef YYLSP_NEEDED yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp)); __yy_memcpy ((char *)yyls, (char *)yyls1, size * (unsigned int) sizeof (*yylsp)); #endif #endif /* no yyoverflow */ yyssp = yyss + size - 1; yyvsp = yyvs + size - 1; #ifdef YYLSP_NEEDED yylsp = yyls + size - 1; #endif #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Stack size increased to %d\n", yystacksize); #endif if (yyssp >= yyss + yystacksize - 1) YYABORT; } #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Entering state %d\n", yystate); #endif goto yybackup; yybackup: /* Do appropriate processing given the current state. */ /* Read a lookahead token if we need one and don't already have one. */ /* yyresume: */ /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; if (yyn == YYFLAG) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ /* yychar is either YYEMPTY or YYEOF or a valid token in external form. */ if (yychar == YYEMPTY) { #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Reading a token: "); #endif yychar = YYLEX; } /* Convert token to internal form (in yychar1) for indexing tables with */ if (yychar <= 0) /* This means end of input. */ { yychar1 = 0; yychar = YYEOF; /* Don't call YYLEX any more */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Now at end of input.\n"); #endif } else { yychar1 = YYTRANSLATE(yychar); #if YYDEBUG != 0 if (yydebug) { fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); /* Give the individual parser a way to print the precise meaning of a token, for further debugging info. */ #ifdef YYPRINT YYPRINT (stderr, yychar, yylval); #endif fprintf (stderr, ")\n"); } #endif } yyn += yychar1; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; yyn = yytable[yyn]; /* yyn is what to do for this token type in this state. Negative => reduce, -yyn is rule number. Positive => shift, yyn is new state. New state is final state => don't bother to shift, just return success. 0, or most negative number => error. */ if (yyn < 0) { if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); #endif /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif /* count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus) yyerrstatus--; yystate = yyn; goto yynewstate; /* Do the default action for the current state. */ yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; /* Do a reduction. yyn is the number of a rule to reduce with. */ yyreduce: yylen = yyr2[yyn]; if (yylen > 0) yyval = yyvsp[1-yylen]; /* implement default value of the action */ #if YYDEBUG != 0 if (yydebug) { int i; fprintf (stderr, "Reducing via rule %d (line %d), ", yyn, yyrline[yyn]); /* Print the symbols being reduced, and their result. */ for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) fprintf (stderr, "%s ", yytname[yyrhs[i]]); fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); } #endif switch (yyn) { case 1: { ((MPFormula *)formula_object)->m_root_sym = yyvsp[-1].takeSym(); YYACCEPT ; break;} case 2: { yyval = yyvsp[0]; ; break;} case 3: { yyval = new MPSymColonExpr( yyvsp[0].takeSymList(), yylsp[0].first_column, yylsp[0].last_column, "colon expression" ); ; break;} case 4: { yyval = new MPSymbolList( yyvsp[-2].takeSym(), yyvsp[0].takeSym() ); ; break;} case 5: { /* only three-element colon expressions are allowed. If it is more than three elements an error will be raised during syntax checking */ yyvsp[-2].symList()->add( yyvsp[0].takeSym() ); yyval = yyvsp[-2]; ; break;} case 6: { yyval = new MPSymFunction2( MPSymFunction2::ADD, new MPSymbolList( yyvsp[-2].takeSym(), yyvsp[0].takeSym() ), yylsp[-1].first_column, yylsp[-1].last_column, "operator +" ); ; break;} case 7: { yyval = new MPSymFunction2( MPSymFunction2::SUB, new MPSymbolList( yyvsp[-2].takeSym(), yyvsp[0].takeSym() ), yylsp[-1].first_column, yylsp[-1].last_column, "operator -" ); ; break;} case 8: { yyval = yyvsp[0]; ; break;} case 9: { yyval = new MPSymFunction2( MPSymFunction2::MUL, new MPSymbolList( yyvsp[-2].takeSym(), yyvsp[0].takeSym() ), yylsp[-1].first_column, yylsp[-1].last_column, "operator *" ); ; break;} case 10: { yyval = new MPSymFunction2( MPSymFunction2::DIV, new MPSymbolList( yyvsp[-2].takeSym(), yyvsp[0].takeSym() ), yylsp[-1].first_column, yylsp[-1].last_column, "operator /" ); ; break;} case 11: { yyval = yyvsp[0]; ; break;} case 12: { // Matrix indices for example sheet(2:4,5:7) - highest priority if ( yyvsp[-1].symList()->count() == 1 ) { // single index for vectors yyval = new MPSymVectorIndexer( yyvsp[-3].takeSym(), yyvsp[-1].takeSymList(), yylsp[-2].first_column, yylsp[0].last_column, "index operator()" ); } else { // double index for matrices yyval = new MPSymMatrixIndexer( yyvsp[-3].takeSym(), yyvsp[-1].takeSymList(), yylsp[-2].first_column, yylsp[0].last_column, "index operator()" ); } ; break;} case 13: { yyval = yyvsp[0]; ; break;} case 14: { /* Floating-point number */ yyval = new MPSymValue( yyvsp[0].token().toDouble(), yylsp[0].first_column, yylsp[0].last_column, yyvsp[0].token().latin1() ); ; break;} case 15: { /* Identifier which is neither a variable nor function */ ((MPFormula *)formula_object)->m_error->setUndefinedSymbol( yyvsp[0].token().latin1(), yylsp[0].first_column, yylsp[0].last_column ); YYABORT ; break;} case 16: { /* Variable, must be used without parenthesis and arguments ( see below ) */ yyval = yyvsp[0]; ; break;} case 17: { /* Function - it must be called as function() or function(args) */ // TODO: symbol ':' isn't allowed in functions - you should check it yyvsp[-3].sym()->setArgs( yyvsp[-1].takeSymList() ); yyval = yyvsp[-3]; ; break;} case 18: { /* Matrix definition [2, 3; 4, 5] */ yyval = new MPSymMatrix( yyvsp[-1].takeSymList(), yylsp[-2].first_column, yylsp[0].last_column, "matrix" ) ; break;} case 19: { yyval = yyvsp[-1]; ; break;} case 20: { /* Unary minus has lower priority than transposition */ yyval = new MPSymFunction1( MPSymFunction1::NEG, new MPSymbolList( yyvsp[0].takeSym() ), yylsp[-1].first_column, yylsp[-1].last_column, "operator unary-" ); ; break;} case 21: { /* Transposition */ yyval = new MPSymTranspose( new MPSymbolList( yyvsp[-1].takeSym() ), yylsp[0].first_column, yylsp[0].last_column, "operator ' ( transpose )" ); ; break;} case 22: { MPSymbol *vector = new MPSymVector( yyvsp[0].takeSymList(), yylsp[0].first_column, yylsp[0].last_column, "row" ); yyval = new MPSymbolList( vector ); ; break;} case 23: { MPSymbol *vector = new MPSymVector( yyvsp[0].takeSymList(), yylsp[0].first_column, yylsp[0].last_column, "row" ); yyvsp[-2].symList()->add( vector ); yyval = yyvsp[-2]; ; break;} case 24: { yyval = new MPSymbolList( yyvsp[0].takeSym() ); ; break;} case 25: { yyvsp[-2].symList()->add( yyvsp[0].takeSym() ); yyval = yyvsp[-2]; ; break;} case 26: { yyval = new MPSymbolList(); ; break;} case 27: { yyval = new MPSymbolList( yyvsp[0].takeSym() ); ; break;} case 28: { yyvsp[-2].symList()->add( yyvsp[0].takeSym() ); yyval = yyvsp[-2]; ; break;} case 29: { yyval = new MPSymbolList( new MPSymColon( yylsp[0].first_column, yylsp[0].last_column, ":" ) ); ; break;} case 30: { /* 2 x @3.last_column */ yyvsp[-2].symList()->add( new MPSymColon( yylsp[0].last_column, yylsp[0].last_column, ":" ) ); yyval = yyvsp[-2]; ; break;} } /* the action file gets copied in in place of this dollarsign */ yyvsp -= yylen; yyssp -= yylen; #ifdef YYLSP_NEEDED yylsp -= yylen; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif *++yyvsp = yyval; #ifdef YYLSP_NEEDED yylsp++; if (yylen == 0) { yylsp->first_line = yylloc.first_line; yylsp->first_column = yylloc.first_column; yylsp->last_line = (yylsp-1)->last_line; yylsp->last_column = (yylsp-1)->last_column; yylsp->text = 0; } else { yylsp->last_line = (yylsp+yylen-1)->last_line; yylsp->last_column = (yylsp+yylen-1)->last_column; } #endif /* Now "shift" the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule number reduced by. */ yyn = yyr1[yyn]; yystate = yypgoto[yyn - YYNTBASE] + *yyssp; if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; yyerrlab: /* here on detecting error */ if (! yyerrstatus) /* If not already recovering from an error, report this error. */ { ++yynerrs; #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; if (yyn > YYFLAG && yyn < YYLAST) { int size = 0; char *msg; int x, count; count = 0; /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ for (x = (yyn < 0 ? -yyn : 0); x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) size += strlen(yytname[x]) + 15, count++; msg = (char *) malloc(size + 15); if (msg != 0) { strcpy(msg, "parse error"); if (count < 5) { count = 0; for (x = (yyn < 0 ? -yyn : 0); x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) { strcat(msg, count == 0 ? ", expecting `" : " or `"); strcat(msg, yytname[x]); strcat(msg, "'"); count++; } } yyerror(msg); free(msg); } else yyerror ("parse error; also virtual memory exceeded"); } else #endif /* YYERROR_VERBOSE */ yyerror("parse error"); } goto yyerrlab1; yyerrlab1: /* here on error raised explicitly by an action */ if (yyerrstatus == 3) { /* if just tried and failed to reuse lookahead token after an error, discard it. */ /* return failure if at end of input */ if (yychar == YYEOF) YYABORT; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); #endif yychar = YYEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ yyerrstatus = 3; /* Each real token shifted decrements this */ goto yyerrhandle; yyerrdefault: /* current state does not do anything special for the error token. */ #if 0 /* This is wrong; only states that explicitly want error tokens should shift them. */ yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ if (yyn) goto yydefault; #endif yyerrpop: /* pop the current state because it cannot handle the error token */ if (yyssp == yyss) YYABORT; yyvsp--; yystate = *--yyssp; #ifdef YYLSP_NEEDED yylsp--; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "Error: state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif yyerrhandle: yyn = yypact[yystate]; if (yyn == YYFLAG) goto yyerrdefault; yyn += YYTERROR; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) goto yyerrdefault; yyn = yytable[yyn]; if (yyn < 0) { if (yyn == YYFLAG) goto yyerrpop; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting error token, "); #endif *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif yystate = yyn; goto yynewstate; yyacceptlab: /* YYACCEPT comes here. */ if (yyfree_stacks) { free (yyss); free (yyvs); #ifdef YYLSP_NEEDED free (yyls); #endif } return 0; yyabortlab: /* YYABORT comes here. */ if (yyfree_stacks) { free (yyss); free (yyvs); #ifdef YYLSP_NEEDED free (yyls); #endif } return 1; }