ast_expr.c

Go to the documentation of this file.

/* A Bison parser, made from ast_expr.y
   by GNU bison 1.35.  */

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

#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 YYLSP_NEEDED 1

# define GE 257
# define LE 258
# define NE 259
# define TOKEN 260

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

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


#line 108 "ast_expr.y"
#ifndef YYSTYPE
typedef union
{
   struct val *val;
} yystype;
# define YYSTYPE yystype
# define YYSTYPE_IS_TRIVIAL 1
#endif
#line 113 "ast_expr.y"

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

#ifndef YYLTYPE
typedef struct yyltype
{
  int first_line;
  int first_column;

  int last_line;
  int last_column;
} yyltype;

# define YYLTYPE yyltype
# define YYLTYPE_IS_TRIVIAL 1
#endif

#ifndef YYDEBUG
# define YYDEBUG 0
#endif



#define  YYFINAL     36
#define  YYFLAG      -32768
#define  YYNTBASE 20

/* YYTRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */
#define YYTRANSLATE(x) ((unsigned)(x) <= 260 ? yytranslate[x] : 22)

/* YYTRANSLATE[YYLEX] -- Bison token number corresponding to YYLEX. */
static const 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,     8,     9,    10,
      17
};

#if YYDEBUG
static const short yyprhs[] =
{
       0,     0,     2,     4,     8,    12,    16,    20,    24,    28,
      32,    36,    40,    44,    48,    52,    56,    60
};
static const short yyrhs[] =
{
      21,     0,    17,     0,    18,    21,    19,     0,    21,     3,
      21,     0,    21,     4,    21,     0,    21,     5,    21,     0,
      21,     6,    21,     0,    21,     7,    21,     0,    21,     8,
      21,     0,    21,     9,    21,     0,    21,    10,    21,     0,
      21,    11,    21,     0,    21,    12,    21,     0,    21,    13,
      21,     0,    21,    14,    21,     0,    21,    15,    21,     0,
      21,    16,    21,     0
};

#endif

#if YYDEBUG
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
static const short yyrline[] =
{
       0,   130,   133,   134,   135,   136,   137,   138,   139,   140,
     141,   142,   143,   144,   145,   146,   147,   148
};
#endif


#if (YYDEBUG) || defined YYERROR_VERBOSE

/* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */
static const char *const yytname[] =
{
  "$", "error", "$undefined.", "'|'", "'&'", "'='", "'>'", "'<'", "GE", 
  "LE", "NE", "'+'", "'-'", "'*'", "'/'", "'%'", "':'", "TOKEN", "'('", 
  "')'", "start", "expr", 0
};
#endif

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

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

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

static const short yydefgoto[] =
{
      34,     3
};

static const short yypact[] =
{
      64,-32768,    64,    28,    -3,    64,    64,    64,    64,    64,
      64,    64,    64,    64,    64,    64,    64,    64,    64,-32768,
      41,    53,    59,    59,    59,    59,    59,    59,    63,    63,
      -1,    -1,    -1,-32768,    80,    83,-32768
};

static const short yypgoto[] =
{
  -32768,    12
};


#define  YYLAST      83


static const short yytable[] =
{
       5,     6,     7,     8,     9,    10,    11,    12,    13,    14,
      15,    16,    17,    18,     4,    18,    19,    20,    21,    22,
      23,    24,    25,    26,    27,    28,    29,    30,    31,    32,
      33,     5,     6,     7,     8,     9,    10,    11,    12,    13,
      14,    15,    16,    17,    18,     6,     7,     8,     9,    10,
      11,    12,    13,    14,    15,    16,    17,    18,     7,     8,
       9,    10,    11,    12,    13,    14,    15,    16,    17,    18,
      13,    14,    15,    16,    17,    18,    15,    16,    17,    18,
      35,     1,     2,    36
};

static const short yycheck[] =
{
       3,     4,     5,     6,     7,     8,     9,    10,    11,    12,
      13,    14,    15,    16,     2,    16,    19,     5,     6,     7,
       8,     9,    10,    11,    12,    13,    14,    15,    16,    17,
      18,     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,    13,    14,    15,    16,
       0,    17,    18,     0
};
#define YYPURE 1

