Subversion Repositories HelenOS

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

/* Skeleton implementation for Bison's Yacc-like parsers in C

   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.3"

/* Skeleton name.  */

#define YYSKELETON_NAME "yacc.c"

/* Pure parsers.  */

#define YYPURE 0

/* Using locations.  */

#define YYLSP_NEEDED 0

/* Tokens.  */

#ifndef YYTOKENTYPE

# define YYTOKENTYPE

   /* Put the tokens into the symbol table, so that GDB and other debuggers

      know about them.  */

   enum yytokentype {

     ARITH_NUM = 258,

     ARITH_LPAREN = 259,

     ARITH_RPAREN = 260,

     ARITH_OR = 261,

     ARITH_AND = 262,

     ARITH_BOR = 263,

     ARITH_BXOR = 264,

     ARITH_BAND = 265,

     ARITH_NE = 266,

     ARITH_EQ = 267,

     ARITH_LE = 268,

     ARITH_GE = 269,

     ARITH_GT = 270,

     ARITH_LT = 271,

     ARITH_RSHIFT = 272,

     ARITH_LSHIFT = 273,

     ARITH_SUB = 274,

     ARITH_ADD = 275,

     ARITH_REM = 276,

     ARITH_DIV = 277,

     ARITH_MUL = 278,

     ARITH_BNOT = 279,

     ARITH_NOT = 280,

     ARITH_UNARYPLUS = 281,

     ARITH_UNARYMINUS = 282

   };

#endif

/* Tokens.  */

#define ARITH_NUM 258

#define ARITH_LPAREN 259

#define ARITH_RPAREN 260

#define ARITH_OR 261

#define ARITH_AND 262

#define ARITH_BOR 263

#define ARITH_BXOR 264

#define ARITH_BAND 265

#define ARITH_NE 266

#define ARITH_EQ 267

#define ARITH_LE 268

#define ARITH_GE 269

#define ARITH_GT 270

#define ARITH_LT 271

#define ARITH_RSHIFT 272

#define ARITH_LSHIFT 273

#define ARITH_SUB 274

#define ARITH_ADD 275

#define ARITH_REM 276

#define ARITH_DIV 277

#define ARITH_MUL 278

#define ARITH_BNOT 279

#define ARITH_NOT 280

#define ARITH_UNARYPLUS 281

#define ARITH_UNARYMINUS 282

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

#line 1 "arith.y"

/*  $NetBSD: arith.y,v 1.13 1999/07/09 03:05:49 christos Exp $  */

/*-

 * Copyright (c) 1993

 *  The Regents of the University of California.  All rights reserved.

 *

 * This code is derived from software contributed to Berkeley by

 * Kenneth Almquist.

 *

 * Redistribution and use in source and binary forms, with or without

 * modification, are permitted provided that the following conditions

 * are met:

 * 1. Redistributions of source code must retain the above copyright

 *    notice, this list of conditions and the following disclaimer.

 * 2. Redistributions in binary form must reproduce the above copyright

 *    notice, this list of conditions and the following disclaimer in the

 *    documentation and/or other materials provided with the distribution.

 * 3. All advertising materials mentioning features or use of this software

 *    must display the following acknowledgement:

 *  This product includes software developed by the University of

 *  California, Berkeley and its contributors.

 * 4. Neither the name of the University nor the names of its contributors

 *    may be used to endorse or promote products derived from this software

 *    without specific prior written permission.

 *

 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND

 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE

 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE

 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL

 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS

 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)

 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT

 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY

 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF

 * SUCH DAMAGE.

 */

#include <sys/cdefs.h>

#ifndef lint

#if 0

static char sccsid[] = "@(#)arith.y 8.3 (Berkeley) 5/4/95";

#else

__RCSID("$NetBSD: arith.y,v 1.13 1999/07/09 03:05:49 christos Exp $");

#endif

#endif /* not lint */

#include <stdlib.h>

#include "expand.h"

#include "shell.h"

#include "error.h"

#include "output.h"

#include "memalloc.h"

const char *arith_buf, *arith_startbuf;

void yyerror (const char *);

int yyparse (void);

#ifdef TESTARITH

int main (int , char *[]);

int error (char *);

#endif

int

arith(s)

    const char *s;

{

    long result;

    arith_buf = arith_startbuf = s;

    INTOFF;

    result = yyparse();

    arith_lex_reset();  /* reprime lex */

    INTON;

    return (result);

}

/*

 *  The exp(1) builtin.

 */

int

expcmd(argc, argv)

    int argc;

    char **argv;

{

    const char *p;

    char *concat;

    char **ap;

    long i;

    if (argc > 1) {

        p = argv[1];

        if (argc > 2) {

            /*

             * concatenate arguments

             */

            STARTSTACKSTR(concat);

            ap = argv + 2;

            for (;;) {

                while (*p)

                    STPUTC(*p++, concat);

                if ((p = *ap++) == NULL)

                    break;

                STPUTC(' ', concat);

            }

            STPUTC('\0', concat);

            p = grabstackstr(concat);

        }

    } else

        p = "";

    i = arith(p);

    out1fmt("%ld\n", i);

    return (! i);

}

