/* Copyright (C) 1995 DJ Delorie, see COPYING.DJ for details */

/*  A Bison parser, made from expr.y with Bison version GNU Bison version 1.22
  */

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

#define	NUM	258
#define	OP_LOR	259
#define	OP_LAND	260
#define	OP_EQ	261
#define	OP_NE	262
#define	OP_LE	263
#define	OP_GE	264
#define	OP_SHL	265
#define	OP_SHR	266
#define	OP_NEG	267
#define	OP_LNOT	268
#define	OP_NOT	269

#line 1 "expr.y"


#include <ctype.h>
#include <stdio.h>
#include <string.h>
#ifndef TEST
#include "ed.h"
#include <debug/syms.h>
#endif
#define YYSTYPE long


#ifdef TEST
unsigned long syms_name2val (char *);
int main (int, char **);
int undefined_symbol = 0;
#define valid_addr(x,y) 0
#define read_child (void)
#endif
int evaluate (char *, long *, char **);
static int yylex ();
static void yyerror (char *);

static long result;
static char *input;
static char *error;


#ifndef YYLTYPE
typedef
  struct yyltype
    {
      int timestamp;
      int first_line;
      int first_column;
      int last_line;
      int last_column;
      char *text;
   }
  yyltype;

#define YYLTYPE yyltype
#endif

#ifndef YYSTYPE
#define YYSTYPE int
#endif
#include <stdio.h>

#ifndef __cplusplus
#ifndef __STDC__
#define const
#endif
#endif



#define	YYFINAL		55
#define	YYFLAG		-32768
#define	YYNTBASE	32

#define YYTRANSLATE(x) ((unsigned)(x) <= 269 ? yytranslate[x] : 34)

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,    26,     2,     2,     2,    21,     8,     2,    28,
    29,    19,    17,     2,    18,     2,    20,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,    22,     2,    10,
     2,    11,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
    30,     2,    31,     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,     5,     2,    27,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     1,     2,     3,     4,     7,
     9,    12,    13,    14,    15,    16,    23,    24,    25
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     2,     4,     8,    12,    16,    20,    24,    28,    32,
    36,    40,    44,    48,    52,    56,    60,    64,    68,    72,
    76,    79,    82,    85,    89,    93
};

static const short yyrhs[] = {    33,
     0,     3,     0,    33,     4,    33,     0,    33,     7,    33,
     0,    33,     5,    33,     0,    33,     8,    33,     0,    33,
     6,    33,     0,    33,     9,    33,     0,    33,    11,    33,
     0,    33,    10,    33,     0,    33,    14,    33,     0,    33,
    13,    33,     0,    33,    12,    33,     0,    33,    15,    33,
     0,    33,    16,    33,     0,    33,    17,    33,     0,    33,
    18,    33,     0,    33,    19,    33,     0,    33,    20,    33,
     0,    33,    21,    33,     0,    18,    33,     0,    26,    33,
     0,    27,    33,     0,    28,    33,    29,     0,    30,    33,
    31,     0,    33,    22,     3,     0
};

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
    46,    49,    50,    51,    52,    53,    54,    55,    56,    57,
    58,    59,    60,    61,    62,    63,    64,    65,    66,    68,
    70,    71,    72,    73,    74,    80
};

static const char * const yytname[] = {   "$","error","$illegal.","NUM","OP_LOR",
"'|'","'^'","OP_LAND","'&'","OP_EQ","'<'","'>'","OP_NE","OP_LE","OP_GE","OP_SHL",
"OP_SHR","'+'","'-'","'*'","'/'","'%'","':'","OP_NEG","OP_LNOT","OP_NOT","'!'",
"'~'","'('","')'","'['","']'","main","expr",""
};
#endif

static const short yyr1[] = {     0,
    32,    33,    33,    33,    33,    33,    33,    33,    33,    33,
    33,    33,    33,    33,    33,    33,    33,    33,    33,    33,
    33,    33,    33,    33,    33,    33
};

static const short yyr2[] = {     0,
     1,     1,     3,     3,     3,     3,     3,     3,     3,     3,
     3,     3,     3,     3,     3,     3,     3,     3,     3,     3,
     2,     2,     2,     3,     3,     3
};

