Logo Search packages:      
Sourcecode: abakus version File versions  Download package

parser_yacc.cpp

/* A Bison parser, made by GNU Bison 1.875d.  */

/* Skeleton parser for Yacc-like parsing with Bison,
   Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004 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.  */

/* Written by Richard Stallman by simplifying the original so called
   ``semantic'' parser.  */

/* All symbols defined below should begin with yy or YY, to avoid
   infringing on user name space.  This should be done even for local
   variables, as they might otherwise be expanded by user macros.
   There are some unavoidable exceptions within include files to
   define necessary library symbols; they are noted "INFRINGES ON
   USER NAME SPACE" below.  */

/* Identify Bison output.  */
#define YYBISON 1

/* Skeleton name.  */
#define YYSKELETON_NAME "yacc.c"

/* Pure parsers.  */
#define YYPURE 0

/* Using locations.  */
#define YYLSP_NEEDED 0



/* Tokens.  */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
   /* Put the tokens into the symbol table, so that GDB and other debuggers
      know about them.  */
   enum yytokentype {
     NUM = 258,
     FN = 259,
     ID = 260,
     POWER = 261,
     SET = 262,
     REMOVE = 263,
     DERIV = 264
   };
#endif
#define NUM 258
#define FN 259
#define ID 260
#define POWER 261
#define SET 262
#define REMOVE 263
#define DERIV 264




/* Copy the first part of user declarations.  */
#line 19 "src/parser.yy"


/* Add necessary includes here. */
#include <kdebug.h>
#include <klocale.h>

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

#include "result.h"
#include "node.h"
#include "function.h"
#include "valuemanager.h"

extern char *yytext;

extern int gCheckIdents;

int yylex(void);
int yyerror(const char *);



/* Enabling traces.  */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif

/* Enabling verbose error messages.  */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif

#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED)
#line 44 "src/parser.yy"
typedef union YYSTYPE {
    Node *node;
    NumericValue *value;
    UnaryFunction *fn;
    Identifier *ident;
} YYSTYPE;
/* Line 191 of yacc.c.  */
#line 126 "src/parser_yacc.cpp"
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
# define YYSTYPE_IS_DECLARED 1
# define YYSTYPE_IS_TRIVIAL 1
#endif



/* Copy the second part of user declarations.  */


/* Line 214 of yacc.c.  */
#line 138 "src/parser_yacc.cpp"

#if ! defined (yyoverflow) || YYERROR_VERBOSE

# ifndef YYFREE
#  define YYFREE free
# endif
# ifndef YYMALLOC
#  define YYMALLOC malloc
# endif

/* The parser invokes alloca or malloc; define the necessary symbols.  */

# ifdef YYSTACK_USE_ALLOCA
#  if YYSTACK_USE_ALLOCA
#   define YYSTACK_ALLOC alloca
#  endif
# else
#  if defined (alloca) || defined (_ALLOCA_H)
#   define YYSTACK_ALLOC alloca
#  else
#   ifdef __GNUC__
#    define YYSTACK_ALLOC __builtin_alloca
#   endif
#  endif
# endif

# ifdef YYSTACK_ALLOC
   /* Pacify GCC's `empty if-body' warning. */
#  define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
# else
#  if defined (__STDC__) || defined (__cplusplus)
#   include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
#   define YYSIZE_T size_t
#  endif
#  define YYSTACK_ALLOC YYMALLOC
#  define YYSTACK_FREE YYFREE
# endif
#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */


#if (! defined (yyoverflow) \
     && (! defined (__cplusplus) \
       || (defined (YYSTYPE_IS_TRIVIAL) && YYSTYPE_IS_TRIVIAL)))

/* A type that is properly aligned for any stack member.  */
union yyalloc
{
  short int yyss;
  YYSTYPE yyvs;
  };

/* The size of the maximum gap between one aligned stack and the next.  */
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)

/* The size of an array large to enough to hold all stacks, each with
   N elements.  */
# define YYSTACK_BYTES(N) \
     ((N) * (sizeof (short int) + sizeof (YYSTYPE))               \
      + YYSTACK_GAP_MAXIMUM)

/* Copy COUNT objects from FROM to TO.  The source and destination do
   not overlap.  */
# ifndef YYCOPY
#  if defined (__GNUC__) && 1 < __GNUC__
#   define YYCOPY(To, From, Count) \
      __builtin_memcpy (To, From, (Count) * sizeof (*(From)))
#  else
#   define YYCOPY(To, From, Count)        \
      do                            \
      {                             \
        register YYSIZE_T yyi;            \
        for (yyi = 0; yyi < (Count); yyi++)     \
          (To)[yyi] = (From)[yyi];        \
      }                             \
      while (0)
#  endif
# endif

/* Relocate STACK from its old location to the new one.  The
   local variables YYSIZE and YYSTACKSIZE give the old and new number of
   elements in the stack, and YYPTR gives the new location of the
   stack.  Advance YYPTR to a properly aligned location for the next
   stack.  */
# define YYSTACK_RELOCATE(Stack)                            \
    do                                                      \
      {                                                     \
      YYSIZE_T yynewbytes;                                  \
      YYCOPY (&yyptr->Stack, Stack, yysize);                      \
      Stack = &yyptr->Stack;                                \
      yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
      yyptr += yynewbytes / sizeof (*yyptr);                      \
      }                                                     \
    while (0)

#endif

#if defined (__STDC__) || defined (__cplusplus)
   typedef signed char yysigned_char;
#else
   typedef short int yysigned_char;
#endif

/* YYFINAL -- State number of the termination state. */
#define YYFINAL  3
/* YYLAST -- Last index in YYTABLE.  */
#define YYLAST   129

/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS  18
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS  16
/* YYNRULES -- Number of rules. */
#define YYNRULES  49
/* YYNRULES -- Number of states. */
#define YYNSTATES  92

