Generated files.
git-svn-id: file:///srv/svn/repos/haiku/buildtools/trunk@24624 a95241bf-73f2-0310-859d-f6bbb57e9c96
Diff
jam/jambase.c | 2 +-
jam/jamgram.c | 2905 +++++++++++++++++++++++++++++++++++++++++++++++++++++---------------------------
jam/jamgram.h | 199 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++-
jam/jamgram.y | 26 +++++++++++++-------------
jam/jamgramtab.h | 26 +++++++++++++-------------
5 files changed, 2011 insertions(+), 1147 deletions(-)
@@ -211,7 +211,7 @@
"YACCFILES ?= y.tab ;\n",
"YACCFLAGS ?= -d ;\n",
"}\n",
"else if $(OS) = BEOS \n",
"else if $(OS) = BEOS || $(OS) = HAIKU\n",
"{\n",
"BINDIR ?= /boot/home/config/bin ;\n",
"CC ?= gcc ;\n",
@@ -1,58 +1,175 @@
/* A Bison parser, made from jamgram.y
by GNU Bison version 1.28 */
#define YYBISON 1 /* Identify Bison output. */
#define _BANG_t 257
#define _BANG_EQUALS_t 258
#define _AMPER_t 259
#define _AMPERAMPER_t 260
#define _LPAREN_t 261
#define _RPAREN_t 262
#define _PLUS_EQUALS_t 263
#define _COLON_t 264
#define _SEMIC_t 265
#define _LANGLE_t 266
#define _LANGLE_EQUALS_t 267
#define _EQUALS_t 268
#define _RANGLE_t 269
#define _RANGLE_EQUALS_t 270
#define _QUESTION_EQUALS_t 271
#define _LBRACKET_t 272
#define _RBRACKET_t 273
#define ACTIONS_t 274
#define BIND_t 275
#define BREAK_t 276
#define CASE_t 277
#define CONTINUE_t 278
#define DEFAULT_t 279
#define ELSE_t 280
#define EXISTING_t 281
#define FOR_t 282
#define IF_t 283
#define IGNORE_t 284
#define IN_t 285
#define INCLUDE_t 286
#define JUMPTOEOF_t 287
#define LOCAL_t 288
#define MAXLINE_t 289
#define ON_t 290
#define PIECEMEAL_t 291
#define QUIETLY_t 292
#define RETURN_t 293
#define RULE_t 294
#define SWITCH_t 295
#define TOGETHER_t 296
#define UPDATED_t 297
#define WHILE_t 298
#define _LBRACE_t 299
#define _BAR_t 300
#define _BARBAR_t 301
#define _RBRACE_t 302
#define ARG 303
#define STRING 304
/* Skeleton implementation for Bison's Yacc-like parsers in C
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
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., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA. */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
/* C LALR(1) parser skeleton written by Richard Stallman, by
simplifying the original so-called "semantic" parser. */
/* All symbols defined below should begin with yy or YY, to avoid
infringing on user name space. This should be done even for local
variables, as they might otherwise be expanded by user macros.
There are some unavoidable exceptions within include files to
define necessary library symbols; they are noted "INFRINGES ON
USER NAME SPACE" below. */
#define YYBISON 1
#define YYBISON_VERSION "2.3"
#define YYSKELETON_NAME "yacc.c"
#define YYPURE 0
#define YYLSP_NEEDED 0
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
/* Put the tokens into the symbol table, so that GDB and other debuggers
know about them. */
enum yytokentype {
_LANGLE_t = 258,
_LANGLE_EQUALS_t = 259,
_EQUALS_t = 260,
_RANGLE_t = 261,
_RANGLE_EQUALS_t = 262,
_BAR_t = 263,
_BARBAR_t = 264,
_SEMIC_t = 265,
_COLON_t = 266,
_BANG_t = 267,
_BANG_EQUALS_t = 268,
_QUESTION_EQUALS_t = 269,
_LPAREN_t = 270,
_RPAREN_t = 271,
_LBRACKET_t = 272,
_RBRACKET_t = 273,
_LBRACE_t = 274,
_RBRACE_t = 275,
_AMPER_t = 276,
_AMPERAMPER_t = 277,
_PLUS_EQUALS_t = 278,
ACTIONS_t = 279,
BIND_t = 280,
BREAK_t = 281,
CASE_t = 282,
CONTINUE_t = 283,
DEFAULT_t = 284,
ELSE_t = 285,
EXISTING_t = 286,
FOR_t = 287,
IF_t = 288,
IGNORE_t = 289,
IN_t = 290,
INCLUDE_t = 291,
JUMPTOEOF_t = 292,
LOCAL_t = 293,
MAXLINE_t = 294,
ON_t = 295,
PIECEMEAL_t = 296,
QUIETLY_t = 297,
RETURN_t = 298,
RULE_t = 299,
SWITCH_t = 300,
TOGETHER_t = 301,
UPDATED_t = 302,
WHILE_t = 303,
ARG = 304,
STRING = 305
};
#endif
#define _LANGLE_t 258
#define _LANGLE_EQUALS_t 259
#define _EQUALS_t 260
#define _RANGLE_t 261
#define _RANGLE_EQUALS_t 262
#define _BAR_t 263
#define _BARBAR_t 264
#define _SEMIC_t 265
#define _COLON_t 266
#define _BANG_t 267
#define _BANG_EQUALS_t 268
#define _QUESTION_EQUALS_t 269
#define _LPAREN_t 270
#define _RPAREN_t 271
#define _LBRACKET_t 272
#define _RBRACKET_t 273
#define _LBRACE_t 274
#define _RBRACE_t 275
#define _AMPER_t 276
#define _AMPERAMPER_t 277
#define _PLUS_EQUALS_t 278
#define ACTIONS_t 279
#define BIND_t 280
#define BREAK_t 281
#define CASE_t 282
#define CONTINUE_t 283
#define DEFAULT_t 284
#define ELSE_t 285
#define EXISTING_t 286
#define FOR_t 287
#define IF_t 288
#define IGNORE_t 289
#define IN_t 290
#define INCLUDE_t 291
#define JUMPTOEOF_t 292
#define LOCAL_t 293
#define MAXLINE_t 294
#define ON_t 295
#define PIECEMEAL_t 296
#define QUIETLY_t 297
#define RETURN_t 298
#define RULE_t 299
#define SWITCH_t 300
#define TOGETHER_t 301
#define UPDATED_t 302
#define WHILE_t 303
#define ARG 304
#define STRING 305
#line 85 "jamgram.y"
#include "jam.h"
@@ -93,556 +210,1198 @@
# define pnode( l,r ) parse_make( F0,l,r,P0,S0,S0,0 )
# define psnode( s,l ) parse_make( F0,l,P0,P0,s,S0,0 )
#ifndef YYSTYPE
#define YYSTYPE int
#endif
#include <stdio.h>
#ifndef __cplusplus
#ifndef __STDC__
#ifndef const
#define const
#endif
#endif
#endif
#define YYFINAL 157
#define YYFLAG -32768
#define YYNTBASE 51
#define YYTRANSLATE(x) ((unsigned)(x) <= 304 ? yytranslate[x] : 71)
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, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 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, 3, 4, 5, 6,
7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
17, 18, 19, 20, 21, 22, 23, 24, 25, 26,
27, 28, 29, 30, 31, 32, 33, 34, 35, 36,
37, 38, 39, 40, 41, 42, 43, 44, 45, 46,
47, 48, 49, 50
};
#if YYDEBUG != 0
static const short yyprhs[] = { 0,
0, 1, 3, 4, 6, 8, 11, 16, 23, 27,
31, 35, 39, 44, 51, 55, 59, 63, 71, 77,
83, 91, 97, 104, 108, 109, 110, 120, 122, 124,
126, 129, 131, 135, 139, 143, 147, 151, 155, 159,
163, 167, 171, 175, 178, 182, 183, 186, 191, 192,
196, 198, 200, 204, 206, 207, 210, 212, 213, 218,
221, 226, 231, 232, 235, 237, 239, 241, 243, 245,
247, 250, 251
};
static const short yyrhs[] = { -1,
53, 0, 0, 53, 0, 54, 0, 54, 53, 0,
34, 63, 11, 52, 0, 34, 63, 14, 63, 11,
52, 0, 45, 52, 48, 0, 32, 63, 11, 0,
33, 63, 11, 0, 65, 62, 11, 0, 65, 57,
63, 11, 0, 65, 36, 63, 57, 63, 11, 0,
22, 63, 11, 0, 24, 63, 11, 0, 39, 63,
11, 0, 28, 49, 31, 63, 45, 52, 48, 0,
41, 63, 45, 59, 48, 0, 29, 58, 45, 52,
48, 0, 29, 58, 45, 52, 48, 26, 54, 0,
44, 58, 45, 52, 48, 0, 40, 49, 61, 45,
52, 48, 0, 36, 65, 54, 0, 0, 0, 20,
68, 49, 70, 45, 55, 50, 56, 48, 0, 14,
0, 9, 0, 17, 0, 25, 14, 0, 65, 0,
58, 14, 58, 0, 58, 4, 58, 0, 58, 12,
58, 0, 58, 13, 58, 0, 58, 15, 58, 0,
58, 16, 58, 0, 58, 5, 58, 0, 58, 6,
58, 0, 58, 46, 58, 0, 58, 47, 58, 0,
65, 31, 63, 0, 3, 58, 0, 7, 58, 8,
0, 0, 60, 59, 0, 23, 49, 10, 52, 0,
0, 49, 10, 61, 0, 49, 0, 63, 0, 63,
10, 62, 0, 64, 0, 0, 64, 65, 0, 49,
0, 0, 18, 66, 67, 19, 0, 65, 62, 0,
36, 65, 65, 62, 0, 36, 65, 39, 63, 0,
0, 68, 69, 0, 43, 0, 42, 0, 30, 0,
38, 0, 37, 0, 27, 0, 35, 49, 0, 0,
21, 63, 0
};
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif
#if YYDEBUG != 0
static const short yyrline[] = { 0,
128, 130, 141, 143, 147, 149, 151, 153, 157, 159,
161, 163, 165, 167, 169, 171, 173, 175, 177, 179,
181, 183, 185, 187, 189, 192, 194, 201, 203, 205,
207, 215, 217, 219, 221, 223, 225, 227, 229, 231,
233, 235, 237, 239, 241, 251, 253, 257, 266, 268,
270, 279, 281, 291, 295, 297, 301, 303, 303, 312,
314, 316, 325, 327, 331, 333, 335, 337, 339, 341,
343, 352, 354
};
#ifndef YYTOKEN_TABLE
# define YYTOKEN_TABLE 0
#endif
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
typedef int YYSTYPE;
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
# define YYSTYPE_IS_DECLARED 1
# define YYSTYPE_IS_TRIVIAL 1
#endif
#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
static const char * const yytname[] = { "$","error","$undefined.","_BANG_t",
"_BANG_EQUALS_t","_AMPER_t","_AMPERAMPER_t","_LPAREN_t","_RPAREN_t","_PLUS_EQUALS_t",
"_COLON_t","_SEMIC_t","_LANGLE_t","_LANGLE_EQUALS_t","_EQUALS_t","_RANGLE_t",
"_RANGLE_EQUALS_t","_QUESTION_EQUALS_t","_LBRACKET_t","_RBRACKET_t","ACTIONS_t",
"BIND_t","BREAK_t","CASE_t","CONTINUE_t","DEFAULT_t","ELSE_t","EXISTING_t","FOR_t",
"IF_t","IGNORE_t","IN_t","INCLUDE_t","JUMPTOEOF_t","LOCAL_t","MAXLINE_t","ON_t",
"PIECEMEAL_t","QUIETLY_t","RETURN_t","RULE_t","SWITCH_t","TOGETHER_t","UPDATED_t",
"WHILE_t","_LBRACE_t","_BAR_t","_BARBAR_t","_RBRACE_t","ARG","STRING","run",
"block","rules","rule","@1","@2","assign","expr","cases","case","params","lol",
"list","listp","arg","@3","func","eflags","eflag","bindlist", NULL
};
#line 247 "y.tab.c"
#ifdef short
# undef short
#endif
#ifdef YYTYPE_UINT8
typedef YYTYPE_UINT8 yytype_uint8;
#else
typedef unsigned char yytype_uint8;
#endif
#ifdef YYTYPE_INT8
typedef YYTYPE_INT8 yytype_int8;
#elif (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
typedef signed char yytype_int8;
#else
typedef short int yytype_int8;
#endif
#ifdef YYTYPE_UINT16
typedef YYTYPE_UINT16 yytype_uint16;
#else
typedef unsigned short int yytype_uint16;
#endif
#ifdef YYTYPE_INT16
typedef YYTYPE_INT16 yytype_int16;
#else
typedef short int yytype_int16;
#endif
#ifndef YYSIZE_T
# ifdef __SIZE_TYPE__
# define YYSIZE_T __SIZE_TYPE__
# elif defined size_t
# define YYSIZE_T size_t
# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
# include <stddef.h>
# define YYSIZE_T size_t
# else
# define YYSIZE_T unsigned int
# endif
#endif
#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
#ifndef YY_
# if YYENABLE_NLS
# if ENABLE_NLS
# include <libintl.h>
# define YY_(msgid) dgettext ("bison-runtime", msgid)
# endif
# endif
# ifndef YY_
# define YY_(msgid) msgid
# endif
#endif
#if ! defined lint || defined __GNUC__
# define YYUSE(e) ((void) (e))
#else
# define YYUSE(e)
#endif
#ifndef lint
# define YYID(n) (n)
#else
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static int
YYID (int i)
#else
static int
YYID (i)
int i;
#endif
{
return i;
}
#endif
#if ! defined yyoverflow || YYERROR_VERBOSE
# ifdef YYSTACK_USE_ALLOCA
# if YYSTACK_USE_ALLOCA
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# elif defined __BUILTIN_VA_ARG_INCR
# include <alloca.h>
# elif defined _AIX
# define YYSTACK_ALLOC __alloca
# elif defined _MSC_VER
# include <malloc.h>
# define alloca _alloca
# else
# define YYSTACK_ALLOC alloca
# if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
# include <stdlib.h>
# ifndef _STDLIB_H
# define _STDLIB_H 1
# endif
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
# ifndef YYSTACK_ALLOC_MAXIMUM
/* The OS might guarantee only one guard page at the bottom of the stack,
and a page size can be as small as 4096 bytes. So we cannot safely
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
to allow for a few compiler-allocated temporary stack slots. */
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
# endif
# else
# define YYSTACK_ALLOC YYMALLOC
# define YYSTACK_FREE YYFREE
# ifndef YYSTACK_ALLOC_MAXIMUM
# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
# endif
# if (defined __cplusplus && ! defined _STDLIB_H \
&& ! ((defined YYMALLOC || defined malloc) \
&& (defined YYFREE || defined free)))
# include <stdlib.h>
# ifndef _STDLIB_H
# define _STDLIB_H 1
# endif
# endif
# ifndef YYMALLOC
# define YYMALLOC malloc
# if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
void *malloc (YYSIZE_T);
# endif
# endif
# ifndef YYFREE
# define YYFREE free
# if ! defined free && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
void free (void *);
# endif
# endif
# endif
#endif
#if (! defined yyoverflow \
&& (! defined __cplusplus \
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
union yyalloc
{
yytype_int16 yyss;
YYSTYPE yyvs;
};
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define YYSTACK_BYTES(N) \
((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \
+ YYSTACK_GAP_MAXIMUM)
/* Copy COUNT objects from FROM to TO. The source and destination do
not overlap. */
# ifndef YYCOPY
# if defined __GNUC__ && 1 < __GNUC__
# define YYCOPY(To, From, Count) \
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
# else
# define YYCOPY(To, From, Count) \
do \
{ \
YYSIZE_T yyi; \
for (yyi = 0; yyi < (Count); yyi++) \
(To)[yyi] = (From)[yyi]; \
} \
while (YYID (0))
# endif
# endif
/* Relocate STACK from its old location to the new one. The
local variables YYSIZE and YYSTACKSIZE give the old and new number of
elements in the stack, and YYPTR gives the new location of the
stack. Advance YYPTR to a properly aligned location for the next
stack. */
# define YYSTACK_RELOCATE(Stack) \
do \
{ \
YYSIZE_T yynewbytes; \
YYCOPY (&yyptr->Stack, Stack, yysize); \
Stack = &yyptr->Stack; \
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
yyptr += yynewbytes / sizeof (*yyptr); \
} \
while (YYID (0))
#endif
static const short yyr1[] = { 0,
51, 51, 52, 52, 53, 53, 53, 53, 54, 54,
54, 54, 54, 54, 54, 54, 54, 54, 54, 54,
54, 54, 54, 54, 55, 56, 54, 57, 57, 57,
57, 58, 58, 58, 58, 58, 58, 58, 58, 58,
58, 58, 58, 58, 58, 59, 59, 60, 61, 61,
61, 62, 62, 63, 64, 64, 65, 66, 65, 67,
67, 67, 68, 68, 69, 69, 69, 69, 69, 69,
69, 70, 70
#define YYFINAL 41
#define YYLAST 270
#define YYNTOKENS 51
#define YYNNTS 21
#define YYNRULES 74
#define YYNSTATES 157
#define YYUNDEFTOK 2
#define YYMAXUTOK 305
#define YYTRANSLATE(YYX) \
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
static const yytype_uint8 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,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 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, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 33, 34,
35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
45, 46, 47, 48, 49, 50
};
static const short yyr2[] = { 0,
0, 1, 0, 1, 1, 2, 4, 6, 3, 3,
3, 3, 4, 6, 3, 3, 3, 7, 5, 5,
7, 5, 6, 3, 0, 0, 9, 1, 1, 1,
2, 1, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 2, 3, 0, 2, 4, 0, 3,
1, 1, 3, 1, 0, 2, 1, 0, 4, 2,
4, 4, 0, 2, 1, 1, 1, 1, 1, 1,
2, 0, 2
#if YYDEBUG
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
YYRHS. */
static const yytype_uint8 yyprhs[] =
{
0, 0, 3, 4, 6, 7, 9, 11, 14, 19,
26, 30, 34, 38, 42, 47, 54, 58, 62, 66,
74, 80, 86, 94, 100, 107, 111, 112, 113, 123,
125, 127, 129, 132, 134, 138, 142, 146, 150, 154,
158, 162, 166, 170, 174, 178, 181, 185, 186, 189,
194, 195, 199, 201, 203, 207, 209, 210, 213, 215,
216, 221, 224, 229, 234, 235, 238, 240, 242, 244,
246, 248, 250, 253, 254
};
static const short yydefact[] = { 1,
58, 63, 55, 55, 0, 0, 55, 55, 55, 0,
55, 0, 55, 0, 3, 57, 2, 5, 55, 0,
0, 0, 54, 0, 0, 0, 0, 0, 32, 0,
0, 0, 0, 0, 49, 0, 0, 0, 4, 6,
29, 28, 30, 0, 55, 55, 0, 52, 0, 55,
0, 70, 67, 0, 69, 68, 66, 65, 72, 64,
15, 56, 16, 55, 44, 0, 0, 0, 0, 0,
0, 0, 0, 0, 3, 0, 0, 55, 10, 11,
3, 55, 24, 17, 51, 0, 46, 3, 9, 31,
0, 0, 12, 55, 0, 60, 59, 71, 55, 0,
0, 45, 34, 39, 40, 35, 36, 33, 37, 38,
0, 41, 42, 43, 7, 0, 49, 3, 0, 0,
46, 0, 55, 13, 53, 55, 55, 73, 25, 3,
20, 3, 50, 0, 0, 19, 47, 22, 0, 62,
61, 0, 0, 0, 8, 23, 3, 14, 26, 18,
21, 48, 0, 27, 0, 0, 0
static const yytype_int8 yyrhs[] =
{
52, 0, -1, -1, 54, -1, -1, 54, -1, 55,
-1, 55, 54, -1, 38, 64, 10, 53, -1, 38,
64, 5, 64, 10, 53, -1, 19, 53, 20, -1,
36, 64, 10, -1, 37, 64, 10, -1, 66, 63,
10, -1, 66, 58, 64, 10, -1, 66, 40, 64,
58, 64, 10, -1, 26, 64, 10, -1, 28, 64,
10, -1, 43, 64, 10, -1, 32, 49, 35, 64,
19, 53, 20, -1, 45, 64, 19, 60, 20, -1,
33, 59, 19, 53, 20, -1, 33, 59, 19, 53,
20, 30, 55, -1, 48, 59, 19, 53, 20, -1,
44, 49, 62, 19, 53, 20, -1, 40, 66, 55,
-1, -1, -1, 24, 69, 49, 71, 19, 56, 50,
57, 20, -1, 5, -1, 23, -1, 14, -1, 29,
5, -1, 66, -1, 59, 5, 59, -1, 59, 13,
59, -1, 59, 3, 59, -1, 59, 4, 59, -1,
59, 6, 59, -1, 59, 7, 59, -1, 59, 21,
59, -1, 59, 22, 59, -1, 59, 8, 59, -1,
59, 9, 59, -1, 66, 35, 64, -1, 12, 59,
-1, 15, 59, 16, -1, -1, 61, 60, -1, 27,
49, 11, 53, -1, -1, 49, 11, 62, -1, 49,
-1, 64, -1, 64, 11, 63, -1, 65, -1, -1,
65, 66, -1, 49, -1, -1, 17, 67, 68, 18,
-1, 66, 63, -1, 40, 66, 66, 63, -1, 40,
66, 43, 64, -1, -1, 69, 70, -1, 47, -1,
46, -1, 34, -1, 42, -1, 41, -1, 31, -1,
39, 49, -1, -1, 25, 64, -1
};
static const short yydefgoto[] = { 155,
38, 39, 18, 142, 153, 46, 28, 120, 121, 86,
47, 48, 23, 29, 20, 51, 21, 60, 100
static const yytype_uint16 yyrline[] =
{
0, 128, 128, 130, 142, 143, 147, 149, 151, 153,
157, 159, 161, 163, 165, 167, 169, 171, 173, 175,
177, 179, 181, 183, 185, 187, 190, 192, 189, 201,
203, 205, 207, 215, 217, 219, 221, 223, 225, 227,
229, 231, 233, 235, 237, 239, 241, 252, 253, 257,
267, 268, 270, 279, 281, 291, 296, 297, 301, 303,
303, 312, 314, 316, 326, 327, 331, 333, 335, 337,
339, 341, 343, 353, 354
};
#endif
static const short yypact[] = { 141,
-32768,-32768,-32768,-32768, -45, 14,-32768,-32768,-32768, 1,
-32768, -37,-32768, 14, 141,-32768,-32768, 141, 103, 6,
185, 2, 1, 3, -5, 14, 14, 25, -4, 36,
42, 37, 169, 43, -13, 15, 121, 11,-32768,-32768,
-32768,-32768,-32768, 47,-32768,-32768, 53, 56, 1,-32768,
48,-32768,-32768, 19,-32768,-32768,-32768,-32768, 52,-32768,
-32768,-32768,-32768,-32768,-32768, 137, 14, 14, 14, 14,
14, 14, 14, 14, 141, 14, 14,-32768,-32768,-32768,
141,-32768,-32768,-32768, 59, 29, 55, 141,-32768,-32768,
186, 78,-32768,-32768, 7,-32768,-32768,-32768,-32768, 45,
46,-32768, 71, 142, 142,-32768,-32768, 71,-32768,-32768,
34, 225, 225,-32768,-32768, 81, -13, 141, 44, 58,
55, 61,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 141,
70, 141,-32768, 62, 101,-32768,-32768,-32768, 102,-32768,
-32768, 65, 68, 169,-32768,-32768, 141,-32768,-32768,-32768,
-32768,-32768, 74,-32768, 119, 123,-32768
#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
"$end", "error", "$undefined", "_LANGLE_t", "_LANGLE_EQUALS_t",
"_EQUALS_t", "_RANGLE_t", "_RANGLE_EQUALS_t", "_BAR_t", "_BARBAR_t",
"_SEMIC_t", "_COLON_t", "_BANG_t", "_BANG_EQUALS_t",
"_QUESTION_EQUALS_t", "_LPAREN_t", "_RPAREN_t", "_LBRACKET_t",
"_RBRACKET_t", "_LBRACE_t", "_RBRACE_t", "_AMPER_t", "_AMPERAMPER_t",
"_PLUS_EQUALS_t", "ACTIONS_t", "BIND_t", "BREAK_t", "CASE_t",
"CONTINUE_t", "DEFAULT_t", "ELSE_t", "EXISTING_t", "FOR_t", "IF_t",
"IGNORE_t", "IN_t", "INCLUDE_t", "JUMPTOEOF_t", "LOCAL_t", "MAXLINE_t",
"ON_t", "PIECEMEAL_t", "QUIETLY_t", "RETURN_t", "RULE_t", "SWITCH_t",
"TOGETHER_t", "UPDATED_t", "WHILE_t", "ARG", "STRING", "$accept", "run",
"block", "rules", "rule", "@1", "@2", "assign", "expr", "cases", "case",
"params", "lol", "list", "listp", "arg", "@3", "func", "eflags", "eflag",
"bindlist", 0
};
#endif
static const short yypgoto[] = {-32768,
-53, 16, -30,-32768,-32768, 38, 31, 10,-32768, 21,
-42, -2,-32768, 0,-32768,-32768,-32768,-32768,-32768
# ifdef YYPRINT
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
token YYLEX-NUM. */
static const yytype_uint16 yytoknum[] =
{
0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
275, 276, 277, 278, 279, 280, 281, 282, 283, 284,
285, 286, 287, 288, 289, 290, 291, 292, 293, 294,
295, 296, 297, 298, 299, 300, 301, 302, 303, 304,
305
};
# endif
static const yytype_uint8 yyr1[] =
{
0, 51, 52, 52, 53, 53, 54, 54, 54, 54,
55, 55, 55, 55, 55, 55, 55, 55, 55, 55,
55, 55, 55, 55, 55, 55, 56, 57, 55, 58,
58, 58, 58, 59, 59, 59, 59, 59, 59, 59,
59, 59, 59, 59, 59, 59, 59, 60, 60, 61,
62, 62, 62, 63, 63, 64, 65, 65, 66, 67,
66, 68, 68, 68, 69, 69, 70, 70, 70, 70,
70, 70, 70, 71, 71
};
#define YYLAST 241
static const short yytable[] = { 19,
22, 24, 83, 25, 30, 31, 32, 96, 34, 33,
36, 35, 61, 63, 19, 17, 26, 19, 1, 50,
27, 111, 62, 1, 1, 64, 78, 115, 67, 68,
69, 1, 19, 40, 122, 85, 70, 71, 72, 73,
74, 49, 91, 92, 37, 126, 79, 81, 95, 16,
82, 125, 80, 84, 16, 16, 65, 66, 89, 87,
90, 101, 16, 93, 134, 94, 97, 98, 117, 75,
76, 77, 99, 118, 19, 114, 143, 119, 145, 116,
19, 131, 70, 71, 141, 73, 74, 19, 124, 129,
130, 132, 135, 152, 127, 144, 128, 103, 104, 105,
106, 107, 108, 109, 110, 136, 112, 113, 138, 146,
147, 41, 148, 151, 149, 150, 42, 19, 156, 43,
139, 154, 157, 140, 67, 68, 69, 44, 123, 19,
137, 19, 70, 71, 72, 73, 74, 133, 45, 0,
67, 68, 69, 19, 102, 67, 19, 0, 70, 71,
72, 73, 74, 70, 71, 72, 73, 74, 1, 0,
2, 0, 3, 0, 4, 88, 76, 77, 5, 6,
0, 0, 7, 8, 9, 0, 10, 0, 0, 11,
12, 13, 76, 77, 14, 15, 1, 0, 2, 16,
3, 0, 4, 0, 41, 0, 5, 6, 0, 42,
7, 8, 43, 0, 10, 0, 0, 11, 12, 13,
44, 52, 14, 15, 53, 0, 0, 16, 0, 54,
0, 55, 56, 0, 0, 0, 57, 58, 67, 68,
69, 0, 0, 59, 0, 0, 70, 71, 72, 73,
74
static const yytype_uint8 yyr2[] =
{
0, 2, 0, 1, 0, 1, 1, 2, 4, 6,
3, 3, 3, 3, 4, 6, 3, 3, 3, 7,
5, 5, 7, 5, 6, 3, 0, 0, 9, 1,
1, 1, 2, 1, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 2, 3, 0, 2, 4,
0, 3, 1, 1, 3, 1, 0, 2, 1, 0,
4, 2, 4, 4, 0, 2, 1, 1, 1, 1,
1, 1, 2, 0, 2
};
static const short yycheck[] = { 0,
3, 4, 33, 49, 7, 8, 9, 50, 11, 10,
13, 49, 11, 11, 15, 0, 3, 18, 18, 20,
7, 75, 23, 18, 18, 31, 31, 81, 4, 5,
6, 18, 33, 18, 88, 49, 12, 13, 14, 15,
16, 36, 45, 46, 14, 39, 11, 11, 49, 49,
14, 94, 11, 11, 49, 49, 26, 27, 48, 45,
14, 64, 49, 11, 118, 10, 19, 49, 10, 45,
46, 47, 21, 45, 75, 78, 130, 23, 132, 82,
81, 48, 12, 13, 127, 15, 16, 88, 11, 45,
45, 11, 49, 147, 95, 26, 99, 67, 68, 69,
70, 71, 72, 73, 74, 48, 76, 77, 48, 48,
10, 9, 11, 144, 50, 48, 14, 118, 0, 17,
123, 48, 0, 126, 4, 5, 6, 25, 91, 130,
121, 132, 12, 13, 14, 15, 16, 117, 36, -1,
4, 5, 6, 144, 8, 4, 147, -1, 12, 13,
14, 15, 16, 12, 13, 14, 15, 16, 18, -1,
20, -1, 22, -1, 24, 45, 46, 47, 28, 29,
-1, -1, 32, 33, 34, -1, 36, -1, -1, 39,
40, 41, 46, 47, 44, 45, 18, -1, 20, 49,
22, -1, 24, -1, 9, -1, 28, 29, -1, 14,
32, 33, 17, -1, 36, -1, -1, 39, 40, 41,
25, 27, 44, 45, 30, -1, -1, 49, -1, 35,
-1, 37, 38, -1, -1, -1, 42, 43, 4, 5,
6, -1, -1, 49, -1, -1, 12, 13, 14, 15,
16
/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
STATE-NUM when YYTABLE doesn't specify something else to do. Zero
means the default is an error. */
static const yytype_uint8 yydefact[] =
{
2, 59, 4, 64, 56, 56, 0, 0, 56, 56,
56, 0, 56, 0, 56, 0, 58, 0, 3, 6,
56, 0, 0, 5, 0, 0, 55, 0, 0, 0,
0, 0, 33, 0, 0, 0, 0, 0, 50, 0,
0, 1, 7, 29, 31, 30, 0, 56, 56, 0,
53, 0, 56, 0, 10, 71, 68, 0, 70, 69,
67, 66, 73, 65, 16, 57, 17, 56, 45, 0,
0, 0, 0, 0, 0, 0, 0, 0, 4, 0,
0, 56, 11, 12, 56, 4, 25, 18, 52, 0,
47, 4, 32, 0, 0, 13, 56, 0, 61, 60,
72, 56, 0, 0, 46, 36, 37, 34, 38, 39,
42, 43, 35, 0, 40, 41, 44, 0, 8, 50,
4, 0, 0, 47, 0, 56, 14, 54, 56, 56,
74, 26, 4, 21, 4, 51, 0, 0, 20, 48,
23, 0, 63, 62, 0, 0, 0, 9, 24, 4,
15, 27, 19, 22, 49, 0, 28
};
#line 3 "/bison.simple"
/* Skeleton output parser for bison,
Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
static const yytype_int16 yydefgoto[] =
{
-1, 17, 22, 23, 19, 144, 155, 48, 31, 122,
123, 89, 49, 50, 26, 32, 21, 53, 24, 63,
102
};
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.
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
#define YYPACT_NINF -54
static const yytype_int16 yypact[] =
{
124, -54, 124, -54, -54, -54, -43, -8, -54, -54,
-54, -7, -54, -26, -54, -8, -54, 14, -54, 124,
10, -12, 9, -54, 221, 20, -7, 21, 13, -8,
-8, 109, 17, 35, 61, 44, 157, 63, 23, 55,
204, -54, -54, -54, -54, -54, 71, -54, -54, 67,
72, -7, -54, 64, -54, -54, -54, 37, -54, -54,
-54, -54, 59, -54, -54, -54, -54, -54, -54, 224,
-8, -8, -8, -8, -8, -8, -8, -8, 124, -8,
-8, -54, -54, -54, -54, 124, -54, -54, 76, 69,
66, 124, -54, 30, 80, -54, -54, -9, -54, -54,
-54, -54, 75, 87, -54, -54, -54, 62, -54, -54,
244, 244, 62, 90, 57, 57, -54, 85, -54, 23,
124, 70, 101, 66, 103, -54, -54, -54, -54, -54,
-54, -54, 124, 94, 124, -54, 105, 115, -54, -54,
-54, 117, -54, -54, 79, 118, 157, -54, -54, 124,
-54, -54, -54, -54, -54, 119, -54
};
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.
static const yytype_int8 yypgoto[] =
{
-54, -54, -53, 27, -35, -54, -54, 42, 28, 19,
-54, 18, -49, 8, -54, 0, -54, -54, -54, -54,
-54
};
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */
/* As a special exception, when this file is copied by Bison into a
Bison output file, you may use that output file without restriction.
This special exception was added by the Free Software Foundation
in version 1.24 of Bison. */
/* This is the parser code that is written into each bison parser
when the %semantic_parser declaration is not specified in the grammar.
It was written by Richard Stallman by simplifying the hairy parser
used when %semantic_parser is specified. */
#ifndef YYSTACK_USE_ALLOCA
#ifdef alloca
#define YYSTACK_USE_ALLOCA
#else
#ifdef __GNUC__
#define YYSTACK_USE_ALLOCA
#define alloca __builtin_alloca
#else
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386)) || (defined (__BEOS__) && defined (__MWERKS__))
#define YYSTACK_USE_ALLOCA
#include <alloca.h>
#else
/* This used to test MSDOS, but that is a bad idea
since that symbol is in the user namespace. */
#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
#if 0 /* No need for malloc.h, which pollutes the namespace;
instead, just don't use alloca. */
#include <malloc.h>
#endif
#else
#if defined(_AIX)
/* I don't know what this was needed for, but it pollutes the namespace.
So I turned it off. rms, 2 May 1997. */
#pragma alloca
#define YYSTACK_USE_ALLOCA
#else
#if 0
#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up,
and on HPUX 10. Eventually we can turn this on. */
#define YYSTACK_USE_ALLOCA
#define alloca __builtin_alloca
#endif
#endif
#endif
#endif
#endif
#endif
#endif
#endif
#ifdef YYSTACK_USE_ALLOCA
#define YYSTACK_ALLOC alloca
#else
#define YYSTACK_ALLOC malloc
#endif
/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
positive, shift that token. If negative, reduce the rule which
number is the opposite. If zero, do what YYDEFACT says.
If YYTABLE_NINF, syntax error. */
#define YYTABLE_NINF -1
static const yytype_uint8 yytable[] =
{
20, 86, 20, 98, 29, 1, 28, 30, 1, 1,
1, 36, 25, 27, 41, 43, 33, 34, 35, 20,
37, 52, 39, 38, 44, 113, 65, 18, 51, 54,
64, 66, 118, 45, 128, 43, 20, 16, 124, 46,
16, 16, 16, 40, 44, 82, 42, 127, 67, 84,
47, 97, 81, 45, 85, 93, 94, 68, 69, 46,
70, 71, 72, 73, 74, 70, 71, 136, 73, 74,
77, 83, 88, 87, 90, 103, 92, 95, 20, 145,
143, 147, 99, 96, 101, 20, 100, 119, 120, 116,
126, 20, 117, 121, 131, 134, 154, 129, 105, 106,
107, 108, 109, 110, 111, 112, 132, 114, 115, 130,
133, 153, 70, 71, 72, 73, 74, 75, 76, 137,
20, 138, 77, 140, 146, 148, 149, 150, 78, 151,
79, 80, 20, 141, 20, 125, 142, 135, 152, 156,
0, 1, 139, 2, 0, 0, 20, 0, 3, 20,
4, 0, 5, 0, 0, 0, 6, 7, 0, 0,
8, 9, 10, 0, 11, 0, 0, 12, 13, 14,
0, 0, 15, 16, 1, 0, 2, 0, 0, 0,
0, 3, 0, 4, 0, 5, 0, 0, 0, 6,
7, 0, 0, 8, 9, 0, 0, 11, 0, 0,
12, 13, 14, 0, 0, 15, 16, 70, 71, 72,
73, 74, 75, 76, 0, 0, 0, 77, 0, 0,
0, 0, 0, 91, 0, 79, 80, 70, 71, 72,
73, 74, 75, 76, 0, 0, 0, 77, 0, 0,
104, 0, 0, 0, 0, 79, 80, 70, 71, 72,
73, 74, 55, 0, 0, 56, 0, 77, 0, 0,
57, 0, 58, 59, 0, 79, 80, 60, 61, 0,
62
};
/* 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. */
static const yytype_int16 yycheck[] =
{
0, 36, 2, 52, 12, 17, 49, 15, 17, 17,
17, 11, 4, 5, 0, 5, 8, 9, 10, 19,
12, 21, 14, 49, 14, 78, 26, 0, 40, 20,
10, 10, 85, 23, 43, 5, 36, 49, 91, 29,
49, 49, 49, 15, 14, 10, 19, 96, 35, 5,
40, 51, 35, 23, 10, 47, 48, 29, 30, 29,
3, 4, 5, 6, 7, 3, 4, 120, 6, 7,
13, 10, 49, 10, 19, 67, 5, 10, 78, 132,
129, 134, 18, 11, 25, 85, 49, 11, 19, 81,
10, 91, 84, 27, 19, 10, 149, 97, 70, 71,
72, 73, 74, 75, 76, 77, 19, 79, 80, 101,
20, 146, 3, 4, 5, 6, 7, 8, 9, 49,
120, 20, 13, 20, 30, 20, 11, 10, 19, 50,
21, 22, 132, 125, 134, 93, 128, 119, 20, 20,
-1, 17, 123, 19, -1, -1, 146, -1, 24, 149,
26, -1, 28, -1, -1, -1, 32, 33, -1, -1,
36, 37, 38, -1, 40, -1, -1, 43, 44, 45,
-1, -1, 48, 49, 17, -1, 19, -1, -1, -1,
-1, 24, -1, 26, -1, 28, -1, -1, -1, 32,
33, -1, -1, 36, 37, -1, -1, 40, -1, -1,
43, 44, 45, -1, -1, 48, 49, 3, 4, 5,
6, 7, 8, 9, -1, -1, -1, 13, -1, -1,
-1, -1, -1, 19, -1, 21, 22, 3, 4, 5,
6, 7, 8, 9, -1, -1, -1, 13, -1, -1,
16, -1, -1, -1, -1, 21, 22, 3, 4, 5,
6, 7, 31, -1, -1, 34, -1, 13, -1, -1,
39, -1, 41, 42, -1, 21, 22, 46, 47, -1,
49
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 17, 19, 24, 26, 28, 32, 33, 36, 37,
38, 40, 43, 44, 45, 48, 49, 52, 54, 55,
66, 67, 53, 54, 69, 64, 65, 64, 49, 12,
15, 59, 66, 64, 64, 64, 66, 64, 49, 64,
59, 0, 54, 5, 14, 23, 29, 40, 58, 63,
64, 40, 66, 68, 20, 31, 34, 39, 41, 42,
46, 47, 49, 70, 10, 66, 10, 35, 59, 59,
3, 4, 5, 6, 7, 8, 9, 13, 19, 21,
22, 35, 10, 10, 5, 10, 55, 10, 49, 62,
19, 19, 5, 64, 64, 10, 11, 66, 63, 18,
49, 25, 71, 64, 16, 59, 59, 59, 59, 59,
59, 59, 59, 53, 59, 59, 64, 64, 53, 11,
19, 27, 60, 61, 53, 58, 10, 63, 43, 66,
64, 19, 19, 20, 10, 62, 53, 49, 20, 60,
20, 64, 64, 63, 56, 53, 30, 53, 20, 11,
10, 50, 20, 55, 53, 57, 20
};
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY -2
#define YYEMPTY (-2)
#define YYEOF 0
#define YYACCEPT goto yyacceptlab
#define YYABORT goto yyabortlab
#define YYERROR goto yyerrlab1
/* Like YYERROR except do call yyerror.
This remains here temporarily to ease the
transition to the new meaning of YYERROR, for GCC.
#define YYABORT goto yyabortlab
#define YYERROR goto yyerrorlab
/* Like YYERROR except do call yyerror. This remains here temporarily
to ease the transition to the new meaning of YYERROR, for GCC.
Once GCC version 2 has supplanted version 1, this can go. */
#define YYFAIL goto yyerrlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(token, value) \
#define YYBACKUP(Token, Value) \
do \
if (yychar == YYEMPTY && yylen == 1) \
{ yychar = (token), yylval = (value); \
yychar1 = YYTRANSLATE (yychar); \
YYPOPSTACK; \
{ \
yychar = (Token); \
yylval = (Value); \
yytoken = YYTRANSLATE (yychar); \
YYPOPSTACK (1); \
goto yybackup; \
} \
else \
{ yyerror ("syntax error: cannot back up"); YYERROR; } \
while (0)
{ \
yyerror (YY_("syntax error: cannot back up")); \
YYERROR; \
} \
while (YYID (0))
#define YYTERROR 1
#define YYERRCODE 256
#ifndef YYPURE
#define YYLEX yylex()
/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
If N is 0, then set CURRENT to the empty location which ends
the previous symbol: RHS[0] (always defined). */
#define YYRHSLOC(Rhs, K) ((Rhs)[K])
#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N) \
do \
if (YYID (N)) \
{ \
(Current).first_line = YYRHSLOC (Rhs, 1).first_line; \
(Current).first_column = YYRHSLOC (Rhs, 1).first_column; \
(Current).last_line = YYRHSLOC (Rhs, N).last_line; \
(Current).last_column = YYRHSLOC (Rhs, N).last_column; \
} \
else \
{ \
(Current).first_line = (Current).last_line = \
YYRHSLOC (Rhs, 0).last_line; \
(Current).first_column = (Current).last_column = \
YYRHSLOC (Rhs, 0).last_column; \
} \
while (YYID (0))
#endif
#ifdef YYPURE
#ifdef YYLSP_NEEDED
#ifdef YYLEX_PARAM
#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM)
#else
#define YYLEX yylex(&yylval, &yylloc)
/* YY_LOCATION_PRINT -- Print the location on the stream.
This macro was not mandated originally: define only if we know
we won't break user code: when these are the locations we know. */
#ifndef YY_LOCATION_PRINT
# if YYLTYPE_IS_TRIVIAL
# define YY_LOCATION_PRINT(File, Loc) \
fprintf (File, "%d.%d-%d.%d", \
(Loc).first_line, (Loc).first_column, \
(Loc).last_line, (Loc).last_column)
# else
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
# endif
#endif
#else
#ifdef YYLEX_PARAM
#define YYLEX yylex(&yylval, YYLEX_PARAM)
# define YYLEX yylex (YYLEX_PARAM)
#else
#define YYLEX yylex(&yylval)
# define YYLEX yylex ()
#endif
#endif
#endif
#if YYDEBUG
# ifndef YYFPRINTF
# include <stdio.h>
# define YYFPRINTF fprintf
# endif
# define YYDPRINTF(Args) \
do { \
if (yydebug) \
YYFPRINTF Args; \
} while (YYID (0))
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, \
Type, Value); \
YYFPRINTF (stderr, "\n"); \
} \
} while (YYID (0))
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
#else
static void
yy_symbol_value_print (yyoutput, yytype, yyvaluep)
FILE *yyoutput;
int yytype;
YYSTYPE const * const yyvaluep;
#endif
{
if (!yyvaluep)
return;
# ifdef YYPRINT
if (yytype < YYNTOKENS)
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# else
YYUSE (yyoutput);
# endif
switch (yytype)
{
default:
break;
}
}
#ifndef YYPURE
int yychar;
YYSTYPE yylval;
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
#ifdef YYLSP_NEEDED
YYLTYPE yylloc;
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
#else
static void
yy_symbol_print (yyoutput, yytype, yyvaluep)
FILE *yyoutput;
int yytype;
YYSTYPE const * const yyvaluep;
#endif
{
if (yytype < YYNTOKENS)
YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
else
YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
int yynerrs;
#endif
yy_symbol_value_print (yyoutput, yytype, yyvaluep);
YYFPRINTF (yyoutput, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
#if YYDEBUG != 0
int yydebug;
/* Since this is uninitialized, it does not stop multiple parsers
from coexisting. */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_stack_print (yytype_int16 *bottom, yytype_int16 *top)
#else
static void
yy_stack_print (bottom, top)
yytype_int16 *bottom;
yytype_int16 *top;
#endif
{
YYFPRINTF (stderr, "Stack now");
for (; bottom <= top; ++bottom)
YYFPRINTF (stderr, " %d", *bottom);
YYFPRINTF (stderr, "\n");
}
# define YY_STACK_PRINT(Bottom, Top) \
do { \
if (yydebug) \
yy_stack_print ((Bottom), (Top)); \
} while (YYID (0))
/*------------------------------------------------.
| Report that the YYRULE is going to be reduced. |
`------------------------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_reduce_print (YYSTYPE *yyvsp, int yyrule)
#else
static void
yy_reduce_print (yyvsp, yyrule)
YYSTYPE *yyvsp;
int yyrule;
#endif
{
int yynrhs = yyr2[yyrule];
int yyi;
unsigned long int yylno = yyrline[yyrule];
YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
yyrule - 1, yylno);
for (yyi = 0; yyi < yynrhs; yyi++)
{
fprintf (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
&(yyvsp[(yyi + 1) - (yynrhs)])
);
fprintf (stderr, "\n");
}
}
# define YY_REDUCE_PRINT(Rule) \
do { \
if (yydebug) \
yy_reduce_print (yyvsp, Rule); \
} while (YYID (0))
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else
# define YYDPRINTF(Args)
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif
#ifndef YYINITDEPTH
#define YYINITDEPTH 200
# 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). */
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
if the built-in stack extension method is used).
#if YYMAXDEPTH == 0
#undef YYMAXDEPTH
#endif
Do not make this value too large; the results are undefined if
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#ifndef YYMAXDEPTH
#define YYMAXDEPTH 10000
# define YYMAXDEPTH 10000
#endif
/* Define __yy_memcpy. Note that the size argument
should be passed with type unsigned int, because that is what the non-GCC
definitions require. With GCC, __builtin_memcpy takes an arg
of type size_t, but it can handle unsigned int. */
#if __GNUC__ > 1
#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT)
#else
#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;
unsigned int count;
#if YYERROR_VERBOSE
# ifndef yystrlen
# if defined __GLIBC__ && defined _STRING_H
# define yystrlen strlen
# else
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static YYSIZE_T
yystrlen (const char *yystr)
#else
static YYSIZE_T
yystrlen (yystr)
const char *yystr;
#endif
{
register char *f = from;
register char *t = to;
register int i = count;
while (i-- > 0)
*t++ = *f++;
YYSIZE_T yylen;
for (yylen = 0; yystr[yylen]; yylen++)
continue;
return yylen;
}
# endif
# endif
# ifndef yystpcpy
# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
# define yystpcpy stpcpy
# else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
YYDEST. */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static char *
yystpcpy (char *yydest, const char *yysrc)
#else
static char *
yystpcpy (yydest, yysrc)
char *yydest;
const char *yysrc;
#endif
{
char *yyd = yydest;
const char *yys = yysrc;
#else
while ((*yyd++ = *yys++) != '\0')
continue;
/* 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, unsigned int count)
return yyd - 1;
}
# endif
# endif
# ifndef yytnamerr
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
quotes and backslashes, so that it's suitable for yyerror. The
heuristic is that double-quoting is unnecessary unless the string
contains an apostrophe, a comma, or backslash (other than
backslash-backslash). YYSTR is taken from yytname. If YYRES is
null, do not copy; instead, return the length of what the result
would have been. */
static YYSIZE_T
yytnamerr (char *yyres, const char *yystr)
{
register char *t = to;
register char *f = from;
register int i = count;
while (i-- > 0)
*t++ = *f++;
if (*yystr == '"')
{
YYSIZE_T yyn = 0;
char const *yyp = yystr;
for (;;)
switch (*++yyp)
{
case '\'':
case ',':
goto do_not_strip_quotes;
case '\\':
if (*++yyp != '\\')
goto do_not_strip_quotes;
default:
if (yyres)
yyres[yyn] = *yyp;
yyn++;
break;
case '"':
if (yyres)
yyres[yyn] = '\0';
return yyn;
}
do_not_strip_quotes: ;
}
if (! yyres)
return yystrlen (yystr);
return yystpcpy (yyres, yystr) - yyres;
}
# endif
/* Copy into YYRESULT an error message about the unexpected token
YYCHAR while in state YYSTATE. Return the number of bytes copied,
including the terminating null byte. If YYRESULT is null, do not
copy anything; just return the number of bytes that would be
copied. As a special case, return 0 if an ordinary "syntax error"
message will do. Return YYSIZE_MAXIMUM if overflow occurs during
size calculation. */
static YYSIZE_T
yysyntax_error (char *yyresult, int yystate, int yychar)
{
int yyn = yypact[yystate];
#endif
if (! (YYPACT_NINF < yyn && yyn <= YYLAST))
return 0;
else
{
int yytype = YYTRANSLATE (yychar);
YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]);
YYSIZE_T yysize = yysize0;
YYSIZE_T yysize1;
int yysize_overflow = 0;
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
int yyx;
# if 0
/* This is so xgettext sees the translatable formats that are
constructed on the fly. */
YY_("syntax error, unexpected %s");
YY_("syntax error, unexpected %s, expecting %s");
YY_("syntax error, unexpected %s, expecting %s or %s");
YY_("syntax error, unexpected %s, expecting %s or %s or %s");
YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s");
# endif
char *yyfmt;
char const *yyf;
static char const yyunexpected[] = "syntax error, unexpected %s";
static char const yyexpecting[] = ", expecting %s";
static char const yyor[] = " or %s";
char yyformat[sizeof yyunexpected
+ sizeof yyexpecting - 1
+ ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2)
* (sizeof yyor - 1))];
char const *yyprefix = yyexpecting;
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. */
int yyxbegin = yyn < 0 ? -yyn : 0;
int yychecklim = YYLAST - yyn + 1;
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
int yycount = 1;
yyarg[0] = yytname[yytype];
yyfmt = yystpcpy (yyformat, yyunexpected);
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
{
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
{
yycount = 1;
yysize = yysize0;
yyformat[sizeof yyunexpected - 1] = '\0';
break;
}
yyarg[yycount++] = yytname[yyx];
yysize1 = yysize + yytnamerr (0, yytname[yyx]);
yysize_overflow |= (yysize1 < yysize);
yysize = yysize1;
yyfmt = yystpcpy (yyfmt, yyprefix);
yyprefix = yyor;
}
yyf = YY_(yyformat);
yysize1 = yysize + yystrlen (yyf);
yysize_overflow |= (yysize1 < yysize);
yysize = yysize1;
if (yysize_overflow)
return YYSIZE_MAXIMUM;
if (yyresult)
{
/* Avoid sprintf, as that infringes on the user's name space.
Don't have undefined behavior even if the translation
produced a string with the wrong number of "%s"s. */
char *yyp = yyresult;
int yyi = 0;
while ((*yyp = *yyf) != '\0')
{
if (*yyp == '%' && yyf[1] == 's' && yyi < yycount)
{
yyp += yytnamerr (yyp, yyarg[yyi++]);
yyf += 2;
}
else
{
yyp++;
yyf++;
}
}
}
return yysize;
}
}
#endif
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
#else
static void
yydestruct (yymsg, yytype, yyvaluep)
const char *yymsg;
int yytype;
YYSTYPE *yyvaluep;
#endif
{
YYUSE (yyvaluep);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
switch (yytype)
{
default:
break;
}
}
#line 217 "/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
#define YYPARSE_PARAM_ARG YYPARSE_PARAM
#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
#endif
#else
#define YYPARSE_PARAM_ARG
#define YYPARSE_PARAM_DECL
#endif
#ifdef __GNUC__
#ifdef YYPARSE_PARAM
int yyparse (void *);
#if defined __STDC__ || defined __cplusplus
int yyparse (void *YYPARSE_PARAM);
#else
int yyparse (void);
int yyparse ();
#endif
#else
#if defined __STDC__ || defined __cplusplus
int yyparse (void);
#else
int yyparse ();
#endif
#endif
int yychar;
YYSTYPE yylval;
int yynerrs;
/*----------.
| yyparse. |
`----------*/
#ifdef YYPARSE_PARAM
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
int
yyparse(YYPARSE_PARAM_ARG)
YYPARSE_PARAM_DECL
{
register int yystate;
register int yyn;
register short *yyssp;
register YYSTYPE *yyvsp;
int yyerrstatus;
int yychar1 = 0;
short yyssa[YYINITDEPTH];
YYSTYPE yyvsa[YYINITDEPTH];
short *yyss = yyssa;
YYSTYPE *yyvs = yyvsa;
#ifdef YYLSP_NEEDED
YYLTYPE yylsa[YYINITDEPTH];
YYLTYPE *yyls = yylsa;
YYLTYPE *yylsp;
#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
yyparse (void *YYPARSE_PARAM)
#else
#define YYPOPSTACK (yyvsp--, yyssp--)
int
yyparse (YYPARSE_PARAM)
void *YYPARSE_PARAM;
#endif
int yystacksize = YYINITDEPTH;
int yyfree_stacks = 0;
#else
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
int
yyparse (void)
#else
int
yyparse ()
#ifdef YYPURE
int yychar;
YYSTYPE yylval;
int yynerrs;
#ifdef YYLSP_NEEDED
YYLTYPE yylloc;
#endif
#endif
{
int yystate;
int yyn;
int yyresult;
int yyerrstatus;
int yytoken = 0;
#if YYERROR_VERBOSE
char yymsgbuf[128];
char *yymsg = yymsgbuf;
YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
#endif
YYSTYPE yyval;
/* Three stacks and their tools:
`yyss': related to states,
`yyvs': related to semantic values,
`yyls': related to locations.
int yylen;
Refer to the stacks thru separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Starting parse\n");
#endif
yytype_int16 yyssa[YYINITDEPTH];
yytype_int16 *yyss = yyssa;
yytype_int16 *yyssp;
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs = yyvsa;
YYSTYPE *yyvsp;
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
YYSIZE_T yystacksize = YYINITDEPTH;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
/* The number of symbols on the RHS of the reduced rule.
Keep to zero when no symbol should be popped. */
int yylen = 0;
YYDPRINTF ((stderr, "Starting parse\n"));
yystate = 0;
yyerrstatus = 0;
@@ -654,758 +1413,764 @@
so that they stay on the same level as the state stack.
The wasted elements are never initialized. */
yyssp = yyss - 1;
yyssp = yyss;
yyvsp = yyvs;
#ifdef YYLSP_NEEDED
yylsp = yyls;
#endif
/* 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:
goto yysetstate;
*++yyssp = yystate;
/*------------------------------------------------------------.
| yynewstate -- Push a new state, which is found in yystate. |
`------------------------------------------------------------*/
yynewstate:
/* In all cases, when you get here, the value and location stacks
have just been pushed. So pushing a state here evens the stacks. */
yyssp++;
if (yyssp >= yyss + yystacksize - 1)
{
YYSTYPE *yyvs1 = yyvs;
short *yyss1 = yyss;
#ifdef YYLSP_NEEDED
YYLTYPE *yyls1 = yyls;
#endif
yysetstate:
*yyssp = yystate;
if (yyss + yystacksize - 1 <= yyssp)
{
int size = yyssp - yyss + 1;
YYSIZE_T yysize = 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
{
/* 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;
yytype_int16 *yyss1 = yyss;
/* Each stack pointer address is followed by the size of the
data in use in that stack, in bytes. This used to be a
conditional around just the two extra args, but that might
be undefined if yyoverflow is a macro. */
yyoverflow (YY_("memory exhausted"),
&yyss1, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yystacksize);
yyss = yyss1;
yyvs = yyvs1;
}
#else
# ifndef YYSTACK_RELOCATE
goto yyexhaustedlab;
# else
if (yystacksize >= YYMAXDEPTH)
{
yyerror("parser stack overflow");
if (yyfree_stacks)
{
#ifndef YYSTACK_USE_ALLOCA
free (yyss);
free (yyvs);
#ifdef YYLSP_NEEDED
free (yyls);
#endif
#endif
}
return 2;
}
if (YYMAXDEPTH <= yystacksize)
goto yyexhaustedlab;
yystacksize *= 2;
if (yystacksize > YYMAXDEPTH)
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
#ifndef YYSTACK_USE_ALLOCA
yyfree_stacks = 1;
#endif
yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
__yy_memcpy ((char *)yyss, (char *)yyss1,
size * (unsigned int) sizeof (*yyssp));
yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
__yy_memcpy ((char *)yyvs, (char *)yyvs1,
size * (unsigned int) sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
__yy_memcpy ((char *)yyls, (char *)yyls1,
size * (unsigned int) sizeof (*yylsp));
#endif
{
yytype_int16 *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyexhaustedlab;
YYSTACK_RELOCATE (yyss);
YYSTACK_RELOCATE (yyvs);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
#endif
yyssp = yyss + size - 1;
yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
yylsp = yyls + size - 1;
#endif
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Stack size increased to %d\n", yystacksize);
#endif
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long int) yystacksize));
if (yyssp >= yyss + yystacksize - 1)
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Entering state %d\n", yystate);
#endif
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
goto yybackup;
yybackup:
/*-----------.
| yybackup. |
`-----------*/
yybackup:
/* Do appropriate processing given the current state. Read a
look-ahead token if we need one and don't already have one. */
yyn = yypact[yystate];
if (yyn == YYFLAG)
if (yyn == YYPACT_NINF)
goto yydefault;
/* 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
YYDPRINTF ((stderr, "Reading a token: "));
yychar = YYLEX;
}
if (yychar <= 0)
if (yychar <= YYEOF)
{
yychar1 = 0;
yychar = YYEOF;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Now at end of input.\n");
#endif
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
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
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
}
yyn += yychar1;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
/* If the proper action on seeing token YYTOKEN is to reduce or to
detect an error, take that action. */
yyn += yytoken;
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
goto yydefault;
yyn = yytable[yyn];
/* 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 <= 0)
{
if (yyn == YYFLAG)
if (yyn == 0 || yyn == YYTABLE_NINF)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrlab;
if (yyn == YYFINAL)
YYACCEPT;
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
#endif
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
if (yychar != YYEOF)
yychar = YYEMPTY;
yystate = yyn;
*++yyvsp = yylval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
if (yyerrstatus) yyerrstatus--;
yystate = yyn;
goto yynewstate;
yydefault:
/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state. |
`-----------------------------------------------------------*/
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
goto yyreduce;
/*-----------------------------.
| yyreduce -- Do a reduction. |
`-----------------------------*/
yyreduce:
yylen = yyr2[yyn];
if (yylen > 0)
yyval = yyvsp[1-yylen];
#if YYDEBUG != 0
if (yydebug)
{
int i;
fprintf (stderr, "Reducing via rule %d (line %d), ",
yyn, yyrline[yyn]);
for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
fprintf (stderr, "%s ", yytname[yyrhs[i]]);
fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
}
#endif
/* If YYLEN is nonzero, implement the default value of the action:
`$$ = $1'.
switch (yyn) {
Otherwise, the following line sets YYVAL to garbage.
This behavior is undocumented and Bison
users should not rely upon it. Assigning to YYVAL
unconditionally makes the parser a bit smaller, and it avoids a
GCC warning that YYVAL may be used uninitialized. */
yyval = yyvsp[1-yylen];
case 2:
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 3:
#line 131 "jamgram.y"
{ parse_save( yyvsp[0].parse ); ;
break;}
case 3:
{ parse_save( (yyvsp[(1) - (1)]).parse ); }
break;
case 4:
#line 142 "jamgram.y"
{ yyval.parse = pnull(); ;
break;}
case 4:
{ (yyval).parse = pnull(); }
break;
case 5:
#line 144 "jamgram.y"
{ yyval.parse = yyvsp[0].parse; ;
break;}
case 5:
{ (yyval).parse = (yyvsp[(1) - (1)]).parse; }
break;
case 6:
#line 148 "jamgram.y"
{ yyval.parse = yyvsp[0].parse; ;
break;}
case 6:
{ (yyval).parse = (yyvsp[(1) - (1)]).parse; }
break;
case 7:
#line 150 "jamgram.y"
{ yyval.parse = prules( yyvsp[-1].parse, yyvsp[0].parse ); ;
break;}
case 7:
{ (yyval).parse = prules( (yyvsp[(1) - (2)]).parse, (yyvsp[(2) - (2)]).parse ); }
break;
case 8:
#line 152 "jamgram.y"
{ yyval.parse = plocal( yyvsp[-2].parse, pnull(), yyvsp[0].parse ); ;
break;}
case 8:
{ (yyval).parse = plocal( (yyvsp[(2) - (4)]).parse, pnull(), (yyvsp[(4) - (4)]).parse ); }
break;
case 9:
#line 154 "jamgram.y"
{ yyval.parse = plocal( yyvsp[-4].parse, yyvsp[-2].parse, yyvsp[0].parse ); ;
break;}
case 9:
{ (yyval).parse = plocal( (yyvsp[(2) - (6)]).parse, (yyvsp[(4) - (6)]).parse, (yyvsp[(6) - (6)]).parse ); }
break;
case 10:
#line 158 "jamgram.y"
{ yyval.parse = yyvsp[-1].parse; ;
break;}
case 10:
{ (yyval).parse = (yyvsp[(2) - (3)]).parse; }
break;
case 11:
#line 160 "jamgram.y"
{ yyval.parse = pincl( yyvsp[-1].parse ); ;
break;}
case 11:
{ (yyval).parse = pincl( (yyvsp[(2) - (3)]).parse ); }
break;
case 12:
#line 162 "jamgram.y"
{ yyval.parse = pbreak( yyvsp[-1].parse, JMP_EOF ); ;
break;}
case 12:
{ (yyval).parse = pbreak( (yyvsp[(2) - (3)]).parse, JMP_EOF ); }
break;
case 13:
#line 164 "jamgram.y"
{ yyval.parse = prule( yyvsp[-2].parse, yyvsp[-1].parse ); ;
break;}
case 13:
{ (yyval).parse = prule( (yyvsp[(1) - (3)]).parse, (yyvsp[(2) - (3)]).parse ); }
break;
case 14:
#line 166 "jamgram.y"
{ yyval.parse = pset( yyvsp[-3].parse, yyvsp[-1].parse, yyvsp[-2].number ); ;
break;}
case 14:
{ (yyval).parse = pset( (yyvsp[(1) - (4)]).parse, (yyvsp[(3) - (4)]).parse, (yyvsp[(2) - (4)]).number ); }
break;
case 15:
#line 168 "jamgram.y"
{ yyval.parse = pset1( yyvsp[-5].parse, yyvsp[-3].parse, yyvsp[-1].parse, yyvsp[-2].number ); ;
break;}
case 15:
{ (yyval).parse = pset1( (yyvsp[(1) - (6)]).parse, (yyvsp[(3) - (6)]).parse, (yyvsp[(5) - (6)]).parse, (yyvsp[(4) - (6)]).number ); }
break;
case 16:
#line 170 "jamgram.y"
{ yyval.parse = pbreak( yyvsp[-1].parse, JMP_BREAK ); ;
break;}
case 16:
{ (yyval).parse = pbreak( (yyvsp[(2) - (3)]).parse, JMP_BREAK ); }
break;
case 17:
#line 172 "jamgram.y"
{ yyval.parse = pbreak( yyvsp[-1].parse, JMP_CONTINUE ); ;
break;}
case 17:
{ (yyval).parse = pbreak( (yyvsp[(2) - (3)]).parse, JMP_CONTINUE ); }
break;
case 18:
#line 174 "jamgram.y"
{ yyval.parse = pbreak( yyvsp[-1].parse, JMP_RETURN ); ;
break;}
case 18:
{ (yyval).parse = pbreak( (yyvsp[(2) - (3)]).parse, JMP_RETURN ); }
break;
case 19:
#line 176 "jamgram.y"
{ yyval.parse = pfor( yyvsp[-5].string, yyvsp[-3].parse, yyvsp[-1].parse ); ;
break;}
case 19:
{ (yyval).parse = pfor( (yyvsp[(2) - (7)]).string, (yyvsp[(4) - (7)]).parse, (yyvsp[(6) - (7)]).parse ); }
break;
case 20:
#line 178 "jamgram.y"
{ yyval.parse = pswitch( yyvsp[-3].parse, yyvsp[-1].parse ); ;
break;}
case 20:
{ (yyval).parse = pswitch( (yyvsp[(2) - (5)]).parse, (yyvsp[(4) - (5)]).parse ); }
break;
case 21:
#line 180 "jamgram.y"
{ yyval.parse = pif( yyvsp[-3].parse, yyvsp[-1].parse, pnull() ); ;
break;}
case 21:
{ (yyval).parse = pif( (yyvsp[(2) - (5)]).parse, (yyvsp[(4) - (5)]).parse, pnull() ); }
break;
case 22:
#line 182 "jamgram.y"
{ yyval.parse = pif( yyvsp[-5].parse, yyvsp[-3].parse, yyvsp[0].parse ); ;
break;}
case 22:
{ (yyval).parse = pif( (yyvsp[(2) - (7)]).parse, (yyvsp[(4) - (7)]).parse, (yyvsp[(7) - (7)]).parse ); }
break;
case 23:
#line 184 "jamgram.y"
{ yyval.parse = pwhile( yyvsp[-3].parse, yyvsp[-1].parse ); ;
break;}
case 23:
{ (yyval).parse = pwhile( (yyvsp[(2) - (5)]).parse, (yyvsp[(4) - (5)]).parse ); }
break;
case 24:
#line 186 "jamgram.y"
{ yyval.parse = psetc( yyvsp[-4].string, yyvsp[-3].parse, yyvsp[-1].parse ); ;
break;}
case 24:
{ (yyval).parse = psetc( (yyvsp[(2) - (6)]).string, (yyvsp[(3) - (6)]).parse, (yyvsp[(5) - (6)]).parse ); }
break;
case 25:
#line 188 "jamgram.y"
{ yyval.parse = pon( yyvsp[-1].parse, yyvsp[0].parse ); ;
break;}
case 25:
{ (yyval).parse = pon( (yyvsp[(2) - (3)]).parse, (yyvsp[(3) - (3)]).parse ); }
break;
case 26:
#line 190 "jamgram.y"
{ yymode( SCAN_STRING ); ;
break;}
case 26:
{ yymode( SCAN_STRING ); }
break;
case 27:
#line 192 "jamgram.y"
{ yymode( SCAN_NORMAL ); ;
break;}
case 27:
{ yymode( SCAN_NORMAL ); }
break;
case 28:
#line 194 "jamgram.y"
{ yyval.parse = psete( yyvsp[-6].string,yyvsp[-5].parse,yyvsp[-2].string,yyvsp[-7].number ); ;
break;}
case 28:
{ (yyval).parse = psete( (yyvsp[(3) - (9)]).string,(yyvsp[(4) - (9)]).parse,(yyvsp[(7) - (9)]).string,(yyvsp[(2) - (9)]).number ); }
break;
case 29:
#line 202 "jamgram.y"
{ yyval.number = VAR_SET; ;
break;}
case 29:
{ (yyval).number = VAR_SET; }
break;
case 30:
#line 204 "jamgram.y"
{ yyval.number = VAR_APPEND; ;
break;}
case 30:
{ (yyval).number = VAR_APPEND; }
break;
case 31:
#line 206 "jamgram.y"
{ yyval.number = VAR_DEFAULT; ;
break;}
case 31:
{ (yyval).number = VAR_DEFAULT; }
break;
case 32:
#line 208 "jamgram.y"
{ yyval.number = VAR_DEFAULT; ;
break;}
case 32:
{ (yyval).number = VAR_DEFAULT; }
break;
case 33:
#line 216 "jamgram.y"
{ yyval.parse = peval( EXPR_EXISTS, yyvsp[0].parse, pnull() ); ;
break;}
case 33:
{ (yyval).parse = peval( EXPR_EXISTS, (yyvsp[(1) - (1)]).parse, pnull() ); }
break;
case 34:
#line 218 "jamgram.y"
{ yyval.parse = peval( EXPR_EQUALS, yyvsp[-2].parse, yyvsp[0].parse ); ;
break;}
case 34:
{ (yyval).parse = peval( EXPR_EQUALS, (yyvsp[(1) - (3)]).parse, (yyvsp[(3) - (3)]).parse ); }
break;
case 35:
#line 220 "jamgram.y"
{ yyval.parse = peval( EXPR_NOTEQ, yyvsp[-2].parse, yyvsp[0].parse ); ;
break;}
case 35:
{ (yyval).parse = peval( EXPR_NOTEQ, (yyvsp[(1) - (3)]).parse, (yyvsp[(3) - (3)]).parse ); }
break;
case 36:
#line 222 "jamgram.y"
{ yyval.parse = peval( EXPR_LESS, yyvsp[-2].parse, yyvsp[0].parse ); ;
break;}
case 36:
{ (yyval).parse = peval( EXPR_LESS, (yyvsp[(1) - (3)]).parse, (yyvsp[(3) - (3)]).parse ); }
break;
case 37:
#line 224 "jamgram.y"
{ yyval.parse = peval( EXPR_LESSEQ, yyvsp[-2].parse, yyvsp[0].parse ); ;
break;}
case 37:
{ (yyval).parse = peval( EXPR_LESSEQ, (yyvsp[(1) - (3)]).parse, (yyvsp[(3) - (3)]).parse ); }
break;
case 38:
#line 226 "jamgram.y"
{ yyval.parse = peval( EXPR_MORE, yyvsp[-2].parse, yyvsp[0].parse ); ;
break;}
case 38:
{ (yyval).parse = peval( EXPR_MORE, (yyvsp[(1) - (3)]).parse, (yyvsp[(3) - (3)]).parse ); }
break;
case 39:
#line 228 "jamgram.y"
{ yyval.parse = peval( EXPR_MOREEQ, yyvsp[-2].parse, yyvsp[0].parse ); ;
break;}
case 39:
{ (yyval).parse = peval( EXPR_MOREEQ, (yyvsp[(1) - (3)]).parse, (yyvsp[(3) - (3)]).parse ); }
break;
case 40:
#line 230 "jamgram.y"
{ yyval.parse = peval( EXPR_AND, yyvsp[-2].parse, yyvsp[0].parse ); ;
break;}
case 40:
{ (yyval).parse = peval( EXPR_AND, (yyvsp[(1) - (3)]).parse, (yyvsp[(3) - (3)]).parse ); }
break;
case 41:
#line 232 "jamgram.y"
{ yyval.parse = peval( EXPR_AND, yyvsp[-2].parse, yyvsp[0].parse ); ;
break;}
case 41:
{ (yyval).parse = peval( EXPR_AND, (yyvsp[(1) - (3)]).parse, (yyvsp[(3) - (3)]).parse ); }
break;
case 42:
#line 234 "jamgram.y"
{ yyval.parse = peval( EXPR_OR, yyvsp[-2].parse, yyvsp[0].parse ); ;
break;}
case 42:
{ (yyval).parse = peval( EXPR_OR, (yyvsp[(1) - (3)]).parse, (yyvsp[(3) - (3)]).parse ); }
break;
case 43:
#line 236 "jamgram.y"
{ yyval.parse = peval( EXPR_OR, yyvsp[-2].parse, yyvsp[0].parse ); ;
break;}
case 43:
{ (yyval).parse = peval( EXPR_OR, (yyvsp[(1) - (3)]).parse, (yyvsp[(3) - (3)]).parse ); }
break;
case 44:
#line 238 "jamgram.y"
{ yyval.parse = peval( EXPR_IN, yyvsp[-2].parse, yyvsp[0].parse ); ;
break;}
case 44:
{ (yyval).parse = peval( EXPR_IN, (yyvsp[(1) - (3)]).parse, (yyvsp[(3) - (3)]).parse ); }
break;
case 45:
#line 240 "jamgram.y"
{ yyval.parse = peval( EXPR_NOT, yyvsp[0].parse, pnull() ); ;
break;}
case 45:
{ (yyval).parse = peval( EXPR_NOT, (yyvsp[(2) - (2)]).parse, pnull() ); }
break;
case 46:
#line 242 "jamgram.y"
{ yyval.parse = yyvsp[-1].parse; ;
break;}
case 46:
{ (yyval).parse = (yyvsp[(2) - (3)]).parse; }
break;
case 47:
#line 252 "jamgram.y"
{ yyval.parse = P0; ;
break;}
case 47:
{ (yyval).parse = P0; }
break;
case 48:
#line 254 "jamgram.y"
{ yyval.parse = pnode( yyvsp[-1].parse, yyvsp[0].parse ); ;
break;}
case 48:
{ (yyval).parse = pnode( (yyvsp[(1) - (2)]).parse, (yyvsp[(2) - (2)]).parse ); }
break;
case 49:
#line 258 "jamgram.y"
{ yyval.parse = psnode( yyvsp[-2].string, yyvsp[0].parse ); ;
break;}
case 49:
{ (yyval).parse = psnode( (yyvsp[(2) - (4)]).string, (yyvsp[(4) - (4)]).parse ); }
break;
case 50:
#line 267 "jamgram.y"
{ yyval.parse = P0; ;
break;}
case 50:
{ (yyval).parse = P0; }
break;
case 51:
#line 269 "jamgram.y"
{ yyval.parse = psnode( yyvsp[-2].string, yyvsp[0].parse ); ;
break;}
case 51:
{ (yyval).parse = psnode( (yyvsp[(1) - (3)]).string, (yyvsp[(3) - (3)]).parse ); }
break;
case 52:
#line 271 "jamgram.y"
{ yyval.parse = psnode( yyvsp[0].string, P0 ); ;
break;}
case 52:
{ (yyval).parse = psnode( (yyvsp[(1) - (1)]).string, P0 ); }
break;
case 53:
#line 280 "jamgram.y"
{ yyval.parse = pnode( P0, yyvsp[0].parse ); ;
break;}
case 53:
{ (yyval).parse = pnode( P0, (yyvsp[(1) - (1)]).parse ); }
break;
case 54:
#line 282 "jamgram.y"
{ yyval.parse = pnode( yyvsp[0].parse, yyvsp[-2].parse ); ;
break;}
case 54:
{ (yyval).parse = pnode( (yyvsp[(3) - (3)]).parse, (yyvsp[(1) - (3)]).parse ); }
break;
case 55:
#line 292 "jamgram.y"
{ yyval.parse = yyvsp[0].parse; yymode( SCAN_NORMAL ); ;
break;}
case 55:
{ (yyval).parse = (yyvsp[(1) - (1)]).parse; yymode( SCAN_NORMAL ); }
break;
case 56:
#line 296 "jamgram.y"
{ yyval.parse = pnull(); yymode( SCAN_PUNCT ); ;
break;}
case 56:
{ (yyval).parse = pnull(); yymode( SCAN_PUNCT ); }
break;
case 57:
#line 298 "jamgram.y"
{ yyval.parse = pappend( yyvsp[-1].parse, yyvsp[0].parse ); ;
break;}
case 57:
{ (yyval).parse = pappend( (yyvsp[(1) - (2)]).parse, (yyvsp[(2) - (2)]).parse ); }
break;
case 58:
#line 302 "jamgram.y"
{ yyval.parse = plist( yyvsp[0].string ); ;
break;}
case 58:
{ (yyval).parse = plist( (yyvsp[(1) - (1)]).string ); }
break;
case 59:
#line 303 "jamgram.y"
{ yymode( SCAN_NORMAL ); ;
break;}
case 59:
{ yymode( SCAN_NORMAL ); }
break;
case 60:
#line 304 "jamgram.y"
{ yyval.parse = yyvsp[-1].parse; ;
break;}
case 60:
{ (yyval).parse = (yyvsp[(3) - (4)]).parse; }
break;
case 61:
#line 313 "jamgram.y"
{ yyval.parse = prule( yyvsp[-1].parse, yyvsp[0].parse ); ;
break;}
case 61:
{ (yyval).parse = prule( (yyvsp[(1) - (2)]).parse, (yyvsp[(2) - (2)]).parse ); }
break;
case 62:
#line 315 "jamgram.y"
{ yyval.parse = pon( yyvsp[-2].parse, prule( yyvsp[-1].parse, yyvsp[0].parse ) ); ;
break;}
case 62:
{ (yyval).parse = pon( (yyvsp[(2) - (4)]).parse, prule( (yyvsp[(3) - (4)]).parse, (yyvsp[(4) - (4)]).parse ) ); }
break;
case 63:
#line 317 "jamgram.y"
{ yyval.parse = pon( yyvsp[-2].parse, yyvsp[0].parse ); ;
break;}
case 63:
{ (yyval).parse = pon( (yyvsp[(2) - (4)]).parse, (yyvsp[(4) - (4)]).parse ); }
break;
case 64:
#line 326 "jamgram.y"
{ yyval.number = 0; ;
break;}
case 64:
{ (yyval).number = 0; }
break;
case 65:
#line 328 "jamgram.y"
{ yyval.number = yyvsp[-1].number | yyvsp[0].number; ;
break;}
case 65:
{ (yyval).number = (yyvsp[(1) - (2)]).number | (yyvsp[(2) - (2)]).number; }
break;
case 66:
#line 332 "jamgram.y"
{ yyval.number = RULE_UPDATED; ;
break;}
case 66:
{ (yyval).number = RULE_UPDATED; }
break;
case 67:
#line 334 "jamgram.y"
{ yyval.number = RULE_TOGETHER; ;
break;}
case 67:
{ (yyval).number = RULE_TOGETHER; }
break;
case 68:
#line 336 "jamgram.y"
{ yyval.number = RULE_IGNORE; ;
break;}
case 68:
{ (yyval).number = RULE_IGNORE; }
break;
case 69:
#line 338 "jamgram.y"
{ yyval.number = RULE_QUIETLY; ;
break;}
case 69:
{ (yyval).number = RULE_QUIETLY; }
break;
case 70:
#line 340 "jamgram.y"
{ yyval.number = RULE_PIECEMEAL; ;
break;}
case 70:
{ (yyval).number = RULE_PIECEMEAL; }
break;
case 71:
#line 342 "jamgram.y"
{ yyval.number = RULE_EXISTING; ;
break;}
case 71:
{ (yyval).number = RULE_EXISTING; }
break;
case 72:
#line 344 "jamgram.y"
{ yyval.number = atoi( yyvsp[0].string ) * RULE_MAXLINE; ;
break;}
case 72:
{ (yyval).number = atoi( (yyvsp[(2) - (2)]).string ) * RULE_MAXLINE; }
break;
case 73:
#line 353 "jamgram.y"
{ yyval.parse = pnull(); ;
break;}
case 73:
{ (yyval).parse = pnull(); }
break;
case 74:
#line 355 "jamgram.y"
{ yyval.parse = yyvsp[0].parse; ;
break;}
}
#line 543 "/bison.simple"
yyvsp -= yylen;
yyssp -= yylen;
#ifdef YYLSP_NEEDED
yylsp -= yylen;
#endif
{ (yyval).parse = (yyvsp[(2) - (2)]).parse; }
break;
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
#line 1963 "y.tab.c"
default: break;
}
#endif
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
*++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. */
/* 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 = yypgoto[yyn - YYNTOKENS] + *yyssp;
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTBASE];
yystate = yydefgoto[yyn - YYNTOKENS];
goto yynewstate;
yyerrlab:
if (! yyerrstatus)
/*------------------------------------.
| yyerrlab -- here on detecting error |
`------------------------------------*/
yyerrlab:
if (!yyerrstatus)
{
++yynerrs;
#ifdef YYERROR_VERBOSE
yyn = yypact[yystate];
if (yyn > YYFLAG && yyn < YYLAST)
{
int size = 0;
char *msg;
int x, count;
count = 0;
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("parse error");
#if ! YYERROR_VERBOSE
yyerror (YY_("syntax error"));
#else
{
YYSIZE_T yysize = yysyntax_error (0, yystate, yychar);
if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM)
{
YYSIZE_T yyalloc = 2 * yysize;
if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM))
yyalloc = YYSTACK_ALLOC_MAXIMUM;
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
yymsg = (char *) YYSTACK_ALLOC (yyalloc);
if (yymsg)
yymsg_alloc = yyalloc;
else
{
yymsg = yymsgbuf;
yymsg_alloc = sizeof yymsgbuf;
}
}
if (0 < yysize && yysize <= yymsg_alloc)
{
(void) yysyntax_error (yymsg, yystate, yychar);
yyerror (yymsg);
}
else
{
yyerror (YY_("syntax error"));
if (yysize != 0)
goto yyexhaustedlab;
}
}
#endif
}
goto yyerrlab1;
yyerrlab1:
if (yyerrstatus == 3)
{
/* If just tried and failed to reuse look-ahead token after an
error, discard it. */
if (yychar == YYEOF)
YYABORT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif
yychar = YYEMPTY;
if (yychar <= YYEOF)
{
if (yychar == YYEOF)
YYABORT;
}
else
{
yydestruct ("Error: discarding",
yytoken, &yylval);
yychar = YYEMPTY;
}
}
/* Else will try to reuse lookahead token
after shifting the error token. */
yyerrstatus = 3;
goto yyerrhandle;
/* Else will try to reuse look-ahead token after shifting the error
token. */
goto yyerrlab1;
yyerrdefault:
#if 0
/* This is wrong; only states that explicitly want error tokens
should shift them. */
yyn = yydefact[yystate];
if (yyn) goto yydefault;
#endif
/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR. |
`---------------------------------------------------*/
yyerrorlab:
/* Pacify compilers like GCC when the user code never invokes
YYERROR and the label yyerrorlab therefore never appears in user
code. */
if ( 0)
goto yyerrorlab;
/* Do not reclaim the symbols of the rule which action triggered
this YYERROR. */
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
yystate = *yyssp;
goto yyerrlab1;
yyerrpop:
if (yyssp == yyss) YYABORT;
yyvsp--;
yystate = *--yyssp;
#ifdef YYLSP_NEEDED
yylsp--;
#endif
/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR. |
`-------------------------------------------------------------*/
yyerrlab1:
yyerrstatus = 3;
#if YYDEBUG != 0
if (yydebug)
for (;;)
{
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 != YYPACT_NINF)
{
yyn += YYTERROR;
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
{
yyn = yytable[yyn];
if (0 < yyn)
break;
}
}
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yyerrdefault;
if (yyssp == yyss)
YYABORT;
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;
yydestruct ("Error: popping",
yystos[yystate], yyvsp);
YYPOPSTACK (1);
yystate = *yyssp;
YY_STACK_PRINT (yyss, yyssp);
}
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
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
yystate = yyn;
goto yynewstate;
yyacceptlab:
if (yyfree_stacks)
{
#ifndef YYSTACK_USE_ALLOCA
free (yyss);
free (yyvs);
#ifdef YYLSP_NEEDED
free (yyls);
#endif
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturn;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturn;
#ifndef yyoverflow
/*-------------------------------------------------.
| yyexhaustedlab -- memory exhaustion comes here. |
`-------------------------------------------------*/
yyexhaustedlab:
yyerror (YY_("memory exhausted"));
yyresult = 2;
#endif
}
return 0;
yyabortlab:
if (yyfree_stacks)
yyreturn:
if (yychar != YYEOF && yychar != YYEMPTY)
yydestruct ("Cleanup: discarding lookahead",
yytoken, &yylval);
/* Do not reclaim the symbols of the rule which action triggered
this YYABORT or YYACCEPT. */
YYPOPSTACK (yylen);
YY_STACK_PRINT (yyss, yyssp);
while (yyssp != yyss)
{
#ifndef YYSTACK_USE_ALLOCA
free (yyss);
free (yyvs);
#ifdef YYLSP_NEEDED
free (yyls);
yydestruct ("Cleanup: popping",
yystos[*yyssp], yyvsp);
YYPOPSTACK (1);
}
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
#if YYERROR_VERBOSE
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
#endif
}
return 1;
return YYID (yyresult);
}
#line 359 "jamgram.y"
@@ -1,54 +1,153 @@
#ifndef YYSTYPE
#define YYSTYPE int
/* Skeleton interface for Bison's Yacc-like parsers in C
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
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., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA. */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
/* Put the tokens into the symbol table, so that GDB and other debuggers
know about them. */
enum yytokentype {
_LANGLE_t = 258,
_LANGLE_EQUALS_t = 259,
_EQUALS_t = 260,
_RANGLE_t = 261,
_RANGLE_EQUALS_t = 262,
_BAR_t = 263,
_BARBAR_t = 264,
_SEMIC_t = 265,
_COLON_t = 266,
_BANG_t = 267,
_BANG_EQUALS_t = 268,
_QUESTION_EQUALS_t = 269,
_LPAREN_t = 270,
_RPAREN_t = 271,
_LBRACKET_t = 272,
_RBRACKET_t = 273,
_LBRACE_t = 274,
_RBRACE_t = 275,
_AMPER_t = 276,
_AMPERAMPER_t = 277,
_PLUS_EQUALS_t = 278,
ACTIONS_t = 279,
BIND_t = 280,
BREAK_t = 281,
CASE_t = 282,
CONTINUE_t = 283,
DEFAULT_t = 284,
ELSE_t = 285,
EXISTING_t = 286,
FOR_t = 287,
IF_t = 288,
IGNORE_t = 289,
IN_t = 290,
INCLUDE_t = 291,
JUMPTOEOF_t = 292,
LOCAL_t = 293,
MAXLINE_t = 294,
ON_t = 295,
PIECEMEAL_t = 296,
QUIETLY_t = 297,
RETURN_t = 298,
RULE_t = 299,
SWITCH_t = 300,
TOGETHER_t = 301,
UPDATED_t = 302,
WHILE_t = 303,
ARG = 304,
STRING = 305
};
#endif
#define _BANG_t 257
#define _BANG_EQUALS_t 258
#define _AMPER_t 259
#define _AMPERAMPER_t 260
#define _LPAREN_t 261
#define _RPAREN_t 262
#define _PLUS_EQUALS_t 263
#define _COLON_t 264
#define _SEMIC_t 265
#define _LANGLE_t 266
#define _LANGLE_EQUALS_t 267
#define _EQUALS_t 268
#define _RANGLE_t 269
#define _RANGLE_EQUALS_t 270
#define _QUESTION_EQUALS_t 271
#define _LBRACKET_t 272
#define _RBRACKET_t 273
#define ACTIONS_t 274
#define BIND_t 275
#define BREAK_t 276
#define CASE_t 277
#define CONTINUE_t 278
#define DEFAULT_t 279
#define ELSE_t 280
#define EXISTING_t 281
#define FOR_t 282
#define IF_t 283
#define IGNORE_t 284
#define IN_t 285
#define INCLUDE_t 286
#define JUMPTOEOF_t 287
#define LOCAL_t 288
#define MAXLINE_t 289
#define ON_t 290
#define PIECEMEAL_t 291
#define QUIETLY_t 292
#define RETURN_t 293
#define RULE_t 294
#define SWITCH_t 295
#define TOGETHER_t 296
#define UPDATED_t 297
#define WHILE_t 298
#define _LBRACE_t 299
#define _BAR_t 300
#define _BARBAR_t 301
#define _RBRACE_t 302
#define ARG 303
#define STRING 304
#define _LANGLE_t 258
#define _LANGLE_EQUALS_t 259
#define _EQUALS_t 260
#define _RANGLE_t 261
#define _RANGLE_EQUALS_t 262
#define _BAR_t 263
#define _BARBAR_t 264
#define _SEMIC_t 265
#define _COLON_t 266
#define _BANG_t 267
#define _BANG_EQUALS_t 268
#define _QUESTION_EQUALS_t 269
#define _LPAREN_t 270
#define _RPAREN_t 271
#define _LBRACKET_t 272
#define _RBRACKET_t 273
#define _LBRACE_t 274
#define _RBRACE_t 275
#define _AMPER_t 276
#define _AMPERAMPER_t 277
#define _PLUS_EQUALS_t 278
#define ACTIONS_t 279
#define BIND_t 280
#define BREAK_t 281
#define CASE_t 282
#define CONTINUE_t 283
#define DEFAULT_t 284
#define ELSE_t 285
#define EXISTING_t 286
#define FOR_t 287
#define IF_t 288
#define IGNORE_t 289
#define IN_t 290
#define INCLUDE_t 291
#define JUMPTOEOF_t 292
#define LOCAL_t 293
#define MAXLINE_t 294
#define ON_t 295
#define PIECEMEAL_t 296
#define QUIETLY_t 297
#define RETURN_t 298
#define RULE_t 299
#define SWITCH_t 300
#define TOGETHER_t 301
#define UPDATED_t 302
#define WHILE_t 303
#define ARG 304
#define STRING 305
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
typedef int YYSTYPE;
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
# define YYSTYPE_IS_DECLARED 1
# define YYSTYPE_IS_TRIVIAL 1
#endif
extern YYSTYPE yylval;
@@ -1,20 +1,24 @@
%token _BANG_t
%token _BANG_EQUALS_t
%token _AMPER_t
%token _AMPERAMPER_t
%token _LPAREN_t
%token _RPAREN_t
%token _PLUS_EQUALS_t
%token _COLON_t
%token _SEMIC_t
%token _LANGLE_t
%token _LANGLE_EQUALS_t
%token _EQUALS_t
%token _RANGLE_t
%token _RANGLE_EQUALS_t
%token _BAR_t
%token _BARBAR_t
%token _SEMIC_t
%token _COLON_t
%token _BANG_t
%token _BANG_EQUALS_t
%token _QUESTION_EQUALS_t
%token _LPAREN_t
%token _RPAREN_t
%token _LBRACKET_t
%token _RBRACKET_t
%token _LBRACE_t
%token _RBRACE_t
%token _AMPER_t
%token _AMPERAMPER_t
%token _PLUS_EQUALS_t
%token ACTIONS_t
%token BIND_t
%token BREAK_t
@@ -40,10 +44,6 @@
%token TOGETHER_t
%token UPDATED_t
%token WHILE_t
%token _LBRACE_t
%token _BAR_t
%token _BARBAR_t
%token _RBRACE_t
/*
* Copyright 1993-2002 Christopher Seiwald and Perforce Software, Inc.
*
@@ -1,20 +1,24 @@
{ "!", _BANG_t },
{ "!=", _BANG_EQUALS_t },
{ "&", _AMPER_t },
{ "&&", _AMPERAMPER_t },
{ "(", _LPAREN_t },
{ ")", _RPAREN_t },
{ "+=", _PLUS_EQUALS_t },
{ ":", _COLON_t },
{ ";", _SEMIC_t },
{ "<", _LANGLE_t },
{ "<=", _LANGLE_EQUALS_t },
{ "=", _EQUALS_t },
{ ">", _RANGLE_t },
{ ">=", _RANGLE_EQUALS_t },
{ "|", _BAR_t },
{ "||", _BARBAR_t },
{ ";", _SEMIC_t },
{ ":", _COLON_t },
{ "!", _BANG_t },
{ "!=", _BANG_EQUALS_t },
{ "?=", _QUESTION_EQUALS_t },
{ "(", _LPAREN_t },
{ ")", _RPAREN_t },
{ "[", _LBRACKET_t },
{ "]", _RBRACKET_t },
{ "{", _LBRACE_t },
{ "}", _RBRACE_t },
{ "&", _AMPER_t },
{ "&&", _AMPERAMPER_t },
{ "+=", _PLUS_EQUALS_t },
{ "actions", ACTIONS_t },
{ "bind", BIND_t },
{ "break", BREAK_t },
@@ -40,7 +44,3 @@
{ "together", TOGETHER_t },
{ "updated", UPDATED_t },
{ "while", WHILE_t },
{ "{", _LBRACE_t },
{ "|", _BAR_t },
{ "||", _BARBAR_t },
{ "}", _RBRACE_t },