WebSVN – HelenOS – Diff – /branches/cs/uspace/app/ash/arith.c


/* 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,
      21,    22,    23,    19,    20,    21,    22,    23,    21,    22,
      23
};
 
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
   symbol of state STATE-NUM.  */
static const yytype_uint8 yystos[] =
{
       0,     3,     4,    19,    20,    24,    25,    29,    30,    30,
      30,    30,    30,    30,     0,     6,     7,     8,     9,    10,
      11,    12,    13,    14,    15,    16,    17,    18,    19,    20,
      21,    22,    23,     5,    30,    30,    30,    30,    30,    30,
      30,    30,    30,    30,    30,    30,    30,    30,    30,    30,
      30,    30
};
 
#define yyerrok     (yyerrstatus = 0)
#define yyclearin   (yychar = YYEMPTY)
#define YYEMPTY     (-2)
#define YYEOF       0
 
#define YYACCEPT    goto yyacceptlab
#define YYABORT     goto yyabortlab
#define YYERROR     goto yyerrorlab
 
 
/* Like YYERROR except do call yyerror.  This remains here temporarily
   to ease the transition to the new meaning of YYERROR, for GCC.
   Once GCC version 2 has supplanted version 1, this can go.  */
 
#define YYFAIL      goto yyerrlab
 
#define YYRECOVERING()  (!!yyerrstatus)
 
#define YYBACKUP(Token, Value)                  \
do                              \
  if (yychar == YYEMPTY && yylen == 1)              \
    {                               \
      yychar = (Token);                     \
      yylval = (Value);                     \
      yytoken = YYTRANSLATE (yychar);               \
      YYPOPSTACK (1);                       \
      goto yybackup;                        \
    }                               \
  else                              \
    {                               \
      yyerror (YY_("syntax error: cannot back up")); \
      YYERROR;                          \
    }                               \
while (YYID (0))
 
 
#define YYTERROR    1
#define YYERRCODE   256
 
 
/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
   If N is 0, then set CURRENT to the empty location which ends
   the previous symbol: RHS[0] (always defined).  */
 
#define YYRHSLOC(Rhs, K) ((Rhs)[K])
#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N)                \
    do                                  \
      if (YYID (N))                                                    \
    {                               \
      (Current).first_line   = YYRHSLOC (Rhs, 1).first_line;    \
      (Current).first_column = YYRHSLOC (Rhs, 1).first_column;  \
      (Current).last_line    = YYRHSLOC (Rhs, N).last_line;     \
      (Current).last_column  = YYRHSLOC (Rhs, N).last_column;   \
    }                               \
      else                              \
    {                               \
      (Current).first_line   = (Current).last_line   =      \
        YYRHSLOC (Rhs, 0).last_line;                \
      (Current).first_column = (Current).last_column =      \
        YYRHSLOC (Rhs, 0).last_column;              \
    }                               \
    while (YYID (0))
#endif
 
 
/* YY_LOCATION_PRINT -- Print the location on the stream.
   This macro was not mandated originally: define only if we know
   we won't break user code: when these are the locations we know.  */
 
#ifndef YY_LOCATION_PRINT
# if YYLTYPE_IS_TRIVIAL
#  define YY_LOCATION_PRINT(File, Loc)          \
     fprintf (File, "%d.%d-%d.%d",          \
          (Loc).first_line, (Loc).first_column, \
          (Loc).last_line,  (Loc).last_column)
# else
#  define YY_LOCATION_PRINT(File, Loc) ((void) 0)
# endif
#endif
 
 
/* YYLEX -- calling `yylex' with the right arguments.  */
 
#ifdef YYLEX_PARAM
# define YYLEX yylex (YYLEX_PARAM)
#else
# define YYLEX yylex ()
#endif
 
/* Enable debugging if requested.  */
#if YYDEBUG
 
# ifndef YYFPRINTF
#  include <stdio.h> /* INFRINGES ON USER NAME SPACE */
#  define YYFPRINTF fprintf
# endif
 
# define YYDPRINTF(Args)            \
do {                        \
  if (yydebug)                  \
    YYFPRINTF Args;             \
} while (YYID (0))
 
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)            \
do {                                      \
  if (yydebug)                                \
    {                                     \
      YYFPRINTF (stderr, "%s ", Title);                   \
      yy_symbol_print (stderr,                        \
          Type, Value); \
      YYFPRINTF (stderr, "\n");                       \
    }                                     \
} while (YYID (0))
 
 
/*--------------------------------.
| Print this symbol on YYOUTPUT.  |
`--------------------------------*/
 
/*ARGSUSED*/
#if (defined __STDC__ || defined __C99__FUNC__ \
     || defined __cplusplus || defined _MSC_VER)
static void
yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
#else
static void
yy_symbol_value_print (yyoutput, yytype, yyvaluep)
    FILE *yyoutput;
    int yytype;
    YYSTYPE const * const yyvaluep;
#endif
{
  if (!yyvaluep)
    return;
# ifdef YYPRINT
  if (yytype < YYNTOKENS)
    YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# else
  YYUSE (yyoutput);
# endif
  switch (yytype)
    {
      default:
    break;
    }
}
 
 
/*--------------------------------.
| Print this symbol on YYOUTPUT.  |
`--------------------------------*/
 
#if (defined __STDC__ || defined __C99__FUNC__ \
     || defined __cplusplus || defined _MSC_VER)
static void
yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
#else
static void
yy_symbol_print (yyoutput, yytype, yyvaluep)
    FILE *yyoutput;
    int yytype;
    YYSTYPE const * const yyvaluep;
#endif
{
  if (yytype < YYNTOKENS)
    YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
  else
    YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
 
  yy_symbol_value_print (yyoutput, yytype, yyvaluep);
  YYFPRINTF (yyoutput, ")");
}
 
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included).                                                   |
`------------------------------------------------------------------*/
 
#if (defined __STDC__ || defined __C99__FUNC__ \
     || defined __cplusplus || defined _MSC_VER)
static void
yy_stack_print (yytype_int16 *bottom, yytype_int16 *top)
#else
static void
yy_stack_print (bottom, top)
    yytype_int16 *bottom;
    yytype_int16 *top;
#endif
{
  YYFPRINTF (stderr, "Stack now");
  for (; 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 (YYID (0))
 
 
/*------------------------------------------------.
| Report that the YYRULE is going to be reduced.  |
`------------------------------------------------*/
 
#if (defined __STDC__ || defined __C99__FUNC__ \
     || defined __cplusplus || defined _MSC_VER)
static void
yy_reduce_print (YYSTYPE *yyvsp, int yyrule)
#else
static void
yy_reduce_print (yyvsp, yyrule)
    YYSTYPE *yyvsp;
    int yyrule;
#endif
{
  int yynrhs = yyr2[yyrule];
  int yyi;
  unsigned long int yylno = yyrline[yyrule];
  YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
         yyrule - 1, yylno);
  /* The symbols being reduced.  */
  for (yyi = 0; yyi < yynrhs; yyi++)
    {
      fprintf (stderr, "   $%d = ", yyi + 1);
      yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
               &(yyvsp[(yyi + 1) - (yynrhs)])
                           );
      fprintf (stderr, "\n");
    }
}
 
