ast_expr.c

Go to the documentation of this file.

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

/* Skeleton parser for Yacc-like parsing with Bison,
   Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.

   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2, or (at your option)
   any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place - Suite 330,
   Boston, MA 02111-1307, USA.  */

/* As a special exception, when this file is copied by Bison into a
   Bison output file, you may use that output file without restriction.
   This special exception was added by the Free Software Foundation
   in version 1.24 of Bison.  */

/* Written by Richard Stallman by simplifying the original so called
   ``semantic'' parser.  */

/* All symbols defined below should begin with yy or YY, to avoid
   infringing on user name space.  This should be done even for local
   variables, as they might otherwise be expanded by user macros.
   There are some unavoidable exceptions within include files to
   define necessary library symbols; they are noted "INFRINGES ON
   USER NAME SPACE" below.  */

/* Identify Bison output.  */
#define YYBISON 1

/* Skeleton name.  */
#define YYSKELETON_NAME "yacc.c"

/* Pure parsers.  */
#define YYPURE 1

/* Using locations.  */
#define YYLSP_NEEDED 1

/* Substitute the variable and function names.  */
#define yyparse ast_yyparse
#define yylex   ast_yylex
#define yyerror ast_yyerror
#define yylval  ast_yylval
#define yychar  ast_yychar
#define yydebug ast_yydebug
#define yynerrs ast_yynerrs
#define yylloc ast_yylloc

/* Tokens.  */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
   /* Put the tokens into the symbol table, so that GDB and other debuggers
      know about them.  */
   enum yytokentype {
     NE = 258,
     LE = 259,
     GE = 260,
     TOKEN = 261
   };
#endif
#define NE 258
#define LE 259
#define GE 260
#define TOKEN 261




/* Copy the first part of user declarations.  */
#line 1 "ast_expr.y"

/* Written by Pace Willisson (pace@blitz.com) 
 * and placed in the public domain.
 *
 * Largely rewritten by J.T. Conklin (jtc@wimsey.com)
 *
 * $FreeBSD: src/bin/expr/expr.y,v 1.16 2000/07/22 10:59:36 se Exp $
 */

#include <sys/types.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <locale.h>
#include <ctype.h>
#include <err.h>
#include <errno.h>
#include <regex.h>
#include <limits.h>
#include <asterisk/ast_expr.h>
#include <asterisk/logger.h>

#ifdef LONG_LONG_MIN
#define QUAD_MIN LONG_LONG_MIN
#endif
#ifdef LONG_LONG_MAX
#define QUAD_MAX LONG_LONG_MAX
#endif

#  if ! defined(QUAD_MIN)
#   define QUAD_MIN     (-0x7fffffffffffffffL-1)
#  endif
#  if ! defined(QUAD_MAX)
#   define QUAD_MAX     (0x7fffffffffffffffL)
#  endif

#define YYPARSE_PARAM kota
#define YYLEX_PARAM kota

/* #define ast_log fprintf
#define LOG_WARNING stderr */
  
enum valtype {
   integer, numeric_string, string
} ;

struct val {
   enum valtype type;
   union {
      char *s;
      quad_t i;
   } u;
} ;

struct parser_control {
   struct val *result;
   int pipa;
   char *arg_orig;
   char *argv;
   char *ptrptr;
   int firsttoken;
} ;

static int     chk_div __P((quad_t, quad_t));
static int     chk_minus __P((quad_t, quad_t, quad_t));
static int     chk_plus __P((quad_t, quad_t, quad_t));
static int     chk_times __P((quad_t, quad_t, quad_t));
static void    free_value __P((struct val *));
static int     is_zero_or_null __P((struct val *));
static int     isstring __P((struct val *));
static struct val *make_integer __P((quad_t));
static struct val *make_str __P((const char *));
static struct val *op_and __P((struct val *, struct val *));
static struct val *op_colon __P((struct val *, struct val *));
static struct val *op_div __P((struct val *, struct val *));
static struct val *op_eq __P((struct val *, struct val *));
static struct val *op_ge __P((struct val *, struct val *));
static struct val *op_gt __P((struct val *, struct val *));
static struct val *op_le __P((struct val *, struct val *));
static struct val *op_lt __P((struct val *, struct val *));
static struct val *op_minus __P((struct val *, struct val *));
static struct val *op_ne __P((struct val *, struct val *));
static struct val *op_or __P((struct val *, struct val *));
static struct val *op_plus __P((struct val *, struct val *));
static struct val *op_rem __P((struct val *, struct val *));
static struct val *op_times __P((struct val *, struct val *));
static quad_t     to_integer __P((struct val *));
static void    to_string __P((struct val *));

/* uh, if I want to predeclare yylex with a YYLTYPE, I have to predeclare the yyltype... sigh */
typedef struct yyltype
{
  int first_line;
  int first_column;

  int last_line;
  int last_column;
} yyltype;

# define YYLTYPE yyltype
# define YYLTYPE_IS_TRIVIAL 1

static int     ast_yyerror __P((const char *,YYLTYPE *, struct parser_control *));

#define ast_yyerror(x) ast_yyerror(x,&yyloc,kota)



/* Enabling traces.  */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif

/* Enabling verbose error messages.  */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif

#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED)
#line 116 "ast_expr.y"
typedef union YYSTYPE {
   struct val *val;
} YYSTYPE;
/* Line 190 of yacc.c.  */
#line 208 "ast_expr.c"
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
# define YYSTYPE_IS_DECLARED 1
# define YYSTYPE_IS_TRIVIAL 1
#endif

#if ! defined (YYLTYPE) && ! defined (YYLTYPE_IS_DECLARED)
typedef struct YYLTYPE
{
  int first_line;
  int first_column;
  int last_line;
  int last_column;
} YYLTYPE;
# define yyltype YYLTYPE /* obsolescent; will be withdrawn */
# define YYLTYPE_IS_DECLARED 1
# define YYLTYPE_IS_TRIVIAL 1
#endif


/* Copy the second part of user declarations.  */
#line 120 "ast_expr.y"

static int     ast_yylex __P((YYSTYPE *, YYLTYPE *, struct parser_control *));


/* Line 213 of yacc.c.  */
#line 235 "ast_expr.c"

#if ! defined (yyoverflow) || YYERROR_VERBOSE

# ifndef YYFREE
#  define YYFREE free
# endif
# ifndef YYMALLOC
#  define YYMALLOC malloc
# endif