static const short yydefact[] = {     0,
     2,     0,     0,     0,     0,     0,     1,    21,    22,    23,
     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
     0,    24,    25,     3,     5,     7,     4,     6,     8,    10,
     9,    13,    12,    11,    14,    15,    16,    17,    18,    19,
    20,    26,     0,     0,     0
};

static const short yydefgoto[] = {    53,
     7
};

static const short yypact[] = {    45,
-32768,    45,    45,    45,    45,    45,    98,-32768,-32768,-32768,
    72,    25,    45,    45,    45,    45,    45,    45,    45,    45,
    45,    45,    45,    45,    45,    45,    45,    45,    45,    45,
    50,-32768,-32768,   114,   114,   114,   128,   128,   142,   142,
   142,   142,   142,   142,   -12,   -12,    30,    30,    32,    32,
    32,-32768,    55,    57,-32768
};

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


#define	YYLAST		164


static const short yytable[] = {     8,
     9,    10,    11,    12,    26,    27,    28,    29,    30,    31,
    34,    35,    36,    37,    38,    39,    40,    41,    42,    43,
    44,    45,    46,    47,    48,    49,    50,    51,    13,    14,
    15,    16,    17,    18,    19,    20,    21,    22,    23,    24,
    25,    26,    27,    28,    29,    30,    31,     1,    28,    29,
    30,    31,    52,    31,    54,    33,    55,     0,     0,     0,
     0,     0,     2,     0,     0,     0,     0,     0,     0,     0,
     3,     4,     5,     0,     6,    13,    14,    15,    16,    17,
    18,    19,    20,    21,    22,    23,    24,    25,    26,    27,
    28,    29,    30,    31,     0,     0,     0,     0,     0,     0,
    32,    13,    14,    15,    16,    17,    18,    19,    20,    21,
    22,    23,    24,    25,    26,    27,    28,    29,    30,    31,
    16,    17,    18,    19,    20,    21,    22,    23,    24,    25,
    26,    27,    28,    29,    30,    31,    18,    19,    20,    21,
    22,    23,    24,    25,    26,    27,    28,    29,    30,    31,
-32768,-32768,-32768,-32768,-32768,-32768,    24,    25,    26,    27,
    28,    29,    30,    31
};

static const short yycheck[] = {     2,
     3,     4,     5,     6,    17,    18,    19,    20,    21,    22,
    13,    14,    15,    16,    17,    18,    19,    20,    21,    22,
    23,    24,    25,    26,    27,    28,    29,    30,     4,     5,
     6,     7,     8,     9,    10,    11,    12,    13,    14,    15,
    16,    17,    18,    19,    20,    21,    22,     3,    19,    20,
    21,    22,     3,    22,     0,    31,     0,    -1,    -1,    -1,
    -1,    -1,    18,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
    26,    27,    28,    -1,    30,     4,     5,     6,     7,     8,
     9,    10,    11,    12,    13,    14,    15,    16,    17,    18,
    19,    20,    21,    22,    -1,    -1,    -1,    -1,    -1,    -1,
    29,     4,     5,     6,     7,     8,     9,    10,    11,    12,
    13,    14,    15,    16,    17,    18,    19,    20,    21,    22,
     7,     8,     9,    10,    11,    12,    13,    14,    15,    16,
    17,    18,    19,    20,    21,    22,     9,    10,    11,    12,
    13,    14,    15,    16,    17,    18,    19,    20,    21,    22,
     9,    10,    11,    12,    13,    14,    15,    16,    17,    18,
    19,    20,    21,    22
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "bison.simple"

/* Skeleton output parser for bison,
   Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman

   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 1, 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., 675 Mass Ave, Cambridge, MA 02139, USA.  */


#ifndef alloca
#ifdef __GNUC__
#define alloca __builtin_alloca
#else /* not GNU C.  */
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi)
#include <alloca.h>
#else /* not sparc */
#if defined (MSDOS) && !defined (__TURBOC__)
#include <malloc.h>
#else /* not MSDOS, or __TURBOC__ */
#if defined(_AIX)
#include <malloc.h>
 #pragma alloca