# define YY_REDUCE_PRINT(Rule)      \
do {                    \
  if (yydebug)              \
    yy_reduce_print (yyvsp, Rule); \
} while (YYID (0))
 
/* Nonzero means print parse trace.  It is left uninitialized so that
   multiple parsers can coexist.  */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define YY_SYMBOL_PRINT(Title, Type, 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
 

 
#if YYERROR_VERBOSE
 
# ifndef yystrlen
#  if defined __GLIBC__ && defined _STRING_H
#   define yystrlen strlen
#  else
/* Return the length of YYSTR.  */
#if (defined __STDC__ || defined __C99__FUNC__ \
     || defined __cplusplus || defined _MSC_VER)
static YYSIZE_T
yystrlen (const char *yystr)
#else
static YYSIZE_T
yystrlen (yystr)
    const char *yystr;
#endif
{
  YYSIZE_T yylen;
  for (yylen = 0; yystr[yylen]; yylen++)
    continue;
  return yylen;
}
#  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.  */
#if (defined __STDC__ || defined __C99__FUNC__ \
     || defined __cplusplus || defined _MSC_VER)
static char *
yystpcpy (char *yydest, const char *yysrc)
#else
static char *
yystpcpy (yydest, yysrc)
    char *yydest;
    const char *yysrc;
#endif
{
  char *yyd = yydest;
  const char *yys = yysrc;
 
  while ((*yyd++ = *yys++) != '\0')
    continue;
 
  return yyd - 1;
}
#  endif
# endif
 
# ifndef yytnamerr
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
   quotes and backslashes, so that it's suitable for yyerror.  The
   heuristic is that double-quoting is unnecessary unless the string
   contains an apostrophe, a comma, or backslash (other than
   backslash-backslash).  YYSTR is taken from yytname.  If YYRES is
   null, do not copy; instead, return the length of what the result
   would have been.  */
static YYSIZE_T
yytnamerr (char *yyres, const char *yystr)
{
  if (*yystr == '"')
    {
      YYSIZE_T yyn = 0;
      char const *yyp = yystr;
 
      for (;;)
    switch (*++yyp)
      {
      case '\'':
      case ',':
        goto do_not_strip_quotes;
 
      case '\\':
        if (*++yyp != '\\')
          goto do_not_strip_quotes;
        /* Fall through.  */
      default:
        if (yyres)
          yyres[yyn] = *yyp;
        yyn++;
        break;
 
      case '"':
        if (yyres)
          yyres[yyn] = '\0';
        return yyn;
      }
    do_not_strip_quotes: ;
    }
 
  if (! yyres)
    return yystrlen (yystr);
 
  return yystpcpy (yyres, yystr) - yyres;
}
# endif
 
/* Copy into YYRESULT an error message about the unexpected token
   YYCHAR while in state YYSTATE.  Return the number of bytes copied,
   including the terminating null byte.  If YYRESULT is null, do not
   copy anything; just return the number of bytes that would be
   copied.  As a special case, return 0 if an ordinary "syntax error"
   message will do.  Return YYSIZE_MAXIMUM if overflow occurs during
   size calculation.  */
static YYSIZE_T
yysyntax_error (char *yyresult, int yystate, int yychar)
{
  int yyn = yypact[yystate];
 
  if (! (YYPACT_NINF < yyn && yyn <= YYLAST))
    return 0;
  else
    {
      int yytype = YYTRANSLATE (yychar);
      YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]);
      YYSIZE_T yysize = yysize0;
      YYSIZE_T yysize1;
      int yysize_overflow = 0;
      enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
      char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
      int yyx;
 
# if 0
      /* This is so xgettext sees the translatable formats that are
     constructed on the fly.  */
      YY_("syntax error, unexpected %s");
      YY_("syntax error, unexpected %s, expecting %s");
      YY_("syntax error, unexpected %s, expecting %s or %s");
      YY_("syntax error, unexpected %s, expecting %s or %s or %s");
      YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s");
# endif
      char *yyfmt;
      char const *yyf;
      static char const yyunexpected[] = "syntax error, unexpected %s";
      static char const yyexpecting[] = ", expecting %s";
      static char const yyor[] = " or %s";
      char yyformat[sizeof yyunexpected
            + sizeof yyexpecting - 1
            + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2)
               * (sizeof yyor - 1))];
      char const *yyprefix = yyexpecting;
 
      /* Start YYX at -YYN if negative to avoid negative indexes in
     YYCHECK.  */
      int yyxbegin = yyn < 0 ? -yyn : 0;
 
      /* Stay within bounds of both yycheck and yytname.  */
      int yychecklim = YYLAST - yyn + 1;
      int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
      int yycount = 1;
 
      yyarg[0] = yytname[yytype];
      yyfmt = yystpcpy (yyformat, yyunexpected);
 
      for (yyx = yyxbegin; yyx < yyxend; ++yyx)
    if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
      {
        if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
          {
        yycount = 1;
        yysize = yysize0;
        yyformat[sizeof yyunexpected - 1] = '\0';
        break;
          }
        yyarg[yycount++] = yytname[yyx];
        yysize1 = yysize + yytnamerr (0, yytname[yyx]);
        yysize_overflow |= (yysize1 < yysize);
        yysize = yysize1;
        yyfmt = yystpcpy (yyfmt, yyprefix);
        yyprefix = yyor;
      }
 
      yyf = YY_(yyformat);
      yysize1 = yysize + yystrlen (yyf);
      yysize_overflow |= (yysize1 < yysize);
      yysize = yysize1;
 
      if (yysize_overflow)
    return YYSIZE_MAXIMUM;
 
      if (yyresult)
    {
      /* Avoid sprintf, as that infringes on the user's name space.
         Don't have undefined behavior even if the translation
         produced a string with the wrong number of "%s"s.  */
      char *yyp = yyresult;
      int yyi = 0;
      while ((*yyp = *yyf) != '\0')
        {
          if (*yyp == '%' && yyf[1] == 's' && yyi < yycount)
        {
          yyp += yytnamerr (yyp, yyarg[yyi++]);
          yyf += 2;
        }
          else
        {
          yyp++;
          yyf++;
        }
        }
    }
      return yysize;
    }
}
#endif /* YYERROR_VERBOSE */

 
/*-----------------------------------------------.
| Release the memory associated to this symbol.  |
`-----------------------------------------------*/
 
/*ARGSUSED*/
#if (defined __STDC__ || defined __C99__FUNC__ \
     || defined __cplusplus || defined _MSC_VER)
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
#else
static void
yydestruct (yymsg, yytype, yyvaluep)
    const char *yymsg;
    int yytype;
    YYSTYPE *yyvaluep;
#endif
{
  YYUSE (yyvaluep);
 
  if (!yymsg)
    yymsg = "Deleting";
  YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
 
  switch (yytype)
    {
 
      default:
    break;
    }
}

 
/* Prevent warnings from -Wmissing-prototypes.  */
 
#ifdef YYPARSE_PARAM
#if defined __STDC__ || defined __cplusplus
int yyparse (void *YYPARSE_PARAM);
#else
int yyparse ();
#endif
#else /* ! YYPARSE_PARAM */
#if defined __STDC__ || defined __cplusplus
int yyparse (void);
#else
int yyparse ();
#endif
#endif /* ! YYPARSE_PARAM */
 
 
 
/* The look-ahead symbol.  */
int yychar;
 