/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX.  */
#define YYUNDEFTOK  2
#define YYMAXUTOK   264

#define YYTRANSLATE(YYX)                                    \
  ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)

/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX.  */
static const unsigned 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,     2,
      11,    12,    15,    13,    17,    14,     2,    16,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,    10,     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,     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,     2,     3,     4,
       5,     6,     7,     8,     9
};

#if YYDEBUG
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
   YYRHS.  */
static const unsigned char yyprhs[] =
{
       0,     0,     3,     4,     7,     9,    12,    15,    16,    22,
      25,    28,    33,    38,    43,    48,    54,    57,    62,    66,
      69,    72,    75,    78,    81,    83,    87,    91,    93,    97,
     101,   103,   107,   109,   112,   115,   119,   124,   126,   128,
     130,   131,   132,   141,   144,   148,   153,   156,   158,   160
};

/* YYRHS -- A `-1'-separated list of the rules' RHS. */
static const yysigned_char yyrhs[] =
{
      19,     0,    -1,    -1,    20,    21,    -1,    25,    -1,     1,
      10,    -1,    33,    10,    -1,    -1,    11,    23,    32,    12,
      10,    -1,     7,     9,    -1,     9,    10,    -1,     7,    33,
      22,    25,    -1,     7,    32,    22,    25,    -1,     8,    33,
      11,    12,    -1,     8,    32,    11,    12,    -1,     8,    32,
      11,    32,    12,    -1,     8,    32,    -1,     7,    32,    10,
      25,    -1,    32,    10,    25,    -1,    29,    10,    -1,    32,
      11,    -1,    32,    32,    -1,    32,    29,    -1,    29,    29,
      -1,     1,    -1,    25,    13,    26,    -1,    25,    14,    26,
      -1,    26,    -1,    26,    15,    27,    -1,    26,    16,    27,
      -1,    27,    -1,    24,     6,    27,    -1,    24,    -1,    13,
      28,    -1,    14,    28,    -1,    11,    25,    12,    -1,    14,
      11,    25,    12,    -1,    28,    -1,    29,    -1,     3,    -1,
      -1,    -1,     9,    30,    11,    25,    17,    31,    25,    12,
      -1,    33,    24,    -1,    29,    33,    24,    -1,    29,    11,
      25,    12,    -1,    29,    32,    -1,    32,    -1,     5,    -1,
       4,    -1
};

/* YYRLINE[YYN] -- source line where rule number YYN was defined.  */
static const unsigned short int yyrline[] =
{
       0,    86,    86,    86,    91,    94,   101,   110,   110,   117,
     124,   131,   164,   180,   188,   195,   201,   223,   242,   260,
     266,   272,   277,   282,   287,   296,   297,   298,   300,   301,
     302,   304,   305,   307,   308,   309,   310,   312,   314,   316,
     322,   322,   322,   326,   332,   337,   341,   350,   359,   363
};
#endif

#if YYDEBUG || YYERROR_VERBOSE
/* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
   First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
  "$end", "error", "$undefined", "NUM", "FN", "ID", "\"**\"", "\"set\"",
  "\"remove\"", "\"deriv\"", "'='", "'('", "')'", "'+'", "'-'", "'*'",
  "'/'", "','", "$accept", "FINAL", "@1", "S", "ASSIGN", "@2", "TERM",
  "EXP", "FACTOR", "EXPONENT", "VALUE", "NUMBER", "@3", "@4", "IDENT",
  "FUNC", 0
};
#endif

# ifdef YYPRINT
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
   token YYLEX-NUM.  */
static const unsigned short int yytoknum[] =
{
       0,   256,   257,   258,   259,   260,   261,   262,   263,   264,
      61,    40,    41,    43,    45,    42,    47,    44
};
# endif

/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives.  */
static const unsigned char yyr1[] =
{
       0,    18,    20,    19,    21,    21,    21,    23,    22,    21,
      21,    21,    21,    21,    21,    21,    21,    21,    21,    21,
      24,    24,    24,    24,    21,    25,    25,    25,    26,    26,
      26,    27,    27,    24,    24,    24,    24,    24,    28,    29,
      30,    31,    24,    24,    24,    24,    24,    28,    32,    33
};

/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN.  */
static const unsigned char yyr2[] =
{
       0,     2,     0,     2,     1,     2,     2,     0,     5,     2,
       2,     4,     4,     4,     4,     5,     2,     4,     3,     2,
       2,     2,     2,     2,     1,     3,     3,     1,     3,     3,
       1,     3,     1,     2,     2,     3,     4,     1,     1,     1,
       0,     0,     8,     2,     3,     4,     2,     1,     1,     1
};

/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
   STATE-NUM when YYTABLE doesn't specify something else to do.  Zero
   means the default is an error.  */
static const unsigned char yydefact[] =
{
       2,     0,     0,     1,    24,    39,    49,    48,     0,     0,
      40,     0,     0,     0,     3,    32,     4,    27,    30,    37,
      38,    47,     0,     5,     9,     0,     0,    16,     0,    10,
       0,    40,     0,    38,    47,     0,    33,    38,    47,     0,
      34,     0,     0,     0,     0,     0,    19,     0,    23,    46,
       0,     0,    20,    22,    21,     6,    43,     0,     7,     0,
       0,     0,     0,     0,    35,     0,    31,    25,    26,    28,
      29,     0,    44,    18,    17,     0,    12,    11,    14,     0,
      13,     0,    36,    45,     0,    15,    41,     0,     0,     8,
       0,    42
};

/* YYDEFGOTO[NTERM-NUM]. */
static const yysigned_char yydefgoto[] =
{
      -1,     1,     2,    14,    59,    75,    15,    16,    17,    18,
      19,    33,    30,    88,    34,    35
};

/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
   STATE-NUM.  */