/* 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
#   else
#    define YYSTACK_ALLOC alloca
#   endif
#  endif
# endif

# ifdef YYSTACK_ALLOC
   /* Pacify GCC's `empty if-body' warning. */
#  define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
# else
#  if defined (__STDC__) || defined (__cplusplus)
#   include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
#   define YYSIZE_T size_t
#  endif
#  define YYSTACK_ALLOC YYMALLOC
#  define YYSTACK_FREE YYFREE
# endif
#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */


#if (! defined (yyoverflow) \
     && (! defined (__cplusplus) \
    || (defined (YYLTYPE_IS_TRIVIAL) && YYLTYPE_IS_TRIVIAL \
             && defined (YYSTYPE_IS_TRIVIAL) && YYSTYPE_IS_TRIVIAL)))

/* A type that is properly aligned for any stack member.  */
union yyalloc
{
  short int yyss;
  YYSTYPE yyvs;
    YYLTYPE yyls;
};

/* The size of the maximum gap between one aligned stack and the next.  */
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)

/* The size of an array large to enough to hold all stacks, each with
   N elements.  */
# define YYSTACK_BYTES(N) \
     ((N) * (sizeof (short int) + sizeof (YYSTYPE) + sizeof (YYLTYPE))  \
      + 2 * 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             \
   {              \
     register YYSIZE_T yyi;      \
     for (yyi = 0; yyi < (Count); yyi++)  \
       (To)[yyi] = (From)[yyi];     \
   }              \
      while (0)
#  endif
# endif

/* Relocate STACK from its old location to the new one.  The
   local variables YYSIZE and YYSTACKSIZE give the old and new number of
   elements in the stack, and YYPTR gives the new location of the
   stack.  Advance YYPTR to a properly aligned location for the next
   stack.  */
# define YYSTACK_RELOCATE(Stack)             \
    do                           \
      {                          \
   YYSIZE_T yynewbytes;                \
   YYCOPY (&yyptr->Stack, Stack, yysize);          \
   Stack = &yyptr->Stack;                 \
   yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
   yyptr += yynewbytes / sizeof (*yyptr);          \
      }                          \
    while (0)

#endif

#if defined (__STDC__) || defined (__cplusplus)
   typedef signed char yysigned_char;
#else
   typedef short int yysigned_char;
#endif

/* YYFINAL -- State number of the termination state. */
#define YYFINAL  6
/* YYLAST -- Last index in YYTABLE.  */
#define YYLAST   83

/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS  20
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS  3
/* YYNRULES -- Number of rules. */
#define YYNRULES  18
/* YYNRULES -- Number of states. */
#define YYNSTATES  36

/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX.  */
#define YYUNDEFTOK  2
#define YYMAXUTOK   261

#define YYTRANSLATE(YYX)                  \
  ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)

/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX.  */
static const unsigned char yytranslate[] =
{
       0,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,    15,     4,     2,
      18,    19,    13,    11,     2,    12,     2,    14,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,    16,     2,
       7,     5,     6,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     3,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     1,     2,     8,     9,
      10,    17
};

#if YYDEBUG
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
   YYRHS.  */
static const unsigned char yyprhs[] =
{
       0,     0,     3,     5,     7,    11,    15,    19,    23,    27,
      31,    35,    39,    43,    47,    51,    55,    59,    63
};

/* YYRHS -- A `-1'-separated list of the rules' RHS. */
static const yysigned_char yyrhs[] =
{
      21,     0,    -1,    22,    -1,    17,    -1,    18,    22,    19,
      -1,    22,     3,    22,    -1,    22,     4,    22,    -1,    22,
       5,    22,    -1,    22,     6,    22,    -1,    22,     7,    22,
      -1,    22,    10,    22,    -1,    22,     9,    22,    -1,    22,
       8,    22,    -1,    22,    11,    22,    -1,    22,    12,    22,
      -1,    22,    13,    22,    -1,    22,    14,    22,    -1,    22,
      15,    22,    -1,    22,    16,    22,    -1
};

/* YYRLINE[YYN] -- source line where rule number YYN was defined.  */
static const unsigned char yyrline[] =
{
       0,   137,   137,   140,   141,   142,   143,   144,   145,   146,
     147,   148,   149,   150,   151,   152,   153,   154,   155
};
#endif

#if YYDEBUG || YYERROR_VERBOSE
/* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
   First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
  "$end", "error", "$undefined", "'|'", "'&'", "'='", "'>'", "'<'", "NE",
  "LE", "GE", "'+'", "'-'", "'*'", "'/'", "'%'", "':'", "TOKEN", "'('",
  "')'", "$accept", "start", "expr", 0
};
#endif

# ifdef YYPRINT
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
   token YYLEX-NUM.  */
static const unsigned short int yytoknum[] =
{
       0,   256,   257,   124,    38,    61,    62,    60,   258,   259,
     260,    43,    45,    42,    47,    37,    58,   261,    40,    41
};
# endif

/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives.  */
static const unsigned char yyr1[] =
{
       0,    20,    21,    22,    22,    22,    22,    22,    22,    22,
      22,    22,    22,    22,    22,    22,    22,    22,    22
};

/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN.  */
static const unsigned char yyr2[] =
{
       0,     2,     1,     1,     3,     3,     3,     3,     3,     3,
       3,     3,     3,     3,     3,     3,     3,     3,     3
};

/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
   STATE-NUM when YYTABLE doesn't specify something else to do.  Zero
   means the default is an error.  */
static const unsigned char yydefact[] =
{
       0,     3,     0,     0,     2,     0,     1,     0,     0,     0,
       0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
       0,     4,     5,     6,     7,     8,     9,    12,    11,    10,
      13,    14,    15,    16,    17,    18
};

/* YYDEFGOTO[NTERM-NUM]. */
static const yysigned_char yydefgoto[] =
{
      -1,     3,     4
};

/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
   STATE-NUM.  */
#define YYPACT_NINF -13
static const yysigned_char yypact[] =
{
      65,   -13,    65,    34,    33,    16,   -13,    65,    65,    65,
      65,    65,    65,    65,    65,    65,    65,    65,    65,    65,
      65,   -13,    46,    58,    64,    64,    64,    64,    64,    64,
     -12,   -12,    17,    17,    17,   -13
};

