/* A Bison parser, made by GNU Bison 3.8.2.  */

/* Bison implementation for Yacc-like parsers in C

   Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2021 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 3 of the License, 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, see <https://www.gnu.org/licenses/>.  */

/* 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.  */

/* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual,

   especially those whose name start with YY_ or yy_.  They are

   private implementation details that can be changed or removed.  */

/* 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, and Bison version.  */

#define YYBISON 30802

/* Bison version string.  */

#define YYBISON_VERSION "3.8.2"

/* Skeleton name.  */

#define YYSKELETON_NAME "yacc.c"

/* Pure parsers.  */

#define YYPURE 2

/* Push parsers.  */

#define YYPUSH 0

/* Pull parsers.  */

#define YYPULL 1

/* Substitute the variable and function names.  */

#define yyparse         __gettextparse

#define yylex           __gettextlex

#define yyerror         __gettexterror

#define yydebug         __gettextdebug

#define yynerrs         __gettextnerrs

/* First part of user prologue.  */

#line 1 "plural.y"

/* Expression parsing for plural form selection.

   Copyright (C) 2000-2023 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 Lesser General Public License as published by

   the Free Software Foundation; either version 2.1 of the License, 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 Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public License

   along with this program.  If not, see <https://www.gnu.org/licenses/>.  */

#ifdef HAVE_CONFIG_H

# include <config.h>

#endif

#include <stddef.h>

#include <stdlib.h>

#include <string.h>

#include "plural-exp.h"

#include "attribute.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

/* Later we provide those prototypes.  Without these macros, bison may

   generate its own prototypes with possible conflicts.  */

#define YYLEX_IS_DECLARED

#define YYERROR_IS_DECLARED

#line 117 "plural.c"

# ifndef YY_CAST

#  ifdef __cplusplus

#   define YY_CAST(Type, Val) static_cast<Type> (Val)

#   define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)

#  else

#   define YY_CAST(Type, Val) ((Type) (Val))

#   define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))

#  endif

# endif

# ifndef YY_NULLPTR

#  if defined __cplusplus

#   if 201103L <= __cplusplus

#    define YY_NULLPTR nullptr

#   else

#    define YY_NULLPTR 0

#   endif

#  else

#   define YY_NULLPTR ((void*)0)

#  endif

# endif

#include "plural.h"

/* Symbol kind.  */

enum yysymbol_kind_t

{

  YYSYMBOL_YYEMPTY = -2,

  YYSYMBOL_YYEOF = 0,                      /* "end of file"  */

  YYSYMBOL_YYerror = 1,                    /* error  */

  YYSYMBOL_YYUNDEF = 2,                    /* "invalid token"  */

  YYSYMBOL_3_ = 3,                         /* '?'  */

  YYSYMBOL_4_ = 4,                         /* ':'  */

  YYSYMBOL_5_ = 5,                         /* '|'  */

  YYSYMBOL_6_ = 6,                         /* '&'  */

  YYSYMBOL_7_ = 7,                         /* '!'  */

  YYSYMBOL_EQUOP2 = 8,                     /* EQUOP2  */

  YYSYMBOL_CMPOP2 = 9,                     /* CMPOP2  */

  YYSYMBOL_ADDOP2 = 10,                    /* ADDOP2  */

  YYSYMBOL_MULOP2 = 11,                    /* MULOP2  */

  YYSYMBOL_NUMBER = 12,                    /* NUMBER  */

  YYSYMBOL_13_n_ = 13,                     /* 'n'  */

  YYSYMBOL_14_ = 14,                       /* '('  */

  YYSYMBOL_15_ = 15,                       /* ')'  */

  YYSYMBOL_YYACCEPT = 16,                  /* $accept  */

  YYSYMBOL_start = 17,                     /* start  */

  YYSYMBOL_exp = 18                        /* exp  */

};

typedef enum yysymbol_kind_t yysymbol_kind_t;

/* Second part of user prologue.  */

#line 53 "plural.y"

/* Prototypes for local functions.  */

