-\r
-/* A Bison parser, made from schema.y\r
- by GNU Bison version 1.25\r
- */\r
-\r
-#define YYBISON 1 /* Identify Bison output. */\r
-\r
-#define yyparse SchemaParserparse\r
-#define yylex SchemaParserlex\r
-#define yyerror SchemaParsererror\r
-#define yylval SchemaParserlval\r
-#define yychar SchemaParserchar\r
-#define yydebug SchemaParserdebug\r
-#define yynerrs SchemaParsernerrs\r
-#define NAME 258\r
-#define SEMICOLON 259\r
-#define LEFTBRACE 260\r
-#define RIGHTBRACE 261\r
-#define TABLE 262\r
-#define STREAM 263\r
-\r
-#line 8 "schema.y"\r
-\r
-\r
-\r
-#include <stdio.h>\r
-\r
-/* Some addn'l includes, necessary but not included by the\r
- bison generated code.\r
-*/\r
-\r
-#include <stdlib.h>\r
-\r
-/* prototypes for the parser callbacks.\r
-*/\r
-\r
-#include "parse_schema.h"\r
-\r
-/* Interface to schemalexer */\r
- int yyparse();\r
- void yyerror(char *s);\r
- int yylex();\r
-extern int flex_schema_lineno, flex_schema_ch;\r
-\r
-/* Return value */\r
-extern table_list *Schema;\r
-\r
-#define YYDEBUG 1\r
-\r
-\r
-#line 40 "schema.y"\r
-typedef union {\r
- char* strval;\r
- field_entry *field_t;\r
- field_entry_list *field_list_t;\r
- table_def *table_def_t;\r
- table_list *table_list_t;\r
- param_list *plist_t;\r
- } YYSTYPE;\r
-#include <stdio.h>\r
-\r
-#ifndef __cplusplus\r
-#ifndef __STDC__\r
-#define const\r
-#endif\r
-#endif\r
-\r
-\r
-\r
-#define YYFINAL 31\r
-#define YYFLAG -32768\r
-#define YYNTBASE 12\r
-\r
-#define YYTRANSLATE(x) ((unsigned)(x) <= 263 ? yytranslate[x] : 19)\r
-\r
-static const char yytranslate[] = { 0,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 9,\r
- 10, 2, 2, 11, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\r
- 2, 2, 2, 2, 2, 1, 2, 3, 4, 5,\r
- 6, 7, 8\r
-};\r
-\r
-#if YYDEBUG != 0\r
-static const short yyprhs[] = { 0,\r
- 0, 2, 4, 7, 14, 21, 23, 26, 32, 33,\r
- 37, 39\r
-};\r
-\r
-static const short yyrhs[] = { 13,\r
- 0, 14, 0, 13, 14, 0, 7, 3, 17, 5,\r
- 15, 6, 0, 8, 3, 17, 5, 15, 6, 0,\r
- 16, 0, 15, 16, 0, 3, 3, 3, 17, 4,\r
- 0, 0, 9, 18, 10, 0, 3, 0, 18, 11,\r
- 3, 0\r
-};\r
-\r
-#endif\r
-\r
-#if YYDEBUG != 0\r
-static const short yyrline[] = { 0,\r
- 68, 70, 71, 74, 76, 80, 81, 84, 88, 90,\r
- 93, 95\r
-};\r
-#endif\r
-\r
-\r
-#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)\r
-\r
-static const char * const yytname[] = { "$","error","$undefined.","NAME","SEMICOLON",\r
-"LEFTBRACE","RIGHTBRACE","TABLE","STREAM","'('","')'","','","result","table_list",\r
-"table_def","field_list","field","opt_param_commalist","param_commalist", NULL\r
-};\r
-#endif\r
-\r
-static const short yyr1[] = { 0,\r
- 12, 13, 13, 14, 14, 15, 15, 16, 17, 17,\r
- 18, 18\r
-};\r
-\r
-static const short yyr2[] = { 0,\r
- 1, 1, 2, 6, 6, 1, 2, 5, 0, 3,\r
- 1, 3\r
-};\r
-\r
-static const short yydefact[] = { 0,\r
- 0, 0, 1, 2, 9, 9, 3, 0, 0, 0,\r
- 11, 0, 0, 0, 10, 0, 0, 0, 6, 0,\r
- 12, 0, 4, 7, 5, 9, 0, 8, 0, 0,\r
- 0\r
-};\r
-\r
-static const short yydefgoto[] = { 29,\r
- 3, 4, 18, 19, 9, 12\r
-};\r
-\r
-static const short yypact[] = { 2,\r
- 0, 4, 2,-32768, 5, 5,-32768, 10, 11, 12,\r
--32768, 1, 15, 15,-32768, 16, 18, -2,-32768, -1,\r
--32768, 19,-32768,-32768,-32768, 5, 20,-32768, 23, 25,\r
--32768\r
-};\r
-\r
-static const short yypgoto[] = {-32768,\r
--32768, 24, 14, -12, -6,-32768\r
-};\r
-\r
-\r
-#define YYLAST 28\r
-\r
-\r
-static const short yytable[] = { 10,\r
- 17, 17, 5, 23, 25, 24, 6, 24, 1, 2,\r
- 15, 16, 11, 8, 0, 13, 14, 17, 21, 27,\r
- 22, 26, 30, 28, 31, 0, 7, 20\r
-};\r
-\r
-static const short yycheck[] = { 6,\r
- 3, 3, 3, 6, 6, 18, 3, 20, 7, 8,\r
- 10, 11, 3, 9, -1, 5, 5, 3, 3, 26,\r
- 3, 3, 0, 4, 0, -1, 3, 14\r
-};\r
-/* -*-C-*- Note some compilers choke on comments on `#line' lines. */\r
-#line 3 "bison.simple"\r
-\r
-/* Skeleton output parser for bison,\r
- Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.\r
-\r
- This program is free software; you can redistribute it and/or modify\r
- it under the terms of the GNU General Public License as published by\r
- the Free Software Foundation; either version 2, or (at your option)\r
- any later version.\r
-\r
- This program is distributed in the hope that it will be useful,\r
- but WITHOUT ANY WARRANTY; without even the implied warranty of\r
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r
- GNU General Public License for more details.\r
-\r
- You should have received a copy of the GNU General Public License\r
- along with this program; if not, write to the Free Software\r
- Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */\r
-\r
-/* As a special exception, when this file is copied by Bison into a\r
- Bison output file, you may use that output file without restriction.\r
- This special exception was added by the Free Software Foundation\r
- in version 1.24 of Bison. */\r
-\r
-#ifndef alloca\r
-#ifdef __GNUC__\r
-#define alloca __builtin_alloca\r
-#else /* not GNU C. */\r
-#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi)\r
-#include <alloca.h>\r
-#else /* not sparc */\r
-#if defined (MSDOS) && !defined (__TURBOC__)\r
-#include <malloc.h>\r
-#else /* not MSDOS, or __TURBOC__ */\r
-#if defined(_AIX)\r
-#include <malloc.h>\r
- #pragma alloca\r
-#else /* not MSDOS, __TURBOC__, or _AIX */\r
-#ifdef __hpux\r
-#ifdef __cplusplus\r
-extern "C" {\r
-void *alloca (unsigned int);\r
-};\r
-#else /* not __cplusplus */\r
-void *alloca ();\r
-#endif /* not __cplusplus */\r
-#endif /* __hpux */\r
-#endif /* not _AIX */\r
-#endif /* not MSDOS, or __TURBOC__ */\r
-#endif /* not sparc. */\r
-#endif /* not GNU C. */\r
-#endif /* alloca not defined. */\r
-\r
-/* This is the parser code that is written into each bison parser\r
- when the %semantic_parser declaration is not specified in the grammar.\r
- It was written by Richard Stallman by simplifying the hairy parser\r
- used when %semantic_parser is specified. */\r
-\r
-/* Note: there must be only one dollar sign in this file.\r
- It is replaced by the list of actions, each action\r
- as one case of the switch. */\r
-\r
-#define yyerrok (yyerrstatus = 0)\r
-#define yyclearin (yychar = YYEMPTY)\r
-#define YYEMPTY -2\r
-#define YYEOF 0\r
-#define YYACCEPT return(0)\r
-#define YYABORT return(1)\r
-#define YYERROR goto yyerrlab1\r
-/* Like YYERROR except do call yyerror.\r
- This remains here temporarily to ease the\r
- transition to the new meaning of YYERROR, for GCC.\r
- Once GCC version 2 has supplanted version 1, this can go. */\r
-#define YYFAIL goto yyerrlab\r
-#define YYRECOVERING() (!!yyerrstatus)\r
-#define YYBACKUP(token, value) \\r
-do \\r
- if (yychar == YYEMPTY && yylen == 1) \\r
- { yychar = (token), yylval = (value); \\r
- yychar1 = YYTRANSLATE (yychar); \\r
- YYPOPSTACK; \\r
- goto yybackup; \\r
- } \\r
- else \\r
- { yyerror ("syntax error: cannot back up"); YYERROR; } \\r
-while (0)\r
-\r
-#define YYTERROR 1\r
-#define YYERRCODE 256\r
-\r
-#ifndef YYPURE\r
-#define YYLEX yylex()\r
-#endif\r
-\r
-#ifdef YYPURE\r
-#ifdef YYLSP_NEEDED\r
-#ifdef YYLEX_PARAM\r
-#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM)\r
-#else\r
-#define YYLEX yylex(&yylval, &yylloc)\r
-#endif\r
-#else /* not YYLSP_NEEDED */\r
-#ifdef YYLEX_PARAM\r
-#define YYLEX yylex(&yylval, YYLEX_PARAM)\r
-#else\r
-#define YYLEX yylex(&yylval)\r
-#endif\r
-#endif /* not YYLSP_NEEDED */\r
-#endif\r
-\r
-/* If nonreentrant, generate the variables here */\r
-\r
-#ifndef YYPURE\r
-\r
-int yychar; /* the lookahead symbol */\r
-YYSTYPE yylval; /* the semantic value of the */\r
- /* lookahead symbol */\r
-\r
-#ifdef YYLSP_NEEDED\r
-YYLTYPE yylloc; /* location data for the lookahead */\r
- /* symbol */\r
-#endif\r
-\r
-int yynerrs; /* number of parse errors so far */\r
-#endif /* not YYPURE */\r
-\r
-#if YYDEBUG != 0\r
-int yydebug; /* nonzero means print parse trace */\r
-/* Since this is uninitialized, it does not stop multiple parsers\r
- from coexisting. */\r
-#endif\r
-\r
-/* YYINITDEPTH indicates the initial size of the parser's stacks */\r
-\r
-#ifndef YYINITDEPTH\r
-#define YYINITDEPTH 200\r
-#endif\r
-\r
-/* YYMAXDEPTH is the maximum size the stacks can grow to\r
- (effective only if the built-in stack extension method is used). */\r
-\r
-#if YYMAXDEPTH == 0\r
-#undef YYMAXDEPTH\r
-#endif\r
-\r
-#ifndef YYMAXDEPTH\r
-#define YYMAXDEPTH 10000\r
-#endif\r
-\r
-/* Prevent warning if -Wstrict-prototypes. */\r
-#ifdef __GNUC__\r
-int yyparse (void);\r
-#endif\r
-\f\r
-#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */\r
-#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT)\r
-#else /* not GNU C or C++ */\r
-#ifndef __cplusplus\r
-\r
-/* This is the most reliable way to avoid incompatibilities\r
- in available built-in functions on various systems. */\r
-static void\r
-__yy_memcpy (to, from, count)\r
- char *to;\r
- char *from;\r
- int count;\r
-{\r
- register char *f = from;\r
- register char *t = to;\r
- register int i = count;\r
-\r
- while (i-- > 0)\r
- *t++ = *f++;\r
-}\r
-\r
-#else /* __cplusplus */\r
-\r
-/* This is the most reliable way to avoid incompatibilities\r
- in available built-in functions on various systems. */\r
-static void\r
-__yy_memcpy (char *to, char *from, int count)\r
-{\r
- register char *f = from;\r
- register char *t = to;\r
- register int i = count;\r
-\r
- while (i-- > 0)\r
- *t++ = *f++;\r
-}\r
-\r
-#endif\r
-#endif\r
-\f\r
-#line 196 "bison.simple"\r
-\r
-/* The user can define YYPARSE_PARAM as the name of an argument to be passed\r
- into yyparse. The argument should have type void *.\r
- It should actually point to an object.\r
- Grammar actions can access the variable by casting it\r
- to the proper pointer type. */\r
-\r
-#ifdef YYPARSE_PARAM\r
-#ifdef __cplusplus\r
-#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM\r
-#define YYPARSE_PARAM_DECL\r
-#else /* not __cplusplus */\r
-#define YYPARSE_PARAM_ARG YYPARSE_PARAM\r
-#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;\r
-#endif /* not __cplusplus */\r
-#else /* not YYPARSE_PARAM */\r
-#define YYPARSE_PARAM_ARG\r
-#define YYPARSE_PARAM_DECL\r
-#endif /* not YYPARSE_PARAM */\r
-\r
-int\r
-yyparse(YYPARSE_PARAM_ARG)\r
- YYPARSE_PARAM_DECL\r
-{\r
- register int yystate;\r
- register int yyn;\r
- register short *yyssp;\r
- register YYSTYPE *yyvsp;\r
- int yyerrstatus; /* number of tokens to shift before error messages enabled */\r
- int yychar1 = 0; /* lookahead token as an internal (translated) token number */\r
-\r
- short yyssa[YYINITDEPTH]; /* the state stack */\r
- YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */\r
-\r
- short *yyss = yyssa; /* refer to the stacks thru separate pointers */\r
- YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */\r
-\r
-#ifdef YYLSP_NEEDED\r
- YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */\r
- YYLTYPE *yyls = yylsa;\r
- YYLTYPE *yylsp;\r
-\r
-#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)\r
-#else\r
-#define YYPOPSTACK (yyvsp--, yyssp--)\r
-#endif\r
-\r
- int yystacksize = YYINITDEPTH;\r
-\r
-#ifdef YYPURE\r
- int yychar;\r
- YYSTYPE yylval;\r
- int yynerrs;\r
-#ifdef YYLSP_NEEDED\r
- YYLTYPE yylloc;\r
-#endif\r
-#endif\r
-\r
- YYSTYPE yyval; /* the variable used to return */\r
- /* semantic values from the action */\r
- /* routines */\r
-\r
- int yylen;\r
-\r
-#if YYDEBUG != 0\r
- if (yydebug)\r
- fprintf(stderr, "Starting parse\n");\r
-#endif\r
-\r
- yystate = 0;\r
- yyerrstatus = 0;\r
- yynerrs = 0;\r
- yychar = YYEMPTY; /* Cause a token to be read. */\r
-\r
- /* Initialize stack pointers.\r
- Waste one element of value and location stack\r
- so that they stay on the same level as the state stack.\r
- The wasted elements are never initialized. */\r
-\r
- yyssp = yyss - 1;\r
- yyvsp = yyvs;\r
-#ifdef YYLSP_NEEDED\r
- yylsp = yyls;\r
-#endif\r
-\r
-/* Push a new state, which is found in yystate . */\r
-/* In all cases, when you get here, the value and location stacks\r
- have just been pushed. so pushing a state here evens the stacks. */\r
-yynewstate:\r
-\r
- *++yyssp = yystate;\r
-\r
- if (yyssp >= yyss + yystacksize - 1)\r
- {\r
- /* Give user a chance to reallocate the stack */\r
- /* Use copies of these so that the &'s don't force the real ones into memory. */\r
- YYSTYPE *yyvs1 = yyvs;\r
- short *yyss1 = yyss;\r
-#ifdef YYLSP_NEEDED\r
- YYLTYPE *yyls1 = yyls;\r
-#endif\r
-\r
- /* Get the current used size of the three stacks, in elements. */\r
- int size = yyssp - yyss + 1;\r
-\r
-#ifdef yyoverflow\r
- /* Each stack pointer address is followed by the size of\r
- the data in use in that stack, in bytes. */\r
-#ifdef YYLSP_NEEDED\r
- /* This used to be a conditional around just the two extra args,\r
- but that might be undefined if yyoverflow is a macro. */\r
- yyoverflow("parser stack overflow",\r
- &yyss1, size * sizeof (*yyssp),\r
- &yyvs1, size * sizeof (*yyvsp),\r
- &yyls1, size * sizeof (*yylsp),\r
- &yystacksize);\r
-#else\r
- yyoverflow("parser stack overflow",\r
- &yyss1, size * sizeof (*yyssp),\r
- &yyvs1, size * sizeof (*yyvsp),\r
- &yystacksize);\r
-#endif\r
-\r
- yyss = yyss1; yyvs = yyvs1;\r
-#ifdef YYLSP_NEEDED\r
- yyls = yyls1;\r
-#endif\r
-#else /* no yyoverflow */\r
- /* Extend the stack our own way. */\r
- if (yystacksize >= YYMAXDEPTH)\r
- {\r
- yyerror("parser stack overflow");\r
- return 2;\r
- }\r
- yystacksize *= 2;\r
- if (yystacksize > YYMAXDEPTH)\r
- yystacksize = YYMAXDEPTH;\r
- yyss = (short *) alloca (yystacksize * sizeof (*yyssp));\r
- __yy_memcpy ((char *)yyss, (char *)yyss1, size * sizeof (*yyssp));\r
- yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));\r
- __yy_memcpy ((char *)yyvs, (char *)yyvs1, size * sizeof (*yyvsp));\r
-#ifdef YYLSP_NEEDED\r
- yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));\r
- __yy_memcpy ((char *)yyls, (char *)yyls1, size * sizeof (*yylsp));\r
-#endif\r
-#endif /* no yyoverflow */\r
-\r
- yyssp = yyss + size - 1;\r
- yyvsp = yyvs + size - 1;\r
-#ifdef YYLSP_NEEDED\r
- yylsp = yyls + size - 1;\r
-#endif\r
-\r
-#if YYDEBUG != 0\r
- if (yydebug)\r
- fprintf(stderr, "Stack size increased to %d\n", yystacksize);\r
-#endif\r
-\r
- if (yyssp >= yyss + yystacksize - 1)\r
- YYABORT;\r
- }\r
-\r
-#if YYDEBUG != 0\r
- if (yydebug)\r
- fprintf(stderr, "Entering state %d\n", yystate);\r
-#endif\r
-\r
- goto yybackup;\r
- yybackup:\r
-\r
-/* Do appropriate processing given the current state. */\r
-/* Read a lookahead token if we need one and don't already have one. */\r
-/* yyresume: */\r
-\r
- /* First try to decide what to do without reference to lookahead token. */\r
-\r
- yyn = yypact[yystate];\r
- if (yyn == YYFLAG)\r
- goto yydefault;\r
-\r
- /* Not known => get a lookahead token if don't already have one. */\r
-\r
- /* yychar is either YYEMPTY or YYEOF\r
- or a valid token in external form. */\r
-\r
- if (yychar == YYEMPTY)\r
- {\r
-#if YYDEBUG != 0\r
- if (yydebug)\r
- fprintf(stderr, "Reading a token: ");\r
-#endif\r
- yychar = YYLEX;\r
- }\r
-\r
- /* Convert token to internal form (in yychar1) for indexing tables with */\r
-\r
- if (yychar <= 0) /* This means end of input. */\r
- {\r
- yychar1 = 0;\r
- yychar = YYEOF; /* Don't call YYLEX any more */\r
-\r
-#if YYDEBUG != 0\r
- if (yydebug)\r
- fprintf(stderr, "Now at end of input.\n");\r
-#endif\r
- }\r
- else\r
- {\r
- yychar1 = YYTRANSLATE(yychar);\r
-\r
-#if YYDEBUG != 0\r
- if (yydebug)\r
- {\r
- fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);\r
- /* Give the individual parser a way to print the precise meaning\r
- of a token, for further debugging info. */\r
-#ifdef YYPRINT\r
- YYPRINT (stderr, yychar, yylval);\r
-#endif\r
- fprintf (stderr, ")\n");\r
- }\r
-#endif\r
- }\r
-\r
- yyn += yychar1;\r
- if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)\r
- goto yydefault;\r
-\r
- yyn = yytable[yyn];\r
-\r
- /* yyn is what to do for this token type in this state.\r
- Negative => reduce, -yyn is rule number.\r
- Positive => shift, yyn is new state.\r
- New state is final state => don't bother to shift,\r
- just return success.\r
- 0, or most negative number => error. */\r
-\r
- if (yyn < 0)\r
- {\r
- if (yyn == YYFLAG)\r
- goto yyerrlab;\r
- yyn = -yyn;\r
- goto yyreduce;\r
- }\r
- else if (yyn == 0)\r
- goto yyerrlab;\r
-\r
- if (yyn == YYFINAL)\r
- YYACCEPT;\r
-\r
- /* Shift the lookahead token. */\r
-\r
-#if YYDEBUG != 0\r
- if (yydebug)\r
- fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);\r
-#endif\r
-\r
- /* Discard the token being shifted unless it is eof. */\r
- if (yychar != YYEOF)\r
- yychar = YYEMPTY;\r
-\r
- *++yyvsp = yylval;\r
-#ifdef YYLSP_NEEDED\r
- *++yylsp = yylloc;\r
-#endif\r
-\r
- /* count tokens shifted since error; after three, turn off error status. */\r
- if (yyerrstatus) yyerrstatus--;\r
-\r
- yystate = yyn;\r
- goto yynewstate;\r
-\r
-/* Do the default action for the current state. */\r
-yydefault:\r
-\r
- yyn = yydefact[yystate];\r
- if (yyn == 0)\r
- goto yyerrlab;\r
-\r
-/* Do a reduction. yyn is the number of a rule to reduce with. */\r
-yyreduce:\r
- yylen = yyr2[yyn];\r
- if (yylen > 0)\r
- yyval = yyvsp[1-yylen]; /* implement default value of the action */\r
-\r
-#if YYDEBUG != 0\r
- if (yydebug)\r
- {\r
- int i;\r
-\r
- fprintf (stderr, "Reducing via rule %d (line %d), ",\r
- yyn, yyrline[yyn]);\r
-\r
- /* Print the symbols being reduced, and their result. */\r
- for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)\r
- fprintf (stderr, "%s ", yytname[yyrhs[i]]);\r
- fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);\r
- }\r
-#endif\r
-\r
-\r
- switch (yyn) {\r
-\r
-case 1:\r
-#line 68 "schema.y"\r
-{Schema = yyvsp[0].table_list_t;;\r
- break;}\r
-case 2:\r
-#line 70 "schema.y"\r
-{yyval.table_list_t = new table_list(yyvsp[0].table_def_t);;\r
- break;}\r
-case 3:\r
-#line 71 "schema.y"\r
-{yyval.table_list_t = yyvsp[-1].table_list_t->append_table(yyvsp[0].table_def_t);;\r
- break;}\r
-case 4:\r
-#line 74 "schema.y"\r
-{\r
- yyval.table_def_t=new table_def(yyvsp[-4].strval,yyvsp[-3].plist_t,yyvsp[-1].field_list_t, TABLE_SCHEMA); delete yyvsp[-1].field_list_t;;\r
- break;}\r
-case 5:\r
-#line 76 "schema.y"\r
-{\r
- yyval.table_def_t=new table_def(yyvsp[-4].strval,yyvsp[-3].plist_t,yyvsp[-1].field_list_t, STREAM_SCHEMA); delete yyvsp[-1].field_list_t;;\r
- break;}\r
-case 6:\r
-#line 80 "schema.y"\r
-{yyval.field_list_t = new field_entry_list(yyvsp[0].field_t);;\r
- break;}\r
-case 7:\r
-#line 81 "schema.y"\r
-{yyval.field_list_t = yyvsp[-1].field_list_t->append_field(yyvsp[0].field_t);;\r
- break;}\r
-case 8:\r
-#line 85 "schema.y"\r
-{yyval.field_t = new field_entry(yyvsp[-4].strval,yyvsp[-3].strval,yyvsp[-2].strval,yyvsp[-1].plist_t);;\r
- break;}\r
-case 9:\r
-#line 89 "schema.y"\r
-{yyval.plist_t = NULL;;\r
- break;}\r
-case 10:\r
-#line 90 "schema.y"\r
-{yyval.plist_t = yyvsp[-1].plist_t;;\r
- break;}\r
-case 11:\r
-#line 94 "schema.y"\r
-{yyval.plist_t = new param_list(yyvsp[0].strval);;\r
- break;}\r
-case 12:\r
-#line 95 "schema.y"\r
-{yyval.plist_t = yyvsp[-2].plist_t->append(yyvsp[0].strval);;\r
- break;}\r
-}\r
- /* the action file gets copied in in place of this dollarsign */\r
-#line 498 "bison.simple"\r
-\f\r
- yyvsp -= yylen;\r
- yyssp -= yylen;\r
-#ifdef YYLSP_NEEDED\r
- yylsp -= yylen;\r
-#endif\r
-\r
-#if YYDEBUG != 0\r
- if (yydebug)\r
- {\r
- short *ssp1 = yyss - 1;\r
- fprintf (stderr, "state stack now");\r
- while (ssp1 != yyssp)\r
- fprintf (stderr, " %d", *++ssp1);\r
- fprintf (stderr, "\n");\r
- }\r
-#endif\r
-\r
- *++yyvsp = yyval;\r
-\r
-#ifdef YYLSP_NEEDED\r
- yylsp++;\r
- if (yylen == 0)\r
- {\r
- yylsp->first_line = yylloc.first_line;\r
- yylsp->first_column = yylloc.first_column;\r
- yylsp->last_line = (yylsp-1)->last_line;\r
- yylsp->last_column = (yylsp-1)->last_column;\r
- yylsp->text = 0;\r
- }\r
- else\r
- {\r
- yylsp->last_line = (yylsp+yylen-1)->last_line;\r
- yylsp->last_column = (yylsp+yylen-1)->last_column;\r
- }\r
-#endif\r
-\r
- /* Now "shift" the result of the reduction.\r
- Determine what state that goes to,\r
- based on the state we popped back to\r
- and the rule number reduced by. */\r
-\r
- yyn = yyr1[yyn];\r
-\r
- yystate = yypgoto[yyn - YYNTBASE] + *yyssp;\r
- if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)\r
- yystate = yytable[yystate];\r
- else\r
- yystate = yydefgoto[yyn - YYNTBASE];\r
-\r
- goto yynewstate;\r
-\r
-yyerrlab: /* here on detecting error */\r
-\r
- if (! yyerrstatus)\r
- /* If not already recovering from an error, report this error. */\r
- {\r
- ++yynerrs;\r
-\r
-#ifdef YYERROR_VERBOSE\r
- yyn = yypact[yystate];\r
-\r
- if (yyn > YYFLAG && yyn < YYLAST)\r
- {\r
- int size = 0;\r
- char *msg;\r
- int x, count;\r
-\r
- count = 0;\r
- /* Start X at -yyn if nec to avoid negative indexes in yycheck. */\r
- for (x = (yyn < 0 ? -yyn : 0);\r
- x < (sizeof(yytname) / sizeof(char *)); x++)\r
- if (yycheck[x + yyn] == x)\r
- size += strlen(yytname[x]) + 15, count++;\r
- msg = (char *) malloc(size + 15);\r
- if (msg != 0)\r
- {\r
- strcpy(msg, "parse error");\r
-\r
- if (count < 5)\r
- {\r
- count = 0;\r
- for (x = (yyn < 0 ? -yyn : 0);\r
- x < (sizeof(yytname) / sizeof(char *)); x++)\r
- if (yycheck[x + yyn] == x)\r
- {\r
- strcat(msg, count == 0 ? ", expecting `" : " or `");\r
- strcat(msg, yytname[x]);\r
- strcat(msg, "'");\r
- count++;\r
- }\r
- }\r
- yyerror(msg);\r
- free(msg);\r
- }\r
- else\r
- yyerror ("parse error; also virtual memory exceeded");\r
- }\r
- else\r
-#endif /* YYERROR_VERBOSE */\r
- yyerror("parse error");\r
- }\r
-\r
- goto yyerrlab1;\r
-yyerrlab1: /* here on error raised explicitly by an action */\r
-\r
- if (yyerrstatus == 3)\r
- {\r
- /* if just tried and failed to reuse lookahead token after an error, discard it. */\r
-\r
- /* return failure if at end of input */\r
- if (yychar == YYEOF)\r
- YYABORT;\r
-\r
-#if YYDEBUG != 0\r
- if (yydebug)\r
- fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);\r
-#endif\r
-\r
- yychar = YYEMPTY;\r
- }\r
-\r
- /* Else will try to reuse lookahead token\r
- after shifting the error token. */\r
-\r
- yyerrstatus = 3; /* Each real token shifted decrements this */\r
-\r
- goto yyerrhandle;\r
-\r
-yyerrdefault: /* current state does not do anything special for the error token. */\r
-\r
-#if 0\r
- /* This is wrong; only states that explicitly want error tokens\r
- should shift them. */\r
- yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/\r
- if (yyn) goto yydefault;\r
-#endif\r
-\r
-yyerrpop: /* pop the current state because it cannot handle the error token */\r
-\r
- if (yyssp == yyss) YYABORT;\r
- yyvsp--;\r
- yystate = *--yyssp;\r
-#ifdef YYLSP_NEEDED\r
- yylsp--;\r
-#endif\r
-\r
-#if YYDEBUG != 0\r
- if (yydebug)\r
- {\r
- short *ssp1 = yyss - 1;\r
- fprintf (stderr, "Error: state stack now");\r
- while (ssp1 != yyssp)\r
- fprintf (stderr, " %d", *++ssp1);\r
- fprintf (stderr, "\n");\r
- }\r
-#endif\r
-\r
-yyerrhandle:\r
-\r
- yyn = yypact[yystate];\r
- if (yyn == YYFLAG)\r
- goto yyerrdefault;\r
-\r
- yyn += YYTERROR;\r
- if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)\r
- goto yyerrdefault;\r
-\r
- yyn = yytable[yyn];\r
- if (yyn < 0)\r
- {\r
- if (yyn == YYFLAG)\r
- goto yyerrpop;\r
- yyn = -yyn;\r
- goto yyreduce;\r
- }\r
- else if (yyn == 0)\r
- goto yyerrpop;\r
-\r
- if (yyn == YYFINAL)\r
- YYACCEPT;\r
-\r
-#if YYDEBUG != 0\r
- if (yydebug)\r
- fprintf(stderr, "Shifting error token, ");\r
-#endif\r
-\r
- *++yyvsp = yylval;\r
-#ifdef YYLSP_NEEDED\r
- *++yylsp = yylloc;\r
-#endif\r
-\r
- yystate = yyn;\r
- goto yynewstate;\r
-}\r
-#line 98 "schema.y"\r
-\r
-\r
+
+/* A Bison parser, made from schema.y
+ by GNU Bison version 1.25
+ */
+
+#define YYBISON 1 /* Identify Bison output. */
+
+#define yyparse SchemaParserparse
+#define yylex SchemaParserlex
+#define yyerror SchemaParsererror
+#define yylval SchemaParserlval
+#define yychar SchemaParserchar
+#define yydebug SchemaParserdebug
+#define yynerrs SchemaParsernerrs
+#define NAME 258
+#define SEMICOLON 259
+#define LEFTBRACE 260
+#define RIGHTBRACE 261
+#define TABLE 262
+#define STREAM 263
+
+#line 8 "schema.y"
+
+
+
+#include <stdio.h>
+
+/* Some addn'l includes, necessary but not included by the
+ bison generated code.
+*/
+
+#include <stdlib.h>
+
+/* prototypes for the parser callbacks.
+*/
+
+#include "parse_schema.h"
+
+/* Interface to schemalexer */
+ int yyparse();
+ void yyerror(char *s);
+ int yylex();
+extern int flex_schema_lineno, flex_schema_ch;
+
+/* Return value */
+extern table_list *Schema;
+
+#define YYDEBUG 1
+
+
+#line 40 "schema.y"
+typedef union {
+ char* strval;
+ field_entry *field_t;
+ field_entry_list *field_list_t;
+ table_def *table_def_t;
+ table_list *table_list_t;
+ param_list *plist_t;
+ } YYSTYPE;
+#include <stdio.h>
+
+#ifndef __cplusplus
+#ifndef __STDC__
+#define const
+#endif
+#endif
+
+
+
+#define YYFINAL 31
+#define YYFLAG -32768
+#define YYNTBASE 12
+
+#define YYTRANSLATE(x) ((unsigned)(x) <= 263 ? yytranslate[x] : 19)
+
+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, 9,
+ 10, 2, 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, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 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
+};
+
+#if YYDEBUG != 0
+static const short yyprhs[] = { 0,
+ 0, 2, 4, 7, 14, 21, 23, 26, 32, 33,
+ 37, 39
+};
+
+static const short yyrhs[] = { 13,
+ 0, 14, 0, 13, 14, 0, 7, 3, 17, 5,
+ 15, 6, 0, 8, 3, 17, 5, 15, 6, 0,
+ 16, 0, 15, 16, 0, 3, 3, 3, 17, 4,
+ 0, 0, 9, 18, 10, 0, 3, 0, 18, 11,
+ 3, 0
+};
+
+#endif
+
+#if YYDEBUG != 0
+static const short yyrline[] = { 0,
+ 68, 70, 71, 74, 76, 80, 81, 84, 88, 90,
+ 93, 95
+};
+#endif
+
+
+#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
+
+static const char * const yytname[] = { "$","error","$undefined.","NAME","SEMICOLON",
+"LEFTBRACE","RIGHTBRACE","TABLE","STREAM","'('","')'","','","result","table_list",
+"table_def","field_list","field","opt_param_commalist","param_commalist", NULL
+};
+#endif
+
+static const short yyr1[] = { 0,
+ 12, 13, 13, 14, 14, 15, 15, 16, 17, 17,
+ 18, 18
+};
+
+static const short yyr2[] = { 0,
+ 1, 1, 2, 6, 6, 1, 2, 5, 0, 3,
+ 1, 3
+};
+
+static const short yydefact[] = { 0,
+ 0, 0, 1, 2, 9, 9, 3, 0, 0, 0,
+ 11, 0, 0, 0, 10, 0, 0, 0, 6, 0,
+ 12, 0, 4, 7, 5, 9, 0, 8, 0, 0,
+ 0
+};
+
+static const short yydefgoto[] = { 29,
+ 3, 4, 18, 19, 9, 12
+};
+
+static const short yypact[] = { 2,
+ 0, 4, 2,-32768, 5, 5,-32768, 10, 11, 12,
+-32768, 1, 15, 15,-32768, 16, 18, -2,-32768, -1,
+-32768, 19,-32768,-32768,-32768, 5, 20,-32768, 23, 25,
+-32768
+};
+
+static const short yypgoto[] = {-32768,
+-32768, 24, 14, -12, -6,-32768
+};
+
+
+#define YYLAST 28
+
+
+static const short yytable[] = { 10,
+ 17, 17, 5, 23, 25, 24, 6, 24, 1, 2,
+ 15, 16, 11, 8, 0, 13, 14, 17, 21, 27,
+ 22, 26, 30, 28, 31, 0, 7, 20
+};
+
+static const short yycheck[] = { 6,
+ 3, 3, 3, 6, 6, 18, 3, 20, 7, 8,
+ 10, 11, 3, 9, -1, 5, 5, 3, 3, 26,
+ 3, 3, 0, 4, 0, -1, 3, 14
+};
+/* -*-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. */
+
+#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
+\f
+#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
+#define __yy_memcpy(TO,FROM,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 (to, from, count)
+ char *to;
+ char *from;
+ 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 *to, char *from, int count)
+{
+ register char *f = from;
+ register char *t = to;
+ register int i = count;
+
+ while (i-- > 0)
+ *t++ = *f++;
+}
+
+#endif
+#endif
+\f
+#line 196 "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
+#ifdef __cplusplus
+#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
+#define YYPARSE_PARAM_DECL
+#else /* not __cplusplus */
+#define YYPARSE_PARAM_ARG YYPARSE_PARAM
+#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
+#endif /* not __cplusplus */
+#else /* not YYPARSE_PARAM */
+#define YYPARSE_PARAM_ARG
+#define YYPARSE_PARAM_DECL
+#endif /* not YYPARSE_PARAM */
+
+int
+yyparse(YYPARSE_PARAM_ARG)
+ 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
+ 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_memcpy ((char *)yyss, (char *)yyss1, size * sizeof (*yyssp));
+ yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
+ __yy_memcpy ((char *)yyvs, (char *)yyvs1, size * sizeof (*yyvsp));
+#ifdef YYLSP_NEEDED
+ yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
+ __yy_memcpy ((char *)yyls, (char *)yyls1, 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 68 "schema.y"
+{Schema = yyvsp[0].table_list_t;;
+ break;}
+case 2:
+#line 70 "schema.y"
+{yyval.table_list_t = new table_list(yyvsp[0].table_def_t);;
+ break;}
+case 3:
+#line 71 "schema.y"
+{yyval.table_list_t = yyvsp[-1].table_list_t->append_table(yyvsp[0].table_def_t);;
+ break;}
+case 4:
+#line 74 "schema.y"
+{
+ yyval.table_def_t=new table_def(yyvsp[-4].strval,yyvsp[-3].plist_t,yyvsp[-1].field_list_t, TABLE_SCHEMA); delete yyvsp[-1].field_list_t;;
+ break;}
+case 5:
+#line 76 "schema.y"
+{
+ yyval.table_def_t=new table_def(yyvsp[-4].strval,yyvsp[-3].plist_t,yyvsp[-1].field_list_t, STREAM_SCHEMA); delete yyvsp[-1].field_list_t;;
+ break;}
+case 6:
+#line 80 "schema.y"
+{yyval.field_list_t = new field_entry_list(yyvsp[0].field_t);;
+ break;}
+case 7:
+#line 81 "schema.y"
+{yyval.field_list_t = yyvsp[-1].field_list_t->append_field(yyvsp[0].field_t);;
+ break;}
+case 8:
+#line 85 "schema.y"
+{yyval.field_t = new field_entry(yyvsp[-4].strval,yyvsp[-3].strval,yyvsp[-2].strval,yyvsp[-1].plist_t);;
+ break;}
+case 9:
+#line 89 "schema.y"
+{yyval.plist_t = NULL;;
+ break;}
+case 10:
+#line 90 "schema.y"
+{yyval.plist_t = yyvsp[-1].plist_t;;
+ break;}
+case 11:
+#line 94 "schema.y"
+{yyval.plist_t = new param_list(yyvsp[0].strval);;
+ break;}
+case 12:
+#line 95 "schema.y"
+{yyval.plist_t = yyvsp[-2].plist_t->append(yyvsp[0].strval);;
+ break;}
+}
+ /* the action file gets copied in in place of this dollarsign */
+#line 498 "bison.simple"
+\f
+ 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 98 "schema.y"
+
+
Code Review / com / gs-lite.git / blobdiff