/* YYPGOTO[NTERM-NUM].  */
static const yysigned_char 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 unsigned char yytable[] =
{
       5,    17,    18,    19,    20,    22,    23,    24,    25,    26,
      27,    28,    29,    30,    31,    32,    33,    34,    35,     7,
       8,     9,    10,    11,    12,    13,    14,    15,    16,    17,
      18,    19,    20,    20,     6,    21,     7,     8,     9,    10,
      11,    12,    13,    14,    15,    16,    17,    18,    19,    20,
       8,     9,    10,    11,    12,    13,    14,    15,    16,    17,
      18,    19,    20,     9,    10,    11,    12,    13,    14,    15,
      16,    17,    18,    19,    20,    15,    16,    17,    18,    19,
      20,     0,     1,     2
};

static const yysigned_char yycheck[] =
{
       2,    13,    14,    15,    16,     7,     8,     9,    10,    11,
      12,    13,    14,    15,    16,    17,    18,    19,    20,     3,
       4,     5,     6,     7,     8,     9,    10,    11,    12,    13,
      14,    15,    16,    16,     0,    19,     3,     4,     5,     6,
       7,     8,     9,    10,    11,    12,    13,    14,    15,    16,
       4,     5,     6,     7,     8,     9,    10,    11,    12,    13,
      14,    15,    16,     5,     6,     7,     8,     9,    10,    11,
      12,    13,    14,    15,    16,    11,    12,    13,    14,    15,
      16,    -1,    17,    18
};

/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
   symbol of state STATE-NUM.  */
static const unsigned char yystos[] =
{
       0,    17,    18,    21,    22,    22,     0,     3,     4,     5,
       6,     7,     8,     9,    10,    11,    12,    13,    14,    15,
      16,    19,    22,    22,    22,    22,    22,    22,    22,    22,
      22,    22,    22,    22,    22,    22
};

#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__)
# define YYSIZE_T __SIZE_TYPE__
#endif
#if ! defined (YYSIZE_T) && defined (size_t)
# define YYSIZE_T size_t
#endif
#if ! defined (YYSIZE_T)
# if defined (__STDC__) || defined (__cplusplus)
#  include <stddef.h> /* INFRINGES ON USER NAME SPACE */
#  define YYSIZE_T size_t
# endif
#endif
#if ! defined (YYSIZE_T)
# define YYSIZE_T unsigned int
#endif

#define yyerrok      (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY      (-2)
#define YYEOF     0

#define YYACCEPT  goto yyacceptlab
#define YYABORT      goto yyabortlab
#define YYERROR      goto 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;                \
      goto yybackup;                \
    }                      \
  else                        \
    {                         \
      yyerror ("syntax error: cannot back up");\
      YYERROR;                   \
    }                      \
while (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 (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 (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 (&yylval, &yylloc, YYLEX_PARAM)
#else
# define YYLEX yylex (&yylval, &yylloc)
#endif

/* Enable debugging if requested.  */
#if YYDEBUG

# ifndef YYFPRINTF
#  include <stdio.h> /* INFRINGES ON USER NAME SPACE */
#  define YYFPRINTF fprintf
# endif

# define YYDPRINTF(Args)         \
do {                 \
  if (yydebug)             \
    YYFPRINTF Args;           \
} while (0)

# define YY_SYMBOL_PRINT(Title, Type, Value, Location)      \
do {                       \
  if (yydebug)                   \
    {                      \
      YYFPRINTF (stderr, "%s ", Title);            \
      yysymprint (stderr,              \
                  Type, Value, Location); \
      YYFPRINTF (stderr, "\n");              \
    }                      \
} while (0)

/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included).                                                   |
`------------------------------------------------------------------*/

#if defined (__STDC__) || defined (__cplusplus)
static void
yy_stack_print (short int *bottom, short int *top)
#else
static void
yy_stack_print (bottom, top)
    short int *bottom;
    short int *top;
#endif
{
  YYFPRINTF (stderr, "Stack now");
  for (/* Nothing. */; bottom <= top; ++bottom)
    YYFPRINTF (stderr, " %d", *bottom);
  YYFPRINTF (stderr, "\n");
}

# define YY_STACK_PRINT(Bottom, Top)            \
do {                       \
  if (yydebug)                   \
    yy_stack_print ((Bottom), (Top));           \
} while (0)


/*------------------------------------------------.
| Report that the YYRULE is going to be reduced.  |
`------------------------------------------------*/

#if defined (__STDC__) || defined (__cplusplus)
static void
yy_reduce_print (int yyrule)
#else
static void
yy_reduce_print (yyrule)
    int yyrule;
#endif
{
  int yyi;
  unsigned int yylno = yyrline[yyrule];
  YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ",
             yyrule - 1, yylno);
  /* Print the symbols being reduced, and their result.  */
  for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++)
    YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]);
  YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]);
}

# define YY_REDUCE_PRINT(Rule)      \
do {              \
  if (yydebug)          \
    yy_reduce_print (Rule);      \
} while (0)

/* Nonzero means print parse trace.  It is left uninitialized so that
   multiple parsers can coexist.  */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define 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
   SIZE_MAX < 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.  */
static YYSIZE_T
#   if defined (__STDC__) || defined (__cplusplus)
yystrlen (const char *yystr)
#   else
yystrlen (yystr)
     const char *yystr;
#   endif
{
  register const char *yys = yystr;

  while (*yys++ != '\0')
    continue;

  return yys - yystr - 1;
}
#  endif
# endif

# ifndef yystpcpy
#  if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE)
#   define yystpcpy stpcpy
#  else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
   YYDEST.  */
static char *
#   if defined (__STDC__) || defined (__cplusplus)
yystpcpy (char *yydest, const char *yysrc)
#   else
yystpcpy (yydest, yysrc)
     char *yydest;
     const char *yysrc;
#   endif
{
  register char *yyd = yydest;
  register const char *yys = yysrc;

  while ((*yyd++ = *yys++) != '\0')
    continue;

  return yyd - 1;
}
#  endif
# endif

#endif /* !YYERROR_VERBOSE */



#if YYDEBUG
/*--------------------------------.
| Print this symbol on YYOUTPUT.  |
`--------------------------------*/

#if defined (__STDC__) || defined (__cplusplus)
static void
yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep, YYLTYPE *yylocationp)
#else
static void
yysymprint (yyoutput, yytype, yyvaluep, yylocationp)
    FILE *yyoutput;
    int yytype;
    YYSTYPE *yyvaluep;
    YYLTYPE *yylocationp;