/*************************/

#ifdef TEST_ARITH

#include <stdio.h>

main(argc, argv)

    char *argv[];

{

    printf("%d\n", exp(argv[1]));

}

error(s)

    char *s;

{

    fprintf(stderr, "exp: %s\n", s);

    exit(1);

}

#endif

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

#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED

typedef int YYSTYPE;

# 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 216 of yacc.c.  */

#line 298 "y.tab.c"

#ifdef short

# undef short

#endif

#ifdef YYTYPE_UINT8

typedef YYTYPE_UINT8 yytype_uint8;

#else

typedef unsigned char yytype_uint8;

#endif

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

#endif

#ifdef YYTYPE_UINT16

typedef YYTYPE_UINT16 yytype_uint16;

#else

typedef unsigned short int yytype_uint16;

#endif

#ifdef YYTYPE_INT16

typedef YYTYPE_INT16 yytype_int16;

#else

typedef short int yytype_int16;

#endif

#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

#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)

#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

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

#if ! defined lint || defined __GNUC__

# define YYUSE(e) ((void) (e))

#else

# define YYUSE(e) /* empty */

#endif

/* 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 i)

#else

static int

YYID (i)

    int i;

#endif

{

  return i;

}

#endif

#if ! defined yyoverflow || YYERROR_VERBOSE

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

#    endif

#   endif

#  endif

# endif

# ifdef YYSTACK_ALLOC

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

# else

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

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

#   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

#  endif

# endif

#endif /* ! defined yyoverflow || YYERROR_VERBOSE */

#if (! defined yyoverflow \

     && (! defined __cplusplus \

     || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))

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

union yyalloc

{

  yytype_int16 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 (yytype_int16) + sizeof (YYSTYPE)) \

      + YYSTACK_GAP_MAXIMUM)

/* Copy COUNT objects from FROM to TO.  The source and destination do

   not overlap.  */

# ifndef YYCOPY

#  if defined __GNUC__ && 1 < __GNUC__

#   define YYCOPY(To, From, Count) \

      __builtin_memcpy (To, From, (Count) * sizeof (*(From)))

#  else

#   define YYCOPY(To, From, Count)      \

      do                    \

    {                   \

      YYSIZE_T yyi;             \

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

        (To)[yyi] = (From)[yyi];        \

    }                   \

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

#endif

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

#define YYFINAL  14

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

#define YYLAST   170

/* YYNTOKENS -- Number of terminals.  */

#define YYNTOKENS  28

/* YYNNTS -- Number of nonterminals.  */

#define YYNNTS  3

/* YYNRULES -- Number of rules.  */

#define YYNRULES  26

/* YYNRULES -- Number of states.  */

#define YYNSTATES  52

/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX.  */

#define YYUNDEFTOK  2

#define YYMAXUTOK   282

#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,     2,     2,     2,     2,     2,     2,     2,

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

       2,     2,     2,     2,     2,     2,     1,     2,     3,     4,

       5,     6,     7,     8,     9,    10,    11,    12,    13,    14,

      15,    16,    17,    18,    19,    20,    21,    22,    23,    24,

      25,    26,    27

};

#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,     9,    13,    17,    21,    25,    29,

      33,    37,    41,    45,    49,    53,    57,    61,    65,    69,

      73,    77,    81,    84,    87,    90,    93

};

/* YYRHS -- A `-1'-separated list of the rules' RHS.  */

static const yytype_int8 yyrhs[] =

{

      29,     0,    -1,    30,    -1,     4,    30,     5,    -1,    30,

       6,    30,    -1,    30,     7,    30,    -1,    30,     8,    30,

      -1,    30,     9,    30,    -1,    30,    10,    30,    -1,    30,

      12,    30,    -1,    30,    15,    30,    -1,    30,    14,    30,

      -1,    30,    16,    30,    -1,    30,    13,    30,    -1,    30,

      11,    30,    -1,    30,    18,    30,    -1,    30,    17,    30,

      -1,    30,    20,    30,    -1,    30,    19,    30,    -1,    30,

      23,    30,    -1,    30,    22,    30,    -1,    30,    21,    30,

      -1,    25,    30,    -1,    24,    30,    -1,    19,    30,    -1,

      20,    30,    -1,     3,    -1

};

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

static const yytype_uint8 yyrline[] =

{

       0,   153,   153,   159,   160,   161,   162,   163,   164,   165,

     166,   167,   168,   169,   170,   171,   172,   173,   174,   175,

     176,   181,   186,   187,   188,   189,   190

};

#endif

#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", "ARITH_NUM", "ARITH_LPAREN",

  "ARITH_RPAREN", "ARITH_OR", "ARITH_AND", "ARITH_BOR", "ARITH_BXOR",

  "ARITH_BAND", "ARITH_NE", "ARITH_EQ", "ARITH_LE", "ARITH_GE", "ARITH_GT",

  "ARITH_LT", "ARITH_RSHIFT", "ARITH_LSHIFT", "ARITH_SUB", "ARITH_ADD",

  "ARITH_REM", "ARITH_DIV", "ARITH_MUL", "ARITH_BNOT", "ARITH_NOT",

  "ARITH_UNARYPLUS", "ARITH_UNARYMINUS", "$accept", "exp", "expr", 0

};