/* The semantic value of the look-ahead symbol.  */
YYSTYPE yylval;
 
/* Number of syntax errors so far.  */
int yynerrs;
 
 
 
/*----------.
| yyparse.  |
`----------*/
 
#ifdef YYPARSE_PARAM
#if (defined __STDC__ || defined __C99__FUNC__ \
     || defined __cplusplus || defined _MSC_VER)
int
yyparse (void *YYPARSE_PARAM)
#else
int
yyparse (YYPARSE_PARAM)
    void *YYPARSE_PARAM;
#endif
#else /* ! YYPARSE_PARAM */
#if (defined __STDC__ || defined __C99__FUNC__ \
     || defined __cplusplus || defined _MSC_VER)
int
yyparse (void)
#else
int
yyparse ()
 
#endif
#endif
{
 
  int yystate;
  int yyn;
  int yyresult;
  /* Number of tokens to shift before error messages enabled.  */
  int yyerrstatus;
  /* Look-ahead token as an internal (translated) token number.  */
  int yytoken = 0;
#if YYERROR_VERBOSE
  /* Buffer for error messages, and its allocated size.  */
  char yymsgbuf[128];
  char *yymsg = yymsgbuf;
  YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
#endif
 
  /* 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.  */
  yytype_int16 yyssa[YYINITDEPTH];
  yytype_int16 *yyss = yyssa;
  yytype_int16 *yyssp;
 
  /* The semantic value stack.  */
  YYSTYPE yyvsa[YYINITDEPTH];
  YYSTYPE *yyvs = yyvsa;
  YYSTYPE *yyvsp;
 
 
 
#define YYPOPSTACK(N)   (yyvsp -= (N), yyssp -= (N))
 
  YYSIZE_T yystacksize = YYINITDEPTH;
 
  /* The variables used to return semantic value and location from the
     action routines.  */
  YYSTYPE yyval;
 
 
  /* 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"));
 
  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;
    yytype_int16 *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 (YY_("memory exhausted"),
            &yyss1, yysize * sizeof (*yyssp),
            &yyvs1, yysize * sizeof (*yyvsp),
 
            &yystacksize);
 
    yyss = yyss1;
    yyvs = yyvs1;
      }
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
      goto yyexhaustedlab;
# else
      /* Extend the stack our own way.  */
      if (YYMAXDEPTH <= yystacksize)
    goto yyexhaustedlab;
      yystacksize *= 2;
      if (YYMAXDEPTH < yystacksize)
    yystacksize = YYMAXDEPTH;
 
      {
    yytype_int16 *yyss1 = yyss;
    union yyalloc *yyptr =
      (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
    if (! yyptr)
      goto yyexhaustedlab;
    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
     look-ahead token if we need one and don't already have one.  */
 
  /* First try to decide what to do without reference to look-ahead token.  */
  yyn = yypact[yystate];
  if (yyn == YYPACT_NINF)
    goto yydefault;
 
  /* Not known => get a look-ahead token if don't already have one.  */
 
  /* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead 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);
      YY_SYMBOL_PRINT ("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;
 
  /* Count tokens shifted since error; after three, turn off error
     status.  */
  if (yyerrstatus)
    yyerrstatus--;
 
  /* Shift the look-ahead token.  */
  YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
 
  /* Discard the shifted token unless it is eof.  */
  if (yychar != YYEOF)
    yychar = YYEMPTY;
 
  yystate = yyn;
  *++yyvsp = yylval;
 
  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 153 "arith.y"
    {
            return ((yyvsp[(1) - (1)]));
        }
    break;
 
  case 3:
#line 159 "arith.y"
    { (yyval) = (yyvsp[(2) - (3)]); }
    break;
 
  case 4:
#line 160 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) ? (yyvsp[(1) - (3)]) : (yyvsp[(3) - (3)]) ? (yyvsp[(3) - (3)]) : 0; }
    break;
 
  case 5:
#line 161 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) ? ( (yyvsp[(3) - (3)]) ? (yyvsp[(3) - (3)]) : 0 ) : 0; }
    break;
 
  case 6:
#line 162 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) | (yyvsp[(3) - (3)]); }
    break;
 
  case 7:
#line 163 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) ^ (yyvsp[(3) - (3)]); }
    break;
 
  case 8:
#line 164 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) & (yyvsp[(3) - (3)]); }
    break;
 
  case 9:
#line 165 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) == (yyvsp[(3) - (3)]); }
    break;
 
  case 10:
#line 166 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) > (yyvsp[(3) - (3)]); }
    break;
 
  case 11:
#line 167 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) >= (yyvsp[(3) - (3)]); }
    break;
 
  case 12:
#line 168 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) < (yyvsp[(3) - (3)]); }
    break;
 
  case 13:
#line 169 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) <= (yyvsp[(3) - (3)]); }
    break;
 
  case 14:
#line 170 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) != (yyvsp[(3) - (3)]); }
    break;
 
  case 15:
#line 171 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) << (yyvsp[(3) - (3)]); }
    break;
 
  case 16:
#line 172 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) >> (yyvsp[(3) - (3)]); }
    break;
 
  case 17:
#line 173 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) + (yyvsp[(3) - (3)]); }
    break;
 
  case 18:
#line 174 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) - (yyvsp[(3) - (3)]); }
    break;
 
  case 19:
#line 175 "arith.y"
    { (yyval) = (yyvsp[(1) - (3)]) * (yyvsp[(3) - (3)]); }
    break;
 
  case 20:
#line 176 "arith.y"
    {
            if ((yyvsp[(3) - (3)]) == 0)
                yyerror("division by zero");
            (yyval) = (yyvsp[(1) - (3)]) / (yyvsp[(3) - (3)]);
            }
    break;
 
  case 21:
#line 181 "arith.y"
    {
            if ((yyvsp[(3) - (3)]) == 0)
                yyerror("division by zero");
            (yyval) = (yyvsp[(1) - (3)]) % (yyvsp[(3) - (3)]);
            }
    break;
 
  case 22:
#line 186 "arith.y"
    { (yyval) = !((yyvsp[(2) - (2)])); }
    break;
 
  case 23:
#line 187 "arith.y"
    { (yyval) = ~((yyvsp[(2) - (2)])); }
    break;
 
  case 24:
#line 188 "arith.y"
    { (yyval) = -((yyvsp[(2) - (2)])); }
    break;
 
  case 25:
#line 189 "arith.y"
    { (yyval) = (yyvsp[(2) - (2)]); }
    break;
 
 
/* Line 1267 of yacc.c.  */
#line 1682 "y.tab.c"
      default: break;
    }
  YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
 
  YYPOPSTACK (yylen);
  yylen = 0;
  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
      yyerror (YY_("syntax error"));
#else
      {
    YYSIZE_T yysize = yysyntax_error (0, yystate, yychar);
    if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM)
      {
        YYSIZE_T yyalloc = 2 * yysize;
        if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM))
          yyalloc = YYSTACK_ALLOC_MAXIMUM;
        if (yymsg != yymsgbuf)
          YYSTACK_FREE (yymsg);
        yymsg = (char *) YYSTACK_ALLOC (yyalloc);
        if (yymsg)
          yymsg_alloc = yyalloc;
        else
          {
        yymsg = yymsgbuf;
        yymsg_alloc = sizeof yymsgbuf;
          }
      }
 
    if (0 < yysize && yysize <= yymsg_alloc)
      {
        (void) yysyntax_error (yymsg, yystate, yychar);
        yyerror (yymsg);
      }
    else
      {
        yyerror (YY_("syntax error"));
        if (yysize != 0)
          goto yyexhaustedlab;
      }
      }