#endif
{
  /* Pacify ``unused variable'' warnings.  */
  (void) yyvaluep;
  (void) yylocationp;

  if (yytype < YYNTOKENS)
    YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
  else
    YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);

  YY_LOCATION_PRINT (yyoutput, *yylocationp);
  fprintf (yyoutput, ": ");

# ifdef YYPRINT
  if (yytype < YYNTOKENS)
    YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# endif
  switch (yytype)
    {
      default:
        break;
    }
  YYFPRINTF (yyoutput, ")");
}

#endif /* ! YYDEBUG */
/*-----------------------------------------------.
| Release the memory associated to this symbol.  |
`-----------------------------------------------*/

#if defined (__STDC__) || defined (__cplusplus)
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep, YYLTYPE *yylocationp)
#else
static void
yydestruct (yymsg, yytype, yyvaluep, yylocationp)
    const char *yymsg;
    int yytype;
    YYSTYPE *yyvaluep;
    YYLTYPE *yylocationp;
#endif
{
  /* Pacify ``unused variable'' warnings.  */
  (void) yyvaluep;
  (void) yylocationp;

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






/*----------.
| yyparse.  |
`----------*/

#ifdef YYPARSE_PARAM
# if defined (__STDC__) || defined (__cplusplus)
int yyparse (void *YYPARSE_PARAM)
# else
int yyparse (YYPARSE_PARAM)
  void *YYPARSE_PARAM;
# endif
#else /* ! YYPARSE_PARAM */
#if defined (__STDC__) || defined (__cplusplus)
int
yyparse (void)
#else
int
yyparse ()

#endif
#endif
{
  /* The look-ahead symbol.  */
int yychar;

/* The semantic value of the look-ahead symbol.  */
YYSTYPE yylval;

/* Number of syntax errors so far.  */
int yynerrs;
/* Location data for the look-ahead symbol.  */
YYLTYPE yylloc;

  register int yystate;
  register 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;

  /* Three stacks and their tools:
     `yyss': related to states,
     `yyvs': related to semantic values,
     `yyls': related to locations.

     Refer to the stacks thru separate pointers, to allow yyoverflow
     to reallocate them elsewhere.  */

  /* The state stack.  */
  short int yyssa[YYINITDEPTH];
  short int *yyss = yyssa;
  register short int *yyssp;

  /* The semantic value stack.  */
  YYSTYPE yyvsa[YYINITDEPTH];
  YYSTYPE *yyvs = yyvsa;
  register YYSTYPE *yyvsp;

  /* The location stack.  */
  YYLTYPE yylsa[YYINITDEPTH];
  YYLTYPE *yyls = yylsa;
  YYLTYPE *yylsp;
  /* The locations where the error started and ended. */
  YYLTYPE yyerror_range[2];

#define YYPOPSTACK   (yyvsp--, yyssp--, yylsp--)

  YYSIZE_T yystacksize = YYINITDEPTH;

  /* The variables used to return semantic value and location from the
     action routines.  */
  YYSTYPE yyval;
  YYLTYPE yyloc;

  /* When reducing, the number of symbols on the RHS of the reduced
     rule.  */
  int yylen;

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

  yystate = 0;
  yyerrstatus = 0;
  yynerrs = 0;
  yychar = YYEMPTY;     /* Cause a token to be read.  */

  /* Initialize stack pointers.
     Waste one element of value and location stack
     so that they stay on the same level as the state stack.
     The wasted elements are never initialized.  */

  yyssp = yyss;
  yyvsp = yyvs;
  yylsp = yyls;
#if YYLTYPE_IS_TRIVIAL
  /* Initialize the default location before parsing starts.  */
  yylloc.first_line   = yylloc.last_line   = 1;
  yylloc.first_column = yylloc.last_column = 0;
#endif


  yyvsp[0] = yylval;
    yylsp[0] = yylloc;

  goto yysetstate;

/*------------------------------------------------------------.
| yynewstate -- Push a new state, which is found in yystate.  |
`------------------------------------------------------------*/
 yynewstate:
  /* In all cases, when you get here, the value and location stacks
     have just been pushed. so pushing a state here evens the stacks.
     */
  yyssp++;

 yysetstate:
  *yyssp = yystate;

  if (yyss + yystacksize - 1 <= yyssp)
    {
      /* Get the current used size of the three stacks, in elements.  */
      YYSIZE_T yysize = yyssp - yyss + 1;

#ifdef yyoverflow
      {
   /* Give user a chance to reallocate the stack. Use copies of
      these so that the &'s don't force the real ones into
      memory.  */
   YYSTYPE *yyvs1 = yyvs;
   short int *yyss1 = yyss;
   YYLTYPE *yyls1 = yyls;

   /* Each stack pointer address is followed by the size of the
      data in use in that stack, in bytes.  This used to be a
      conditional around just the two extra args, but that might
      be undefined if yyoverflow is a macro.  */
   yyoverflow ("parser stack overflow",
          &yyss1, yysize * sizeof (*yyssp),
          &yyvs1, yysize * sizeof (*yyvsp),
          &yyls1, yysize * sizeof (*yylsp),
          &yystacksize);
   yyls = yyls1;
   yyss = yyss1;
   yyvs = yyvs1;
      }
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
      goto yyoverflowlab;
# else
      /* Extend the stack our own way.  */
      if (YYMAXDEPTH <= yystacksize)
   goto yyoverflowlab;
      yystacksize *= 2;
      if (YYMAXDEPTH < yystacksize)
   yystacksize = YYMAXDEPTH;

      {
   short int *yyss1 = yyss;
   union yyalloc *yyptr =
     (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
   if (! yyptr)
     goto yyoverflowlab;
   YYSTACK_RELOCATE (yyss);
   YYSTACK_RELOCATE (yyvs);
   YYSTACK_RELOCATE (yyls);
#  undef YYSTACK_RELOCATE
   if (yyss1 != yyssa)
     YYSTACK_FREE (yyss1);
      }
# endif
#endif /* no yyoverflow */

      yyssp = yyss + yysize - 1;
      yyvsp = yyvs + yysize - 1;
      yylsp = yyls + 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.  */
/* yyresume: */

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

  /* Shift the look-ahead token.  */
  YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);

  /* Discard the token being shifted unless it is eof.  */
  if (yychar != YYEOF)
    yychar = YYEMPTY;

  *++yyvsp = yylval;
  *++yylsp = yylloc;

  /* Count tokens shifted since error; after three, turn off error
     status.  */
  if (yyerrstatus)
    yyerrstatus--;

  yystate = yyn;
  goto yynewstate;


/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state.  |
`-----------------------------------------------------------*/
yydefault:
  yyn = yydefact[yystate];
  if (yyn == 0)
    goto yyerrlab;
  goto yyreduce;


/*-----------------------------.
| yyreduce -- Do a reduction.  |
`-----------------------------*/
yyreduce:
  /* yyn is the number of a rule to reduce with.  */
  yylen = yyr2[yyn];

  /* If YYLEN is nonzero, implement the default value of the action:
     `$$ = $1'.

     Otherwise, the following line sets YYVAL to garbage.
     This behavior is undocumented and Bison
     users should not rely upon it.  Assigning to YYVAL
     unconditionally makes the parser a bit smaller, and it avoids a
     GCC warning that YYVAL may be used uninitialized.  */
  yyval = yyvsp[1-yylen];

  /* Default location. */
  YYLLOC_DEFAULT (yyloc, yylsp - yylen, yylen);
  YY_REDUCE_PRINT (yyn);
  switch (yyn)
    {
        case 2:
#line 137 "ast_expr.y"
    { ((struct parser_control *)kota)->result = (yyval.val); ;}
    break;

  case 4:
#line 141 "ast_expr.y"
    { (yyval.val) = (yyvsp[-1].val); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;

  case 5:
#line 142 "ast_expr.y"
    { (yyval.val) = op_or ((yyvsp[-2].val), (yyvsp[0].val)); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;

  case 6:
#line 143 "ast_expr.y"
    { (yyval.val) = op_and ((yyvsp[-2].val), (yyvsp[0].val)); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;

  case 7:
#line 144 "ast_expr.y"
    { (yyval.val) = op_eq ((yyvsp[-2].val), (yyvsp[0].val)); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;

  case 8:
#line 145 "ast_expr.y"
    { (yyval.val) = op_gt ((yyvsp[-2].val), (yyvsp[0].val)); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;

  case 9:
#line 146 "ast_expr.y"
    { (yyval.val) = op_lt ((yyvsp[-2].val), (yyvsp[0].val)); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;

  case 10:
#line 147 "ast_expr.y"
    { (yyval.val) = op_ge ((yyvsp[-2].val), (yyvsp[0].val)); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;

  case 11:
#line 148 "ast_expr.y"
    { (yyval.val) = op_le ((yyvsp[-2].val), (yyvsp[0].val)); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;

  case 12:
#line 149 "ast_expr.y"
    { (yyval.val) = op_ne ((yyvsp[-2].val), (yyvsp[0].val)); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;

  case 13:
#line 150 "ast_expr.y"
    { (yyval.val) = op_plus ((yyvsp[-2].val), (yyvsp[0].val)); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;

  case 14:
#line 151 "ast_expr.y"
    { (yyval.val) = op_minus ((yyvsp[-2].val), (yyvsp[0].val)); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;

  case 15:
#line 152 "ast_expr.y"
    { (yyval.val) = op_times ((yyvsp[-2].val), (yyvsp[0].val)); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;

  case 16:
#line 153 "ast_expr.y"
    { (yyval.val) = op_div ((yyvsp[-2].val), (yyvsp[0].val)); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;

  case 17:
#line 154 "ast_expr.y"
    { (yyval.val) = op_rem ((yyvsp[-2].val), (yyvsp[0].val)); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;

  case 18:
#line 155 "ast_expr.y"
    { (yyval.val) = op_colon ((yyvsp[-2].val), (yyvsp[0].val)); (yyloc).first_column = (yylsp[-2]).first_column; (yyloc).last_column = (yylsp[0]).last_column; (yyloc).first_line=0; (yyloc).last_line=0;;}
    break;


    }

/* Line 1037 of yacc.c.  */
#line 1270 "ast_expr.c"

  yyvsp -= yylen;
  yyssp -= yylen;
  yylsp -= yylen;

  YY_STACK_PRINT (yyss, yyssp);

  *++yyvsp = yyval;
  *++yylsp = yyloc;

  /* Now `shift' the result of the reduction.  Determine what state
     that goes to, based on the state we popped back to and the rule
     number reduced by.  */

  yyn = yyr1[yyn];

  yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
  if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
    yystate = yytable[yystate];
  else
    yystate = yydefgoto[yyn - YYNTOKENS];

  goto yynewstate;


/*------------------------------------.
| yyerrlab -- here on detecting error |
`------------------------------------*/
yyerrlab:
  /* If not already recovering from an error, report this error.  */
  if (!yyerrstatus)
    {
      ++yynerrs;
#if YYERROR_VERBOSE
      yyn = yypact[yystate];

      if (YYPACT_NINF < yyn && yyn < YYLAST)
   {
     YYSIZE_T yysize = 0;
     int yytype = YYTRANSLATE (yychar);
     const char* yyprefix;
     char *yymsg;
     int yyx;

     /* 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;
     int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
     int yycount = 0;

     yyprefix = ", expecting ";
     for (yyx = yyxbegin; yyx < yyxend; ++yyx)
       if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
         {
      yysize += yystrlen (yyprefix) + yystrlen (yytname [yyx]);
      yycount += 1;
      if (yycount == 5)
        {
          yysize = 0;
          break;
        }
         }
     yysize += (sizeof ("syntax error, unexpected ")
           + yystrlen (yytname[yytype]));
     yymsg = (char *) YYSTACK_ALLOC (yysize);
     if (yymsg != 0)
       {
         char *yyp = yystpcpy (yymsg, "syntax error, unexpected ");
         yyp = yystpcpy (yyp, yytname[yytype]);

         if (yycount < 5)
      {
        yyprefix = ", expecting ";
        for (yyx = yyxbegin; yyx < yyxend; ++yyx)
          if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
            {
         yyp = yystpcpy (yyp, yyprefix);
         yyp = yystpcpy (yyp, yytname[yyx]);
         yyprefix = " or ";
            }
      }
         yyerror (yymsg);
         YYSTACK_FREE (yymsg);
       }
     else
       yyerror ("syntax error; also virtual memory exhausted");
   }
      else
#endif /* YYERROR_VERBOSE */
   yyerror ("syntax error");
    }

  yyerror_range[0] = yylloc;

  if (yyerrstatus == 3)
    {
      /* If just tried and failed to reuse look-ahead token after an
    error, discard it.  */

      if (yychar <= YYEOF)
        {
          /* If at end of input, pop the error token,
        then the rest of the stack, then return failure.  */
     if (yychar == YYEOF)
        for (;;)
          {
                 yyerror_range[0] = *yylsp;
       YYPOPSTACK;
       if (yyssp == yyss)
         YYABORT;
       yydestruct ("Error: popping",
                             yystos[*yyssp], yyvsp, yylsp);
          }
        }
      else
   {
     yydestruct ("Error: discarding", yytoken, &yylval, &yylloc);
     yychar = YYEMPTY;
   }
    }

  /* Else will try to reuse look-ahead token after shifting the error
     token.  */
  goto yyerrlab1;


/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR.  |
`---------------------------------------------------*/
yyerrorlab:

#ifdef __GNUC__
  /* Pacify GCC when the user code never invokes YYERROR and the label
     yyerrorlab therefore never appears in user code.  */
  if (0)
     goto yyerrorlab;
#endif

  yyerror_range[0] = yylsp[1-yylen];
  yylsp -= yylen;
  yyvsp -= yylen;
  yyssp -= yylen;
  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;

      yyerror_range[0] = *yylsp;
      yydestruct ("Error: popping", yystos[yystate], yyvsp, yylsp);
      YYPOPSTACK;
      yystate = *yyssp;
      YY_STACK_PRINT (yyss, yyssp);
    }

  if (yyn == YYFINAL)
    YYACCEPT;

  *++yyvsp = yylval;

  yyerror_range[1] = yylloc;
  /* Using YYLLOC is tempting, but would change the location of
     the look-ahead.  YYLOC is available though. */
  YYLLOC_DEFAULT (yyloc, yyerror_range - 1, 2);
  *++yylsp = yyloc;

  /* 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:
  yydestruct ("Error: discarding lookahead",
              yytoken, &yylval, &yylloc);
  yychar = YYEMPTY;
  yyresult = 1;
  goto yyreturn;

#ifndef yyoverflow
/*----------------------------------------------.
| yyoverflowlab -- parser overflow comes here.  |
`----------------------------------------------*/
yyoverflowlab:
  yyerror ("parser stack overflow");
  yyresult = 2;
  /* Fall through.  */
#endif

yyreturn:
#ifndef yyoverflow
  if (yyss != yyssa)
    YYSTACK_FREE (yyss);
#endif
  return yyresult;
}


#line 159 "ast_expr.y"


static struct val *
make_integer (i)
quad_t i;
{
   struct val *vp;

   vp = (struct val *) malloc (sizeof (*vp));
   if (vp == NULL) {
      ast_log(LOG_WARNING, "malloc() failed\n");
      return(NULL);
   }

   vp->type = integer;
   vp->u.i  = i;
   return vp; 
}

static struct val *
make_str (s)
const char *s;
{
   struct val *vp;
   size_t i;
   int isint;

   vp = (struct val *) malloc (sizeof (*vp));
   if (vp == NULL || ((vp->u.s = strdup (s)) == NULL)) {
      ast_log(LOG_WARNING,"malloc() failed\n");
      return(NULL);
   }

   for(i = 1, isint = isdigit(s[0]) || s[0] == '-';
       isint && i < strlen(s);
       i++)
   {
      if(!isdigit(s[i]))
          isint = 0;
   }

   if (isint)
      vp->type = numeric_string;
   else  
      vp->type = string;

   return vp;
}


static void
free_value (vp)
struct val *vp;
{  
   if (vp==NULL) {
      return;
   }
   if (vp->type == string || vp->type == numeric_string)
      free (vp->u.s);   
   free (vp);
}


static quad_t
to_integer (vp)
struct val *vp;
{
   quad_t i;

   if (vp == NULL) {
      ast_log(LOG_WARNING,"vp==NULL in to_integer()\n");
      return(0);
   }

   if (vp->type == integer)
      return 1;

   if (vp->type == string)
      return 0;

   /* vp->type == numeric_string, make it numeric */
   errno = 0;
   i  = strtoq(vp->u.s, (char**)NULL, 10);
   if (errno != 0) {
      free(vp->u.s);
      ast_log(LOG_WARNING,"overflow\n");
      return(0);
   }
   free (vp->u.s);
   vp->u.i = i;
   vp->type = integer;
   return 1;
}

static void
to_string (vp)
struct val *vp;
{
   char *tmp;

   if (vp->type == string || vp->type == numeric_string)
      return;

   tmp = malloc ((size_t)25);
   if (tmp == NULL) {
      ast_log(LOG_WARNING,"malloc() failed\n");
      return;
   }

   sprintf (tmp, "%lld", (long long)vp->u.i);
   vp->type = string;
   vp->u.s  = tmp;
}


static int
isstring (vp)
struct val *vp;
{
   /* only TRUE if this string is not a valid integer */
   return (vp->type == string);
}

static int
ast_yylex (YYSTYPE *lvalp, YYLTYPE *yylloc, struct parser_control *karoto)
{
   char *p=0;
   char *t1=0;
   char savep = 0;
   char *savepp = 0;
   
   if (karoto->firsttoken==1) {
      t1 = karoto->argv;
      karoto->firsttoken = 0;
   } else {
      t1 = karoto->ptrptr;
   }
   
   while(*t1 && *t1 == ' ' )  /* we can remove worries about leading/multiple spaces being present */
      t1++;
   karoto->ptrptr = t1;
   yylloc->first_column = t1 - karoto->argv;
   
   while( *t1 && *t1 != ' ' && *t1 != '"') /* find the next space or quote */
      t1++;
   if( *t1 == ' ' )
   {
      *t1 = 0;
      p = karoto->ptrptr;
      karoto->ptrptr = t1+1;
      yylloc->last_column = t1 - karoto->argv;
   }
   else if (*t1 == '"' )
   {
      /* opening quote. find the closing quote */
      char *t2=t1+1;
      while( *t2 && *t2 != '"')
         t2++;
      if( *t2 == '"' )
      {
         if( *(t2+1) == ' ' || *(t2+1) == 0 )
         {
            if( *(t2+1) )
            {
               *(t2+1) = 0;
               karoto->ptrptr = t2+2;
            }
            else
            {
               karoto->ptrptr = t2+1;
            }
         }
         else
         {
            /* hmmm. what if another token is here? */
            /* maybe we can insert a space? */
            savep = *(t2+1);
            savepp = t2+1;
            *(t2+1) = 0;
            karoto->ptrptr = t2+1;
         }
         p = t1;
      }
      else
      {
         /* NOT GOOD -- no closing quote! */
         p = t1;
         karoto->ptrptr = t2;
      }
      yylloc->last_column = t2 - karoto->argv;
   }
   else if( *t1 == 0 )
   {
      if( t1 != karoto->ptrptr )
      {
         /* this is the last token */
         p = karoto->ptrptr;
         karoto->ptrptr = t1;
      }
      else
      {
         /* we are done. That was quick */
         p = karoto->ptrptr;
         yylloc->last_column = t1 - karoto->argv;
      }
   }
   if( *p == 0 )
      p = 0;
   
   if (p==NULL) {
      return (0);
   }


   if (strlen (p) == 1) {
      if (strchr ("|&=<>+-*/%:()", *p))
         return (*p);
   } else if (strlen (p) == 2 && p[1] == '=') {
      switch (*p) {
      case '>': return (GE);
      case '<': return (LE);
      case '!': return (NE);
      }
   }

   lvalp->val = make_str (p);
   if( savep )
   {
      *savepp = savep; /* restore the null terminated string */
      savepp = 0;
      savep = 0;
   }
   return (TOKEN);
}

static int
is_zero_or_null (vp)
struct val *vp;
{
   if (vp->type == integer) {
      return (vp->u.i == 0);
   } else {
      return (*vp->u.s == 0 || (to_integer (vp) && vp->u.i == 0));
   }
   /* NOTREACHED */
}

char *ast_expr (char *arg)
{
   struct parser_control karoto;

   char *kota;
   char *pirouni;
   
   kota=strdup(arg);
   karoto.result = NULL;
   karoto.firsttoken=1;
   karoto.argv=kota;
   karoto.arg_orig = arg;
   /* ast_yydebug = 1; */
   
   ast_yyparse ((void *)&karoto);

   free(kota);

   if (karoto.result==NULL) {
      pirouni=strdup("0");
      return(pirouni);
   } else {
      if (karoto.result->type == integer) {
         pirouni=malloc(256);
         sprintf (pirouni,"%lld", (long long)karoto.result->u.i);
      }
      else {
         pirouni=strdup(karoto.result->u.s);
      }
      free(karoto.result);
   }
   return(pirouni);
}

#ifdef STANDALONE

int main(int argc,char **argv) {
   char *s;

   s=ast_expr(argv[1]);

   printf("=====%s======\n",s);
}

#endif

#undef ast_yyerror
#define ast_yyerror(x) ast_yyerror(x, YYLTYPE *yylloc, struct parser_control *karoto)

static int
ast_yyerror (const char *s)
{  
   char spacebuf[8000]; /* best safe than sorry */
   char spacebuf2[8000]; /* best safe than sorry */
   int i=0;
   spacebuf[0] = 0;
   
   if( yylloc->first_column > 7990 ) /* if things get out of whack, why crash? */
      yylloc->first_column = 7990;
   if( yylloc->last_column > 7990 )
      yylloc->last_column = 7990;
   for(i=0;i<yylloc->first_column;i++) spacebuf[i] = ' ';
   for(   ;i<yylloc->last_column;i++) spacebuf[i] = '^';
   spacebuf[i] = 0;

   for(i=0;i<karoto->ptrptr-karoto->argv;i++) spacebuf2[i] = ' ';
   spacebuf2[i++]='^';
   spacebuf2[i]= 0;

   ast_log(LOG_WARNING,"ast_yyerror(): syntax error: %s; Input:\n%s\n%s\n%s\n",s, 
         karoto->arg_orig,spacebuf,spacebuf2);
   return(0);
}


static struct val *
op_or (a, b)
struct val *a, *b;
{
   if (is_zero_or_null (a)) {
      free_value (a);
      return (b);
   } else {
      free_value (b);
      return (a);
   }
}
      
static struct val *
op_and (a, b)
struct val *a, *b;
{
   if (is_zero_or_null (a) || is_zero_or_null (b)) {
      free_value (a);
      free_value (b);
      return (make_integer ((quad_t)0));
   } else {
      free_value (b);
      return (a);
   }
}

static struct val *
op_eq (a, b)
struct val *a, *b;
{
   struct val *r; 

   if (isstring (a) || isstring (b)) {
      to_string (a);
      to_string (b); 
      r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) == 0));
   } else {
      (void)to_integer(a);
      (void)to_integer(b);
      r = make_integer ((quad_t)(a->u.i == b->u.i));
   }

   free_value (a);
   free_value (b);
   return r;
}

static struct val *
op_gt (a, b)
struct val *a, *b;
{
   struct val *r;

   if (isstring (a) || isstring (b)) {
      to_string (a);
      to_string (b);
      r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) > 0));
   } else {
      (void)to_integer(a);
      (void)to_integer(b);
      r = make_integer ((quad_t)(a->u.i > b->u.i));
   }

   free_value (a);
   free_value (b);
   return r;
}

static struct val *
op_lt (a, b)
struct val *a, *b;
{
   struct val *r;

   if (isstring (a) || isstring (b)) {
      to_string (a);
      to_string (b);
      r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) < 0));
   } else {
      (void)to_integer(a);
      (void)to_integer(b);
      r = make_integer ((quad_t)(a->u.i < b->u.i));
   }

   free_value (a);
   free_value (b);
   return r;
}

static struct val *
op_ge (a, b)
struct val *a, *b;
{
   struct val *r;

   if (isstring (a) || isstring (b)) {
      to_string (a);
      to_string (b);
      r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) >= 0));
   } else {
      (void)to_integer(a);
      (void)to_integer(b);
      r = make_integer ((quad_t)(a->u.i >= b->u.i));
   }

   free_value (a);
   free_value (b);
   return r;
}

static struct val *
op_le (a, b)
struct val *a, *b;
{
   struct val *r;

   if (isstring (a) || isstring (b)) {
      to_string (a);
      to_string (b);
      r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) <= 0));
   } else {
      (void)to_integer(a);
      (void)to_integer(b);
      r = make_integer ((quad_t)(a->u.i <= b->u.i));
   }

   free_value (a);
   free_value (b);
   return r;
}

static struct val *
op_ne (a, b)
struct val *a, *b;
{
   struct val *r;

   if (isstring (a) || isstring (b)) {
      to_string (a);
      to_string (b);
      r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) != 0));
   } else {
      (void)to_integer(a);
      (void)to_integer(b);
      r = make_integer ((quad_t)(a->u.i != b->u.i));
   }

   free_value (a);
   free_value (b);
   return r;
}

