|
version 1.31, 2002/01/25 13:48:55
|
version 1.161, 2015/04/06 22:31:01
|
|
Line 1
|
Line 1
|
| |
/* A Bison parser, made by GNU Bison 2.5. */ |
| |
|
| /* A Bison parser, made from compile.y |
/* Bison implementation for Yacc-like parsers in C |
| by GNU Bison version 1.28 */ |
|
| |
Copyright (C) 1984, 1989-1990, 2000-2011 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 3 of the License, 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, see <http://www.gnu.org/licenses/>. */ |
| |
|
| |
/* 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.5" |
| |
|
| |
/* Skeleton name. */ |
| |
#define YYSKELETON_NAME "yacc.c" |
| |
|
| |
/* Pure parsers. */ |
| |
#define YYPURE 1 |
| |
|
| |
/* Push parsers. */ |
| |
#define YYPUSH 0 |
| |
|
| #define YYBISON 1 /* Identify Bison output. */ |
/* Pull parsers. */ |
| |
#define YYPULL 1 |
| |
|
| #define EON 257 |
/* Using locations. */ |
| #define STRING 258 |
#define YYLSP_NEEDED 0 |
| #define BOGUS 259 |
|
| #define BAD_STRING_COMPARISON_OPERATOR 260 |
|
| #define BAD_HEX_LITERAL 261 |
|
| #define BAD_METHOD_DECL_START 262 |
|
| #define LAND 263 |
|
| #define LOR 264 |
|
| #define LXOR 265 |
|
| #define NLE 266 |
|
| #define NGE 267 |
|
| #define NEQ 268 |
|
| #define NNE 269 |
|
| #define SLT 270 |
|
| #define SGT 271 |
|
| #define SLE 272 |
|
| #define SGE 273 |
|
| #define SEQ 274 |
|
| #define SNE 275 |
|
| #define DEF 276 |
|
| #define IN 277 |
|
| #define FEXISTS 278 |
|
| #define DEXISTS 279 |
|
| #define IS 280 |
|
| #define NEG 281 |
|
| |
|
| |
|
| |
|
| |
/* Copy the first part of user declarations. */ |
| |
|
| |
/* Line 268 of yacc.c */ |
| #line 1 "compile.y" |
#line 1 "compile.y" |
| |
|
| /** @file |
/** @file |
| Parser: compiler(lexical parser and grammar). |
Parser: compiler(lexical parser and grammar). |
| |
|
| Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com) |
Copyright (c) 2001-2012 Art. Lebedev Studio (http://www.artlebedev.com) |
| Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf) |
Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf) |
| |
|
| $Id$ |
|
| */ |
*/ |
| |
|
| |
volatile const char * IDENT_COMPILE_Y = "$Id$"; |
| |
|
| /** |
/** |
| @todo parser4: |
@todo parser4: |
| - cache compiled code from request to request. to do that... |
- cache compiled code from request to request. to do that... |
|
Line 52
|
Line 90
|
| -#: in iis make up specialized Pool object for that |
-#: in iis make up specialized Pool object for that |
| */ |
*/ |
| |
|
| #define YYSTYPE Array/*<Operation>*/ * |
#define YYSTYPE ArrayOperation* |
| #define YYPARSE_PARAM pc |
#define YYPARSE_PARAM pc |
| #define YYLEX_PARAM pc |
#define YYLEX_PARAM pc |
| #define YYDEBUG 1 |
#define YYDEBUG 1 |
| #define YYERROR_VERBOSE 1 |
#define YYERROR_VERBOSE 1 |
| #define yyerror(msg) real_yyerror((parse_control *)pc, msg) |
#define yyerror(msg) real_yyerror((Parse_control *)pc, msg) |
| #define YYPRINT(file, type, value) yyprint(file, type, value) |
#define YYPRINT(file, type, value) yyprint(file, type, value) |
| |
#define YYMALLOC pa_malloc |
| |
#define YYFREE pa_free |
| |
|
| |
// includes |
| |
|
| #include "compile_tools.h" |
#include "compile_tools.h" |
| #include "pa_value.h" |
#include "pa_value.h" |
|
Line 66
|
Line 108
|
| #include "pa_vobject.h" |
#include "pa_vobject.h" |
| #include "pa_vdouble.h" |
#include "pa_vdouble.h" |
| #include "pa_globals.h" |
#include "pa_globals.h" |
| #include "pa_vvoid.h" |
#include "pa_vmethod_frame.h" |
| |
|
| #define SELF_ELEMENT_NAME "self" |
// defines |
| #define USE_CONTROL_METHOD_NAME "USE" |
|
| |
|
| static int real_yyerror(parse_control *pc, char *s); |
|
| static void yyprint(FILE *file, int type, YYSTYPE value); |
|
| static int yylex(YYSTYPE *lvalp, void *pc); |
|
| |
|
| |
#define USE_CONTROL_METHOD_NAME "USE" |
| |
#define OPTIONS_CONTROL_METHOD_NAME "OPTIONS" |
| |
#define OPTION_ALL_VARS_LOCAL_NAME "locals" |
| |
#define OPTION_PARTIAL_CLASS "partial" |
| |
#define REM_OPERATOR_NAME "rem" |
| |
|
| |
// forwards |
| |
|
| |
static int real_yyerror(Parse_control* pc, const char* s); |
| |
static void yyprint(FILE* file, int type, YYSTYPE value); |
| |
static int yylex(YYSTYPE* lvalp, void* pc); |
| |
|
| |
static const VBool vfalse(false); |
| |
static const VBool vtrue(true); |
| |
static const VString vempty; |
| |
|
| // local convinient inplace typecast & var |
// local convinient inplace typecast & var |
| #define PC (*(parse_control *)pc) |
#undef PC |
| |
#define PC (*(Parse_control *)pc) |
| |
#undef POOL |
| #define POOL (*PC.pool) |
#define POOL (*PC.pool) |
| #undef NEW |
|
| #define NEW new(POOL) |
|
| #ifndef DOXYGEN |
#ifndef DOXYGEN |
| #ifndef YYSTYPE |
|
| #define YYSTYPE int |
|
| #endif |
|
| #include <stdio.h> |
|
| |
|
| #ifndef __cplusplus |
#define CLASS_ADD if(PC.class_add()){ \ |
| #ifndef __STDC__ |
strncpy(PC.error, PC.cclass->name().cstr(), MAX_STRING/2); \ |
| #define const |
strcat(PC.error, " - class is already defined"); \ |
| |
YYERROR; \ |
| |
} |
| |
|
| |
|
| |
|
| |
/* Line 268 of yacc.c */ |
| |
#line 148 "compile.tab.C" |
| |
|
| |
/* Enabling traces. */ |
| |
#ifndef YYDEBUG |
| |
# define YYDEBUG 0 |
| #endif |
#endif |
| |
|
| |
/* Enabling verbose error messages. */ |
| |
#ifdef YYERROR_VERBOSE |
| |
# undef YYERROR_VERBOSE |
| |
# define YYERROR_VERBOSE 1 |
| |
#else |
| |
# define YYERROR_VERBOSE 0 |
| #endif |
#endif |
| |
|
| |
/* Enabling the token table. */ |
| |
#ifndef YYTOKEN_TABLE |
| |
# define YYTOKEN_TABLE 0 |
| |
#endif |
| |
|
| |
|
| |
/* Tokens. */ |
| |
#ifndef YYTOKENTYPE |
| |
# define YYTOKENTYPE |
| |
/* Put the tokens into the symbol table, so that GDB and other debuggers |
| |
know about them. */ |
| |
enum yytokentype { |
| |
EON = 258, |
| |
STRING = 259, |
| |
BOGUS = 260, |
| |
BAD_STRING_COMPARISON_OPERATOR = 261, |
| |
BAD_HEX_LITERAL = 262, |
| |
BAD_METHOD_DECL_START = 263, |
| |
BAD_METHOD_PARAMETER_NAME_CHARACTER = 264, |
| |
BAD_NONWHITESPACE_CHARACTER_IN_EXPLICIT_RESULT_MODE = 265, |
| |
LAND = 266, |
| |
LOR = 267, |
| |
LXOR = 268, |
| |
NXOR = 269, |
| |
NLE = 270, |
| |
NGE = 271, |
| |
NEQ = 272, |
| |
NNE = 273, |
| |
NSL = 274, |
| |
NSR = 275, |
| |
SLT = 276, |
| |
SGT = 277, |
| |
SLE = 278, |
| |
SGE = 279, |
| |
SEQ = 280, |
| |
SNE = 281, |
| |
DEF = 282, |
| |
IN = 283, |
| |
FEXISTS = 284, |
| |
DEXISTS = 285, |
| |
IS = 286, |
| |
LITERAL_TRUE = 287, |
| |
LITERAL_FALSE = 288, |
| |
NUNARY = 289 |
| |
}; |
| |
#endif |
| |
|
| |
|
| |
|
| |
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED |
| |
typedef int YYSTYPE; |
| |
# define YYSTYPE_IS_TRIVIAL 1 |
| |
# define yystype YYSTYPE /* obsolescent; will be withdrawn */ |
| |
# define YYSTYPE_IS_DECLARED 1 |
| |
#endif |
| |
|
| |
|
| |
/* Copy the second part of user declarations. */ |
| |
|
| |
|
| |
/* Line 343 of yacc.c */ |
| |
#line 224 "compile.tab.C" |
| |
|
| |
#ifdef short |
| |
# undef short |
| |
#endif |
| |
|
| #define YYFINAL 248 |
#ifdef YYTYPE_UINT8 |
| #define YYFLAG -32768 |
typedef YYTYPE_UINT8 yytype_uint8; |
| #define YYNTBASE 56 |
#else |
| |
typedef unsigned char yytype_uint8; |
| #define YYTRANSLATE(x) ((unsigned)(x) <= 281 ? yytranslate[x] : 135) |
#endif |
| |
|
| static const char yytranslate[] = { 0, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 42, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 29, 54, 30, 46, 38, 32, 55, 50, |
|
| 51, 36, 35, 2, 34, 49, 37, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 53, 45, 27, |
|
| 2, 28, 2, 41, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 43, 39, 44, 52, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 47, 31, 48, 33, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
|
| 2, 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, |
|
| 40 |
|
| }; |
|
| |
|
| #if YYDEBUG != 0 |
#ifdef YYTYPE_INT8 |
| static const short yyprhs[] = { 0, |
typedef YYTYPE_INT8 yytype_int8; |
| 0, 2, 4, 6, 9, 11, 13, 15, 20, 22, |
#elif (defined __STDC__ || defined __C99__FUNC__ \ |
| 24, 26, 29, 32, 34, 36, 44, 46, 48, 52, |
|| defined __cplusplus || defined _MSC_VER) |
| 54, 56, 58, 62, 64, 66, 68, 70, 72, 75, |
typedef signed char yytype_int8; |
| 77, 79, 81, 83, 85, 87, 90, 93, 95, 99, |
#else |
| 101, 103, 105, 108, 110, 113, 117, 119, 121, 123, |
typedef short int yytype_int8; |
| 125, 128, 131, 133, 135, 137, 141, 145, 149, 151, |
#endif |
| 153, 155, 157, 159, 161, 164, 166, 167, 168, 175, |
|
| 177, 179, 182, 184, 186, 188, 192, 196, 200, 202, |
|
| 206, 208, 212, 214, 218, 220, 222, 224, 226, 228, |
|
| 230, 232, 234, 237, 239, 242, 245, 247, 249, 252, |
|
| 254, 256, 258, 260, 263, 266, 270, 272, 274, 277, |
|
| 280, 282, 284, 287, 290, 292, 294, 296, 298, 302, |
|
| 306, 310, 313, 316, 319, 322, 325, 328, 331, 334, |
|
| 338, 342, 346, 350, 354, 358, 362, 366, 370, 374, |
|
| 378, 382, 386, 390, 394, 398, 402, 406, 410, 414, |
|
| 418, 422, 426, 430, 434, 436, 438, 439 |
|
| }; |
|
| |
|
| static const short yyrhs[] = { 58, |
#ifdef YYTYPE_UINT16 |
| 0, 57, 0, 59, 0, 57, 59, 0, 71, 0, |
typedef YYTYPE_UINT16 yytype_uint16; |
| 60, 0, 65, 0, 41, 4, 42, 61, 0, 134, |
#else |
| 0, 62, 0, 63, 0, 62, 63, 0, 64, 42, |
typedef unsigned short int yytype_uint16; |
| 0, 134, 0, 4, 0, 41, 4, 67, 66, 70, |
#endif |
| 42, 71, 0, 134, 0, 67, 0, 43, 68, 44, |
|
| 0, 134, 0, 69, 0, 4, 0, 69, 45, 4, |
|
| 0, 134, 0, 4, 0, 134, 0, 72, 0, 73, |
|
| 0, 72, 73, 0, 132, 0, 74, 0, 75, 0, |
|
| 83, 0, 96, 0, 76, 0, 46, 77, 0, 79, |
|
| 3, 0, 78, 0, 47, 79, 48, 0, 80, 0, |
|
| 81, 0, 82, 0, 126, 82, 0, 118, 0, 115, |
|
| 118, 0, 46, 84, 88, 0, 85, 0, 86, 0, |
|
| 87, 0, 114, 0, 49, 114, 0, 126, 114, 0, |
|
| 89, 0, 90, 0, 91, 0, 43, 92, 44, 0, |
|
| 50, 129, 51, 0, 47, 71, 48, 0, 133, 0, |
|
| 4, 0, 93, 0, 94, 0, 95, 0, 74, 0, |
|
| 73, 72, 0, 97, 0, 0, 0, 52, 98, 100, |
|
| 99, 101, 3, 0, 79, 0, 102, 0, 101, 102, |
|
| 0, 103, 0, 104, 0, 105, 0, 43, 106, 44, |
|
| 0, 50, 107, 51, 0, 47, 108, 48, 0, 109, |
|
| 0, 106, 45, 109, 0, 110, 0, 107, 45, 110, |
|
| 0, 111, 0, 108, 45, 111, 0, 112, 0, 113, |
|
| 0, 71, 0, 133, 0, 4, 0, 93, 0, 129, |
|
| 0, 119, 0, 115, 119, 0, 116, 0, 115, 116, |
|
| 0, 117, 49, 0, 119, 0, 119, 0, 4, 5, |
|
| 0, 4, 0, 120, 0, 121, 0, 122, 0, 46, |
|
| 123, 0, 4, 124, 0, 43, 72, 44, 0, 4, |
|
| 0, 125, 0, 124, 125, 0, 46, 123, 0, 127, |
|
| 0, 128, 0, 4, 53, 0, 127, 53, 0, 130, |
|
| 0, 4, 0, 76, 0, 97, 0, 54, 131, 54, |
|
| 0, 55, 131, 55, 0, 50, 130, 51, 0, 34, |
|
| 130, 0, 35, 130, 0, 33, 130, 0, 29, 130, |
|
| 0, 22, 130, 0, 23, 130, 0, 24, 130, 0, |
|
| 25, 130, 0, 130, 34, 130, 0, 130, 35, 130, |
|
| 0, 130, 36, 130, 0, 130, 37, 130, 0, 130, |
|
| 38, 130, 0, 130, 39, 130, 0, 130, 32, 130, |
|
| 0, 130, 31, 130, 0, 130, 30, 130, 0, 130, |
|
| 9, 130, 0, 130, 10, 130, 0, 130, 11, 130, |
|
| 0, 130, 27, 130, 0, 130, 28, 130, 0, 130, |
|
| 12, 130, 0, 130, 13, 130, 0, 130, 14, 130, |
|
| 0, 130, 15, 130, 0, 130, 16, 130, 0, 130, |
|
| 17, 130, 0, 130, 18, 130, 0, 130, 19, 130, |
|
| 0, 130, 20, 130, 0, 130, 21, 130, 0, 130, |
|
| 26, 130, 0, 71, 0, 4, 0, 0, 0 |
|
| }; |
|
| |
|
| |
#ifdef YYTYPE_INT16 |
| |
typedef YYTYPE_INT16 yytype_int16; |
| |
#else |
| |
typedef short int yytype_int16; |
| #endif |
#endif |
| |
|
| #if YYDEBUG != 0 |
#ifndef YYSIZE_T |
| static const short yyrline[] = { 0, |
# ifdef __SIZE_TYPE__ |
| 107, 117, 119, 119, 120, 122, 122, 124, 190, 190, |
# define YYSIZE_T __SIZE_TYPE__ |
| 191, 191, 192, 193, 193, 195, 224, 224, 225, 226, |
# elif defined size_t |
| 226, 227, 227, 229, 229, 233, 233, 235, 235, 236, |
# define YYSIZE_T size_t |
| 236, 237, 237, 237, 241, 245, 246, 246, 247, 248, |
# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \ |
| 250, 251, 266, 267, 267, 271, 275, 277, 278, 279, |
|| defined __cplusplus || defined _MSC_VER) |
| 294, 299, 301, 303, 304, 306, 312, 318, 324, 326, |
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */ |
| 327, 329, 335, 336, 336, 340, 344, 345, 346, 360, |
# define YYSIZE_T size_t |
| 362, 362, 363, 365, 366, 368, 369, 370, 371, 373, |
# else |
| 375, 377, 379, 381, 383, 387, 391, 395, 397, 398, |
# define YYSIZE_T unsigned int |
| 400, 407, 407, 409, 409, 410, 411, 416, 421, 423, |
# endif |
| 425, 426, 427, 429, 433, 441, 447, 452, 452, 453, |
#endif |
| 458, 460, 462, 466, 478, 482, 484, 485, 486, 487, |
|
| 488, 490, 491, 492, 493, 494, 495, 496, 497, 499, |
#define YYSIZE_MAXIMUM ((YYSIZE_T) -1) |
| 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, |
|
| 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, |
#ifndef YY_ |
| 520, 521, 522, 523, 526, 535, 540, 541 |
# if defined YYENABLE_NLS && 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 |
#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 yyi) |
| |
#else |
| |
static int |
| |
YYID (yyi) |
| |
int yyi; |
| |
#endif |
| |
{ |
| |
return yyi; |
| |
} |
| |
#endif |
| |
|
| |
#if ! defined yyoverflow || YYERROR_VERBOSE |
| |
|
| #if YYDEBUG != 0 || defined (YYERROR_VERBOSE) |
/* The parser invokes alloca or malloc; define the necessary symbols. */ |
| |
|
| static const char * const yytname[] = { "$","error","$undefined.","EON","STRING", |
# ifdef YYSTACK_USE_ALLOCA |
| "BOGUS","BAD_STRING_COMPARISON_OPERATOR","BAD_HEX_LITERAL","BAD_METHOD_DECL_START", |
# if YYSTACK_USE_ALLOCA |
| "\"&&\"","\"||\"","\"##\"","\"<=\"","\">=\"","\"==\"","\"!=\"","\"lt\"","\"gt\"", |
# ifdef __GNUC__ |
| "\"le\"","\"ge\"","\"eq\"","\"ne\"","\"def\"","\"in\"","\"-f\"","\"-d\"","\"is\"", |
# define YYSTACK_ALLOC __builtin_alloca |
| "'<'","'>'","'!'","'#'","'|'","'&'","'~'","'-'","'+'","'*'","'/'","'%'","'\\\\'", |
# elif defined __BUILTIN_VA_ARG_INCR |
| "NEG","'@'","'\\n'","'['","']'","';'","'$'","'{'","'}'","'.'","'('","')'","'^'", |
# include <alloca.h> /* INFRINGES ON USER NAME SPACE */ |
| "':'","'\\\"'","'\\''","all","methods","one_big_piece","method","control_method", |
# elif defined _AIX |
| "maybe_control_strings","control_strings","control_string","maybe_string","code_method", |
# define YYSTACK_ALLOC __alloca |
| "maybe_bracketed_strings","bracketed_maybe_strings","maybe_strings","strings", |
# elif defined _MSC_VER |
| "maybe_comment","maybe_codes","codes","code","action","get","get_value","get_name_value", |
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */ |
| "name_in_curly_rdive","name_without_curly_rdive","name_without_curly_rdive_read", |
# define alloca _alloca |
| "name_without_curly_rdive_class","name_without_curly_rdive_code","put","name_expr_wdive", |
# else |
| "name_expr_wdive_root","name_expr_wdive_write","name_expr_wdive_class","construct", |
# define YYSTACK_ALLOC alloca |
| "construct_square","construct_round","construct_curly","any_constructor_code_value", |
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \ |
| "constructor_code_value","constructor_code","codes__excluding_sole_str_literal", |
|| defined __cplusplus || defined _MSC_VER) |
| "call","call_value","@1","@2","call_name","store_params","store_param","store_square_param", |
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ |
| "store_round_param","store_curly_param","store_code_param_parts","store_expr_param_parts", |
# ifndef EXIT_SUCCESS |
| "store_curly_param_parts","store_code_param_part","store_expr_param_part","store_curly_param_part", |
# define EXIT_SUCCESS 0 |
| "code_param_value","write_expr_value","name_expr_dive_code","name_path","name_step", |
# endif |
| "name_advance1","name_advance2","name_expr_value","name_expr_subvar_value","name_expr_with_subvar_value", |
# endif |
| "name_square_code_value","subvar_ref_name_rdive","subvar_get_writes","subvar__get_write", |
# endif |
| "class_prefix","class_static_prefix","class_constructor_prefix","expr_value", |
# endif |
| "expr","string_inside_quotes_value","write_string","void_value","empty", NULL |
# 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 EXIT_SUCCESS \ |
| |
&& ! ((defined YYMALLOC || defined malloc) \ |
| |
&& (defined YYFREE || defined free))) |
| |
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ |
| |
# ifndef EXIT_SUCCESS |
| |
# define EXIT_SUCCESS 0 |
| |
# endif |
| |
# endif |
| |
# ifndef YYMALLOC |
| |
# define YYMALLOC malloc |
| |
# if ! defined malloc && ! defined EXIT_SUCCESS && (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 EXIT_SUCCESS && (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 YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) |
| |
|
| |
/* A type that is properly aligned for any stack member. */ |
| |
union yyalloc |
| |
{ |
| |
yytype_int16 yyss_alloc; |
| |
YYSTYPE yyvs_alloc; |
| }; |
}; |
| #endif |
|
| |
|
| static const short yyr1[] = { 0, |
/* The size of the maximum gap between one aligned stack and the next. */ |
| 56, 56, 57, 57, 58, 59, 59, 60, 61, 61, |
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) |
| 62, 62, 63, 64, 64, 65, 66, 66, 67, 68, |
|
| 68, 69, 69, 70, 70, 71, 71, 72, 72, 73, |
/* The size of an array large to enough to hold all stacks, each with |
| 73, 74, 74, 74, 75, 76, 77, 77, 78, 79, |
N elements. */ |
| 79, 80, 81, 82, 82, 83, 84, 84, 84, 85, |
# define YYSTACK_BYTES(N) \ |
| 86, 87, 88, 88, 88, 89, 90, 91, 92, 92, |
((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \ |
| 92, 93, 94, 95, 95, 96, 98, 99, 97, 100, |
+ YYSTACK_GAP_MAXIMUM) |
| 101, 101, 102, 102, 102, 103, 104, 105, 106, 106, |
|
| 107, 107, 108, 108, 109, 110, 111, 112, 112, 112, |
# define YYCOPY_NEEDED 1 |
| 113, 114, 114, 115, 115, 116, 117, 118, 118, 119, |
|
| 119, 119, 119, 120, 121, 122, 123, 124, 124, 125, |
/* Relocate STACK from its old location to the new one. The |
| 126, 126, 127, 128, 129, 130, 130, 130, 130, 130, |
local variables YYSIZE and YYSTACKSIZE give the old and new number of |
| 130, 130, 130, 130, 130, 130, 130, 130, 130, 130, |
elements in the stack, and YYPTR gives the new location of the |
| 130, 130, 130, 130, 130, 130, 130, 130, 130, 130, |
stack. Advance YYPTR to a properly aligned location for the next |
| 130, 130, 130, 130, 130, 130, 130, 130, 130, 130, |
stack. */ |
| 130, 130, 130, 130, 131, 132, 133, 134 |
# define YYSTACK_RELOCATE(Stack_alloc, Stack) \ |
| |
do \ |
| |
{ \ |
| |
YYSIZE_T yynewbytes; \ |
| |
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \ |
| |
Stack = &yyptr->Stack_alloc; \ |
| |
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ |
| |
yyptr += yynewbytes / sizeof (*yyptr); \ |
| |
} \ |
| |
while (YYID (0)) |
| |
|
| |
#endif |
| |
|
| |
#if defined YYCOPY_NEEDED && YYCOPY_NEEDED |
| |
/* 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 |
| |
#endif /* !YYCOPY_NEEDED */ |
| |
|
| |
/* YYFINAL -- State number of the termination state. */ |
| |
#define YYFINAL 51 |
| |
/* YYLAST -- Last index in YYTABLE. */ |
| |
#define YYLAST 470 |
| |
|
| |
/* YYNTOKENS -- Number of terminals. */ |
| |
#define YYNTOKENS 62 |
| |
/* YYNNTS -- Number of nonterminals. */ |
| |
#define YYNNTS 89 |
| |
/* YYNRULES -- Number of rules. */ |
| |
#define YYNRULES 172 |
| |
/* YYNRULES -- Number of states. */ |
| |
#define YYNSTATES 263 |
| |
|
| |
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ |
| |
#define YYUNDEFTOK 2 |
| |
#define YYMAXUTOK 289 |
| |
|
| |
#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, |
| |
48, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 46, 60, 2, 52, 43, 37, 61, |
| |
56, 57, 40, 38, 2, 39, 55, 41, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 59, 51, |
| |
34, 2, 35, 2, 47, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 49, 42, 50, 58, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 53, 36, 54, 45, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| |
2, 2, 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, 44 |
| }; |
}; |
| |
|
| static const short yyr2[] = { 0, |
#if YYDEBUG |
| 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, |
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in |
| 1, 2, 2, 1, 1, 7, 1, 1, 3, 1, |
YYRHS. */ |
| 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, |
static const yytype_uint16 yyprhs[] = |
| 1, 1, 1, 1, 1, 2, 2, 1, 3, 1, |
{ |
| 1, 1, 2, 1, 2, 3, 1, 1, 1, 1, |
0, 0, 3, 5, 7, 9, 12, 14, 16, 18, |
| 2, 2, 1, 1, 1, 3, 3, 3, 1, 1, |
23, 25, 27, 29, 32, 35, 37, 39, 40, 49, |
| 1, 1, 1, 1, 2, 1, 0, 0, 6, 1, |
51, 53, 57, 59, 61, 63, 67, 69, 71, 73, |
| 1, 2, 1, 1, 1, 3, 3, 3, 1, 3, |
75, 77, 80, 82, 84, 86, 88, 90, 92, 95, |
| 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, |
98, 100, 104, 106, 108, 110, 113, 115, 118, 122, |
| 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, |
124, 126, 128, 130, 133, 136, 138, 140, 142, 143, |
| 1, 1, 1, 2, 2, 3, 1, 1, 2, 2, |
144, 150, 154, 158, 160, 162, 164, 166, 168, 170, |
| 1, 1, 2, 2, 1, 1, 1, 1, 3, 3, |
173, 175, 176, 177, 184, 186, 188, 191, 193, 195, |
| 3, 2, 2, 2, 2, 2, 2, 2, 2, 3, |
197, 198, 199, 205, 209, 213, 215, 219, 221, 225, |
| 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, |
227, 231, 233, 235, 237, 239, 241, 243, 245, 248, |
| 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, |
250, 253, 256, 258, 260, 263, 265, 267, 269, 271, |
| 3, 3, 3, 3, 1, 1, 0, 0 |
274, 277, 278, 279, 285, 287, 289, 292, 295, 297, |
| |
299, 302, 305, 307, 309, 311, 313, 315, 317, 321, |
| |
325, 329, 332, 335, 338, 341, 344, 347, 350, 353, |
| |
357, 361, 365, 369, 373, 377, 381, 385, 389, 393, |
| |
397, 401, 405, 409, 413, 417, 421, 425, 429, 433, |
| |
437, 441, 445, 449, 453, 457, 461, 463, 465, 467, |
| |
468, 470, 472 |
| }; |
}; |
| |
|
| static const short yydefact[] = { 158, |
/* YYRHS -- A `-1'-separated list of the rules' RHS. */ |
| 156, 0, 0, 67, 2, 1, 3, 6, 7, 5, |
static const yytype_int16 yyrhs[] = |
| 27, 28, 31, 32, 35, 33, 34, 66, 30, 26, |
{ |
| 0, 100, 0, 0, 0, 0, 36, 38, 0, 40, |
63, 0, -1, 65, -1, 64, -1, 66, -1, 64, |
| 41, 42, 0, 47, 48, 49, 50, 0, 94, 0, |
66, -1, 79, -1, 67, -1, 72, -1, 47, 4, |
| 44, 92, 101, 102, 103, 0, 111, 112, 0, 4, |
48, 68, -1, 150, -1, 69, -1, 70, -1, 69, |
| 29, 158, 158, 158, 99, 0, 113, 105, 108, 0, |
70, -1, 71, 48, -1, 150, -1, 4, -1, -1, |
| 107, 104, 0, 0, 98, 0, 100, 51, 0, 92, |
47, 4, 75, 74, 78, 48, 73, 79, -1, 150, |
| 37, 157, 158, 0, 46, 53, 54, 55, 100, 95, |
-1, 75, -1, 49, 76, 50, -1, 150, -1, 77, |
| 45, 93, 96, 43, 52, 114, 70, 68, 15, 8, |
-1, 4, -1, 77, 51, 4, -1, 150, -1, 4, |
| 10, 11, 0, 9, 22, 0, 21, 20, 158, 18, |
-1, 150, -1, 80, -1, 81, -1, 80, 81, -1, |
| 17, 110, 109, 106, 39, 93, 156, 0, 31, 0, |
146, -1, 82, -1, 83, -1, 91, -1, 106, -1, |
| 61, 62, 63, 59, 0, 116, 0, 0, 0, 0, |
84, -1, 52, 85, -1, 87, 3, -1, 86, -1, |
| 0, 0, 0, 0, 0, 0, 158, 158, 117, 118, |
53, 87, 54, -1, 88, -1, 89, -1, 90, -1, |
| 0, 115, 0, 12, 14, 13, 19, 0, 25, 0, |
139, 90, -1, 129, -1, 126, 129, -1, 52, 92, |
| 24, 65, 56, 58, 126, 127, 128, 129, 125, 124, |
96, -1, 93, -1, 94, -1, 95, -1, 125, -1, |
| 122, 123, 0, 155, 0, 0, 57, 0, 0, 0, |
55, 125, -1, 139, 125, -1, 97, -1, 100, -1, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
101, -1, -1, -1, 49, 98, 102, 99, 50, -1, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
56, 142, 57, -1, 53, 79, 54, -1, 147, -1, |
| 0, 0, 157, 158, 0, 0, 71, 73, 74, 75, |
4, -1, 103, -1, 104, -1, 105, -1, 82, -1, |
| 23, 158, 121, 119, 120, 139, 140, 141, 144, 145, |
81, 80, -1, 107, -1, -1, -1, 58, 108, 110, |
| 146, 147, 148, 149, 150, 151, 152, 153, 154, 142, |
109, 111, 3, -1, 87, -1, 112, -1, 111, 112, |
| 143, 138, 137, 136, 130, 131, 132, 133, 134, 135, |
-1, 113, -1, 116, -1, 117, -1, -1, -1, 49, |
| 156, 90, 0, 79, 85, 88, 87, 0, 83, 0, |
114, 118, 115, 50, -1, 56, 119, 57, -1, 53, |
| 81, 86, 91, 69, 72, 16, 76, 157, 158, 78, |
120, 54, -1, 121, -1, 118, 51, 121, -1, 122, |
| 0, 77, 80, 84, 82, 0, 0, 0 |
-1, 119, 51, 122, -1, 123, -1, 120, 51, 123, |
| |
-1, 124, -1, 142, -1, 79, -1, 147, -1, 4, |
| |
-1, 103, -1, 130, -1, 126, 130, -1, 127, -1, |
| |
126, 127, -1, 128, 55, -1, 130, -1, 130, -1, |
| |
4, 5, -1, 4, -1, 131, -1, 132, -1, 133, |
| |
-1, 52, 136, -1, 4, 137, -1, -1, -1, 49, |
| |
134, 80, 135, 50, -1, 4, -1, 138, -1, 137, |
| |
138, -1, 52, 136, -1, 140, -1, 141, -1, 4, |
| |
59, -1, 140, 59, -1, 143, -1, 144, -1, 148, |
| |
-1, 149, -1, 84, -1, 107, -1, 60, 145, 60, |
| |
-1, 61, 145, 61, -1, 56, 143, 57, -1, 39, |
| |
143, -1, 38, 143, -1, 45, 143, -1, 46, 143, |
| |
-1, 27, 143, -1, 28, 143, -1, 29, 143, -1, |
| |
30, 143, -1, 143, 39, 143, -1, 143, 38, 143, |
| |
-1, 143, 40, 143, -1, 143, 41, 143, -1, 143, |
| |
43, 143, -1, 143, 42, 143, -1, 143, 19, 143, |
| |
-1, 143, 20, 143, -1, 143, 37, 143, -1, 143, |
| |
36, 143, -1, 143, 14, 143, -1, 143, 11, 143, |
| |
-1, 143, 12, 143, -1, 143, 13, 143, -1, 143, |
| |
34, 143, -1, 143, 35, 143, -1, 143, 15, 143, |
| |
-1, 143, 16, 143, -1, 143, 17, 143, -1, 143, |
| |
18, 143, -1, 143, 21, 143, -1, 143, 22, 143, |
| |
-1, 143, 23, 143, -1, 143, 24, 143, -1, 143, |
| |
25, 143, -1, 143, 26, 143, -1, 143, 31, 143, |
| |
-1, 4, -1, 79, -1, 4, -1, -1, 32, -1, |
| |
33, -1, -1 |
| }; |
}; |
| |
|
| static const short yydefgoto[] = { 246, |
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */ |
| 5, 6, 7, 8, 90, 91, 92, 93, 9, 99, |
static const yytype_uint16 yyrline[] = |
| 54, 96, 97, 140, 154, 11, 12, 13, 14, 129, |
{ |
| 27, 28, 29, 30, 31, 32, 16, 33, 34, 35, |
0, 142, 142, 149, 151, 151, 152, 154, 154, 156, |
| 36, 75, 76, 77, 78, 110, 222, 112, 113, 17, |
266, 266, 267, 267, 268, 269, 269, 271, 271, 319, |
| 130, 49, 133, 88, 186, 187, 188, 189, 190, 223, |
319, 320, 321, 321, 322, 322, 324, 324, 328, 328, |
| 230, 228, 224, 231, 229, 225, 232, 37, 64, 39, |
330, 330, 331, 331, 332, 332, 332, 336, 384, 385, |
| 40, 41, 65, 43, 44, 45, 62, 58, 59, 66, |
385, 386, 388, 389, 390, 443, 444, 444, 448, 461, |
| 47, 48, 233, 132, 155, 19, 226, 20 |
462, 463, 464, 490, 495, 498, 499, 500, 502, 505, |
| |
502, 513, 521, 528, 529, 530, 532, 538, 539, 539, |
| |
543, 556, 559, 556, 604, 606, 606, 608, 609, 610, |
| |
612, 615, 612, 618, 619, 621, 622, 625, 626, 629, |
| |
630, 632, 635, 649, 654, 655, 656, 661, 661, 663, |
| |
663, 664, 665, 677, 686, 689, 690, 691, 692, 694, |
| |
698, 707, 710, 707, 723, 728, 728, 729, 735, 736, |
| |
738, 751, 763, 765, 766, 767, 768, 769, 770, 771, |
| |
772, 774, 775, 776, 777, 778, 779, 780, 781, 783, |
| |
784, 785, 786, 787, 788, 789, 790, 791, 792, 793, |
| |
794, 795, 796, 797, 798, 799, 800, 801, 802, 803, |
| |
804, 805, 806, 807, 808, 809, 812, 817, 838, 843, |
| |
844, 845, 847 |
| }; |
}; |
| |
#endif |
| |
|
| static const short yypact[] = { 5, |
#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE |
| -32768, 20, 75,-32768, -34,-32768,-32768,-32768,-32768,-32768, |
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. |
| 18,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, |
First, the terminals, then, starting at YYNTOKENS, nonterminals. */ |
| -27, 31, 18, 27, 97, 102,-32768,-32768, 39,-32768, |
static const char *const yytname[] = |
| -32768,-32768, 91,-32768,-32768,-32768,-32768, 103,-32768, 32, |
{ |
| -32768, 42,-32768,-32768,-32768, 103, 34,-32768, 97,-32768, |
"$end", "error", "$undefined", "EON", "STRING", "BOGUS", |
| -32768, 89, 96, 52,-32768, 27,-32768, 56,-32768, 17, |
"BAD_STRING_COMPARISON_OPERATOR", "BAD_HEX_LITERAL", |
| -32768,-32768, 61, 103, 62, 103, 56,-32768, 102, 62, |
"BAD_METHOD_DECL_START", "BAD_METHOD_PARAMETER_NAME_CHARACTER", |
| -32768, 36, 18, 4,-32768,-32768,-32768,-32768, 25,-32768, |
"BAD_NONWHITESPACE_CHARACTER_IN_EXPLICIT_RESULT_MODE", "\"&&\"", |
| -32768, 42,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, |
"\"||\"", "\"!||\"", "\"!|\"", "\"<=\"", "\">=\"", "\"==\"", "\"!=\"", |
| 6,-32768, 74, 78,-32768, 87, 94,-32768, 115,-32768, |
"\"<<\"", "\">>\"", "\"lt\"", "\"gt\"", "\"le\"", "\"ge\"", "\"eq\"", |
| -32768,-32768,-32768,-32768,-32768, 62, 88, 18, 41, 106, |
"\"ne\"", "\"def\"", "\"in\"", "\"-f\"", "\"-d\"", "\"is\"", "\"true\"", |
| -32768,-32768,-32768,-32768, 105,-32768, 4, 4, 4, 4, |
"\"false\"", "'<'", "'>'", "'|'", "'&'", "'+'", "'-'", "'*'", "'/'", |
| 4, 4, 4, 4, 90, 4, 18, 18,-32768,-32768, |
"'\\\\'", "'%'", "NUNARY", "'~'", "'!'", "'@'", "'\\n'", "'['", "']'", |
| 101, 277, 104,-32768,-32768,-32768,-32768, 159,-32768, 123, |
"';'", "'$'", "'{'", "'}'", "'.'", "'('", "')'", "'^'", "':'", "'\"'", |
| -32768, 18,-32768,-32768, 191, 191, 191, 191, 191, 198, |
"'\\''", "$accept", "all", "methods", "one_big_piece", "method", |
| -32768,-32768, 234,-32768, 112, 113,-32768, 4, 4, 4, |
"control_method", "maybe_control_strings", "control_strings", |
| 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, |
"control_string", "maybe_string", "code_method", "@1", |
| 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, |
"maybe_bracketed_strings", "bracketed_maybe_strings", "maybe_strings", |
| 4, 4, 37, 18, 4, 49,-32768,-32768,-32768,-32768, |
"strings", "maybe_comment", "maybe_codes", "codes", "code", "action", |
| -32768, 18,-32768,-32768,-32768, 367, 339, 308, 393, 393, |
"get", "get_value", "get_name_value", "name_in_curly_rdive", |
| 143, 143, 393, 393, 393, 393, 143, 143, 191, 393, |
"name_without_curly_rdive", "name_without_curly_rdive_read", |
| 393, 243, 401, 198, 152, 152,-32768,-32768,-32768,-32768, |
"name_without_curly_rdive_class", "name_without_curly_rdive_code", "put", |
| 70,-32768, 81,-32768,-32768,-32768,-32768, -28,-32768, 53, |
"name_expr_wdive", "name_expr_wdive_root", "name_expr_wdive_write", |
| -32768,-32768,-32768,-32768,-32768,-32768,-32768, 37, 18,-32768, |
"name_expr_wdive_class", "construct", "construct_square", "@2", "$@3", |
| 4,-32768,-32768,-32768,-32768, 170, 171,-32768 |
"construct_round", "construct_curly", "any_constructor_code_value", |
| |
"constructor_code_value", "constructor_code", |
| |
"codes__excluding_sole_str_literal", "call", "call_value", "$@4", "$@5", |
| |
"call_name", "store_params", "store_param", "store_square_param", "@6", |
| |
"$@7", "store_round_param", "store_curly_param", |
| |
"store_code_param_parts", "store_expr_param_parts", |
| |
"store_curly_param_parts", "store_code_param_part", |
| |
"store_expr_param_part", "store_curly_param_part", "code_param_value", |
| |
"name_expr_dive_code", "name_path", "name_step", "name_advance1", |
| |
"name_advance2", "name_expr_value", "name_expr_subvar_value", |
| |
"name_expr_with_subvar_value", "name_square_code_value", "@8", "$@9", |
| |
"subvar_ref_name_rdive", "subvar_get_writes", "subvar__get_write", |
| |
"class_prefix", "class_static_prefix", "class_constructor_prefix", |
| |
"expr_value", "expr", "double_or_STRING", "string_inside_quotes_value", |
| |
"write_string", "empty_value", "true_value", "false_value", "empty", 0 |
| }; |
}; |
| |
#endif |
| |
|
| static const short yypgoto[] = {-32768, |
# ifdef YYPRINT |
| -32768,-32768, 167,-32768,-32768,-32768, 133,-32768,-32768,-32768, |
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to |
| 139,-32768,-32768,-32768, 3, -18, -7, -71,-32768, 0, |
token YYLEX-NUM. */ |
| -32768,-32768, -6,-32768,-32768, 51,-32768,-32768,-32768,-32768, |
static const yytype_uint16 yytoknum[] = |
| -32768,-32768,-32768,-32768,-32768,-32768, 184,-32768,-32768,-32768, |
{ |
| 2,-32768,-32768,-32768,-32768, 71,-32768,-32768,-32768,-32768, |
0, 256, 257, 258, 259, 260, 261, 262, 263, 264, |
| -32768,-32768, 21, 22, 19,-32768,-32768, -12, 77, -20, |
265, 266, 267, 268, 269, 270, 271, 272, 273, 274, |
| -32768, -32, 9,-32768,-32768,-32768, 211,-32768, 218, 280, |
275, 276, 277, 278, 279, 280, 281, 282, 283, 284, |
| -32768,-32768, 210, 38, 172,-32768, 227, 14 |
285, 286, 287, 288, 60, 62, 124, 38, 43, 45, |
| |
42, 47, 92, 37, 289, 126, 33, 64, 10, 91, |
| |
93, 59, 36, 123, 125, 46, 40, 41, 94, 58, |
| |
34, 39 |
| }; |
}; |
| |
# endif |
| |
|
| |
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ |
| |
static const yytype_uint8 yyr1[] = |
| |
{ |
| |
0, 62, 63, 63, 64, 64, 65, 66, 66, 67, |
| |
68, 68, 69, 69, 70, 71, 71, 73, 72, 74, |
| |
74, 75, 76, 76, 77, 77, 78, 78, 79, 79, |
| |
80, 80, 81, 81, 82, 82, 82, 83, 84, 85, |
| |
85, 86, 87, 87, 88, 89, 90, 90, 91, 92, |
| |
92, 92, 93, 94, 95, 96, 96, 96, 98, 99, |
| |
97, 100, 101, 102, 102, 102, 103, 104, 105, 105, |
| |
106, 108, 109, 107, 110, 111, 111, 112, 112, 112, |
| |
114, 115, 113, 116, 117, 118, 118, 119, 119, 120, |
| |
120, 121, 122, 123, 124, 124, 124, 125, 125, 126, |
| |
126, 127, 128, 129, 129, 130, 130, 130, 130, 131, |
| |
132, 134, 135, 133, 136, 137, 137, 138, 139, 139, |
| |
140, 141, 142, 143, 143, 143, 143, 143, 143, 143, |
| |
143, 143, 143, 143, 143, 143, 143, 143, 143, 143, |
| |
143, 143, 143, 143, 143, 143, 143, 143, 143, 143, |
| |
143, 143, 143, 143, 143, 143, 143, 143, 143, 143, |
| |
143, 143, 143, 143, 143, 143, 144, 145, 146, 147, |
| |
148, 149, 150 |
| |
}; |
| |
|
| #define YYLAST 440 |
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ |
| |
static const yytype_uint8 yyr2[] = |
| |
{ |
| |
0, 2, 1, 1, 1, 2, 1, 1, 1, 4, |
| |
1, 1, 1, 2, 2, 1, 1, 0, 8, 1, |
| |
1, 3, 1, 1, 1, 3, 1, 1, 1, 1, |
| |
1, 2, 1, 1, 1, 1, 1, 1, 2, 2, |
| |
1, 3, 1, 1, 1, 2, 1, 2, 3, 1, |
| |
1, 1, 1, 2, 2, 1, 1, 1, 0, 0, |
| |
5, 3, 3, 1, 1, 1, 1, 1, 1, 2, |
| |
1, 0, 0, 6, 1, 1, 2, 1, 1, 1, |
| |
0, 0, 5, 3, 3, 1, 3, 1, 3, 1, |
| |
3, 1, 1, 1, 1, 1, 1, 1, 2, 1, |
| |
2, 2, 1, 1, 2, 1, 1, 1, 1, 2, |
| |
2, 0, 0, 5, 1, 1, 2, 2, 1, 1, |
| |
2, 2, 1, 1, 1, 1, 1, 1, 3, 3, |
| |
3, 2, 2, 2, 2, 2, 2, 2, 2, 3, |
| |
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, |
| |
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, |
| |
3, 3, 3, 3, 3, 3, 1, 1, 1, 0, |
| |
1, 1, 0 |
| |
}; |
| |
|
| |
/* YYDEFACT[STATE-NAME] -- Default reduction number in state STATE-NUM. |
| |
Performed when YYTABLE doesn't specify something else to do. Zero |
| |
means the default is an error. */ |
| |
static const yytype_uint8 yydefact[] = |
| |
{ |
| |
172, 168, 0, 0, 71, 0, 3, 2, 4, 7, |
| |
8, 6, 29, 30, 33, 34, 37, 35, 36, 70, |
| |
32, 28, 0, 105, 111, 0, 0, 0, 38, 40, |
| |
0, 42, 43, 44, 0, 49, 50, 51, 52, 0, |
| |
99, 0, 46, 97, 106, 107, 108, 0, 118, 119, |
| |
0, 1, 5, 31, 172, 172, 172, 104, 0, 120, |
| |
110, 115, 0, 114, 109, 0, 0, 103, 0, 105, |
| |
53, 0, 97, 39, 58, 172, 0, 48, 55, 56, |
| |
57, 105, 100, 47, 98, 101, 45, 54, 121, 74, |
| |
72, 16, 9, 11, 12, 0, 10, 24, 0, 23, |
| |
22, 172, 20, 19, 117, 116, 112, 41, 98, 169, |
| |
0, 166, 0, 0, 0, 0, 170, 171, 0, 0, |
| |
0, 0, 0, 0, 172, 172, 126, 127, 0, 122, |
| |
123, 124, 125, 0, 13, 15, 14, 21, 0, 27, |
| |
0, 26, 0, 168, 0, 33, 59, 65, 66, 67, |
| |
63, 62, 135, 136, 137, 138, 132, 131, 133, 134, |
| |
0, 167, 0, 0, 61, 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, |
| |
0, 0, 80, 172, 0, 0, 75, 77, 78, 79, |
| |
25, 17, 113, 69, 0, 130, 128, 129, 150, 151, |
| |
152, 149, 155, 156, 157, 158, 145, 146, 159, 160, |
| |
161, 162, 163, 164, 165, 153, 154, 148, 147, 140, |
| |
139, 141, 142, 144, 143, 169, 93, 0, 89, 0, |
| |
87, 92, 73, 76, 172, 60, 168, 96, 81, 85, |
| |
91, 94, 172, 84, 0, 83, 18, 169, 0, 90, |
| |
88, 86, 82 |
| |
}; |
| |
|
| static const short yytable[] = { 15, |
/* YYDEFGOTO[NTERM-NUM]. */ |
| 109, 18, 10, 51, 60, 81, 2, 116, 1, 89, |
static const yytype_int16 yydefgoto[] = |
| 15, 42, 18, 68, 52, 53, 239, 80, 63, 240, |
{ |
| 1, 1, 15, 21, 18, 117, 118, 119, 120, 55, |
-1, 5, 6, 7, 8, 9, 92, 93, 94, 95, |
| 61, 81, 121, 85, 70, 55, 122, 123, 124, 107, |
10, 244, 101, 56, 98, 99, 140, 161, 12, 13, |
| 221, 71, 87, 80, -98, 2, 82, -158, 80, 125, |
14, 15, 126, 28, 29, 30, 31, 32, 33, 17, |
| 3, 234, 51, 126, 42, 4, 4, 127, 128, 15, |
34, 35, 36, 37, 77, 78, 109, 204, 79, 80, |
| 104, 18, 3, 3, 108, 94, 98, 101, 4, 4, |
146, 247, 148, 149, 18, 127, 50, 133, 90, 195, |
| 56, 15, 15, 18, 18, 115, 56, 106, 22, 38, |
196, 197, 235, 258, 198, 199, 248, 239, 237, 249, |
| 83, 3, 3, 57, -64, -64, 86, 4, 4, 142, |
240, 238, 250, 38, 66, 40, 41, 42, 67, 44, |
| -97, 183, 89, 22, 53, 184, 84, 241, 185, 95, |
45, 46, 62, 142, 64, 60, 61, 68, 48, 49, |
| 22, 56, 69, 242, 135, 67, 79, 15, 105, 18, |
241, 129, 130, 162, 20, 251, 131, 132, 21 |
| -97, 109, 141, -89, -89, 136, 84, 23, 139, -14, |
|
| 24, 25, 38, 26, 237, 238, 15, 15, 18, 18, |
|
| 137, -60, 23, 72, 51, 24, 25, 73, 138, 23, |
|
| 74, 15, 24, 18, 23, 23, 183, 24, 24, 143, |
|
| 184, 157, 144, 185, 145, 146, 147, 148, 149, 150, |
|
| 151, 152, 191, 153, 192, 194, 109, 195, 171, 247, |
|
| 248, 50, 174, 175, 176, 108, 177, 178, 179, 180, |
|
| 181, 182, 15, 15, 18, 18, 227, 179, 180, 181, |
|
| 182, 15, 100, 18, 236, 196, 197, 198, 199, 200, |
|
| 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, |
|
| 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, |
|
| 174, 175, 176, 134, 177, 178, 179, 180, 181, 182, |
|
| 108, 177, 178, 179, 180, 181, 182, 15, 15, 18, |
|
| 18, 227, 158, 159, 160, 161, 162, 163, 164, 165, |
|
| 166, 167, 168, 169, 170, 111, 235, 244, 243, 171, |
|
| 172, 173, 245, 174, 175, 176, 102, 177, 178, 179, |
|
| 180, 181, 182, 175, 176, 103, 177, 178, 179, 180, |
|
| 181, 182, 46, 131, 193, 158, 159, 160, 161, 162, |
|
| 163, 164, 165, 166, 167, 168, 169, 170, 114, 156, |
|
| 0, 0, 171, 172, 173, 0, 174, 175, 176, 0, |
|
| 177, 178, 179, 180, 181, 182, 158, 159, 0, 161, |
|
| 162, 163, 164, 165, 166, 167, 168, 169, 170, 0, |
|
| 0, 0, 0, 171, 172, 173, 0, 174, 175, 176, |
|
| 0, 177, 178, 179, 180, 181, 182, 158, 0, 0, |
|
| 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, |
|
| 0, 0, 0, 0, 171, 172, 173, 0, 174, 175, |
|
| 176, 0, 177, 178, 179, 180, 181, 182, 161, 162, |
|
| 163, 164, 165, 166, 167, 168, 169, 170, 0, 0, |
|
| 0, 0, 171, 172, 173, 0, 174, 175, 176, 0, |
|
| 177, 178, 179, 180, 181, 182, 163, 164, 0, 0, |
|
| 0, 0, 169, 170, 0, 0, 0, 0, 171, 0, |
|
| 0, 0, 174, 175, 176, 0, 177, 178, 179, 180, |
|
| 181, 182, 176, 0, 177, 178, 179, 180, 181, 182 |
|
| }; |
}; |
| |
|
| static const short yycheck[] = { 0, |
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing |
| 72, 0, 0, 11, 23, 38, 41, 4, 4, 4, |
STATE-NUM. */ |
| 11, 3, 11, 26, 42, 43, 45, 38, 25, 48, |
#define YYPACT_NINF -107 |
| 4, 4, 23, 4, 23, 22, 23, 24, 25, 5, |
static const yytype_int16 yypact[] = |
| 4, 64, 29, 46, 26, 5, 33, 34, 35, 4, |
{ |
| 4, 3, 49, 64, 3, 41, 38, 42, 69, 46, |
14, -107, 13, 45, -107, 28, -15, -107, -107, -107, |
| 46, 3, 60, 50, 46, 52, 52, 54, 55, 60, |
-107, -107, 21, -107, -107, -107, -107, -107, -107, -107, |
| 44, 60, 46, 46, 72, 52, 53, 54, 52, 52, |
-107, -107, 73, 19, -107, 50, 6, 44, -107, -107, |
| 46, 72, 73, 72, 73, 73, 46, 69, 4, 3, |
87, -107, -107, -107, -34, -107, -107, -107, -107, 65, |
| 49, 46, 46, 53, 44, 45, 53, 52, 52, 108, |
-107, 48, -107, 5, -107, -107, -107, 65, 24, -107, |
| 49, 43, 4, 4, 43, 47, 46, 45, 50, 4, |
6, -107, -107, -107, 88, 109, 74, -107, 50, -107, |
| 4, 46, 26, 51, 91, 4, 4, 108, 48, 108, |
76, -107, 21, -107, -107, 86, 65, 101, 65, 76, |
| 49, 183, 99, 44, 45, 42, 66, 43, 4, 42, |
-107, 44, 101, -107, -107, 21, 7, -107, -107, -107, |
| 46, 47, 46, 49, 44, 45, 127, 128, 127, 128, |
-107, 18, -107, -107, 5, -107, -107, -107, -107, -107, |
| 44, 44, 43, 43, 142, 46, 47, 47, 45, 43, |
-107, -107, -107, 9, -107, 94, 99, -107, 93, 112, |
| 50, 142, 46, 142, 43, 43, 43, 46, 46, 44, |
-107, 146, -107, -107, -107, -107, 21, -107, 101, 29, |
| 47, 51, 48, 50, 117, 118, 119, 120, 121, 122, |
110, -107, 7, 7, 7, 7, -107, -107, 7, 7, |
| 123, 124, 4, 126, 42, 54, 238, 55, 26, 0, |
7, 7, 52, 7, 21, 21, -107, -107, 113, 323, |
| 0, 5, 30, 31, 32, 183, 34, 35, 36, 37, |
-107, -107, -107, 92, -107, -107, -107, -107, 165, -107, |
| 38, 39, 183, 184, 183, 184, 184, 36, 37, 38, |
144, -107, 147, 149, 21, 80, -107, -107, -107, -107, |
| 39, 192, 54, 192, 192, 158, 159, 160, 161, 162, |
-107, -107, 96, 96, 96, 96, -107, -107, -107, -107, |
| 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, |
276, -107, 138, 139, -107, 7, 7, 7, 7, 7, |
| 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, |
| 30, 31, 32, 91, 34, 35, 36, 37, 38, 39, |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, |
| 238, 34, 35, 36, 37, 38, 39, 238, 239, 238, |
7, 7, -107, 21, 7, 35, -107, -107, -107, -107, |
| 239, 239, 9, 10, 11, 12, 13, 14, 15, 16, |
-107, -107, -107, 21, 154, -107, -107, -107, 419, 389, |
| 17, 18, 19, 20, 21, 72, 186, 239, 238, 26, |
356, 284, 135, 135, 148, 148, 191, 191, 135, 135, |
| 27, 28, 241, 30, 31, 32, 56, 34, 35, 36, |
135, 135, 148, 148, 96, 135, 135, 182, 427, 140, |
| 37, 38, 39, 31, 32, 58, 34, 35, 36, 37, |
140, -107, -107, -107, -107, 37, -107, 31, -107, -30, |
| 38, 39, 3, 74, 51, 9, 10, 11, 12, 13, |
-107, -107, -107, -107, 21, -107, 108, -107, 155, -107, |
| 14, 15, 16, 17, 18, 19, 20, 21, 72, 128, |
-107, -107, 21, -107, 7, -107, -107, 37, 161, -107, |
| -1, -1, 26, 27, 28, -1, 30, 31, 32, -1, |
-107, -107, -107 |
| 34, 35, 36, 37, 38, 39, 9, 10, -1, 12, |
|
| 13, 14, 15, 16, 17, 18, 19, 20, 21, -1, |
|
| -1, -1, -1, 26, 27, 28, -1, 30, 31, 32, |
|
| -1, 34, 35, 36, 37, 38, 39, 9, -1, -1, |
|
| 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, |
|
| -1, -1, -1, -1, 26, 27, 28, -1, 30, 31, |
|
| 32, -1, 34, 35, 36, 37, 38, 39, 12, 13, |
|
| 14, 15, 16, 17, 18, 19, 20, 21, -1, -1, |
|
| -1, -1, 26, 27, 28, -1, 30, 31, 32, -1, |
|
| 34, 35, 36, 37, 38, 39, 14, 15, -1, -1, |
|
| -1, -1, 20, 21, -1, -1, -1, -1, 26, -1, |
|
| -1, -1, 30, 31, 32, -1, 34, 35, 36, 37, |
|
| 38, 39, 32, -1, 34, 35, 36, 37, 38, 39 |
|
| }; |
}; |
| #define YYPURE 1 |
|
| |
|
| /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ |
/* YYPGOTO[NTERM-NUM]. */ |
| #line 3 "/usr/share/bison.simple" |
static const yytype_int16 yypgoto[] = |
| /* This file comes from bison-1.28. */ |
{ |
| |
-107, -107, -107, -107, 206, -107, -107, -107, 124, -107, |
| |
-107, -107, -107, 170, -107, -107, -107, 1, -58, -7, |
| |
-106, -107, 0, -107, -107, -6, -107, -107, -21, -107, |
| |
-107, -107, -107, -107, -107, -107, -107, -107, -107, -107, |
| |
-107, 118, -107, -107, -107, 2, -107, -107, -107, -107, |
| |
43, -107, -107, -107, -107, -107, -107, -107, -107, -17, |
| |
-13, -16, -107, -18, 4, 41, -107, -23, 3, -107, |
| |
-107, -107, -107, -107, 181, -107, 183, 239, -107, -107, |
| |
171, 95, -107, 123, -107, 142, -107, -107, 64 |
| |
}; |
| |
|
| /* Skeleton output parser for bison, |
/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If |
| Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc. |
positive, shift that token. If negative, reduce the rule which |
| |
number is the opposite. If YYTABLE_NINF, syntax error. */ |
| |
#define YYTABLE_NINF -173 |
| |
static const yytype_int16 yytable[] = |
| |
{ |
| |
16, 11, 19, 145, 106, 53, 43, 39, -103, 70, |
| |
23, 111, 16, 91, 19, 74, 83, 22, 1, 75, |
| |
65, 254, 76, 57, 57, 1, 86, 255, 51, 87, |
| |
72, 71, 2, 143, 112, 113, 114, 115, 242, 116, |
| |
117, 246, 84, 83, 89, 118, 119, 86, 69, 23, |
| |
43, 39, 120, 121, 63, 24, 23, -172, 25, 122, |
| |
-102, 2, 16, 123, 19, 4, 3, 124, 125, 81, |
| |
58, 58, 4, 3, 108, 16, 110, 19, 59, 4, |
| |
82, 3, 252, 88, 192, 253, 203, 4, 193, 3, |
| |
73, 194, 91, 24, 24, 4, 25, 25, 26, 53, |
| |
27, 24, 144, 85, 25, 26, 16, 82, 19, 16, |
| |
168, 19, 82, 97, 24, 173, 174, 25, 96, 100, |
| |
103, 54, 55, 55, 16, 16, 19, 19, 58, 145, |
| |
-68, -68, 184, 185, 186, 187, 188, 189, 190, 191, |
| |
107, 192, 136, 137, 16, 193, 19, -15, 194, 168, |
| |
139, 145, 171, 172, 173, 174, -102, 135, -95, -95, |
| |
179, 180, 168, 138, 151, 141, 181, 173, 174, 200, |
| |
164, 184, 185, 186, 187, 188, 189, 190, 191, 181, |
| |
188, 189, 190, 191, 184, 185, 186, 187, 188, 189, |
| |
190, 191, 201, 16, 236, 19, 53, 202, 206, -64, |
| |
207, 173, 174, 16, 245, 19, 257, 152, 153, 154, |
| |
155, 262, 52, 156, 157, 158, 159, 134, 160, 185, |
| |
186, 187, 188, 189, 190, 191, 102, 147, 144, 186, |
| |
187, 188, 189, 190, 191, 16, 259, 19, 243, 104, |
| |
261, 260, 47, 105, 16, 256, 19, 128, 163, 0, |
| |
144, 150, 16, 236, 19, 0, 0, 16, 0, 19, |
| |
208, 209, 210, 211, 212, 213, 214, 215, 216, 217, |
| |
218, 219, 220, 221, 222, 223, 224, 225, 226, 227, |
| |
228, 229, 230, 231, 232, 233, 234, 165, 166, 167, |
| |
168, 169, 170, 171, 172, 173, 174, 175, 176, 177, |
| |
178, 179, 180, 173, 174, 0, 0, 181, 0, 0, |
| |
182, 183, 184, 185, 186, 187, 188, 189, 190, 191, |
| |
184, 185, 186, 187, 188, 189, 190, 191, 0, 0, |
| |
0, 0, 0, 205, 165, 166, 167, 168, 169, 170, |
| |
171, 172, 173, 174, 175, 176, 177, 178, 179, 180, |
| |
0, 0, 0, 0, 181, 0, 0, 182, 183, 184, |
| |
185, 186, 187, 188, 189, 190, 191, 165, 166, 0, |
| |
168, 169, 170, 171, 172, 173, 174, 175, 176, 177, |
| |
178, 179, 180, 0, 0, 0, 0, 181, 0, 0, |
| |
182, 183, 184, 185, 186, 187, 188, 189, 190, 191, |
| |
165, 0, 0, 168, 169, 170, 171, 172, 173, 174, |
| |
175, 176, 177, 178, 179, 180, 0, 0, 0, 0, |
| |
181, 0, 0, 182, 183, 184, 185, 186, 187, 188, |
| |
189, 190, 191, 168, 169, 170, 171, 172, 173, 174, |
| |
175, 176, 177, 178, 179, 180, 173, 174, 0, 0, |
| |
181, 0, 0, 182, 183, 184, 185, 186, 187, 188, |
| |
189, 190, 191, 0, 0, 186, 187, 188, 189, 190, |
| |
191 |
| |
}; |
| |
|
| This program is free software; you can redistribute it and/or modify |
#define yypact_value_is_default(yystate) \ |
| it under the terms of the GNU General Public License as published by |
((yystate) == (-107)) |
| 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, |
#define yytable_value_is_error(yytable_value) \ |
| but WITHOUT ANY WARRANTY; without even the implied warranty of |
YYID (0) |
| 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 |
static const yytype_int16 yycheck[] = |
| along with this program; if not, write to the Free Software |
{ |
| Foundation, Inc., 59 Temple Place - Suite 330, |
0, 0, 0, 109, 62, 12, 3, 3, 3, 27, |
| Boston, MA 02111-1307, USA. */ |
4, 4, 12, 4, 12, 49, 39, 4, 4, 53, |
| |
26, 51, 56, 5, 5, 4, 47, 57, 0, 47, |
| /* As a special exception, when this file is copied by Bison into a |
27, 27, 47, 4, 27, 28, 29, 30, 3, 32, |
| Bison output file, you may use that output file without restriction. |
33, 4, 39, 66, 50, 38, 39, 68, 4, 4, |
| This special exception was added by the Free Software Foundation |
47, 47, 45, 46, 4, 49, 4, 48, 52, 52, |
| in version 1.24 of Bison. */ |
55, 47, 62, 56, 62, 58, 52, 60, 61, 4, |
| |
52, 52, 58, 52, 71, 75, 75, 75, 59, 58, |
| /* This is the parser code that is written into each bison parser |
39, 52, 51, 59, 49, 54, 144, 58, 53, 52, |
| when the %semantic_parser declaration is not specified in the grammar. |
3, 56, 4, 49, 49, 58, 52, 52, 53, 106, |
| It was written by Richard Stallman by simplifying the hairy parser |
55, 49, 109, 55, 52, 53, 106, 66, 106, 109, |
| used when %semantic_parser is specified. */ |
14, 109, 71, 4, 49, 19, 20, 52, 54, 55, |
| |
56, 48, 49, 49, 124, 125, 124, 125, 52, 235, |
| #ifndef YYSTACK_USE_ALLOCA |
50, 51, 36, 37, 38, 39, 40, 41, 42, 43, |
| #ifdef alloca |
54, 49, 48, 50, 144, 53, 144, 48, 56, 14, |
| #define YYSTACK_USE_ALLOCA |
4, 257, 17, 18, 19, 20, 55, 93, 50, 51, |
| #else /* alloca not defined */ |
25, 26, 14, 51, 54, 101, 31, 19, 20, 4, |
| #ifdef __GNUC__ |
57, 36, 37, 38, 39, 40, 41, 42, 43, 31, |
| #define YYSTACK_USE_ALLOCA |
40, 41, 42, 43, 36, 37, 38, 39, 40, 41, |
| #define alloca __builtin_alloca |
42, 43, 48, 193, 193, 193, 203, 50, 60, 50, |
| #else /* not GNU C. */ |
61, 19, 20, 203, 50, 203, 51, 112, 113, 114, |
| #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386)) |
115, 50, 6, 118, 119, 120, 121, 93, 123, 37, |
| #define YYSTACK_USE_ALLOCA |
38, 39, 40, 41, 42, 43, 56, 109, 235, 38, |
| #include <alloca.h> |
39, 40, 41, 42, 43, 235, 252, 235, 195, 58, |
| #else /* not sparc */ |
257, 254, 3, 60, 244, 244, 244, 76, 125, -1, |
| /* We think this test detects Watcom and Microsoft C. */ |
257, 109, 252, 252, 252, -1, -1, 257, -1, 257, |
| /* This used to test MSDOS, but that is a bad idea |
165, 166, 167, 168, 169, 170, 171, 172, 173, 174, |
| since that symbol is in the user namespace. */ |
175, 176, 177, 178, 179, 180, 181, 182, 183, 184, |
| #if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__) |
185, 186, 187, 188, 189, 190, 191, 11, 12, 13, |
| #if 0 /* No need for malloc.h, which pollutes the namespace; |
14, 15, 16, 17, 18, 19, 20, 21, 22, 23, |
| instead, just don't use alloca. */ |
24, 25, 26, 19, 20, -1, -1, 31, -1, -1, |
| #include <malloc.h> |
34, 35, 36, 37, 38, 39, 40, 41, 42, 43, |
| #endif |
36, 37, 38, 39, 40, 41, 42, 43, -1, -1, |
| #else /* not MSDOS, or __TURBOC__ */ |
-1, -1, -1, 57, 11, 12, 13, 14, 15, 16, |
| #if defined(_AIX) |
17, 18, 19, 20, 21, 22, 23, 24, 25, 26, |
| /* I don't know what this was needed for, but it pollutes the namespace. |
-1, -1, -1, -1, 31, -1, -1, 34, 35, 36, |
| So I turned it off. rms, 2 May 1997. */ |
37, 38, 39, 40, 41, 42, 43, 11, 12, -1, |
| /* #include <malloc.h> */ |
14, 15, 16, 17, 18, 19, 20, 21, 22, 23, |
| #pragma alloca |
24, 25, 26, -1, -1, -1, -1, 31, -1, -1, |
| #define YYSTACK_USE_ALLOCA |
34, 35, 36, 37, 38, 39, 40, 41, 42, 43, |
| #else /* not MSDOS, or __TURBOC__, or _AIX */ |
11, -1, -1, 14, 15, 16, 17, 18, 19, 20, |
| #if 0 |
21, 22, 23, 24, 25, 26, -1, -1, -1, -1, |
| #ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up, |
31, -1, -1, 34, 35, 36, 37, 38, 39, 40, |
| and on HPUX 10. Eventually we can turn this on. */ |
41, 42, 43, 14, 15, 16, 17, 18, 19, 20, |
| #define YYSTACK_USE_ALLOCA |
21, 22, 23, 24, 25, 26, 19, 20, -1, -1, |
| #define alloca __builtin_alloca |
31, -1, -1, 34, 35, 36, 37, 38, 39, 40, |
| #endif /* __hpux */ |
41, 42, 43, -1, -1, 38, 39, 40, 41, 42, |
| #endif |
43 |
| #endif /* not _AIX */ |
}; |
| #endif /* not MSDOS, or __TURBOC__ */ |
|
| #endif /* not sparc */ |
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing |
| #endif /* not GNU C */ |
symbol of state STATE-NUM. */ |
| #endif /* alloca not defined */ |
static const yytype_uint8 yystos[] = |
| #endif /* YYSTACK_USE_ALLOCA not defined */ |
{ |
| |
0, 4, 47, 52, 58, 63, 64, 65, 66, 67, |
| #ifdef YYSTACK_USE_ALLOCA |
72, 79, 80, 81, 82, 83, 84, 91, 106, 107, |
| #define YYSTACK_ALLOC alloca |
146, 150, 4, 4, 49, 52, 53, 55, 85, 86, |
| #else |
87, 88, 89, 90, 92, 93, 94, 95, 125, 126, |
| #define YYSTACK_ALLOC malloc |
127, 128, 129, 130, 131, 132, 133, 139, 140, 141, |
| #endif |
108, 0, 66, 81, 48, 49, 75, 5, 52, 59, |
| |
137, 138, 134, 4, 136, 87, 126, 130, 139, 4, |
| /* Note: there must be only one dollar sign in this file. |
125, 126, 130, 3, 49, 53, 56, 96, 97, 100, |
| It is replaced by the list of actions, each action |
101, 4, 127, 129, 130, 55, 90, 125, 59, 87, |
| as one case of the switch. */ |
110, 4, 68, 69, 70, 71, 150, 4, 76, 77, |
| |
150, 74, 75, 150, 136, 138, 80, 54, 130, 98, |
| |
79, 4, 27, 28, 29, 30, 32, 33, 38, 39, |
| |
45, 46, 52, 56, 60, 61, 84, 107, 142, 143, |
| |
144, 148, 149, 109, 70, 150, 48, 50, 51, 4, |
| |
78, 150, 135, 4, 81, 82, 102, 103, 104, 105, |
| |
147, 54, 143, 143, 143, 143, 143, 143, 143, 143, |
| |
143, 79, 145, 145, 57, 11, 12, 13, 14, 15, |
| |
16, 17, 18, 19, 20, 21, 22, 23, 24, 25, |
| |
26, 31, 34, 35, 36, 37, 38, 39, 40, 41, |
| |
42, 43, 49, 53, 56, 111, 112, 113, 116, 117, |
| |
4, 48, 50, 80, 99, 57, 60, 61, 143, 143, |
| |
143, 143, 143, 143, 143, 143, 143, 143, 143, 143, |
| |
143, 143, 143, 143, 143, 143, 143, 143, 143, 143, |
| |
143, 143, 143, 143, 143, 114, 79, 120, 123, 119, |
| |
122, 142, 3, 112, 73, 50, 4, 103, 118, 121, |
| |
124, 147, 51, 54, 51, 57, 79, 51, 115, 123, |
| |
122, 121, 50 |
| |
}; |
| |
|
| #define yyerrok (yyerrstatus = 0) |
#define yyerrok (yyerrstatus = 0) |
| #define yyclearin (yychar = YYEMPTY) |
#define yyclearin (yychar = YYEMPTY) |
| #define YYEMPTY -2 |
#define YYEMPTY (-2) |
| #define YYEOF 0 |
#define YYEOF 0 |
| |
|
| #define YYACCEPT goto yyacceptlab |
#define YYACCEPT goto yyacceptlab |
| #define YYABORT goto yyabortlab |
#define YYABORT goto yyabortlab |
| #define YYERROR goto yyerrlab1 |
#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. |
/* Like YYERROR except do call yyerror. This remains here temporarily |
| Once GCC version 2 has supplanted version 1, this can go. */ |
to ease the transition to the new meaning of YYERROR, for GCC. |
| |
Once GCC version 2 has supplanted version 1, this can go. However, |
| |
YYFAIL appears to be in use. Nevertheless, it is formally deprecated |
| |
in Bison 2.4.2's NEWS entry, where a plan to phase it out is |
| |
discussed. */ |
| |
|
| #define YYFAIL goto yyerrlab |
#define YYFAIL goto yyerrlab |
| |
#if defined YYFAIL |
| |
/* This is here to suppress warnings from the GCC cpp's |
| |
-Wunused-macros. Normally we don't worry about that warning, but |
| |
some users do, and we want to make it easy for users to remove |
| |
YYFAIL uses, which will produce warnings from Bison 2.5. */ |
| |
#endif |
| |
|
| #define YYRECOVERING() (!!yyerrstatus) |
#define YYRECOVERING() (!!yyerrstatus) |
| #define YYBACKUP(token, value) \ |
|
| |
#define YYBACKUP(Token, Value) \ |
| do \ |
do \ |
| if (yychar == YYEMPTY && yylen == 1) \ |
if (yychar == YYEMPTY && yylen == 1) \ |
| { yychar = (token), yylval = (value); \ |
{ \ |
| yychar1 = YYTRANSLATE (yychar); \ |
yychar = (Token); \ |
| YYPOPSTACK; \ |
yylval = (Value); \ |
| |
YYPOPSTACK (1); \ |
| goto yybackup; \ |
goto yybackup; \ |
| } \ |
} \ |
| else \ |
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 YYTERROR 1 |
| #define YYERRCODE 256 |
#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 |
#endif |
| |
|
| #ifdef YYPURE |
|
| #ifdef YYLSP_NEEDED |
/* This macro is provided for backward compatibility. */ |
| #ifdef YYLEX_PARAM |
|
| #define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM) |
#ifndef YY_LOCATION_PRINT |
| #else |
# define YY_LOCATION_PRINT(File, Loc) ((void) 0) |
| #define YYLEX yylex(&yylval, &yylloc) |
|
| #endif |
#endif |
| #else /* not YYLSP_NEEDED */ |
|
| |
|
| |
/* YYLEX -- calling `yylex' with the right arguments. */ |
| |
|
| #ifdef YYLEX_PARAM |
#ifdef YYLEX_PARAM |
| #define YYLEX yylex(&yylval, YYLEX_PARAM) |
# define YYLEX yylex (&yylval, YYLEX_PARAM) |
| #else |
#else |
| #define YYLEX yylex(&yylval) |
# define YYLEX yylex (&yylval) |
| #endif |
#endif |
| #endif /* not YYLSP_NEEDED */ |
|
| |
/* 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); \ |
| |
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) |
| |
#else |
| |
static void |
| |
yy_symbol_value_print (yyoutput, yytype, yyvaluep) |
| |
FILE *yyoutput; |
| |
int yytype; |
| |
YYSTYPE const * const yyvaluep; |
| #endif |
#endif |
| |
{ |
| |
if (!yyvaluep) |
| |
return; |
| |
# ifdef YYPRINT |
| |
if (yytype < YYNTOKENS) |
| |
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); |
| |
# else |
| |
YYUSE (yyoutput); |
| |
# endif |
| |
switch (yytype) |
| |
{ |
| |
default: |
| |
break; |
| |
} |
| |
} |
| |
|
| /* If nonreentrant, generate the variables here */ |
|
| |
|
| #ifndef YYPURE |
/*--------------------------------. |
| |
| Print this symbol on YYOUTPUT. | |
| |
`--------------------------------*/ |
| |
|
| int yychar; /* the lookahead symbol */ |
#if (defined __STDC__ || defined __C99__FUNC__ \ |
| YYSTYPE yylval; /* the semantic value of the */ |
|| defined __cplusplus || defined _MSC_VER) |
| /* lookahead symbol */ |
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]); |
| |
|
| #ifdef YYLSP_NEEDED |
yy_symbol_value_print (yyoutput, yytype, yyvaluep); |
| YYLTYPE yylloc; /* location data for the lookahead */ |
YYFPRINTF (yyoutput, ")"); |
| /* symbol */ |
} |
| |
|
| |
/*------------------------------------------------------------------. |
| |
| 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 *yybottom, yytype_int16 *yytop) |
| |
#else |
| |
static void |
| |
yy_stack_print (yybottom, yytop) |
| |
yytype_int16 *yybottom; |
| |
yytype_int16 *yytop; |
| #endif |
#endif |
| |
{ |
| |
YYFPRINTF (stderr, "Stack now"); |
| |
for (; yybottom <= yytop; yybottom++) |
| |
{ |
| |
int yybot = *yybottom; |
| |
YYFPRINTF (stderr, " %d", yybot); |
| |
} |
| |
YYFPRINTF (stderr, "\n"); |
| |
} |
| |
|
| |
# define YY_STACK_PRINT(Bottom, Top) \ |
| |
do { \ |
| |
if (yydebug) \ |
| |
yy_stack_print ((Bottom), (Top)); \ |
| |
} while (YYID (0)) |
| |
|
| |
|
| int yynerrs; /* number of parse errors so far */ |
/*------------------------------------------------. |
| #endif /* not YYPURE */ |
| Report that the YYRULE is going to be reduced. | |
| |
`------------------------------------------------*/ |
| |
|
| #if YYDEBUG != 0 |
#if (defined __STDC__ || defined __C99__FUNC__ \ |
| int yydebug; /* nonzero means print parse trace */ |
|| defined __cplusplus || defined _MSC_VER) |
| /* Since this is uninitialized, it does not stop multiple parsers |
static void |
| from coexisting. */ |
yy_reduce_print (YYSTYPE *yyvsp, int yyrule) |
| |
#else |
| |
static void |
| |
yy_reduce_print (yyvsp, yyrule) |
| |
YYSTYPE *yyvsp; |
| |
int yyrule; |
| #endif |
#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++) |
| |
{ |
| |
YYFPRINTF (stderr, " $%d = ", yyi + 1); |
| |
yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi], |
| |
&(yyvsp[(yyi + 1) - (yynrhs)]) |
| |
); |
| |
YYFPRINTF (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 /* !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 indicates the initial size of the parser's stacks */ |
|
| |
|
| |
/* YYINITDEPTH -- initial size of the parser's stacks. */ |
| #ifndef YYINITDEPTH |
#ifndef YYINITDEPTH |
| #define YYINITDEPTH 200 |
# define YYINITDEPTH 200 |
| #endif |
#endif |
| |
|
| /* YYMAXDEPTH is the maximum size the stacks can grow to |
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only |
| (effective only if the built-in stack extension method is used). */ |
if the built-in stack extension method is used). |
| |
|
| #if YYMAXDEPTH == 0 |
Do not make this value too large; the results are undefined if |
| #undef YYMAXDEPTH |
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) |
| #endif |
evaluated with infinite-precision integer arithmetic. */ |
| |
|
| #ifndef YYMAXDEPTH |
#ifndef YYMAXDEPTH |
| #define YYMAXDEPTH 10000 |
# define YYMAXDEPTH 10000 |
| #endif |
#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 /* GNU C and GNU C++ define this. */ |
|
| #define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT) |
|
| #else /* not GNU C or C++ */ |
|
| #ifndef __cplusplus |
|
| |
|
| /* This is the most reliable way to avoid incompatibilities |
|
| in available built-in functions on various systems. */ |
#if YYERROR_VERBOSE |
| static void |
|
| __yy_memcpy (to, from, count) |
# ifndef yystrlen |
| char *to; |
# if defined __GLIBC__ && defined _STRING_H |
| char *from; |
# define yystrlen strlen |
| unsigned int count; |
# 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 |
| { |
{ |
| register char *f = from; |
YYSIZE_T yylen; |
| register char *t = to; |
for (yylen = 0; yystr[yylen]; yylen++) |
| register int i = count; |
continue; |
| |
return yylen; |
| |
} |
| |
# endif |
| |
# endif |
| |
|
| while (i-- > 0) |
# ifndef yystpcpy |
| *t++ = *f++; |
# 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 |
| |
|
| #else /* __cplusplus */ |
/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message |
| |
about the unexpected token YYTOKEN for the state stack whose top is |
| |
YYSSP. |
| |
|
| |
Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is |
| |
not large enough to hold the message. In that case, also set |
| |
*YYMSG_ALLOC to the required number of bytes. Return 2 if the |
| |
required number of bytes is too large to store. */ |
| |
static int |
| |
yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg, |
| |
yytype_int16 *yyssp, int yytoken) |
| |
{ |
| |
YYSIZE_T yysize0 = yytnamerr (0, yytname[yytoken]); |
| |
YYSIZE_T yysize = yysize0; |
| |
YYSIZE_T yysize1; |
| |
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; |
| |
/* Internationalized format string. */ |
| |
const char *yyformat = 0; |
| |
/* Arguments of yyformat. */ |
| |
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; |
| |
/* Number of reported tokens (one for the "unexpected", one per |
| |
"expected"). */ |
| |
int yycount = 0; |
| |
|
| |
/* There are many possibilities here to consider: |
| |
- Assume YYFAIL is not used. It's too flawed to consider. See |
| |
<http://lists.gnu.org/archive/html/bison-patches/2009-12/msg00024.html> |
| |
for details. YYERROR is fine as it does not invoke this |
| |
function. |
| |
- If this state is a consistent state with a default action, then |
| |
the only way this function was invoked is if the default action |
| |
is an error action. In that case, don't check for expected |
| |
tokens because there are none. |
| |
- The only way there can be no lookahead present (in yychar) is if |
| |
this state is a consistent state with a default action. Thus, |
| |
detecting the absence of a lookahead is sufficient to determine |
| |
that there is no unexpected or expected token to report. In that |
| |
case, just report a simple "syntax error". |
| |
- Don't assume there isn't a lookahead just because this state is a |
| |
consistent state with a default action. There might have been a |
| |
previous inconsistent state, consistent state with a non-default |
| |
action, or user semantic action that manipulated yychar. |
| |
- Of course, the expected token list depends on states to have |
| |
correct lookahead information, and it depends on the parser not |
| |
to perform extra reductions after fetching a lookahead from the |
| |
scanner and before detecting a syntax error. Thus, state merging |
| |
(from LALR or IELR) and default reductions corrupt the expected |
| |
token list. However, the list is correct for canonical LR with |
| |
one exception: it will still contain any token that will not be |
| |
accepted due to an error action in a later state. |
| |
*/ |
| |
if (yytoken != YYEMPTY) |
| |
{ |
| |
int yyn = yypact[*yyssp]; |
| |
yyarg[yycount++] = yytname[yytoken]; |
| |
if (!yypact_value_is_default (yyn)) |
| |
{ |
| |
/* Start YYX at -YYN if negative to avoid negative indexes in |
| |
YYCHECK. In other words, skip the first -YYN actions for |
| |
this state because they are default actions. */ |
| |
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 yyx; |
| |
|
| |
for (yyx = yyxbegin; yyx < yyxend; ++yyx) |
| |
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR |
| |
&& !yytable_value_is_error (yytable[yyx + yyn])) |
| |
{ |
| |
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) |
| |
{ |
| |
yycount = 1; |
| |
yysize = yysize0; |
| |
break; |
| |
} |
| |
yyarg[yycount++] = yytname[yyx]; |
| |
yysize1 = yysize + yytnamerr (0, yytname[yyx]); |
| |
if (! (yysize <= yysize1 |
| |
&& yysize1 <= YYSTACK_ALLOC_MAXIMUM)) |
| |
return 2; |
| |
yysize = yysize1; |
| |
} |
| |
} |
| |
} |
| |
|
| |
switch (yycount) |
| |
{ |
| |
# define YYCASE_(N, S) \ |
| |
case N: \ |
| |
yyformat = S; \ |
| |
break |
| |
YYCASE_(0, YY_("syntax error")); |
| |
YYCASE_(1, YY_("syntax error, unexpected %s")); |
| |
YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s")); |
| |
YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s")); |
| |
YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s")); |
| |
YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s")); |
| |
# undef YYCASE_ |
| |
} |
| |
|
| |
yysize1 = yysize + yystrlen (yyformat); |
| |
if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) |
| |
return 2; |
| |
yysize = yysize1; |
| |
|
| |
if (*yymsg_alloc < yysize) |
| |
{ |
| |
*yymsg_alloc = 2 * yysize; |
| |
if (! (yysize <= *yymsg_alloc |
| |
&& *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM)) |
| |
*yymsg_alloc = YYSTACK_ALLOC_MAXIMUM; |
| |
return 1; |
| |
} |
| |
|
| |
/* 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 = *yymsg; |
| |
int yyi = 0; |
| |
while ((*yyp = *yyformat) != '\0') |
| |
if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount) |
| |
{ |
| |
yyp += yytnamerr (yyp, yyarg[yyi++]); |
| |
yyformat += 2; |
| |
} |
| |
else |
| |
{ |
| |
yyp++; |
| |
yyformat++; |
| |
} |
| |
} |
| |
return 0; |
| |
} |
| |
#endif /* YYERROR_VERBOSE */ |
| |
|
| /* This is the most reliable way to avoid incompatibilities |
/*-----------------------------------------------. |
| in available built-in functions on various systems. */ |
| 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) |
| |
#else |
| static void |
static void |
| __yy_memcpy (char *to, char *from, unsigned int count) |
yydestruct (yymsg, yytype, yyvaluep) |
| |
const char *yymsg; |
| |
int yytype; |
| |
YYSTYPE *yyvaluep; |
| |
#endif |
| { |
{ |
| register char *t = to; |
YYUSE (yyvaluep); |
| register char *f = from; |
|
| register int i = count; |
if (!yymsg) |
| |
yymsg = "Deleting"; |
| |
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); |
| |
|
| while (i-- > 0) |
switch (yytype) |
| *t++ = *f++; |
{ |
| |
|
| |
default: |
| |
break; |
| |
} |
| } |
} |
| |
|
| |
|
| |
/* Prevent warnings from -Wmissing-prototypes. */ |
| |
#ifdef YYPARSE_PARAM |
| |
#if defined __STDC__ || defined __cplusplus |
| |
int yyparse (void *YYPARSE_PARAM); |
| |
#else |
| |
int yyparse (); |
| #endif |
#endif |
| |
#else /* ! YYPARSE_PARAM */ |
| |
#if defined __STDC__ || defined __cplusplus |
| |
int yyparse (void); |
| |
#else |
| |
int yyparse (); |
| #endif |
#endif |
| |
#endif /* ! YYPARSE_PARAM */ |
| #line 217 "/usr/share/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 |
| yyparse. | |
| #define YYPARSE_PARAM_ARG void *YYPARSE_PARAM |
`----------*/ |
| #define YYPARSE_PARAM_DECL |
|
| #else /* not __cplusplus */ |
|
| #define YYPARSE_PARAM_ARG YYPARSE_PARAM |
|
| #define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; |
|
| #endif /* not __cplusplus */ |
|
| #else /* not YYPARSE_PARAM */ |
|
| #define YYPARSE_PARAM_ARG |
|
| #define YYPARSE_PARAM_DECL |
|
| #endif /* not YYPARSE_PARAM */ |
|
| |
|
| /* Prevent warning if -Wstrict-prototypes. */ |
|
| #ifdef __GNUC__ |
|
| #ifdef YYPARSE_PARAM |
#ifdef YYPARSE_PARAM |
| int yyparse (void *); |
#if (defined __STDC__ || defined __C99__FUNC__ \ |
| |
|| defined __cplusplus || defined _MSC_VER) |
| |
int |
| |
yyparse (void *YYPARSE_PARAM) |
| #else |
#else |
| int yyparse (void); |
int |
| #endif |
yyparse (YYPARSE_PARAM) |
| |
void *YYPARSE_PARAM; |
| #endif |
#endif |
| |
#else /* ! YYPARSE_PARAM */ |
| |
#if (defined __STDC__ || defined __C99__FUNC__ \ |
| |
|| defined __cplusplus || defined _MSC_VER) |
| |
int |
| |
yyparse (void) |
| |
#else |
| int |
int |
| yyparse(YYPARSE_PARAM_ARG) |
yyparse () |
| YYPARSE_PARAM_DECL |
|
| |
#endif |
| |
#endif |
| { |
{ |
| register int yystate; |
/* The lookahead symbol. */ |
| register int yyn; |
int yychar; |
| register short *yyssp; |
|
| register YYSTYPE *yyvsp; |
|
| int yyerrstatus; /* number of tokens to shift before error messages enabled */ |
|
| int yychar1 = 0; /* lookahead token as an internal (translated) token number */ |
|
| |
|
| short yyssa[YYINITDEPTH]; /* the state stack */ |
/* The semantic value of the lookahead symbol. */ |
| YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ |
YYSTYPE yylval; |
| |
|
| short *yyss = yyssa; /* refer to the stacks thru separate pointers */ |
/* Number of syntax errors so far. */ |
| YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ |
int yynerrs; |
| |
|
| #ifdef YYLSP_NEEDED |
int yystate; |
| YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ |
/* Number of tokens to shift before error messages enabled. */ |
| YYLTYPE *yyls = yylsa; |
int yyerrstatus; |
| YYLTYPE *yylsp; |
|
| |
|
| #define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) |
/* The stacks and their tools: |
| #else |
`yyss': related to states. |
| #define YYPOPSTACK (yyvsp--, yyssp--) |
`yyvs': related to semantic values. |
| #endif |
|
| |
|
| int yystacksize = YYINITDEPTH; |
Refer to the stacks thru separate pointers, to allow yyoverflow |
| int yyfree_stacks = 0; |
to reallocate them elsewhere. */ |
| |
|
| #ifdef YYPURE |
/* The state stack. */ |
| int yychar; |
yytype_int16 yyssa[YYINITDEPTH]; |
| YYSTYPE yylval; |
yytype_int16 *yyss; |
| int yynerrs; |
yytype_int16 *yyssp; |
| #ifdef YYLSP_NEEDED |
|
| YYLTYPE yylloc; |
/* The semantic value stack. */ |
| #endif |
YYSTYPE yyvsa[YYINITDEPTH]; |
| #endif |
YYSTYPE *yyvs; |
| |
YYSTYPE *yyvsp; |
| |
|
| YYSTYPE yyval; /* the variable used to return */ |
YYSIZE_T yystacksize; |
| /* semantic values from the action */ |
|
| /* routines */ |
|
| |
|
| int yylen; |
int yyn; |
| |
int yyresult; |
| |
/* Lookahead token as an internal (translated) token number. */ |
| |
int yytoken; |
| |
/* The variables used to return semantic value and location from the |
| |
action routines. */ |
| |
YYSTYPE yyval; |
| |
|
| #if YYDEBUG != 0 |
#if YYERROR_VERBOSE |
| if (yydebug) |
/* Buffer for error messages, and its allocated size. */ |
| fprintf(stderr, "Starting parse\n"); |
char yymsgbuf[128]; |
| |
char *yymsg = yymsgbuf; |
| |
YYSIZE_T yymsg_alloc = sizeof yymsgbuf; |
| #endif |
#endif |
| |
|
| |
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N)) |
| |
|
| |
/* The number of symbols on the RHS of the reduced rule. |
| |
Keep to zero when no symbol should be popped. */ |
| |
int yylen = 0; |
| |
|
| |
yytoken = 0; |
| |
yyss = yyssa; |
| |
yyvs = yyvsa; |
| |
yystacksize = YYINITDEPTH; |
| |
|
| |
YYDPRINTF ((stderr, "Starting parse\n")); |
| |
|
| yystate = 0; |
yystate = 0; |
| yyerrstatus = 0; |
yyerrstatus = 0; |
| yynerrs = 0; |
yynerrs = 0; |
| yychar = YYEMPTY; /* Cause a token to be read. */ |
yychar = YYEMPTY; /* Cause a token to be read. */ |
| |
|
| /* Initialize stack pointers. |
/* Initialize stack pointers. |
| Waste one element of value and location stack |
Waste one element of value and location stack |
| so that they stay on the same level as the state stack. |
so that they stay on the same level as the state stack. |
| The wasted elements are never initialized. */ |
The wasted elements are never initialized. */ |
| |
yyssp = yyss; |
| yyssp = yyss - 1; |
|
| yyvsp = yyvs; |
yyvsp = yyvs; |
| #ifdef YYLSP_NEEDED |
|
| yylsp = yyls; |
|
| #endif |
|
| |
|
| /* Push a new state, which is found in yystate . */ |
goto yysetstate; |
| /* In all cases, when you get here, the value and location stacks |
|
| have just been pushed. so pushing a state here evens the stacks. */ |
|
| yynewstate: |
|
| |
|
| *++yyssp = yystate; |
/*------------------------------------------------------------. |
| |
| 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) |
yysetstate: |
| { |
*yyssp = yystate; |
| /* Give user a chance to reallocate the stack */ |
|
| /* Use copies of these so that the &'s don't force the real ones into memory. */ |
|
| YYSTYPE *yyvs1 = yyvs; |
|
| short *yyss1 = yyss; |
|
| #ifdef YYLSP_NEEDED |
|
| YYLTYPE *yyls1 = yyls; |
|
| #endif |
|
| |
|
| |
if (yyss + yystacksize - 1 <= yyssp) |
| |
{ |
| /* Get the current used size of the three stacks, in elements. */ |
/* Get the current used size of the three stacks, in elements. */ |
| int size = yyssp - yyss + 1; |
YYSIZE_T yysize = yyssp - yyss + 1; |
| |
|
| #ifdef yyoverflow |
#ifdef yyoverflow |
| /* Each stack pointer address is followed by the size of |
{ |
| the data in use in that stack, in bytes. */ |
/* Give user a chance to reallocate the stack. Use copies of |
| #ifdef YYLSP_NEEDED |
these so that the &'s don't force the real ones into |
| /* This used to be a conditional around just the two extra args, |
memory. */ |
| but that might be undefined if yyoverflow is a macro. */ |
YYSTYPE *yyvs1 = yyvs; |
| yyoverflow("parser stack overflow", |
yytype_int16 *yyss1 = yyss; |
| &yyss1, size * sizeof (*yyssp), |
|
| &yyvs1, size * sizeof (*yyvsp), |
/* Each stack pointer address is followed by the size of the |
| &yyls1, size * sizeof (*yylsp), |
data in use in that stack, in bytes. This used to be a |
| &yystacksize); |
conditional around just the two extra args, but that might |
| #else |
be undefined if yyoverflow is a macro. */ |
| yyoverflow("parser stack overflow", |
yyoverflow (YY_("memory exhausted"), |
| &yyss1, size * sizeof (*yyssp), |
&yyss1, yysize * sizeof (*yyssp), |
| &yyvs1, size * sizeof (*yyvsp), |
&yyvs1, yysize * sizeof (*yyvsp), |
| &yystacksize); |
&yystacksize); |
| #endif |
|
| |
yyss = yyss1; |
| yyss = yyss1; yyvs = yyvs1; |
yyvs = yyvs1; |
| #ifdef YYLSP_NEEDED |
} |
| yyls = yyls1; |
|
| #endif |
|
| #else /* no yyoverflow */ |
#else /* no yyoverflow */ |
| |
# ifndef YYSTACK_RELOCATE |
| |
goto yyexhaustedlab; |
| |
# else |
| /* Extend the stack our own way. */ |
/* Extend the stack our own way. */ |
| if (yystacksize >= YYMAXDEPTH) |
if (YYMAXDEPTH <= yystacksize) |
| { |
goto yyexhaustedlab; |
| yyerror("parser stack overflow"); |
|
| if (yyfree_stacks) |
|
| { |
|
| free (yyss); |
|
| free (yyvs); |
|
| #ifdef YYLSP_NEEDED |
|
| free (yyls); |
|
| #endif |
|
| } |
|
| return 2; |
|
| } |
|
| yystacksize *= 2; |
yystacksize *= 2; |
| if (yystacksize > YYMAXDEPTH) |
if (YYMAXDEPTH < yystacksize) |
| yystacksize = YYMAXDEPTH; |
yystacksize = YYMAXDEPTH; |
| #ifndef YYSTACK_USE_ALLOCA |
|
| yyfree_stacks = 1; |
{ |
| #endif |
yytype_int16 *yyss1 = yyss; |
| yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp)); |
union yyalloc *yyptr = |
| __yy_memcpy ((char *)yyss, (char *)yyss1, |
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); |
| size * (unsigned int) sizeof (*yyssp)); |
if (! yyptr) |
| yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp)); |
goto yyexhaustedlab; |
| __yy_memcpy ((char *)yyvs, (char *)yyvs1, |
YYSTACK_RELOCATE (yyss_alloc, yyss); |
| size * (unsigned int) sizeof (*yyvsp)); |
YYSTACK_RELOCATE (yyvs_alloc, yyvs); |
| #ifdef YYLSP_NEEDED |
# undef YYSTACK_RELOCATE |
| yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp)); |
if (yyss1 != yyssa) |
| __yy_memcpy ((char *)yyls, (char *)yyls1, |
YYSTACK_FREE (yyss1); |
| size * (unsigned int) sizeof (*yylsp)); |
} |
| #endif |
# endif |
| #endif /* no yyoverflow */ |
#endif /* no yyoverflow */ |
| |
|
| yyssp = yyss + size - 1; |
yyssp = yyss + yysize - 1; |
| yyvsp = yyvs + size - 1; |
yyvsp = yyvs + yysize - 1; |
| #ifdef YYLSP_NEEDED |
|
| yylsp = yyls + size - 1; |
|
| #endif |
|
| |
|
| #if YYDEBUG != 0 |
YYDPRINTF ((stderr, "Stack size increased to %lu\n", |
| if (yydebug) |
(unsigned long int) yystacksize)); |
| fprintf(stderr, "Stack size increased to %d\n", yystacksize); |
|
| #endif |
|
| |
|
| if (yyssp >= yyss + yystacksize - 1) |
if (yyss + yystacksize - 1 <= yyssp) |
| YYABORT; |
YYABORT; |
| } |
} |
| |
|
| #if YYDEBUG != 0 |
YYDPRINTF ((stderr, "Entering state %d\n", yystate)); |
| if (yydebug) |
|
| fprintf(stderr, "Entering state %d\n", yystate); |
if (yystate == YYFINAL) |
| #endif |
YYACCEPT; |
| |
|
| goto yybackup; |
goto yybackup; |
| yybackup: |
|
| |
|
| /* Do appropriate processing given the current state. */ |
/*-----------. |
| /* Read a lookahead token if we need one and don't already have one. */ |
| yybackup. | |
| /* yyresume: */ |
`-----------*/ |
| |
yybackup: |
| |
|
| /* First try to decide what to do without reference to lookahead token. */ |
/* Do appropriate processing given the current state. Read a |
| |
lookahead token if we need one and don't already have one. */ |
| |
|
| |
/* First try to decide what to do without reference to lookahead token. */ |
| yyn = yypact[yystate]; |
yyn = yypact[yystate]; |
| if (yyn == YYFLAG) |
if (yypact_value_is_default (yyn)) |
| goto yydefault; |
goto yydefault; |
| |
|
| /* Not known => get a lookahead token if don't already have one. */ |
/* Not known => get a lookahead token if don't already have one. */ |
| |
|
| /* yychar is either YYEMPTY or YYEOF |
/* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ |
| or a valid token in external form. */ |
|
| |
|
| if (yychar == YYEMPTY) |
if (yychar == YYEMPTY) |
| { |
{ |
| #if YYDEBUG != 0 |
YYDPRINTF ((stderr, "Reading a token: ")); |
| if (yydebug) |
|
| fprintf(stderr, "Reading a token: "); |
|
| #endif |
|
| yychar = YYLEX; |
yychar = YYLEX; |
| } |
} |
| |
|
| /* Convert token to internal form (in yychar1) for indexing tables with */ |
if (yychar <= YYEOF) |
| |
|
| if (yychar <= 0) /* This means end of input. */ |
|
| { |
{ |
| yychar1 = 0; |
yychar = yytoken = YYEOF; |
| yychar = YYEOF; /* Don't call YYLEX any more */ |
YYDPRINTF ((stderr, "Now at end of input.\n")); |
| |
|
| #if YYDEBUG != 0 |
|
| if (yydebug) |
|
| fprintf(stderr, "Now at end of input.\n"); |
|
| #endif |
|
| } |
} |
| else |
else |
| { |
{ |
| yychar1 = YYTRANSLATE(yychar); |
yytoken = YYTRANSLATE (yychar); |
| |
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); |
| #if YYDEBUG != 0 |
|
| if (yydebug) |
|
| { |
|
| fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); |
|
| /* Give the individual parser a way to print the precise meaning |
|
| of a token, for further debugging info. */ |
|
| #ifdef YYPRINT |
|
| YYPRINT (stderr, yychar, yylval); |
|
| #endif |
|
| fprintf (stderr, ")\n"); |
|
| } |
|
| #endif |
|
| } |
} |
| |
|
| yyn += yychar1; |
/* If the proper action on seeing token YYTOKEN is to reduce or to |
| if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) |
detect an error, take that action. */ |
| |
yyn += yytoken; |
| |
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) |
| goto yydefault; |
goto yydefault; |
| |
|
| yyn = yytable[yyn]; |
yyn = yytable[yyn]; |
| |
if (yyn <= 0) |
| /* yyn is what to do for this token type in this state. |
|
| Negative => reduce, -yyn is rule number. |
|
| Positive => shift, yyn is new state. |
|
| New state is final state => don't bother to shift, |
|
| just return success. |
|
| 0, or most negative number => error. */ |
|
| |
|
| if (yyn < 0) |
|
| { |
{ |
| if (yyn == YYFLAG) |
if (yytable_value_is_error (yyn)) |
| goto yyerrlab; |
goto yyerrlab; |
| yyn = -yyn; |
yyn = -yyn; |
| goto yyreduce; |
goto yyreduce; |
| } |
} |
| else if (yyn == 0) |
|
| goto yyerrlab; |
|
| |
|
| if (yyn == YYFINAL) |
/* Count tokens shifted since error; after three, turn off error |
| YYACCEPT; |
status. */ |
| |
if (yyerrstatus) |
| |
yyerrstatus--; |
| |
|
| /* Shift the lookahead token. */ |
/* Shift the lookahead token. */ |
| |
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); |
| |
|
| #if YYDEBUG != 0 |
/* Discard the shifted token. */ |
| if (yydebug) |
yychar = YYEMPTY; |
| fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); |
|
| #endif |
|
| |
|
| /* Discard the token being shifted unless it is eof. */ |
|
| if (yychar != YYEOF) |
|
| yychar = YYEMPTY; |
|
| |
|
| |
yystate = yyn; |
| *++yyvsp = yylval; |
*++yyvsp = yylval; |
| #ifdef YYLSP_NEEDED |
|
| *++yylsp = yylloc; |
|
| #endif |
|
| |
|
| /* count tokens shifted since error; after three, turn off error status. */ |
|
| if (yyerrstatus) yyerrstatus--; |
|
| |
|
| yystate = yyn; |
|
| goto yynewstate; |
goto yynewstate; |
| |
|
| /* Do the default action for the current state. */ |
|
| yydefault: |
|
| |
|
| |
/*-----------------------------------------------------------. |
| |
| yydefault -- do the default action for the current state. | |
| |
`-----------------------------------------------------------*/ |
| |
yydefault: |
| yyn = yydefact[yystate]; |
yyn = yydefact[yystate]; |
| if (yyn == 0) |
if (yyn == 0) |
| goto yyerrlab; |
goto yyerrlab; |
| |
goto yyreduce; |
| |
|
| /* Do a reduction. yyn is the number of a rule to reduce with. */ |
|
| |
/*-----------------------------. |
| |
| yyreduce -- Do a reduction. | |
| |
`-----------------------------*/ |
| yyreduce: |
yyreduce: |
| |
/* yyn is the number of a rule to reduce with. */ |
| yylen = yyr2[yyn]; |
yylen = yyr2[yyn]; |
| if (yylen > 0) |
|
| yyval = yyvsp[1-yylen]; /* implement default value of the action */ |
|
| |
|
| #if YYDEBUG != 0 |
/* If YYLEN is nonzero, implement the default value of the action: |
| if (yydebug) |
`$$ = $1'. |
| { |
|
| int i; |
|
| |
|
| fprintf (stderr, "Reducing via rule %d (line %d), ", |
Otherwise, the following line sets YYVAL to garbage. |
| yyn, yyrline[yyn]); |
This behavior is undocumented and Bison |
| |
users should not rely upon it. Assigning to YYVAL |
| /* Print the symbols being reduced, and their result. */ |
unconditionally makes the parser a bit smaller, and it avoids a |
| for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) |
GCC warning that YYVAL may be used uninitialized. */ |
| fprintf (stderr, "%s ", yytname[yyrhs[i]]); |
yyval = yyvsp[1-yylen]; |
| fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); |
|
| } |
|
| #endif |
|
| |
|
| |
|
| switch (yyn) { |
YY_REDUCE_PRINT (yyn); |
| |
switch (yyn) |
| |
{ |
| |
case 2: |
| |
|
| case 1: |
/* Line 1806 of yacc.c */ |
| #line 108 "compile.y" |
#line 142 "compile.y" |
| { |
{ |
| Method& method=*NEW Method(POOL, |
Method* method=new Method(Method::CT_ANY, |
| *main_method_name, |
|
| Method::CT_ANY, |
|
| 0, 0, /*min, max numbered_params_count*/ |
0, 0, /*min, max numbered_params_count*/ |
| 0/*param_names*/, 0/*local_names*/, |
0/*param_names*/, 0/*local_names*/, |
| yyvsp[0]/*parser_code*/, 0/*native_code*/); |
(yyvsp[(1) - (1)])/*parser_code*/, 0/*native_code*/); |
| PC.cclass->add_method(*main_method_name, method); |
PC.cclass->set_method(PC.alias_method(main_method_name), method); |
| ; |
} |
| break;} |
break; |
| case 8: |
|
| #line 125 "compile.y" |
case 9: |
| { |
|
| const String& command=*LA2S(yyvsp[-2]); |
/* Line 1806 of yacc.c */ |
| YYSTYPE strings_code=yyvsp[0]; |
#line 157 "compile.y" |
| if(strings_code->size()<1*2) { |
{ |
| |
const String& command=LA2S(*(yyvsp[(2) - (4)]))->trim(String::TRIM_END); |
| |
YYSTYPE strings_code=(yyvsp[(4) - (4)]); |
| |
if(strings_code->count()<1*OPERATIONS_PER_OPVALUE) { |
| strcpy(PC.error, "@"); |
strcpy(PC.error, "@"); |
| strcat(PC.error, command.cstr()); |
strcat(PC.error, command.cstr()); |
| strcat(PC.error, " is empty"); |
strcat(PC.error, " is empty"); |
| YYERROR; |
YYERROR; |
| } |
} |
| if(command==CLASS_NAME) { |
if(command==CLASS_NAME) { |
| if(PC.cclass->base()) { // already changed from default? |
if(strings_code->count()==1*OPERATIONS_PER_OPVALUE) { |
| strcpy(PC.error, "class already have a name '"); |
CLASS_ADD; |
| strncat(PC.error, PC.cclass->name().cstr(), 100); |
|
| strcat(PC.error, "'"); |
|
| YYERROR; |
|
| } |
|
| if(strings_code->size()==1*2) { |
|
| // new class' name |
// new class' name |
| const String *name=LA2S(strings_code); |
const String& name=LA2S(*strings_code)->trim(String::TRIM_END); |
| // creating the class |
// creating the class |
| PC.cclass=NEW VClass(POOL); |
VStateless_class* cclass=new VClass; |
| PC.cclass->set_name(*name); |
PC.cclass_new=cclass; |
| // append to request's classes |
PC.cclass_new->set_name(name); |
| PC.request->classes().put(*name, PC.cclass); |
PC.append=false; |
| } else { |
} else { |
| strcpy(PC.error, "@"CLASS_NAME" must contain sole name"); |
strcpy(PC.error, "@" CLASS_NAME " must contain only one line with class name (contains more then one)"); |
| YYERROR; |
YYERROR; |
| } |
} |
| } else if(command==USE_CONTROL_METHOD_NAME) { |
} else if(command==USE_CONTROL_METHOD_NAME) { |
| for(int i=0; i<strings_code->size(); i+=2) |
CLASS_ADD; |
| PC.request->use_file(*LA2S(strings_code, i)); |
for(size_t i=0; i<strings_code->count(); i+=OPERATIONS_PER_OPVALUE) |
| |
PC.request.use_file(PC.request.main_class, LA2S(*strings_code, i)->trim(String::TRIM_END), PC.request.get_used_filename(PC.file_no)); |
| } else if(command==BASE_NAME) { |
} else if(command==BASE_NAME) { |
| if(PC.cclass->base()) { // already changed from default? |
if(PC.append){ |
| |
strcpy(PC.error, "can't set base while appending methods to class '"); |
| |
strncat(PC.error, PC.cclass->name().cstr(), MAX_STRING/2); |
| |
strcat(PC.error, "'"); |
| |
YYERROR; |
| |
} |
| |
CLASS_ADD; |
| |
if(PC.cclass->base_class()) { // already changed from default? |
| strcpy(PC.error, "class already have a base '"); |
strcpy(PC.error, "class already have a base '"); |
| strncat(PC.error, PC.cclass->base()->name().cstr(), 100); |
strncat(PC.error, PC.cclass->base_class()->name().cstr(), MAX_STRING/2); |
| strcat(PC.error, "'"); |
strcat(PC.error, "'"); |
| YYERROR; |
YYERROR; |
| } |
} |
| if(strings_code->size()==1*2) { |
if(strings_code->count()==1*OPERATIONS_PER_OPVALUE) { |
| const String& base_name=*LA2S(strings_code); |
const String& base_name=LA2S(*strings_code)->trim(String::TRIM_END); |
| VClass *base=static_cast<VClass *>( |
if(Value* base_class_value=PC.request.get_class(base_name)) { |
| PC.request->classes().get(base_name)); |
// @CLASS == @BASE sanity check |
| if(!base) { |
if(VStateless_class *base_class=base_class_value->get_class()) { |
| |
if(PC.cclass==base_class) { |
| |
strcpy(PC.error, "@" CLASS_NAME " equals @" BASE_NAME); |
| |
YYERROR; |
| |
} |
| |
PC.cclass->get_class()->set_base(base_class); |
| |
} else { // they asked to derive from a class without methods ['env' & co] |
| |
strcpy(PC.error, base_name.cstr()); |
| |
strcat(PC.error, ": you can not derive from this class in @" BASE_NAME); |
| |
YYERROR; |
| |
} |
| |
} else { |
| strcpy(PC.error, base_name.cstr()); |
strcpy(PC.error, base_name.cstr()); |
| strcat(PC.error, ": undefined class in @"BASE_NAME); |
strcat(PC.error, ": undefined class in @" BASE_NAME); |
| YYERROR; |
YYERROR; |
| } |
} |
| // @CLASS == @BASE sanity check |
|
| if(PC.cclass==base) { |
|
| strcpy(PC.error, "@"CLASS_NAME" equals @"BASE_NAME); |
|
| YYERROR; |
|
| } |
|
| PC.cclass->set_base(*base); |
|
| } else { |
} else { |
| strcpy(PC.error, "@"BASE_NAME" must contain sole name"); |
strcpy(PC.error, "@" BASE_NAME " must contain sole name"); |
| YYERROR; |
YYERROR; |
| } |
} |
| |
} else if(command==OPTIONS_CONTROL_METHOD_NAME) { |
| |
for(size_t i=0; i<strings_code->count(); i+=OPERATIONS_PER_OPVALUE) { |
| |
const String& option=LA2S(*strings_code, i)->trim(String::TRIM_END); |
| |
if(option==OPTION_ALL_VARS_LOCAL_NAME){ |
| |
PC.set_all_vars_local(); |
| |
} else if(option==OPTION_PARTIAL_CLASS){ |
| |
if(PC.cclass_new){ |
| |
if(VStateless_class* existed=PC.get_existed_class(PC.cclass_new)){ |
| |
if(!PC.reuse_existed_class(existed)){ |
| |
strcpy(PC.error, "can't append methods to '"); |
| |
strncat(PC.error, PC.cclass_new->name().cstr(), MAX_STRING/2); |
| |
strcat(PC.error, "' - the class wasn't marked as partial"); |
| |
YYERROR; |
| |
} |
| |
} else { |
| |
// marks the new class as partial. we will be able to add methods here later. |
| |
PC.cclass_new->set_partial(); |
| |
} |
| |
} else { |
| |
strcpy(PC.error, "'" OPTION_PARTIAL_CLASS "' option should be used straight after @" CLASS_NAME); |
| |
YYERROR; |
| |
} |
| |
} else if(option==method_call_type_static){ |
| |
PC.set_methods_call_type(Method::CT_STATIC); |
| |
} else if(option==method_call_type_dynamic){ |
| |
PC.set_methods_call_type(Method::CT_DYNAMIC); |
| |
} else { |
| |
strcpy(PC.error, "'"); |
| |
strncat(PC.error, option.cstr(), MAX_STRING/2); |
| |
strcat(PC.error, "' invalid option. valid options are " |
| |
"'" OPTION_PARTIAL_CLASS "', '" OPTION_ALL_VARS_LOCAL_NAME "'" |
| |
", '" METHOD_CALL_TYPE_STATIC "' and '" METHOD_CALL_TYPE_DYNAMIC "'" |
| |
); |
| |
YYERROR; |
| |
} |
| |
} |
| } else { |
} else { |
| strcpy(PC.error, "'"); |
strcpy(PC.error, "'"); |
| strncat(PC.error, command.cstr(), MAX_STRING/2); |
strncat(PC.error, command.cstr(), MAX_STRING/2); |
| strcat(PC.error, "' invalid special name. valid names are " |
strcat(PC.error, "' invalid special name. valid names are " |
| "'"CLASS_NAME"', '"USE_CONTROL_METHOD_NAME"' and '"BASE_NAME"'"); |
"'" CLASS_NAME "', '" USE_CONTROL_METHOD_NAME "', '" BASE_NAME "' and '" OPTIONS_CONTROL_METHOD_NAME "'."); |
| YYERROR; |
YYERROR; |
| } |
} |
| ; |
} |
| break;} |
break; |
| case 12: |
|
| #line 191 "compile.y" |
case 13: |
| { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ; |
|
| break;} |
/* Line 1806 of yacc.c */ |
| case 16: |
#line 267 "compile.y" |
| #line 196 "compile.y" |
{ (yyval)=(yyvsp[(1) - (2)]); P(*(yyval), *(yyvsp[(2) - (2)])); } |
| { |
break; |
| const String *name=LA2S(yyvsp[-5]); |
|
| |
case 17: |
| YYSTYPE params_names_code=yyvsp[-4]; |
|
| Array *params_names=0; |
/* Line 1806 of yacc.c */ |
| if(int size=params_names_code->size()) { |
#line 271 "compile.y" |
| params_names=NEW Array(POOL); |
{ |
| for(int i=0; i<size; i+=2) |
CLASS_ADD; |
| *params_names+=LA2S(params_names_code, i); |
PC.explicit_result=false; |
| } |
|
| |
YYSTYPE params_names_code=(yyvsp[(3) - (6)]); |
| YYSTYPE locals_names_code=yyvsp[-3]; |
ArrayString* params_names=0; |
| Array *locals_names=0; |
if(int size=params_names_code->count()) { |
| if(int size=locals_names_code->size()) { |
params_names=new ArrayString; |
| locals_names=NEW Array(POOL); |
for(int i=0; i<size; i+=OPERATIONS_PER_OPVALUE) |
| for(int i=0; i<size; i+=2) |
*params_names+=LA2S(*params_names_code, i); |
| *locals_names+=LA2S(locals_names_code, i); |
} |
| } |
|
| |
YYSTYPE locals_names_code=(yyvsp[(4) - (6)]); |
| Method& method=*NEW Method(POOL, |
ArrayString* locals_names=0; |
| *name, |
bool all_vars_local=false; |
| Method::CT_ANY, |
if(int size=locals_names_code->count()) { |
| |
locals_names=new ArrayString; |
| |
for(int i=0; i<size; i+=OPERATIONS_PER_OPVALUE) { |
| |
const String* local_name=LA2S(*locals_names_code, i); |
| |
if(*local_name==RESULT_VAR_NAME) |
| |
PC.explicit_result=true; |
| |
else if(*local_name==OPTION_ALL_VARS_LOCAL_NAME) |
| |
all_vars_local=true; |
| |
else |
| |
*locals_names+=local_name; |
| |
} |
| |
} |
| |
if(!all_vars_local && PC.cclass && PC.cclass->is_vars_local()) |
| |
all_vars_local=true; |
| |
|
| |
Method* method=new Method( |
| |
//name, |
| |
GetMethodCallType(PC, *(yyvsp[(2) - (6)])), |
| 0, 0/*min,max numbered_params_count*/, |
0, 0/*min,max numbered_params_count*/, |
| params_names, locals_names, |
params_names, locals_names, |
| yyvsp[0], 0); |
0/*to be filled later in next {} */, 0, all_vars_local); |
| PC.cclass->add_method(*name, method); |
|
| ; |
*reinterpret_cast<Method**>(&(yyval))=method; |
| break;} |
} |
| case 19: |
break; |
| #line 225 "compile.y" |
|
| {yyval=yyvsp[-1]; |
case 18: |
| break;} |
|
| case 23: |
/* Line 1806 of yacc.c */ |
| #line 227 "compile.y" |
#line 309 "compile.y" |
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]) ; |
{ |
| break;} |
Method* method=reinterpret_cast<Method*>((yyvsp[(7) - (8)])); |
| case 29: |
// fill in the code |
| #line 235 "compile.y" |
method->parser_code=(yyvsp[(8) - (8)]); |
| { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ; |
|
| break;} |
// register in class |
| case 35: |
const String& name=*LA2S(*(yyvsp[(2) - (8)])); |
| #line 241 "compile.y" |
PC.cclass->set_method(PC.alias_method(name), method); |
| { |
} |
| yyval=yyvsp[0]; /* stack: resulting value */ |
break; |
| O(yyval, OP_WRITE_VALUE); /* value=pop; wcontext.write(value) */ |
|
| ; |
case 21: |
| break;} |
|
| case 36: |
/* Line 1806 of yacc.c */ |
| #line 245 "compile.y" |
#line 320 "compile.y" |
| { yyval=yyvsp[0] ; |
{(yyval)=(yyvsp[(2) - (3)]);} |
| break;} |
break; |
| case 39: |
|
| #line 247 "compile.y" |
case 25: |
| { yyval=yyvsp[-1] ; |
|
| break;} |
/* Line 1806 of yacc.c */ |
| case 42: |
#line 322 "compile.y" |
| #line 251 "compile.y" |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); } |
| { |
break; |
| yyval=N(POOL); |
|
| Array *diving_code=yyvsp[0]; |
case 31: |
| const String *first_name=LA2S(diving_code); |
|
| if(first_name && *first_name==SELF_ELEMENT_NAME) { |
/* Line 1806 of yacc.c */ |
| O(yyval, OP_WITH_SELF); /* stack: starting context */ |
#line 330 "compile.y" |
| P(yyval, diving_code, |
{ (yyval)=(yyvsp[(1) - (2)]); P(*(yyval), *(yyvsp[(2) - (2)])); } |
| /* skip over... */ |
break; |
| diving_code->size()>2?3/*OP_+string+get_element*/:2/*OP_+string*/); |
|
| } else { |
case 37: |
| O(yyval, OP_WITH_READ); /* stack: starting context */ |
|
| P(yyval, diving_code); |
/* Line 1806 of yacc.c */ |
| |
#line 336 "compile.y" |
| |
{ |
| |
(yyval)=N(); |
| |
YYSTYPE code=(yyvsp[(1) - (1)]); |
| |
size_t count=code->count(); |
| |
|
| |
#ifdef OPTIMIZE_BYTECODE_GET_ELEMENT |
| |
if( |
| |
count!=3 |
| |
|| !change_first(*code, OP::OP_VALUE__GET_ELEMENT, /*=>*/OP::OP_VALUE__GET_ELEMENT__WRITE) |
| |
) |
| |
#endif |
| |
|
| |
#ifdef OPTIMIZE_BYTECODE_GET_SELF_ELEMENT |
| |
if( |
| |
count!=3 |
| |
|| !change_first(*code, OP::OP_WITH_SELF__VALUE__GET_ELEMENT, /*=>*/OP::OP_WITH_SELF__VALUE__GET_ELEMENT__WRITE) |
| |
) |
| |
#endif |
| |
|
| |
#ifdef OPTIMIZE_BYTECODE_GET_OBJECT_ELEMENT |
| |
if( |
| |
count!=5 |
| |
|| !change_first(*code, OP::OP_GET_OBJECT_ELEMENT, /*=>*/OP::OP_GET_OBJECT_ELEMENT__WRITE) |
| |
) |
| |
#endif |
| |
|
| |
#ifdef OPTIMIZE_BYTECODE_GET_OBJECT_VAR_ELEMENT |
| |
if( |
| |
count!=5 |
| |
|| !change_first(*code, OP::OP_GET_OBJECT_VAR_ELEMENT, /*=>*/OP::OP_GET_OBJECT_VAR_ELEMENT__WRITE) |
| |
) |
| |
#endif |
| |
|
| |
#ifdef OPTIMIZE_BYTECODE_GET_ELEMENT__SPECIAL |
| |
if( |
| |
!change(*code, count-1/* last */, OP::OP_GET_ELEMENT__SPECIAL, /*=>*/OP::OP_GET_ELEMENT__SPECIAL__WRITE) |
| |
) |
| |
#endif |
| |
|
| |
{ |
| |
change_or_append(*code, count-1 /* last */, |
| |
OP::OP_GET_ELEMENT, /*=>*/OP::OP_GET_ELEMENT__WRITE, |
| |
/*or */OP::OP_WRITE_VALUE |
| |
); /* value=pop; wcontext.write(value) */ |
| } |
} |
| /* diving code; stack: current context */ |
|
| ; |
P(*(yyval), *code); |
| break;} |
} |
| case 43: |
break; |
| #line 266 "compile.y" |
|
| { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ; |
case 38: |
| break;} |
|
| case 45: |
/* Line 1806 of yacc.c */ |
| #line 267 "compile.y" |
#line 384 "compile.y" |
| { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ; |
{ (yyval)=(yyvsp[(2) - (2)]); } |
| break;} |
break; |
| case 46: |
|
| #line 271 "compile.y" |
case 41: |
| { |
|
| yyval=yyvsp[-1]; /* stack: context,name */ |
/* Line 1806 of yacc.c */ |
| P(yyval, yyvsp[0]); /* stack: context,name,constructor_value */ |
#line 386 "compile.y" |
| ; |
{ (yyval)=(yyvsp[(2) - (3)]); } |
| break;} |
break; |
| case 50: |
|
| #line 279 "compile.y" |
case 44: |
| { |
|
| yyval=N(POOL); |
/* Line 1806 of yacc.c */ |
| Array *diving_code=yyvsp[0]; |
#line 390 "compile.y" |
| const String *first_name=LA2S(diving_code); |
{ |
| if(first_name && *first_name==SELF_ELEMENT_NAME) { |
(yyval)=N(); |
| O(yyval, OP_WITH_SELF); /* stack: starting context */ |
YYSTYPE diving_code=(yyvsp[(1) - (1)]); |
| P(yyval, diving_code, |
size_t count=diving_code->count(); |
| /* skip over... */ |
|
| diving_code->size()>2?3/*OP_+string+get_element*/:2/*OP_+string*/); |
if(maybe_make_self(*(yyval), *diving_code, count)) { |
| |
// $self. |
| |
} else |
| |
|
| |
#ifdef OPTIMIZE_BYTECODE_GET_OBJECT_ELEMENT |
| |
if(maybe_make_get_object_element(*(yyval), *diving_code, count)){ |
| |
// optimization for $object.field + ^object.method[ |
| |
} else |
| |
#endif |
| |
|
| |
#ifdef OPTIMIZE_BYTECODE_GET_OBJECT_VAR_ELEMENT |
| |
if(maybe_make_get_object_var_element(*(yyval), *diving_code, count)){ |
| |
// optimization for $object.$var |
| |
} else |
| |
#endif |
| |
|
| |
#ifdef OPTIMIZE_BYTECODE_GET_ELEMENT |
| |
if( |
| |
count>=4 |
| |
&& (*diving_code)[0].code==OP::OP_VALUE |
| |
&& (*diving_code)[3].code==OP::OP_GET_ELEMENT |
| |
){ |
| |
// optimization |
| |
O(*(yyval), |
| |
(PC.in_call_value && count==4) |
| |
? OP::OP_VALUE__GET_ELEMENT_OR_OPERATOR // ^object[ : OP_VALUE+origin+string+OP_GET_ELEMENT => OP_VALUE__GET_ELEMENT_OR_OPERATOR+origin+string |
| |
: OP::OP_VALUE__GET_ELEMENT // $object : OP_VALUE+origin+string+OP_GET_ELEMENT => OP_VALUE__GET_ELEMENT+origin+string |
| |
); |
| |
P(*(yyval), *diving_code, 1/*offset*/, 2/*limit*/); // copy origin+value |
| |
if(count>4) |
| |
P(*(yyval), *diving_code, 4); // copy tail |
| } else { |
} else { |
| O(yyval, OP_WITH_ROOT); /* stack: starting context */ |
O(*(yyval), OP::OP_WITH_READ); /* stack: starting context */ |
| P(yyval, diving_code); |
P(*(yyval), *diving_code); |
| |
} |
| |
#else |
| |
{ |
| |
O(*(yyval), OP::OP_WITH_READ); /* stack: starting context */ |
| |
|
| |
// ^if OP_ELEMENT => ^if OP_ELEMENT_OR_OPERATOR |
| |
// optimized OP_VALUE+origin+string+OP_GET_ELEMENT. => OP_VALUE+origin+string+OP_GET_ELEMENT_OR_OPERATOR. |
| |
if(PC.in_call_value && count==4) |
| |
diving_code->put(count-1, OP::OP_GET_ELEMENT_OR_OPERATOR); |
| |
P(*(yyval), *diving_code); |
| } |
} |
| |
#endif |
| /* diving code; stack: current context */ |
/* diving code; stack: current context */ |
| ; |
} |
| break;} |
break; |
| case 51: |
|
| #line 294 "compile.y" |
case 45: |
| { |
|
| yyval=N(POOL); |
/* Line 1806 of yacc.c */ |
| O(yyval, OP_WITH_WRITE); /* stack: starting context */ |
#line 443 "compile.y" |
| P(yyval, yyvsp[0]); /* diving code; stack: context,name */ |
{ (yyval)=(yyvsp[(1) - (2)]); P(*(yyval), *(yyvsp[(2) - (2)])); } |
| ; |
break; |
| break;} |
|
| case 52: |
case 47: |
| #line 299 "compile.y" |
|
| { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ; |
/* Line 1806 of yacc.c */ |
| break;} |
#line 444 "compile.y" |
| case 56: |
{ (yyval)=(yyvsp[(1) - (2)]); P(*(yyval), *(yyvsp[(2) - (2)])); } |
| #line 306 "compile.y" |
break; |
| { |
|
| // stack: context, name |
case 48: |
| yyval=yyvsp[-1]; // stack: context, name, value |
|
| O(yyval, OP_CONSTRUCT_VALUE); /* value=pop; name=pop; context=pop; construct(context,name,value) */ |
/* Line 1806 of yacc.c */ |
| ; |
#line 448 "compile.y" |
| break;} |
{ |
| case 57: |
(yyval)=N(); |
| #line 312 "compile.y" |
#ifdef OPTIMIZE_BYTECODE_CONSTRUCT |
| { |
if(maybe_optimize_construct(*(yyval), *(yyvsp[(2) - (3)]), *(yyvsp[(3) - (3)]))){ |
| // stack: context, name |
// $a(expr), $.a(expr), $a[value], $.a[value], $self.a[value], $self.a(expr) |
| yyval=yyvsp[-1]; // stack: context, name, value |
} else |
| O(yyval, OP_CONSTRUCT_EXPR); /* value=pop->as_expr_result; name=pop; context=pop; construct(context,name,value) */ |
#endif |
| ; |
{ |
| break;} |
P(*(yyval), *(yyvsp[(2) - (3)])); /* stack: context,name */ |
| case 58: |
P(*(yyval), *(yyvsp[(3) - (3)])); /* stack: context,name,constructor_value */ |
| #line 318 "compile.y" |
} |
| { |
} |
| // stack: context, name |
break; |
| yyval=N(POOL); |
|
| CCA(yyval, yyvsp[-1]); /* code=pop; name=pop; context=pop; construct(context,name,junction(code)) */ |
case 52: |
| ; |
|
| break;} |
/* Line 1806 of yacc.c */ |
| case 62: |
#line 464 "compile.y" |
| #line 329 "compile.y" |
{ |
| { |
(yyval)=N(); |
| yyval=N(POOL); |
YYSTYPE diving_code=(yyvsp[(1) - (1)]); |
| O(yyval, OP_CREATE_EWPOOL); /* stack: empty write context */ |
size_t count=diving_code->count(); |
| P(yyval, yyvsp[0]); /* some code that writes to that context */ |
|
| O(yyval, OP_REDUCE_EWPOOL); /* context=pop; stack: context.value() */ |
if(maybe_make_self(*(yyval), *diving_code, count)) { |
| ; |
// $self. |
| break;} |
} else |
| case 65: |
#ifdef OPTIMIZE_BYTECODE_GET_ELEMENT |
| #line 336 "compile.y" |
if( |
| { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ; |
count>=4 |
| break;} |
&& (*diving_code)[0].code==OP::OP_VALUE |
| case 66: |
&& (*diving_code)[3].code==OP::OP_GET_ELEMENT |
| #line 340 "compile.y" |
){ |
| { |
O(*(yyval), OP::OP_WITH_ROOT__VALUE__GET_ELEMENT); |
| yyval=yyvsp[0]; /* stack: value */ |
P(*(yyval), *diving_code, 1/*offset*/, 2/*limit*/); // copy origin+value |
| O(yyval, OP_WRITE_VALUE); /* value=pop; wcontext.write(value) */ |
if(count>4) |
| ; |
P(*(yyval), *diving_code, 4); // tail |
| break;} |
} else |
| case 67: |
#endif |
| #line 344 "compile.y" |
{ |
| { PC.object_constructor_allowed=true ; |
O(*(yyval), OP::OP_WITH_ROOT); /* stack: starting context */ |
| break;} |
P(*(yyval), *diving_code); |
| case 68: |
|
| #line 345 "compile.y" |
|
| { PC.object_constructor_allowed=false ; |
|
| break;} |
|
| case 69: |
|
| #line 346 "compile.y" |
|
| { /* ^field.$method{vasya} */ |
|
| yyval=yyvsp[-3]; /* with_xxx,diving code; stack: context,method_junction */ |
|
| O(yyval, OP_GET_METHOD_FRAME); /* stack: context,method_frame */ |
|
| |
|
| YYSTYPE params_code=yyvsp[-1]; |
|
| if(params_code->size()==3) // probably [] case. [OP_VALUE + Void + STORE_PARAM] |
|
| if(Value *value=LA2V(params_code)) // it is OP_VALUE + value? |
|
| if(!value->is_defined()) // value is VVoid? |
|
| params_code=0; // ^zzz[] case. don't append lone empty param. |
|
| if(params_code) |
|
| P(yyval, params_code); // filling method_frame.store_params |
|
| O(yyval, OP_CALL); // method_frame=pop; ncontext=pop; call(ncontext,method_frame) stack: value |
|
| ; |
|
| break;} |
|
| case 72: |
|
| #line 362 "compile.y" |
|
| { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ; |
|
| break;} |
|
| case 76: |
|
| #line 368 "compile.y" |
|
| {yyval=yyvsp[-1]; |
|
| break;} |
|
| case 77: |
|
| #line 369 "compile.y" |
|
| {yyval=yyvsp[-1]; |
|
| break;} |
|
| case 78: |
|
| #line 370 "compile.y" |
|
| {yyval=yyvsp[-1]; |
|
| break;} |
|
| case 80: |
|
| #line 373 "compile.y" |
|
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]) ; |
|
| break;} |
|
| case 82: |
|
| #line 377 "compile.y" |
|
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]) ; |
|
| break;} |
|
| case 84: |
|
| #line 381 "compile.y" |
|
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]) ; |
|
| break;} |
|
| case 85: |
|
| #line 383 "compile.y" |
|
| { |
|
| yyval=yyvsp[0]; |
|
| O(yyval, OP_STORE_PARAM); |
|
| ; |
|
| break;} |
|
| case 86: |
|
| #line 387 "compile.y" |
|
| { |
|
| yyval=N(POOL); |
|
| PEA(yyval, yyvsp[0]); |
|
| ; |
|
| break;} |
|
| case 87: |
|
| #line 391 "compile.y" |
|
| { |
|
| yyval=N(POOL); |
|
| PCA(yyval, yyvsp[0]); |
|
| ; |
|
| break;} |
|
| case 91: |
|
| #line 400 "compile.y" |
|
| { |
|
| yyval=yyvsp[0]; |
|
| O(yyval, OP_WRITE_EXPR_RESULT); |
|
| ; |
|
| break;} |
|
| case 93: |
|
| #line 407 "compile.y" |
|
| { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ; |
|
| break;} |
|
| case 95: |
|
| #line 409 "compile.y" |
|
| { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ; |
|
| break;} |
|
| case 97: |
|
| #line 411 "compile.y" |
|
| { |
|
| /* stack: context */ |
|
| yyval=yyvsp[0]; /* stack: context,name */ |
|
| O(yyval, OP_GET_ELEMENT); /* name=pop; context=pop; stack: context.get_element(name) */ |
|
| ; |
|
| break;} |
|
| case 98: |
|
| #line 416 "compile.y" |
|
| { |
|
| /* stack: context */ |
|
| yyval=yyvsp[0]; /* stack: context,name */ |
|
| O(yyval, OP_GET_ELEMENT); /* name=pop; context=pop; stack: context.get_element(name) */ |
|
| ; |
|
| break;} |
|
| case 104: |
|
| #line 429 "compile.y" |
|
| { |
|
| yyval=yyvsp[0]; |
|
| O(yyval, OP_GET_ELEMENT); |
|
| ; |
|
| break;} |
|
| case 105: |
|
| #line 433 "compile.y" |
|
| { |
|
| yyval=N(POOL); |
|
| O(yyval, OP_CREATE_EWPOOL); |
|
| P(yyval, yyvsp[-1]); |
|
| O(yyval, OP_WRITE_VALUE); |
|
| P(yyval, yyvsp[0]); |
|
| O(yyval, OP_REDUCE_EWPOOL); |
|
| ; |
|
| break;} |
|
| case 106: |
|
| #line 441 "compile.y" |
|
| { |
|
| yyval=N(POOL); |
|
| O(yyval, OP_CREATE_EWPOOL); |
|
| P(yyval, yyvsp[-1]); |
|
| O(yyval, OP_REDUCE_EWPOOL); |
|
| ; |
|
| break;} |
|
| case 107: |
|
| #line 447 "compile.y" |
|
| { |
|
| yyval=N(POOL); |
|
| O(yyval, OP_WITH_READ); |
|
| P(yyval, yyvsp[0]); |
|
| ; |
|
| break;} |
|
| case 109: |
|
| #line 452 "compile.y" |
|
| { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ; |
|
| break;} |
|
| case 110: |
|
| #line 453 "compile.y" |
|
| { |
|
| yyval=yyvsp[0]; |
|
| O(yyval, OP_GET_ELEMENT__WRITE); |
|
| ; |
|
| break;} |
|
| case 113: |
|
| #line 462 "compile.y" |
|
| { |
|
| yyval=yyvsp[-1]; // stack: class name string |
|
| O(yyval, OP_GET_CLASS); |
|
| ; |
|
| break;} |
|
| case 114: |
|
| #line 466 "compile.y" |
|
| { |
|
| yyval=yyvsp[-1]; |
|
| if(!PC.object_constructor_allowed) { |
|
| strcpy(PC.error, ":: not allowed here"); |
|
| YYERROR; |
|
| } |
} |
| O(yyval, OP_PREPARE_TO_CONSTRUCT_OBJECT); |
/* diving code; stack: current context */ |
| ; |
} |
| break;} |
break; |
| case 115: |
|
| #line 478 "compile.y" |
case 53: |
| { |
|
| if((yyval=yyvsp[0])->size()==2) // only one string literal in there? |
/* Line 1806 of yacc.c */ |
| change_string_literal_to_double_literal(yyval); // make that string literal Double |
|
| ; |
|
| break;} |
|
| case 119: |
|
| #line 486 "compile.y" |
|
| { yyval = yyvsp[-1]; ; |
|
| break;} |
|
| case 120: |
|
| #line 487 "compile.y" |
|
| { yyval = yyvsp[-1]; ; |
|
| break;} |
|
| case 121: |
|
| #line 488 "compile.y" |
|
| { yyval = yyvsp[-1]; ; |
|
| break;} |
|
| case 122: |
|
| #line 490 "compile.y" |
#line 490 "compile.y" |
| { yyval=yyvsp[0]; O(yyval, OP_NEG) ; |
{ |
| break;} |
(yyval)=N(); |
| case 123: |
O(*(yyval), OP::OP_WITH_WRITE); /* stack: starting context */ |
| #line 491 "compile.y" |
P(*(yyval), *(yyvsp[(2) - (2)])); /* diving code; stack: context,name */ |
| { yyval=yyvsp[0] ; |
} |
| break;} |
break; |
| case 124: |
|
| #line 492 "compile.y" |
case 54: |
| { yyval=yyvsp[0]; O(yyval, OP_INV) ; |
|
| break;} |
/* Line 1806 of yacc.c */ |
| case 125: |
|
| #line 493 "compile.y" |
|
| { yyval=yyvsp[0]; O(yyval, OP_NOT) ; |
|
| break;} |
|
| case 126: |
|
| #line 494 "compile.y" |
|
| { yyval=yyvsp[0]; O(yyval, OP_DEF) ; |
|
| break;} |
|
| case 127: |
|
| #line 495 "compile.y" |
#line 495 "compile.y" |
| { yyval=yyvsp[0]; O(yyval, OP_IN) ; |
{ (yyval)=(yyvsp[(1) - (2)]); P(*(yyval), *(yyvsp[(2) - (2)])); } |
| break;} |
break; |
| case 128: |
|
| #line 496 "compile.y" |
case 58: |
| { yyval=yyvsp[0]; O(yyval, OP_FEXISTS) ; |
|
| break;} |
/* Line 1806 of yacc.c */ |
| case 129: |
|
| #line 497 "compile.y" |
|
| { yyval=yyvsp[0]; O(yyval, OP_DEXISTS) ; |
|
| break;} |
|
| case 130: |
|
| #line 499 "compile.y" |
|
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_SUB) ; |
|
| break;} |
|
| case 131: |
|
| #line 500 "compile.y" |
|
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_ADD) ; |
|
| break;} |
|
| case 132: |
|
| #line 501 "compile.y" |
|
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_MUL) ; |
|
| break;} |
|
| case 133: |
|
| #line 502 "compile.y" |
#line 502 "compile.y" |
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_DIV) ; |
{ |
| break;} |
// allow $result_or_other_variable[ letters here any time ] |
| case 134: |
*reinterpret_cast<bool*>(&(yyval))=PC.explicit_result; PC.explicit_result=false; |
| #line 503 "compile.y" |
} |
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_MOD) ; |
break; |
| break;} |
|
| case 135: |
case 59: |
| #line 504 "compile.y" |
|
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_INTDIV) ; |
/* Line 1806 of yacc.c */ |
| break;} |
|
| case 136: |
|
| #line 505 "compile.y" |
#line 505 "compile.y" |
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_BIN_AND) ; |
{ |
| break;} |
PC.explicit_result=*reinterpret_cast<bool*>(&(yyvsp[(2) - (3)])); |
| case 137: |
} |
| #line 506 "compile.y" |
break; |
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_BIN_OR) ; |
|
| break;} |
case 60: |
| case 138: |
|
| |
/* Line 1806 of yacc.c */ |
| #line 507 "compile.y" |
#line 507 "compile.y" |
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_BIN_XOR) ; |
{ |
| break;} |
// stack: context, name |
| case 139: |
(yyval)=(yyvsp[(3) - (5)]); // stack: context, name, value |
| #line 508 "compile.y" |
O(*(yyval), OP::OP_CONSTRUCT_VALUE); /* value=pop; name=pop; context=pop; construct(context,name,value) */ |
| { yyval=yyvsp[-2]; PNC(yyval, yyvsp[0]); O(yyval, OP_LOG_AND) ; |
} |
| break;} |
break; |
| case 140: |
|
| #line 509 "compile.y" |
case 61: |
| { yyval=yyvsp[-2]; PNC(yyval, yyvsp[0]); O(yyval, OP_LOG_OR) ; |
|
| break;} |
/* Line 1806 of yacc.c */ |
| case 141: |
|
| #line 510 "compile.y" |
|
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_LOG_XOR) ; |
|
| break;} |
|
| case 142: |
|
| #line 511 "compile.y" |
|
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_NUM_LT) ; |
|
| break;} |
|
| case 143: |
|
| #line 512 "compile.y" |
|
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_NUM_GT) ; |
|
| break;} |
|
| case 144: |
|
| #line 513 "compile.y" |
#line 513 "compile.y" |
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_NUM_LE) ; |
{ |
| break;} |
(yyval)=N(); |
| case 145: |
O(*(yyval), OP::OP_PREPARE_TO_EXPRESSION); |
| #line 514 "compile.y" |
// stack: context, name |
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_NUM_GE) ; |
P(*(yyval), *(yyvsp[(2) - (3)])); // stack: context, name, value |
| break;} |
O(*(yyval), OP::OP_CONSTRUCT_EXPR); /* value=pop->as_expr_result; name=pop; context=pop; construct(context,name,value) */ |
| case 146: |
} |
| #line 515 "compile.y" |
break; |
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_NUM_EQ) ; |
|
| break;} |
case 62: |
| case 147: |
|
| #line 516 "compile.y" |
/* Line 1806 of yacc.c */ |
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_NUM_NE) ; |
|
| break;} |
|
| case 148: |
|
| #line 517 "compile.y" |
|
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_STR_LT) ; |
|
| break;} |
|
| case 149: |
|
| #line 518 "compile.y" |
|
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_STR_GT) ; |
|
| break;} |
|
| case 150: |
|
| #line 519 "compile.y" |
|
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_STR_LE) ; |
|
| break;} |
|
| case 151: |
|
| #line 520 "compile.y" |
|
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_STR_GE) ; |
|
| break;} |
|
| case 152: |
|
| #line 521 "compile.y" |
#line 521 "compile.y" |
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_STR_EQ) ; |
{ |
| break;} |
// stack: context, name |
| case 153: |
(yyval)=N(); |
| #line 522 "compile.y" |
OA(*(yyval), OP::OP_CURLY_CODE__CONSTRUCT, (yyvsp[(2) - (3)])); /* code=pop; name=pop; context=pop; construct(context,name,junction(code)) */ |
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_STR_NE) ; |
} |
| break;} |
break; |
| case 154: |
|
| #line 523 "compile.y" |
case 66: |
| { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_IS) ; |
|
| break;} |
/* Line 1806 of yacc.c */ |
| case 155: |
#line 532 "compile.y" |
| #line 526 "compile.y" |
{ |
| { |
(yyval)=N(); |
| yyval=N(POOL); |
OA(*(yyval), OP::OP_OBJECT_POOL, (yyvsp[(1) - (1)])); /* stack: empty write context */ |
| O(yyval, OP_CREATE_SWPOOL); /* stack: empty write context */ |
/* some code that writes to that context */ |
| P(yyval, yyvsp[0]); /* some code that writes to that context */ |
/* context=pop; stack: context.value() */ |
| O(yyval, OP_REDUCE_SWPOOL); /* context=pop; stack: context.get_string() */ |
} |
| ; |
break; |
| break;} |
|
| case 156: |
case 69: |
| #line 535 "compile.y" |
|
| { |
/* Line 1806 of yacc.c */ |
| // optimized from OP_STRING+OP_WRITE_VALUE to OP_STRING__WRITE |
#line 539 "compile.y" |
| change_string_literal_to_write_string_literal(yyval=yyvsp[0]) |
{ (yyval)=(yyvsp[(1) - (2)]); P(*(yyval), *(yyvsp[(2) - (2)])); } |
| ; |
break; |
| break;} |
|
| case 157: |
case 70: |
| #line 540 "compile.y" |
|
| { yyval=VL(NEW VVoid(POOL)) ; |
/* Line 1806 of yacc.c */ |
| break;} |
#line 543 "compile.y" |
| case 158: |
{ |
| #line 541 "compile.y" |
size_t count=(yyvsp[(1) - (1)])->count(); |
| { yyval=N(POOL) ; |
#ifdef OPTIMIZE_BYTECODE_CUT_REM_OPERATOR |
| break;} |
if(count) |
| } |
|
| /* the action file gets copied in in place of this dollarsign */ |
|
| #line 543 "/usr/share/bison.simple" |
|
| |
|
| yyvsp -= yylen; |
|
| yyssp -= yylen; |
|
| #ifdef YYLSP_NEEDED |
|
| yylsp -= yylen; |
|
| #endif |
|
| |
|
| #if YYDEBUG != 0 |
|
| if (yydebug) |
|
| { |
|
| short *ssp1 = yyss - 1; |
|
| fprintf (stderr, "state stack now"); |
|
| while (ssp1 != yyssp) |
|
| fprintf (stderr, " %d", *++ssp1); |
|
| fprintf (stderr, "\n"); |
|
| } |
|
| #endif |
#endif |
| |
{ |
| |
(yyval)=(yyvsp[(1) - (1)]); /* stack: value */ |
| |
if(!change_first(*(yyval), OP::OP_CONSTRUCT_OBJECT, /*=>*/OP::OP_CONSTRUCT_OBJECT__WRITE)) |
| |
change_or_append(*(yyval), count-2 /* second last */, |
| |
OP::OP_CALL, /*=>*/ OP::OP_CALL__WRITE, |
| |
/*or */OP::OP_WRITE_VALUE); /* value=pop; wcontext.write(value) */ |
| |
} |
| |
} |
| |
break; |
| |
|
| *++yyvsp = yyval; |
case 71: |
| |
|
| #ifdef YYLSP_NEEDED |
/* Line 1806 of yacc.c */ |
| yylsp++; |
#line 556 "compile.y" |
| if (yylen == 0) |
{ |
| { |
PC.in_call_value=true; |
| yylsp->first_line = yylloc.first_line; |
} |
| yylsp->first_column = yylloc.first_column; |
break; |
| yylsp->last_line = (yylsp-1)->last_line; |
|
| yylsp->last_column = (yylsp-1)->last_column; |
case 72: |
| yylsp->text = 0; |
|
| } |
/* Line 1806 of yacc.c */ |
| else |
#line 559 "compile.y" |
| { |
{ |
| yylsp->last_line = (yylsp+yylen-1)->last_line; |
PC.in_call_value=false; |
| yylsp->last_column = (yylsp+yylen-1)->last_column; |
} |
| } |
break; |
| |
|
| |
case 73: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 562 "compile.y" |
| |
{ /* ^field.$method{vasya} */ |
| |
#ifdef OPTIMIZE_BYTECODE_CUT_REM_OPERATOR |
| |
#ifdef OPTIMIZE_BYTECODE_GET_ELEMENT |
| |
const String* operator_name=LA2S(*(yyvsp[(3) - (6)]), 0, OP::OP_VALUE__GET_ELEMENT_OR_OPERATOR); |
| |
#else |
| |
const String* operator_name=LA2S(*(yyvsp[(3) - (6)]), 1); |
| |
#endif |
| |
if(operator_name && *operator_name==REM_OPERATOR_NAME){ |
| |
(yyval)=N(); |
| |
} else |
| #endif |
#endif |
| |
{ |
| |
YYSTYPE params_code=(yyvsp[(5) - (6)]); |
| |
if(params_code->count()==3) { // probably [] case. [OP::OP_VALUE+origin+Void] |
| |
if(Value* value=LA2V(*params_code)) // it is OP_VALUE+origin+value? |
| |
if(const String * string=value->get_string()) |
| |
if(string->is_empty()) // value is empty string? |
| |
params_code=0; // ^zzz[] case. don't append lone empty param. |
| |
} |
| |
/* stack: context, method_junction */ |
| |
|
| /* Now "shift" the result of the reduction. |
YYSTYPE var_code=(yyvsp[(3) - (6)]); |
| Determine what state that goes to, |
if( |
| based on the state we popped back to |
var_code->count()==8 |
| and the rule number reduced by. */ |
&& (*var_code)[0].code==OP::OP_VALUE__GET_CLASS |
| |
&& (*var_code)[3].code==OP::OP_PREPARE_TO_CONSTRUCT_OBJECT |
| |
&& (*var_code)[4].code==OP::OP_VALUE |
| |
&& (*var_code)[7].code==OP::OP_GET_ELEMENT |
| |
){ |
| |
(yyval)=N(); |
| |
O(*(yyval), OP::OP_CONSTRUCT_OBJECT); |
| |
P(*(yyval), *var_code, 1/*offset*/, 2/*limit*/); // class name |
| |
P(*(yyval), *var_code, 5/*offset*/, 2/*limit*/); // constructor name |
| |
OA(*(yyval), params_code); |
| |
} else |
| |
{ |
| |
(yyval)=var_code; /* with_xxx,diving code; stack: context,method_junction */ |
| |
OA(*(yyval), OP::OP_CALL, params_code); // method_frame=make frame(pop junction); ncontext=pop; call(ncontext,method_frame) stack: value |
| |
} |
| |
} |
| |
} |
| |
break; |
| |
|
| yyn = yyr1[yyn]; |
case 76: |
| |
|
| yystate = yypgoto[yyn - YYNTBASE] + *yyssp; |
/* Line 1806 of yacc.c */ |
| if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) |
#line 606 "compile.y" |
| yystate = yytable[yystate]; |
{ (yyval)=(yyvsp[(1) - (2)]); P(*(yyval), *(yyvsp[(2) - (2)])); } |
| else |
break; |
| yystate = yydefgoto[yyn - YYNTBASE]; |
|
| |
|
| goto yynewstate; |
case 80: |
| |
|
| yyerrlab: /* here on detecting error */ |
/* Line 1806 of yacc.c */ |
| |
#line 612 "compile.y" |
| |
{ |
| |
// allow ^call[ letters here any time ] |
| |
*reinterpret_cast<bool*>(&(yyval))=PC.explicit_result; PC.explicit_result=false; |
| |
} |
| |
break; |
| |
|
| if (! yyerrstatus) |
case 81: |
| /* If not already recovering from an error, report this error. */ |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 615 "compile.y" |
| { |
{ |
| ++yynerrs; |
PC.explicit_result=*reinterpret_cast<bool*>(&(yyvsp[(2) - (3)])); |
| |
} |
| |
break; |
| |
|
| #ifdef YYERROR_VERBOSE |
case 82: |
| yyn = yypact[yystate]; |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 617 "compile.y" |
| |
{(yyval)=(yyvsp[(3) - (5)]);} |
| |
break; |
| |
|
| |
case 83: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 618 "compile.y" |
| |
{(yyval)=(yyvsp[(2) - (3)]);} |
| |
break; |
| |
|
| |
case 84: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 619 "compile.y" |
| |
{(yyval)=(yyvsp[(2) - (3)]);} |
| |
break; |
| |
|
| |
case 86: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 622 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); } |
| |
break; |
| |
|
| |
case 88: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 626 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); } |
| |
break; |
| |
|
| |
case 90: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 630 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); } |
| |
break; |
| |
|
| |
case 91: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 632 "compile.y" |
| |
{ |
| |
(yyval)=(yyvsp[(1) - (1)]); |
| |
} |
| |
break; |
| |
|
| |
case 92: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 635 "compile.y" |
| |
{ |
| |
YYSTYPE expr_code=(yyvsp[(1) - (1)]); |
| |
if(expr_code->count()==3 |
| |
&& (*expr_code)[0].code==OP::OP_VALUE) { // optimizing (double/bool/incidently 'string' too) case. [OP::OP_VALUE+origin+Double]. no evaluating |
| |
(yyval)=expr_code; |
| |
} else { |
| |
YYSTYPE code=N(); |
| |
O(*code, OP::OP_PREPARE_TO_EXPRESSION); |
| |
P(*code, *expr_code); |
| |
O(*code, OP::OP_WRITE_EXPR_RESULT); |
| |
(yyval)=N(); |
| |
OA(*(yyval), OP::OP_EXPR_CODE__STORE_PARAM, code); |
| |
} |
| |
} |
| |
break; |
| |
|
| |
case 93: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 649 "compile.y" |
| |
{ |
| |
(yyval)=N(); |
| |
OA(*(yyval), OP::OP_CURLY_CODE__STORE_PARAM, (yyvsp[(1) - (1)])); |
| |
} |
| |
break; |
| |
|
| |
case 98: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 661 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (2)]); P(*(yyval), *(yyvsp[(2) - (2)])); } |
| |
break; |
| |
|
| |
case 100: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 663 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (2)]); P(*(yyval), *(yyvsp[(2) - (2)])); } |
| |
break; |
| |
|
| |
case 102: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 665 "compile.y" |
| |
{ |
| |
// we know that name_advance1 not called from ^xxx context |
| |
// so we'll not check for operator call possibility as we do in name_advance2 |
| |
|
| |
/* stack: context */ |
| |
(yyval)=(yyvsp[(1) - (1)]); /* stack: context,name */ |
| |
#ifdef OPTIMIZE_BYTECODE_GET_ELEMENT__SPECIAL |
| |
O(*(yyval), is_special_element(*(yyval)) ? OP::OP_GET_ELEMENT__SPECIAL : OP::OP_GET_ELEMENT); |
| |
#else |
| |
O(*(yyval), OP::OP_GET_ELEMENT); /* name=pop; context=pop; stack: context.get_element(name) */ |
| |
#endif |
| |
} |
| |
break; |
| |
|
| |
case 103: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 677 "compile.y" |
| |
{ |
| |
/* stack: context */ |
| |
(yyval)=(yyvsp[(1) - (1)]); /* stack: context,name */ |
| |
#ifdef OPTIMIZE_BYTECODE_GET_ELEMENT__SPECIAL |
| |
O(*(yyval), is_special_element(*(yyval)) ? OP::OP_GET_ELEMENT__SPECIAL : OP::OP_GET_ELEMENT); |
| |
#else |
| |
O(*(yyval), OP::OP_GET_ELEMENT); /* name=pop; context=pop; stack: context.get_element(name) */ |
| |
#endif |
| |
} |
| |
break; |
| |
|
| |
case 109: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 694 "compile.y" |
| |
{ |
| |
(yyval)=(yyvsp[(2) - (2)]); |
| |
O(*(yyval), OP::OP_GET_ELEMENT); |
| |
} |
| |
break; |
| |
|
| |
case 110: |
| |
|
| if (yyn > YYFLAG && yyn < YYLAST) |
/* Line 1806 of yacc.c */ |
| |
#line 698 "compile.y" |
| |
{ |
| |
YYSTYPE code; |
| { |
{ |
| int size = 0; |
change_string_literal_to_write_string_literal(*(code=(yyvsp[(1) - (2)]))); |
| char *msg; |
P(*code, *(yyvsp[(2) - (2)])); |
| int x, count; |
} |
| |
(yyval)=N(); |
| count = 0; |
OA(*(yyval), OP::OP_STRING_POOL, code); |
| /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ |
} |
| for (x = (yyn < 0 ? -yyn : 0); |
break; |
| 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) |
case 111: |
| { |
|
| count = 0; |
/* Line 1806 of yacc.c */ |
| for (x = (yyn < 0 ? -yyn : 0); |
#line 707 "compile.y" |
| x < (sizeof(yytname) / sizeof(char *)); x++) |
{ |
| if (yycheck[x + yyn] == x) |
// allow $result_or_other_variable[ letters here any time ] |
| { |
*reinterpret_cast<bool*>(&(yyval))=PC.explicit_result; PC.explicit_result=false; |
| strcat(msg, count == 0 ? ", expecting `" : " or `"); |
} |
| strcat(msg, yytname[x]); |
break; |
| strcat(msg, "'"); |
|
| count++; |
case 112: |
| } |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 710 "compile.y" |
| |
{ |
| |
PC.explicit_result=*reinterpret_cast<bool*>(&(yyvsp[(2) - (3)])); |
| |
} |
| |
break; |
| |
|
| |
case 113: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 712 "compile.y" |
| |
{ |
| |
(yyval)=N(); |
| |
#ifdef OPTIMIZE_BYTECODE_GET_ELEMENT__SPECIAL |
| |
if(!maybe_append_simple_diving_code(*(yyval), *(yyvsp[(3) - (5)]))) |
| |
#endif |
| |
{ |
| |
OA(*(yyval), OP::OP_OBJECT_POOL, (yyvsp[(3) - (5)])); /* stack: empty write context */ |
| |
/* some code that writes to that context */ |
| |
/* context=pop; stack: context.value() */ |
| |
} |
| |
} |
| |
break; |
| |
|
| |
case 114: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 723 "compile.y" |
| |
{ |
| |
(yyval)=N(); |
| |
O(*(yyval), OP::OP_WITH_READ); |
| |
P(*(yyval), *(yyvsp[(1) - (1)])); |
| |
} |
| |
break; |
| |
|
| |
case 116: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 728 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (2)]); P(*(yyval), *(yyvsp[(2) - (2)])); } |
| |
break; |
| |
|
| |
case 117: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 729 "compile.y" |
| |
{ |
| |
(yyval)=(yyvsp[(2) - (2)]); |
| |
O(*(yyval), OP::OP_GET_ELEMENT__WRITE); |
| |
} |
| |
break; |
| |
|
| |
case 120: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 738 "compile.y" |
| |
{ |
| |
(yyval)=(yyvsp[(1) - (2)]); // stack: class name string |
| |
if(*LA2S(*(yyval)) == BASE_NAME) { // pseudo BASE class |
| |
if(VStateless_class* base=PC.cclass->base_class()) { |
| |
change_string_literal_value(*(yyval), base->name()); |
| |
} else { |
| |
strcpy(PC.error, "no base class declared"); |
| |
YYERROR; |
| } |
} |
| yyerror(msg); |
|
| free(msg); |
|
| } |
|
| else |
|
| yyerror ("parse error; also virtual memory exceeded"); |
|
| } |
} |
| else |
// optimized OP_VALUE+origin+string+OP_GET_CLASS => OP_VALUE__GET_CLASS+origin+string |
| #endif /* YYERROR_VERBOSE */ |
change_first(*(yyval), OP::OP_VALUE, OP::OP_VALUE__GET_CLASS); |
| yyerror("parse error"); |
} |
| } |
break; |
| |
|
| goto yyerrlab1; |
case 121: |
| yyerrlab1: /* here on error raised explicitly by an action */ |
|
| |
|
| if (yyerrstatus == 3) |
/* Line 1806 of yacc.c */ |
| |
#line 751 "compile.y" |
| { |
{ |
| /* if just tried and failed to reuse lookahead token after an error, discard it. */ |
(yyval)=(yyvsp[(1) - (2)]); |
| |
if(!PC.in_call_value) { |
| |
strcpy(PC.error, ":: not allowed here"); |
| |
YYERROR; |
| |
} |
| |
O(*(yyval), OP::OP_PREPARE_TO_CONSTRUCT_OBJECT); |
| |
} |
| |
break; |
| |
|
| /* return failure if at end of input */ |
case 128: |
| if (yychar == YYEOF) |
|
| YYABORT; |
/* Line 1806 of yacc.c */ |
| |
#line 770 "compile.y" |
| |
{ (yyval) = (yyvsp[(2) - (3)]); } |
| |
break; |
| |
|
| |
case 129: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 771 "compile.y" |
| |
{ (yyval) = (yyvsp[(2) - (3)]); } |
| |
break; |
| |
|
| |
case 130: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 772 "compile.y" |
| |
{ (yyval) = (yyvsp[(2) - (3)]); } |
| |
break; |
| |
|
| |
case 131: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 774 "compile.y" |
| |
{ (yyval)=(yyvsp[(2) - (2)]); O(*(yyval), OP::OP_NEG); } |
| |
break; |
| |
|
| |
case 132: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 775 "compile.y" |
| |
{ (yyval)=(yyvsp[(2) - (2)]); } |
| |
break; |
| |
|
| |
case 133: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 776 "compile.y" |
| |
{ (yyval)=(yyvsp[(2) - (2)]); O(*(yyval), OP::OP_INV); } |
| |
break; |
| |
|
| |
case 134: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 777 "compile.y" |
| |
{ (yyval)=(yyvsp[(2) - (2)]); O(*(yyval), OP::OP_NOT); } |
| |
break; |
| |
|
| |
case 135: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 778 "compile.y" |
| |
{ (yyval)=(yyvsp[(2) - (2)]); O(*(yyval), OP::OP_DEF); } |
| |
break; |
| |
|
| |
case 136: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 779 "compile.y" |
| |
{ (yyval)=(yyvsp[(2) - (2)]); O(*(yyval), OP::OP_IN); } |
| |
break; |
| |
|
| |
case 137: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 780 "compile.y" |
| |
{ (yyval)=(yyvsp[(2) - (2)]); O(*(yyval), OP::OP_FEXISTS); } |
| |
break; |
| |
|
| |
case 138: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 781 "compile.y" |
| |
{ (yyval)=(yyvsp[(2) - (2)]); O(*(yyval), OP::OP_DEXISTS); } |
| |
break; |
| |
|
| |
case 139: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 783 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_SUB); } |
| |
break; |
| |
|
| |
case 140: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 784 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_ADD); } |
| |
break; |
| |
|
| |
case 141: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 785 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_MUL); } |
| |
break; |
| |
|
| |
case 142: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 786 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_DIV); } |
| |
break; |
| |
|
| |
case 143: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 787 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_MOD); } |
| |
break; |
| |
|
| |
case 144: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 788 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_INTDIV); } |
| |
break; |
| |
|
| |
case 145: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 789 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_BIN_SL); } |
| |
break; |
| |
|
| |
case 146: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 790 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_BIN_SR); } |
| |
break; |
| |
|
| |
case 147: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 791 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_BIN_AND); } |
| |
break; |
| |
|
| #if YYDEBUG != 0 |
case 148: |
| if (yydebug) |
|
| fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); |
/* Line 1806 of yacc.c */ |
| |
#line 792 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_BIN_OR); } |
| |
break; |
| |
|
| |
case 149: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 793 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_BIN_XOR); } |
| |
break; |
| |
|
| |
case 150: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 794 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); OA(*(yyval), OP::OP_NESTED_CODE, (yyvsp[(3) - (3)])); O(*(yyval), OP::OP_LOG_AND); } |
| |
break; |
| |
|
| |
case 151: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 795 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); OA(*(yyval), OP::OP_NESTED_CODE, (yyvsp[(3) - (3)])); O(*(yyval), OP::OP_LOG_OR); } |
| |
break; |
| |
|
| |
case 152: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 796 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_LOG_XOR); } |
| |
break; |
| |
|
| |
case 153: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 797 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_NUM_LT); } |
| |
break; |
| |
|
| |
case 154: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 798 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_NUM_GT); } |
| |
break; |
| |
|
| |
case 155: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 799 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_NUM_LE); } |
| |
break; |
| |
|
| |
case 156: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 800 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_NUM_GE); } |
| |
break; |
| |
|
| |
case 157: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 801 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_NUM_EQ); } |
| |
break; |
| |
|
| |
case 158: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 802 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_NUM_NE); } |
| |
break; |
| |
|
| |
case 159: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 803 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_STR_LT); } |
| |
break; |
| |
|
| |
case 160: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 804 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_STR_GT); } |
| |
break; |
| |
|
| |
case 161: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 805 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_STR_LE); } |
| |
break; |
| |
|
| |
case 162: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 806 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_STR_GE); } |
| |
break; |
| |
|
| |
case 163: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 807 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_STR_EQ); } |
| |
break; |
| |
|
| |
case 164: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 808 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_STR_NE); } |
| |
break; |
| |
|
| |
case 165: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 809 "compile.y" |
| |
{ (yyval)=(yyvsp[(1) - (3)]); P(*(yyval), *(yyvsp[(3) - (3)])); O(*(yyval), OP::OP_IS); } |
| |
break; |
| |
|
| |
case 166: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 812 "compile.y" |
| |
{ |
| |
// optimized OP_STRING => OP_VALUE for doubles |
| |
maybe_change_string_literal_to_double_literal(*((yyval)=(yyvsp[(1) - (1)]))); |
| |
} |
| |
break; |
| |
|
| |
case 167: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 817 "compile.y" |
| |
{ |
| |
#ifdef OPTIMIZE_BYTECODE_STRING_POOL |
| |
// it brakes ^if(" 09 "){...} |
| |
YYSTYPE code=(yyvsp[(1) - (1)]); |
| |
(yyval)=N(); |
| |
if(code->count()==3 && change_first(*code, OP::OP_STRING__WRITE, OP::OP_VALUE)){ |
| |
// optimized OP_STRING__WRITE+origin+value => OP_VALUE+origin+value without starting OP_STRING_POOL |
| |
P(*(yyval), *code); |
| |
} else { |
| |
OA(*(yyval), OP::OP_STRING_POOL, code); /* stack: empty write context */ |
| |
} |
| |
#else |
| |
(yyval)=N(); |
| |
OA(*(yyval), OP::OP_STRING_POOL, (yyvsp[(1) - (1)])); /* stack: empty write context */ |
| #endif |
#endif |
| |
/* some code that writes to that context */ |
| |
/* context=pop; stack: context.get_string() */ |
| |
} |
| |
break; |
| |
|
| |
case 168: |
| |
|
| yychar = YYEMPTY; |
/* Line 1806 of yacc.c */ |
| |
#line 838 "compile.y" |
| |
{ |
| |
// optimized OP_STRING+OP_WRITE_VALUE => OP_STRING__WRITE |
| |
change_string_literal_to_write_string_literal(*((yyval)=(yyvsp[(1) - (1)]))); |
| |
} |
| |
break; |
| |
|
| |
case 169: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 843 "compile.y" |
| |
{ (yyval)=VL(/*we know that we will not change it*/const_cast<VString*>(&vempty), 0, 0, 0); } |
| |
break; |
| |
|
| |
case 170: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 844 "compile.y" |
| |
{ (yyval) = VL(/*we know that we will not change it*/const_cast<VBool*>(&vtrue), 0, 0, 0); } |
| |
break; |
| |
|
| |
case 171: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 845 "compile.y" |
| |
{ (yyval) = VL(/*we know that we will not change it*/const_cast<VBool*>(&vfalse), 0, 0, 0); } |
| |
break; |
| |
|
| |
case 172: |
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 847 "compile.y" |
| |
{ (yyval)=N(); } |
| |
break; |
| |
|
| |
|
| |
|
| |
/* Line 1806 of yacc.c */ |
| |
#line 2973 "compile.tab.C" |
| |
default: break; |
| } |
} |
| |
/* User semantic actions sometimes alter yychar, and that requires |
| |
that yytoken be updated with the new translation. We take the |
| |
approach of translating immediately before every use of yytoken. |
| |
One alternative is translating here after every semantic action, |
| |
but that translation would be missed if the semantic action invokes |
| |
YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or |
| |
if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an |
| |
incorrect destructor might then be invoked immediately. In the |
| |
case of YYERROR or YYBACKUP, subsequent parser actions might lead |
| |
to an incorrect destructor call or verbose syntax error message |
| |
before the lookahead is translated. */ |
| |
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); |
| |
|
| |
YYPOPSTACK (yylen); |
| |
yylen = 0; |
| |
YY_STACK_PRINT (yyss, yyssp); |
| |
|
| /* Else will try to reuse lookahead token |
*++yyvsp = yyval; |
| after shifting the error token. */ |
|
| |
|
| yyerrstatus = 3; /* Each real token shifted decrements this */ |
/* 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. */ |
| |
|
| goto yyerrhandle; |
yyn = yyr1[yyn]; |
| |
|
| yyerrdefault: /* current state does not do anything special for the error token. */ |
yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; |
| |
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) |
| |
yystate = yytable[yystate]; |
| |
else |
| |
yystate = yydefgoto[yyn - YYNTOKENS]; |
| |
|
| |
goto yynewstate; |
| |
|
| #if 0 |
|
| /* This is wrong; only states that explicitly want error tokens |
|
| should shift them. */ |
|
| yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ |
|
| if (yyn) goto yydefault; |
|
| #endif |
|
| |
|
| yyerrpop: /* pop the current state because it cannot handle the error token */ |
/*------------------------------------. |
| |
| yyerrlab -- here on detecting error | |
| |
`------------------------------------*/ |
| |
yyerrlab: |
| |
/* Make sure we have latest lookahead translation. See comments at |
| |
user semantic actions for why this is necessary. */ |
| |
yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar); |
| |
|
| if (yyssp == yyss) YYABORT; |
/* If not already recovering from an error, report this error. */ |
| yyvsp--; |
if (!yyerrstatus) |
| yystate = *--yyssp; |
{ |
| #ifdef YYLSP_NEEDED |
++yynerrs; |
| yylsp--; |
#if ! YYERROR_VERBOSE |
| |
yyerror (YY_("syntax error")); |
| |
#else |
| |
# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \ |
| |
yyssp, yytoken) |
| |
{ |
| |
char const *yymsgp = YY_("syntax error"); |
| |
int yysyntax_error_status; |
| |
yysyntax_error_status = YYSYNTAX_ERROR; |
| |
if (yysyntax_error_status == 0) |
| |
yymsgp = yymsg; |
| |
else if (yysyntax_error_status == 1) |
| |
{ |
| |
if (yymsg != yymsgbuf) |
| |
YYSTACK_FREE (yymsg); |
| |
yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc); |
| |
if (!yymsg) |
| |
{ |
| |
yymsg = yymsgbuf; |
| |
yymsg_alloc = sizeof yymsgbuf; |
| |
yysyntax_error_status = 2; |
| |
} |
| |
else |
| |
{ |
| |
yysyntax_error_status = YYSYNTAX_ERROR; |
| |
yymsgp = yymsg; |
| |
} |
| |
} |
| |
yyerror (yymsgp); |
| |
if (yysyntax_error_status == 2) |
| |
goto yyexhaustedlab; |
| |
} |
| |
# undef YYSYNTAX_ERROR |
| #endif |
#endif |
| |
} |
| |
|
| |
|
| |
|
| #if YYDEBUG != 0 |
if (yyerrstatus == 3) |
| if (yydebug) |
|
| { |
{ |
| short *ssp1 = yyss - 1; |
/* If just tried and failed to reuse lookahead token after an |
| fprintf (stderr, "Error: state stack now"); |
error, discard it. */ |
| while (ssp1 != yyssp) |
|
| fprintf (stderr, " %d", *++ssp1); |
if (yychar <= YYEOF) |
| fprintf (stderr, "\n"); |
{ |
| |
/* Return failure if at end of input. */ |
| |
if (yychar == YYEOF) |
| |
YYABORT; |
| |
} |
| |
else |
| |
{ |
| |
yydestruct ("Error: discarding", |
| |
yytoken, &yylval); |
| |
yychar = YYEMPTY; |
| |
} |
| } |
} |
| #endif |
|
| |
|
| yyerrhandle: |
/* Else will try to reuse lookahead token after shifting the error |
| |
token. */ |
| |
goto yyerrlab1; |
| |
|
| yyn = yypact[yystate]; |
|
| if (yyn == YYFLAG) |
|
| goto yyerrdefault; |
|
| |
|
| yyn += YYTERROR; |
/*---------------------------------------------------. |
| if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) |
| yyerrorlab -- error raised explicitly by YYERROR. | |
| goto yyerrdefault; |
`---------------------------------------------------*/ |
| |
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; |
| |
|
| |
/* 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; |
| |
|
| yyn = yytable[yyn]; |
|
| if (yyn < 0) |
/*-------------------------------------------------------------. |
| |
| yyerrlab1 -- common code for both syntax error and YYERROR. | |
| |
`-------------------------------------------------------------*/ |
| |
yyerrlab1: |
| |
yyerrstatus = 3; /* Each real token shifted decrements this. */ |
| |
|
| |
for (;;) |
| { |
{ |
| if (yyn == YYFLAG) |
yyn = yypact[yystate]; |
| goto yyerrpop; |
if (!yypact_value_is_default (yyn)) |
| yyn = -yyn; |
{ |
| goto yyreduce; |
yyn += YYTERROR; |
| } |
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) |
| else if (yyn == 0) |
{ |
| goto yyerrpop; |
yyn = yytable[yyn]; |
| |
if (0 < yyn) |
| |
break; |
| |
} |
| |
} |
| |
|
| if (yyn == YYFINAL) |
/* Pop the current state because it cannot handle the error token. */ |
| YYACCEPT; |
if (yyssp == yyss) |
| |
YYABORT; |
| |
|
| #if YYDEBUG != 0 |
|
| if (yydebug) |
yydestruct ("Error: popping", |
| fprintf(stderr, "Shifting error token, "); |
yystos[yystate], yyvsp); |
| #endif |
YYPOPSTACK (1); |
| |
yystate = *yyssp; |
| |
YY_STACK_PRINT (yyss, yyssp); |
| |
} |
| |
|
| *++yyvsp = yylval; |
*++yyvsp = yylval; |
| #ifdef YYLSP_NEEDED |
|
| *++yylsp = yylloc; |
|
| #endif |
/* Shift the error token. */ |
| |
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); |
| |
|
| yystate = yyn; |
yystate = yyn; |
| goto yynewstate; |
goto yynewstate; |
| |
|
| yyacceptlab: |
|
| /* YYACCEPT comes here. */ |
|
| if (yyfree_stacks) |
|
| { |
|
| free (yyss); |
|
| free (yyvs); |
|
| #ifdef YYLSP_NEEDED |
|
| free (yyls); |
|
| #endif |
|
| } |
|
| return 0; |
|
| |
|
| yyabortlab: |
/*-------------------------------------. |
| /* YYABORT comes here. */ |
| yyacceptlab -- YYACCEPT comes here. | |
| if (yyfree_stacks) |
`-------------------------------------*/ |
| { |
yyacceptlab: |
| free (yyss); |
yyresult = 0; |
| free (yyvs); |
goto yyreturn; |
| #ifdef YYLSP_NEEDED |
|
| free (yyls); |
/*-----------------------------------. |
| |
| yyabortlab -- YYABORT comes here. | |
| |
`-----------------------------------*/ |
| |
yyabortlab: |
| |
yyresult = 1; |
| |
goto yyreturn; |
| |
|
| |
#if !defined(yyoverflow) || YYERROR_VERBOSE |
| |
/*-------------------------------------------------. |
| |
| yyexhaustedlab -- memory exhaustion comes here. | |
| |
`-------------------------------------------------*/ |
| |
yyexhaustedlab: |
| |
yyerror (YY_("memory exhausted")); |
| |
yyresult = 2; |
| |
/* Fall through. */ |
| #endif |
#endif |
| |
|
| |
yyreturn: |
| |
if (yychar != YYEMPTY) |
| |
{ |
| |
/* Make sure we have latest lookahead translation. See comments at |
| |
user semantic actions for why this is necessary. */ |
| |
yytoken = YYTRANSLATE (yychar); |
| |
yydestruct ("Cleanup: discarding lookahead", |
| |
yytoken, &yylval); |
| } |
} |
| return 1; |
/* 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); |
| |
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 543 "compile.y" |
|
| |
|
| |
|
| |
/* Line 2067 of yacc.c */ |
| |
#line 849 "compile.y" |
| |
|
| #endif |
#endif |
| |
|
|
Line 1843 yyerrhandle:
|
Line 3220 yyerrhandle:
|
| 4:[^({]=pop |
4:[^({]=pop |
| */ |
*/ |
| |
|
| static int yylex(YYSTYPE *lvalp, void *pc) { |
inline void ungetc(Parse_control& pc, uint last_line_end_col) { |
| #define lexical_brackets_nestage PC.brackets_nestages[PC.sp] |
pc.source--; |
| |
if(pc.pos.col==0) { |
| |
--pc.pos.line; pc.pos.col=last_line_end_col; |
| |
} else |
| |
--pc.pos.col; |
| |
|
| |
} |
| |
static int yylex(YYSTYPE *lvalp, void *apc) { |
| |
register Parse_control& pc=*static_cast<Parse_control*>(apc); |
| |
|
| |
#define lexical_brackets_nestage pc.brackets_nestages[pc.ls_sp] |
| #define RC {result=c; goto break2; } |
#define RC {result=c; goto break2; } |
| |
|
| register int c; |
register int c; |
| int result; |
int result; |
| |
|
| if(PC.pending_state) { |
if(pc.pending_state) { |
| result=PC.pending_state; |
result=pc.pending_state; |
| PC.pending_state=0; |
pc.pending_state=0; |
| return result; |
return result; |
| } |
} |
| |
|
| const char *begin=PC.source; |
const char *begin=pc.source; |
| |
Pos begin_pos=pc.pos; |
| const char *end; |
const char *end; |
| int begin_line=PC.line; |
|
| int skip_analized=0; |
int skip_analized=0; |
| while(true) { |
while(true) { |
| c=*(end=(PC.source++)); |
c=*(end=(pc.source++)); |
| // fprintf(stderr, "\nchar: %c %02X; nestage: %d, sp=%d", c, c, lexical_brackets_nestage, PC.sp); |
// fprintf(stderr, "\nchar: %c %02X; nestage: %d, sp=%d", c, c, lexical_brackets_nestage, pc.sp); |
| |
|
| if(c=='\n') { |
if(c=='\n') |
| PC.line++; |
pc.pos_next_line(); |
| PC.col=0; |
else |
| } else |
pc.pos_next_c(c); |
| PC.col++; |
// fprintf(stderr, "\nchar: %c file(%d:%d)", c, pc.pos.line, pc.pos.col); |
| |
|
| if(c=='@' && PC.col==0+1) { |
if(pc.pos.col==0+1 && c=='@') { |
| if(PC.ls==LS_DEF_SPECIAL_BODY) { |
if(pc.ls==LS_DEF_SPECIAL_BODY) { |
| // @SPECIAL |
// @SPECIAL |
| // ... |
// ... |
| // @<here = |
// @<here = |
| pop_LS(PC); // exiting from LS_DEF_SPECIAL_BODY state |
pop_LS(pc); // exiting from LS_DEF_SPECIAL_BODY state |
| } // continuing checks |
} // continuing checks |
| if(PC.ls==LS_USER) { |
if(pc.ls==LS_USER) { |
| push_LS(PC, LS_DEF_NAME); |
push_LS(pc, LS_DEF_NAME); |
| RC; |
RC; |
| } else // @ in first column inside some code [when could that be?] |
} else // @ in first column inside some code [when could that be?] |
| result=BAD_METHOD_DECL_START; |
result=BAD_METHOD_DECL_START; |
| goto break2; |
goto break2; |
| } else if(c=='^') |
} |
| switch(PC.ls) { |
if(c=='^') { |
| |
if(pc.ls==LS_METHOD_AFTER) { |
| |
// handle after-method situation |
| |
pop_LS(pc); |
| |
result=EON; |
| |
skip_analized=-1; // return to punctuation afterwards to assure it's literality |
| |
goto break2; |
| |
} |
| |
switch(pc.ls) { |
| case LS_EXPRESSION_VAR_NAME_WITH_COLON: |
case LS_EXPRESSION_VAR_NAME_WITH_COLON: |
| case LS_EXPRESSION_VAR_NAME_WITHOUT_COLON: |
case LS_EXPRESSION_VAR_NAME_WITHOUT_COLON: |
| case LS_VAR_NAME_SIMPLE_WITH_COLON: |
case LS_VAR_NAME_SIMPLE_WITH_COLON: |
| case LS_VAR_NAME_SIMPLE_WITHOUT_COLON: |
case LS_VAR_NAME_SIMPLE_WITHOUT_COLON: |
| case LS_VAR_NAME_CURLY: |
case LS_VAR_NAME_CURLY: |
| case LS_METHOD_NAME: |
case LS_METHOD_NAME: |
| case LS_COMMENT: |
case LS_USER_COMMENT: |
| case LS_DEF_COMMENT: |
case LS_DEF_COMMENT: |
| // no literals in names, please |
// no literals in names, please |
| break; |
break; |
| default: |
default: |
| switch(*PC.source) { |
switch(*pc.source) { |
| // ^escaping some punctuators |
// ^escaping some punctuators |
| case '^': case '$': case ';': |
case '^': case '$': case ';': case '@': |
| case '(': case ')': |
case '(': case ')': |
| case '[': case ']': |
case '[': case ']': |
| case '{': case '}': |
case '{': case '}': |
| case '"': case ':': |
case '"': case ':': |
| if(end!=begin) { |
if(end!=begin) { |
| |
if(!pc.string_start) |
| |
pc.string_start=begin_pos; |
| // append piece till ^ |
// append piece till ^ |
| PC.string->APPEND_CLEAN(begin, end-begin, PC.file, begin_line); |
pc.string.append_strdup_know_length(begin, end-begin); |
| } |
} |
| // reset piece 'begin' position & line |
// reset piece 'begin' position & line |
| end=begin=PC.source; // ^ |
begin=pc.source; // ->punctuation |
| begin_line=PC.line; |
begin_pos=pc.pos; |
| if(PC.ls==LS_METHOD_AFTER) { |
// skip over _ after ^ |
| pop_LS(PC); |
pc.source++; pc.pos.col++; |
| result=EON; |
// skip analysis = forced literal |
| skip_analized=-1; // return to ^ afterwards to assure it's literality |
continue; |
| goto break2; |
|
| } else { |
|
| // skip over _ after ^ |
|
| PC.source++; PC.col++; |
|
| // skip analysis = forced literal |
|
| continue; |
|
| } |
|
| |
|
| // converting ^#HH into char(hex(HH)) |
// converting ^#HH into char(hex(HH)) |
| case '#': |
case '#': |
| if(end!=begin) { |
if(end!=begin) { |
| |
if(!pc.string_start) |
| |
pc.string_start=begin_pos; |
| // append piece till ^ |
// append piece till ^ |
| PC.string->APPEND_CLEAN(begin, end-begin, PC.file, begin_line); |
pc.string.append_strdup_know_length(begin, end-begin); |
| } |
} |
| // #HH ? |
// #HH ? |
| if(PC.source[0]=='#' && PC.source[1] && PC.source[2]) { |
if(pc.source[1] && isxdigit(pc.source[1]) && pc.source[2] && isxdigit(pc.source[2])) { |
| char *hex=(char *)POOL.malloc(1); |
char c=(char)( |
| hex[0]= |
hex_value[(unsigned char)pc.source[1]]*0x10+ |
| hex_value[(unsigned char)PC.source[1]]*0x10+ |
hex_value[(unsigned char)pc.source[2]]); |
| hex_value[(unsigned char)PC.source[2]]; |
if(c==0) { |
| if(hex[0]==0) { |
|
| result=BAD_HEX_LITERAL; |
result=BAD_HEX_LITERAL; |
| goto break2; // wrong hex value[no ^#00 chars allowed]: bail out |
goto break2; // wrong hex value[no ^#00 chars allowed]: bail out |
| } |
} |
| // append char(hex(HH)) |
// append char(hex(HH)) |
| PC.string->APPEND_CLEAN(hex, 1, PC.file, begin_line); |
pc.string.append(c); |
| // skip over ^#HH |
// skip over ^#HH |
| PC.source+=3; |
pc.source+=3; |
| PC.col+=3; |
pc.pos.col+=3; |
| // reset piece 'begin' position & line |
// reset piece 'begin' position & line |
| begin=PC.source; // ^ |
begin=pc.source; // ->after ^#HH |
| begin_line=PC.line; |
begin_pos=pc.pos; |
| |
// skip analysis = forced literal |
| continue; |
continue; |
| } |
} |
| break; |
// just escaped char |
| |
// reset piece 'begin' position & line |
| |
begin=pc.source; |
| |
begin_pos=pc.pos; |
| |
// skip over _ after ^ |
| |
pc.source++; pc.pos.col++; |
| |
// skip analysis = forced literal |
| |
continue; |
| } |
} |
| break; |
break; |
| |
} |
| } |
} |
| // #comment start skipping |
// #comment start skipping |
| if(c=='#' && PC.col==1) { |
if(c=='#' && pc.pos.col==1) { |
| if(end!=begin) { |
if(end!=begin) { |
| |
if(!pc.string_start) |
| |
pc.string_start=begin_pos; |
| // append piece till # |
// append piece till # |
| PC.string->APPEND_CLEAN(begin, end-begin, PC.file, begin_line); |
pc.string.append_strdup_know_length(begin, end-begin); |
| } |
} |
| // fall into COMMENT lexical state [wait for \n] |
// fall into COMMENT lexical state [wait for \n] |
| push_LS(PC, LS_COMMENT); |
push_LS(pc, LS_USER_COMMENT); |
| continue; |
continue; |
| } |
} |
| switch(PC.ls) { |
switch(pc.ls) { |
| |
|
| // USER'S = NOT OURS |
// USER'S = NOT OURS |
| case LS_USER: |
case LS_USER: |
| case LS_NAME_SQUARE_PART: // name.[here].xxx |
case LS_NAME_SQUARE_PART: // name.[here].xxx |
| if(PC.trim_bof) |
if(pc.trim_bof) |
| switch(c) { |
switch(c) { |
| case '\n': case ' ': case '\t': |
case '\n': case ' ': case '\t': |
| begin=PC.source; |
begin=pc.source; |
| begin_line=PC.line; |
begin_pos=pc.pos; |
| continue; // skip it |
continue; // skip it |
| default: |
default: |
| PC.trim_bof=false; |
pc.trim_bof=false; |
| } |
} |
| switch(c) { |
switch(c) { |
| case '$': |
case '$': |
| push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON); |
push_LS(pc, LS_VAR_NAME_SIMPLE_WITH_COLON); |
| RC; |
RC; |
| case '^': |
case '^': |
| push_LS(PC, LS_METHOD_NAME); |
push_LS(pc, LS_METHOD_NAME); |
| RC; |
RC; |
| case ']': |
case ']': |
| if(PC.ls==LS_NAME_SQUARE_PART) |
if(pc.ls==LS_NAME_SQUARE_PART) |
| if(--lexical_brackets_nestage==0) {// $name.[co<]?>de<]?> |
if(--lexical_brackets_nestage==0) {// $name.[co<]?>de<]?> |
| pop_LS(PC); // $name.[co<]>de<]!> |
pop_LS(pc); // $name.[co<]>de<]!> |
| RC; |
RC; |
| } |
} |
| break; |
break; |
| case '[': // $name.[co<[>de] |
case '[': // $name.[co<[>de] |
| if(PC.ls==LS_NAME_SQUARE_PART) |
if(pc.ls==LS_NAME_SQUARE_PART) |
| lexical_brackets_nestage++; |
lexical_brackets_nestage++; |
| break; |
break; |
| } |
} |
| |
if(pc.explicit_result && c) |
| |
switch(c) { |
| |
case '\n': case ' ': case '\t': |
| |
begin=pc.source; |
| |
begin_pos=pc.pos; |
| |
continue; // skip it |
| |
default: |
| |
result=BAD_NONWHITESPACE_CHARACTER_IN_EXPLICIT_RESULT_MODE; |
| |
goto break2; |
| |
} |
| break; |
break; |
| |
|
| // #COMMENT |
// #COMMENT |
| case LS_COMMENT: |
case LS_USER_COMMENT: |
| if(c=='\n') { |
if(c=='\n') { |
| // skip comment |
// skip comment |
| begin=PC.source; |
begin=pc.source; |
| begin_line=PC.line; |
begin_pos=pc.pos; |
| |
|
| pop_LS(PC); |
pop_LS(pc); |
| continue; |
continue; |
| } |
} |
| break; |
break; |
|
Line 2016 default:
|
Line 3428 default:
|
| case '"': |
case '"': |
| case '\'': |
case '\'': |
| if( |
if( |
| PC.ls == LS_EXPRESSION_STRING_QUOTED && c=='"' || |
pc.ls == LS_EXPRESSION_STRING_QUOTED && c=='"' || |
| PC.ls == LS_EXPRESSION_STRING_APOSTROFED && c=='\'') { |
pc.ls == LS_EXPRESSION_STRING_APOSTROFED && c=='\'') { |
| pop_LS(PC); //"abc". | 'abc'. |
pop_LS(pc); //"abc". | 'abc'. |
| RC; |
RC; |
| } |
} |
| break; |
break; |
| case '$': |
case '$': |
| push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON); |
push_LS(pc, LS_VAR_NAME_SIMPLE_WITH_COLON); |
| RC; |
RC; |
| case '^': |
case '^': |
| push_LS(PC, LS_METHOD_NAME); |
push_LS(pc, LS_METHOD_NAME); |
| RC; |
RC; |
| } |
} |
| break; |
break; |
|
Line 2035 default:
|
Line 3447 default:
|
| case LS_DEF_NAME: |
case LS_DEF_NAME: |
| switch(c) { |
switch(c) { |
| case '[': |
case '[': |
| PC.ls=LS_DEF_PARAMS; |
pc.ls=LS_DEF_PARAMS; |
| RC; |
RC; |
| case '\n': |
case '\n': |
| PC.ls=LS_DEF_SPECIAL_BODY; |
pc.ls=LS_DEF_SPECIAL_BODY; |
| RC; |
RC; |
| } |
} |
| break; |
break; |
| |
|
| case LS_DEF_PARAMS: |
case LS_DEF_PARAMS: |
| switch(c) { |
switch(c) { |
| |
case '$': // common error |
| |
result=BAD_METHOD_PARAMETER_NAME_CHARACTER; |
| |
goto break2; |
| case ';': |
case ';': |
| RC; |
RC; |
| case ']': |
case ']': |
| PC.ls=*PC.source=='['?LS_DEF_LOCALS:LS_DEF_COMMENT; |
pc.ls=*pc.source=='['?LS_DEF_LOCALS:LS_DEF_COMMENT; |
| RC; |
RC; |
| case '\n': // wrong. bailing out |
case '\n': // wrong. bailing out |
| pop_LS(PC); |
pop_LS(pc); |
| RC; |
RC; |
| } |
} |
| break; |
break; |
|
Line 2062 default:
|
Line 3477 default:
|
| case ';': |
case ';': |
| RC; |
RC; |
| case ']': |
case ']': |
| PC.ls=LS_DEF_COMMENT; |
pc.ls=LS_DEF_COMMENT; |
| RC; |
RC; |
| case '\n': // wrong. bailing out |
case '\n': // wrong. bailing out |
| pop_LS(PC); |
pop_LS(pc); |
| RC; |
RC; |
| } |
} |
| break; |
break; |
| |
|
| case LS_DEF_COMMENT: |
case LS_DEF_COMMENT: |
| if(c=='\n') { |
if(c=='\n') { |
| pop_LS(PC); |
pop_LS(pc); |
| RC; |
RC; |
| } |
} |
| break; |
break; |
|
Line 2088 default:
|
Line 3503 default:
|
| switch(c) { |
switch(c) { |
| case ')': |
case ')': |
| if(--lexical_brackets_nestage==0) |
if(--lexical_brackets_nestage==0) |
| if(PC.ls==LS_METHOD_ROUND) // method round param ended |
if(pc.ls==LS_METHOD_ROUND) // method round param ended |
| PC.ls=LS_METHOD_AFTER; // look for method end |
pc.ls=LS_METHOD_AFTER; // look for method end |
| else // PC.ls==LS_VAR_ROUND // variable constructor ended |
else // pc.ls==LS_VAR_ROUND // variable constructor ended |
| pop_LS(PC); // return to normal life |
pop_LS(pc); // return to normal life |
| RC; |
RC; |
| |
case '#': // comment start skipping |
| |
if(end!=begin) { |
| |
if(!pc.string_start) |
| |
pc.string_start=begin_pos; |
| |
// append piece till # |
| |
pc.string.append_strdup_know_length(begin, end-begin); |
| |
} |
| |
// fall into COMMENT lexical state [wait for \n] |
| |
push_LS(pc, LS_EXPRESSION_COMMENT); |
| |
lexical_brackets_nestage=1; |
| |
continue; |
| case '$': |
case '$': |
| push_LS(PC, LS_EXPRESSION_VAR_NAME_WITH_COLON); |
push_LS(pc, LS_EXPRESSION_VAR_NAME_WITH_COLON); |
| RC; |
RC; |
| case '^': |
case '^': |
| push_LS(PC, LS_METHOD_NAME); |
push_LS(pc, LS_METHOD_NAME); |
| RC; |
RC; |
| case '(': |
case '(': |
| lexical_brackets_nestage++; |
lexical_brackets_nestage++; |
| RC; |
RC; |
| case '-': |
case '-': |
| switch(*PC.source) { |
switch(*pc.source) { |
| case 'f': // -f |
case 'f': // -f |
| skip_analized=1; |
skip_analized=1; |
| result=FEXISTS; |
result=FEXISTS; |
|
Line 2112 default:
|
Line 3538 default:
|
| skip_analized=1; |
skip_analized=1; |
| result=DEXISTS; |
result=DEXISTS; |
| goto break2; |
goto break2; |
| default: |
default: // minus |
| result=c; |
result=c; |
| goto break2; |
goto break2; |
| } |
} |
|
Line 2121 default:
|
Line 3547 default:
|
| case '~': |
case '~': |
| case ';': |
case ';': |
| RC; |
RC; |
| case '&': case '|': case '#': |
case '&': case '|': |
| if(*PC.source==c) { // && || |
if(*pc.source==c) { // && || |
| result=c=='#'?LXOR:c=='&'?LAND:LOR; |
result=c=='&'?LAND:LOR; |
| skip_analized=1; |
skip_analized=1; |
| } else |
} else |
| result=c; |
result=c; |
| goto break2; |
goto break2; |
| case '<': case '>': case '=': case '!': |
case '!': |
| if(*PC.source=='=') { // <= >= == != |
switch(pc.source[0]) { |
| |
case '|': // !| !|| |
| skip_analized=1; |
skip_analized=1; |
| switch(c) { |
if(pc.source[1]=='|') { |
| case '<': result=NLE; break; |
skip_analized++; |
| case '>': result=NGE; break; |
result=LXOR; |
| case '=': result=NEQ; break; |
} else |
| case '!': result=NNE; break; |
result=NXOR; |
| } |
goto break2; |
| } else |
case '=': // != |
| result=c; |
skip_analized=1; |
| |
result=NNE; |
| |
goto break2; |
| |
} |
| |
RC; |
| |
|
| |
case '<': // <<, <=, < |
| |
switch(*pc.source) { |
| |
case '<': // <[<] |
| |
skip_analized=1; result=NSL; break; |
| |
case '=': // <[=] |
| |
skip_analized=1; result=NLE; break; |
| |
default: // <[] |
| |
result=c; break; |
| |
} |
| |
goto break2; |
| |
case '>': // >>, >=, > |
| |
switch(*pc.source) { |
| |
case '>': // >[>] |
| |
skip_analized=1; result=NSR; break; |
| |
case '=': // >[=] |
| |
skip_analized=1; result=NGE; break; |
| |
default: // >[] |
| |
result=c; break; |
| |
} |
| goto break2; |
goto break2; |
| |
case '=': // == |
| |
switch(*pc.source) { |
| |
case '=': // =[=] |
| |
skip_analized=1; result=NEQ; break; |
| |
default: // =[] |
| |
result=c; break; // not used now |
| |
} |
| |
goto break2; |
| |
|
| case '"': |
case '"': |
| push_LS(PC, LS_EXPRESSION_STRING_QUOTED); |
push_LS(pc, LS_EXPRESSION_STRING_QUOTED); |
| RC; |
RC; |
| case '\'': |
case '\'': |
| push_LS(PC, LS_EXPRESSION_STRING_APOSTROFED); |
push_LS(pc, LS_EXPRESSION_STRING_APOSTROFED); |
| RC; |
RC; |
| case 'l': case 'g': case 'e': case 'n': |
case 'l': case 'g': case 'e': case 'n': |
| if(end==begin) // right after whitespace |
if(end==begin) // right after whitespace |
| if(isspace(PC.source[1])) { |
if(isspace(pc.source[1])) { |
| switch(*PC.source) { |
switch(*pc.source) { |
| // case '?': // ok [and bad cases, yacc would bark at them] |
// case '?': // ok [and bad cases, yacc would bark at them] |
| case 't': // lt gt [et nt] |
case 't': // lt gt [et nt] |
| result=c=='l'?SLT:c=='g'?SGT:BAD_STRING_COMPARISON_OPERATOR; |
result=c=='l'?SLT:c=='g'?SGT:BAD_STRING_COMPARISON_OPERATOR; |
|
Line 2168 default:
|
Line 3628 default:
|
| break; |
break; |
| case 'i': |
case 'i': |
| if(end==begin) // right after whitespace |
if(end==begin) // right after whitespace |
| if(isspace(PC.source[1])) { |
if(isspace(pc.source[1])) { |
| switch(PC.source[0]) { |
switch(pc.source[0]) { |
| case 'n': // in |
case 'n': // in |
| skip_analized=1; |
skip_analized=1; |
| result=IN; |
result=IN; |
|
Line 2183 default:
|
Line 3643 default:
|
| break; |
break; |
| case 'd': |
case 'd': |
| if(end==begin) // right after whitespace |
if(end==begin) // right after whitespace |
| if(PC.source[0]=='e' && PC.source[1]=='f') { // def |
if(pc.source[0]=='e' && pc.source[1]=='f') { // def |
| skip_analized=2; |
switch(pc.source[2]){ |
| result=DEF; |
case ' ': case '\t': case '\n': case '"': case '\'': case '^': case '$': // non-quoted string without whitespace after 'def' is not allowed |
| |
skip_analized=2; |
| |
result=DEF; |
| |
goto break2; |
| |
} |
| |
// error: incorrect char after 'def' |
| |
} |
| |
break; |
| |
case 't': |
| |
if(end==begin) // right after whitespace |
| |
if(pc.source[0]=='r' && pc.source[1]=='u' && pc.source[2]=='e') { // true |
| |
skip_analized=3; |
| |
result=LITERAL_TRUE; |
| |
goto break2; |
| |
} |
| |
break; |
| |
case 'f': |
| |
if(end==begin) // right after whitespace |
| |
if(pc.source[0]=='a' && pc.source[1]=='l' && pc.source[2]=='s' && pc.source[3]=='e') { // false |
| |
skip_analized=4; |
| |
result=LITERAL_FALSE; |
| goto break2; |
goto break2; |
| } |
} |
| break; |
break; |
|
Line 2197 default:
|
Line 3677 default:
|
| // that's a leading|traling space or after-operator-space |
// that's a leading|traling space or after-operator-space |
| // ignoring it |
// ignoring it |
| // reset piece 'begin' position & line |
// reset piece 'begin' position & line |
| begin=PC.source; // after whitespace char |
begin=pc.source; // after whitespace char |
| begin_line=PC.line; |
begin_pos=pc.pos; |
| |
continue; |
| |
} |
| |
break; |
| |
case LS_EXPRESSION_COMMENT: |
| |
if(c=='(') |
| |
lexical_brackets_nestage++; |
| |
|
| |
switch(*pc.source) { |
| |
case '\n': case ')': |
| |
if(*pc.source==')') |
| |
if(--lexical_brackets_nestage!=0) |
| |
continue; |
| |
|
| |
// skip comment |
| |
begin=pc.source; |
| |
begin_pos=pc.pos; |
| |
|
| |
pop_LS(pc); |
| continue; |
continue; |
| } |
} |
| break; |
break; |
|
Line 2209 default:
|
Line 3707 default:
|
| case LS_EXPRESSION_VAR_NAME_WITH_COLON: |
case LS_EXPRESSION_VAR_NAME_WITH_COLON: |
| case LS_EXPRESSION_VAR_NAME_WITHOUT_COLON: |
case LS_EXPRESSION_VAR_NAME_WITHOUT_COLON: |
| if( |
if( |
| PC.ls==LS_EXPRESSION_VAR_NAME_WITH_COLON || |
pc.ls==LS_EXPRESSION_VAR_NAME_WITH_COLON || |
| PC.ls==LS_EXPRESSION_VAR_NAME_WITHOUT_COLON) { |
pc.ls==LS_EXPRESSION_VAR_NAME_WITHOUT_COLON) { |
| // name in expr ends also before binary operators |
// name in expr ends also before |
| switch(c) { |
switch(c) { |
| |
// expression minus |
| case '-': |
case '-': |
| pop_LS(PC); |
// expression integer division |
| PC.source--; if(--PC.col<0) { PC.line--; PC.col=-1; } |
case '\\': |
| |
pop_LS(pc); |
| |
pc.ungetc(); |
| result=EON; |
result=EON; |
| goto break2; |
goto break2; |
| } |
} |
| } |
} |
| if( |
if( |
| PC.ls==LS_VAR_NAME_SIMPLE_WITHOUT_COLON || |
pc.ls==LS_VAR_NAME_SIMPLE_WITHOUT_COLON || |
| PC.ls==LS_EXPRESSION_VAR_NAME_WITHOUT_COLON) { |
pc.ls==LS_EXPRESSION_VAR_NAME_WITHOUT_COLON) { |
| // name already has ':', stop before next |
// name already has ':', stop before next |
| switch(c) { |
switch(c) { |
| case ':': |
case ':': |
| pop_LS(PC); |
pop_LS(pc); |
| PC.source--; if(--PC.col<0) { PC.line--; PC.col=-1; } |
pc.ungetc(); |
| result=EON; |
result=EON; |
| goto break2; |
goto break2; |
| } |
} |
|
Line 2239 default:
|
Line 3740 default:
|
| case ']': case '}': case ')': |
case ']': case '}': case ')': |
| case '"': case '\'': |
case '"': case '\'': |
| case '<': case '>': // these stand for HTML brackets AND expression binary ops |
case '<': case '>': // these stand for HTML brackets AND expression binary ops |
| case '+': case '*': case '/': case '%': |
case '+': case '*': case '/': case '\\': case '%': |
| case '&': case '|': |
case '&': case '|': |
| case '=': case '!': |
case '=': case '!': |
| // common delimiters |
// common delimiters |
| case ',': case '?': |
case ',': case '?': case '#': |
| |
// mysql column separators |
| |
case '`': |
| // before call |
// before call |
| case '^': |
case '^': |
| pop_LS(PC); |
pop_LS(pc); |
| PC.source--; if(--PC.col<0) { PC.line--; PC.col=-1; } |
pc.ungetc(); |
| result=EON; |
result=EON; |
| goto break2; |
goto break2; |
| case '[': |
case '[': |
| // $name.<[>code] |
// $name.<[>code] |
| if(PC.col>1/*not first column*/ && ( |
if(pc.pos.col>1/*not first column*/ && ( |
| end[-1]=='$'/*was start of get*/ || |
end[-1]=='$'/*was start of get*/ || |
| end[-1]==':'/*was class name delim */ || |
end[-1]==':'/*was class name delim */ || |
| end[-1]=='.'/*was name delim */ |
end[-1]=='.'/*was name delim */ |
| )) { |
)) { |
| push_LS(PC, LS_NAME_SQUARE_PART); |
push_LS(pc, LS_NAME_SQUARE_PART); |
| lexical_brackets_nestage=1; |
lexical_brackets_nestage=1; |
| RC; |
RC; |
| } |
} |
| PC.ls=LS_VAR_SQUARE; |
pc.ls=LS_VAR_SQUARE; |
| lexical_brackets_nestage=1; |
lexical_brackets_nestage=1; |
| RC; |
RC; |
| case '{': |
case '{': |
| if(begin==end) { // ${name}, no need of EON, switching LS |
if(begin==end) { // ${name}, no need of EON, switching LS |
| PC.ls=LS_VAR_NAME_CURLY; |
pc.ls=LS_VAR_NAME_CURLY; |
| } else { |
} else { |
| PC.ls=LS_VAR_CURLY; |
pc.ls=LS_VAR_CURLY; |
| lexical_brackets_nestage=1; |
lexical_brackets_nestage=1; |
| } |
} |
| |
|
| RC; |
RC; |
| case '(': |
case '(': |
| PC.ls=LS_VAR_ROUND; |
pc.ls=LS_VAR_ROUND; |
| lexical_brackets_nestage=1; |
lexical_brackets_nestage=1; |
| RC; |
RC; |
| case '.': // name part delim |
case '.': // name part delim |
| case '$': // name part subvar |
case '$': // name part subvar |
| case ':': // class<:>name |
case ':': // class<:>name |
| // go to _WITHOUT_COLON state variant... |
// go to _WITHOUT_COLON state variant... |
| if(PC.ls==LS_VAR_NAME_SIMPLE_WITH_COLON) |
if(pc.ls==LS_VAR_NAME_SIMPLE_WITH_COLON) |
| PC.ls=LS_VAR_NAME_SIMPLE_WITHOUT_COLON; |
pc.ls=LS_VAR_NAME_SIMPLE_WITHOUT_COLON; |
| else if(PC.ls==LS_EXPRESSION_VAR_NAME_WITH_COLON) |
else if(pc.ls==LS_EXPRESSION_VAR_NAME_WITH_COLON) |
| PC.ls=LS_EXPRESSION_VAR_NAME_WITHOUT_COLON; |
pc.ls=LS_EXPRESSION_VAR_NAME_WITHOUT_COLON; |
| // ...stop before next ':' |
// ...stop before next ':' |
| RC; |
RC; |
| } |
} |
|
Line 2294 default:
|
Line 3797 default:
|
| switch(c) { |
switch(c) { |
| case '[': |
case '[': |
| // ${name.<[>code]} |
// ${name.<[>code]} |
| push_LS(PC, LS_NAME_SQUARE_PART); |
push_LS(pc, LS_NAME_SQUARE_PART); |
| lexical_brackets_nestage=1; |
lexical_brackets_nestage=1; |
| RC; |
RC; |
| case '}': // ${name} finished, restoring LS |
case '}': // ${name} finished, restoring LS |
| pop_LS(PC); |
pop_LS(pc); |
| RC; |
RC; |
| case '.': // name part delim |
case '.': // name part delim |
| case '$': // name part subvar |
case '$': // name part subvar |
|
Line 2310 default:
|
Line 3813 default:
|
| case LS_VAR_SQUARE: |
case LS_VAR_SQUARE: |
| switch(c) { |
switch(c) { |
| case '$': |
case '$': |
| push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON); |
push_LS(pc, LS_VAR_NAME_SIMPLE_WITH_COLON); |
| RC; |
RC; |
| case '^': |
case '^': |
| push_LS(PC, LS_METHOD_NAME); |
push_LS(pc, LS_METHOD_NAME); |
| RC; |
RC; |
| case ']': |
case ']': |
| if(--lexical_brackets_nestage==0) { |
if(--lexical_brackets_nestage==0) { |
| pop_LS(PC); |
pop_LS(pc); |
| RC; |
RC; |
| } |
} |
| break; |
break; |
|
Line 2332 default:
|
Line 3835 default:
|
| case LS_VAR_CURLY: |
case LS_VAR_CURLY: |
| switch(c) { |
switch(c) { |
| case '$': |
case '$': |
| push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON); |
push_LS(pc, LS_VAR_NAME_SIMPLE_WITH_COLON); |
| RC; |
RC; |
| case '^': |
case '^': |
| push_LS(PC, LS_METHOD_NAME); |
push_LS(pc, LS_METHOD_NAME); |
| RC; |
RC; |
| case '}': |
case '}': |
| if(--lexical_brackets_nestage==0) { |
if(--lexical_brackets_nestage==0) { |
| pop_LS(PC); |
pop_LS(pc); |
| RC; |
RC; |
| } |
} |
| break; |
break; |
|
Line 2354 default:
|
Line 3857 default:
|
| switch(c) { |
switch(c) { |
| case '[': |
case '[': |
| // ^name.<[>code].xxx |
// ^name.<[>code].xxx |
| if(PC.col>1/*not first column*/ && ( |
if(pc.pos.col>1/*not first column*/ && ( |
| end[-1]=='^'/*was start of call*/ || // never, ^[ is literal... |
end[-1]=='^'/*was start of call*/ || // never, ^[ is literal... |
| end[-1]==':'/*was class name delim */ || |
end[-1]==':'/*was class name delim */ || |
| end[-1]=='.'/*was name delim */ |
end[-1]=='.'/*was name delim */ |
| )) { |
)) { |
| push_LS(PC, LS_NAME_SQUARE_PART); |
push_LS(pc, LS_NAME_SQUARE_PART); |
| lexical_brackets_nestage=1; |
lexical_brackets_nestage=1; |
| RC; |
RC; |
| } |
} |
| PC.ls=LS_METHOD_SQUARE; |
pc.ls=LS_METHOD_SQUARE; |
| lexical_brackets_nestage=1; |
lexical_brackets_nestage=1; |
| RC; |
RC; |
| case '{': |
case '{': |
| PC.ls=LS_METHOD_CURLY; |
pc.ls=LS_METHOD_CURLY; |
| lexical_brackets_nestage=1; |
lexical_brackets_nestage=1; |
| RC; |
RC; |
| case '(': |
case '(': |
| PC.ls=LS_METHOD_ROUND; |
pc.ls=LS_METHOD_ROUND; |
| lexical_brackets_nestage=1; |
lexical_brackets_nestage=1; |
| RC; |
RC; |
| case '.': // name part delim |
case '.': // name part delim |
|
Line 2379 default:
|
Line 3882 default:
|
| case ':': // ':name' or 'class:name' |
case ':': // ':name' or 'class:name' |
| case '^': // ^abc^xxx wrong. bailing out |
case '^': // ^abc^xxx wrong. bailing out |
| case ']': case '}': case ')': // ^abc]}) wrong. bailing out |
case ']': case '}': case ')': // ^abc]}) wrong. bailing out |
| |
case ' ': // ^if ( wrong. bailing out |
| RC; |
RC; |
| } |
} |
| break; |
break; |
|
Line 2386 default:
|
Line 3890 default:
|
| case LS_METHOD_SQUARE: |
case LS_METHOD_SQUARE: |
| switch(c) { |
switch(c) { |
| case '$': |
case '$': |
| push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON); |
push_LS(pc, LS_VAR_NAME_SIMPLE_WITH_COLON); |
| RC; |
RC; |
| case '^': |
case '^': |
| push_LS(PC, LS_METHOD_NAME); |
push_LS(pc, LS_METHOD_NAME); |
| RC; |
RC; |
| case ';': // param delim |
case ';': // param delim |
| RC; |
RC; |
| case ']': |
case ']': |
| if(--lexical_brackets_nestage==0) { |
if(--lexical_brackets_nestage==0) { |
| PC.ls=LS_METHOD_AFTER; |
pc.ls=LS_METHOD_AFTER; |
| RC; |
RC; |
| } |
} |
| break; |
break; |
|
Line 2408 default:
|
Line 3912 default:
|
| case LS_METHOD_CURLY: |
case LS_METHOD_CURLY: |
| switch(c) { |
switch(c) { |
| case '$': |
case '$': |
| push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON); |
push_LS(pc, LS_VAR_NAME_SIMPLE_WITH_COLON); |
| RC; |
RC; |
| case '^': |
case '^': |
| push_LS(PC, LS_METHOD_NAME); |
push_LS(pc, LS_METHOD_NAME); |
| RC; |
RC; |
| case ';': // param delim |
case ';': // param delim |
| RC; |
RC; |
| case '}': |
case '}': |
| if(--lexical_brackets_nestage==0) { |
if(--lexical_brackets_nestage==0) { |
| PC.ls=LS_METHOD_AFTER; |
pc.ls=LS_METHOD_AFTER; |
| RC; |
RC; |
| } |
} |
| break; |
break; |
|
Line 2425 default:
|
Line 3929 default:
|
| lexical_brackets_nestage++; |
lexical_brackets_nestage++; |
| break; |
break; |
| } |
} |
| |
if(pc.explicit_result && c) |
| |
switch(c) { |
| |
case '\n': case ' ': case '\t': |
| |
begin=pc.source; |
| |
begin_pos=pc.pos; |
| |
continue; // skip it |
| |
default: |
| |
result=BAD_NONWHITESPACE_CHARACTER_IN_EXPLICIT_RESULT_MODE; |
| |
goto break2; |
| |
} |
| break; |
break; |
| |
|
| case LS_METHOD_AFTER: |
case LS_METHOD_AFTER: |
| if(c=='[') {/* ][ }[ )[ */ |
if(c=='[') {/* ][ }[ )[ */ |
| PC.ls=LS_METHOD_SQUARE; |
pc.ls=LS_METHOD_SQUARE; |
| lexical_brackets_nestage=1; |
lexical_brackets_nestage=1; |
| RC; |
RC; |
| } |
} |
| if(c=='{') {/* ]{ }{ ){ */ |
if(c=='{') {/* ]{ }{ ){ */ |
| PC.ls=LS_METHOD_CURLY; |
pc.ls=LS_METHOD_CURLY; |
| lexical_brackets_nestage=1; |
lexical_brackets_nestage=1; |
| RC; |
RC; |
| } |
} |
| if(c=='(') {/* ]( }( )( */ |
if(c=='(') {/* ]( }( )( */ |
| PC.ls=LS_METHOD_ROUND; |
pc.ls=LS_METHOD_ROUND; |
| lexical_brackets_nestage=1; |
lexical_brackets_nestage=1; |
| RC; |
RC; |
| } |
} |
| pop_LS(PC); |
pop_LS(pc); |
| PC.source--; if(--PC.col<0) { PC.line--; PC.col=-1; } |
pc.ungetc(); |
| result=EON; |
result=EON; |
| goto break2; |
goto break2; |
| } |
} |
|
Line 2456 default:
|
Line 3970 default:
|
| |
|
| break2: |
break2: |
| if(end!=begin) { // there is last piece? |
if(end!=begin) { // there is last piece? |
| if((c=='@' || c==0) && end[-1]=='\n') { // we are before LS_DEF_NAME or EOF? |
if(c=='@' || c==0) // we are before LS_DEF_NAME or EOF? |
| // strip last \n |
while(end!=begin && end[-1]=='\n') // trim all empty lines before LS_DEF_NAME and EOF |
| end--; |
|
| if(end!=begin && end[-1]=='\n') // allow one empty line before LS_DEF_NAME |
|
| end--; |
end--; |
| } |
if(end!=begin && pc.ls!=LS_USER_COMMENT) { // last piece still alive and not comment? |
| if(end!=begin && PC.ls!=LS_COMMENT) { // last piece still alive and not comment? |
if(!pc.string_start) |
| |
pc.string_start=begin_pos; |
| // append it |
// append it |
| PC.string->APPEND_CLEAN(begin, end-begin, PC.file, begin_line/*, start_col*/); |
pc.string.append_strdup_know_length(begin, end-begin); |
| } |
} |
| } |
} |
| if(PC.string->size()) { // something accumulated? |
if(!pc.string.is_empty()) { // something accumulated? |
| // create STRING value: array of OP_VALUE+vstring |
// create STRING value: array of OP_VALUE+origin+vstring |
| *lvalp=VL(NEW VString(*PC.string)); |
*lvalp=VL( |
| |
new VString(*new String(pc.string, String::L_CLEAN)), |
| |
pc.file_no, pc.string_start.line, pc.string_start.col); |
| // new pieces storage |
// new pieces storage |
| PC.string=NEW String(POOL); |
pc.string.clear(); |
| |
pc.string_start.clear(); |
| // make current result be pending for next call, return STRING for now |
// make current result be pending for next call, return STRING for now |
| PC.pending_state=result; result=STRING; |
pc.pending_state=result; result=STRING; |
| } |
} |
| if(skip_analized) { |
if(skip_analized) { |
| PC.source+=skip_analized; PC.col+=skip_analized; |
pc.source+=skip_analized; pc.pos.col+=skip_analized; |
| } |
} |
| return result; |
return result; |
| } |
} |
| |
|
| static int real_yyerror(parse_control *pc, char *s) { // Called by yyparse on error |
static int real_yyerror(Parse_control *pc, const char *s) { // Called by yyparse on error |
| strncpy(PC.error, s, MAX_STRING); |
strncpy(PC.error, s, MAX_STRING); |
| return 1; |
return 1; |
| } |
} |
| |
|
| static void yyprint(FILE *file, int type, YYSTYPE value) { |
static void yyprint(FILE *file, int type, YYSTYPE value) { |
| if(type==STRING) |
if(type==STRING) |
| fprintf(file, " \"%s\"", LA2S(value)->cstr()); |
fprintf(file, " \"%s\"", LA2S(*value)->cstr()); |
| } |
} |
| |
|
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to compile.tab.C CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / parser3 / src / main