#else /* not MSDOS, __TURBOC__, or _AIX */
#ifdef __hpux
#ifdef __cplusplus
extern "C" {
void *alloca (unsigned int);
};
#else /* not __cplusplus */
void *alloca ();
#endif /* not __cplusplus */
#endif /* __hpux */
#endif /* not _AIX */
#endif /* not MSDOS, or __TURBOC__ */
#endif /* not sparc.  */
#endif /* not GNU C.  */
#endif /* alloca not defined.  */

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

/* Note: there must be only one dollar sign in this file.
   It is replaced by the list of actions, each action
   as one case of the switch.  */

#define yyerrok		(yyerrstatus = 0)
#define yyclearin	(yychar = YYEMPTY)
#define YYEMPTY		-2
#define YYEOF		0
#define YYACCEPT	return(0)
#define YYABORT 	return(1)
#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

#ifndef YYPURE
#define YYLEX		yylex()
#endif

#ifdef YYPURE
#ifdef YYLSP_NEEDED
#define YYLEX		yylex(&yylval, &yylloc)
#else
#define YYLEX		yylex(&yylval)
#endif
#endif

/* If nonreentrant, generate the variables here */

#ifndef YYPURE

int	yychar;			/*  the lookahead symbol		*/
YYSTYPE	yylval;			/*  the semantic value of the		*/
				/*  lookahead symbol			*/

#ifdef YYLSP_NEEDED
YYLTYPE yylloc;			/*  location data for the lookahead	*/
				/*  symbol				*/
#endif

int yynerrs;			/*  number of parse errors so far       */
#endif  /* not YYPURE */

#if YYDEBUG != 0
int yydebug;			/*  nonzero means print parse trace	*/
/* Since this is uninitialized, it does not stop multiple parsers
   from coexisting.  */
#endif

/*  YYINITDEPTH indicates the initial size of the parser's stacks	*/

#ifndef	YYINITDEPTH
#define YYINITDEPTH 200
#endif

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

#if YYMAXDEPTH == 0
#undef YYMAXDEPTH
#endif

#ifndef YYMAXDEPTH
#define YYMAXDEPTH 10000
#endif

/* Prevent warning if -Wstrict-prototypes.  */
#ifdef __GNUC__
int yyparse (void);
#endif

#if __GNUC__ > 1		/* GNU C and GNU C++ define this.  */
#define __yy_bcopy(FROM,TO,COUNT)	__builtin_memcpy(TO,FROM,COUNT)
#else				/* not GNU C or C++ */
#ifndef __cplusplus

/* This is the most reliable way to avoid incompatibilities
   in available built-in functions on various systems.  */
static void
__yy_bcopy (from, to, count)
     char *from;
     char *to;
     int count;
{
  register char *f = from;
  register char *t = to;
  register int i = count;

  while (i-- > 0)
    *t++ = *f++;
}

#else /* __cplusplus */

/* This is the most reliable way to avoid incompatibilities
   in available built-in functions on various systems.  */
static void
__yy_bcopy (char *from, char *to, int count)
{
  register char *f = from;
  register char *t = to;
  register int i = count;

  while (i-- > 0)
    *t++ = *f++;
}

#endif
#endif