static int
chk_plus (a, b, r)
quad_t a, b, r;
{
   /* sum of two positive numbers must be positive */
   if (a > 0 && b > 0 && r <= 0)
      return 1;
   /* sum of two negative numbers must be negative */
   if (a < 0 && b < 0 && r >= 0)
      return 1;
   /* all other cases are OK */
   return 0;
}

static struct val *
op_plus (a, b)
struct val *a, *b;
{
   struct val *r;

   if (!to_integer (a)) {
      ast_log(LOG_WARNING,"non-numeric argument\n");
      if (!to_integer (b)) {
         free_value(a);
         free_value(b);
         return make_integer(0);
      } else {
         free_value(a);
         return (b);
      }
   } else if (!to_integer(b)) {
      free_value(b);
      return (a);
   }

   r = make_integer (/*(quad_t)*/(a->u.i + b->u.i));
   if (chk_plus (a->u.i, b->u.i, r->u.i)) {
      ast_log(LOG_WARNING,"overflow\n");
   }
   free_value (a);
   free_value (b);
   return r;
}

static int
chk_minus (a, b, r)
quad_t a, b, r;
{
   /* special case subtraction of QUAD_MIN */
   if (b == QUAD_MIN) {
      if (a >= 0)
         return 1;
      else
         return 0;
   }
   /* this is allowed for b != QUAD_MIN */
   return chk_plus (a, -b, r);
}

