mirror of
https://git.lyx.org/repos/lyx.git
synced 2024-11-30 05:12:40 +00:00
70572847e2
git-svn-id: svn://svn.lyx.org/lyx/lyx-devel/trunk@10024 a592a061-630c-0410-9148-cb99ea01b6c8
1584 lines
38 KiB
C
1584 lines
38 KiB
C
/* A Bison parser, made by GNU Bison 1.875. */
|
||
|
||
/* Skeleton parser for Yacc-like parsing with Bison,
|
||
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 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 1
|
||
|
||
/* Using locations. */
|
||
#define YYLSP_NEEDED 0
|
||
|
||
/* If NAME_PREFIX is specified substitute the variables and functions
|
||
names. */
|
||
#define yyparse __gettextparse
|
||
#define yylex __gettextlex
|
||
#define yyerror __gettexterror
|
||
#define yylval __gettextlval
|
||
#define yychar __gettextchar
|
||
#define yydebug __gettextdebug
|
||
#define yynerrs __gettextnerrs
|
||
|
||
|
||
/* 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
|
||
#define EQUOP2 258
|
||
#define CMPOP2 259
|
||
#define ADDOP2 260
|
||
#define MULOP2 261
|
||
#define NUMBER 262
|
||
|
||
|
||
|
||
|
||
/* Copy the first part of user declarations. */
|
||
#line 1 "../../intl/plural.y"
|
||
|
||
/* Expression parsing for plural form selection.
|
||
Copyright (C) 2000-2001, 2003 Free Software Foundation, Inc.
|
||
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
|
||
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
|
||
USA. */
|
||
|
||
/* 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. */
|
||
#if defined _AIX && !defined __GNUC__
|
||
#pragma alloca
|
||
#endif
|
||
|
||
#ifdef HAVE_CONFIG_H
|
||
# include <config.h>
|
||
#endif
|
||
|
||
#include <stddef.h>
|
||
#include <stdlib.h>
|
||
#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
|
||
#endif
|
||
|
||
#define YYLEX_PARAM &((struct parse_args *) arg)->cp
|
||
#define YYPARSE_PARAM arg
|
||
|
||
|
||
/* 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 49 "../../intl/plural.y"
|
||
typedef union YYSTYPE {
|
||
unsigned long int num;
|
||
enum operator op;
|
||
struct expression *exp;
|
||
} YYSTYPE;
|
||
/* Line 191 of yacc.c. */
|
||
#line 150 "../../intl/plural.c"
|
||
# 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 55 "../../intl/plural.y"
|
||
|
||
/* Prototypes for local functions. */
|
||
static int yylex (YYSTYPE *lval, const char **pexp);
|
||
static void yyerror (const char *str);
|
||
|
||
/* Allocation of expressions. */
|
||
|
||
static struct expression *
|
||
new_exp (int nargs, enum operator op, struct expression * const *args)
|
||
{
|
||
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 *
|
||
new_exp_0 (enum operator op)
|
||
{
|
||
return new_exp (0, op, NULL);
|
||
}
|
||
|
||
static inline struct expression *
|
||
new_exp_1 (enum operator op, struct expression *right)
|
||
{
|
||
struct expression *args[1];
|
||
|
||
args[0] = right;
|
||
return new_exp (1, op, args);
|
||
}
|
||
|
||
static struct expression *
|
||
new_exp_2 (enum operator op, struct expression *left, struct expression *right)
|
||
{
|
||
struct expression *args[2];
|
||
|
||
args[0] = left;
|
||
args[1] = right;
|
||
return new_exp (2, op, args);
|
||
}
|
||
|
||
static inline struct expression *
|
||
new_exp_3 (enum operator op, struct expression *bexp,
|
||
struct expression *tbranch, struct expression *fbranch)
|
||
{
|
||
struct expression *args[3];
|
||
|
||
args[0] = bexp;
|
||
args[1] = tbranch;
|
||
args[2] = fbranch;
|
||
return new_exp (3, op, args);
|
||
}
|
||
|
||
|
||
|
||
/* Line 214 of yacc.c. */
|
||
#line 236 "../../intl/plural.c"
|
||
|
||
#if ! defined (yyoverflow) || YYERROR_VERBOSE
|
||
|
||
/* The parser invokes alloca or malloc; define the necessary symbols. */
|
||
|
||
# if YYSTACK_USE_ALLOCA
|
||
# define YYSTACK_ALLOC alloca
|
||
# else
|
||
# ifndef YYSTACK_USE_ALLOCA
|
||
# if defined (alloca) || defined (_ALLOCA_H)
|
||
# define YYSTACK_ALLOC alloca
|
||
# else
|
||
# ifdef __GNUC__
|
||
# define YYSTACK_ALLOC __builtin_alloca
|
||
# endif
|
||
# 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 malloc
|
||
# define YYSTACK_FREE free
|
||
# endif
|
||
#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */
|
||
|
||
|
||
#if (! defined (yyoverflow) \
|
||
&& (! defined (__cplusplus) \
|
||
|| (YYSTYPE_IS_TRIVIAL)))
|
||
|
||
/* A type that is properly aligned for any stack member. */
|
||
union yyalloc
|
||
{
|
||
short 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) + sizeof (YYSTYPE)) \
|
||
+ YYSTACK_GAP_MAXIMUM)
|
||
|
||
/* Copy COUNT objects from FROM to TO. The source and destination do
|
||
not overlap. */
|
||
# ifndef YYCOPY
|
||
# if 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 yysigned_char;
|
||
#endif
|
||
|
||
/* 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 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, 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 unsigned char 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 yysigned_char 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
|
||
};
|
||
|
||
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
|
||
static const unsigned char yyrline[] =
|
||
{
|
||
0, 150, 150, 158, 162, 166, 170, 174, 178, 182,
|
||
186, 190, 194, 199
|
||
};
|
||
#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", "'?'", "'|'", "'&'", "EQUOP2", "CMPOP2",
|
||
"ADDOP2", "MULOP2", "'!'", "NUMBER", "':'", "'n'", "'('", "')'",
|
||
"$accept", "start", "exp", 0
|
||
};
|
||
#endif
|
||
|
||
# ifdef YYPRINT
|
||
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
|
||
token YYLEX-NUM. */
|
||
static const unsigned short yytoknum[] =
|
||
{
|
||
0, 256, 257, 63, 124, 38, 258, 259, 260, 261,
|
||
33, 262, 58, 110, 40, 41
|
||
};
|
||
# endif
|
||
|
||
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
|
||
static const unsigned char 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 unsigned char 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 unsigned char 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 yysigned_char yydefgoto[] =
|
||
{
|
||
-1, 5, 6
|
||
};
|
||
|
||
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
||
STATE-NUM. */
|
||
#define YYPACT_NINF -10
|
||
static const yysigned_char 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 yysigned_char 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 unsigned char 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 yysigned_char 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 unsigned char 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
|
||
};
|
||
|
||
#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 yyerrlab1
|
||
|
||
|
||
/* Like YYERROR except do call yyerror. This remains here temporarily
|
||
to ease the transition to the new meaning of YYERROR, for GCC.
|
||
Once GCC version 2 has supplanted version 1, this can go. */
|
||
|
||
#define YYFAIL goto yyerrlab
|
||
|
||
#define YYRECOVERING() (!!yyerrstatus)
|
||
|
||
#define YYBACKUP(Token, Value) \
|
||
do \
|
||
if (yychar == YYEMPTY && yylen == 1) \
|
||
{ \
|
||
yychar = (Token); \
|
||
yylval = (Value); \
|
||
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 (&yylval, YYLEX_PARAM)
|
||
#else
|
||
# define YYLEX yylex (&yylval)
|
||
#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 (cinluded). |
|
||
`------------------------------------------------------------------*/
|
||
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
static void
|
||
yy_stack_print (short *bottom, short *top)
|
||
#else
|
||
static void
|
||
yy_stack_print (bottom, top)
|
||
short *bottom;
|
||
short *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 yylineno = yyrline[yyrule];
|
||
YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ",
|
||
yyrule - 1, yylineno);
|
||
/* 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 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 */
|
||
|
||
|
||
|
||
|
||
|
||
|
||
/*----------.
|
||
| 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
|
||
{
|
||
/* The lookahead symbol. */
|
||
int yychar;
|
||
|
||
/* The semantic value of the lookahead symbol. */
|
||
YYSTYPE yylval;
|
||
|
||
/* Number of syntax errors so far. */
|
||
int yynerrs;
|
||
|
||
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 yyssa[YYINITDEPTH];
|
||
short *yyss = yyssa;
|
||
register short *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 *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 *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 151 "../../intl/plural.y"
|
||
{
|
||
if (yyvsp[0].exp == NULL)
|
||
YYABORT;
|
||
((struct parse_args *) arg)->res = yyvsp[0].exp;
|
||
}
|
||
break;
|
||
|
||
case 3:
|
||
#line 159 "../../intl/plural.y"
|
||
{
|
||
yyval.exp = new_exp_3 (qmop, yyvsp[-4].exp, yyvsp[-2].exp, yyvsp[0].exp);
|
||
}
|
||
break;
|
||
|
||
case 4:
|
||
#line 163 "../../intl/plural.y"
|
||
{
|
||
yyval.exp = new_exp_2 (lor, yyvsp[-2].exp, yyvsp[0].exp);
|
||
}
|
||
break;
|
||
|
||
case 5:
|
||
#line 167 "../../intl/plural.y"
|
||
{
|
||
yyval.exp = new_exp_2 (land, yyvsp[-2].exp, yyvsp[0].exp);
|
||
}
|
||
break;
|
||
|
||
case 6:
|
||
#line 171 "../../intl/plural.y"
|
||
{
|
||
yyval.exp = new_exp_2 (yyvsp[-1].op, yyvsp[-2].exp, yyvsp[0].exp);
|
||
}
|
||
break;
|
||
|
||
case 7:
|
||
#line 175 "../../intl/plural.y"
|
||
{
|
||
yyval.exp = new_exp_2 (yyvsp[-1].op, yyvsp[-2].exp, yyvsp[0].exp);
|
||
}
|
||
break;
|
||
|
||
case 8:
|
||
#line 179 "../../intl/plural.y"
|
||
{
|
||
yyval.exp = new_exp_2 (yyvsp[-1].op, yyvsp[-2].exp, yyvsp[0].exp);
|
||
}
|
||
break;
|
||
|
||
case 9:
|
||
#line 183 "../../intl/plural.y"
|
||
{
|
||
yyval.exp = new_exp_2 (yyvsp[-1].op, yyvsp[-2].exp, yyvsp[0].exp);
|
||
}
|
||
break;
|
||
|
||
case 10:
|
||
#line 187 "../../intl/plural.y"
|
||
{
|
||
yyval.exp = new_exp_1 (lnot, yyvsp[0].exp);
|
||
}
|
||
break;
|
||
|
||
case 11:
|
||
#line 191 "../../intl/plural.y"
|
||
{
|
||
yyval.exp = new_exp_0 (var);
|
||
}
|
||
break;
|
||
|
||
case 12:
|
||
#line 195 "../../intl/plural.y"
|
||
{
|
||
if ((yyval.exp = new_exp_0 (num)) != NULL)
|
||
yyval.exp->val.num = yyvsp[0].num;
|
||
}
|
||
break;
|
||
|
||
case 13:
|
||
#line 200 "../../intl/plural.y"
|
||
{
|
||
yyval.exp = yyvsp[-1].exp;
|
||
}
|
||
break;
|
||
|
||
|
||
}
|
||
|
||
/* Line 999 of yacc.c. */
|
||
#line 1211 "../../intl/plural.c"
|
||
|
||
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);
|
||
char *yymsg;
|
||
int yyx, yycount;
|
||
|
||
yycount = 0;
|
||
/* Start YYX at -YYN if negative to avoid negative indexes in
|
||
YYCHECK. */
|
||
for (yyx = yyn < 0 ? -yyn : 0;
|
||
yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++)
|
||
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
||
yysize += yystrlen (yytname[yyx]) + 15, yycount++;
|
||
yysize += yystrlen ("syntax error, unexpected ") + 1;
|
||
yysize += 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)
|
||
{
|
||
yycount = 0;
|
||
for (yyx = yyn < 0 ? -yyn : 0;
|
||
yyx < (int) (sizeof (yytname) / sizeof (char *));
|
||
yyx++)
|
||
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
||
{
|
||
const char *yyq = ! yycount ? ", expecting " : " or ";
|
||
yyp = yystpcpy (yyp, yyq);
|
||
yyp = yystpcpy (yyp, yytname[yyx]);
|
||
yycount++;
|
||
}
|
||
}
|
||
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. */
|
||
|
||
/* Return failure if at end of input. */
|
||
if (yychar == YYEOF)
|
||
{
|
||
/* Pop the error token. */
|
||
YYPOPSTACK;
|
||
/* Pop the rest of the stack. */
|
||
while (yyss < yyssp)
|
||
{
|
||
YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp);
|
||
yydestruct (yystos[*yyssp], yyvsp);
|
||
YYPOPSTACK;
|
||
}
|
||
YYABORT;
|
||
}
|
||
|
||
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;
|
||
|
||
|
||
/*----------------------------------------------------.
|
||
| yyerrlab1 -- error raised explicitly by an action. |
|
||
`----------------------------------------------------*/
|
||
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);
|
||
yyvsp--;
|
||
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 205 "../../intl/plural.y"
|
||
|
||
|
||
void
|
||
internal_function
|
||
FREE_EXPRESSION (struct expression *exp)
|
||
{
|
||
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
|
||
yylex (YYSTYPE *lval, const char **pexp)
|
||
{
|
||
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
|
||
yyerror (const char *str)
|
||
{
|
||
/* Do nothing. We don't print error messages here. */
|
||
}
|
||
|