#endif
    }
 
 
 
  if (yyerrstatus == 3)
    {
      /* If just tried and failed to reuse look-ahead token after an
     error, discard it.  */
 
      if (yychar <= YYEOF)
    {
      /* Return failure if at end of input.  */
      if (yychar == YYEOF)
        YYABORT;
    }
      else
    {
      yydestruct ("Error: discarding",
              yytoken, &yylval);
      yychar = YYEMPTY;
    }
    }
 
  /* Else will try to reuse look-ahead token after shifting the error
     token.  */
  goto yyerrlab1;
 
 
/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR.  |
`---------------------------------------------------*/
yyerrorlab:
 
  /* Pacify compilers like GCC when the user code never invokes
     YYERROR and the label yyerrorlab therefore never appears in user
     code.  */
  if (/*CONSTCOND*/ 0)
     goto yyerrorlab;
 
  /* Do not reclaim the symbols of the rule which action triggered
     this YYERROR.  */
  YYPOPSTACK (yylen);
  yylen = 0;
  YY_STACK_PRINT (yyss, yyssp);
  yystate = *yyssp;
  goto yyerrlab1;
 
 
/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR.  |
`-------------------------------------------------------------*/
yyerrlab1:
  yyerrstatus = 3;  /* Each real token shifted decrements this.  */
 
  for (;;)
    {
      yyn = yypact[yystate];
      if (yyn != YYPACT_NINF)
    {
      yyn += YYTERROR;
      if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
        {
          yyn = yytable[yyn];
          if (0 < yyn)
        break;
        }
    }
 
      /* Pop the current state because it cannot handle the error token.  */
      if (yyssp == yyss)
    YYABORT;
 
 
      yydestruct ("Error: popping",
          yystos[yystate], yyvsp);
      YYPOPSTACK (1);
      yystate = *yyssp;
      YY_STACK_PRINT (yyss, yyssp);
    }
 
  if (yyn == YYFINAL)
    YYACCEPT;
 
  *++yyvsp = yylval;
 
 
  /* Shift the error token.  */
  YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
 
  yystate = yyn;
  goto yynewstate;
 
 
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here.  |
`-------------------------------------*/
yyacceptlab:
  yyresult = 0;
  goto yyreturn;
 
/*-----------------------------------.
| yyabortlab -- YYABORT comes here.  |
`-----------------------------------*/
yyabortlab:
  yyresult = 1;
  goto yyreturn;
 
#ifndef yyoverflow
/*-------------------------------------------------.
| yyexhaustedlab -- memory exhaustion comes here.  |
`-------------------------------------------------*/
yyexhaustedlab:
  yyerror (YY_("memory exhausted"));
  yyresult = 2;
  /* Fall through.  */
#endif
 
yyreturn:
  if (yychar != YYEOF && yychar != YYEMPTY)
     yydestruct ("Cleanup: discarding lookahead",
         yytoken, &yylval);
  /* Do not reclaim the symbols of the rule which action triggered
     this YYABORT or YYACCEPT.  */
  YYPOPSTACK (yylen);
  YY_STACK_PRINT (yyss, yyssp);
  while (yyssp != yyss)
    {
      yydestruct ("Cleanup: popping",
          yystos[*yyssp], yyvsp);
      YYPOPSTACK (1);
    }
#ifndef yyoverflow
  if (yyss != yyssa)
    YYSTACK_FREE (yyss);
#endif
#if YYERROR_VERBOSE
  if (yymsg != yymsgbuf)
    YYSTACK_FREE (yymsg);
#endif
  /* Make sure YYID is used.  */
  return YYID (yyresult);
}
 
 
#line 192 "arith.y"
 
void
yyerror(s)
    const char *s;
{
 
    yyclearin;
    arith_lex_reset();  /* reprime lex */
    error("arithmetic expression: %s: \"%s\"", s, arith_startbuf);
    /* NOTREACHED */
}
 
 