static struct val *
op_minus (a, b)
struct val *a, *b;
{
   struct val *r;

   if (!to_integer (a)) {
      ast_log(LOG_WARNING, "non-numeric argument\n");
      if (!to_integer (b)) {
         free_value(a);
         free_value(b);
         return make_integer(0);
      } else {
         r = make_integer(0 - b->u.i);
         free_value(a);
         free_value(b);
         return (r);
      }
   } else if (!to_integer(b)) {
      ast_log(LOG_WARNING, "non-numeric argument\n");
      free_value(b);
      return (a);
   }

   r = make_integer (/*(quad_t)*/(a->u.i - b->u.i));
   if (chk_minus (a->u.i, b->u.i, r->u.i)) {
      ast_log(LOG_WARNING, "overflow\n");
   }
   free_value (a);
   free_value (b);
   return r;
}

static int
chk_times (a, b, r)
quad_t a, b, r;
{
   /* special case: first operand is 0, no overflow possible */
   if (a == 0)
      return 0;
   /* cerify that result of division matches second operand */
   if (r / a != b)
      return 1;
   return 0;
}

static struct val *
op_times (a, b)
struct val *a, *b;
{
   struct val *r;

   if (!to_integer (a) || !to_integer (b)) {
      free_value(a);
      free_value(b);
      ast_log(LOG_WARNING, "non-numeric argument\n");
      return(make_integer(0));
   }