static int yylex (YYSTYPE *lval, struct parse_args *arg);

static void yyerror (struct parse_args *arg, const char *str);

/* Allocation of expressions.  */

static struct expression *

new_exp (int nargs, enum expression_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 expression_operator op)

{

  return new_exp (0, op, NULL);

}

static inline struct expression *

new_exp_1 (enum expression_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 expression_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 expression_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 246 "plural.c"

#ifdef short

# undef short

#endif

/* On compilers that do not define __PTRDIFF_MAX__ etc., make sure

   <limits.h> and (if available) <stdint.h> are included

   so that the code can choose integer types of a good width.  */

#ifndef __PTRDIFF_MAX__

# include <limits.h> /* INFRINGES ON USER NAME SPACE */

# if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__

#  include <stdint.h> /* INFRINGES ON USER NAME SPACE */

#  define YY_STDINT_H

# endif

#endif

/* Narrow types that promote to a signed type and that can represent a

   signed or unsigned integer of at least N bits.  In tables they can

   save space and decrease cache pressure.  Promoting to a signed type

   helps avoid bugs in integer arithmetic.  */

#ifdef __INT_LEAST8_MAX__

typedef __INT_LEAST8_TYPE__ yytype_int8;

#elif defined YY_STDINT_H

typedef int_least8_t yytype_int8;

#else

typedef signed char yytype_int8;

#endif

#ifdef __INT_LEAST16_MAX__

typedef __INT_LEAST16_TYPE__ yytype_int16;

#elif defined YY_STDINT_H

typedef int_least16_t yytype_int16;

#else

typedef short yytype_int16;

#endif

/* Work around bug in HP-UX 11.23, which defines these macros

   incorrectly for preprocessor constants.  This workaround can likely

   be removed in 2023, as HPE has promised support for HP-UX 11.23

   (aka HP-UX 11i v2) only through the end of 2022; see Table 2 of

   <https://h20195.www2.hpe.com/V2/getpdf.aspx/4AA4-7673ENW.pdf>.  */

#ifdef __hpux

# undef UINT_LEAST8_MAX

# undef UINT_LEAST16_MAX

# define UINT_LEAST8_MAX 255

# define UINT_LEAST16_MAX 65535

#endif

#if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__

typedef __UINT_LEAST8_TYPE__ yytype_uint8;

#elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \

       && UINT_LEAST8_MAX <= INT_MAX)

typedef uint_least8_t yytype_uint8;

#elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX

typedef unsigned char yytype_uint8;

#else

typedef short yytype_uint8;

#endif

#if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__

typedef __UINT_LEAST16_TYPE__ yytype_uint16;

#elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \

       && UINT_LEAST16_MAX <= INT_MAX)

typedef uint_least16_t yytype_uint16;

#elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX

typedef unsigned short yytype_uint16;

#else

typedef int yytype_uint16;

#endif

#ifndef YYPTRDIFF_T

# if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__

#  define YYPTRDIFF_T __PTRDIFF_TYPE__

#  define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__

# elif defined PTRDIFF_MAX

#  ifndef ptrdiff_t

#   include <stddef.h> /* INFRINGES ON USER NAME SPACE */

#  endif

#  define YYPTRDIFF_T ptrdiff_t

#  define YYPTRDIFF_MAXIMUM PTRDIFF_MAX

# else

#  define YYPTRDIFF_T long

#  define YYPTRDIFF_MAXIMUM LONG_MAX

# endif

#endif

#ifndef YYSIZE_T

# ifdef __SIZE_TYPE__

#  define YYSIZE_T __SIZE_TYPE__

# elif defined size_t

#  define YYSIZE_T size_t

# elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__

#  include <stddef.h> /* INFRINGES ON USER NAME SPACE */

#  define YYSIZE_T size_t

# else

#  define YYSIZE_T unsigned

# endif

#endif

#define YYSIZE_MAXIMUM                                  \

  YY_CAST (YYPTRDIFF_T,                                 \

           (YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1)  \

            ? YYPTRDIFF_MAXIMUM                         \

            : YY_CAST (YYSIZE_T, -1)))