Rev 2714	Rev 3240
1	/* A Bison parser, made by GNU Bison 2.3. */	1	/* A Bison parser, made by GNU Bison 2.3. */
2		2
3	/* Skeleton implementation for Bison's Yacc-like parsers in C	3	/* Skeleton implementation for Bison's Yacc-like parsers in C
4		4
5	Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006	5	Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
6	Free Software Foundation, Inc.	6	Free Software Foundation, Inc.
7		7
8	This program is free software; you can redistribute it and/or modify	8	This program is free software; you can redistribute it and/or modify
9	it under the terms of the GNU General Public License as published by	9	it under the terms of the GNU General Public License as published by
10	the Free Software Foundation; either version 2, or (at your option)	10	the Free Software Foundation; either version 2, or (at your option)
11	any later version.	11	any later version.
12		12
13	This program is distributed in the hope that it will be useful,	13	This program is distributed in the hope that it will be useful,
14	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	but WITHOUT ANY WARRANTY; without even the implied warranty of
15	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	GNU General Public License for more details.	16	GNU General Public License for more details.
17		17
18	You should have received a copy of the GNU General Public License	18	You should have received a copy of the GNU General Public License
19	along with this program; if not, write to the Free Software	19	along with this program; if not, write to the Free Software
20	Foundation, Inc., 51 Franklin Street, Fifth Floor,	20	Foundation, Inc., 51 Franklin Street, Fifth Floor,
21	Boston, MA 02110-1301, USA. */	21	Boston, MA 02110-1301, USA. */
22		22
23	/* As a special exception, you may create a larger work that contains	23	/* As a special exception, you may create a larger work that contains
24	part or all of the Bison parser skeleton and distribute that work	24	part or all of the Bison parser skeleton and distribute that work
25	under terms of your choice, so long as that work isn't itself a	25	under terms of your choice, so long as that work isn't itself a
26	parser generator using the skeleton or a modified version thereof	26	parser generator using the skeleton or a modified version thereof
27	as a parser skeleton. Alternatively, if you modify or redistribute	27	as a parser skeleton. Alternatively, if you modify or redistribute
28	the parser skeleton itself, you may (at your option) remove this	28	the parser skeleton itself, you may (at your option) remove this
29	special exception, which will cause the skeleton and the resulting	29	special exception, which will cause the skeleton and the resulting
30	Bison output files to be licensed under the GNU General Public	30	Bison output files to be licensed under the GNU General Public
31	License without this special exception.	31	License without this special exception.
32		32
33	This special exception was added by the Free Software Foundation in	33	This special exception was added by the Free Software Foundation in
34	version 2.2 of Bison. */	34	version 2.2 of Bison. */
35		35
36	/* C LALR(1) parser skeleton written by Richard Stallman, by	36	/* C LALR(1) parser skeleton written by Richard Stallman, by
37	simplifying the original so-called "semantic" parser. */	37	simplifying the original so-called "semantic" parser. */
38		38
39	/* All symbols defined below should begin with yy or YY, to avoid	39	/* All symbols defined below should begin with yy or YY, to avoid
40	infringing on user name space. This should be done even for local	40	infringing on user name space. This should be done even for local
41	variables, as they might otherwise be expanded by user macros.	41	variables, as they might otherwise be expanded by user macros.
42	There are some unavoidable exceptions within include files to	42	There are some unavoidable exceptions within include files to
43	define necessary library symbols; they are noted "INFRINGES ON	43	define necessary library symbols; they are noted "INFRINGES ON
44	USER NAME SPACE" below. */	44	USER NAME SPACE" below. */
45		45
46	/* Identify Bison output. */	46	/* Identify Bison output. */
47	#define YYBISON 1	47	#define YYBISON 1
48		48
49	/* Bison version. */	49	/* Bison version. */
50	#define YYBISON_VERSION "2.3"	50	#define YYBISON_VERSION "2.3"
51		51
52	/* Skeleton name. */	52	/* Skeleton name. */
53	#define YYSKELETON_NAME "yacc.c"	53	#define YYSKELETON_NAME "yacc.c"
54		54
55	/* Pure parsers. */	55	/* Pure parsers. */
56	#define YYPURE 0	56	#define YYPURE 0
57		57
58	/* Using locations. */	58	/* Using locations. */
59	#define YYLSP_NEEDED 0	59	#define YYLSP_NEEDED 0
60		60
61		61
62		62
63	/* Tokens. */	63	/* Tokens. */
64	#ifndef YYTOKENTYPE	64	#ifndef YYTOKENTYPE
65	# define YYTOKENTYPE	65	# define YYTOKENTYPE
66	/* Put the tokens into the symbol table, so that GDB and other debuggers	66	/* Put the tokens into the symbol table, so that GDB and other debuggers
67	know about them. */	67	know about them. */
68	enum yytokentype {	68	enum yytokentype {
69	ARITH_NUM = 258,	69	ARITH_NUM = 258,
70	ARITH_LPAREN = 259,	70	ARITH_LPAREN = 259,
71	ARITH_RPAREN = 260,	71	ARITH_RPAREN = 260,
72	ARITH_OR = 261,	72	ARITH_OR = 261,
73	ARITH_AND = 262,	73	ARITH_AND = 262,
74	ARITH_BOR = 263,	74	ARITH_BOR = 263,
75	ARITH_BXOR = 264,	75	ARITH_BXOR = 264,
76	ARITH_BAND = 265,	76	ARITH_BAND = 265,
77	ARITH_NE = 266,	77	ARITH_NE = 266,
78	ARITH_EQ = 267,	78	ARITH_EQ = 267,
79	ARITH_LE = 268,	79	ARITH_LE = 268,
80	ARITH_GE = 269,	80	ARITH_GE = 269,
81	ARITH_GT = 270,	81	ARITH_GT = 270,
82	ARITH_LT = 271,	82	ARITH_LT = 271,
83	ARITH_RSHIFT = 272,	83	ARITH_RSHIFT = 272,
84	ARITH_LSHIFT = 273,	84	ARITH_LSHIFT = 273,
85	ARITH_SUB = 274,	85	ARITH_SUB = 274,
86	ARITH_ADD = 275,	86	ARITH_ADD = 275,
87	ARITH_REM = 276,	87	ARITH_REM = 276,
88	ARITH_DIV = 277,	88	ARITH_DIV = 277,
89	ARITH_MUL = 278,	89	ARITH_MUL = 278,
90	ARITH_BNOT = 279,	90	ARITH_BNOT = 279,
91	ARITH_NOT = 280,	91	ARITH_NOT = 280,
92	ARITH_UNARYPLUS = 281,	92	ARITH_UNARYPLUS = 281,
93	ARITH_UNARYMINUS = 282	93	ARITH_UNARYMINUS = 282
94	};	94	};
95	#endif	95	#endif
96	/* Tokens. */	96	/* Tokens. */
97	#define ARITH_NUM 258	97	#define ARITH_NUM 258
98	#define ARITH_LPAREN 259	98	#define ARITH_LPAREN 259
99	#define ARITH_RPAREN 260	99	#define ARITH_RPAREN 260
100	#define ARITH_OR 261	100	#define ARITH_OR 261
101	#define ARITH_AND 262	101	#define ARITH_AND 262
102	#define ARITH_BOR 263	102	#define ARITH_BOR 263
103	#define ARITH_BXOR 264	103	#define ARITH_BXOR 264
104	#define ARITH_BAND 265	104	#define ARITH_BAND 265
105	#define ARITH_NE 266	105	#define ARITH_NE 266
106	#define ARITH_EQ 267	106	#define ARITH_EQ 267
107	#define ARITH_LE 268	107	#define ARITH_LE 268
108	#define ARITH_GE 269	108	#define ARITH_GE 269
109	#define ARITH_GT 270	109	#define ARITH_GT 270
110	#define ARITH_LT 271	110	#define ARITH_LT 271
111	#define ARITH_RSHIFT 272	111	#define ARITH_RSHIFT 272
112	#define ARITH_LSHIFT 273	112	#define ARITH_LSHIFT 273
113	#define ARITH_SUB 274	113	#define ARITH_SUB 274
114	#define ARITH_ADD 275	114	#define ARITH_ADD 275
115	#define ARITH_REM 276	115	#define ARITH_REM 276
116	#define ARITH_DIV 277	116	#define ARITH_DIV 277
117	#define ARITH_MUL 278	117	#define ARITH_MUL 278
118	#define ARITH_BNOT 279	118	#define ARITH_BNOT 279
119	#define ARITH_NOT 280	119	#define ARITH_NOT 280
120	#define ARITH_UNARYPLUS 281	120	#define ARITH_UNARYPLUS 281
121	#define ARITH_UNARYMINUS 282	121	#define ARITH_UNARYMINUS 282
122		122
123		123
124		124
125		125
126	/* Copy the first part of user declarations. */	126	/* Copy the first part of user declarations. */
127	#line 1 "arith.y"	127	#line 1 "arith.y"
128		128
129	/* $NetBSD: arith.y,v 1.13 1999/07/09 03:05:49 christos Exp $ */	129	/* $NetBSD: arith.y,v 1.13 1999/07/09 03:05:49 christos Exp $ */
130		130
131	/*-	131	/*-
132	* Copyright (c) 1993	132	* Copyright (c) 1993
133	* The Regents of the University of California. All rights reserved.	133	* The Regents of the University of California. All rights reserved.
134	*	134	*
135	* This code is derived from software contributed to Berkeley by	135	* This code is derived from software contributed to Berkeley by
136	* Kenneth Almquist.	136	* Kenneth Almquist.
137	*	137	*
138	* Redistribution and use in source and binary forms, with or without	138	* Redistribution and use in source and binary forms, with or without
139	* modification, are permitted provided that the following conditions	139	* modification, are permitted provided that the following conditions
140	* are met:	140	* are met:
141	* 1. Redistributions of source code must retain the above copyright	141	* 1. Redistributions of source code must retain the above copyright
142	* notice, this list of conditions and the following disclaimer.	142	* notice, this list of conditions and the following disclaimer.
143	* 2. Redistributions in binary form must reproduce the above copyright	143	* 2. Redistributions in binary form must reproduce the above copyright
144	* notice, this list of conditions and the following disclaimer in the	144	* notice, this list of conditions and the following disclaimer in the
145	* documentation and/or other materials provided with the distribution.	145	* documentation and/or other materials provided with the distribution.
146	* 3. All advertising materials mentioning features or use of this software	146	* 3. All advertising materials mentioning features or use of this software
147	* must display the following acknowledgement:	147	* must display the following acknowledgement:
148	* This product includes software developed by the University of	148	* This product includes software developed by the University of
149	* California, Berkeley and its contributors.	149	* California, Berkeley and its contributors.
150	* 4. Neither the name of the University nor the names of its contributors	150	* 4. Neither the name of the University nor the names of its contributors
151	* may be used to endorse or promote products derived from this software	151	* may be used to endorse or promote products derived from this software
152	* without specific prior written permission.	152	* without specific prior written permission.
153	*	153	*
154	* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND	154	* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
155	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE	155	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
156	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE	156	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
157	* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE	157	* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
158	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL	158	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
159	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS	159	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
160	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)	160	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
161	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT	161	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
162	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY	162	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
163	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF	163	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
164	* SUCH DAMAGE.	164	* SUCH DAMAGE.
165	*/	165	*/
166		166
167	#include <sys/cdefs.h>	167	#include <sys/cdefs.h>
168	#ifndef lint	168	#ifndef lint
169	#if 0	169	#if 0
170	static char sccsid[] = "@(#)arith.y 8.3 (Berkeley) 5/4/95";	170	static char sccsid[] = "@(#)arith.y 8.3 (Berkeley) 5/4/95";
171	#else	171	#else
172	__RCSID("$NetBSD: arith.y,v 1.13 1999/07/09 03:05:49 christos Exp $");	172	__RCSID("$NetBSD: arith.y,v 1.13 1999/07/09 03:05:49 christos Exp $");
173	#endif	173	#endif
174	#endif /* not lint */	174	#endif /* not lint */
175		175
176	#include <stdlib.h>	176	#include <stdlib.h>
177	#include "expand.h"	177	#include "expand.h"
178	#include "shell.h"	178	#include "shell.h"
179	#include "error.h"	179	#include "error.h"
180	#include "output.h"	180	#include "output.h"
181	#include "memalloc.h"	181	#include "memalloc.h"
182		182
183	const char arith_buf, arith_startbuf;	183	const char arith_buf, arith_startbuf;
184		184
185	void yyerror (const char *);	185	void yyerror (const char *);
186	int yyparse (void);	186	int yyparse (void);
187	#ifdef TESTARITH	187	#ifdef TESTARITH
188	int main (int , char *[]);	188	int main (int , char *[]);
189	int error (char *);	189	int error (char *);
190	#endif	190	#endif
191		191
192	int	192	int
193	arith(s)	193	arith(s)
194	const char *s;	194	const char *s;
195	{	195	{
196	long result;	196	long result;
197		197
198	arith_buf = arith_startbuf = s;	198	arith_buf = arith_startbuf = s;
199		199
200	INTOFF;	200	INTOFF;
201	result = yyparse();	201	result = yyparse();
202	arith_lex_reset(); /* reprime lex */	202	arith_lex_reset(); /* reprime lex */
203	INTON;	203	INTON;
204		204
205	return (result);	205	return (result);
206	}	206	}
207		207
208		208
209	/*	209	/*
210	* The exp(1) builtin.	210	* The exp(1) builtin.
211	*/	211	*/
212	int	212	int
213	expcmd(argc, argv)	213	expcmd(argc, argv)
214	int argc;	214	int argc;
215	char **argv;	215	char **argv;
216	{	216	{
217	const char *p;	217	const char *p;
218	char *concat;	218	char *concat;
219	char **ap;	219	char **ap;
220	long i;	220	long i;
221		221
222	if (argc > 1) {	222	if (argc > 1) {
223	p = argv[1];	223	p = argv[1];
224	if (argc > 2) {	224	if (argc > 2) {
225	/*	225	/*
226	* concatenate arguments	226	* concatenate arguments
227	*/	227	*/
228	STARTSTACKSTR(concat);	228	STARTSTACKSTR(concat);
229	ap = argv + 2;	229	ap = argv + 2;
230	for (;;) {	230	for (;;) {
231	while (*p)	231	while (*p)
232	STPUTC(*p++, concat);	232	STPUTC(*p++, concat);
233	if ((p = *ap++) == NULL)	233	if ((p = *ap++) == NULL)
234	break;	234	break;
235	STPUTC(' ', concat);	235	STPUTC(' ', concat);
236	}	236	}
237	STPUTC('\0', concat);	237	STPUTC('\0', concat);
238	p = grabstackstr(concat);	238	p = grabstackstr(concat);
239	}	239	}
240	} else	240	} else
241	p = "";	241	p = "";
242		242
243	i = arith(p);	243	i = arith(p);
244		244
245	out1fmt("%ld\n", i);	245	out1fmt("%ld\n", i);
246	return (! i);	246	return (! i);
247	}	247	}
248		248
249	/*************************/	249	/*************************/
250	#ifdef TEST_ARITH	250	#ifdef TEST_ARITH
251	#include <stdio.h>	251	#include <stdio.h>
252	main(argc, argv)	252	main(argc, argv)
253	char *argv[];	253	char *argv[];
254	{	254	{
255	printf("%d\n", exp(argv[1]));	255	printf("%d\n", exp(argv[1]));
256	}	256	}
257	error(s)	257	error(s)
258	char *s;	258	char *s;
259	{	259	{
260	fprintf(stderr, "exp: %s\n", s);	260	fprintf(stderr, "exp: %s\n", s);
261	exit(1);	261	exit(1);
262	}	262	}
263	#endif	263	#endif
264		264
265		265
266	/* Enabling traces. */	266	/* Enabling traces. */
267	#ifndef YYDEBUG	267	#ifndef YYDEBUG
268	# define YYDEBUG 0	268	# define YYDEBUG 0
269	#endif	269	#endif
270		270
271	/* Enabling verbose error messages. */	271	/* Enabling verbose error messages. */
272	#ifdef YYERROR_VERBOSE	272	#ifdef YYERROR_VERBOSE
273	# undef YYERROR_VERBOSE	273	# undef YYERROR_VERBOSE
274	# define YYERROR_VERBOSE 1	274	# define YYERROR_VERBOSE 1
275	#else	275	#else
276	# define YYERROR_VERBOSE 0	276	# define YYERROR_VERBOSE 0
277	#endif	277	#endif
278		278
279	/* Enabling the token table. */	279	/* Enabling the token table. */
280	#ifndef YYTOKEN_TABLE	280	#ifndef YYTOKEN_TABLE
281	# define YYTOKEN_TABLE 0	281	# define YYTOKEN_TABLE 0
282	#endif	282	#endif
283		283
284	#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED	284	#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
285	typedef int YYSTYPE;	285	typedef int YYSTYPE;
286	# define yystype YYSTYPE /* obsolescent; will be withdrawn */	286	# define yystype YYSTYPE /* obsolescent; will be withdrawn */
287	# define YYSTYPE_IS_DECLARED 1	287	# define YYSTYPE_IS_DECLARED 1
288	# define YYSTYPE_IS_TRIVIAL 1	288	# define YYSTYPE_IS_TRIVIAL 1
289	#endif	289	#endif
290		290
291		291
292		292
293	/* Copy the second part of user declarations. */	293	/* Copy the second part of user declarations. */
294		294
295		295
296	/* Line 216 of yacc.c. */	296	/* Line 216 of yacc.c. */
297	#line 298 "y.tab.c"	297	#line 298 "y.tab.c"
298		298
299	#ifdef short	299	#ifdef short
300	# undef short	300	# undef short
301	#endif	301	#endif
302		302
303	#ifdef YYTYPE_UINT8	303	#ifdef YYTYPE_UINT8
304	typedef YYTYPE_UINT8 yytype_uint8;	304	typedef YYTYPE_UINT8 yytype_uint8;
305	#else	305	#else
306	typedef unsigned char yytype_uint8;	306	typedef unsigned char yytype_uint8;
307	#endif	307	#endif
308		308
309	#ifdef YYTYPE_INT8	309	#ifdef YYTYPE_INT8
310	typedef YYTYPE_INT8 yytype_int8;	310	typedef YYTYPE_INT8 yytype_int8;
311	#elif (defined __STDC__ \|\| defined __C99__FUNC__ \	311	#elif (defined __STDC__ \|\| defined __C99__FUNC__ \
312	\|\| defined __cplusplus \|\| defined _MSC_VER)	312	\|\| defined __cplusplus \|\| defined _MSC_VER)
313	typedef signed char yytype_int8;	313	typedef signed char yytype_int8;
314	#else	314	#else
315	typedef short int yytype_int8;	315	typedef short int yytype_int8;
316	#endif	316	#endif
317		317
318	#ifdef YYTYPE_UINT16	318	#ifdef YYTYPE_UINT16
319	typedef YYTYPE_UINT16 yytype_uint16;	319	typedef YYTYPE_UINT16 yytype_uint16;
320	#else	320	#else
321	typedef unsigned short int yytype_uint16;	321	typedef unsigned short int yytype_uint16;
322	#endif	322	#endif
323		323
324	#ifdef YYTYPE_INT16	324	#ifdef YYTYPE_INT16
325	typedef YYTYPE_INT16 yytype_int16;	325	typedef YYTYPE_INT16 yytype_int16;
326	#else	326	#else
327	typedef short int yytype_int16;	327	typedef short int yytype_int16;
328	#endif	328	#endif
329		329
330	#ifndef YYSIZE_T	330	#ifndef YYSIZE_T
331	# ifdef __SIZE_TYPE__	331	# ifdef __SIZE_TYPE__
332	# define YYSIZE_T __SIZE_TYPE__	332	# define YYSIZE_T __SIZE_TYPE__
333	# elif defined size_t	333	# elif defined size_t
334	# define YYSIZE_T size_t	334	# define YYSIZE_T size_t
335	# elif ! defined YYSIZE_T && (defined __STDC__ \|\| defined __C99__FUNC__ \	335	# elif ! defined YYSIZE_T && (defined __STDC__ \|\| defined __C99__FUNC__ \
336	\|\| defined __cplusplus \|\| defined _MSC_VER)	336	\|\| defined __cplusplus \|\| defined _MSC_VER)
337	# include <stddef.h> /* INFRINGES ON USER NAME SPACE */	337	# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
338	# define YYSIZE_T size_t	338	# define YYSIZE_T size_t
339	# else	339	# else
340	# define YYSIZE_T unsigned int	340	# define YYSIZE_T unsigned int
341	# endif	341	# endif
342	#endif	342	#endif
343		343
344	#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)	344	#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
345		345
346	#ifndef YY_	346	#ifndef YY_
347	# if YYENABLE_NLS	347	# if YYENABLE_NLS
348	# if ENABLE_NLS	348	# if ENABLE_NLS
349	# include <libintl.h> /* INFRINGES ON USER NAME SPACE */	349	# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
350	# define YY_(msgid) dgettext ("bison-runtime", msgid)	350	# define YY_(msgid) dgettext ("bison-runtime", msgid)
351	# endif	351	# endif
352	# endif	352	# endif
353	# ifndef YY_	353	# ifndef YY_
354	# define YY_(msgid) msgid	354	# define YY_(msgid) msgid
355	# endif	355	# endif
356	#endif	356	#endif
357		357
358	/* Suppress unused-variable warnings by "using" E. */	358	/* Suppress unused-variable warnings by "using" E. */
359	#if ! defined lint \|\| defined __GNUC__	359	#if ! defined lint \|\| defined __GNUC__
360	# define YYUSE(e) ((void) (e))	360	# define YYUSE(e) ((void) (e))
361	#else	361	#else
362	# define YYUSE(e) /* empty */	362	# define YYUSE(e) /* empty */
363	#endif	363	#endif
364		364
365	/* Identity function, used to suppress warnings about constant conditions. */	365	/* Identity function, used to suppress warnings about constant conditions. */
366	#ifndef lint	366	#ifndef lint
367	# define YYID(n) (n)	367	# define YYID(n) (n)
368	#else	368	#else
369	#if (defined __STDC__ \|\| defined __C99__FUNC__ \	369	#if (defined __STDC__ \|\| defined __C99__FUNC__ \
370	\|\| defined __cplusplus \|\| defined _MSC_VER)	370	\|\| defined __cplusplus \|\| defined _MSC_VER)
371	static int	371	static int
372	YYID (int i)	372	YYID (int i)
373	#else	373	#else
374	static int	374	static int
375	YYID (i)	375	YYID (i)
376	int i;	376	int i;
377	#endif	377	#endif
378	{	378	{
379	return i;	379	return i;
380	}	380	}
381	#endif	381	#endif
382		382
383	#if ! defined yyoverflow \|\| YYERROR_VERBOSE	383	#if ! defined yyoverflow \|\| YYERROR_VERBOSE
384		384
385	/* The parser invokes alloca or malloc; define the necessary symbols. */	385	/* The parser invokes alloca or malloc; define the necessary symbols. */
386		386
387	# ifdef YYSTACK_USE_ALLOCA	387	# ifdef YYSTACK_USE_ALLOCA
388	# if YYSTACK_USE_ALLOCA	388	# if YYSTACK_USE_ALLOCA
389	# ifdef __GNUC__	389	# ifdef __GNUC__
390	# define YYSTACK_ALLOC __builtin_alloca	390	# define YYSTACK_ALLOC __builtin_alloca
391	# elif defined __BUILTIN_VA_ARG_INCR	391	# elif defined __BUILTIN_VA_ARG_INCR
392	# include <alloca.h> /* INFRINGES ON USER NAME SPACE */	392	# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
393	# elif defined _AIX	393	# elif defined _AIX
394	# define YYSTACK_ALLOC __alloca	394	# define YYSTACK_ALLOC __alloca
395	# elif defined _MSC_VER	395	# elif defined _MSC_VER
396	# include <malloc.h> /* INFRINGES ON USER NAME SPACE */	396	# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
397	# define alloca _alloca	397	# define alloca _alloca
398	# else	398	# else
399	# define YYSTACK_ALLOC alloca	399	# define YYSTACK_ALLOC alloca
400	# if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ \|\| defined __C99__FUNC__ \	400	# if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ \|\| defined __C99__FUNC__ \
401	\|\| defined __cplusplus \|\| defined _MSC_VER)	401	\|\| defined __cplusplus \|\| defined _MSC_VER)
402	# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */	402	# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
403	# ifndef _STDLIB_H	403	# ifndef _STDLIB_H
404	# define _STDLIB_H 1	404	# define _STDLIB_H 1
405	# endif	405	# endif
406	# endif	406	# endif
407	# endif	407	# endif
408	# endif	408	# endif
409	# endif	409	# endif
410		410
411	# ifdef YYSTACK_ALLOC	411	# ifdef YYSTACK_ALLOC
412	/* Pacify GCC's `empty if-body' warning. */	412	/* Pacify GCC's `empty if-body' warning. */
413	# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))	413	# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
414	# ifndef YYSTACK_ALLOC_MAXIMUM	414	# ifndef YYSTACK_ALLOC_MAXIMUM
415	/* The OS might guarantee only one guard page at the bottom of the stack,	415	/* The OS might guarantee only one guard page at the bottom of the stack,
416	and a page size can be as small as 4096 bytes. So we cannot safely	416	and a page size can be as small as 4096 bytes. So we cannot safely
417	invoke alloca (N) if N exceeds 4096. Use a slightly smaller number	417	invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
418	to allow for a few compiler-allocated temporary stack slots. */	418	to allow for a few compiler-allocated temporary stack slots. */
419	# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */	419	# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
420	# endif	420	# endif
421	# else	421	# else
422	# define YYSTACK_ALLOC YYMALLOC	422	# define YYSTACK_ALLOC YYMALLOC
423	# define YYSTACK_FREE YYFREE	423	# define YYSTACK_FREE YYFREE
424	# ifndef YYSTACK_ALLOC_MAXIMUM	424	# ifndef YYSTACK_ALLOC_MAXIMUM
425	# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM	425	# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
426	# endif	426	# endif
427	# if (defined __cplusplus && ! defined _STDLIB_H \	427	# if (defined __cplusplus && ! defined _STDLIB_H \
428	&& ! ((defined YYMALLOC \|\| defined malloc) \	428	&& ! ((defined YYMALLOC \|\| defined malloc) \
429	&& (defined YYFREE \|\| defined free)))	429	&& (defined YYFREE \|\| defined free)))
430	# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */	430	# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
431	# ifndef _STDLIB_H	431	# ifndef _STDLIB_H
432	# define _STDLIB_H 1	432	# define _STDLIB_H 1
433	# endif	433	# endif
434	# endif	434	# endif
435	# ifndef YYMALLOC	435	# ifndef YYMALLOC
436	# define YYMALLOC malloc	436	# define YYMALLOC malloc
437	# if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ \|\| defined __C99__FUNC__ \	437	# if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ \|\| defined __C99__FUNC__ \
438	\|\| defined __cplusplus \|\| defined _MSC_VER)	438	\|\| defined __cplusplus \|\| defined _MSC_VER)
439	void malloc (YYSIZE_T); / INFRINGES ON USER NAME SPACE */	439	void malloc (YYSIZE_T); / INFRINGES ON USER NAME SPACE */
440	# endif	440	# endif
441	# endif	441	# endif
442	# ifndef YYFREE	442	# ifndef YYFREE
443	# define YYFREE free	443	# define YYFREE free
444	# if ! defined free && ! defined _STDLIB_H && (defined __STDC__ \|\| defined __C99__FUNC__ \	444	# if ! defined free && ! defined _STDLIB_H && (defined __STDC__ \|\| defined __C99__FUNC__ \
445	\|\| defined __cplusplus \|\| defined _MSC_VER)	445	\|\| defined __cplusplus \|\| defined _MSC_VER)
446	void free (void ); / INFRINGES ON USER NAME SPACE */	446	void free (void ); / INFRINGES ON USER NAME SPACE */
447	# endif	447	# endif
448	# endif	448	# endif
449	# endif	449	# endif
450	#endif /* ! defined yyoverflow \|\| YYERROR_VERBOSE */	450	#endif /* ! defined yyoverflow \|\| YYERROR_VERBOSE */
451		451
452		452
453	#if (! defined yyoverflow \	453	#if (! defined yyoverflow \
454	&& (! defined __cplusplus \	454	&& (! defined __cplusplus \
455	\|\| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))	455	\|\| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
456		456
457	/* A type that is properly aligned for any stack member. */	457	/* A type that is properly aligned for any stack member. */
458	union yyalloc	458	union yyalloc
459	{	459	{
460	yytype_int16 yyss;	460	yytype_int16 yyss;
461	YYSTYPE yyvs;	461	YYSTYPE yyvs;
462	};	462	};
463		463
464	/* The size of the maximum gap between one aligned stack and the next. */	464	/* The size of the maximum gap between one aligned stack and the next. */
465	# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)	465	# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
466		466
467	/* The size of an array large to enough to hold all stacks, each with	467	/* The size of an array large to enough to hold all stacks, each with
468	N elements. */	468	N elements. */
469	# define YYSTACK_BYTES(N) \	469	# define YYSTACK_BYTES(N) \
470	((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \	470	((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \
471	+ YYSTACK_GAP_MAXIMUM)	471	+ YYSTACK_GAP_MAXIMUM)
472		472
473	/* Copy COUNT objects from FROM to TO. The source and destination do	473	/* Copy COUNT objects from FROM to TO. The source and destination do
474	not overlap. */	474	not overlap. */
475	# ifndef YYCOPY	475	# ifndef YYCOPY
476	# if defined __GNUC__ && 1 < __GNUC__	476	# if defined __GNUC__ && 1 < __GNUC__
477	# define YYCOPY(To, From, Count) \	477	# define YYCOPY(To, From, Count) \
478	__builtin_memcpy (To, From, (Count) * sizeof (*(From)))	478	__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
479	# else	479	# else
480	# define YYCOPY(To, From, Count) \	480	# define YYCOPY(To, From, Count) \
481	do \	481	do \
482	{ \	482	{ \
483	YYSIZE_T yyi; \	483	YYSIZE_T yyi; \
484	for (yyi = 0; yyi < (Count); yyi++) \	484	for (yyi = 0; yyi < (Count); yyi++) \
485	(To)[yyi] = (From)[yyi]; \	485	(To)[yyi] = (From)[yyi]; \
486	} \	486	} \
487	while (YYID (0))	487	while (YYID (0))
488	# endif	488	# endif
489	# endif	489	# endif
490		490
491	/* Relocate STACK from its old location to the new one. The	491	/* Relocate STACK from its old location to the new one. The
492	local variables YYSIZE and YYSTACKSIZE give the old and new number of	492	local variables YYSIZE and YYSTACKSIZE give the old and new number of
493	elements in the stack, and YYPTR gives the new location of the	493	elements in the stack, and YYPTR gives the new location of the
494	stack. Advance YYPTR to a properly aligned location for the next	494	stack. Advance YYPTR to a properly aligned location for the next
495	stack. */	495	stack. */
496	# define YYSTACK_RELOCATE(Stack) \	496	# define YYSTACK_RELOCATE(Stack) \
497	do \	497	do \
498	{ \	498	{ \
499	YYSIZE_T yynewbytes; \	499	YYSIZE_T yynewbytes; \
500	YYCOPY (&yyptr->Stack, Stack, yysize); \	500	YYCOPY (&yyptr->Stack, Stack, yysize); \

Subversion Repositories HelenOS

(root)/branches/cs/uspace/app/ash/arith.c @ 3513 – Rev 2714 → 3240