/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/share/bison/bison.simple"

/* Skeleton output parser for bison,

   Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software
   Foundation, Inc.

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

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

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

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

/* This is the parser code that is written into each bison parser when
   the %semantic_parser declaration is not specified in the grammar.
   It was written by Richard Stallman by simplifying the hairy parser
   used when %semantic_parser is specified.  */

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

#if ! defined (yyoverflow) || defined (YYERROR_VERBOSE)

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

# if YYSTACK_USE_ALLOCA
#  define YYSTACK_ALLOC alloca
# else
#  ifndef YYSTACK_USE_ALLOCA
#   if defined (alloca) || defined (_ALLOCA_H)
#    define YYSTACK_ALLOC alloca
#   else
#    ifdef __GNUC__
#     define YYSTACK_ALLOC __builtin_alloca
#    endif
#   endif
#  endif
# endif

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


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

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

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

/* The size of an array large to enough to hold all stacks, each with
   N elements.  */
# if YYLSP_NEEDED
#  define YYSTACK_BYTES(N) \
     ((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE))   \
      + 2 * YYSTACK_GAP_MAX)
# else
#  define YYSTACK_BYTES(N) \
     ((N) * (sizeof (short) + sizeof (YYSTYPE))          \
      + YYSTACK_GAP_MAX)
# endif

/* Copy COUNT objects from FROM to TO.  The source and destination do
   not overlap.  */
# ifndef YYCOPY
#  if 1 < __GNUC__
#   define YYCOPY(To, From, Count) \
      __builtin_memcpy (To, From, (Count) * sizeof (*(From)))
#  else
#   define YYCOPY(To, From, Count)     \
      do             \
   {              \
     register YYSIZE_T yyi;      \
     for (yyi = 0; yyi < (Count); yyi++)  \
       (To)[yyi] = (From)[yyi];     \
   }              \
      while (0)
#  endif
# endif

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

#endif


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

#define yyerrok      (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY      -2
#define YYEOF     0
#define YYACCEPT  goto yyacceptlab
#define YYABORT   goto yyabortlab
#define YYERROR      goto yyerrlab1
/* Like YYERROR except do call yyerror.  This remains here temporarily
   to ease the transition to the new meaning of YYERROR, for GCC.
   Once GCC version 2 has supplanted version 1, this can go.  */
#define YYFAIL    goto yyerrlab
#define YYRECOVERING()  (!!yyerrstatus)
#define YYBACKUP(Token, Value)               \
do                      \
  if (yychar == YYEMPTY && yylen == 1)          \
    {                      \
      yychar = (Token);                \
      yylval = (Value);                \
      yychar1 = YYTRANSLATE (yychar);           \
      YYPOPSTACK;                \
      goto yybackup;                \
    }                      \
  else                        \
    {                         \
      yyerror ("syntax error: cannot back up");       \
      YYERROR;                   \
    }                      \
while (0)

#define YYTERROR  1
#define YYERRCODE 256


/* YYLLOC_DEFAULT -- Compute the default location (before the actions
   are run).

   When YYLLOC_DEFAULT is run, CURRENT is set the location of the
   first token.  By default, to implement support for ranges, extend
   its range to the last symbol.  */

#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N)        \
   Current.last_line   = Rhs[N].last_line;   \
   Current.last_column = Rhs[N].last_column;
#endif


/* YYLEX -- calling `yylex' with the right arguments.  */

#if YYPURE
# if YYLSP_NEEDED
#  ifdef YYLEX_PARAM
#   define YYLEX     yylex (&yylval, &yylloc, YYLEX_PARAM)
#  else
#   define YYLEX     yylex (&yylval, &yylloc)
#  endif
# else /* !YYLSP_NEEDED */
#  ifdef YYLEX_PARAM
#   define YYLEX     yylex (&yylval, YYLEX_PARAM)
#  else
#   define YYLEX     yylex (&yylval)
#  endif
# endif /* !YYLSP_NEEDED */
#else /* !YYPURE */
# define YYLEX       yylex ()
#endif /* !YYPURE */