#define YYPACT_NINF -12
static const yysigned_char yypact[] =
{
     -12,    10,    54,   -12,     5,   -12,   -12,   -12,    22,    78,
      32,    87,    34,    70,   -12,    41,    56,   106,   -12,   -12,
      40,    61,    75,   -12,   -12,    83,    45,    76,    88,   -12,
      96,   -12,    -8,    13,    92,    87,   -12,   -12,   -12,    87,
     -12,    87,    87,    87,    87,    87,   -12,    87,   -12,   -12,
      87,    87,   -12,   -12,   -12,   -12,   -12,    87,   -12,    87,
      87,    -3,    64,    87,   -12,    99,   -12,   106,   106,   -12,
     -12,   102,   -12,    56,    56,    97,    56,    56,   -12,   108,
     -12,    91,   -12,   -12,   115,   -12,   -12,   118,    87,   -12,
     105,   -12
};

/* YYPGOTO[NTERM-NUM].  */
static const yysigned_char yypgoto[] =
{
     -12,   -12,   -12,   -12,   103,   -12,     3,   -11,    81,    65,
     113,     1,   -12,   -12,    -1,    21
};

/* YYTABLE[YYPACT[STATE-NUM]].  What to do in state STATE-NUM.  If
   positive, shift that token.  If negative, reduce the rule which
   number is the opposite.  If zero, do what YYDEFACT says.
   If YYTABLE_NINF, syntax error.  */
#define YYTABLE_NINF -1
static const unsigned char yytable[] =
{
      32,    21,     7,    20,    64,    42,    43,    25,    27,    78,
       3,    38,    38,    37,    37,    23,     5,     6,     7,    49,
      54,    48,    53,    22,    47,    56,     6,     7,    65,    26,
      28,    24,    49,    54,    48,    53,    71,     5,    56,     7,
      73,    50,    29,     5,     6,     7,    74,    41,    76,    77,
      46,    47,    81,    72,    50,     4,    58,     5,     6,     7,
      79,     8,     9,    10,     5,    11,     7,    12,    13,    42,
      43,    51,    52,     5,    84,     7,    80,    90,     5,     6,
       7,    39,     6,     7,    31,    55,    11,    61,    12,    13,
       5,     6,     7,    57,    58,     5,    31,     7,    11,    62,
      12,    13,     7,    52,    42,    43,    66,    63,    86,    69,
      70,    82,    42,    43,    83,    42,    43,    91,    42,    43,
      85,    44,    45,    67,    68,    36,    40,    87,    89,    60
};

static const unsigned char yycheck[] =
{
      11,     2,     5,     2,    12,    13,    14,     8,     9,    12,
       0,    12,    13,    12,    13,    10,     3,     4,     5,    20,
      21,    20,    21,     2,    11,    22,     4,     5,    39,     8,
       9,     9,    33,    34,    33,    34,    47,     3,    35,     5,
      51,    20,    10,     3,     4,     5,    57,     6,    59,    60,
      10,    11,    63,    50,    33,     1,    11,     3,     4,     5,
      61,     7,     8,     9,     3,    11,     5,    13,    14,    13,
      14,    10,    11,     3,    75,     5,    12,    88,     3,     4,
       5,    11,     4,     5,     9,    10,    11,    11,    13,    14,
       3,     4,     5,    10,    11,     3,     9,     5,    11,    11,
      13,    14,     5,    11,    13,    14,    41,    11,    17,    44,
      45,    12,    13,    14,    12,    13,    14,    12,    13,    14,
      12,    15,    16,    42,    43,    12,    13,    12,    10,    26
};

/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
   symbol of state STATE-NUM.  */
static const unsigned char yystos[] =
{
       0,    19,    20,     0,     1,     3,     4,     5,     7,     8,
       9,    11,    13,    14,    21,    24,    25,    26,    27,    28,
      29,    32,    33,    10,     9,    32,    33,    32,    33,    10,
      30,     9,    25,    29,    32,    33,    28,    29,    32,    11,
      28,     6,    13,    14,    15,    16,    10,    11,    29,    32,
      33,    10,    11,    29,    32,    10,    24,    10,    11,    22,
      22,    11,    11,    11,    12,    25,    27,    26,    26,    27,
      27,    25,    24,    25,    25,    23,    25,    25,    12,    32,
      12,    25,    12,    12,    32,    12,    17,    12,    31,    10,
      25,    12
};

#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__)
# define YYSIZE_T __SIZE_TYPE__
#endif
#if ! defined (YYSIZE_T) && defined (size_t)
# define YYSIZE_T size_t
#endif
#if ! defined (YYSIZE_T)
# if defined (__STDC__) || defined (__cplusplus)
#  include <stddef.h> /* INFRINGES ON USER NAME SPACE */
#  define YYSIZE_T size_t
# endif
#endif
#if ! defined (YYSIZE_T)
# define YYSIZE_T unsigned int
#endif

#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 yyerrorlab


/* 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);                               \
      yytoken = YYTRANSLATE (yychar);                       \
      YYPOPSTACK;                               \
      goto yybackup;                                  \
    }                                           \
  else                                                \
    {                                                 \
      yyerror ("syntax error: cannot back up");\
      YYERROR;                                        \
    }                                           \
while (0)

#define YYTERROR  1
#define YYERRCODE 256

/* YYLLOC_DEFAULT -- Compute the default location (before the actions
   are run).  */

#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N)        \
   ((Current).first_line   = (Rhs)[1].first_line,     \
    (Current).first_column = (Rhs)[1].first_column,   \
    (Current).last_line    = (Rhs)[N].last_line,      \
    (Current).last_column  = (Rhs)[N].last_column)
#endif

/* YYLEX -- calling `yylex' with the right arguments.  */

#ifdef YYLEX_PARAM
# define YYLEX yylex (YYLEX_PARAM)
#else
# define YYLEX yylex ()
#endif

/* Enable debugging if requested.  */
#if YYDEBUG