#define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X))

/* Stored state numbers (used for stacks). */

typedef yytype_int8 yy_state_t;

/* State numbers in computations.  */

typedef int yy_state_fast_t;

#ifndef YY_

# if defined YYENABLE_NLS && 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

#ifndef YY_ATTRIBUTE_PURE

# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)

#  define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))

# else

#  define YY_ATTRIBUTE_PURE

# endif

#endif

#ifndef YY_ATTRIBUTE_UNUSED

# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)

#  define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))

# else

#  define YY_ATTRIBUTE_UNUSED

# endif

#endif

/* Suppress unused-variable warnings by "using" E.  */

#if ! defined lint || defined __GNUC__

# define YY_USE(E) ((void) (E))

#else

# define YY_USE(E) /* empty */

#endif

/* Suppress an incorrect diagnostic about yylval being uninitialized.  */

#if defined __GNUC__ && ! defined __ICC && 406 <= __GNUC__ * 100 + __GNUC_MINOR__

# if __GNUC__ * 100 + __GNUC_MINOR__ < 407

#  define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN                           \

    _Pragma ("GCC diagnostic push")                                     \

    _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")

# else

#  define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN                           \

    _Pragma ("GCC diagnostic push")                                     \

    _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")              \

    _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")

# endif

# define YY_IGNORE_MAYBE_UNINITIALIZED_END      \

    _Pragma ("GCC diagnostic pop")

#else

# define YY_INITIAL_VALUE(Value) Value

#endif

#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN

# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN

# define YY_IGNORE_MAYBE_UNINITIALIZED_END

#endif

#ifndef YY_INITIAL_VALUE

# define YY_INITIAL_VALUE(Value) /* Nothing. */

#endif

#if defined __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__

# define YY_IGNORE_USELESS_CAST_BEGIN                          \

    _Pragma ("GCC diagnostic push")                            \

    _Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")

# define YY_IGNORE_USELESS_CAST_END            \

    _Pragma ("GCC diagnostic pop")

#endif

#ifndef YY_IGNORE_USELESS_CAST_BEGIN

# define YY_IGNORE_USELESS_CAST_BEGIN

# define YY_IGNORE_USELESS_CAST_END

#endif

#define YY_ASSERT(E) ((void) (0 && (E)))

#if !defined yyoverflow

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

# 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

#   else

#    define YYSTACK_ALLOC alloca

#    if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS

#     include <stdlib.h> /* INFRINGES ON USER NAME SPACE */

      /* Use EXIT_SUCCESS as a witness for stdlib.h.  */

#     ifndef EXIT_SUCCESS

#      define EXIT_SUCCESS 0

#     endif

#    endif

#   endif

#  endif

# endif

# ifdef YYSTACK_ALLOC

   /* Pacify GCC's 'empty if-body' warning.  */

#  define YYSTACK_FREE(Ptr) do { /* empty */; } while (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

# else

#  define YYSTACK_ALLOC YYMALLOC

#  define YYSTACK_FREE YYFREE

#  ifndef YYSTACK_ALLOC_MAXIMUM

#   define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM

#  endif

#  if (defined __cplusplus && ! defined EXIT_SUCCESS \

       && ! ((defined YYMALLOC || defined malloc) \

             && (defined YYFREE || defined free)))

#   include <stdlib.h> /* INFRINGES ON USER NAME SPACE */

#   ifndef EXIT_SUCCESS

#    define EXIT_SUCCESS 0

#   endif

#  endif

#  ifndef YYMALLOC

#   define YYMALLOC malloc

#   if ! defined malloc && ! defined EXIT_SUCCESS

void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */

#   endif

#  endif

#  ifndef YYFREE

#   define YYFREE free

#   if ! defined free && ! defined EXIT_SUCCESS

void free (void *); /* INFRINGES ON USER NAME SPACE */

#   endif

#  endif

# endif

#endif /* !defined yyoverflow */

