gram.tab.cpp

FastDb是高效的内存数据库系统

/*  A Bison parser, made from gram.y with Bison version GNU Bison version 1.24
  */

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

#define	ID	258
#define	STRCONST	259
#define	INTCONST	260
#define	CREATE	261
#define	INSERT	262
#define	DROP	263
#define	OPEN	264
#define	CLOSE	265
#define	QUIT	266
#define	SELECT	267
#define	DELETE	268
#define	WHERE	269
#define	FROM	270
#define	NL	271
#define	ERROR	272
#define	AND	273
#define	OR	274
#define	DEBUG	275
#define	HELP	276
#define	DUMP	277
#define	opLE	278
#define	opGE	279
#define	opNE	280
#define	NOT	281

#line 1 "gram.y"

#include <iostream.h>
#ifndef UNIX
#include <malloc.h>
#endif
#include "BT.h"
#include "command.h"

void CommandPrompt();
int yyerror(char *msg);
int yylex();

#line 14 "gram.y"
typedef union {
    BTkey *key;
    char *string;
    BToper oper;
    GiSTpredicate *pred;
    int number;
} YYSTYPE;

#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

#include <stdio.h>

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



#define	YYFINAL		71
#define	YYFLAG		-32768
#define	YYNTBASE	33

#define YYTRANSLATE(x) ((unsigned)(x) <= 281 ? yytranslate[x] : 40)

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

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     1,     4,     9,    14,    18,    22,    28,    37,    43,
    46,    49,    52,    57,    60,    62,    63,    65,    66,    69,
    71,    75,    79,    83,    86,    90,    92,    94,    96,    98,
   100
};

static const short yyrhs[] = {    -1,
    33,    34,     0,     6,     3,     3,    16,     0,     9,     3,
     3,    16,     0,     8,     3,    16,     0,    10,     3,    16,
     0,    12,    15,     3,    36,    16,     0,     7,     3,    23,
    37,    25,     5,    24,    16,     0,    13,    15,     3,    36,
    16,     0,    11,    16,     0,    20,    16,     0,    21,    16,
     0,    22,     3,    35,    16,     0,     1,    16,     0,    16,
     0,     0,     5,     0,     0,    14,    38,     0,     4,     0,
     3,    39,    37,     0,    38,    19,    38,     0,    38,    18,
    38,     0,    32,    38,     0,    23,    38,    24,     0,    28,
     0,    26,     0,    29,     0,    30,     0,    27,     0,    31,
     0
};

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
    43,    44,    49,    53,    57,    60,    63,    67,    71,    75,
    77,    79,    81,    84,    86,    90,    92,    97,    99,   104,
   108,   110,   112,   114,   116,   121,   122,   123,   124,   125,
   126
};

static const char * const yytname[] = {   "$","error","$undefined.","ID","STRCONST",
"INTCONST","CREATE","INSERT","DROP","OPEN","CLOSE","QUIT","SELECT","DELETE",
"WHERE","FROM","NL","ERROR","AND","OR","DEBUG","HELP","DUMP","'('","')'","','",
"'>'","'='","'<'","opLE","opGE","opNE","NOT","commands","command","dump_page",
"where_clause","key","predicate","operator",""
};
#endif

static const short yyr1[] = {     0,
    33,    33,    34,    34,    34,    34,    34,    34,    34,    34,
    34,    34,    34,    34,    34,    35,    35,    36,    36,    37,
    38,    38,    38,    38,    38,    39,    39,    39,    39,    39,
    39
};

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

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

static const short yydefgoto[] = {     1,
    15,    36,    42,    39,    49,    59
};

static const short yypact[] = {-32768,
     1,    -1,    13,    23,    24,    25,    34,    22,    26,    27,
-32768,    28,    29,    36,-32768,-32768,    37,    20,    30,    44,
    32,-32768,    46,    47,-32768,-32768,    48,    35,    50,-32768,
    39,-32768,    38,    38,-32768,    40,-32768,-32768,    33,-32768,
    -3,    41,    43,-32768,    55,     5,    -3,    -3,   -13,-32768,
-32768,    42,-32768,-32768,-32768,-32768,-32768,-32768,    50,     6,
-32768,    -3,    -3,    45,-32768,-32768,-32768,    49,-32768,    62,
-32768
};

static const short yypgoto[] = {-32768,
-32768,-32768,    31,     4,   -44,-32768
};


#define	YYLAST		67


static const short yytable[] = {    46,
    70,     2,    60,    61,    62,    63,     3,     4,     5,     6,
     7,     8,     9,    10,    16,    17,    11,    67,    68,    47,
    12,    13,    14,    62,    63,    18,    19,    20,    48,    66,
    53,    54,    55,    56,    57,    58,    21,    22,    27,    28,
    23,    24,    29,    25,    26,    30,    31,    32,    33,    34,
    37,    41,    35,    38,    40,    44,    50,    45,    51,    52,
    69,    71,    65,     0,    43,    64,    62
};

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

/* Skeleton output parser for bison,
   Copyright (C) 1984, 1989, 1990 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., 675 Mass Ave, Cambridge, MA 02139, 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.  */

#ifdef __GNUC__
#define alloca __builtin_alloca
#else /* not __GNUC__ */
#if HAVE_ALLOCA_H
#include <alloca.h>
#else /* not HAVE_ALLOCA_H */
#ifdef _AIX
 #pragma alloca
#else /* not _AIX */
char *alloca ();
#endif /* not _AIX */
#endif /* not HAVE_ALLOCA_H */
#endif /* not __GNUC__ */

extern int yylex();
extern void yyerror();

#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
#ifdef YYLEX_PARAM
#define YYLEX		yylex(&yylval, &yylloc, YYLEX_PARAM)
#else
#define YYLEX		yylex(&yylval, &yylloc)
#endif
#else /* not YYLSP_NEEDED */
#ifdef YYLEX_PARAM
#define YYLEX		yylex(&yylval, YYLEX_PARAM)
#else
#define YYLEX		yylex(&yylval)
#endif
#endif /* not YYLSP_NEEDED */
#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_memcpy(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_memcpy (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_memcpy (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 192 "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
#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
#else
#define YYPARSE_PARAM
#define YYPARSE_PARAM_DECL
#endif

int
yyparse(YYPARSE_PARAM)
     YYPARSE_PARAM_DECL
{
  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