Show grammar.cpp syntax highlighted
/* A Bison parser, made by GNU Bison 2.3. */
/* 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. */
/* Identify Bison output. */
#define YYBISON 1
/* Bison version. */
#define YYBISON_VERSION "2.3"
/* Skeleton name. */
#define YYSKELETON_NAME "yacc.c"
/* Pure parsers. */
#define YYPURE 0
/* Using locations. */
#define YYLSP_NEEDED 1
/* Substitute the variable and function names. */
#define yyparse kjsyyparse
#define yylex kjsyylex
#define yyerror kjsyyerror
#define yylval kjsyylval
#define yychar kjsyychar
#define yydebug kjsyydebug
#define yynerrs kjsyynerrs
#define yylloc kjsyylloc
/* Tokens. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
/* Put the tokens into the symbol table, so that GDB and other debuggers
know about them. */
enum yytokentype {
NULLTOKEN = 258,
TRUETOKEN = 259,
FALSETOKEN = 260,
STRING = 261,
NUMBER = 262,
BREAK = 263,
CASE = 264,
DEFAULT = 265,
FOR = 266,
NEW = 267,
VAR = 268,
CONTINUE = 269,
FUNCTION = 270,
RETURN = 271,
VOID = 272,
DELETE = 273,
IF = 274,
THIS = 275,
DO = 276,
WHILE = 277,
ELSE = 278,
IN = 279,
INSTANCEOF = 280,
TYPEOF = 281,
SWITCH = 282,
WITH = 283,
RESERVED = 284,
THROW = 285,
TRY = 286,
CATCH = 287,
FINALLY = 288,
EQEQ = 289,
NE = 290,
STREQ = 291,
STRNEQ = 292,
LE = 293,
GE = 294,
OR = 295,
AND = 296,
PLUSPLUS = 297,
MINUSMINUS = 298,
LSHIFT = 299,
RSHIFT = 300,
URSHIFT = 301,
PLUSEQUAL = 302,
MINUSEQUAL = 303,
MULTEQUAL = 304,
DIVEQUAL = 305,
LSHIFTEQUAL = 306,
RSHIFTEQUAL = 307,
URSHIFTEQUAL = 308,
ANDEQUAL = 309,
MODEQUAL = 310,
XOREQUAL = 311,
OREQUAL = 312,
IDENT = 313,
AUTOPLUSPLUS = 314,
AUTOMINUSMINUS = 315
};
#endif
/* Tokens. */
#define NULLTOKEN 258
#define TRUETOKEN 259
#define FALSETOKEN 260
#define STRING 261
#define NUMBER 262
#define BREAK 263
#define CASE 264
#define DEFAULT 265
#define FOR 266
#define NEW 267
#define VAR 268
#define CONTINUE 269
#define FUNCTION 270
#define RETURN 271
#define VOID 272
#define DELETE 273
#define IF 274
#define THIS 275
#define DO 276
#define WHILE 277
#define ELSE 278
#define IN 279
#define INSTANCEOF 280
#define TYPEOF 281
#define SWITCH 282
#define WITH 283
#define RESERVED 284
#define THROW 285
#define TRY 286
#define CATCH 287
#define FINALLY 288
#define EQEQ 289
#define NE 290
#define STREQ 291
#define STRNEQ 292
#define LE 293
#define GE 294
#define OR 295
#define AND 296
#define PLUSPLUS 297
#define MINUSMINUS 298
#define LSHIFT 299
#define RSHIFT 300
#define URSHIFT 301
#define PLUSEQUAL 302
#define MINUSEQUAL 303
#define MULTEQUAL 304
#define DIVEQUAL 305
#define LSHIFTEQUAL 306
#define RSHIFTEQUAL 307
#define URSHIFTEQUAL 308
#define ANDEQUAL 309
#define MODEQUAL 310
#define XOREQUAL 311
#define OREQUAL 312
#define IDENT 313
#define AUTOPLUSPLUS 314
#define AUTOMINUSMINUS 315
/* Copy the first part of user declarations. */
#line 1 "grammar.y"
/*
* This file is part of the KDE libraries
* Copyright (C) 1999-2000 Harri Porten (porten@kde.org)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <string.h>
#include <stdlib.h>
#include "value.h"
#include "object.h"
#include "types.h"
#include "interpreter.h"
#include "nodes.h"
#include "lexer.h"
#include "internal.h"
// Not sure why, but yacc doesn't add this define along with the others.
#define yylloc kjsyylloc
/* default values for bison */
#define YYDEBUG 0
#define YYMAXDEPTH 0
#if !APPLE_CHANGES
#define YYERROR_VERBOSE
#endif
#define DBG(l, s, e) { l->setLoc(s.first_line, e.last_line, Parser::sid); } // location
extern int kjsyylex();
int kjsyyerror(const char *);
static bool automatic();
using namespace KJS;
/* Enabling traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif
/* Enabling the token table. */
#ifndef YYTOKEN_TABLE
# define YYTOKEN_TABLE 0
#endif
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
typedef union YYSTYPE
#line 55 "grammar.y"
{
int ival;
double dval;
UString *ustr;
Identifier *ident;
Node *node;
StatementNode *stat;
ParameterNode *param;
FunctionBodyNode *body;
FuncDeclNode *func;
ProgramNode *prog;
AssignExprNode *init;
SourceElementsNode *srcs;
StatListNode *slist;
ArgumentsNode *args;
ArgumentListNode *alist;
VarDeclNode *decl;
VarDeclListNode *vlist;
CaseBlockNode *cblk;
ClauseListNode *clist;
CaseClauseNode *ccl;
ElementNode *elm;
Operator op;
PropertyValueNode *plist;
PropertyNode *pnode;
CatchNode *cnode;
FinallyNode *fnode;
}
/* Line 193 of yacc.c. */
#line 307 "grammar.cpp"
YYSTYPE;
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
# define YYSTYPE_IS_DECLARED 1
# define YYSTYPE_IS_TRIVIAL 1
#endif
#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
typedef struct YYLTYPE
{
int first_line;
int first_column;
int last_line;
int last_column;
} YYLTYPE;
# define yyltype YYLTYPE /* obsolescent; will be withdrawn */
# define YYLTYPE_IS_DECLARED 1
# define YYLTYPE_IS_TRIVIAL 1
#endif
/* Copy the second part of user declarations. */
/* Line 216 of yacc.c. */
#line 332 "grammar.cpp"
#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> /* INFRINGES ON USER NAME SPACE */
# 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> /* INFRINGES ON USER NAME SPACE */
# define YY_(msgid) dgettext ("bison-runtime", msgid)
# endif
# endif
# ifndef YY_
# define YY_(msgid) msgid
# endif
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define YYUSE(e) ((void) (e))
#else
# define YYUSE(e) /* empty */
#endif
/* Identity function, used to suppress warnings about constant conditions. */
#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
/* The parser invokes alloca or malloc; define the necessary symbols. */
# ifdef YYSTACK_USE_ALLOCA
# if YYSTACK_USE_ALLOCA
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# elif defined __BUILTIN_VA_ARG_INCR
# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
# elif defined _AIX
# define YYSTACK_ALLOC __alloca
# elif defined _MSC_VER
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
# 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> /* INFRINGES ON USER NAME SPACE */
# ifndef _STDLIB_H
# define _STDLIB_H 1
# endif
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
/* Pacify GCC's `empty if-body' warning. */
# 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> /* INFRINGES ON USER NAME SPACE */
# 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); /* INFRINGES ON USER NAME SPACE */
# 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 *); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# endif
#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
#if (! defined yyoverflow \
&& (! defined __cplusplus \
|| (defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL \
&& defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
yytype_int16 yyss;
YYSTYPE yyvs;
YYLTYPE yyls;
};
/* The size of the maximum gap between one aligned stack and the next. */
# 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) + sizeof (YYLTYPE)) \
+ 2 * 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
/* YYFINAL -- State number of the termination state. */
#define YYFINAL 183
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 1319
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 85
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 65
/* YYNRULES -- Number of rules. */
#define YYNRULES 197
/* YYNRULES -- Number of states. */
#define YYNSTATES 359
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 315
#define YYTRANSLATE(YYX) \
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
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, 74, 2, 2, 2, 76, 79, 2,
62, 63, 75, 71, 68, 72, 70, 61, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 69, 84,
77, 83, 78, 82, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 66, 2, 67, 80, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 64, 81, 65, 73, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 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, 51, 52, 53, 54,
55, 56, 57, 58, 59, 60
};
#if YYDEBUG
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
YYRHS. */
static const yytype_uint16 yyprhs[] =
{
0, 0, 3, 5, 7, 9, 11, 13, 15, 17,
19, 21, 23, 25, 29, 32, 36, 40, 44, 50,
53, 58, 59, 61, 63, 66, 70, 76, 78, 80,
82, 84, 86, 91, 95, 99, 101, 104, 107, 110,
115, 119, 122, 126, 128, 132, 134, 136, 138, 141,
144, 146, 149, 152, 155, 158, 161, 164, 167, 170,
173, 176, 179, 181, 185, 189, 193, 195, 199, 203,
205, 209, 213, 217, 219, 223, 227, 231, 235, 239,
243, 245, 249, 253, 257, 261, 263, 267, 269, 273,
275, 279, 281, 285, 287, 291, 293, 299, 301, 305,
307, 309, 311, 313, 315, 317, 319, 321, 323, 325,
327, 329, 331, 335, 337, 339, 341, 343, 345, 347,
349, 351, 353, 355, 357, 359, 361, 363, 366, 370,
372, 375, 379, 383, 385, 389, 391, 394, 397, 399,
402, 405, 411, 419, 426, 432, 442, 453, 461, 470,
480, 481, 483, 486, 489, 493, 497, 500, 503, 507,
511, 514, 517, 521, 525, 531, 537, 541, 547, 548,
550, 552, 555, 559, 564, 567, 571, 575, 579, 583,
587, 591, 596, 602, 605, 611, 618, 623, 629, 631,
635, 638, 642, 643, 645, 647, 650, 652
};
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
static const yytype_int16 yyrhs[] =
{
147, 0, -1, 3, -1, 4, -1, 5, -1, 7,
-1, 6, -1, 61, -1, 50, -1, 20, -1, 58,
-1, 86, -1, 88, -1, 62, 115, 63, -1, 64,
65, -1, 64, 92, 65, -1, 66, 90, 67, -1,
66, 89, 67, -1, 66, 89, 68, 90, 67, -1,
90, 113, -1, 89, 68, 90, 113, -1, -1, 91,
-1, 68, -1, 91, 68, -1, 93, 69, 113, -1,
92, 68, 93, 69, 113, -1, 58, -1, 6, -1,
7, -1, 87, -1, 144, -1, 94, 66, 115, 67,
-1, 94, 70, 58, -1, 12, 94, 97, -1, 94,
-1, 12, 95, -1, 94, 97, -1, 96, 97, -1,
96, 66, 115, 67, -1, 96, 70, 58, -1, 62,
63, -1, 62, 98, 63, -1, 113, -1, 98, 68,
113, -1, 95, -1, 96, -1, 99, -1, 99, 42,
-1, 99, 43, -1, 100, -1, 18, 101, -1, 17,
101, -1, 26, 101, -1, 42, 101, -1, 59, 101,
-1, 43, 101, -1, 60, 101, -1, 71, 101, -1,
72, 101, -1, 73, 101, -1, 74, 101, -1, 101,
-1, 102, 75, 101, -1, 102, 61, 101, -1, 102,
76, 101, -1, 102, -1, 103, 71, 102, -1, 103,
72, 102, -1, 103, -1, 104, 44, 103, -1, 104,
45, 103, -1, 104, 46, 103, -1, 104, -1, 105,
77, 104, -1, 105, 78, 104, -1, 105, 38, 104,
-1, 105, 39, 104, -1, 105, 25, 104, -1, 105,
24, 104, -1, 105, -1, 106, 34, 105, -1, 106,
35, 105, -1, 106, 36, 105, -1, 106, 37, 105,
-1, 106, -1, 107, 79, 106, -1, 107, -1, 108,
80, 107, -1, 108, -1, 109, 81, 108, -1, 109,
-1, 110, 41, 109, -1, 110, -1, 111, 40, 110,
-1, 111, -1, 111, 82, 113, 69, 113, -1, 112,
-1, 99, 114, 113, -1, 83, -1, 47, -1, 48,
-1, 49, -1, 50, -1, 51, -1, 52, -1, 53,
-1, 54, -1, 56, -1, 57, -1, 55, -1, 113,
-1, 115, 68, 113, -1, 117, -1, 119, -1, 123,
-1, 124, -1, 125, -1, 126, -1, 128, -1, 129,
-1, 130, -1, 131, -1, 132, -1, 138, -1, 139,
-1, 140, -1, 64, 65, -1, 64, 148, 65, -1,
116, -1, 118, 116, -1, 13, 120, 84, -1, 13,
120, 1, -1, 121, -1, 120, 68, 121, -1, 58,
-1, 58, 122, -1, 83, 113, -1, 84, -1, 115,
84, -1, 115, 1, -1, 19, 62, 115, 63, 116,
-1, 19, 62, 115, 63, 116, 23, 116, -1, 21,
116, 22, 62, 115, 63, -1, 22, 62, 115, 63,
116, -1, 11, 62, 127, 84, 127, 84, 127, 63,
116, -1, 11, 62, 13, 120, 84, 127, 84, 127,
63, 116, -1, 11, 62, 99, 24, 115, 63, 116,
-1, 11, 62, 13, 58, 24, 115, 63, 116, -1,
11, 62, 13, 58, 122, 24, 115, 63, 116, -1,
-1, 115, -1, 14, 84, -1, 14, 1, -1, 14,
58, 84, -1, 14, 58, 1, -1, 8, 84, -1,
8, 1, -1, 8, 58, 84, -1, 8, 58, 1,
-1, 16, 84, -1, 16, 1, -1, 16, 115, 84,
-1, 16, 115, 1, -1, 28, 62, 115, 63, 116,
-1, 27, 62, 115, 63, 133, -1, 64, 134, 65,
-1, 64, 134, 137, 134, 65, -1, -1, 135, -1,
136, -1, 135, 136, -1, 9, 115, 69, -1, 9,
115, 69, 118, -1, 10, 69, -1, 10, 69, 118,
-1, 58, 69, 116, -1, 30, 115, 84, -1, 30,
115, 1, -1, 31, 117, 141, -1, 31, 117, 142,
-1, 31, 117, 141, 142, -1, 32, 62, 58, 63,
117, -1, 33, 117, -1, 15, 58, 62, 63, 146,
-1, 15, 58, 62, 145, 63, 146, -1, 15, 62,
63, 146, -1, 15, 62, 145, 63, 146, -1, 58,
-1, 145, 68, 58, -1, 64, 65, -1, 64, 148,
65, -1, -1, 148, -1, 149, -1, 148, 149, -1,
116, -1, 143, -1
};
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
static const yytype_uint16 yyrline[] =
{
0, 169, 169, 170, 171, 172, 173, 174, 177, 184,
185, 186, 187, 188, 189, 190, 194, 195, 196, 200,
201, 206, 207, 211, 212, 216, 217, 222, 223, 224,
228, 229, 230, 231, 232, 236, 237, 241, 242, 243,
244, 248, 249, 253, 254, 258, 259, 263, 264, 265,
269, 270, 271, 272, 273, 274, 275, 276, 277, 278,
279, 280, 284, 285, 286, 287, 291, 292, 293, 297,
298, 299, 300, 304, 305, 307, 309, 311, 313, 315,
320, 321, 322, 323, 324, 328, 329, 333, 334, 338,
339, 343, 344, 349, 350, 355, 356, 361, 362, 367,
368, 369, 370, 371, 372, 373, 374, 375, 376, 377,
378, 382, 383, 387, 388, 389, 390, 391, 392, 393,
394, 395, 396, 397, 398, 399, 400, 404, 405, 409,
410, 414, 416, 426, 427, 432, 433, 437, 441, 445,
447, 455, 456, 461, 462, 463, 466, 469, 472, 475,
481, 482, 486, 487, 491, 492, 499, 500, 504, 505,
513, 514, 518, 519, 526, 531, 536, 537, 542, 543,
547, 548, 552, 553, 557, 558, 562, 567, 568, 572,
573, 574, 578, 582, 586, 587, 591, 592, 598, 599,
603, 605, 610, 612, 617, 618, 622, 623
};
#endif
#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", "NULLTOKEN", "TRUETOKEN", "FALSETOKEN",
"STRING", "NUMBER", "BREAK", "CASE", "DEFAULT", "FOR", "NEW", "VAR",
"CONTINUE", "FUNCTION", "RETURN", "VOID", "DELETE", "IF", "THIS", "DO",
"WHILE", "ELSE", "IN", "INSTANCEOF", "TYPEOF", "SWITCH", "WITH",
"RESERVED", "THROW", "TRY", "CATCH", "FINALLY", "EQEQ", "NE", "STREQ",
"STRNEQ", "LE", "GE", "OR", "AND", "PLUSPLUS", "MINUSMINUS", "LSHIFT",
"RSHIFT", "URSHIFT", "PLUSEQUAL", "MINUSEQUAL", "MULTEQUAL", "DIVEQUAL",
"LSHIFTEQUAL", "RSHIFTEQUAL", "URSHIFTEQUAL", "ANDEQUAL", "MODEQUAL",
"XOREQUAL", "OREQUAL", "IDENT", "AUTOPLUSPLUS", "AUTOMINUSMINUS", "'/'",
"'('", "')'", "'{'", "'}'", "'['", "']'", "','", "':'", "'.'", "'+'",
"'-'", "'~'", "'!'", "'*'", "'%'", "'<'", "'>'", "'&'", "'^'", "'|'",
"'?'", "'='", "';'", "$accept", "Literal", "PrimaryExpr", "ArrayLiteral",
"ElementList", "ElisionOpt", "Elision", "PropertyNameAndValueList",
"PropertyName", "MemberExpr", "NewExpr", "CallExpr", "Arguments",
"ArgumentList", "LeftHandSideExpr", "PostfixExpr", "UnaryExpr",
"MultiplicativeExpr", "AdditiveExpr", "ShiftExpr", "RelationalExpr",
"EqualityExpr", "BitwiseANDExpr", "BitwiseXORExpr", "BitwiseORExpr",
"LogicalANDExpr", "LogicalORExpr", "ConditionalExpr", "AssignmentExpr",
"AssignmentOperator", "Expr", "Statement", "Block", "StatementList",
"VariableStatement", "VariableDeclarationList", "VariableDeclaration",
"Initializer", "EmptyStatement", "ExprStatement", "IfStatement",
"IterationStatement", "ExprOpt", "ContinueStatement", "BreakStatement",
"ReturnStatement", "WithStatement", "SwitchStatement", "CaseBlock",
"CaseClausesOpt", "CaseClauses", "CaseClause", "DefaultClause",
"LabelledStatement", "ThrowStatement", "TryStatement", "Catch",
"Finally", "FunctionDeclaration", "FunctionExpr", "FormalParameterList",
"FunctionBody", "Program", "SourceElements", "SourceElement", 0
};
#endif
# 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, 306, 307, 308, 309, 310, 311, 312, 313, 314,
315, 47, 40, 41, 123, 125, 91, 93, 44, 58,
46, 43, 45, 126, 33, 42, 37, 60, 62, 38,
94, 124, 63, 61, 59
};
# endif
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_uint8 yyr1[] =
{
0, 85, 86, 86, 86, 86, 86, 86, 86, 87,
87, 87, 87, 87, 87, 87, 88, 88, 88, 89,
89, 90, 90, 91, 91, 92, 92, 93, 93, 93,
94, 94, 94, 94, 94, 95, 95, 96, 96, 96,
96, 97, 97, 98, 98, 99, 99, 100, 100, 100,
101, 101, 101, 101, 101, 101, 101, 101, 101, 101,
101, 101, 102, 102, 102, 102, 103, 103, 103, 104,
104, 104, 104, 105, 105, 105, 105, 105, 105, 105,
106, 106, 106, 106, 106, 107, 107, 108, 108, 109,
109, 110, 110, 111, 111, 112, 112, 113, 113, 114,
114, 114, 114, 114, 114, 114, 114, 114, 114, 114,
114, 115, 115, 116, 116, 116, 116, 116, 116, 116,
116, 116, 116, 116, 116, 116, 116, 117, 117, 118,
118, 119, 119, 120, 120, 121, 121, 122, 123, 124,
124, 125, 125, 126, 126, 126, 126, 126, 126, 126,
127, 127, 128, 128, 128, 128, 129, 129, 129, 129,
130, 130, 130, 130, 131, 132, 133, 133, 134, 134,
135, 135, 136, 136, 137, 137, 138, 139, 139, 140,
140, 140, 141, 142, 143, 143, 144, 144, 145, 145,
146, 146, 147, 147, 148, 148, 149, 149
};
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
static const yytype_uint8 yyr2[] =
{
0, 2, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 3, 2, 3, 3, 3, 5, 2,
4, 0, 1, 1, 2, 3, 5, 1, 1, 1,
1, 1, 4, 3, 3, 1, 2, 2, 2, 4,
3, 2, 3, 1, 3, 1, 1, 1, 2, 2,
1, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 1, 3, 3, 3, 1, 3, 3, 1,
3, 3, 3, 1, 3, 3, 3, 3, 3, 3,
1, 3, 3, 3, 3, 1, 3, 1, 3, 1,
3, 1, 3, 1, 3, 1, 5, 1, 3, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 3, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 2, 3, 1,
2, 3, 3, 1, 3, 1, 2, 2, 1, 2,
2, 5, 7, 6, 5, 9, 10, 7, 8, 9,
0, 1, 2, 2, 3, 3, 2, 2, 3, 3,
2, 2, 3, 3, 5, 5, 3, 5, 0, 1,
1, 2, 3, 4, 2, 3, 3, 3, 3, 3,
3, 4, 5, 2, 5, 6, 4, 5, 1, 3,
2, 3, 0, 1, 1, 2, 1, 1
};
/* 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[] =
{
192, 2, 3, 4, 6, 5, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 9, 0, 0, 0,
0, 0, 0, 0, 0, 0, 8, 10, 0, 0,
7, 0, 0, 21, 0, 0, 0, 0, 138, 11,
30, 12, 35, 45, 46, 47, 50, 62, 66, 69,
73, 80, 85, 87, 89, 91, 93, 95, 97, 111,
0, 196, 113, 114, 115, 116, 117, 118, 119, 120,
121, 122, 123, 124, 125, 126, 197, 31, 0, 193,
194, 157, 0, 156, 150, 0, 10, 0, 35, 36,
135, 0, 133, 153, 0, 152, 0, 0, 161, 160,
0, 47, 52, 51, 0, 0, 0, 53, 0, 0,
0, 0, 0, 54, 56, 0, 55, 57, 0, 6,
5, 10, 14, 0, 0, 0, 23, 0, 0, 22,
58, 59, 60, 61, 0, 0, 0, 37, 0, 0,
38, 48, 49, 100, 101, 102, 103, 104, 105, 106,
107, 110, 108, 109, 99, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
140, 0, 139, 1, 195, 159, 158, 0, 47, 151,
0, 28, 29, 27, 14, 34, 0, 136, 132, 0,
131, 155, 154, 0, 188, 0, 0, 163, 162, 0,
0, 0, 0, 0, 178, 177, 127, 0, 0, 179,
180, 176, 13, 15, 0, 0, 128, 17, 21, 16,
19, 24, 41, 0, 43, 0, 33, 0, 40, 98,
64, 63, 65, 67, 68, 70, 71, 72, 79, 78,
76, 77, 74, 75, 81, 82, 83, 84, 86, 88,
90, 92, 94, 0, 112, 135, 0, 0, 150, 137,
134, 0, 0, 0, 186, 0, 0, 0, 0, 0,
0, 0, 0, 183, 181, 0, 25, 0, 42, 0,
32, 39, 0, 0, 136, 150, 0, 0, 184, 0,
190, 0, 187, 189, 141, 0, 144, 168, 165, 164,
0, 0, 18, 20, 44, 96, 0, 0, 0, 0,
150, 185, 191, 0, 143, 0, 0, 169, 170, 0,
26, 0, 0, 150, 147, 0, 142, 0, 0, 166,
168, 171, 182, 148, 0, 0, 0, 172, 174, 0,
149, 0, 145, 129, 173, 175, 167, 146, 130
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int16 yydefgoto[] =
{
-1, 39, 40, 41, 127, 128, 129, 123, 124, 42,
43, 44, 137, 233, 45, 46, 47, 48, 49, 50,
51, 52, 53, 54, 55, 56, 57, 58, 59, 155,
60, 61, 62, 354, 63, 91, 92, 197, 64, 65,
66, 67, 190, 68, 69, 70, 71, 72, 308, 326,
327, 328, 340, 73, 74, 75, 219, 220, 76, 77,
206, 274, 78, 125, 80
};
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
#define YYPACT_NINF -253
static const yytype_int16 yypact[] =
{
730, -253, -253, -253, -253, -253, 5, -8, 227, 14,
6, -10, 118, 1203, 1203, 18, -253, 804, 41, 1203,
43, 81, 1203, 50, 1203, 1203, -253, 87, 1203, 1203,
-253, 1203, 360, 16, 1203, 1203, 1203, 1203, -253, -253,
-253, -253, -13, -253, -11, 98, -253, -253, -42, -31,
128, 93, 188, 84, 95, 102, 124, -16, -253, -253,
8, -253, -253, -253, -253, -253, -253, -253, -253, -253,
-253, -253, -253, -253, -253, -253, -253, -253, 193, 730,
-253, -253, 7, -253, 915, 145, -253, 21, -13, -253,
121, 9, -253, -253, 22, -253, 155, 4, -253, -253,
17, 85, -253, -253, 1203, 207, 1203, -253, 1203, 1203,
20, 434, 182, -253, -253, 804, -253, -253, -3, 181,
183, 87, 886, 48, 185, 508, -253, 160, 987, 187,
-253, -253, -253, -253, 1059, 1203, 195, -253, 1203, 198,
-253, -253, -253, -253, -253, -253, -253, -253, -253, -253,
-253, -253, -253, -253, -253, 1203, 1203, 1203, 1203, 1203,
1203, 1203, 1203, 1203, 1203, 1203, 1203, 1203, 1203, 1203,
1203, 1203, 1203, 1203, 1203, 1203, 1203, 1203, 1203, 1203,
-253, 1203, -253, -253, -253, -253, -253, 199, 1236, 197,
167, -253, -253, -253, -253, -253, 1203, -253, -253, 14,
-253, -253, -253, 11, -253, 202, 15, -253, -253, 19,
201, 52, 71, 74, -253, -253, -253, 205, 50, 228,
-253, -253, -253, -253, 38, 1203, -253, -253, 16, -253,
-253, -253, -253, 99, -253, 173, -253, 176, -253, -253,
-253, -253, -253, -42, -42, -31, -31, -31, 128, 128,
128, 128, 128, 128, 93, 93, 93, 93, 188, 84,
95, 102, 124, 203, -253, -12, -37, 1203, 1203, -253,
-253, 202, 131, 582, -253, 202, 212, 804, 1203, 804,
209, 804, 213, -253, -253, 210, -253, 1131, -253, 1203,
-253, -253, 1203, 1203, 250, 1203, 132, 192, -253, 202,
-253, 656, -253, -253, 255, 138, -253, 271, -253, -253,
218, 1203, -253, -253, -253, -253, 142, 1203, 206, 804,
1203, -253, -253, 804, -253, 1203, 29, 271, -253, 50,
-253, 804, 148, 1203, -253, 219, -253, 177, 214, -253,
271, -253, -253, -253, 804, 224, 804, 804, 804, 229,
-253, 804, -253, -253, 804, 804, -253, -253, -253
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int16 yypgoto[] =
{
-253, -253, -253, -253, -253, 64, -253, -253, 72, 287,
289, -253, -27, -253, 184, -253, 1, 89, 24, -57,
65, 125, 123, 127, 133, 122, -253, -253, -123, -253,
-9, -17, -22, -47, -253, 117, 106, 44, -253, -253,
-253, -253, -252, -253, -253, -253, -253, -253, -253, -28,
-253, -14, -253, -253, -253, -253, -253, 96, -253, -253,
114, -229, -253, 2, -75
};
/* 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 -128
static const yytype_int16 yytable[] =
{
105, 112, 79, 100, 184, 230, 81, 93, 185, 180,
198, 234, 293, 110, 102, 103, 297, 140, 207, 156,
107, 214, 118, 201, 178, 113, 114, 191, 192, 116,
117, 199, 239, 157, 158, 130, 131, 132, 133, 338,
159, 160, 298, 318, 191, 192, 302, 295, 96, 134,
184, 134, 97, 135, 84, 138, 263, 136, 264, 139,
222, 195, 204, 82, 94, 181, 179, 205, 335, 204,
321, 196, 90, 269, 271, 189, 181, 199, 275, 193,
104, 345, 277, 276, 126, 181, 194, 181, 181, 83,
95, 186, 182, 200, 339, 209, 193, 211, 221, 212,
213, 208, 286, 106, 215, 108, 202, 248, 249, 250,
251, 252, 253, 223, 111, 279, 224, 164, 165, 98,
181, 1, 2, 3, 4, 5, 235, 141, 142, 237,
8, 166, 167, 85, 280, 13, 14, 281, 16, 181,
141, 142, 181, 109, 19, 143, 144, 145, 146, 147,
148, 149, 150, 151, 152, 153, 115, 240, 241, 242,
24, 25, 288, 174, 313, 177, 314, 289, 26, 315,
168, 169, 161, 162, 163, 175, 86, 28, 29, 30,
31, 154, 87, 176, 33, 245, 246, 247, 330, 34,
35, 36, 37, 183, 299, 319, 283, 101, 101, 276,
181, 324, 99, 101, 196, 331, 181, 97, 101, 101,
181, 344, 101, 101, 217, 218, 181, 203, 101, 101,
101, 101, 170, 171, 172, 173, 184, 227, 228, 210,
1, 2, 3, 4, 5, 254, 255, 256, 257, 8,
290, 181, 85, 291, 181, 181, 347, 16, 243, 244,
-28, 268, -29, 236, 225, 231, 238, 265, 296, 189,
304, 218, 306, 278, 309, 181, 273, 282, 188, 305,
303, 310, 292, 307, 317, 301, 320, 26, 323, 311,
325, 329, 346, 348, 316, 86, 189, 351, 30, 31,
333, 87, 287, 33, 356, 88, 285, 89, 259, 258,
262, 355, 334, 260, 266, 270, 336, 342, 332, 294,
261, 189, 349, 341, 343, 284, 337, 272, 0, 0,
0, 0, 0, 0, 189, 0, 0, 350, 0, 352,
353, 353, 0, 0, 357, 0, 0, 358, 358, 0,
101, 101, 101, 101, 101, 101, 101, 101, 101, 101,
101, 101, 101, 101, 101, 101, 101, 101, 101, 101,
101, 101, 101, 1, 2, 3, 119, 120, 6, 0,
0, 7, 8, 9, 10, 11, 12, 13, 14, 15,
16, 17, 18, 0, 0, 0, 19, 20, 21, 0,
22, 23, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 24, 25, 0, 0, 0, 0, 0, 0,
26, 0, 0, 0, 0, 0, 0, 0, 121, 28,
29, 30, 31, 0, 32, 122, 33, 0, 0, 0,
0, 34, 35, 36, 37, 0, 0, 1, 2, 3,
4, 5, 6, 0, 38, 7, 8, 9, 10, 11,
12, 13, 14, 15, 16, 17, 18, 0, 0, 0,
19, 20, 21, 0, 22, 23, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 24, 25, 0, 0,
0, 0, 0, 0, 26, 0, 0, 0, 0, 0,
0, 0, 27, 28, 29, 30, 31, 0, 32, 216,
33, 0, 0, 0, 0, 34, 35, 36, 37, 0,
0, 1, 2, 3, 4, 5, 6, 0, 38, 7,
8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
18, 0, 0, 0, 19, 20, 21, 0, 22, 23,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
24, 25, 0, 0, 0, 0, 0, 0, 26, 0,
0, 0, 0, 0, 0, 0, 27, 28, 29, 30,
31, 0, 32, 226, 33, 0, 0, 0, 0, 34,
35, 36, 37, 0, 0, 1, 2, 3, 4, 5,
6, 0, 38, 7, 8, 9, 10, 11, 12, 13,
14, 15, 16, 17, 18, 0, 0, 0, 19, 20,
21, 0, 22, 23, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 24, 25, 0, 0, 0, 0,
0, 0, 26, 0, 0, 0, 0, 0, 0, 0,
27, 28, 29, 30, 31, 0, 32, 300, 33, 0,
0, 0, 0, 34, 35, 36, 37, 0, 0, 1,
2, 3, 4, 5, 6, 0, 38, 7, 8, 9,
10, 11, 12, 13, 14, 15, 16, 17, 18, 0,
0, 0, 19, 20, 21, 0, 22, 23, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 24, 25,
0, 0, 0, 0, 0, 0, 26, 0, 0, 0,
0, 0, 0, 0, 27, 28, 29, 30, 31, 0,
32, 322, 33, 0, 0, 0, 0, 34, 35, 36,
37, 0, 0, 1, 2, 3, 4, 5, 6, 0,
38, 7, 8, 9, 10, 11, 12, 13, 14, 15,
16, 17, 18, 0, 0, 0, 19, 20, 21, 0,
22, 23, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 24, 25, 0, 0, 0, 0, 0, 0,
26, 0, 0, 0, 0, 0, 0, 0, 27, 28,
29, 30, 31, 0, 32, 0, 33, 0, 0, 0,
0, 34, 35, 36, 37, 0, 0, 1, 2, 3,
4, 5, 6, 0, 38, 7, 8, 9, 10, 85,
12, 13, 14, 15, 16, 17, 18, 0, 0, 0,
19, 20, 21, 0, 22, 23, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 24, 25, 0, 0,
0, 0, 0, 0, 26, 0, 0, 0, 0, 0,
0, 0, 27, 28, 29, 30, 31, 0, 32, 0,
33, 0, 0, 0, 0, 34, 35, 36, 37, 0,
0, 0, 0, 0, 0, 0, -127, 0, 38, -127,
-127, -127, -127, -127, -127, -127, -127, -127, -127, -127,
-127, -127, -127, -127, -127, -127, -127, -127, -127, -127,
0, 0, -127, -127, -127, 0, -127, -127, 1, 2,
3, 4, 5, 0, 0, 0, 0, 8, 187, 0,
85, 0, 13, 14, 0, 16, 0, 0, 0, 0,
0, 19, 0, 0, -127, -127, -127, 0, 0, 0,
-127, -127, 0, 0, 0, 0, 0, 24, 25, -127,
-127, 0, 0, 0, 0, 26, 0, 0, 0, 0,
0, 0, 0, 86, 28, 29, 30, 31, 0, 87,
0, 33, 0, 0, 0, 0, 34, 35, 36, 37,
1, 2, 3, 4, 5, 0, 0, 0, 0, 8,
0, 0, 85, 0, 13, 14, 0, 16, 0, 0,
0, 0, 0, 19, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 24,
25, 0, 0, 0, 0, 0, 0, 26, 0, 0,
0, 0, 0, 0, 0, 86, 28, 29, 30, 31,
0, 87, 0, 33, 229, 0, 0, 0, 34, 35,
36, 37, 1, 2, 3, 4, 5, 0, 0, 0,
0, 8, 0, 0, 85, 0, 13, 14, 0, 16,
0, 0, 0, 0, 0, 19, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 24, 25, 0, 0, 0, 0, 0, 0, 26,
0, 0, 0, 0, 0, 0, 0, 86, 28, 29,
30, 31, 232, 87, 0, 33, 0, 0, 0, 0,
34, 35, 36, 37, 1, 2, 3, 4, 5, 0,
0, 0, 0, 8, 0, 0, 85, 0, 13, 14,
0, 16, 0, 0, 0, 0, 0, 19, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 24, 25, 0, 0, 0, 0, 0,
0, 26, 0, 0, 0, 0, 0, 0, 0, 86,
28, 29, 30, 31, 0, 87, 0, 33, 312, 0,
0, 0, 34, 35, 36, 37, 1, 2, 3, 4,
5, 0, 0, 0, 0, 8, 0, 0, 85, 0,
13, 14, 0, 16, 0, 0, 0, 0, 0, 19,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 24, 25, 0, 0, 0,
0, 0, 0, 26, 0, 0, 0, 0, 0, 0,
267, 86, 28, 29, 30, 31, 0, 87, 0, 33,
0, 0, 0, 0, 34, 35, 36, 37, 141, 142,
0, 0, 0, 143, 144, 145, 146, 147, 148, 149,
150, 151, 152, 153, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 154
};
static const yytype_int16 yycheck[] =
{
17, 23, 0, 12, 79, 128, 1, 1, 1, 1,
1, 134, 24, 22, 13, 14, 268, 44, 1, 61,
19, 1, 31, 1, 40, 24, 25, 6, 7, 28,
29, 68, 155, 75, 76, 34, 35, 36, 37, 10,
71, 72, 271, 295, 6, 7, 275, 84, 58, 62,
125, 62, 62, 66, 62, 66, 179, 70, 181, 70,
63, 88, 58, 58, 58, 68, 82, 63, 320, 58,
299, 83, 58, 196, 63, 84, 68, 68, 63, 58,
62, 333, 63, 68, 68, 68, 65, 68, 68, 84,
84, 84, 84, 84, 65, 104, 58, 106, 115, 108,
109, 84, 225, 62, 84, 62, 84, 164, 165, 166,
167, 168, 169, 65, 64, 63, 68, 24, 25, 1,
68, 3, 4, 5, 6, 7, 135, 42, 43, 138,
12, 38, 39, 15, 63, 17, 18, 63, 20, 68,
42, 43, 68, 62, 26, 47, 48, 49, 50, 51,
52, 53, 54, 55, 56, 57, 69, 156, 157, 158,
42, 43, 63, 79, 287, 41, 289, 68, 50, 292,
77, 78, 44, 45, 46, 80, 58, 59, 60, 61,
62, 83, 64, 81, 66, 161, 162, 163, 311, 71,
72, 73, 74, 0, 63, 63, 218, 13, 14, 68,
68, 63, 84, 19, 83, 63, 68, 62, 24, 25,
68, 63, 28, 29, 32, 33, 68, 62, 34, 35,
36, 37, 34, 35, 36, 37, 301, 67, 68, 22,
3, 4, 5, 6, 7, 170, 171, 172, 173, 12,
67, 68, 15, 67, 68, 68, 69, 20, 159, 160,
69, 84, 69, 58, 69, 68, 58, 58, 267, 268,
277, 33, 279, 62, 281, 68, 64, 62, 84, 278,
58, 58, 69, 64, 24, 273, 84, 50, 23, 69,
9, 63, 63, 69, 293, 58, 295, 63, 61, 62,
84, 64, 228, 66, 65, 8, 224, 8, 175, 174,
178, 348, 319, 176, 187, 199, 323, 329, 317, 265,
177, 320, 340, 327, 331, 219, 325, 203, -1, -1,
-1, -1, -1, -1, 333, -1, -1, 344, -1, 346,
347, 348, -1, -1, 351, -1, -1, 354, 355, -1,
156, 157, 158, 159, 160, 161, 162, 163, 164, 165,
166, 167, 168, 169, 170, 171, 172, 173, 174, 175,
176, 177, 178, 3, 4, 5, 6, 7, 8, -1,
-1, 11, 12, 13, 14, 15, 16, 17, 18, 19,
20, 21, 22, -1, -1, -1, 26, 27, 28, -1,
30, 31, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, 42, 43, -1, -1, -1, -1, -1, -1,
50, -1, -1, -1, -1, -1, -1, -1, 58, 59,
60, 61, 62, -1, 64, 65, 66, -1, -1, -1,
-1, 71, 72, 73, 74, -1, -1, 3, 4, 5,
6, 7, 8, -1, 84, 11, 12, 13, 14, 15,
16, 17, 18, 19, 20, 21, 22, -1, -1, -1,
26, 27, 28, -1, 30, 31, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, 42, 43, -1, -1,
-1, -1, -1, -1, 50, -1, -1, -1, -1, -1,
-1, -1, 58, 59, 60, 61, 62, -1, 64, 65,
66, -1, -1, -1, -1, 71, 72, 73, 74, -1,
-1, 3, 4, 5, 6, 7, 8, -1, 84, 11,
12, 13, 14, 15, 16, 17, 18, 19, 20, 21,
22, -1, -1, -1, 26, 27, 28, -1, 30, 31,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
42, 43, -1, -1, -1, -1, -1, -1, 50, -1,
-1, -1, -1, -1, -1, -1, 58, 59, 60, 61,
62, -1, 64, 65, 66, -1, -1, -1, -1, 71,
72, 73, 74, -1, -1, 3, 4, 5, 6, 7,
8, -1, 84, 11, 12, 13, 14, 15, 16, 17,
18, 19, 20, 21, 22, -1, -1, -1, 26, 27,
28, -1, 30, 31, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 42, 43, -1, -1, -1, -1,
-1, -1, 50, -1, -1, -1, -1, -1, -1, -1,
58, 59, 60, 61, 62, -1, 64, 65, 66, -1,
-1, -1, -1, 71, 72, 73, 74, -1, -1, 3,
4, 5, 6, 7, 8, -1, 84, 11, 12, 13,
14, 15, 16, 17, 18, 19, 20, 21, 22, -1,
-1, -1, 26, 27, 28, -1, 30, 31, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, 42, 43,
-1, -1, -1, -1, -1, -1, 50, -1, -1, -1,
-1, -1, -1, -1, 58, 59, 60, 61, 62, -1,
64, 65, 66, -1, -1, -1, -1, 71, 72, 73,
74, -1, -1, 3, 4, 5, 6, 7, 8, -1,
84, 11, 12, 13, 14, 15, 16, 17, 18, 19,
20, 21, 22, -1, -1, -1, 26, 27, 28, -1,
30, 31, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, 42, 43, -1, -1, -1, -1, -1, -1,
50, -1, -1, -1, -1, -1, -1, -1, 58, 59,
60, 61, 62, -1, 64, -1, 66, -1, -1, -1,
-1, 71, 72, 73, 74, -1, -1, 3, 4, 5,
6, 7, 8, -1, 84, 11, 12, 13, 14, 15,
16, 17, 18, 19, 20, 21, 22, -1, -1, -1,
26, 27, 28, -1, 30, 31, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, 42, 43, -1, -1,
-1, -1, -1, -1, 50, -1, -1, -1, -1, -1,
-1, -1, 58, 59, 60, 61, 62, -1, 64, -1,
66, -1, -1, -1, -1, 71, 72, 73, 74, -1,
-1, -1, -1, -1, -1, -1, 0, -1, 84, 3,
4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
-1, -1, 26, 27, 28, -1, 30, 31, 3, 4,
5, 6, 7, -1, -1, -1, -1, 12, 13, -1,
15, -1, 17, 18, -1, 20, -1, -1, -1, -1,
-1, 26, -1, -1, 58, 59, 60, -1, -1, -1,
64, 65, -1, -1, -1, -1, -1, 42, 43, 73,
74, -1, -1, -1, -1, 50, -1, -1, -1, -1,
-1, -1, -1, 58, 59, 60, 61, 62, -1, 64,
-1, 66, -1, -1, -1, -1, 71, 72, 73, 74,
3, 4, 5, 6, 7, -1, -1, -1, -1, 12,
-1, -1, 15, -1, 17, 18, -1, 20, -1, -1,
-1, -1, -1, 26, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 42,
43, -1, -1, -1, -1, -1, -1, 50, -1, -1,
-1, -1, -1, -1, -1, 58, 59, 60, 61, 62,
-1, 64, -1, 66, 67, -1, -1, -1, 71, 72,
73, 74, 3, 4, 5, 6, 7, -1, -1, -1,
-1, 12, -1, -1, 15, -1, 17, 18, -1, 20,
-1, -1, -1, -1, -1, 26, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, 42, 43, -1, -1, -1, -1, -1, -1, 50,
-1, -1, -1, -1, -1, -1, -1, 58, 59, 60,
61, 62, 63, 64, -1, 66, -1, -1, -1, -1,
71, 72, 73, 74, 3, 4, 5, 6, 7, -1,
-1, -1, -1, 12, -1, -1, 15, -1, 17, 18,
-1, 20, -1, -1, -1, -1, -1, 26, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, 42, 43, -1, -1, -1, -1, -1,
-1, 50, -1, -1, -1, -1, -1, -1, -1, 58,
59, 60, 61, 62, -1, 64, -1, 66, 67, -1,
-1, -1, 71, 72, 73, 74, 3, 4, 5, 6,
7, -1, -1, -1, -1, 12, -1, -1, 15, -1,
17, 18, -1, 20, -1, -1, -1, -1, -1, 26,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, 42, 43, -1, -1, -1,
-1, -1, -1, 50, -1, -1, -1, -1, -1, -1,
24, 58, 59, 60, 61, 62, -1, 64, -1, 66,
-1, -1, -1, -1, 71, 72, 73, 74, 42, 43,
-1, -1, -1, 47, 48, 49, 50, 51, 52, 53,
54, 55, 56, 57, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 83
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 3, 4, 5, 6, 7, 8, 11, 12, 13,
14, 15, 16, 17, 18, 19, 20, 21, 22, 26,
27, 28, 30, 31, 42, 43, 50, 58, 59, 60,
61, 62, 64, 66, 71, 72, 73, 74, 84, 86,
87, 88, 94, 95, 96, 99, 100, 101, 102, 103,
104, 105, 106, 107, 108, 109, 110, 111, 112, 113,
115, 116, 117, 119, 123, 124, 125, 126, 128, 129,
130, 131, 132, 138, 139, 140, 143, 144, 147, 148,
149, 1, 58, 84, 62, 15, 58, 64, 94, 95,
58, 120, 121, 1, 58, 84, 58, 62, 1, 84,
115, 99, 101, 101, 62, 116, 62, 101, 62, 62,
115, 64, 117, 101, 101, 69, 101, 101, 115, 6,
7, 58, 65, 92, 93, 148, 68, 89, 90, 91,
101, 101, 101, 101, 62, 66, 70, 97, 66, 70,
97, 42, 43, 47, 48, 49, 50, 51, 52, 53,
54, 55, 56, 57, 83, 114, 61, 75, 76, 71,
72, 44, 45, 46, 24, 25, 38, 39, 77, 78,
34, 35, 36, 37, 79, 80, 81, 41, 40, 82,
1, 68, 84, 0, 149, 1, 84, 13, 99, 115,
127, 6, 7, 58, 65, 97, 83, 122, 1, 68,
84, 1, 84, 62, 58, 63, 145, 1, 84, 115,
22, 115, 115, 115, 1, 84, 65, 32, 33, 141,
142, 116, 63, 65, 68, 69, 65, 67, 68, 67,
113, 68, 63, 98, 113, 115, 58, 115, 58, 113,
101, 101, 101, 102, 102, 103, 103, 103, 104, 104,
104, 104, 104, 104, 105, 105, 105, 105, 106, 107,
108, 109, 110, 113, 113, 58, 120, 24, 84, 113,
121, 63, 145, 64, 146, 63, 68, 63, 62, 63,
63, 63, 62, 117, 142, 93, 113, 90, 63, 68,
67, 67, 69, 24, 122, 84, 115, 127, 146, 63,
65, 148, 146, 58, 116, 115, 116, 64, 133, 116,
58, 69, 67, 113, 113, 113, 115, 24, 127, 63,
84, 146, 65, 23, 63, 9, 134, 135, 136, 63,
113, 63, 115, 84, 116, 127, 116, 115, 10, 65,
137, 136, 117, 116, 63, 127, 63, 69, 69, 134,
116, 63, 116, 116, 118, 118, 65, 116, 116
};
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY (-2)
#define YYEOF 0
#define YYACCEPT goto yyacceptlab
#define YYABORT goto yyabortlab
#define YYERROR goto 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) \
do \
if (yychar == YYEMPTY && yylen == 1) \
{ \
yychar = (Token); \
yylval = (Value); \
yytoken = YYTRANSLATE (yychar); \
YYPOPSTACK (1); \
goto yybackup; \
} \
else \
{ \
yyerror (YY_("syntax error: cannot back up")); \
YYERROR; \
} \
while (YYID (0))
#define YYTERROR 1
#define YYERRCODE 256
/* 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
/* 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
/* YYLEX -- calling `yylex' with the right arguments. */
#ifdef YYLEX_PARAM
# define YYLEX yylex (YYLEX_PARAM)
#else
# define YYLEX yylex ()
#endif
/* Enable debugging if requested. */
#if YYDEBUG
# ifndef YYFPRINTF
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
# define YYFPRINTF fprintf
# endif
# define YYDPRINTF(Args) \
do { \
if (yydebug) \
YYFPRINTF Args; \
} while (YYID (0))
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, \
Type, Value, Location); \
YYFPRINTF (stderr, "\n"); \
} \
} while (YYID (0))
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
/*ARGSUSED*/
#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, YYLTYPE const * const yylocationp)
#else
static void
yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp)
FILE *yyoutput;
int yytype;
YYSTYPE const * const yyvaluep;
YYLTYPE const * const yylocationp;
#endif
{
if (!yyvaluep)
return;
YYUSE (yylocationp);
# ifdef YYPRINT
if (yytype < YYNTOKENS)
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# else
YYUSE (yyoutput);
# endif
switch (yytype)
{
default:
break;
}
}
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp)
#else
static void
yy_symbol_print (yyoutput, yytype, yyvaluep, yylocationp)
FILE *yyoutput;
int yytype;
YYSTYPE const * const yyvaluep;
YYLTYPE const * const yylocationp;
#endif
{
if (yytype < YYNTOKENS)
YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
else
YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
YY_LOCATION_PRINT (yyoutput, *yylocationp);
YYFPRINTF (yyoutput, ": ");
yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp);
YYFPRINTF (yyoutput, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
#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, YYLTYPE *yylsp, int yyrule)
#else
static void
yy_reduce_print (yyvsp, yylsp, yyrule)
YYSTYPE *yyvsp;
YYLTYPE *yylsp;
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);
/* The symbols being reduced. */
for (yyi = 0; yyi < yynrhs; yyi++)
{
fprintf (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
&(yyvsp[(yyi + 1) - (yynrhs)])
, &(yylsp[(yyi + 1) - (yynrhs)]) );
fprintf (stderr, "\n");
}
}
# define YY_REDUCE_PRINT(Rule) \
do { \
if (yydebug) \
yy_reduce_print (yyvsp, yylsp, Rule); \
} while (YYID (0))
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !YYDEBUG */
/* YYINITDEPTH -- initial size of the parser's stacks. */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
#endif
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
if the built-in stack extension method is used).
Do not make this value too large; the results are undefined if
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
#if YYERROR_VERBOSE
# ifndef yystrlen
# if defined __GLIBC__ && defined _STRING_H
# define yystrlen strlen
# else
/* Return the length of YYSTR. */
#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
{
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;
while ((*yyd++ = *yys++) != '\0')
continue;
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)
{
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;
/* Fall through. */
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];
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;
/* Stay within bounds of both yycheck and yytname. */
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 /* YYERROR_VERBOSE */
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
/*ARGSUSED*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep, YYLTYPE *yylocationp)
#else
static void
yydestruct (yymsg, yytype, yyvaluep, yylocationp)
const char *yymsg;
int yytype;
YYSTYPE *yyvaluep;
YYLTYPE *yylocationp;
#endif
{
YYUSE (yyvaluep);
YYUSE (yylocationp);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
switch (yytype)
{
default:
break;
}
}
/* Prevent warnings from -Wmissing-prototypes. */
#ifdef YYPARSE_PARAM
#if defined __STDC__ || defined __cplusplus
int yyparse (void *YYPARSE_PARAM);
#else
int yyparse ();
#endif
#else /* ! YYPARSE_PARAM */
#if defined __STDC__ || defined __cplusplus
int yyparse (void);
#else
int yyparse ();
#endif
#endif /* ! YYPARSE_PARAM */
/* The look-ahead symbol. */
int yychar;
/* The semantic value of the look-ahead symbol. */
YYSTYPE yylval;
/* Number of syntax errors so far. */
int yynerrs;
/* Location data for the look-ahead symbol. */
YYLTYPE yylloc;
/*----------.
| yyparse. |
`----------*/
#ifdef YYPARSE_PARAM
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
int
yyparse (void *YYPARSE_PARAM)
#else
int
yyparse (YYPARSE_PARAM)
void *YYPARSE_PARAM;
#endif
#else /* ! YYPARSE_PARAM */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
int
yyparse (void)
#else
int
yyparse ()
#endif
#endif
{
int yystate;
int yyn;
int yyresult;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* Look-ahead token as an internal (translated) token number. */
int yytoken = 0;
#if YYERROR_VERBOSE
/* Buffer for error messages, and its allocated size. */
char yymsgbuf[128];
char *yymsg = yymsgbuf;
YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
#endif
/* Three stacks and their tools:
`yyss': related to states,
`yyvs': related to semantic values,
`yyls': related to locations.
Refer to the stacks thru separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* The state stack. */
yytype_int16 yyssa[YYINITDEPTH];
yytype_int16 *yyss = yyssa;
yytype_int16 *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs = yyvsa;
YYSTYPE *yyvsp;
/* The location stack. */
YYLTYPE yylsa[YYINITDEPTH];
YYLTYPE *yyls = yylsa;
YYLTYPE *yylsp;
/* The locations where the error started and ended. */
YYLTYPE yyerror_range[2];
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N), yylsp -= (N))
YYSIZE_T yystacksize = YYINITDEPTH;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
YYLTYPE yyloc;
/* 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;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
/* Initialize stack pointers.
Waste one element of value and location stack
so that they stay on the same level as the state stack.
The wasted elements are never initialized. */
yyssp = yyss;
yyvsp = yyvs;
yylsp = yyls;
#if YYLTYPE_IS_TRIVIAL
/* Initialize the default location before parsing starts. */
yylloc.first_line = yylloc.last_line = 1;
yylloc.first_column = yylloc.last_column = 0;
#endif
goto yysetstate;
/*------------------------------------------------------------.
| yynewstate -- Push a new state, which is found in yystate. |
`------------------------------------------------------------*/
yynewstate:
/* In all cases, when you get here, the value and location stacks
have just been pushed. So pushing a state here evens the stacks. */
yyssp++;
yysetstate:
*yyssp = yystate;
if (yyss + yystacksize - 1 <= yyssp)
{
/* Get the current used size of the three stacks, in elements. */
YYSIZE_T yysize = yyssp - yyss + 1;
#ifdef yyoverflow
{
/* Give user a chance to reallocate the stack. Use copies of
these so that the &'s don't force the real ones into
memory. */
YYSTYPE *yyvs1 = yyvs;
yytype_int16 *yyss1 = yyss;
YYLTYPE *yyls1 = yyls;
/* 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),
&yyls1, yysize * sizeof (*yylsp),
&yystacksize);
yyls = yyls1;
yyss = yyss1;
yyvs = yyvs1;
}
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
goto yyexhaustedlab;
# else
/* Extend the stack our own way. */
if (YYMAXDEPTH <= yystacksize)
goto yyexhaustedlab;
yystacksize *= 2;
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
{
yytype_int16 *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyexhaustedlab;
YYSTACK_RELOCATE (yyss);
YYSTACK_RELOCATE (yyvs);
YYSTACK_RELOCATE (yyls);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
#endif /* no yyoverflow */
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
yylsp = yyls + yysize - 1;
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long int) yystacksize));
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
goto 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. */
/* First try to decide what to do without reference to look-ahead token. */
yyn = yypact[yystate];
if (yyn == YYPACT_NINF)
goto yydefault;
/* Not known => get a look-ahead token if don't already have one. */
/* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
yychar = YYLEX;
}
if (yychar <= YYEOF)
{
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
}
/* 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];
if (yyn <= 0)
{
if (yyn == 0 || yyn == YYTABLE_NINF)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
if (yyn == YYFINAL)
YYACCEPT;
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
/* Shift the look-ahead token. */
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
/* Discard the shifted token unless it is eof. */
if (yychar != YYEOF)
yychar = YYEMPTY;
yystate = yyn;
*++yyvsp = yylval;
*++yylsp = yylloc;
goto yynewstate;
/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state. |
`-----------------------------------------------------------*/
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
goto yyreduce;
/*-----------------------------.
| yyreduce -- Do a reduction. |
`-----------------------------*/
yyreduce:
/* yyn is the number of a rule to reduce with. */
yylen = yyr2[yyn];
/* If YYLEN is nonzero, implement the default value of the action:
`$$ = $1'.
Otherwise, the following line sets YYVAL to 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];
/* Default location. */
YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 2:
#line 169 "grammar.y"
{ (yyval.node) = new NullNode(); }
break;
case 3:
#line 170 "grammar.y"
{ (yyval.node) = new BooleanNode(true); }
break;
case 4:
#line 171 "grammar.y"
{ (yyval.node) = new BooleanNode(false); }
break;
case 5:
#line 172 "grammar.y"
{ (yyval.node) = new NumberNode((yyvsp[(1) - (1)].dval)); }
break;
case 6:
#line 173 "grammar.y"
{ (yyval.node) = new StringNode((yyvsp[(1) - (1)].ustr)); }
break;
case 7:
#line 174 "grammar.y"
{ Lexer *l = Lexer::curr();
if (!l->scanRegExp()) YYABORT;
(yyval.node) = new RegExpNode(l->pattern,l->flags);}
break;
case 8:
#line 178 "grammar.y"
{ Lexer *l = Lexer::curr();
if (!l->scanRegExp()) YYABORT;
(yyval.node) = new RegExpNode(UString('=')+l->pattern,l->flags);}
break;
case 9:
#line 184 "grammar.y"
{ (yyval.node) = new ThisNode(); }
break;
case 10:
#line 185 "grammar.y"
{ (yyval.node) = new ResolveNode(*(yyvsp[(1) - (1)].ident)); }
break;
case 13:
#line 188 "grammar.y"
{ (yyval.node) = new GroupNode((yyvsp[(2) - (3)].node)); }
break;
case 14:
#line 189 "grammar.y"
{ (yyval.node) = new ObjectLiteralNode(); }
break;
case 15:
#line 190 "grammar.y"
{ (yyval.node) = new ObjectLiteralNode((yyvsp[(2) - (3)].plist)); }
break;
case 16:
#line 194 "grammar.y"
{ (yyval.node) = new ArrayNode((yyvsp[(2) - (3)].ival)); }
break;
case 17:
#line 195 "grammar.y"
{ (yyval.node) = new ArrayNode((yyvsp[(2) - (3)].elm)); }
break;
case 18:
#line 196 "grammar.y"
{ (yyval.node) = new ArrayNode((yyvsp[(4) - (5)].ival), (yyvsp[(2) - (5)].elm)); }
break;
case 19:
#line 200 "grammar.y"
{ (yyval.elm) = new ElementNode((yyvsp[(1) - (2)].ival), (yyvsp[(2) - (2)].node)); }
break;
case 20:
#line 202 "grammar.y"
{ (yyval.elm) = new ElementNode((yyvsp[(1) - (4)].elm), (yyvsp[(3) - (4)].ival), (yyvsp[(4) - (4)].node)); }
break;
case 21:
#line 206 "grammar.y"
{ (yyval.ival) = 0; }
break;
case 23:
#line 211 "grammar.y"
{ (yyval.ival) = 1; }
break;
case 24:
#line 212 "grammar.y"
{ (yyval.ival) = (yyvsp[(1) - (2)].ival) + 1; }
break;
case 25:
#line 216 "grammar.y"
{ (yyval.plist) = new PropertyValueNode((yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].node)); }
break;
case 26:
#line 218 "grammar.y"
{ (yyval.plist) = new PropertyValueNode((yyvsp[(3) - (5)].pnode), (yyvsp[(5) - (5)].node), (yyvsp[(1) - (5)].plist)); }
break;
case 27:
#line 222 "grammar.y"
{ (yyval.pnode) = new PropertyNode(*(yyvsp[(1) - (1)].ident)); }
break;
case 28:
#line 223 "grammar.y"
{ (yyval.pnode) = new PropertyNode(Identifier(*(yyvsp[(1) - (1)].ustr))); }
break;
case 29:
#line 224 "grammar.y"
{ (yyval.pnode) = new PropertyNode((yyvsp[(1) - (1)].dval)); }
break;
case 32:
#line 230 "grammar.y"
{ (yyval.node) = new AccessorNode1((yyvsp[(1) - (4)].node), (yyvsp[(3) - (4)].node)); }
break;
case 33:
#line 231 "grammar.y"
{ (yyval.node) = new AccessorNode2((yyvsp[(1) - (3)].node), *(yyvsp[(3) - (3)].ident)); }
break;
case 34:
#line 232 "grammar.y"
{ (yyval.node) = new NewExprNode((yyvsp[(2) - (3)].node), (yyvsp[(3) - (3)].args)); }
break;
case 36:
#line 237 "grammar.y"
{ (yyval.node) = new NewExprNode((yyvsp[(2) - (2)].node)); }
break;
case 37:
#line 241 "grammar.y"
{ (yyval.node) = new FunctionCallNode((yyvsp[(1) - (2)].node), (yyvsp[(2) - (2)].args)); }
break;
case 38:
#line 242 "grammar.y"
{ (yyval.node) = new FunctionCallNode((yyvsp[(1) - (2)].node), (yyvsp[(2) - (2)].args)); }
break;
case 39:
#line 243 "grammar.y"
{ (yyval.node) = new AccessorNode1((yyvsp[(1) - (4)].node), (yyvsp[(3) - (4)].node)); }
break;
case 40:
#line 244 "grammar.y"
{ (yyval.node) = new AccessorNode2((yyvsp[(1) - (3)].node), *(yyvsp[(3) - (3)].ident)); }
break;
case 41:
#line 248 "grammar.y"
{ (yyval.args) = new ArgumentsNode(); }
break;
case 42:
#line 249 "grammar.y"
{ (yyval.args) = new ArgumentsNode((yyvsp[(2) - (3)].alist)); }
break;
case 43:
#line 253 "grammar.y"
{ (yyval.alist) = new ArgumentListNode((yyvsp[(1) - (1)].node)); }
break;
case 44:
#line 254 "grammar.y"
{ (yyval.alist) = new ArgumentListNode((yyvsp[(1) - (3)].alist), (yyvsp[(3) - (3)].node)); }
break;
case 48:
#line 264 "grammar.y"
{ (yyval.node) = new PostfixNode((yyvsp[(1) - (2)].node), OpPlusPlus); }
break;
case 49:
#line 265 "grammar.y"
{ (yyval.node) = new PostfixNode((yyvsp[(1) - (2)].node), OpMinusMinus); }
break;
case 51:
#line 270 "grammar.y"
{ (yyval.node) = new DeleteNode((yyvsp[(2) - (2)].node)); }
break;
case 52:
#line 271 "grammar.y"
{ (yyval.node) = new VoidNode((yyvsp[(2) - (2)].node)); }
break;
case 53:
#line 272 "grammar.y"
{ (yyval.node) = new TypeOfNode((yyvsp[(2) - (2)].node)); }
break;
case 54:
#line 273 "grammar.y"
{ (yyval.node) = new PrefixNode(OpPlusPlus, (yyvsp[(2) - (2)].node)); }
break;
case 55:
#line 274 "grammar.y"
{ (yyval.node) = new PrefixNode(OpPlusPlus, (yyvsp[(2) - (2)].node)); }
break;
case 56:
#line 275 "grammar.y"
{ (yyval.node) = new PrefixNode(OpMinusMinus, (yyvsp[(2) - (2)].node)); }
break;
case 57:
#line 276 "grammar.y"
{ (yyval.node) = new PrefixNode(OpMinusMinus, (yyvsp[(2) - (2)].node)); }
break;
case 58:
#line 277 "grammar.y"
{ (yyval.node) = new UnaryPlusNode((yyvsp[(2) - (2)].node)); }
break;
case 59:
#line 278 "grammar.y"
{ (yyval.node) = new NegateNode((yyvsp[(2) - (2)].node)); }
break;
case 60:
#line 279 "grammar.y"
{ (yyval.node) = new BitwiseNotNode((yyvsp[(2) - (2)].node)); }
break;
case 61:
#line 280 "grammar.y"
{ (yyval.node) = new LogicalNotNode((yyvsp[(2) - (2)].node)); }
break;
case 63:
#line 285 "grammar.y"
{ (yyval.node) = new MultNode((yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), '*'); }
break;
case 64:
#line 286 "grammar.y"
{ (yyval.node) = new MultNode((yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), '/'); }
break;
case 65:
#line 287 "grammar.y"
{ (yyval.node) = new MultNode((yyvsp[(1) - (3)].node),(yyvsp[(3) - (3)].node),'%'); }
break;
case 67:
#line 292 "grammar.y"
{ (yyval.node) = new AddNode((yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), '+'); }
break;
case 68:
#line 293 "grammar.y"
{ (yyval.node) = new AddNode((yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node), '-'); }
break;
case 70:
#line 298 "grammar.y"
{ (yyval.node) = new ShiftNode((yyvsp[(1) - (3)].node), OpLShift, (yyvsp[(3) - (3)].node)); }
break;
case 71:
#line 299 "grammar.y"
{ (yyval.node) = new ShiftNode((yyvsp[(1) - (3)].node), OpRShift, (yyvsp[(3) - (3)].node)); }
break;
case 72:
#line 300 "grammar.y"
{ (yyval.node) = new ShiftNode((yyvsp[(1) - (3)].node), OpURShift, (yyvsp[(3) - (3)].node)); }
break;
case 74:
#line 306 "grammar.y"
{ (yyval.node) = new RelationalNode((yyvsp[(1) - (3)].node), OpLess, (yyvsp[(3) - (3)].node)); }
break;
case 75:
#line 308 "grammar.y"
{ (yyval.node) = new RelationalNode((yyvsp[(1) - (3)].node), OpGreater, (yyvsp[(3) - (3)].node)); }
break;
case 76:
#line 310 "grammar.y"
{ (yyval.node) = new RelationalNode((yyvsp[(1) - (3)].node), OpLessEq, (yyvsp[(3) - (3)].node)); }
break;
case 77:
#line 312 "grammar.y"
{ (yyval.node) = new RelationalNode((yyvsp[(1) - (3)].node), OpGreaterEq, (yyvsp[(3) - (3)].node)); }
break;
case 78:
#line 314 "grammar.y"
{ (yyval.node) = new RelationalNode((yyvsp[(1) - (3)].node), OpInstanceOf, (yyvsp[(3) - (3)].node)); }
break;
case 79:
#line 316 "grammar.y"
{ (yyval.node) = new RelationalNode((yyvsp[(1) - (3)].node), OpIn, (yyvsp[(3) - (3)].node)); }
break;
case 81:
#line 321 "grammar.y"
{ (yyval.node) = new EqualNode((yyvsp[(1) - (3)].node), OpEqEq, (yyvsp[(3) - (3)].node)); }
break;
case 82:
#line 322 "grammar.y"
{ (yyval.node) = new EqualNode((yyvsp[(1) - (3)].node), OpNotEq, (yyvsp[(3) - (3)].node)); }
break;
case 83:
#line 323 "grammar.y"
{ (yyval.node) = new EqualNode((yyvsp[(1) - (3)].node), OpStrEq, (yyvsp[(3) - (3)].node)); }
break;
case 84:
#line 324 "grammar.y"
{ (yyval.node) = new EqualNode((yyvsp[(1) - (3)].node), OpStrNEq, (yyvsp[(3) - (3)].node));}
break;
case 86:
#line 329 "grammar.y"
{ (yyval.node) = new BitOperNode((yyvsp[(1) - (3)].node), OpBitAnd, (yyvsp[(3) - (3)].node)); }
break;
case 88:
#line 334 "grammar.y"
{ (yyval.node) = new BitOperNode((yyvsp[(1) - (3)].node), OpBitXOr, (yyvsp[(3) - (3)].node)); }
break;
case 90:
#line 339 "grammar.y"
{ (yyval.node) = new BitOperNode((yyvsp[(1) - (3)].node), OpBitOr, (yyvsp[(3) - (3)].node)); }
break;
case 92:
#line 345 "grammar.y"
{ (yyval.node) = new BinaryLogicalNode((yyvsp[(1) - (3)].node), OpAnd, (yyvsp[(3) - (3)].node)); }
break;
case 94:
#line 351 "grammar.y"
{ (yyval.node) = new BinaryLogicalNode((yyvsp[(1) - (3)].node), OpOr, (yyvsp[(3) - (3)].node)); }
break;
case 96:
#line 357 "grammar.y"
{ (yyval.node) = new ConditionalNode((yyvsp[(1) - (5)].node), (yyvsp[(3) - (5)].node), (yyvsp[(5) - (5)].node)); }
break;
case 98:
#line 363 "grammar.y"
{ (yyval.node) = new AssignNode((yyvsp[(1) - (3)].node), (yyvsp[(2) - (3)].op), (yyvsp[(3) - (3)].node));}
break;
case 99:
#line 367 "grammar.y"
{ (yyval.op) = OpEqual; }
break;
case 100:
#line 368 "grammar.y"
{ (yyval.op) = OpPlusEq; }
break;
case 101:
#line 369 "grammar.y"
{ (yyval.op) = OpMinusEq; }
break;
case 102:
#line 370 "grammar.y"
{ (yyval.op) = OpMultEq; }
break;
case 103:
#line 371 "grammar.y"
{ (yyval.op) = OpDivEq; }
break;
case 104:
#line 372 "grammar.y"
{ (yyval.op) = OpLShift; }
break;
case 105:
#line 373 "grammar.y"
{ (yyval.op) = OpRShift; }
break;
case 106:
#line 374 "grammar.y"
{ (yyval.op) = OpURShift; }
break;
case 107:
#line 375 "grammar.y"
{ (yyval.op) = OpAndEq; }
break;
case 108:
#line 376 "grammar.y"
{ (yyval.op) = OpXOrEq; }
break;
case 109:
#line 377 "grammar.y"
{ (yyval.op) = OpOrEq; }
break;
case 110:
#line 378 "grammar.y"
{ (yyval.op) = OpModEq; }
break;
case 112:
#line 383 "grammar.y"
{ (yyval.node) = new CommaNode((yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node)); }
break;
case 127:
#line 404 "grammar.y"
{ (yyval.stat) = new BlockNode(0); DBG((yyval.stat), (yylsp[(2) - (2)]), (yylsp[(2) - (2)])); }
break;
case 128:
#line 405 "grammar.y"
{ (yyval.stat) = new BlockNode((yyvsp[(2) - (3)].srcs)); DBG((yyval.stat), (yylsp[(3) - (3)]), (yylsp[(3) - (3)])); }
break;
case 129:
#line 409 "grammar.y"
{ (yyval.slist) = new StatListNode((yyvsp[(1) - (1)].stat)); }
break;
case 130:
#line 410 "grammar.y"
{ (yyval.slist) = new StatListNode((yyvsp[(1) - (2)].slist), (yyvsp[(2) - (2)].stat)); }
break;
case 131:
#line 414 "grammar.y"
{ (yyval.stat) = new VarStatementNode((yyvsp[(2) - (3)].vlist));
DBG((yyval.stat), (yylsp[(1) - (3)]), (yylsp[(3) - (3)])); }
break;
case 132:
#line 416 "grammar.y"
{ if (automatic()) {
(yyval.stat) = new VarStatementNode((yyvsp[(2) - (3)].vlist));
DBG((yyval.stat), (yylsp[(1) - (3)]), (yylsp[(2) - (3)]));
} else {
YYABORT;
}
}
break;
case 133:
#line 426 "grammar.y"
{ (yyval.vlist) = new VarDeclListNode((yyvsp[(1) - (1)].decl)); }
break;
case 134:
#line 428 "grammar.y"
{ (yyval.vlist) = new VarDeclListNode((yyvsp[(1) - (3)].vlist), (yyvsp[(3) - (3)].decl)); }
break;
case 135:
#line 432 "grammar.y"
{ (yyval.decl) = new VarDeclNode(*(yyvsp[(1) - (1)].ident), 0); }
break;
case 136:
#line 433 "grammar.y"
{ (yyval.decl) = new VarDeclNode(*(yyvsp[(1) - (2)].ident), (yyvsp[(2) - (2)].init)); }
break;
case 137:
#line 437 "grammar.y"
{ (yyval.init) = new AssignExprNode((yyvsp[(2) - (2)].node)); }
break;
case 138:
#line 441 "grammar.y"
{ (yyval.stat) = new EmptyStatementNode(); }
break;
case 139:
#line 445 "grammar.y"
{ (yyval.stat) = new ExprStatementNode((yyvsp[(1) - (2)].node));
DBG((yyval.stat), (yylsp[(1) - (2)]), (yylsp[(2) - (2)])); }
break;
case 140:
#line 447 "grammar.y"
{ if (automatic()) {
(yyval.stat) = new ExprStatementNode((yyvsp[(1) - (2)].node));
DBG((yyval.stat), (yylsp[(1) - (2)]), (yylsp[(1) - (2)]));
} else
YYABORT; }
break;
case 141:
#line 455 "grammar.y"
{ (yyval.stat) = new IfNode((yyvsp[(3) - (5)].node),(yyvsp[(5) - (5)].stat),0);DBG((yyval.stat),(yylsp[(1) - (5)]),(yylsp[(4) - (5)])); }
break;
case 142:
#line 457 "grammar.y"
{ (yyval.stat) = new IfNode((yyvsp[(3) - (7)].node),(yyvsp[(5) - (7)].stat),(yyvsp[(7) - (7)].stat));DBG((yyval.stat),(yylsp[(1) - (7)]),(yylsp[(4) - (7)])); }
break;
case 143:
#line 461 "grammar.y"
{ (yyval.stat)=new DoWhileNode((yyvsp[(2) - (6)].stat),(yyvsp[(5) - (6)].node));DBG((yyval.stat),(yylsp[(1) - (6)]),(yylsp[(3) - (6)]));}
break;
case 144:
#line 462 "grammar.y"
{ (yyval.stat) = new WhileNode((yyvsp[(3) - (5)].node),(yyvsp[(5) - (5)].stat));DBG((yyval.stat),(yylsp[(1) - (5)]),(yylsp[(4) - (5)])); }
break;
case 145:
#line 464 "grammar.y"
{ (yyval.stat) = new ForNode((yyvsp[(3) - (9)].node),(yyvsp[(5) - (9)].node),(yyvsp[(7) - (9)].node),(yyvsp[(9) - (9)].stat));
DBG((yyval.stat),(yylsp[(1) - (9)]),(yylsp[(8) - (9)])); }
break;
case 146:
#line 467 "grammar.y"
{ (yyval.stat) = new ForNode((yyvsp[(4) - (10)].vlist),(yyvsp[(6) - (10)].node),(yyvsp[(8) - (10)].node),(yyvsp[(10) - (10)].stat));
DBG((yyval.stat),(yylsp[(1) - (10)]),(yylsp[(9) - (10)])); }
break;
case 147:
#line 470 "grammar.y"
{ (yyval.stat) = new ForInNode((yyvsp[(3) - (7)].node), (yyvsp[(5) - (7)].node), (yyvsp[(7) - (7)].stat));
DBG((yyval.stat),(yylsp[(1) - (7)]),(yylsp[(6) - (7)])); }
break;
case 148:
#line 473 "grammar.y"
{ (yyval.stat) = new ForInNode(*(yyvsp[(4) - (8)].ident),0,(yyvsp[(6) - (8)].node),(yyvsp[(8) - (8)].stat));
DBG((yyval.stat),(yylsp[(1) - (8)]),(yylsp[(7) - (8)])); }
break;
case 149:
#line 476 "grammar.y"
{ (yyval.stat) = new ForInNode(*(yyvsp[(4) - (9)].ident),(yyvsp[(5) - (9)].init),(yyvsp[(7) - (9)].node),(yyvsp[(9) - (9)].stat));
DBG((yyval.stat),(yylsp[(1) - (9)]),(yylsp[(8) - (9)])); }
break;
case 150:
#line 481 "grammar.y"
{ (yyval.node) = 0; }
break;
case 152:
#line 486 "grammar.y"
{ (yyval.stat) = new ContinueNode(); DBG((yyval.stat),(yylsp[(1) - (2)]),(yylsp[(2) - (2)])); }
break;
case 153:
#line 487 "grammar.y"
{ if (automatic()) {
(yyval.stat) = new ContinueNode(); DBG((yyval.stat),(yylsp[(1) - (2)]),(yylsp[(1) - (2)]));
} else
YYABORT; }
break;
case 154:
#line 491 "grammar.y"
{ (yyval.stat) = new ContinueNode(*(yyvsp[(2) - (3)].ident)); DBG((yyval.stat),(yylsp[(1) - (3)]),(yylsp[(3) - (3)])); }
break;
case 155:
#line 492 "grammar.y"
{ if (automatic()) {
(yyval.stat) = new ContinueNode(*(yyvsp[(2) - (3)].ident));DBG((yyval.stat),(yylsp[(1) - (3)]),(yylsp[(2) - (3)]));
} else
YYABORT; }
break;
case 156:
#line 499 "grammar.y"
{ (yyval.stat) = new BreakNode();DBG((yyval.stat),(yylsp[(1) - (2)]),(yylsp[(2) - (2)])); }
break;
case 157:
#line 500 "grammar.y"
{ if (automatic()) {
(yyval.stat) = new BreakNode(); DBG((yyval.stat),(yylsp[(1) - (2)]),(yylsp[(1) - (2)]));
} else
YYABORT; }
break;
case 158:
#line 504 "grammar.y"
{ (yyval.stat) = new BreakNode(*(yyvsp[(2) - (3)].ident)); DBG((yyval.stat),(yylsp[(1) - (3)]),(yylsp[(3) - (3)])); }
break;
case 159:
#line 505 "grammar.y"
{ if (automatic()) {
(yyval.stat) = new BreakNode(*(yyvsp[(2) - (3)].ident)); DBG((yyval.stat),(yylsp[(1) - (3)]),(yylsp[(2) - (3)]));
} else
YYABORT;
}
break;
case 160:
#line 513 "grammar.y"
{ (yyval.stat) = new ReturnNode(0); DBG((yyval.stat),(yylsp[(1) - (2)]),(yylsp[(2) - (2)])); }
break;
case 161:
#line 514 "grammar.y"
{ if (automatic()) {
(yyval.stat) = new ReturnNode(0); DBG((yyval.stat),(yylsp[(1) - (2)]),(yylsp[(1) - (2)]));
} else
YYABORT; }
break;
case 162:
#line 518 "grammar.y"
{ (yyval.stat) = new ReturnNode((yyvsp[(2) - (3)].node)); DBG((yyval.stat),(yylsp[(1) - (3)]),(yylsp[(3) - (3)])); }
break;
case 163:
#line 519 "grammar.y"
{ if (automatic()) {
(yyval.stat) = new ReturnNode((yyvsp[(2) - (3)].node)); DBG((yyval.stat),(yylsp[(1) - (3)]),(yylsp[(2) - (3)]));
} else
YYABORT; }
break;
case 164:
#line 526 "grammar.y"
{ (yyval.stat) = new WithNode((yyvsp[(3) - (5)].node),(yyvsp[(5) - (5)].stat));
DBG((yyval.stat), (yylsp[(1) - (5)]), (yylsp[(4) - (5)])); }
break;
case 165:
#line 531 "grammar.y"
{ (yyval.stat) = new SwitchNode((yyvsp[(3) - (5)].node), (yyvsp[(5) - (5)].cblk));
DBG((yyval.stat), (yylsp[(1) - (5)]), (yylsp[(4) - (5)])); }
break;
case 166:
#line 536 "grammar.y"
{ (yyval.cblk) = new CaseBlockNode((yyvsp[(2) - (3)].clist), 0, 0); }
break;
case 167:
#line 538 "grammar.y"
{ (yyval.cblk) = new CaseBlockNode((yyvsp[(2) - (5)].clist), (yyvsp[(3) - (5)].ccl), (yyvsp[(4) - (5)].clist)); }
break;
case 168:
#line 542 "grammar.y"
{ (yyval.clist) = 0; }
break;
case 170:
#line 547 "grammar.y"
{ (yyval.clist) = new ClauseListNode((yyvsp[(1) - (1)].ccl)); }
break;
case 171:
#line 548 "grammar.y"
{ (yyval.clist) = new ClauseListNode((yyvsp[(1) - (2)].clist), (yyvsp[(2) - (2)].ccl)); }
break;
case 172:
#line 552 "grammar.y"
{ (yyval.ccl) = new CaseClauseNode((yyvsp[(2) - (3)].node)); }
break;
case 173:
#line 553 "grammar.y"
{ (yyval.ccl) = new CaseClauseNode((yyvsp[(2) - (4)].node), (yyvsp[(4) - (4)].slist)); }
break;
case 174:
#line 557 "grammar.y"
{ (yyval.ccl) = new CaseClauseNode(0); }
break;
case 175:
#line 558 "grammar.y"
{ (yyval.ccl) = new CaseClauseNode(0, (yyvsp[(3) - (3)].slist)); }
break;
case 176:
#line 562 "grammar.y"
{ (yyvsp[(3) - (3)].stat)->pushLabel(*(yyvsp[(1) - (3)].ident));
(yyval.stat) = new LabelNode(*(yyvsp[(1) - (3)].ident), (yyvsp[(3) - (3)].stat)); }
break;
case 177:
#line 567 "grammar.y"
{ (yyval.stat) = new ThrowNode((yyvsp[(2) - (3)].node)); DBG((yyval.stat),(yylsp[(1) - (3)]),(yylsp[(3) - (3)])); }
break;
case 178:
#line 568 "grammar.y"
{ if (automatic()) { (yyval.stat) = new ThrowNode((yyvsp[(2) - (3)].node)); DBG((yyval.stat),(yylsp[(1) - (3)]),(yylsp[(2) - (3)])); } else YYABORT; }
break;
case 179:
#line 572 "grammar.y"
{ (yyval.stat) = new TryNode((yyvsp[(2) - (3)].stat), (yyvsp[(3) - (3)].cnode)); DBG((yyval.stat),(yylsp[(1) - (3)]),(yylsp[(2) - (3)])); }
break;
case 180:
#line 573 "grammar.y"
{ (yyval.stat) = new TryNode((yyvsp[(2) - (3)].stat), (yyvsp[(3) - (3)].fnode)); DBG((yyval.stat),(yylsp[(1) - (3)]),(yylsp[(2) - (3)])); }
break;
case 181:
#line 574 "grammar.y"
{ (yyval.stat) = new TryNode((yyvsp[(2) - (4)].stat), (yyvsp[(3) - (4)].cnode), (yyvsp[(4) - (4)].fnode)); DBG((yyval.stat),(yylsp[(1) - (4)]),(yylsp[(2) - (4)])); }
break;
case 182:
#line 578 "grammar.y"
{ (yyval.cnode) = new CatchNode(*(yyvsp[(3) - (5)].ident), (yyvsp[(5) - (5)].stat)); }
break;
case 183:
#line 582 "grammar.y"
{ (yyval.fnode) = new FinallyNode((yyvsp[(2) - (2)].stat)); }
break;
case 184:
#line 586 "grammar.y"
{ (yyval.func) = new FuncDeclNode(*(yyvsp[(2) - (5)].ident), (yyvsp[(5) - (5)].body)); }
break;
case 185:
#line 588 "grammar.y"
{ (yyval.func) = new FuncDeclNode(*(yyvsp[(2) - (6)].ident), (yyvsp[(4) - (6)].param), (yyvsp[(6) - (6)].body)); }
break;
case 186:
#line 591 "grammar.y"
{ (yyval.node) = new FuncExprNode((yyvsp[(4) - (4)].body)); }
break;
case 187:
#line 593 "grammar.y"
{ (yyval.node) = new FuncExprNode((yyvsp[(3) - (5)].param), (yyvsp[(5) - (5)].body)); }
break;
case 188:
#line 598 "grammar.y"
{ (yyval.param) = new ParameterNode(*(yyvsp[(1) - (1)].ident)); }
break;
case 189:
#line 599 "grammar.y"
{ (yyval.param) = new ParameterNode((yyvsp[(1) - (3)].param), *(yyvsp[(3) - (3)].ident)); }
break;
case 190:
#line 603 "grammar.y"
{ (yyval.body) = new FunctionBodyNode(0);
DBG((yyval.body), (yylsp[(1) - (2)]), (yylsp[(2) - (2)]));}
break;
case 191:
#line 605 "grammar.y"
{ (yyval.body) = new FunctionBodyNode((yyvsp[(2) - (3)].srcs));
DBG((yyval.body), (yylsp[(1) - (3)]), (yylsp[(3) - (3)]));}
break;
case 192:
#line 610 "grammar.y"
{ (yyval.prog) = new ProgramNode(0);
Parser::accept((yyval.prog)); }
break;
case 193:
#line 612 "grammar.y"
{ (yyval.prog) = new ProgramNode((yyvsp[(1) - (1)].srcs));
Parser::accept((yyval.prog)); }
break;
case 194:
#line 617 "grammar.y"
{ (yyval.srcs) = new SourceElementsNode((yyvsp[(1) - (1)].stat)); }
break;
case 195:
#line 618 "grammar.y"
{ (yyval.srcs) = new SourceElementsNode((yyvsp[(1) - (2)].srcs), (yyvsp[(2) - (2)].stat)); }
break;
case 196:
#line 622 "grammar.y"
{ (yyval.stat) = (yyvsp[(1) - (1)].stat); }
break;
case 197:
#line 623 "grammar.y"
{ (yyval.stat) = (yyvsp[(1) - (1)].func); }
break;
/* Line 1267 of yacc.c. */
#line 2926 "grammar.cpp"
default: break;
}
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
*++yyvsp = yyval;
*++yylsp = yyloc;
/* 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 - YYNTOKENS] + *yyssp;
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTOKENS];
goto yynewstate;
/*------------------------------------.
| yyerrlab -- here on detecting error |
`------------------------------------*/
yyerrlab:
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
#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
}
yyerror_range[0] = yylloc;
if (yyerrstatus == 3)
{
/* If just tried and failed to reuse look-ahead token after an
error, discard it. */
if (yychar <= YYEOF)
{
/* Return failure if at end of input. */
if (yychar == YYEOF)
YYABORT;
}
else
{
yydestruct ("Error: discarding",
yytoken, &yylval, &yylloc);
yychar = YYEMPTY;
}
}
/* Else will try to reuse look-ahead token after shifting the error
token. */
goto yyerrlab1;
/*---------------------------------------------------.
| 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 (/*CONSTCOND*/ 0)
goto yyerrorlab;
yyerror_range[0] = yylsp[1-yylen];
/* 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;
/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR. |
`-------------------------------------------------------------*/
yyerrlab1:
yyerrstatus = 3; /* Each real token shifted decrements this. */
for (;;)
{
yyn = yypact[yystate];
if (yyn != YYPACT_NINF)
{
yyn += YYTERROR;
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
{
yyn = yytable[yyn];
if (0 < yyn)
break;
}
}
/* Pop the current state because it cannot handle the error token. */
if (yyssp == yyss)
YYABORT;
yyerror_range[0] = *yylsp;
yydestruct ("Error: popping",
yystos[yystate], yyvsp, yylsp);
YYPOPSTACK (1);
yystate = *yyssp;
YY_STACK_PRINT (yyss, yyssp);
}
if (yyn == YYFINAL)
YYACCEPT;
*++yyvsp = yylval;
yyerror_range[1] = yylloc;
/* Using YYLLOC is tempting, but would change the location of
the look-ahead. YYLOC is available though. */
YYLLOC_DEFAULT (yyloc, (yyerror_range - 1), 2);
*++yylsp = yyloc;
/* Shift the error token. */
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| 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;
/* Fall through. */
#endif
yyreturn:
if (yychar != YYEOF && yychar != YYEMPTY)
yydestruct ("Cleanup: discarding lookahead",
yytoken, &yylval, &yylloc);
/* 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)
{
yydestruct ("Cleanup: popping",
yystos[*yyssp], yyvsp, yylsp);
YYPOPSTACK (1);
}
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
#if YYERROR_VERBOSE
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
#endif
/* Make sure YYID is used. */
return YYID (yyresult);
}
#line 626 "grammar.y"
int yyerror (const char * /* s */) /* Called by yyparse on error */
{
// fprintf(stderr, "ERROR: %s at line %d\n",
// s, KJS::Lexer::curr()->lineNo());
return 1;
}
/* may we automatically insert a semicolon ? */
bool automatic()
{
if (yychar == '}' || yychar == 0)
return true;
else if (Lexer::curr()->prevTerminator())
return true;
return false;
}
See more files for this project here