   r = make_integer (/*(quad_t)*/(a->u.i * b->u.i));
   if (chk_times (a->u.i, b->u.i, r->u.i)) {
      ast_log(LOG_WARNING, "overflow\n");
   }
   free_value (a);
   free_value (b);
   return (r);
}

static int
chk_div (a, b)
quad_t a, b;
{
   /* div by zero has been taken care of before */
   /* only QUAD_MIN / -1 causes overflow */
   if (a == QUAD_MIN && b == -1)
      return 1;
   /* everything else is OK */
   return 0;
}

static struct val *
op_div (a, b)
struct val *a, *b;
{
   struct val *r;

   if (!to_integer (a)) {
      free_value(a);
      free_value(b);
      ast_log(LOG_WARNING, "non-numeric argument\n");
      return make_integer(0);
   } else if (!to_integer (b)) {
      free_value(a);
      free_value(b);
      ast_log(LOG_WARNING, "non-numeric argument\n");
      return make_integer(INT_MAX);
   }

   if (b->u.i == 0) {
      ast_log(LOG_WARNING, "division by zero\n");     
      free_value(a);
      free_value(b);
      return make_integer(INT_MAX);
   }

   r = make_integer (/*(quad_t)*/(a->u.i / b->u.i));
   if (chk_div (a->u.i, b->u.i)) {
      ast_log(LOG_WARNING, "overflow\n");
   }
   free_value (a);
   free_value (b);
   return r;
}
   