#line 184 "bison.simple"
int
yyparse()
{
  register int yystate;
  register int yyn;
  register short *yyssp;
  register YYSTYPE *yyvsp;
  int yyerrstatus;	/*  number of tokens to shift before error messages enabled */
  int yychar1 = 0;		/*  lookahead token as an internal (translated) token number */

  short	yyssa[YYINITDEPTH];	/*  the state stack			*/
  YYSTYPE yyvsa[YYINITDEPTH];	/*  the semantic value stack		*/

  short *yyss = yyssa;		/*  refer to the stacks thru separate pointers */
  YYSTYPE *yyvs = yyvsa;	/*  to allow yyoverflow to reallocate them elsewhere */

#ifdef YYLSP_NEEDED
  YYLTYPE yylsa[YYINITDEPTH];	/*  the location stack			*/
  YYLTYPE *yyls = yylsa;
  YYLTYPE *yylsp;

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

  int yystacksize = YYINITDEPTH;

#ifdef YYPURE
  int yychar;
  YYSTYPE yylval;
  int yynerrs;
#ifdef YYLSP_NEEDED
  YYLTYPE yylloc;
#endif
#endif

  YYSTYPE yyval;		/*  the variable used to return		*/
				/*  semantic values from the action	*/
				/*  routines				*/

  int yylen;

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Starting parse\n");
#endif

  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 - 1;
  yyvsp = yyvs;
#ifdef YYLSP_NEEDED
  yylsp = yyls;
#endif

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

  *++yyssp = yystate;

  if (yyssp >= yyss + yystacksize - 1)
    {
      /* 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;
#ifdef YYLSP_NEEDED
      YYLTYPE *yyls1 = yyls;
#endif

      /* Get the current used size of the three stacks, in elements.  */
      int size = yyssp - yyss + 1;

#ifdef yyoverflow
      /* Each stack pointer address is followed by the size of
	 the data in use in that stack, in bytes.  */
#ifdef YYLSP_NEEDED
      /* 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, size * sizeof (*yyssp),
		 &yyvs1, size * sizeof (*yyvsp),
		 &yyls1, size * sizeof (*yylsp),
		 &yystacksize);
#else
      yyoverflow("parser stack overflow",
		 &yyss1, size * sizeof (*yyssp),
		 &yyvs1, size * sizeof (*yyvsp),
		 &yystacksize);
#endif

      yyss = yyss1; yyvs = yyvs1;
#ifdef YYLSP_NEEDED
      yyls = yyls1;
#endif
#else /* no yyoverflow */
      /* Extend the stack our own way.  */
      if (yystacksize >= YYMAXDEPTH)
	{
	  yyerror("parser stack overflow");
	  return 2;
	}
      yystacksize *= 2;
      if (yystacksize > YYMAXDEPTH)
	yystacksize = YYMAXDEPTH;
      yyss = (short *) alloca (yystacksize * sizeof (*yyssp));
      __yy_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
      yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
      __yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
      yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
      __yy_bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp));
#endif
#endif /* no yyoverflow */

      yyssp = yyss + size - 1;
      yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
      yylsp = yyls + size - 1;