/* 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)
/* Nonzero means print parse trace.  It is left uninitialized so that
   multiple parsers can coexist.  */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
#endif /* !YYDEBUG */

/* YYINITDEPTH -- initial size of the parser's stacks.  */
#ifndef  YYINITDEPTH
# define YYINITDEPTH 200
#endif

/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
   if the built-in stack extension method is used).

   Do not make this value too large; the results are undefined if
   SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH)
   evaluated with infinite-precision integer arithmetic.  */

#if YYMAXDEPTH == 0
# undef YYMAXDEPTH
#endif

#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif

#ifdef 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

#line 315 "/usr/share/bison/bison.simple"


/* The user can define YYPARSE_PARAM as the name of an argument to be passed
   into yyparse.  The argument should have type void *.
   It should actually point to an object.
   Grammar actions can access the variable by casting it
   to the proper pointer type.  */

#ifdef YYPARSE_PARAM
# if defined (__STDC__) || defined (__cplusplus)
#  define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
#  define YYPARSE_PARAM_DECL
# else
#  define YYPARSE_PARAM_ARG YYPARSE_PARAM
#  define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
# endif
#else /* !YYPARSE_PARAM */
# define YYPARSE_PARAM_ARG
# define YYPARSE_PARAM_DECL
#endif /* !YYPARSE_PARAM */

/* Prevent warning if -Wstrict-prototypes.  */
#ifdef __GNUC__
# ifdef YYPARSE_PARAM
int yyparse (void *);
# else
int yyparse (void);
# endif
#endif

/* YY_DECL_VARIABLES -- depending whether we use a pure parser,
   variables are global, or local to YYPARSE.  */

#define YY_DECL_NON_LSP_VARIABLES         \
/* The lookahead symbol.  */           \
int yychar;                \
                     \
/* The semantic value of the lookahead symbol. */  \
YYSTYPE yylval;                  \
                     \
/* Number of parse errors so far.  */        \
int yynerrs;

#if YYLSP_NEEDED
# define YY_DECL_VARIABLES       \
YY_DECL_NON_LSP_VARIABLES        \
                  \
/* Location data for the lookahead symbol.  */  \
YYLTYPE yylloc;
#else
# define YY_DECL_VARIABLES       \
YY_DECL_NON_LSP_VARIABLES
#endif


/* If nonreentrant, generate the variables here. */

#if !YYPURE
YY_DECL_VARIABLES
#endif  /* !YYPURE */

int
yyparse (YYPARSE_PARAM_ARG)
     YYPARSE_PARAM_DECL
{
  /* If reentrant, generate the variables here. */
#if YYPURE
  YY_DECL_VARIABLES
#endif  /* !YYPURE */

  register int yystate;
  register int yyn;
  int yyresult;
  /* Number of tokens to shift before error messages enabled.  */
  int yyerrstatus;
  /* Lookahead token as an internal (translated) token number.  */
  int yychar1 = 0;

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

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

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

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

#if YYLSP_NEEDED
  /* The location stack.  */
  YYLTYPE yylsa[YYINITDEPTH];
  YYLTYPE *yyls = yylsa;
  YYLTYPE *yylsp;
#endif

#if YYLSP_NEEDED
# define YYPOPSTACK   (yyvsp--, yyssp--, yylsp--)
#else
# define YYPOPSTACK   (yyvsp--, yyssp--)
#endif

  YYSIZE_T yystacksize = YYINITDEPTH;


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

  /* 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;
#if YYLSP_NEEDED
  yylsp = yyls;
#endif
  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 (yyssp >= yyss + yystacksize - 1)
    {
      /* Get the current used size of the three stacks, in elements.  */
      YYSIZE_T yysize = yyssp - yyss + 1;

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

   /* Each stack pointer address is followed by the size of the
      data in use in that stack, in bytes.  */
# if YYLSP_NEEDED
   YYLTYPE *yyls1 = yyls;
   /* 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;
# else
   yyoverflow ("parser stack overflow",
          &yyss1, yysize * sizeof (*yyssp),
          &yyvs1, yysize * sizeof (*yyvsp),
          &yystacksize);
# endif
   yyss = yyss1;
   yyvs = yyvs1;
      }
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
      goto yyoverflowlab;
# else
      /* Extend the stack our own way.  */
      if (yystacksize >= YYMAXDEPTH)
   goto yyoverflowlab;
      yystacksize *= 2;
      if (yystacksize > YYMAXDEPTH)
   yystacksize = YYMAXDEPTH;

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

      yyssp = yyss + yysize - 1;
      yyvsp = yyvs + yysize - 1;
#if YYLSP_NEEDED
      yylsp = yyls + yysize - 1;
#endif

      YYDPRINTF ((stderr, "Stack size increased to %lu\n",
        (unsigned long int) yystacksize));

      if (yyssp >= yyss + yystacksize - 1)
   YYABORT;
    }

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

  goto yybackup;