#if (! defined yyoverflow \

     && (! defined __cplusplus \

         || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))

/* A type that is properly aligned for any stack member.  */

union yyalloc

{

  yy_state_t yyss_alloc;

  YYSTYPE yyvs_alloc;

};

/* The size of the maximum gap between one aligned stack and the next.  */

# define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1)

/* The size of an array large to enough to hold all stacks, each with

   N elements.  */

# define YYSTACK_BYTES(N) \

     ((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (YYSTYPE)) \

      + YYSTACK_GAP_MAXIMUM)

# define YYCOPY_NEEDED 1

/* 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_alloc, Stack)                           \

    do                                                                  \

      {                                                                 \

        YYPTRDIFF_T yynewbytes;                                         \

        YYCOPY (&yyptr->Stack_alloc, Stack, yysize);                    \

        Stack = &yyptr->Stack_alloc;                                    \

        yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \

        yyptr += yynewbytes / YYSIZEOF (*yyptr);                        \

      }                                                                 \

    while (0)

#endif

#if defined YYCOPY_NEEDED && YYCOPY_NEEDED

/* Copy COUNT objects from SRC to DST.  The source and destination do

   not overlap.  */

# ifndef YYCOPY

#  if defined __GNUC__ && 1 < __GNUC__

#   define YYCOPY(Dst, Src, Count) \

      __builtin_memcpy (Dst, Src, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src)))

#  else

#   define YYCOPY(Dst, Src, Count)              \

      do                                        \

        {                                       \

          YYPTRDIFF_T yyi;                      \

          for (yyi = 0; yyi < (Count); yyi++)   \

            (Dst)[yyi] = (Src)[yyi];            \

        }                                       \

      while (0)

#  endif

# endif

#endif /* !YYCOPY_NEEDED */

/* YYFINAL -- State number of the termination state.  */

#define YYFINAL  9

/* YYLAST -- Last index in YYTABLE.  */

#define YYLAST   58

/* YYNTOKENS -- Number of terminals.  */

#define YYNTOKENS  16

/* YYNNTS -- Number of nonterminals.  */

#define YYNNTS  3

/* YYNRULES -- Number of rules.  */

#define YYNRULES  13

/* YYNSTATES -- Number of states.  */

#define YYNSTATES  27

/* YYMAXUTOK -- Last valid token kind.  */

#define YYMAXUTOK   262

/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM

   as returned by yylex, with out-of-bounds checking.  */

#define YYTRANSLATE(YYX)                                \

  (0 <= (YYX) && (YYX) <= YYMAXUTOK                     \

   ? YY_CAST (yysymbol_kind_t, yytranslate[YYX])        \

   : YYSYMBOL_YYUNDEF)

/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM

   as returned by yylex.  */

static const yytype_int8 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,     7,     2,     2,     2,     2,     6,     2,

      14,    15,     2,     2,     2,     2,     2,     2,     2,     2,

       2,     2,     2,     2,     2,     2,     2,     2,     4,     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,     5,     2,     2,     2,     2,     2,

       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,

       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,

       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,

       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,

       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,

       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,

       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,

       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,

       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,

       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,

       2,     2,     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,     8,     9,

      10,    11,    12

};

#if YYDEBUG

/* YYRLINE[YYN] -- Source line where rule number YYN was defined.  */

static const yytype_uint8 yyrline[] =

{

       0,   150,   150,   158,   162,   166,   170,   174,   178,   182,

     186,   190,   194,   199

};

#endif

/** Accessing symbol of state STATE.  */

#define YY_ACCESSING_SYMBOL(State) YY_CAST (yysymbol_kind_t, yystos[State])

#if YYDEBUG || 0

/* The user-facing name of the symbol whose (internal) number is

   YYSYMBOL.  No bounds checking.  */

static const char *yysymbol_name (yysymbol_kind_t yysymbol) YY_ATTRIBUTE_UNUSED;

/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.

   First, the terminals, then, starting at YYNTOKENS, nonterminals.  */

static const char *const yytname[] =