#endif

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Stack size increased to %d\n", yystacksize);
#endif

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

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Entering state %d\n", yystate);
#endif

  goto 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)
    {
#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Reading a token: ");
#endif
      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 */

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Now at end of input.\n");
#endif
    }
  else
    {
      yychar1 = YYTRANSLATE(yychar);

#if YYDEBUG != 0
      if (yydebug)
	{
	  fprintf (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
	  fprintf (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.  */

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
#endif

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

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

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

  yystate = yyn;
  goto yynewstate;

/* Do the default action for the current state.  */
yydefault:

  yyn = yydefact[yystate];
  if (yyn == 0)
    goto yyerrlab;

/* Do a reduction.  yyn is the number of a rule to reduce with.  */
yyreduce:
  yylen = yyr2[yyn];
  if (yylen > 0)
    yyval = yyvsp[1-yylen]; /* implement default value of the action */

#if YYDEBUG != 0
  if (yydebug)
    {
      int i;

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

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


  switch (yyn) {

case 1:
#line 46 "expr.y"
{ result = yyvsp[0]; ;
    break;}
case 2:
#line 49 "expr.y"
{ yyval = yyvsp[0]; ;
    break;}
case 3:
#line 50 "expr.y"
{ yyval = yyvsp[-2] || yyvsp[0]; ;
    break;}
case 4:
#line 51 "expr.y"
{ yyval = yyvsp[-2] && yyvsp[0]; ;
    break;}
case 5:
#line 52 "expr.y"
{ yyval = yyvsp[-2] | yyvsp[0]; ;
    break;}
case 6:
#line 53 "expr.y"
{ yyval = yyvsp[-2] & yyvsp[0]; ;
    break;}
case 7:
#line 54 "expr.y"
{ yyval = yyvsp[-2] ^ yyvsp[0]; ;
    break;}
case 8:
#line 55 "expr.y"
{ yyval = yyvsp[-2] == yyvsp[0]; ;
    break;}
case 9:
#line 56 "expr.y"
{ yyval = yyvsp[-2] > yyvsp[0]; ;
    break;}
case 10:
#line 57 "expr.y"
{ yyval = yyvsp[-2] < yyvsp[0]; ;
    break;}
case 11:
#line 58 "expr.y"
{ yyval = yyvsp[-2] >= yyvsp[0]; ;
    break;}
case 12:
#line 59 "expr.y"
{ yyval = yyvsp[-2] <= yyvsp[0]; ;
    break;}
case 13:
#line 60 "expr.y"
{ yyval = yyvsp[-2] != yyvsp[0]; ;
    break;}
case 14:
#line 61 "expr.y"
{ yyval = (unsigned)yyvsp[-2] << yyvsp[0]; ;
    break;}
case 15:
#line 62 "expr.y"
{ yyval = (unsigned)yyvsp[-2] >> yyvsp[0]; ;
    break;}
case 16:
#line 63 "expr.y"
{ yyval = yyvsp[-2] + yyvsp[0]; ;
    break;}
case 17:
#line 64 "expr.y"
{ yyval = yyvsp[-2] - yyvsp[0]; ;
    break;}
case 18:
#line 65 "expr.y"
{ yyval = yyvsp[-2] * yyvsp[0]; ;
    break;}
case 19:
#line 67 "expr.y"
{ if (yyvsp[0]) yyval = yyvsp[-2] / yyvsp[0]; else yyerror ("Division by zero"); ;
    break;}
case 20:
#line 69 "expr.y"
{ if (yyvsp[0]) yyval = yyvsp[-2] % yyvsp[0]; else yyerror ("Division by zero"); ;
    break;}
case 21:
#line 70 "expr.y"
{ yyval = -yyvsp[0]; ;
    break;}
case 22:
#line 71 "expr.y"
{ yyval = !yyvsp[0]; ;
    break;}
case 23:
#line 72 "expr.y"
{ yyval = ~yyvsp[0]; ;
    break;}
case 24:
#line 73 "expr.y"
{ yyval = yyvsp[-1]; ;
    break;}
case 25:
#line 75 "expr.y"
{ if (valid_addr (yyvsp[-1], 4))
	      { long l; read_child (yyvsp[-1], &l, 4); yyval = l; }
	    else
	      yyerror ("Error reading child");
	  ;
    break;}
case 26:
#line 81 "expr.y"
{ switch (yyvsp[0]) {
	  case 1: yyval = (yyvsp[-2] & 0xff); break;
	  case 2: yyval = (yyvsp[-2] & 0xffff); break;
	  case 4: yyval = (yyvsp[-2] & 0xffffffff); break;
	  default: yyerror ("Invalid resizing");
	  };
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 465 "bison.simple"

  yyvsp -= yylen;
  yyssp -= yylen;
#ifdef YYLSP_NEEDED
  yylsp -= yylen;
#endif

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

  *++yyvsp = yyval;

#ifdef YYLSP_NEEDED
  yylsp++;
  if (yylen == 0)
    {
      yylsp->first_line = yylloc.first_line;
      yylsp->first_column = yylloc.first_column;
      yylsp->last_line = (yylsp-1)->last_line;
      yylsp->last_column = (yylsp-1)->last_column;
      yylsp->text = 0;
    }
  else
    {
      yylsp->last_line = (yylsp+yylen-1)->last_line;
      yylsp->last_column = (yylsp+yylen-1)->last_column;
    }
#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 */

  if (! yyerrstatus)
    /* If not already recovering from an error, report this error.  */
    {
      ++yynerrs;

#ifdef YYERROR_VERBOSE
      yyn = yypact[yystate];

      if (yyn > YYFLAG && yyn < YYLAST)
	{
	  int size = 0;
	  char *msg;
	  int x, count;

	  count = 0;
	  /* Start X at -yyn if nec to avoid negative indexes in yycheck.  */
	  for (x = (yyn < 0 ? -yyn : 0);
	       x < (sizeof(yytname) / sizeof(char *)); x++)
	    if (yycheck[x + yyn] == x)
	      size += strlen(yytname[x]) + 15, count++;
	  msg = (char *) malloc(size + 15);
	  if (msg != 0)
	    {
	      strcpy(msg, "parse error");

	      if (count < 5)
		{
		  count = 0;
		  for (x = (yyn < 0 ? -yyn : 0);
		       x < (sizeof(yytname) / sizeof(char *)); x++)
		    if (yycheck[x + yyn] == x)
		      {
			strcat(msg, count == 0 ? ", expecting `" : " or `");
			strcat(msg, yytname[x]);
			strcat(msg, "'");
			count++;
		      }
		}
	      yyerror(msg);
	      free(msg);
	    }
	  else
	    yyerror ("parse error; also virtual memory exceeded");
	}
      else
#endif /* YYERROR_VERBOSE */
	yyerror("parse error");
    }

  goto yyerrlab1;
yyerrlab1:   /* here on error raised explicitly by an action */

  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;

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif

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

#if 0
  /* This is wrong; only states that explicitly want error tokens
     should shift them.  */
  yyn = yydefact[yystate];  /* If its default is to accept any token, ok.  Otherwise pop it.*/
  if (yyn) goto yydefault;
#endif

yyerrpop:   /* pop the current state because it cannot handle the error token */

  if (yyssp == yyss) YYABORT;
  yyvsp--;
  yystate = *--yyssp;
#ifdef YYLSP_NEEDED
  yylsp--;
#endif

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

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;

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Shifting error token, ");
#endif

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

  yystate = yyn;
  goto yynewstate;
}
#line 89 "expr.y"


static int
yylex ()
{
  char *p, save;
  int i;
  static struct {
    char c1, c2;
    int token;
  } twochars[] = {
    { '=', '=', OP_EQ },
    { '>', '=', OP_GE },
    { '<', '=', OP_LE },
    { '!', '=', OP_NE },
    { '&', '&', OP_LAND},
    { '|', '|', OP_LOR },
    { '<', '<', OP_SHL},
    { '>', '>', OP_SHR}};

  while (isspace (*input)) input++;
  switch (*input)
    {
    case '0' ... '9':
    case 'a' ... 'z':
    case 'A' ... 'Z':
    case '%':
    case '_':
    case '#':
    case '.':
      p = input++;
      while (isalnum (*input)
	     || *input == '_' || *input == '#' || *input == '.')
	input++;
      save = *input;
      *input = 0;
      yylval = (long) syms_name2val (p);
      if (undefined_symbol)
	{
	  static char buf[80];
	  sprintf (buf, "Undefined symbol `%s'", p);
	  yyerror (buf);
	}
      *input = save;
      return NUM;
    case '\'':
      if (input[1] == '\\' && input[2] && input[3] == '\'')
	{
	  static char escaped[] = "e\et\tb\bn\nr\r\\\\''";
	  for (i = 0; escaped[i]; i += 2)
	    if (input[2] == escaped[i])
	      {
		input += 4;
		yylval = escaped[i + 1];
		return NUM;
	      }
	  yyerror ("Unrecognized escaped character");
	}
      else if (input[1] && input[2] == '\'')
	{
	  yylval = input[1];
	  input += 3;
	}
      else
	yyerror ("Unterminated character constant");
      return NUM;
    case 0:
      return 0;
    default:
      for (i = 0; i < sizeof (twochars) / sizeof (twochars[0]); i++)
	if (*input == twochars[i].c1 && input[1] == twochars[i].c2)
	  {
	    input += 2;
	    return twochars[i].token;
	  }
      return *input++;
    }
}

int
evaluate (char *exp, long *res, char **errtxt)
{
  int err;

  input = exp;
  error = 0;
  err = yyparse ();
  *res = result;
  *errtxt = error;
  undefined_symbol = 0;
  return err || error;
}

static void
yyerror (char *s)
{
  if (!error) error = s;
}


#ifdef TEST

unsigned long
syms_name2val (char *p)
{
  return strtoul(p, 0, 0);
}

int
main (int argc, char **argv)
{
  long res;
  int i, err;
  char *errtxt;

  for (i = 1; i < argc; i++)
    {
      err = evaluate (argv[i], &res, &errtxt);
      if (err)
	printf ("`%s' -> %s\n", argv[i], errtxt);
      else
	printf ("`%s' -> %ld\n", argv[i], res);
    }
  return 0;
}
#endif