/*-----------.
| yybackup.  |
`-----------*/
yybackup:

/* Do appropriate processing given the current state.  */
/* Read a lookahead token if we need one and don't already have one.  */
/* yyresume: */

  /* First try to decide what to do without reference to lookahead token.  */

  yyn = yypact[yystate];
  if (yyn == YYFLAG)
    goto yydefault;

  /* Not known => get a lookahead token if don't already have one.  */

  /* yychar is either YYEMPTY or YYEOF
     or a valid token in external form.  */

  if (yychar == YYEMPTY)
    {
      YYDPRINTF ((stderr, "Reading a token: "));
      yychar = YYLEX;
    }

  /* Convert token to internal form (in yychar1) for indexing tables with */

  if (yychar <= 0)      /* This means end of input. */
    {
      yychar1 = 0;
      yychar = YYEOF;      /* Don't call YYLEX any more */

      YYDPRINTF ((stderr, "Now at end of input.\n"));
    }
  else
    {
      yychar1 = YYTRANSLATE (yychar);

#if YYDEBUG
     /* We have to keep this `#if YYDEBUG', since we use variables
   which are defined only if `YYDEBUG' is set.  */
      if (yydebug)
   {
     YYFPRINTF (stderr, "Next token is %d (%s",
           yychar, yytname[yychar1]);
     /* Give the individual parser a way to print the precise
        meaning of a token, for further debugging info.  */
# ifdef YYPRINT
     YYPRINT (stderr, yychar, yylval);
# endif
     YYFPRINTF (stderr, ")\n");
   }
#endif
    }

  yyn += yychar1;
  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
    goto yydefault;

  yyn = yytable[yyn];

  /* yyn is what to do for this token type in this state.
     Negative => reduce, -yyn is rule number.
     Positive => shift, yyn is new state.
       New state is final state => don't bother to shift,
       just return success.
     0, or most negative number => error.  */

  if (yyn < 0)
    {
      if (yyn == YYFLAG)
   goto yyerrlab;
      yyn = -yyn;
      goto yyreduce;
    }
  else if (yyn == 0)
    goto yyerrlab;

  if (yyn == YYFINAL)
    YYACCEPT;

  /* Shift the lookahead token.  */
  YYDPRINTF ((stderr, "Shifting token %d (%s), ",
         yychar, yytname[yychar1]));

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

  *++yyvsp = yylval;
#if YYLSP_NEEDED
  *++yylsp = yylloc;
#endif

  /* 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 the semantic value of
     the lookahead token.  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];

#if YYLSP_NEEDED
  /* Similarly for the default location.  Let the user run additional
     commands if for instance locations are ranges.  */
  yyloc = yylsp[1-yylen];
  YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);
#endif