#endif

# ifdef YYPRINT

/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to

   token YYLEX-NUM.  */

static const yytype_uint16 yytoknum[] =

{

       0,   256,   257,   258,   259,   260,   261,   262,   263,   264,

     265,   266,   267,   268,   269,   270,   271,   272,   273,   274,

     275,   276,   277,   278,   279,   280,   281,   282

};

# endif

/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives.  */

static const yytype_uint8 yyr1[] =

{

       0,    28,    29,    30,    30,    30,    30,    30,    30,    30,

      30,    30,    30,    30,    30,    30,    30,    30,    30,    30,

      30,    30,    30,    30,    30,    30,    30

};

/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN.  */

static const yytype_uint8 yyr2[] =

{

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

       3,     3,     3,     3,     3,     3,     3,     3,     3,     3,

       3,     3,     2,     2,     2,     2,     1

};

/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state

   STATE-NUM when YYTABLE doesn't specify something else to do.  Zero

   means the default is an error.  */

static const yytype_uint8 yydefact[] =

{

       0,    26,     0,     0,     0,     0,     0,     0,     2,     0,

      24,    25,    23,    22,     1,     0,     0,     0,     0,     0,

       0,     0,     0,     0,     0,     0,     0,     0,     0,     0,

       0,     0,     0,     3,     4,     5,     6,     7,     8,    14,

       9,    13,    11,    10,    12,    16,    15,    18,    17,    21,

      20,    19

};

/* YYDEFGOTO[NTERM-NUM].  */

static const yytype_int8 yydefgoto[] =

{

      -1,     7,     8

};

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

   STATE-NUM.  */

#define YYPACT_NINF -13

static const yytype_int16 yypact[] =

{

      28,   -13,    28,    28,    28,    28,    28,    12,    67,    49,

     -13,   -13,   -13,   -13,   -13,    28,    28,    28,    28,    28,

      28,    28,    28,    28,    28,    28,    28,    28,    28,    28,

      28,    28,    28,   -13,    84,   100,   115,    23,   128,   139,

     139,   -12,   -12,   -12,   -12,   144,   144,   147,   147,   -13,

     -13,   -13

};

/* YYPGOTO[NTERM-NUM].  */

static const yytype_int8 yypgoto[] =

{

     -13,   -13,    -2

};

/* 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[] =

{

       9,    10,    11,    12,    13,    26,    27,    28,    29,    30,

      31,    32,    14,    34,    35,    36,    37,    38,    39,    40,

      41,    42,    43,    44,    45,    46,    47,    48,    49,    50,

      51,     1,     2,    19,    20,    21,    22,    23,    24,    25,

      26,    27,    28,    29,    30,    31,    32,     3,     4,     0,

       0,     0,     5,     6,    33,    15,    16,    17,    18,    19,

      20,    21,    22,    23,    24,    25,    26,    27,    28,    29,

      30,    31,    32,    15,    16,    17,    18,    19,    20,    21,

      22,    23,    24,    25,    26,    27,    28,    29,    30,    31,

      32,    16,    17,    18,    19,    20,    21,    22,    23,    24,

      25,    26,    27,    28,    29,    30,    31,    32,    17,    18,

      19,    20,    21,    22,    23,    24,    25,    26,    27,    28,

      29,    30,    31,    32,    18,    19,    20,    21,    22,    23,

      24,    25,    26,    27,    28,    29,    30,    31,    32,    20,

      21,    22,    23,    24,    25,    26,    27,    28,    29,    30,

      31,    32,    22,    23,    24,    25,    26,    27,    28,    29,

      30,    31,    32,    28,    29,    30,    31,    32,    30,    31,

      32

};

static const yytype_int8 yycheck[] =

{

       2,     3,     4,     5,     6,    17,    18,    19,    20,    21,

      22,    23,     0,    15,    16,    17,    18,    19,    20,    21,

      22,    23,    24,    25,    26,    27,    28,    29,    30,    31,

      32,     3,     4,    10,    11,    12,    13,    14,    15,    16,

      17,    18,    19,    20,    21,    22,    23,    19,    20,    -1,

      -1,    -1,    24,    25,     5,     6,     7,     8,     9,    10,

      11,    12,    13,    14,    15,    16,    17,    18,    19,    20,

      21,    22,    23,     6,     7,     8,     9,    10,    11,    12,

      13,    14,    15,    16,    17,    18,    19,    20,    21,    22,

      23,     7,     8,     9,    10,    11,    12,    13,    14,    15,

      16,    17,    18,    19,    20,    21,    22,    23,     8,     9,

      10,    11,    12,    13,    14,    15,    16,    17,    18,    19,

      20,    21,    22,    23,     9,    10,    11,    12,    13,    14,

      15,    16,    17,    18,    19,    20,    21,    22,    23,    11,

      12,    13,    14,    15,    16,    17,    18,    19,    20,    21,

      22,    23,    13,    14,    15,    16,    17,    18,    19,    20,