# ifndef YYFPRINTF
#  include <stdio.h> /* INFRINGES ON USER NAME SPACE */
#  define YYFPRINTF fprintf
# endif

# define YYDPRINTF(Args)                  \
do {                                \
  if (yydebug)                            \
    YYFPRINTF Args;                       \
} while (0)

# define YYDSYMPRINT(Args)                \
do {                                \
  if (yydebug)                            \
    yysymprint Args;                      \
} while (0)

# define YYDSYMPRINTF(Title, Token, Value, Location)        \
do {                                            \
  if (yydebug)                                        \
    {                                           \
      YYFPRINTF (stderr, "%s ", Title);                     \
      yysymprint (stderr,                             \
                  Token, Value);    \
      YYFPRINTF (stderr, "\n");                             \
    }                                           \
} while (0)

/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included).                                                   |
`------------------------------------------------------------------*/

#if defined (__STDC__) || defined (__cplusplus)
static void
yy_stack_print (short int *bottom, short int *top)
#else
static void
yy_stack_print (bottom, top)
    short int *bottom;
    short int *top;
#endif
{
  YYFPRINTF (stderr, "Stack now");
  for (/* Nothing. */; bottom <= top; ++bottom)
    YYFPRINTF (stderr, " %d", *bottom);
  YYFPRINTF (stderr, "\n");
}

# define YY_STACK_PRINT(Bottom, Top)                        \
do {                                            \
  if (yydebug)                                        \
    yy_stack_print ((Bottom), (Top));                       \
} while (0)


/*------------------------------------------------.
| Report that the YYRULE is going to be reduced.  |
`------------------------------------------------*/

#if defined (__STDC__) || defined (__cplusplus)
static void
yy_reduce_print (int yyrule)
#else
static void
yy_reduce_print (yyrule)
    int yyrule;
#endif
{
  int yyi;
  unsigned int yylno = yyrline[yyrule];
  YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ",
             yyrule - 1, yylno);
  /* Print the symbols being reduced, and their result.  */
  for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++)
    YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]);
  YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]);
}

# define YY_REDUCE_PRINT(Rule)            \
do {                          \
  if (yydebug)                      \
    yy_reduce_print (Rule);         \
} while (0)

/* Nonzero means print parse trace.  It is left uninitialized so that
   multiple parsers can coexist.  */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define YYDSYMPRINT(Args)
# define YYDSYMPRINTF(Title, Token, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !YYDEBUG */


/* YYINITDEPTH -- initial size of the parser's stacks.  */
#ifndef     YYINITDEPTH
# define YYINITDEPTH 200
#endif

/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
   if the built-in stack extension method is used).

   Do not make this value too large; the results are undefined if
   SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH)
   evaluated with infinite-precision integer arithmetic.  */

#if defined (YYMAXDEPTH) && YYMAXDEPTH == 0
# undef YYMAXDEPTH
#endif

#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif



#if YYERROR_VERBOSE

# ifndef yystrlen
#  if defined (__GLIBC__) && defined (_STRING_H)
#   define yystrlen strlen
#  else
/* Return the length of YYSTR.  */
static YYSIZE_T
#   if defined (__STDC__) || defined (__cplusplus)
yystrlen (const char *yystr)
#   else
yystrlen (yystr)
     const char *yystr;
#   endif
{
  register const char *yys = yystr;

  while (*yys++ != '\0')
    continue;

  return yys - yystr - 1;
}
#  endif
# endif

# ifndef yystpcpy
#  if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE)
#   define yystpcpy stpcpy
#  else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
   YYDEST.  */
static char *
#   if defined (__STDC__) || defined (__cplusplus)
yystpcpy (char *yydest, const char *yysrc)
#   else
yystpcpy (yydest, yysrc)
     char *yydest;
     const char *yysrc;
#   endif
{
  register char *yyd = yydest;
  register const char *yys = yysrc;

  while ((*yyd++ = *yys++) != '\0')
    continue;

  return yyd - 1;
}
#  endif
# endif

#endif /* !YYERROR_VERBOSE */



#if YYDEBUG
/*--------------------------------.
| Print this symbol on YYOUTPUT.  |
`--------------------------------*/

#if defined (__STDC__) || defined (__cplusplus)
static void
yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep)
#else
static void
yysymprint (yyoutput, yytype, yyvaluep)
    FILE *yyoutput;
    int yytype;
    YYSTYPE *yyvaluep;
#endif
{
  /* Pacify ``unused variable'' warnings.  */
  (void) yyvaluep;

  if (yytype < YYNTOKENS)
    {
      YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
# ifdef YYPRINT
      YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# endif
    }
  else
    YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);

  switch (yytype)
    {
      default:
        break;
    }
  YYFPRINTF (yyoutput, ")");
}

#endif /* ! YYDEBUG */
/*-----------------------------------------------.
| Release the memory associated to this symbol.  |
`-----------------------------------------------*/

#if defined (__STDC__) || defined (__cplusplus)
static void
yydestruct (int yytype, YYSTYPE *yyvaluep)
#else
static void
yydestruct (yytype, yyvaluep)
    int yytype;
    YYSTYPE *yyvaluep;
#endif
{
  /* Pacify ``unused variable'' warnings.  */
  (void) yyvaluep;

  switch (yytype)
    {

      default:
        break;
    }
}


/* Prevent warnings from -Wmissing-prototypes.  */

#ifdef YYPARSE_PARAM
# if defined (__STDC__) || defined (__cplusplus)
int yyparse (void *YYPARSE_PARAM);
# else
int yyparse ();
# endif
#else /* ! YYPARSE_PARAM */
#if defined (__STDC__) || defined (__cplusplus)
int yyparse (void);
#else
int yyparse ();
#endif
#endif /* ! YYPARSE_PARAM */



/* The lookahead symbol.  */
int yychar;