{

  "\"end of file\"", "error", "\"invalid token\"", "'?'", "':'", "'|'",

  "'&'", "'!'", "EQUOP2", "CMPOP2", "ADDOP2", "MULOP2", "NUMBER", "'n'",

  "'('", "')'", "$accept", "start", "exp", YY_NULLPTR

};

static const char *

yysymbol_name (yysymbol_kind_t yysymbol)

{

  return yytname[yysymbol];

}

#endif

#define YYPACT_NINF (-8)

#define yypact_value_is_default(Yyn) \

  ((Yyn) == YYPACT_NINF)

#define YYTABLE_NINF (-1)

#define yytable_value_is_error(Yyn) \

  0

/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing

   STATE-NUM.  */

static const yytype_int8 yypact[] =

{

      -6,    -6,    -8,    -8,    -6,     2,    39,    -8,    17,    -8,

      -6,    -6,    -6,    -6,    -6,    -6,    -6,    -8,    30,    45,

       8,    20,    47,    -7,    -8,    -6,    39

};

/* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM.

   Performed when YYTABLE does not specify something else to do.  Zero

   means the default is an error.  */

static const yytype_int8 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

};

/* YYPGOTO[NTERM-NUM].  */

static const yytype_int8 yypgoto[] =

{

      -8,    -8,    -1

};

/* YYDEFGOTO[NTERM-NUM].  */

static const yytype_int8 yydefgoto[] =

{

       0,     5,     6

};

/* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM.  If

   positive, shift that token.  If negative, reduce the rule whose

   number is the opposite.  If YYTABLE_NINF, syntax error.  */

static const yytype_int8 yytable[] =

{

       7,     1,     9,     8,    16,     0,     2,     3,     4,    18,

      19,    20,    21,    22,    23,    24,    13,    14,    15,    16,

      10,     0,    11,    12,    26,    13,    14,    15,    16,    14,

      15,    16,    17,    10,    25,    11,    12,     0,    13,    14,

      15,    16,    10,     0,    11,    12,     0,    13,    14,    15,

      16,    12,     0,    13,    14,    15,    16,    15,    16

};

static const yytype_int8 yycheck[] =

{

       1,     7,     0,     4,    11,    -1,    12,    13,    14,    10,

      11,    12,    13,    14,    15,    16,     8,     9,    10,    11,

       3,    -1,     5,     6,    25,     8,     9,    10,    11,     9,

      10,    11,    15,     3,     4,     5,     6,    -1,     8,     9,

      10,    11,     3,    -1,     5,     6,    -1,     8,     9,    10,

      11,     6,    -1,     8,     9,    10,    11,    10,    11

};

/* YYSTOS[STATE-NUM] -- The symbol kind of the accessing symbol of

   state STATE-NUM.  */

static const yytype_int8 yystos[] =

{

       0,     7,    12,    13,    14,    17,    18,    18,    18,     0,

       3,     5,     6,     8,     9,    10,    11,    15,    18,    18,

      18,    18,    18,    18,    18,     4,    18

};

/* YYR1[RULE-NUM] -- Symbol kind of the left-hand side of rule RULE-NUM.  */

static const yytype_int8 yyr1[] =

{

       0,    16,    17,    18,    18,    18,    18,    18,    18,    18,

      18,    18,    18,    18

};

/* YYR2[RULE-NUM] -- Number of symbols on the right-hand side of rule RULE-NUM.  */

static const yytype_int8 yyr2[] =

{

       0,     2,     1,     5,     3,     3,     3,     3,     3,     3,

       2,     1,     1,     3

};

enum { YYENOMEM = -2 };

#define yyerrok         (yyerrstatus = 0)

#define yyclearin       (yychar = YYEMPTY)

#define YYACCEPT        goto yyacceptlab

#define YYABORT         goto yyabortlab

#define YYERROR         goto yyerrorlab

#define YYNOMEM         goto yyexhaustedlab

#define YYRECOVERING()  (!!yyerrstatus)