static struct val *
op_rem (a, b)
struct val *a, *b;
{
   struct val *r;

   if (!to_integer (a) || !to_integer (b)) {
      ast_log(LOG_WARNING, "non-numeric argument\n");
      free_value(a);
      free_value(b);
      return make_integer(0);
   }

   if (b->u.i == 0) {
      ast_log(LOG_WARNING, "div by zero\n");
      free_value(a);
      return (b);
   }

   r = make_integer (/*(quad_t)*/(a->u.i % b->u.i));
   /* chk_rem necessary ??? */
   free_value (a);
   free_value (b);
   return r;
}
   
static struct val *
op_colon (a, b)
struct val *a, *b;
{
   regex_t rp;
   regmatch_t rm[2];
   char errbuf[256];
   int eval;
   struct val *v;

   /* coerce to both arguments to strings */
   to_string(a);
   to_string(b);

   /* compile regular expression */
   if ((eval = regcomp (&rp, b->u.s, REG_EXTENDED)) != 0) {
      regerror (eval, &rp, errbuf, sizeof(errbuf));
      ast_log(LOG_WARNING,"regcomp() error : %s",errbuf);
      free_value(a);
      free_value(b);
      return make_str("");    
   }

   /* compare string against pattern */
   /* remember that patterns are anchored to the beginning of the line */
   if (regexec(&rp, a->u.s, (size_t)2, rm, 0) == 0 && rm[0].rm_so == 0) {
      if (rm[1].rm_so >= 0) {
         *(a->u.s + rm[1].rm_eo) = '\0';
         v = make_str (a->u.s + rm[1].rm_so);

      } else {
         v = make_integer ((quad_t)(rm[0].rm_eo - rm[0].rm_so));
      }
   } else {
      if (rp.re_nsub == 0) {
         v = make_integer ((quad_t)0);
      } else {
         v = make_str ("");
      }
   }

   /* free arguments and pattern buffer */
   free_value (a);
   free_value (b);
   regfree (&rp);

   return v;
}

---