/* The semantic value of the lookahead symbol.  */
YYSTYPE yylval;

/* Number of syntax errors so far.  */
int yynerrs;



/*----------.
| yyparse.  |
`----------*/

#ifdef YYPARSE_PARAM
# if defined (__STDC__) || defined (__cplusplus)
int yyparse (void *YYPARSE_PARAM)
# else
int yyparse (YYPARSE_PARAM)
  void *YYPARSE_PARAM;
# endif
#else /* ! YYPARSE_PARAM */
#if defined (__STDC__) || defined (__cplusplus)
int
yyparse (void)
#else
int
yyparse ()

#endif
#endif
{
  
  register int yystate;
  register int yyn;
  int yyresult;
  /* Number of tokens to shift before error messages enabled.  */
  int yyerrstatus;
  /* Lookahead token as an internal (translated) token number.  */
  int yytoken = 0;

  /* Three stacks and their tools:
     `yyss': related to states,
     `yyvs': related to semantic values,
     `yyls': related to locations.

     Refer to the stacks thru separate pointers, to allow yyoverflow
     to reallocate them elsewhere.  */

  /* The state stack.  */
  short int yyssa[YYINITDEPTH];
  short int *yyss = yyssa;
  register short int *yyssp;

  /* The semantic value stack.  */
  YYSTYPE yyvsa[YYINITDEPTH];
  YYSTYPE *yyvs = yyvsa;
  register YYSTYPE *yyvsp;



#define YYPOPSTACK   (yyvsp--, yyssp--)

  YYSIZE_T yystacksize = YYINITDEPTH;

  /* The variables used to return semantic value and location from the
     action routines.  */
  YYSTYPE yyval;


  /* When reducing, the number of symbols on the RHS of the reduced
     rule.  */
  int yylen;

  YYDPRINTF ((stderr, "Starting parse\n"));

  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;
  yyvsp = yyvs;


  goto yysetstate;

/*------------------------------------------------------------.
| yynewstate -- Push a new state, which is found in yystate.  |
`------------------------------------------------------------*/
 yynewstate:
  /* In all cases, when you get here, the value and location stacks
     have just been pushed. so pushing a state here evens the stacks.
     */
  yyssp++;

 yysetstate:
  *yyssp = yystate;

  if (yyss + yystacksize - 1 <= yyssp)
    {
      /* Get the current used size of the three stacks, in elements.  */
      YYSIZE_T yysize = yyssp - yyss + 1;

#ifdef yyoverflow
      {
      /* 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 int *yyss1 = yyss;


      /* Each stack pointer address is followed by the size of the
         data in use in that stack, in bytes.  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, yysize * sizeof (*yyssp),
                &yyvs1, yysize * sizeof (*yyvsp),

                &yystacksize);

      yyss = yyss1;
      yyvs = yyvs1;
      }
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
      goto yyoverflowlab;
# else
      /* Extend the stack our own way.  */
      if (YYMAXDEPTH <= yystacksize)
      goto yyoverflowlab;
      yystacksize *= 2;
      if (YYMAXDEPTH < yystacksize)
      yystacksize = YYMAXDEPTH;

      {
      short int *yyss1 = yyss;
      union yyalloc *yyptr =
        (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
      if (! yyptr)
        goto yyoverflowlab;
      YYSTACK_RELOCATE (yyss);
      YYSTACK_RELOCATE (yyvs);

#  undef YYSTACK_RELOCATE
      if (yyss1 != yyssa)
        YYSTACK_FREE (yyss1);
      }
# endif
#endif /* no yyoverflow */

      yyssp = yyss + yysize - 1;
      yyvsp = yyvs + yysize - 1;


      YYDPRINTF ((stderr, "Stack size increased to %lu\n",
              (unsigned long int) yystacksize));

      if (yyss + yystacksize - 1 <= yyssp)
      YYABORT;
    }

  YYDPRINTF ((stderr, "Entering state %d\n", yystate));

  goto yybackup;

/*-----------.
| 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 == YYPACT_NINF)
    goto yydefault;

  /* Not known => get a lookahead token if don't already have one.  */

  /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol.  */
  if (yychar == YYEMPTY)
    {
      YYDPRINTF ((stderr, "Reading a token: "));
      yychar = YYLEX;
    }

  if (yychar <= YYEOF)
    {
      yychar = yytoken = YYEOF;
      YYDPRINTF ((stderr, "Now at end of input.\n"));
    }
  else
    {
      yytoken = YYTRANSLATE (yychar);
      YYDSYMPRINTF ("Next token is", yytoken, &yylval, &yylloc);
    }

  /* If the proper action on seeing token YYTOKEN is to reduce or to
     detect an error, take that action.  */
  yyn += yytoken;
  if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
    goto yydefault;
  yyn = yytable[yyn];
  if (yyn <= 0)
    {
      if (yyn == 0 || yyn == YYTABLE_NINF)
      goto yyerrlab;
      yyn = -yyn;
      goto yyreduce;
    }

  if (yyn == YYFINAL)
    YYACCEPT;

  /* Shift the lookahead token.  */
  YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken]));

  /* Discard the token being shifted unless it is eof.  */
  if (yychar != YYEOF)
    yychar = YYEMPTY;

  *++yyvsp = yylval;


  /* Count tokens shifted since error; after three, turn off error
     status.  */
  if (yyerrstatus)
    yyerrstatus--;

  yystate = yyn;
  goto yynewstate;