#define YYBACKUP(Token, Value)                                    \

  do                                                              \

    if (yychar == YYEMPTY)                                        \

      {                                                           \

        yychar = (Token);                                         \

        yylval = (Value);                                         \

        YYPOPSTACK (yylen);                                       \

        yystate = *yyssp;                                         \

        goto yybackup;                                            \

      }                                                           \

    else                                                          \

      {                                                           \

        yyerror (arg, YY_("syntax error: cannot back up")); \

        YYERROR;                                                  \

      }                                                           \

  while (0)

/* Backward compatibility with an undocumented macro.

   Use YYerror or YYUNDEF. */

#define YYERRCODE YYUNDEF

/* 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 YY_SYMBOL_PRINT(Title, Kind, Value, Location)                    \

do {                                                                      \

  if (yydebug)                                                            \

    {                                                                     \

      YYFPRINTF (stderr, "%s ", Title);                                   \

      yy_symbol_print (stderr,                                            \

                  Kind, Value, arg); \

      YYFPRINTF (stderr, "\n");                                           \

    }                                                                     \

} while (0)

/*-----------------------------------.

| Print this symbol's value on YYO.  |

`-----------------------------------*/

static void

yy_symbol_value_print (FILE *yyo,

                       yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep, struct parse_args *arg)

{

  FILE *yyoutput = yyo;

  YY_USE (yyoutput);

  YY_USE (arg);

  if (!yyvaluep)

    return;

  YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN

  YY_USE (yykind);

  YY_IGNORE_MAYBE_UNINITIALIZED_END

}

/*---------------------------.

| Print this symbol on YYO.  |

`---------------------------*/

static void

yy_symbol_print (FILE *yyo,

                 yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep, struct parse_args *arg)

{

  YYFPRINTF (yyo, "%s %s (",

             yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name (yykind));

  yy_symbol_value_print (yyo, yykind, yyvaluep, arg);

  YYFPRINTF (yyo, ")");

}

/*------------------------------------------------------------------.

| yy_stack_print -- Print the state stack from its BOTTOM up to its |

| TOP (included).                                                   |

`------------------------------------------------------------------*/

static void

yy_stack_print (yy_state_t *yybottom, yy_state_t *yytop)

{

  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 (0)

/*------------------------------------------------.

| Report that the YYRULE is going to be reduced.  |

`------------------------------------------------*/

static void

yy_reduce_print (yy_state_t *yyssp, YYSTYPE *yyvsp,

                 int yyrule, struct parse_args *arg)

{

  int yylno = yyrline[yyrule];

  int yynrhs = yyr2[yyrule];

  int yyi;

  YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",

             yyrule - 1, yylno);

  /* The symbols being reduced.  */

  for (yyi = 0; yyi < yynrhs; yyi++)

    {

      YYFPRINTF (stderr, "   $%d = ", yyi + 1);

      yy_symbol_print (stderr,

                       YY_ACCESSING_SYMBOL (+yyssp[yyi + 1 - yynrhs]),

                       &yyvsp[(yyi + 1) - (yynrhs)], arg);

      YYFPRINTF (stderr, "\n");

    }

}

# define YY_REDUCE_PRINT(Rule)          \

do {                                    \

  if (yydebug)                          \

    yy_reduce_print (yyssp, yyvsp, Rule, arg); \

} while (0)

/* Nonzero means print parse trace.  It is left uninitialized so that

   multiple parsers can coexist.  */

int yydebug;

#else /* !YYDEBUG */

# define YYDPRINTF(Args) ((void) 0)

# define YY_SYMBOL_PRINT(Title, Kind, 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

   YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)

   evaluated with infinite-precision integer arithmetic.  */

#ifndef YYMAXDEPTH

# define YYMAXDEPTH 10000

#endif

/*-----------------------------------------------.

| Release the memory associated to this symbol.  |

`-----------------------------------------------*/

static void

yydestruct (const char *yymsg,

            yysymbol_kind_t yykind, YYSTYPE *yyvaluep, struct parse_args *arg)

