2012-12-14 16:08:23 +01:00
|
|
|
|
/* A Bison parser, made by GNU Bison 2.3a. */
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* Skeleton implementation for Bison's Yacc-like parsers in C
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
|
|
|
|
|
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., 51 Franklin Street, Fifth Floor,
|
|
|
|
|
Boston, MA 02110-1301, USA. */
|
|
|
|
|
|
|
|
|
|
/* As a special exception, you may create a larger work that contains
|
|
|
|
|
part or all of the Bison parser skeleton and distribute that work
|
|
|
|
|
under terms of your choice, so long as that work isn't itself a
|
|
|
|
|
parser generator using the skeleton or a modified version thereof
|
|
|
|
|
as a parser skeleton. Alternatively, if you modify or redistribute
|
|
|
|
|
the parser skeleton itself, you may (at your option) remove this
|
|
|
|
|
special exception, which will cause the skeleton and the resulting
|
|
|
|
|
Bison output files to be licensed under the GNU General Public
|
|
|
|
|
License without this special exception.
|
|
|
|
|
|
|
|
|
|
This special exception was added by the Free Software Foundation in
|
|
|
|
|
version 2.2 of Bison. */
|
|
|
|
|
|
|
|
|
|
/* C LALR(1) parser skeleton 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
|
|
|
|
|
|
|
|
|
|
/* Bison version. */
|
|
|
|
|
#define YYBISON_VERSION "2.3a"
|
|
|
|
|
|
|
|
|
|
/* Skeleton name. */
|
|
|
|
|
#define YYSKELETON_NAME "yacc.c"
|
|
|
|
|
|
|
|
|
|
/* Pure parsers. */
|
|
|
|
|
#define YYPURE 1
|
|
|
|
|
|
|
|
|
|
/* Using locations. */
|
|
|
|
|
#define YYLSP_NEEDED 0
|
|
|
|
|
|
|
|
|
|
/* Substitute the variable and function names. */
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#define yyparse __gettextparse
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#define yylex __gettextlex
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#define yyerror __gettexterror
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#define yylval __gettextlval
|
|
|
|
|
#define yychar __gettextchar
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#define yydebug __gettextdebug
|
|
|
|
|
#define yynerrs __gettextnerrs
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
/* Copy the first part of user declarations. */
|
|
|
|
|
/* Line 164 of yacc.c. */
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#line 1 "plural.y"
|
|
|
|
|
|
|
|
|
|
/* Expression parsing for plural form selection.
|
2012-12-14 16:08:23 +01:00
|
|
|
|
Copyright (C) 2000-2001, 2003, 2005-2006 Free Software Foundation, Inc.
|
2002-08-23 10:02:08 +02:00
|
|
|
|
Written by Ulrich Drepper <drepper@cygnus.com>, 2000.
|
|
|
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify it
|
|
|
|
|
under the terms of the GNU Library 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
|
|
|
|
|
Library General Public License for more details.
|
|
|
|
|
|
|
|
|
|
You should have received a copy of the GNU Library General Public
|
|
|
|
|
License along with this program; if not, write to the Free Software
|
2005-05-31 10:39:18 +02:00
|
|
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
|
2002-08-23 10:02:08 +02:00
|
|
|
|
USA. */
|
|
|
|
|
|
2007-10-23 12:48:09 +02:00
|
|
|
|
/* For bison < 2.0, the bison generated parser uses alloca. AIX 3 forces us
|
|
|
|
|
to put this declaration at the beginning of the file. The declaration in
|
|
|
|
|
bison's skeleton file comes too late. This must come before <config.h>
|
|
|
|
|
because <config.h> may include arbitrary system headers.
|
|
|
|
|
This can go away once the AM_INTL_SUBDIR macro requires bison >= 2.0. */
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#if defined _AIX && !defined __GNUC__
|
|
|
|
|
#pragma alloca
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
|
# include <config.h>
|
|
|
|
|
#endif
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
#include <stddef.h>
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#include <stdlib.h>
|
2007-10-23 12:48:09 +02:00
|
|
|
|
#include <string.h>
|
2003-10-25 18:34:36 +02:00
|
|
|
|
#include "plural-exp.h"
|
|
|
|
|
|
|
|
|
|
/* The main function generated by the parser is called __gettextparse,
|
|
|
|
|
but we want it to be called PLURAL_PARSE. */
|
|
|
|
|
#ifndef _LIBC
|
|
|
|
|
# define __gettextparse PLURAL_PARSE
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#define YYLEX_PARAM &((struct parse_args *) arg)->cp
|
|
|
|
|
#define YYPARSE_PARAM arg
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
/* 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
|
|
|
|
|
|
|
|
|
|
/* Enabling the token table. */
|
|
|
|
|
#ifndef YYTOKEN_TABLE
|
|
|
|
|
# define YYTOKEN_TABLE 0
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Tokens. */
|
|
|
|
|
#ifndef YYTOKENTYPE
|
|
|
|
|
# define YYTOKENTYPE
|
|
|
|
|
/* Put the tokens into the symbol table, so that GDB and other debuggers
|
|
|
|
|
know about them. */
|
|
|
|
|
enum yytokentype {
|
|
|
|
|
EQUOP2 = 258,
|
|
|
|
|
CMPOP2 = 259,
|
|
|
|
|
ADDOP2 = 260,
|
|
|
|
|
MULOP2 = 261,
|
|
|
|
|
NUMBER = 262
|
|
|
|
|
};
|
|
|
|
|
#endif
|
|
|
|
|
/* Tokens. */
|
|
|
|
|
#define EQUOP2 258
|
|
|
|
|
#define CMPOP2 259
|
|
|
|
|
#define ADDOP2 260
|
|
|
|
|
#define MULOP2 261
|
|
|
|
|
#define NUMBER 262
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
|
|
|
|
|
typedef union YYSTYPE
|
|
|
|
|
{/* Line 191 of yacc.c. */
|
2007-10-23 12:48:09 +02:00
|
|
|
|
#line 51 "plural.y"
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
2002-08-23 10:02:08 +02:00
|
|
|
|
unsigned long int num;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
enum expression_operator op;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
struct expression *exp;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
}
|
|
|
|
|
/* Line 191 of yacc.c. */
|
|
|
|
|
#line 175 "plural.c"
|
|
|
|
|
YYSTYPE;
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# define YYSTYPE_IS_TRIVIAL 1
|
2012-12-14 16:08:23 +01:00
|
|
|
|
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
|
|
|
|
|
# define YYSTYPE_IS_DECLARED 1
|
2003-10-25 18:34:36 +02:00
|
|
|
|
#endif
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Copy the second part of user declarations. */
|
|
|
|
|
/* Line 221 of yacc.c. */
|
2007-10-23 12:48:09 +02:00
|
|
|
|
#line 57 "plural.y"
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
/* Prototypes for local functions. */
|
2004-07-27 17:12:00 +02:00
|
|
|
|
static int yylex (YYSTYPE *lval, const char **pexp);
|
|
|
|
|
static void yyerror (const char *str);
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
/* Allocation of expressions. */
|
|
|
|
|
|
|
|
|
|
static struct expression *
|
2012-12-14 16:08:23 +01:00
|
|
|
|
new_exp (int nargs, enum expression_operator op,
|
|
|
|
|
struct expression * const *args)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
struct expression *newp;
|
|
|
|
|
|
|
|
|
|
/* If any of the argument could not be malloc'ed, just return NULL. */
|
|
|
|
|
for (i = nargs - 1; i >= 0; i--)
|
|
|
|
|
if (args[i] == NULL)
|
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
|
|
/* Allocate a new expression. */
|
|
|
|
|
newp = (struct expression *) malloc (sizeof (*newp));
|
|
|
|
|
if (newp != NULL)
|
|
|
|
|
{
|
|
|
|
|
newp->nargs = nargs;
|
|
|
|
|
newp->operation = op;
|
|
|
|
|
for (i = nargs - 1; i >= 0; i--)
|
|
|
|
|
newp->val.args[i] = args[i];
|
|
|
|
|
return newp;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fail:
|
|
|
|
|
for (i = nargs - 1; i >= 0; i--)
|
|
|
|
|
FREE_EXPRESSION (args[i]);
|
|
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline struct expression *
|
2012-12-14 16:08:23 +01:00
|
|
|
|
new_exp_0 (enum expression_operator op)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
|
|
|
|
return new_exp (0, op, NULL);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline struct expression *
|
2012-12-14 16:08:23 +01:00
|
|
|
|
new_exp_1 (enum expression_operator op, struct expression *right)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
|
|
|
|
struct expression *args[1];
|
|
|
|
|
|
|
|
|
|
args[0] = right;
|
|
|
|
|
return new_exp (1, op, args);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static struct expression *
|
2012-12-14 16:08:23 +01:00
|
|
|
|
new_exp_2 (enum expression_operator op, struct expression *left,
|
|
|
|
|
struct expression *right)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
|
|
|
|
struct expression *args[2];
|
|
|
|
|
|
|
|
|
|
args[0] = left;
|
|
|
|
|
args[1] = right;
|
|
|
|
|
return new_exp (2, op, args);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline struct expression *
|
2012-12-14 16:08:23 +01:00
|
|
|
|
new_exp_3 (enum expression_operator op, struct expression *bexp,
|
2004-07-27 17:12:00 +02:00
|
|
|
|
struct expression *tbranch, struct expression *fbranch)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
|
|
|
|
struct expression *args[3];
|
|
|
|
|
|
|
|
|
|
args[0] = bexp;
|
|
|
|
|
args[1] = tbranch;
|
|
|
|
|
args[2] = fbranch;
|
|
|
|
|
return new_exp (3, op, args);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* Line 221 of yacc.c. */
|
|
|
|
|
#line 265 "plural.c"
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#ifdef short
|
|
|
|
|
# undef short
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#endif
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#ifdef YYTYPE_UINT8
|
|
|
|
|
typedef YYTYPE_UINT8 yytype_uint8;
|
|
|
|
|
#else
|
|
|
|
|
typedef unsigned char yytype_uint8;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#endif
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#ifdef YYTYPE_INT8
|
|
|
|
|
typedef YYTYPE_INT8 yytype_int8;
|
|
|
|
|
#elif (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
|
typedef signed char yytype_int8;
|
|
|
|
|
#else
|
|
|
|
|
typedef short int yytype_int8;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#endif
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#ifdef YYTYPE_UINT16
|
|
|
|
|
typedef YYTYPE_UINT16 yytype_uint16;
|
|
|
|
|
#else
|
|
|
|
|
typedef unsigned short int yytype_uint16;
|
|
|
|
|
#endif
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#ifdef YYTYPE_INT16
|
|
|
|
|
typedef YYTYPE_INT16 yytype_int16;
|
|
|
|
|
#else
|
|
|
|
|
typedef short int yytype_int16;
|
|
|
|
|
#endif
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#ifndef YYSIZE_T
|
|
|
|
|
# ifdef __SIZE_TYPE__
|
|
|
|
|
# define YYSIZE_T __SIZE_TYPE__
|
|
|
|
|
# elif defined size_t
|
|
|
|
|
# define YYSIZE_T size_t
|
|
|
|
|
# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
|
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# define YYSIZE_T size_t
|
|
|
|
|
# else
|
|
|
|
|
# define YYSIZE_T unsigned int
|
|
|
|
|
# endif
|
|
|
|
|
#endif
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#ifndef YY_
|
|
|
|
|
# if YYENABLE_NLS
|
|
|
|
|
# if ENABLE_NLS
|
|
|
|
|
# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# define YY_(msgid) dgettext ("bison-runtime", msgid)
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# ifndef YY_
|
|
|
|
|
# define YY_(msgid) msgid
|
|
|
|
|
# endif
|
|
|
|
|
#endif
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* Suppress unused-variable warnings by "using" E. */
|
|
|
|
|
#if ! defined lint || defined __GNUC__
|
|
|
|
|
# define YYUSE(e) ((void) (e))
|
|
|
|
|
#else
|
|
|
|
|
# define YYUSE(e) /* empty */
|
|
|
|
|
#endif
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* Identity function, used to suppress warnings about constant conditions. */
|
|
|
|
|
#ifndef lint
|
|
|
|
|
# define YYID(n) (n)
|
|
|
|
|
#else
|
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
|
static int
|
|
|
|
|
YYID (int yyi)
|
|
|
|
|
#else
|
|
|
|
|
static int
|
|
|
|
|
YYID (yyi)
|
|
|
|
|
int yyi;
|
|
|
|
|
#endif
|
2003-10-25 18:34:36 +02:00
|
|
|
|
{
|
2012-12-14 16:08:23 +01:00
|
|
|
|
return yyi;
|
|
|
|
|
}
|
|
|
|
|
#endif
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#if ! defined yyoverflow || YYERROR_VERBOSE
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
|
|
|
|
/* The parser invokes alloca or malloc; define the necessary symbols. */
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
# ifdef YYSTACK_USE_ALLOCA
|
|
|
|
|
# if YYSTACK_USE_ALLOCA
|
|
|
|
|
# ifdef __GNUC__
|
|
|
|
|
# define YYSTACK_ALLOC __builtin_alloca
|
|
|
|
|
# elif defined __BUILTIN_VA_ARG_INCR
|
|
|
|
|
# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# elif defined _AIX
|
|
|
|
|
# define YYSTACK_ALLOC __alloca
|
|
|
|
|
# elif defined _MSC_VER
|
|
|
|
|
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# define alloca _alloca
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# else
|
2012-12-14 16:08:23 +01:00
|
|
|
|
# define YYSTACK_ALLOC alloca
|
|
|
|
|
# if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
|
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# ifndef _STDLIB_H
|
|
|
|
|
# define _STDLIB_H 1
|
|
|
|
|
# endif
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
|
|
|
|
|
# ifdef YYSTACK_ALLOC
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* Pacify GCC's `empty if-body' warning. */
|
|
|
|
|
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
|
|
|
|
|
# ifndef YYSTACK_ALLOC_MAXIMUM
|
|
|
|
|
/* The OS might guarantee only one guard page at the bottom of the stack,
|
|
|
|
|
and a page size can be as small as 4096 bytes. So we cannot safely
|
|
|
|
|
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
|
|
|
|
|
to allow for a few compiler-allocated temporary stack slots. */
|
|
|
|
|
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
|
|
|
|
|
# endif
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# else
|
2012-12-14 16:08:23 +01:00
|
|
|
|
# define YYSTACK_ALLOC YYMALLOC
|
|
|
|
|
# define YYSTACK_FREE YYFREE
|
|
|
|
|
# ifndef YYSTACK_ALLOC_MAXIMUM
|
|
|
|
|
# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
|
|
|
|
|
# endif
|
|
|
|
|
# if (defined __cplusplus && ! defined _STDLIB_H \
|
|
|
|
|
&& ! ((defined YYMALLOC || defined malloc) \
|
|
|
|
|
&& (defined YYFREE || defined free)))
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
2012-12-14 16:08:23 +01:00
|
|
|
|
# ifndef _STDLIB_H
|
|
|
|
|
# define _STDLIB_H 1
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# ifndef YYMALLOC
|
|
|
|
|
# define YYMALLOC malloc
|
|
|
|
|
# if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
|
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# ifndef YYFREE
|
|
|
|
|
# define YYFREE free
|
|
|
|
|
# if ! defined free && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
|
void free (void *); /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# endif
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# endif
|
|
|
|
|
# endif
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#if (! defined yyoverflow \
|
|
|
|
|
&& (! defined __cplusplus \
|
|
|
|
|
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
|
|
|
|
/* A type that is properly aligned for any stack member. */
|
|
|
|
|
union yyalloc
|
|
|
|
|
{
|
2012-12-14 16:08:23 +01:00
|
|
|
|
yytype_int16 yyss;
|
2003-10-25 18:34:36 +02:00
|
|
|
|
YYSTYPE yyvs;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
};
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
|
|
|
|
/* The size of the maximum gap between one aligned stack and the next. */
|
2012-12-14 16:08:23 +01:00
|
|
|
|
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
|
|
|
|
/* The size of an array large to enough to hold all stacks, each with
|
|
|
|
|
N elements. */
|
2012-12-14 16:08:23 +01:00
|
|
|
|
# define YYSTACK_BYTES(N) \
|
|
|
|
|
((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \
|
|
|
|
|
+ YYSTACK_GAP_MAXIMUM)
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
|
|
|
|
/* Copy COUNT objects from FROM to TO. The source and destination do
|
|
|
|
|
not overlap. */
|
|
|
|
|
# ifndef YYCOPY
|
2012-12-14 16:08:23 +01:00
|
|
|
|
# if defined __GNUC__ && 1 < __GNUC__
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# define YYCOPY(To, From, Count) \
|
|
|
|
|
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
|
|
|
|
|
# else
|
|
|
|
|
# define YYCOPY(To, From, Count) \
|
|
|
|
|
do \
|
|
|
|
|
{ \
|
2012-12-14 16:08:23 +01:00
|
|
|
|
YYSIZE_T yyi; \
|
2003-10-25 18:34:36 +02:00
|
|
|
|
for (yyi = 0; yyi < (Count); yyi++) \
|
|
|
|
|
(To)[yyi] = (From)[yyi]; \
|
|
|
|
|
} \
|
2012-12-14 16:08:23 +01:00
|
|
|
|
while (YYID (0))
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# 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; \
|
2012-12-14 16:08:23 +01:00
|
|
|
|
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
|
2003-10-25 18:34:36 +02:00
|
|
|
|
yyptr += yynewbytes / sizeof (*yyptr); \
|
|
|
|
|
} \
|
2012-12-14 16:08:23 +01:00
|
|
|
|
while (YYID (0))
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
#endif
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* YYFINAL -- State number of the termination state. */
|
|
|
|
|
#define YYFINAL 9
|
|
|
|
|
/* YYLAST -- Last index in YYTABLE. */
|
|
|
|
|
#define YYLAST 54
|
|
|
|
|
|
|
|
|
|
/* YYNTOKENS -- Number of terminals. */
|
|
|
|
|
#define YYNTOKENS 16
|
|
|
|
|
/* YYNNTS -- Number of nonterminals. */
|
|
|
|
|
#define YYNNTS 3
|
|
|
|
|
/* YYNRULES -- Number of rules. */
|
|
|
|
|
#define YYNRULES 13
|
|
|
|
|
/* YYNRULES -- Number of states. */
|
|
|
|
|
#define YYNSTATES 27
|
|
|
|
|
|
|
|
|
|
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
|
|
|
|
|
#define YYUNDEFTOK 2
|
|
|
|
|
#define YYMAXUTOK 262
|
|
|
|
|
|
|
|
|
|
#define YYTRANSLATE(YYX) \
|
|
|
|
|
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
|
|
|
|
|
|
|
|
|
|
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
|
|
|
|
|
static const yytype_uint8 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, 10, 2, 2, 2, 2, 5, 2,
|
|
|
|
|
14, 15, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 12, 2,
|
|
|
|
|
2, 2, 2, 3, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
13, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 4, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 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, 6, 7,
|
|
|
|
|
8, 9, 11
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#if YYDEBUG
|
|
|
|
|
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
|
|
|
|
|
YYRHS. */
|
|
|
|
|
static const yytype_uint8 yyprhs[] =
|
|
|
|
|
{
|
|
|
|
|
0, 0, 3, 5, 11, 15, 19, 23, 27, 31,
|
|
|
|
|
35, 38, 40, 42
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
|
|
|
|
|
static const yytype_int8 yyrhs[] =
|
|
|
|
|
{
|
|
|
|
|
17, 0, -1, 18, -1, 18, 3, 18, 12, 18,
|
|
|
|
|
-1, 18, 4, 18, -1, 18, 5, 18, -1, 18,
|
|
|
|
|
6, 18, -1, 18, 7, 18, -1, 18, 8, 18,
|
|
|
|
|
-1, 18, 9, 18, -1, 10, 18, -1, 13, -1,
|
|
|
|
|
11, -1, 14, 18, 15, -1
|
|
|
|
|
};
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
|
|
|
|
|
static const yytype_uint8 yyrline[] =
|
|
|
|
|
{
|
|
|
|
|
0, 154, 154, 162, 166, 170, 174, 178, 182, 186,
|
|
|
|
|
190, 194, 198, 203
|
|
|
|
|
};
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#endif
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
|
|
|
|
|
/* YYTNAME[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", "'?'", "'|'", "'&'", "EQUOP2", "CMPOP2",
|
|
|
|
|
"ADDOP2", "MULOP2", "'!'", "NUMBER", "':'", "'n'", "'('", "')'",
|
|
|
|
|
"$accept", "start", "exp", 0
|
|
|
|
|
};
|
2003-10-25 18:34:36 +02:00
|
|
|
|
#endif
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
# ifdef YYPRINT
|
|
|
|
|
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
|
|
|
|
|
token YYLEX-NUM. */
|
|
|
|
|
static const yytype_uint16 yytoknum[] =
|
|
|
|
|
{
|
|
|
|
|
0, 256, 257, 63, 124, 38, 258, 259, 260, 261,
|
|
|
|
|
33, 262, 58, 110, 40, 41
|
|
|
|
|
};
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# endif
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
|
|
|
|
|
static const yytype_uint8 yyr1[] =
|
|
|
|
|
{
|
|
|
|
|
0, 16, 17, 18, 18, 18, 18, 18, 18, 18,
|
|
|
|
|
18, 18, 18, 18
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
|
|
|
|
|
static const yytype_uint8 yyr2[] =
|
|
|
|
|
{
|
|
|
|
|
0, 2, 1, 5, 3, 3, 3, 3, 3, 3,
|
|
|
|
|
2, 1, 1, 3
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* 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 yytype_uint8 yydefact[] =
|
|
|
|
|
{
|
|
|
|
|
0, 0, 12, 11, 0, 0, 2, 10, 0, 1,
|
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 13, 0, 4,
|
|
|
|
|
5, 6, 7, 8, 9, 0, 3
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYDEFGOTO[NTERM-NUM]. */
|
|
|
|
|
static const yytype_int8 yydefgoto[] =
|
|
|
|
|
{
|
|
|
|
|
-1, 5, 6
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
|
|
|
|
STATE-NUM. */
|
|
|
|
|
#define YYPACT_NINF -10
|
|
|
|
|
static const yytype_int8 yypact[] =
|
|
|
|
|
{
|
|
|
|
|
-9, -9, -10, -10, -9, 8, 36, -10, 13, -10,
|
|
|
|
|
-9, -9, -9, -9, -9, -9, -9, -10, 26, 41,
|
|
|
|
|
45, 18, -2, 14, -10, -9, 36
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYPGOTO[NTERM-NUM]. */
|
|
|
|
|
static const yytype_int8 yypgoto[] =
|
|
|
|
|
{
|
|
|
|
|
-10, -10, -1
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* 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 yytype_uint8 yytable[] =
|
|
|
|
|
{
|
|
|
|
|
7, 1, 2, 8, 3, 4, 15, 16, 9, 18,
|
|
|
|
|
19, 20, 21, 22, 23, 24, 10, 11, 12, 13,
|
|
|
|
|
14, 15, 16, 16, 26, 14, 15, 16, 17, 10,
|
|
|
|
|
11, 12, 13, 14, 15, 16, 0, 0, 25, 10,
|
|
|
|
|
11, 12, 13, 14, 15, 16, 12, 13, 14, 15,
|
|
|
|
|
16, 13, 14, 15, 16
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static const yytype_int8 yycheck[] =
|
|
|
|
|
{
|
|
|
|
|
1, 10, 11, 4, 13, 14, 8, 9, 0, 10,
|
|
|
|
|
11, 12, 13, 14, 15, 16, 3, 4, 5, 6,
|
|
|
|
|
7, 8, 9, 9, 25, 7, 8, 9, 15, 3,
|
|
|
|
|
4, 5, 6, 7, 8, 9, -1, -1, 12, 3,
|
|
|
|
|
4, 5, 6, 7, 8, 9, 5, 6, 7, 8,
|
|
|
|
|
9, 6, 7, 8, 9
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
|
|
|
|
|
symbol of state STATE-NUM. */
|
|
|
|
|
static const yytype_uint8 yystos[] =
|
|
|
|
|
{
|
|
|
|
|
0, 10, 11, 13, 14, 17, 18, 18, 18, 0,
|
|
|
|
|
3, 4, 5, 6, 7, 8, 9, 15, 18, 18,
|
|
|
|
|
18, 18, 18, 18, 18, 12, 18
|
|
|
|
|
};
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
#define yyerrok (yyerrstatus = 0)
|
|
|
|
|
#define yyclearin (yychar = YYEMPTY)
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#define YYEMPTY (-2)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#define YYEOF 0
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#define YYACCEPT goto yyacceptlab
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#define YYABORT goto yyabortlab
|
|
|
|
|
#define YYERROR goto yyerrorlab
|
|
|
|
|
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/* Like YYERROR except do call yyerror. This remains here temporarily
|
|
|
|
|
to ease the transition to the new meaning of YYERROR, for GCC.
|
2002-08-23 10:02:08 +02:00
|
|
|
|
Once GCC version 2 has supplanted version 1, this can go. */
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#define YYFAIL goto yyerrlab
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#define YYRECOVERING() (!!yyerrstatus)
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
#define YYBACKUP(Token, Value) \
|
2002-08-23 10:02:08 +02:00
|
|
|
|
do \
|
|
|
|
|
if (yychar == YYEMPTY && yylen == 1) \
|
2003-10-25 18:34:36 +02:00
|
|
|
|
{ \
|
|
|
|
|
yychar = (Token); \
|
|
|
|
|
yylval = (Value); \
|
2012-12-14 16:08:23 +01:00
|
|
|
|
yytoken = YYTRANSLATE (yychar); \
|
|
|
|
|
YYPOPSTACK (1); \
|
2002-08-23 10:02:08 +02:00
|
|
|
|
goto yybackup; \
|
|
|
|
|
} \
|
|
|
|
|
else \
|
2012-12-14 16:08:23 +01:00
|
|
|
|
{ \
|
|
|
|
|
yyerror (YY_("syntax error: cannot back up")); \
|
2003-10-25 18:34:36 +02:00
|
|
|
|
YYERROR; \
|
|
|
|
|
} \
|
2012-12-14 16:08:23 +01:00
|
|
|
|
while (YYID (0))
|
|
|
|
|
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
#define YYTERROR 1
|
|
|
|
|
#define YYERRCODE 256
|
|
|
|
|
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
|
|
|
|
|
If N is 0, then set CURRENT to the empty location which ends
|
|
|
|
|
the previous symbol: RHS[0] (always defined). */
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#define YYRHSLOC(Rhs, K) ((Rhs)[K])
|
2003-10-25 18:34:36 +02:00
|
|
|
|
#ifndef YYLLOC_DEFAULT
|
2012-12-14 16:08:23 +01:00
|
|
|
|
# define YYLLOC_DEFAULT(Current, Rhs, N) \
|
|
|
|
|
do \
|
|
|
|
|
if (YYID (N)) \
|
|
|
|
|
{ \
|
|
|
|
|
(Current).first_line = YYRHSLOC (Rhs, 1).first_line; \
|
|
|
|
|
(Current).first_column = YYRHSLOC (Rhs, 1).first_column; \
|
|
|
|
|
(Current).last_line = YYRHSLOC (Rhs, N).last_line; \
|
|
|
|
|
(Current).last_column = YYRHSLOC (Rhs, N).last_column; \
|
|
|
|
|
} \
|
|
|
|
|
else \
|
|
|
|
|
{ \
|
|
|
|
|
(Current).first_line = (Current).last_line = \
|
|
|
|
|
YYRHSLOC (Rhs, 0).last_line; \
|
|
|
|
|
(Current).first_column = (Current).last_column = \
|
|
|
|
|
YYRHSLOC (Rhs, 0).last_column; \
|
|
|
|
|
} \
|
|
|
|
|
while (YYID (0))
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* YY_LOCATION_PRINT -- Print the location on the stream.
|
|
|
|
|
This macro was not mandated originally: define only if we know
|
|
|
|
|
we won't break user code: when these are the locations we know. */
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#ifndef YY_LOCATION_PRINT
|
|
|
|
|
# if YYLTYPE_IS_TRIVIAL
|
|
|
|
|
# define YY_LOCATION_PRINT(File, Loc) \
|
|
|
|
|
fprintf (File, "%d.%d-%d.%d", \
|
|
|
|
|
(Loc).first_line, (Loc).first_column, \
|
|
|
|
|
(Loc).last_line, (Loc).last_column)
|
|
|
|
|
# else
|
|
|
|
|
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
|
|
|
|
|
# endif
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* YYLEX -- calling `yylex' with the right arguments. */
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#ifdef YYLEX_PARAM
|
|
|
|
|
# define YYLEX yylex (&yylval, YYLEX_PARAM)
|
|
|
|
|
#else
|
|
|
|
|
# define YYLEX yylex (&yylval)
|
|
|
|
|
#endif
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
|
|
|
|
/* Enable debugging if requested. */
|
|
|
|
|
#if YYDEBUG
|
|
|
|
|
|
|
|
|
|
# ifndef YYFPRINTF
|
|
|
|
|
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# define YYFPRINTF fprintf
|
|
|
|
|
# endif
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
# define YYDPRINTF(Args) \
|
|
|
|
|
do { \
|
|
|
|
|
if (yydebug) \
|
|
|
|
|
YYFPRINTF Args; \
|
|
|
|
|
} while (YYID (0))
|
|
|
|
|
|
|
|
|
|
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
|
|
|
|
|
do { \
|
|
|
|
|
if (yydebug) \
|
|
|
|
|
{ \
|
|
|
|
|
YYFPRINTF (stderr, "%s ", Title); \
|
|
|
|
|
yy_symbol_print (stderr, \
|
|
|
|
|
Type, Value); \
|
|
|
|
|
YYFPRINTF (stderr, "\n"); \
|
|
|
|
|
} \
|
|
|
|
|
} while (YYID (0))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*--------------------------------.
|
|
|
|
|
| Print this symbol on YYOUTPUT. |
|
|
|
|
|
`--------------------------------*/
|
|
|
|
|
|
|
|
|
|
/*ARGSUSED*/
|
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
|
static void
|
|
|
|
|
yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
|
|
|
|
|
#else
|
|
|
|
|
static void
|
|
|
|
|
yy_symbol_value_print (yyoutput, yytype, yyvaluep)
|
|
|
|
|
FILE *yyoutput;
|
|
|
|
|
int yytype;
|
|
|
|
|
YYSTYPE const * const yyvaluep;
|
|
|
|
|
#endif
|
|
|
|
|
{
|
|
|
|
|
if (!yyvaluep)
|
|
|
|
|
return;
|
|
|
|
|
# ifdef YYPRINT
|
|
|
|
|
if (yytype < YYNTOKENS)
|
|
|
|
|
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
|
|
|
|
|
# else
|
|
|
|
|
YYUSE (yyoutput);
|
|
|
|
|
# endif
|
|
|
|
|
switch (yytype)
|
|
|
|
|
{
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*--------------------------------.
|
|
|
|
|
| Print this symbol on YYOUTPUT. |
|
|
|
|
|
`--------------------------------*/
|
|
|
|
|
|
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
|
static void
|
|
|
|
|
yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
|
|
|
|
|
#else
|
|
|
|
|
static void
|
|
|
|
|
yy_symbol_print (yyoutput, yytype, yyvaluep)
|
|
|
|
|
FILE *yyoutput;
|
|
|
|
|
int yytype;
|
|
|
|
|
YYSTYPE const * const yyvaluep;
|
|
|
|
|
#endif
|
|
|
|
|
{
|
|
|
|
|
if (yytype < YYNTOKENS)
|
|
|
|
|
YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
|
|
|
|
|
else
|
|
|
|
|
YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
|
|
|
|
|
|
|
|
|
|
yy_symbol_value_print (yyoutput, yytype, yyvaluep);
|
|
|
|
|
YYFPRINTF (yyoutput, ")");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*------------------------------------------------------------------.
|
|
|
|
|
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
|
|
|
|
|
| TOP (included). |
|
|
|
|
|
`------------------------------------------------------------------*/
|
|
|
|
|
|
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
|
static void
|
|
|
|
|
yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
|
|
|
|
|
#else
|
|
|
|
|
static void
|
|
|
|
|
yy_stack_print (yybottom, yytop)
|
|
|
|
|
yytype_int16 *yybottom;
|
|
|
|
|
yytype_int16 *yytop;
|
|
|
|
|
#endif
|
|
|
|
|
{
|
|
|
|
|
YYFPRINTF (stderr, "Stack now");
|
|
|
|
|
for (; yybottom <= yytop; yybottom++)
|
|
|
|
|
{
|
|
|
|
|
int yybot = *yybottom;
|
|
|
|
|
YYFPRINTF (stderr, " %d", yybot);
|
|
|
|
|
}
|
|
|
|
|
YYFPRINTF (stderr, "\n");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
# define YY_STACK_PRINT(Bottom, Top) \
|
|
|
|
|
do { \
|
|
|
|
|
if (yydebug) \
|
|
|
|
|
yy_stack_print ((Bottom), (Top)); \
|
|
|
|
|
} while (YYID (0))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*------------------------------------------------.
|
|
|
|
|
| Report that the YYRULE is going to be reduced. |
|
|
|
|
|
`------------------------------------------------*/
|
|
|
|
|
|
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
|
static void
|
|
|
|
|
yy_reduce_print (YYSTYPE *yyvsp, int yyrule)
|
|
|
|
|
#else
|
|
|
|
|
static void
|
|
|
|
|
yy_reduce_print (yyvsp, yyrule)
|
|
|
|
|
YYSTYPE *yyvsp;
|
|
|
|
|
int yyrule;
|
|
|
|
|
#endif
|
|
|
|
|
{
|
|
|
|
|
int yynrhs = yyr2[yyrule];
|
|
|
|
|
int yyi;
|
|
|
|
|
unsigned long int yylno = yyrline[yyrule];
|
|
|
|
|
YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
|
|
|
|
|
yyrule - 1, yylno);
|
|
|
|
|
/* The symbols being reduced. */
|
|
|
|
|
for (yyi = 0; yyi < yynrhs; yyi++)
|
|
|
|
|
{
|
|
|
|
|
fprintf (stderr, " $%d = ", yyi + 1);
|
|
|
|
|
yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
|
|
|
|
|
&(yyvsp[(yyi + 1) - (yynrhs)])
|
|
|
|
|
);
|
|
|
|
|
fprintf (stderr, "\n");
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
# define YY_REDUCE_PRINT(Rule) \
|
|
|
|
|
do { \
|
|
|
|
|
if (yydebug) \
|
|
|
|
|
yy_reduce_print (yyvsp, Rule); \
|
|
|
|
|
} while (YYID (0))
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/* Nonzero means print parse trace. It is left uninitialized so that
|
|
|
|
|
multiple parsers can coexist. */
|
|
|
|
|
int yydebug;
|
|
|
|
|
#else /* !YYDEBUG */
|
|
|
|
|
# define YYDPRINTF(Args)
|
2012-12-14 16:08:23 +01:00
|
|
|
|
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
|
|
|
|
|
# define YY_STACK_PRINT(Bottom, Top)
|
|
|
|
|
# define YY_REDUCE_PRINT(Rule)
|
2003-10-25 18:34:36 +02:00
|
|
|
|
#endif /* !YYDEBUG */
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/* YYINITDEPTH -- initial size of the parser's stacks. */
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#ifndef YYINITDEPTH
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# define YYINITDEPTH 200
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#endif
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/* 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
|
2012-12-14 16:08:23 +01:00
|
|
|
|
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
|
2003-10-25 18:34:36 +02:00
|
|
|
|
evaluated with infinite-precision integer arithmetic. */
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
#ifndef YYMAXDEPTH
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# define YYMAXDEPTH 10000
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#endif
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
#if YYERROR_VERBOSE
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# ifndef yystrlen
|
2012-12-14 16:08:23 +01:00
|
|
|
|
# if defined __GLIBC__ && defined _STRING_H
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# define yystrlen strlen
|
|
|
|
|
# else
|
|
|
|
|
/* Return the length of YYSTR. */
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
2003-10-25 18:34:36 +02:00
|
|
|
|
static YYSIZE_T
|
|
|
|
|
yystrlen (const char *yystr)
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#else
|
|
|
|
|
static YYSIZE_T
|
2003-10-25 18:34:36 +02:00
|
|
|
|
yystrlen (yystr)
|
2012-12-14 16:08:23 +01:00
|
|
|
|
const char *yystr;
|
|
|
|
|
#endif
|
2003-10-25 18:34:36 +02:00
|
|
|
|
{
|
2012-12-14 16:08:23 +01:00
|
|
|
|
YYSIZE_T yylen;
|
|
|
|
|
for (yylen = 0; yystr[yylen]; yylen++)
|
2003-10-25 18:34:36 +02:00
|
|
|
|
continue;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
return yylen;
|
2003-10-25 18:34:36 +02:00
|
|
|
|
}
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
|
|
|
|
|
# ifndef yystpcpy
|
2012-12-14 16:08:23 +01:00
|
|
|
|
# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# define yystpcpy stpcpy
|
|
|
|
|
# else
|
|
|
|
|
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
|
|
|
|
|
YYDEST. */
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
2003-10-25 18:34:36 +02:00
|
|
|
|
static char *
|
|
|
|
|
yystpcpy (char *yydest, const char *yysrc)
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#else
|
|
|
|
|
static char *
|
2003-10-25 18:34:36 +02:00
|
|
|
|
yystpcpy (yydest, yysrc)
|
2012-12-14 16:08:23 +01:00
|
|
|
|
char *yydest;
|
|
|
|
|
const char *yysrc;
|
|
|
|
|
#endif
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
2012-12-14 16:08:23 +01:00
|
|
|
|
char *yyd = yydest;
|
|
|
|
|
const char *yys = yysrc;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
while ((*yyd++ = *yys++) != '\0')
|
|
|
|
|
continue;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
return yyd - 1;
|
|
|
|
|
}
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
# ifndef yytnamerr
|
|
|
|
|
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
|
|
|
|
|
quotes and backslashes, so that it's suitable for yyerror. The
|
|
|
|
|
heuristic is that double-quoting is unnecessary unless the string
|
|
|
|
|
contains an apostrophe, a comma, or backslash (other than
|
|
|
|
|
backslash-backslash). YYSTR is taken from yytname. If YYRES is
|
|
|
|
|
null, do not copy; instead, return the length of what the result
|
|
|
|
|
would have been. */
|
|
|
|
|
static YYSIZE_T
|
|
|
|
|
yytnamerr (char *yyres, const char *yystr)
|
|
|
|
|
{
|
|
|
|
|
if (*yystr == '"')
|
|
|
|
|
{
|
|
|
|
|
YYSIZE_T yyn = 0;
|
|
|
|
|
char const *yyp = yystr;
|
|
|
|
|
|
|
|
|
|
for (;;)
|
|
|
|
|
switch (*++yyp)
|
|
|
|
|
{
|
|
|
|
|
case '\'':
|
|
|
|
|
case ',':
|
|
|
|
|
goto do_not_strip_quotes;
|
|
|
|
|
|
|
|
|
|
case '\\':
|
|
|
|
|
if (*++yyp != '\\')
|
|
|
|
|
goto do_not_strip_quotes;
|
|
|
|
|
/* Fall through. */
|
|
|
|
|
default:
|
|
|
|
|
if (yyres)
|
|
|
|
|
yyres[yyn] = *yyp;
|
|
|
|
|
yyn++;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case '"':
|
|
|
|
|
if (yyres)
|
|
|
|
|
yyres[yyn] = '\0';
|
|
|
|
|
return yyn;
|
|
|
|
|
}
|
|
|
|
|
do_not_strip_quotes: ;
|
|
|
|
|
}
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
if (! yyres)
|
|
|
|
|
return yystrlen (yystr);
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
return yystpcpy (yyres, yystr) - yyres;
|
|
|
|
|
}
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# endif
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
/* Copy into YYRESULT an error message about the unexpected token
|
|
|
|
|
YYCHAR while in state YYSTATE. Return the number of bytes copied,
|
|
|
|
|
including the terminating null byte. If YYRESULT is null, do not
|
|
|
|
|
copy anything; just return the number of bytes that would be
|
|
|
|
|
copied. As a special case, return 0 if an ordinary "syntax error"
|
|
|
|
|
message will do. Return YYSIZE_MAXIMUM if overflow occurs during
|
|
|
|
|
size calculation. */
|
|
|
|
|
static YYSIZE_T
|
|
|
|
|
yysyntax_error (char *yyresult, int yystate, int yychar)
|
|
|
|
|
{
|
|
|
|
|
int yyn = yypact[yystate];
|
|
|
|
|
|
|
|
|
|
if (! (YYPACT_NINF < yyn && yyn <= YYLAST))
|
|
|
|
|
return 0;
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
int yytype = YYTRANSLATE (yychar);
|
|
|
|
|
YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]);
|
|
|
|
|
YYSIZE_T yysize = yysize0;
|
|
|
|
|
YYSIZE_T yysize1;
|
|
|
|
|
int yysize_overflow = 0;
|
|
|
|
|
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
|
|
|
|
|
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
|
|
|
|
|
int yyx;
|
|
|
|
|
|
|
|
|
|
# if 0
|
|
|
|
|
/* This is so xgettext sees the translatable formats that are
|
|
|
|
|
constructed on the fly. */
|
|
|
|
|
YY_("syntax error, unexpected %s");
|
|
|
|
|
YY_("syntax error, unexpected %s, expecting %s");
|
|
|
|
|
YY_("syntax error, unexpected %s, expecting %s or %s");
|
|
|
|
|
YY_("syntax error, unexpected %s, expecting %s or %s or %s");
|
|
|
|
|
YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s");
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# endif
|
2012-12-14 16:08:23 +01:00
|
|
|
|
char *yyfmt;
|
|
|
|
|
char const *yyf;
|
|
|
|
|
static char const yyunexpected[] = "syntax error, unexpected %s";
|
|
|
|
|
static char const yyexpecting[] = ", expecting %s";
|
|
|
|
|
static char const yyor[] = " or %s";
|
|
|
|
|
char yyformat[sizeof yyunexpected
|
|
|
|
|
+ sizeof yyexpecting - 1
|
|
|
|
|
+ ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2)
|
|
|
|
|
* (sizeof yyor - 1))];
|
|
|
|
|
char const *yyprefix = yyexpecting;
|
|
|
|
|
|
|
|
|
|
/* 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 + 1;
|
|
|
|
|
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
|
|
|
|
|
int yycount = 1;
|
|
|
|
|
|
|
|
|
|
yyarg[0] = yytname[yytype];
|
|
|
|
|
yyfmt = yystpcpy (yyformat, yyunexpected);
|
|
|
|
|
|
|
|
|
|
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
|
|
|
|
|
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
|
|
|
|
{
|
|
|
|
|
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
|
|
|
|
|
{
|
|
|
|
|
yycount = 1;
|
|
|
|
|
yysize = yysize0;
|
|
|
|
|
yyformat[sizeof yyunexpected - 1] = '\0';
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
yyarg[yycount++] = yytname[yyx];
|
|
|
|
|
yysize1 = yysize + yytnamerr (0, yytname[yyx]);
|
|
|
|
|
yysize_overflow |= (yysize1 < yysize);
|
|
|
|
|
yysize = yysize1;
|
|
|
|
|
yyfmt = yystpcpy (yyfmt, yyprefix);
|
|
|
|
|
yyprefix = yyor;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
yyf = YY_(yyformat);
|
|
|
|
|
yysize1 = yysize + yystrlen (yyf);
|
|
|
|
|
yysize_overflow |= (yysize1 < yysize);
|
|
|
|
|
yysize = yysize1;
|
|
|
|
|
|
|
|
|
|
if (yysize_overflow)
|
|
|
|
|
return YYSIZE_MAXIMUM;
|
|
|
|
|
|
|
|
|
|
if (yyresult)
|
|
|
|
|
{
|
|
|
|
|
/* Avoid sprintf, as that infringes on the user's name space.
|
|
|
|
|
Don't have undefined behavior even if the translation
|
|
|
|
|
produced a string with the wrong number of "%s"s. */
|
|
|
|
|
char *yyp = yyresult;
|
|
|
|
|
int yyi = 0;
|
|
|
|
|
while ((*yyp = *yyf) != '\0')
|
|
|
|
|
{
|
|
|
|
|
if (*yyp == '%' && yyf[1] == 's' && yyi < yycount)
|
|
|
|
|
{
|
|
|
|
|
yyp += yytnamerr (yyp, yyarg[yyi++]);
|
|
|
|
|
yyf += 2;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
yyp++;
|
|
|
|
|
yyf++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return yysize;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
#endif /* YYERROR_VERBOSE */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------------------.
|
|
|
|
|
| Release the memory associated to this symbol. |
|
|
|
|
|
`-----------------------------------------------*/
|
|
|
|
|
|
|
|
|
|
/*ARGSUSED*/
|
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
|
static void
|
|
|
|
|
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
|
|
|
|
|
#else
|
|
|
|
|
static void
|
|
|
|
|
yydestruct (yymsg, yytype, yyvaluep)
|
|
|
|
|
const char *yymsg;
|
|
|
|
|
int yytype;
|
|
|
|
|
YYSTYPE *yyvaluep;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#endif
|
2012-12-14 16:08:23 +01:00
|
|
|
|
{
|
|
|
|
|
YYUSE (yyvaluep);
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
if (!yymsg)
|
|
|
|
|
yymsg = "Deleting";
|
|
|
|
|
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
|
|
|
|
|
|
|
|
|
|
switch (yytype)
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Prevent warnings from -Wmissing-prototypes. */
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#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);
|
2003-10-25 18:34:36 +02:00
|
|
|
|
#else
|
2012-12-14 16:08:23 +01:00
|
|
|
|
int yyparse ();
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#endif
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#endif /* ! YYPARSE_PARAM */
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*----------.
|
|
|
|
|
| yyparse. |
|
|
|
|
|
`----------*/
|
|
|
|
|
|
|
|
|
|
#ifdef YYPARSE_PARAM
|
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
|
int
|
|
|
|
|
yyparse (void *YYPARSE_PARAM)
|
|
|
|
|
#else
|
|
|
|
|
int
|
|
|
|
|
yyparse (YYPARSE_PARAM)
|
|
|
|
|
void *YYPARSE_PARAM;
|
|
|
|
|
#endif
|
|
|
|
|
#else /* ! YYPARSE_PARAM */
|
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
int
|
2012-12-14 16:08:23 +01:00
|
|
|
|
yyparse (void)
|
|
|
|
|
#else
|
|
|
|
|
int
|
|
|
|
|
yyparse ()
|
|
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
#endif
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* The lookahead symbol. */
|
|
|
|
|
int yychar;
|
|
|
|
|
|
|
|
|
|
/* The semantic value of the lookahead symbol. */
|
|
|
|
|
YYSTYPE yylval;
|
|
|
|
|
|
|
|
|
|
/* Number of syntax errors so far. */
|
|
|
|
|
int yynerrs;
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
int yystate;
|
|
|
|
|
int yyn;
|
2003-10-25 18:34:36 +02:00
|
|
|
|
int yyresult;
|
|
|
|
|
/* Number of tokens to shift before error messages enabled. */
|
|
|
|
|
int yyerrstatus;
|
|
|
|
|
/* Lookahead token as an internal (translated) token number. */
|
2012-12-14 16:08:23 +01:00
|
|
|
|
int yytoken = 0;
|
|
|
|
|
#if YYERROR_VERBOSE
|
|
|
|
|
/* Buffer for error messages, and its allocated size. */
|
|
|
|
|
char yymsgbuf[128];
|
|
|
|
|
char *yymsg = yymsgbuf;
|
|
|
|
|
YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
|
|
|
|
|
#endif
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
|
|
|
|
/* 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. */
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* The state stack. */
|
|
|
|
|
yytype_int16 yyssa[YYINITDEPTH];
|
|
|
|
|
yytype_int16 *yyss = yyssa;
|
|
|
|
|
yytype_int16 *yyssp;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/* The semantic value stack. */
|
|
|
|
|
YYSTYPE yyvsa[YYINITDEPTH];
|
|
|
|
|
YYSTYPE *yyvs = yyvsa;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
YYSTYPE *yyvsp;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
YYSIZE_T yystacksize = YYINITDEPTH;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/* The variables used to return semantic value and location from the
|
|
|
|
|
action routines. */
|
|
|
|
|
YYSTYPE yyval;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
/* The number of symbols on the RHS of the reduced rule.
|
|
|
|
|
Keep to zero when no symbol should be popped. */
|
|
|
|
|
int yylen = 0;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
YYDPRINTF ((stderr, "Starting parse\n"));
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
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. */
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
yyssp = yyss;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
yyvsp = yyvs;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
goto yysetstate;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/*------------------------------------------------------------.
|
|
|
|
|
| yynewstate -- Push a new state, which is found in yystate. |
|
|
|
|
|
`------------------------------------------------------------*/
|
|
|
|
|
yynewstate:
|
|
|
|
|
/* In all cases, when you get here, the value and location stacks
|
2012-12-14 16:08:23 +01:00
|
|
|
|
have just been pushed. So pushing a state here evens the stacks. */
|
2003-10-25 18:34:36 +02:00
|
|
|
|
yyssp++;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
yysetstate:
|
|
|
|
|
*yyssp = yystate;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
if (yyss + yystacksize - 1 <= yyssp)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
|
|
|
|
/* Get the current used size of the three stacks, in elements. */
|
2003-10-25 18:34:36 +02:00
|
|
|
|
YYSIZE_T yysize = yyssp - yyss + 1;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
#ifdef yyoverflow
|
2003-10-25 18:34:36 +02:00
|
|
|
|
{
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* Give user a chance to reallocate the stack. Use copies of
|
2003-10-25 18:34:36 +02:00
|
|
|
|
these so that the &'s don't force the real ones into
|
|
|
|
|
memory. */
|
|
|
|
|
YYSTYPE *yyvs1 = yyvs;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
yytype_int16 *yyss1 = yyss;
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
|
|
|
|
/* Each stack pointer address is followed by the size of the
|
2012-12-14 16:08:23 +01:00
|
|
|
|
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 (YY_("memory exhausted"),
|
2003-10-25 18:34:36 +02:00
|
|
|
|
&yyss1, yysize * sizeof (*yyssp),
|
|
|
|
|
&yyvs1, yysize * sizeof (*yyvsp),
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
&yystacksize);
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
yyss = yyss1;
|
|
|
|
|
yyvs = yyvs1;
|
|
|
|
|
}
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#else /* no yyoverflow */
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# ifndef YYSTACK_RELOCATE
|
2012-12-14 16:08:23 +01:00
|
|
|
|
goto yyexhaustedlab;
|
2003-10-25 18:34:36 +02:00
|
|
|
|
# else
|
2002-08-23 10:02:08 +02:00
|
|
|
|
/* Extend the stack our own way. */
|
2012-12-14 16:08:23 +01:00
|
|
|
|
if (YYMAXDEPTH <= yystacksize)
|
|
|
|
|
goto yyexhaustedlab;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
yystacksize *= 2;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
if (YYMAXDEPTH < yystacksize)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
yystacksize = YYMAXDEPTH;
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
|
|
|
|
{
|
2012-12-14 16:08:23 +01:00
|
|
|
|
yytype_int16 *yyss1 = yyss;
|
2003-10-25 18:34:36 +02:00
|
|
|
|
union yyalloc *yyptr =
|
|
|
|
|
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
|
|
|
|
|
if (! yyptr)
|
2012-12-14 16:08:23 +01:00
|
|
|
|
goto yyexhaustedlab;
|
2003-10-25 18:34:36 +02:00
|
|
|
|
YYSTACK_RELOCATE (yyss);
|
|
|
|
|
YYSTACK_RELOCATE (yyvs);
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
# undef YYSTACK_RELOCATE
|
2003-10-25 18:34:36 +02:00
|
|
|
|
if (yyss1 != yyssa)
|
|
|
|
|
YYSTACK_FREE (yyss1);
|
|
|
|
|
}
|
|
|
|
|
# endif
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#endif /* no yyoverflow */
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
yyssp = yyss + yysize - 1;
|
|
|
|
|
yyvsp = yyvs + yysize - 1;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
|
|
|
|
|
(unsigned long int) yystacksize));
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
if (yyss + yystacksize - 1 <= yyssp)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
YYABORT;
|
|
|
|
|
}
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
if (yystate == YYFINAL)
|
|
|
|
|
YYACCEPT;
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
goto yybackup;
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
|
|
|
|
/*-----------.
|
|
|
|
|
| yybackup. |
|
|
|
|
|
`-----------*/
|
|
|
|
|
yybackup:
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* Do appropriate processing given the current state. Read a
|
|
|
|
|
lookahead token if we need one and don't already have one. */
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
/* First try to decide what to do without reference to lookahead token. */
|
|
|
|
|
yyn = yypact[yystate];
|
2012-12-14 16:08:23 +01:00
|
|
|
|
if (yyn == YYPACT_NINF)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
goto yydefault;
|
|
|
|
|
|
|
|
|
|
/* Not known => get a lookahead token if don't already have one. */
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */
|
2002-08-23 10:02:08 +02:00
|
|
|
|
if (yychar == YYEMPTY)
|
|
|
|
|
{
|
2003-10-25 18:34:36 +02:00
|
|
|
|
YYDPRINTF ((stderr, "Reading a token: "));
|
2002-08-23 10:02:08 +02:00
|
|
|
|
yychar = YYLEX;
|
|
|
|
|
}
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
if (yychar <= YYEOF)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
2012-12-14 16:08:23 +01:00
|
|
|
|
yychar = yytoken = YYEOF;
|
2003-10-25 18:34:36 +02:00
|
|
|
|
YYDPRINTF ((stderr, "Now at end of input.\n"));
|
2002-08-23 10:02:08 +02:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
2012-12-14 16:08:23 +01:00
|
|
|
|
yytoken = YYTRANSLATE (yychar);
|
|
|
|
|
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
|
2002-08-23 10:02:08 +02:00
|
|
|
|
}
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* 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)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
goto yydefault;
|
|
|
|
|
yyn = yytable[yyn];
|
2012-12-14 16:08:23 +01:00
|
|
|
|
if (yyn <= 0)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
2012-12-14 16:08:23 +01:00
|
|
|
|
if (yyn == 0 || yyn == YYTABLE_NINF)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
goto yyerrlab;
|
|
|
|
|
yyn = -yyn;
|
|
|
|
|
goto yyreduce;
|
|
|
|
|
}
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/* Count tokens shifted since error; after three, turn off error
|
|
|
|
|
status. */
|
|
|
|
|
if (yyerrstatus)
|
|
|
|
|
yyerrstatus--;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* Shift the lookahead token. */
|
|
|
|
|
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
|
|
|
|
|
|
|
|
|
|
/* Discard the shifted token. */
|
|
|
|
|
yychar = YYEMPTY;
|
|
|
|
|
|
2002-08-23 10:02:08 +02:00
|
|
|
|
yystate = yyn;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
*++yyvsp = yylval;
|
|
|
|
|
|
2002-08-23 10:02:08 +02:00
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/*-----------------------------------------------------------.
|
|
|
|
|
| yydefault -- do the default action for the current state. |
|
|
|
|
|
`-----------------------------------------------------------*/
|
|
|
|
|
yydefault:
|
2002-08-23 10:02:08 +02:00
|
|
|
|
yyn = yydefact[yystate];
|
|
|
|
|
if (yyn == 0)
|
|
|
|
|
goto yyerrlab;
|
2003-10-25 18:34:36 +02:00
|
|
|
|
goto yyreduce;
|
|
|
|
|
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/*-----------------------------.
|
|
|
|
|
| yyreduce -- Do a reduction. |
|
|
|
|
|
`-----------------------------*/
|
2002-08-23 10:02:08 +02:00
|
|
|
|
yyreduce:
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/* yyn is the number of a rule to reduce with. */
|
2002-08-23 10:02:08 +02:00
|
|
|
|
yylen = yyr2[yyn];
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/* If YYLEN is nonzero, implement the default value of the action:
|
|
|
|
|
`$$ = $1'.
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
Otherwise, the following line sets YYVAL to garbage.
|
|
|
|
|
This behavior is undocumented and Bison
|
2003-10-25 18:34:36 +02:00
|
|
|
|
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];
|
|
|
|
|
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
YY_REDUCE_PRINT (yyn);
|
|
|
|
|
switch (yyn)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
2012-12-14 16:08:23 +01:00
|
|
|
|
case 2:
|
|
|
|
|
/* Line 1269 of yacc.c. */
|
|
|
|
|
#line 155 "plural.y"
|
|
|
|
|
{
|
|
|
|
|
if ((yyvsp[(1) - (1)].exp) == NULL)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
YYABORT;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
((struct parse_args *) arg)->res = (yyvsp[(1) - (1)].exp);
|
2003-10-25 18:34:36 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
case 3:
|
|
|
|
|
/* Line 1269 of yacc.c. */
|
|
|
|
|
#line 163 "plural.y"
|
|
|
|
|
{
|
|
|
|
|
(yyval.exp) = new_exp_3 (qmop, (yyvsp[(1) - (5)].exp), (yyvsp[(3) - (5)].exp), (yyvsp[(5) - (5)].exp));
|
2003-10-25 18:34:36 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
case 4:
|
|
|
|
|
/* Line 1269 of yacc.c. */
|
|
|
|
|
#line 167 "plural.y"
|
|
|
|
|
{
|
|
|
|
|
(yyval.exp) = new_exp_2 (lor, (yyvsp[(1) - (3)].exp), (yyvsp[(3) - (3)].exp));
|
2003-10-25 18:34:36 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
case 5:
|
|
|
|
|
/* Line 1269 of yacc.c. */
|
|
|
|
|
#line 171 "plural.y"
|
|
|
|
|
{
|
|
|
|
|
(yyval.exp) = new_exp_2 (land, (yyvsp[(1) - (3)].exp), (yyvsp[(3) - (3)].exp));
|
2003-10-25 18:34:36 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
case 6:
|
|
|
|
|
/* Line 1269 of yacc.c. */
|
|
|
|
|
#line 175 "plural.y"
|
|
|
|
|
{
|
|
|
|
|
(yyval.exp) = new_exp_2 ((yyvsp[(2) - (3)].op), (yyvsp[(1) - (3)].exp), (yyvsp[(3) - (3)].exp));
|
2003-10-25 18:34:36 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
case 7:
|
|
|
|
|
/* Line 1269 of yacc.c. */
|
|
|
|
|
#line 179 "plural.y"
|
|
|
|
|
{
|
|
|
|
|
(yyval.exp) = new_exp_2 ((yyvsp[(2) - (3)].op), (yyvsp[(1) - (3)].exp), (yyvsp[(3) - (3)].exp));
|
2003-10-25 18:34:36 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
case 8:
|
|
|
|
|
/* Line 1269 of yacc.c. */
|
|
|
|
|
#line 183 "plural.y"
|
|
|
|
|
{
|
|
|
|
|
(yyval.exp) = new_exp_2 ((yyvsp[(2) - (3)].op), (yyvsp[(1) - (3)].exp), (yyvsp[(3) - (3)].exp));
|
2003-10-25 18:34:36 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
case 9:
|
|
|
|
|
/* Line 1269 of yacc.c. */
|
|
|
|
|
#line 187 "plural.y"
|
|
|
|
|
{
|
|
|
|
|
(yyval.exp) = new_exp_2 ((yyvsp[(2) - (3)].op), (yyvsp[(1) - (3)].exp), (yyvsp[(3) - (3)].exp));
|
2003-10-25 18:34:36 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
case 10:
|
|
|
|
|
/* Line 1269 of yacc.c. */
|
|
|
|
|
#line 191 "plural.y"
|
|
|
|
|
{
|
|
|
|
|
(yyval.exp) = new_exp_1 (lnot, (yyvsp[(2) - (2)].exp));
|
2003-10-25 18:34:36 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
case 11:
|
|
|
|
|
/* Line 1269 of yacc.c. */
|
|
|
|
|
#line 195 "plural.y"
|
|
|
|
|
{
|
|
|
|
|
(yyval.exp) = new_exp_0 (var);
|
2003-10-25 18:34:36 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
case 12:
|
|
|
|
|
/* Line 1269 of yacc.c. */
|
|
|
|
|
#line 199 "plural.y"
|
|
|
|
|
{
|
|
|
|
|
if (((yyval.exp) = new_exp_0 (num)) != NULL)
|
|
|
|
|
(yyval.exp)->val.num = (yyvsp[(1) - (1)].num);
|
2003-10-25 18:34:36 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
case 13:
|
|
|
|
|
/* Line 1269 of yacc.c. */
|
|
|
|
|
#line 204 "plural.y"
|
|
|
|
|
{
|
|
|
|
|
(yyval.exp) = (yyvsp[(2) - (3)].exp);
|
2003-10-25 18:34:36 +02:00
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* Line 1269 of yacc.c. */
|
|
|
|
|
#line 1572 "plural.c"
|
|
|
|
|
default: break;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
}
|
2012-12-14 16:08:23 +01:00
|
|
|
|
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
|
|
|
|
|
|
|
|
|
|
YYPOPSTACK (yylen);
|
|
|
|
|
yylen = 0;
|
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
*++yyvsp = yyval;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/* 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. */
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
yyn = yyr1[yyn];
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
|
|
|
|
|
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
yystate = yytable[yystate];
|
|
|
|
|
else
|
2012-12-14 16:08:23 +01:00
|
|
|
|
yystate = yydefgoto[yyn - YYNTOKENS];
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/*------------------------------------.
|
|
|
|
|
| yyerrlab -- here on detecting error |
|
|
|
|
|
`------------------------------------*/
|
|
|
|
|
yyerrlab:
|
|
|
|
|
/* If not already recovering from an error, report this error. */
|
|
|
|
|
if (!yyerrstatus)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
|
|
|
|
++yynerrs;
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#if ! YYERROR_VERBOSE
|
|
|
|
|
yyerror (YY_("syntax error"));
|
|
|
|
|
#else
|
|
|
|
|
{
|
|
|
|
|
YYSIZE_T yysize = yysyntax_error (0, yystate, yychar);
|
|
|
|
|
if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM)
|
|
|
|
|
{
|
|
|
|
|
YYSIZE_T yyalloc = 2 * yysize;
|
|
|
|
|
if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM))
|
|
|
|
|
yyalloc = YYSTACK_ALLOC_MAXIMUM;
|
|
|
|
|
if (yymsg != yymsgbuf)
|
2003-10-25 18:34:36 +02:00
|
|
|
|
YYSTACK_FREE (yymsg);
|
2012-12-14 16:08:23 +01:00
|
|
|
|
yymsg = (char *) YYSTACK_ALLOC (yyalloc);
|
|
|
|
|
if (yymsg)
|
|
|
|
|
yymsg_alloc = yyalloc;
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
yymsg = yymsgbuf;
|
|
|
|
|
yymsg_alloc = sizeof yymsgbuf;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (0 < yysize && yysize <= yymsg_alloc)
|
|
|
|
|
{
|
|
|
|
|
(void) yysyntax_error (yymsg, yystate, yychar);
|
|
|
|
|
yyerror (yymsg);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
yyerror (YY_("syntax error"));
|
|
|
|
|
if (yysize != 0)
|
|
|
|
|
goto yyexhaustedlab;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
#endif
|
2002-08-23 10:02:08 +02:00
|
|
|
|
}
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
2002-08-23 10:02:08 +02:00
|
|
|
|
if (yyerrstatus == 3)
|
|
|
|
|
{
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/* If just tried and failed to reuse lookahead token after an
|
|
|
|
|
error, discard it. */
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
if (yychar <= YYEOF)
|
|
|
|
|
{
|
|
|
|
|
/* Return failure if at end of input. */
|
|
|
|
|
if (yychar == YYEOF)
|
|
|
|
|
YYABORT;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
yydestruct ("Error: discarding",
|
|
|
|
|
yytoken, &yylval);
|
|
|
|
|
yychar = YYEMPTY;
|
|
|
|
|
}
|
2002-08-23 10:02:08 +02:00
|
|
|
|
}
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/* Else will try to reuse lookahead token after shifting the error
|
|
|
|
|
token. */
|
2012-12-14 16:08:23 +01:00
|
|
|
|
goto yyerrlab1;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/*---------------------------------------------------.
|
|
|
|
|
| yyerrorlab -- error raised explicitly by YYERROR. |
|
|
|
|
|
`---------------------------------------------------*/
|
|
|
|
|
yyerrorlab:
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* Pacify compilers like GCC when the user code never invokes
|
|
|
|
|
YYERROR and the label yyerrorlab therefore never appears in user
|
|
|
|
|
code. */
|
|
|
|
|
if (/*CONSTCOND*/ 0)
|
|
|
|
|
goto yyerrorlab;
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* Do not reclaim the symbols of the rule which action triggered
|
|
|
|
|
this YYERROR. */
|
|
|
|
|
YYPOPSTACK (yylen);
|
|
|
|
|
yylen = 0;
|
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
|
|
|
|
yystate = *yyssp;
|
|
|
|
|
goto yyerrlab1;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/*-------------------------------------------------------------.
|
|
|
|
|
| yyerrlab1 -- common code for both syntax error and YYERROR. |
|
|
|
|
|
`-------------------------------------------------------------*/
|
|
|
|
|
yyerrlab1:
|
|
|
|
|
yyerrstatus = 3; /* Each real token shifted decrements this. */
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
for (;;)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
2012-12-14 16:08:23 +01:00
|
|
|
|
yyn = yypact[yystate];
|
|
|
|
|
if (yyn != YYPACT_NINF)
|
|
|
|
|
{
|
|
|
|
|
yyn += YYTERROR;
|
|
|
|
|
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
|
|
|
|
|
{
|
|
|
|
|
yyn = yytable[yyn];
|
|
|
|
|
if (0 < yyn)
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* Pop the current state because it cannot handle the error token. */
|
|
|
|
|
if (yyssp == yyss)
|
|
|
|
|
YYABORT;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
yydestruct ("Error: popping",
|
|
|
|
|
yystos[yystate], yyvsp);
|
|
|
|
|
YYPOPSTACK (1);
|
|
|
|
|
yystate = *yyssp;
|
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
2002-08-23 10:02:08 +02:00
|
|
|
|
}
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
*++yyvsp = yylval;
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
/* Shift the error token. */
|
|
|
|
|
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
yystate = yyn;
|
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
|
2003-10-25 18:34:36 +02:00
|
|
|
|
/*-------------------------------------.
|
|
|
|
|
| yyacceptlab -- YYACCEPT comes here. |
|
|
|
|
|
`-------------------------------------*/
|
|
|
|
|
yyacceptlab:
|
|
|
|
|
yyresult = 0;
|
|
|
|
|
goto yyreturn;
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------.
|
|
|
|
|
| yyabortlab -- YYABORT comes here. |
|
|
|
|
|
`-----------------------------------*/
|
|
|
|
|
yyabortlab:
|
|
|
|
|
yyresult = 1;
|
|
|
|
|
goto yyreturn;
|
|
|
|
|
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#ifndef yyoverflow
|
|
|
|
|
/*-------------------------------------------------.
|
|
|
|
|
| yyexhaustedlab -- memory exhaustion comes here. |
|
|
|
|
|
`-------------------------------------------------*/
|
|
|
|
|
yyexhaustedlab:
|
|
|
|
|
yyerror (YY_("memory exhausted"));
|
2003-10-25 18:34:36 +02:00
|
|
|
|
yyresult = 2;
|
|
|
|
|
/* Fall through. */
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#endif
|
2003-10-25 18:34:36 +02:00
|
|
|
|
|
|
|
|
|
yyreturn:
|
2012-12-14 16:08:23 +01:00
|
|
|
|
if (yychar != YYEMPTY)
|
|
|
|
|
yydestruct ("Cleanup: discarding lookahead",
|
|
|
|
|
yytoken, &yylval);
|
|
|
|
|
/* Do not reclaim the symbols of the rule which action triggered
|
|
|
|
|
this YYABORT or YYACCEPT. */
|
|
|
|
|
YYPOPSTACK (yylen);
|
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
|
|
|
|
while (yyssp != yyss)
|
|
|
|
|
{
|
|
|
|
|
yydestruct ("Cleanup: popping",
|
|
|
|
|
yystos[*yyssp], yyvsp);
|
|
|
|
|
YYPOPSTACK (1);
|
|
|
|
|
}
|
2003-10-25 18:34:36 +02:00
|
|
|
|
#ifndef yyoverflow
|
|
|
|
|
if (yyss != yyssa)
|
|
|
|
|
YYSTACK_FREE (yyss);
|
2002-08-23 10:02:08 +02:00
|
|
|
|
#endif
|
2012-12-14 16:08:23 +01:00
|
|
|
|
#if YYERROR_VERBOSE
|
|
|
|
|
if (yymsg != yymsgbuf)
|
|
|
|
|
YYSTACK_FREE (yymsg);
|
|
|
|
|
#endif
|
|
|
|
|
/* Make sure YYID is used. */
|
|
|
|
|
return YYID (yyresult);
|
2002-08-23 10:02:08 +02:00
|
|
|
|
}
|
2012-12-14 16:08:23 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Line 1486 of yacc.c. */
|
|
|
|
|
#line 209 "plural.y"
|
2002-08-23 10:02:08 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
internal_function
|
2004-07-27 17:12:00 +02:00
|
|
|
|
FREE_EXPRESSION (struct expression *exp)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
|
|
|
|
if (exp == NULL)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
/* Handle the recursive case. */
|
|
|
|
|
switch (exp->nargs)
|
|
|
|
|
{
|
|
|
|
|
case 3:
|
|
|
|
|
FREE_EXPRESSION (exp->val.args[2]);
|
|
|
|
|
/* FALLTHROUGH */
|
|
|
|
|
case 2:
|
|
|
|
|
FREE_EXPRESSION (exp->val.args[1]);
|
|
|
|
|
/* FALLTHROUGH */
|
|
|
|
|
case 1:
|
|
|
|
|
FREE_EXPRESSION (exp->val.args[0]);
|
|
|
|
|
/* FALLTHROUGH */
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
free (exp);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static int
|
2004-07-27 17:12:00 +02:00
|
|
|
|
yylex (YYSTYPE *lval, const char **pexp)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
|
|
|
|
const char *exp = *pexp;
|
|
|
|
|
int result;
|
|
|
|
|
|
|
|
|
|
while (1)
|
|
|
|
|
{
|
|
|
|
|
if (exp[0] == '\0')
|
|
|
|
|
{
|
|
|
|
|
*pexp = exp;
|
|
|
|
|
return YYEOF;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (exp[0] != ' ' && exp[0] != '\t')
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
++exp;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
result = *exp++;
|
|
|
|
|
switch (result)
|
|
|
|
|
{
|
|
|
|
|
case '0': case '1': case '2': case '3': case '4':
|
|
|
|
|
case '5': case '6': case '7': case '8': case '9':
|
|
|
|
|
{
|
|
|
|
|
unsigned long int n = result - '0';
|
|
|
|
|
while (exp[0] >= '0' && exp[0] <= '9')
|
|
|
|
|
{
|
|
|
|
|
n *= 10;
|
|
|
|
|
n += exp[0] - '0';
|
|
|
|
|
++exp;
|
|
|
|
|
}
|
|
|
|
|
lval->num = n;
|
|
|
|
|
result = NUMBER;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case '=':
|
|
|
|
|
if (exp[0] == '=')
|
|
|
|
|
{
|
|
|
|
|
++exp;
|
|
|
|
|
lval->op = equal;
|
|
|
|
|
result = EQUOP2;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
result = YYERRCODE;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case '!':
|
|
|
|
|
if (exp[0] == '=')
|
|
|
|
|
{
|
|
|
|
|
++exp;
|
|
|
|
|
lval->op = not_equal;
|
|
|
|
|
result = EQUOP2;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case '&':
|
|
|
|
|
case '|':
|
|
|
|
|
if (exp[0] == result)
|
|
|
|
|
++exp;
|
|
|
|
|
else
|
|
|
|
|
result = YYERRCODE;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case '<':
|
|
|
|
|
if (exp[0] == '=')
|
|
|
|
|
{
|
|
|
|
|
++exp;
|
|
|
|
|
lval->op = less_or_equal;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
lval->op = less_than;
|
|
|
|
|
result = CMPOP2;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case '>':
|
|
|
|
|
if (exp[0] == '=')
|
|
|
|
|
{
|
|
|
|
|
++exp;
|
|
|
|
|
lval->op = greater_or_equal;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
lval->op = greater_than;
|
|
|
|
|
result = CMPOP2;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case '*':
|
|
|
|
|
lval->op = mult;
|
|
|
|
|
result = MULOP2;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case '/':
|
|
|
|
|
lval->op = divide;
|
|
|
|
|
result = MULOP2;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case '%':
|
|
|
|
|
lval->op = module;
|
|
|
|
|
result = MULOP2;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case '+':
|
|
|
|
|
lval->op = plus;
|
|
|
|
|
result = ADDOP2;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case '-':
|
|
|
|
|
lval->op = minus;
|
|
|
|
|
result = ADDOP2;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 'n':
|
|
|
|
|
case '?':
|
|
|
|
|
case ':':
|
|
|
|
|
case '(':
|
|
|
|
|
case ')':
|
|
|
|
|
/* Nothing, just return the character. */
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case ';':
|
|
|
|
|
case '\n':
|
|
|
|
|
case '\0':
|
|
|
|
|
/* Be safe and let the user call this function again. */
|
|
|
|
|
--exp;
|
|
|
|
|
result = YYEOF;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
result = YYERRCODE;
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
|
|
--exp;
|
|
|
|
|
#endif
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
*pexp = exp;
|
|
|
|
|
|
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static void
|
2004-07-27 17:12:00 +02:00
|
|
|
|
yyerror (const char *str)
|
2002-08-23 10:02:08 +02:00
|
|
|
|
{
|
|
|
|
|
/* Do nothing. We don't print error messages here. */
|
|
|
|
|
}
|