/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state.  |
`-----------------------------------------------------------*/
yydefault:
  yyn = yydefact[yystate];
  if (yyn == 0)
    goto yyerrlab;
  goto yyreduce;


/*-----------------------------.
| yyreduce -- Do a reduction.  |
`-----------------------------*/
yyreduce:
  /* yyn is the number of a rule to reduce with.  */
  yylen = yyr2[yyn];

  /* If YYLEN is nonzero, implement the default value of the action:
     `$$ = $1'.

     Otherwise, the following line sets YYVAL to garbage.
     This behavior is undocumented and Bison
     users should not rely upon it.  Assigning to YYVAL
     unconditionally makes the parser a bit smaller, and it avoids a
     GCC warning that YYVAL may be used uninitialized.  */
  yyval = yyvsp[1-yylen];


  YY_REDUCE_PRINT (yyn);
  switch (yyn)
    {
        case 2:
#line 86 "src/parser.yy"
    { gCheckIdents = 1; ;}
    break;

  case 3:
#line 86 "src/parser.yy"
    {
    Result::setLastResult(NodePtr(yyvsp[0].node));
    yyval.node = 0;
;}
    break;

  case 4:
#line 91 "src/parser.yy"
    { yyval.node = yyvsp[0].node; ;}
    break;

  case 5:
#line 94 "src/parser.yy"
    {
    Result::setLastResult(i18n("This is an invalid assignment."));

    YYABORT;
;}
    break;

  case 6:
#line 101 "src/parser.yy"
    {
    QString s(i18n("You can't assign to function %1").arg(yyvsp[-1].fn->name()));
    Result::setLastResult(s);

    YYABORT;
;}
    break;

  case 7:
#line 110 "src/parser.yy"
    { --gCheckIdents; ;}
    break;

  case 8:
#line 110 "src/parser.yy"
    {
    yyval.ident = yyvsp[-2].ident;
;}
    break;

  case 9:
#line 117 "src/parser.yy"
    {
    QString s(i18n("Function %1 is built-in and cannot be overridden.").arg("deriv"));
    Result::setLastResult(s);

    YYABORT;
;}
    break;

  case 10:
#line 124 "src/parser.yy"
    {
    QString s(i18n("Function %1 is built-in and cannot be overridden.").arg("deriv"));
    Result::setLastResult(s);

    YYABORT;
;}
    break;

  case 11:
#line 131 "src/parser.yy"
    {
    ++gCheckIdents;

    // We're trying to reassign an already defined function, make sure it's
    // not a built-in.
    QString funcName = yyvsp[-2].fn->name();
    QString ident = yyvsp[-1].ident->name();
    FunctionManager *manager = FunctionManager::instance();

    if(manager->isFunction(funcName) && !manager->isFunctionUserDefined(funcName)) {
      QString s(i18n("Function %1 is built-in and cannot be overridden.").arg(funcName));
      Result::setLastResult(s);

      YYABORT;
    }

    if(manager->isFunction(funcName))
      manager->removeFunction(funcName);

    BaseFunction *newFn = new UserDefinedFunction(funcName, yyvsp[0].node);
    if(!manager->addFunction(newFn, ident)) {
      QString s(i18n("Unable to define function %1 because it is recursive.").arg(funcName));
      Result::setLastResult(s);

      YYABORT;
    }

    Result::setLastResult(Result::Null);
    YYACCEPT;
;}
    break;

  case 12:
#line 164 "src/parser.yy"
    {
    ++gCheckIdents;

    QString funcName = yyvsp[-2].ident->name();
    QString ident = yyvsp[-1].ident->name();

    // No need to check if the function is already defined, because the
    // lexer checked for us before returning the IDENT token.
    BaseFunction *newFn = new UserDefinedFunction(funcName, yyvsp[0].node);
    FunctionManager::instance()->addFunction(newFn, ident);

    Result::setLastResult(Result::Null);
    YYACCEPT;
;}
    break;

  case 13:
#line 180 "src/parser.yy"
    {
    FunctionManager::instance()->removeFunction(yyvsp[-2].fn->name());

    Result::setLastResult(Result::Null);
    YYACCEPT;
;}
    break;

  case 14:
#line 188 "src/parser.yy"
    {
    // This is an error
    Result::setLastResult(Result(i18n("Function %1 is not defined.").arg(yyvsp[-2].ident->name())));
    YYABORT;
;}
    break;

  case 15:
#line 195 "src/parser.yy"
    {
    // This is an error
    Result::setLastResult(Result(i18n("Function %1 is not defined.").arg(yyvsp[-3].ident->name())));
    YYABORT;
;}
    break;

  case 16:
#line 201 "src/parser.yy"
    {
    ValueManager *manager = ValueManager::instance();
    
    if(manager->isValueSet(yyvsp[0].ident->name()) && !manager->isValueReadOnly(yyvsp[0].ident->name())) {
      manager->removeValue(yyvsp[0].ident->name());

      Result::setLastResult(Result::Null);
      YYACCEPT;
    }
    else {
      QString s;
      if(manager->isValueSet(yyvsp[0].ident->name()))
          s = i18n("Can't remove predefined variable %1.").arg(yyvsp[0].ident->name());
      else
          s = i18n("Can't remove undefined variable %1.").arg(yyvsp[0].ident->name());

      Result::setLastResult(s);

      YYABORT;
    }
;}
    break;

  case 17:
#line 223 "src/parser.yy"
    {
    ValueManager *vm = ValueManager::instance();

    if(vm->isValueReadOnly(yyvsp[-2].ident->name())) {
      if(yyvsp[-2].ident->name() == "pi" && yyvsp[0].node->value() == Abakus::number_t("3.0"))
          Result::setLastResult(i18n("This isn't Indiana, you can't just change pi"));
      else
          Result::setLastResult(i18n("%1 is a constant").arg(yyvsp[-2].ident->name()));

      YYABORT;
    }

    ValueManager::instance()->setValue(yyvsp[-2].ident->name(), yyvsp[0].node->value());

    Result::setLastResult(Result::Null);
    YYACCEPT;
;}
    break;

  case 18:
#line 242 "src/parser.yy"
    {
    ValueManager *vm = ValueManager::instance();

    if(vm->isValueReadOnly(yyvsp[-2].ident->name())) {
      if(yyvsp[-2].ident->name() == "pi" && yyvsp[0].node->value() == Abakus::number_t("3.0"))
          Result::setLastResult(i18n("This isn't Indiana, you can't just change pi"));
      else
          Result::setLastResult(i18n("%1 is a constant").arg(yyvsp[-2].ident->name()));

      YYABORT;
    }

    ValueManager::instance()->setValue(yyvsp[-2].ident->name(), yyvsp[0].node->value());

    Result::setLastResult(Result::Null);
    YYACCEPT;
;}
    break;

  case 19:
#line 260 "src/parser.yy"
    {
    Result::setLastResult(i18n("Can't assign to %1").arg(yyvsp[-1].node->value().toString()));
    YYABORT;
;}
    break;

  case 20:
#line 266 "src/parser.yy"
    {
    Result::setLastResult(i18n("%1 isn't a function (or operator expected)").arg(yyvsp[-1].ident->name()));
    YYABORT;
;}
    break;

  case 21:
#line 272 "src/parser.yy"
    {
    Result::setLastResult(i18n("Missing operator"));
    YYABORT;
;}
    break;

  case 22:
#line 277 "src/parser.yy"
    {
    Result::setLastResult(i18n("Missing operator"));
    YYABORT;
;}
    break;

  case 23:
#line 282 "src/parser.yy"
    {
    Result::setLastResult(i18n("Missing operator"));
    YYABORT;
;}
    break;

  case 24:
#line 287 "src/parser.yy"
    {
    Result::setLastResult(i18n("Sorry, I can't figure it out."));
    YYABORT;
;}
    break;

  case 25:
#line 296 "src/parser.yy"
    { yyval.node = new BinaryOperator(BinaryOperator::Addition, yyvsp[-2].node, yyvsp[0].node); ;}
    break;

  case 26:
#line 297 "src/parser.yy"
    { yyval.node = new BinaryOperator(BinaryOperator::Subtraction, yyvsp[-2].node, yyvsp[0].node); ;}
    break;

  case 27:
#line 298 "src/parser.yy"
    { yyval.node = yyvsp[0].node; ;}
    break;

  case 28:
#line 300 "src/parser.yy"
    { yyval.node = new BinaryOperator(BinaryOperator::Multiplication, yyvsp[-2].node, yyvsp[0].node); ;}
    break;

  case 29:
#line 301 "src/parser.yy"
    { yyval.node = new BinaryOperator(BinaryOperator::Division, yyvsp[-2].node, yyvsp[0].node); ;}
    break;

  case 30:
#line 302 "src/parser.yy"
    { yyval.node = yyvsp[0].node; ;}
    break;

  case 31:
#line 304 "src/parser.yy"
    { yyval.node = new BinaryOperator(BinaryOperator::Exponentiation, yyvsp[-2].node, yyvsp[0].node); ;}
    break;

  case 32:
#line 305 "src/parser.yy"
    { yyval.node = yyvsp[0].node; ;}
    break;

  case 33:
#line 307 "src/parser.yy"
    { yyval.node = yyvsp[0].node; ;}
    break;

  case 34:
#line 308 "src/parser.yy"
    { yyval.node = new UnaryOperator(UnaryOperator::Negation, yyvsp[0].node); ;}
    break;

  case 35:
#line 309 "src/parser.yy"
    { yyval.node = yyvsp[-1].node; ;}
    break;

  case 36:
#line 310 "src/parser.yy"
    { yyval.node = new UnaryOperator(UnaryOperator::Negation, yyvsp[-1].node); ;}
    break;

  case 37:
#line 312 "src/parser.yy"
    { yyval.node = yyvsp[0].node; ;}
    break;

  case 38:
#line 314 "src/parser.yy"
    { yyval.node = yyvsp[0].node; ;}
    break;

  case 39:
#line 316 "src/parser.yy"
    {
    Abakus::number_t value(yytext);

    yyval.node = new NumericValue(value);
;}
    break;

  case 40:
#line 322 "src/parser.yy"
    { --gCheckIdents; ;}
    break;

  case 41:
#line 322 "src/parser.yy"
    { ++gCheckIdents; ;}
    break;

  case 42:
#line 322 "src/parser.yy"
    {
    yyval.node = new DerivativeFunction(yyvsp[-4].node, yyvsp[-1].node);
;}
    break;

  case 43:
#line 326 "src/parser.yy"
    {
    yyvsp[-1].fn->setOperand(yyvsp[0].node);
    yyval.node = yyvsp[-1].fn;
;}
    break;

  case 44:
#line 332 "src/parser.yy"
    {
    yyvsp[-1].fn->setOperand(yyvsp[0].node);
    yyval.node = new BinaryOperator(BinaryOperator::Multiplication, yyvsp[-2].node, yyvsp[-1].fn);
;}
    break;

  case 45:
#line 337 "src/parser.yy"
    {
    yyval.node = new BinaryOperator(BinaryOperator::Multiplication, yyvsp[-3].node, yyvsp[-1].node);
;}
    break;

  case 46:
#line 341 "src/parser.yy"
    {
    if(gCheckIdents > 0 && !ValueManager::instance()->isValueSet(yyvsp[0].ident->name())) {
      Result::setLastResult(i18n("Unknown variable %1").arg(yyvsp[0].ident->name()));
      YYABORT;
    }

    yyval.node = new BinaryOperator(BinaryOperator::Multiplication, yyvsp[-1].node, yyvsp[0].ident);
;}
    break;

  case 47:
#line 350 "src/parser.yy"
    {
    if(gCheckIdents <= 0 || ValueManager::instance()->isValueSet(yyvsp[0].ident->name()))
      yyval.node = yyvsp[0].ident;
    else {
      Result::setLastResult(i18n("Unknown variable %1").arg(yyvsp[0].ident->name()));
      YYABORT;
    }
;}
    break;

  case 48:
#line 359 "src/parser.yy"
    {
    yyval.ident = new Identifier(yytext);
;}
    break;

  case 49:
#line 363 "src/parser.yy"
    {
    /* No check necessary, the lexer has already checked for us. */
    yyval.fn = new BuiltinFunction(yytext, 0);
;}
    break;


    }