{

  YY_USE (yyvaluep);

  YY_USE (arg);

  if (!yymsg)

    yymsg = "Deleting";

  YY_SYMBOL_PRINT (yymsg, yykind, yyvaluep, yylocationp);

  YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN

  YY_USE (yykind);

  YY_IGNORE_MAYBE_UNINITIALIZED_END

}

/*----------.

| yyparse.  |

`----------*/

int

yyparse (struct parse_args *arg)

{

/* Lookahead token kind.  */

int yychar;

/* The semantic value of the lookahead symbol.  */

/* Default value used for initialization, for pacifying older GCCs

   or non-GCC compilers.  */

YY_INITIAL_VALUE (static YYSTYPE yyval_default;)

YYSTYPE yylval YY_INITIAL_VALUE (= yyval_default);

    /* Number of syntax errors so far.  */

    int yynerrs = 0;

    yy_state_fast_t yystate = 0;

    /* Number of tokens to shift before error messages enabled.  */

    int yyerrstatus = 0;

    /* Refer to the stacks through separate pointers, to allow yyoverflow

       to reallocate them elsewhere.  */

    /* Their size.  */

    YYPTRDIFF_T yystacksize = YYINITDEPTH;

    /* The state stack: array, bottom, top.  */

    yy_state_t yyssa[YYINITDEPTH];

    yy_state_t *yyss = yyssa;

    yy_state_t *yyssp = yyss;

    /* The semantic value stack: array, bottom, top.  */

    YYSTYPE yyvsa[YYINITDEPTH];

    YYSTYPE *yyvs = yyvsa;

    YYSTYPE *yyvsp = yyvs;

  int yyn;

  /* The return value of yyparse.  */

  int yyresult;

  /* Lookahead symbol kind.  */

  yysymbol_kind_t yytoken = YYSYMBOL_YYEMPTY;

  /* The variables used to return semantic value and location from the

     action routines.  */

  YYSTYPE yyval;

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

  /* The number of symbols on the RHS of the reduced rule.

     Keep to zero when no symbol should be popped.  */

  int yylen = 0;

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

  yychar = YYEMPTY; /* Cause a token to be read.  */

  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 -- set current state (the top of the stack) to yystate.  |

`--------------------------------------------------------------------*/

yysetstate:

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

  YY_ASSERT (0 <= yystate && yystate < YYNSTATES);

  YY_IGNORE_USELESS_CAST_BEGIN

  *yyssp = YY_CAST (yy_state_t, yystate);

  YY_IGNORE_USELESS_CAST_END

  YY_STACK_PRINT (yyss, yyssp);

  if (yyss + yystacksize - 1 <= yyssp)

#if !defined yyoverflow && !defined YYSTACK_RELOCATE

    YYNOMEM;

#else

    {

      /* Get the current used size of the three stacks, in elements.  */

      YYPTRDIFF_T yysize = yyssp - yyss + 1;

# if defined 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.  */

        yy_state_t *yyss1 = yyss;

        YYSTYPE *yyvs1 = yyvs;

        /* 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 (YY_("memory exhausted"),

                    &yyss1, yysize * YYSIZEOF (*yyssp),

                    &yyvs1, yysize * YYSIZEOF (*yyvsp),

                    &yystacksize);

        yyss = yyss1;

        yyvs = yyvs1;

      }

# else /* defined YYSTACK_RELOCATE */

      /* Extend the stack our own way.  */

      if (YYMAXDEPTH <= yystacksize)

        YYNOMEM;

      yystacksize *= 2;

      if (YYMAXDEPTH < yystacksize)

        yystacksize = YYMAXDEPTH;

      {

        yy_state_t *yyss1 = yyss;

        union yyalloc *yyptr =

          YY_CAST (union yyalloc *,

                   YYSTACK_ALLOC (YY_CAST (YYSIZE_T, YYSTACK_BYTES (yystacksize))));

        if (! yyptr)

          YYNOMEM;

        YYSTACK_RELOCATE (yyss_alloc, yyss);