#if YYDEBUG
  /* We have to keep this `#if YYDEBUG', since we use variables which
     are defined only if `YYDEBUG' is set.  */
  if (yydebug)
    {
      int yyi;

      YYFPRINTF (stderr, "Reducing via rule %d (line %d), ",
       yyn, yyrline[yyn]);

      /* Print the symbols being reduced, and their result.  */
      for (yyi = yyprhs[yyn]; yyrhs[yyi] > 0; yyi++)
   YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]);
      YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]);
    }
#endif

  switch (yyn) {

case 1:
#line 130 "ast_expr.y"
{ ((struct parser_control *)kota)->result = yyval.val; ;
    break;}
case 3:
#line 134 "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 4:
#line 135 "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 5:
#line 136 "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 6:
#line 137 "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 7:
#line 138 "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 8:
#line 139 "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 9:
#line 140 "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 10:
#line 141 "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 11:
#line 142 "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 12:
#line 143 "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 13:
#line 144 "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 14:
#line 145 "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 15:
#line 146 "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 16:
#line 147 "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 17:
#line 148 "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 705 "/usr/share/bison/bison.simple"


  yyvsp -= yylen;
  yyssp -= yylen;
#if YYLSP_NEEDED
  yylsp -= yylen;
#endif

#if YYDEBUG
  if (yydebug)
    {
      short *yyssp1 = yyss - 1;
      YYFPRINTF (stderr, "state stack now");
      while (yyssp1 != yyssp)
   YYFPRINTF (stderr, " %d", *++yyssp1);
      YYFPRINTF (stderr, "\n");
    }
#endif

  *++yyvsp = yyval;
#if YYLSP_NEEDED
  *++yylsp = yyloc;
#endif

  /* 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 - YYNTBASE] + *yyssp;
  if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
    yystate = yytable[yystate];
  else
    yystate = yydefgoto[yyn - YYNTBASE];

  goto yynewstate;


/*------------------------------------.
| yyerrlab -- here on detecting error |
`------------------------------------*/
yyerrlab:
  /* If not already recovering from an error, report this error.  */
  if (!yyerrstatus)
    {
      ++yynerrs;

#ifdef YYERROR_VERBOSE
      yyn = yypact[yystate];

      if (yyn > YYFLAG && yyn < YYLAST)
   {
     YYSIZE_T yysize = 0;
     char *yymsg;
     int yyx, yycount;

     yycount = 0;
     /* Start YYX at -YYN if negative to avoid negative indexes in
        YYCHECK.  */
     for (yyx = yyn < 0 ? -yyn : 0;
          yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++)
       if (yycheck[yyx + yyn] == yyx)
         yysize += yystrlen (yytname[yyx]) + 15, yycount++;
     yysize += yystrlen ("parse error, unexpected ") + 1;
     yysize += yystrlen (yytname[YYTRANSLATE (yychar)]);
     yymsg = (char *) YYSTACK_ALLOC (yysize);
     if (yymsg != 0)
       {
         char *yyp = yystpcpy (yymsg, "parse error, unexpected ");
         yyp = yystpcpy (yyp, yytname[YYTRANSLATE (yychar)]);

         if (yycount < 5)
      {
        yycount = 0;
        for (yyx = yyn < 0 ? -yyn : 0;
             yyx < (int) (sizeof (yytname) / sizeof (char *));
             yyx++)
          if (yycheck[yyx + yyn] == yyx)
            {
         const char *yyq = ! yycount ? ", expecting " : " or ";
         yyp = yystpcpy (yyp, yyq);
         yyp = yystpcpy (yyp, yytname[yyx]);
         yycount++;
            }
      }
         yyerror (yymsg);
         YYSTACK_FREE (yymsg);
       }
     else
       yyerror ("parse error; also virtual memory exhausted");
   }
      else
#endif /* defined (YYERROR_VERBOSE) */
   yyerror ("parse error");
    }
  goto yyerrlab1;


/*--------------------------------------------------.
| yyerrlab1 -- error raised explicitly by an action |
`--------------------------------------------------*/
yyerrlab1:
  if (yyerrstatus == 3)
    {
      /* If just tried and failed to reuse lookahead token after an
    error, discard it.  */

      /* return failure if at end of input */
      if (yychar == YYEOF)
   YYABORT;
      YYDPRINTF ((stderr, "Discarding token %d (%s).\n",
        yychar, yytname[yychar1]));
      yychar = YYEMPTY;
    }

  /* Else will try to reuse lookahead token after shifting the error
     token.  */

  yyerrstatus = 3;      /* Each real token shifted decrements this */

  goto yyerrhandle;


/*-------------------------------------------------------------------.
| yyerrdefault -- current state does not do anything special for the |
| error token.                                                       |
`-------------------------------------------------------------------*/
yyerrdefault:
#if 0
  /* This is wrong; only states that explicitly want error tokens
     should shift them.  */

  /* If its default is to accept any token, ok.  Otherwise pop it.  */
  yyn = yydefact[yystate];
  if (yyn)
    goto yydefault;
#endif


/*---------------------------------------------------------------.
| yyerrpop -- pop the current state because it cannot handle the |
| error token                                                    |
`---------------------------------------------------------------*/
yyerrpop:
  if (yyssp == yyss)
    YYABORT;
  yyvsp--;
  yystate = *--yyssp;
#if YYLSP_NEEDED
  yylsp--;
#endif

#if YYDEBUG
  if (yydebug)
    {
      short *yyssp1 = yyss - 1;
      YYFPRINTF (stderr, "Error: state stack now");
      while (yyssp1 != yyssp)
   YYFPRINTF (stderr, " %d", *++yyssp1);
      YYFPRINTF (stderr, "\n");
    }
#endif

/*--------------.
| yyerrhandle.  |
`--------------*/
yyerrhandle:
  yyn = yypact[yystate];
  if (yyn == YYFLAG)
    goto yyerrdefault;

  yyn += YYTERROR;
  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
    goto yyerrdefault;

  yyn = yytable[yyn];
  if (yyn < 0)
    {
      if (yyn == YYFLAG)
   goto yyerrpop;
      yyn = -yyn;
      goto yyreduce;
    }
  else if (yyn == 0)
    goto yyerrpop;

  if (yyn == YYFINAL)
    YYACCEPT;

  YYDPRINTF ((stderr, "Shifting error token, "));

  *++yyvsp = yylval;
#if YYLSP_NEEDED
  *++yylsp = yylloc;
#endif

  yystate = yyn;
  goto yynewstate;


/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here.  |
`-------------------------------------*/
yyacceptlab:
  yyresult = 0;
  goto yyreturn;

/*-----------------------------------.
| yyabortlab -- YYABORT comes here.  |
`-----------------------------------*/
yyabortlab:
  yyresult = 1;
  goto yyreturn;

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

yyreturn:
#ifndef yyoverflow
  if (yyss != yyssa)
    YYSTACK_FREE (yyss);
#endif
  return yyresult;
}
#line 152 "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);   
}


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) || !to_integer (b)) {
      ast_log(LOG_WARNING,"non-numeric argument\n");
      free_value(a);
      free_value(b);
      return(NULL);
   }

   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(NULL);
   }
   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) || !to_integer (b)) {
      free_value(a);
      free_value(b);
      ast_log(LOG_WARNING, "non-numeric argument\n");
      return(NULL);
   }

   r = make_integer (/*(quad_t)*/(a->u.i - b->u.i));
   if (chk_minus (a->u.i, b->u.i, r->u.i)) {
      free_value(a);
      free_value(b);
      ast_log(LOG_WARNING, "overload\n");
      return(NULL);
   }
   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(NULL);
   }

   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(NULL);
   }
   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) || !to_integer (b)) {
      free_value(a);
      free_value(b);
      ast_log(LOG_WARNING, "non-numeric argument\n");
      return(NULL);
   }

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

   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(NULL);
   }
   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(NULL);
   }

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

   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, 0)) != 0) {
      regerror (eval, &rp, errbuf, sizeof(errbuf));
      ast_log(LOG_WARNING,"regcomp() error : %s",errbuf);
      free_value(a);
      free_value(b);
      return(NULL);     
   }

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

---