/* Line 1010 of yacc.c.  */
#line 1519 "src/parser_yacc.cpp"

  yyvsp -= yylen;
  yyssp -= yylen;


  YY_STACK_PRINT (yyss, yyssp);

  *++yyvsp = yyval;


  /* 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 - YYNTOKENS] + *yyssp;
  if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
    yystate = yytable[yystate];
  else
    yystate = yydefgoto[yyn - YYNTOKENS];

  goto yynewstate;


/*------------------------------------.
| yyerrlab -- here on detecting error |
`------------------------------------*/
yyerrlab:
  /* If not already recovering from an error, report this error.  */
  if (!yyerrstatus)
    {
      ++yynerrs;
#if YYERROR_VERBOSE
      yyn = yypact[yystate];

      if (YYPACT_NINF < yyn && yyn < YYLAST)
      {
        YYSIZE_T yysize = 0;
        int yytype = YYTRANSLATE (yychar);
        const char* yyprefix;
        char *yymsg;
        int yyx;

        /* Start YYX at -YYN if negative to avoid negative indexes in
           YYCHECK.  */
        int yyxbegin = yyn < 0 ? -yyn : 0;

        /* Stay within bounds of both yycheck and yytname.  */
        int yychecklim = YYLAST - yyn;
        int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
        int yycount = 0;

        yyprefix = ", expecting ";
        for (yyx = yyxbegin; yyx < yyxend; ++yyx)
          if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
            {
            yysize += yystrlen (yyprefix) + yystrlen (yytname [yyx]);
            yycount += 1;
            if (yycount == 5)
              {
                yysize = 0;
                break;
              }
            }
        yysize += (sizeof ("syntax error, unexpected ")
                 + yystrlen (yytname[yytype]));
        yymsg = (char *) YYSTACK_ALLOC (yysize);
        if (yymsg != 0)
          {
            char *yyp = yystpcpy (yymsg, "syntax error, unexpected ");
            yyp = yystpcpy (yyp, yytname[yytype]);

            if (yycount < 5)
            {
              yyprefix = ", expecting ";
              for (yyx = yyxbegin; yyx < yyxend; ++yyx)
                if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
                  {
                  yyp = yystpcpy (yyp, yyprefix);
                  yyp = yystpcpy (yyp, yytname[yyx]);
                  yyprefix = " or ";
                  }
            }
            yyerror (yymsg);
            YYSTACK_FREE (yymsg);
          }
        else
          yyerror ("syntax error; also virtual memory exhausted");
      }
      else
#endif /* YYERROR_VERBOSE */
      yyerror ("syntax error");
    }



  if (yyerrstatus == 3)
    {
      /* If just tried and failed to reuse lookahead token after an
       error, discard it.  */

      if (yychar <= YYEOF)
        {
          /* If at end of input, pop the error token,
           then the rest of the stack, then return failure.  */
        if (yychar == YYEOF)
           for (;;)
             {
             YYPOPSTACK;
             if (yyssp == yyss)
               YYABORT;
             YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp);
             yydestruct (yystos[*yyssp], yyvsp);
             }
        }
      else
      {
        YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc);
        yydestruct (yytoken, &yylval);
        yychar = YYEMPTY;

      }
    }

  /* Else will try to reuse lookahead token after shifting the error
     token.  */
  goto yyerrlab1;


/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR.  |
`---------------------------------------------------*/
yyerrorlab:

#ifdef __GNUC__
  /* Pacify GCC when the user code never invokes YYERROR and the label
     yyerrorlab therefore never appears in user code.  */
  if (0)
     goto yyerrorlab;
#endif

  yyvsp -= yylen;
  yyssp -= yylen;
  yystate = *yyssp;
  goto yyerrlab1;


/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR.  |
`-------------------------------------------------------------*/
yyerrlab1:
  yyerrstatus = 3;      /* Each real token shifted decrements this.  */

  for (;;)
    {
      yyn = yypact[yystate];
      if (yyn != YYPACT_NINF)
      {
        yyn += YYTERROR;
        if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
          {
            yyn = yytable[yyn];
            if (0 < yyn)
            break;
          }
      }

      /* Pop the current state because it cannot handle the error token.  */
      if (yyssp == yyss)
      YYABORT;

      YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp);
      yydestruct (yystos[yystate], yyvsp);
      YYPOPSTACK;
      yystate = *yyssp;
      YY_STACK_PRINT (yyss, yyssp);
    }

  if (yyn == YYFINAL)
    YYACCEPT;

  YYDPRINTF ((stderr, "Shifting error token, "));

  *++yyvsp = yylval;


  yystate = yyn;
  goto yynewstate;


/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here.  |
`-------------------------------------*/
yyacceptlab:
  yyresult = 0;
  goto yyreturn;

/*-----------------------------------.
| yyabortlab -- YYABORT comes here.  |
`-----------------------------------*/
yyabortlab:
  yyresult = 1;
  goto yyreturn;

#ifndef yyoverflow
/*----------------------------------------------.
| yyoverflowlab -- parser overflow comes here.  |
`----------------------------------------------*/
yyoverflowlab:
  yyerror ("parser stack overflow");
  yyresult = 2;
  /* Fall through.  */
#endif

yyreturn:
#ifndef yyoverflow
  if (yyss != yyssa)
    YYSTACK_FREE (yyss);
#endif
  return yyresult;
}


#line 368 "src/parser.yy"


int gCheckIdents = 0;

int yyerror(const char *)
{
    return 0;
}


Generated by  Doxygen 1.6.0   Back to index