/
auroraos
/
mirror_bison
Обзор
Документация
Войти
/
auroraos
/
mirror_bison
Код
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
master
src/parse-gram.c
3 293 строки
111 KB
Paul Eggert
bison: tighten up output file names
23 апр 2026, 22:49
23 апр 2026, 22:49
8d101c1
Код
Авторство
О чём код?
/* A Bison parser, made by GNU Bison 3.8.2.66-3169-modified. */ /* Bison implementation for Yacc-like parsers in C Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2022, 2025-2026 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 <https://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. */ /* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual, especially those whose name start with YY_ or yy_. They are private implementation details that can be changed or removed. */ /* 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, and Bison version. */ #define YYBISON 30802 /* Bison version string. */ #define YYBISON_VERSION "3.8.2.66-3169-modified" /* Skeleton name. */ #define YYSKELETON_NAME "yacc.c" /* Pure parsers. */ #define YYPURE 2 /* Push parsers. */ #define YYPUSH 0 /* Pull parsers. */ #define YYPULL 1 /* "%code top" blocks. */ /* On column 0 to please syntax-check. */ #include <config.h> /* Substitute the type names. */ #define YYSTYPE GRAM_STYPE #define YYLTYPE GRAM_LTYPE /* Substitute the variable and function names. */ #define yyparse gram_parse #define yylex gram_lex #define yyerror gram_error #define yydebug gram_debug #define yynerrs gram_nerrs # ifndef YY_CAST # ifdef __cplusplus # define YY_CAST(Type, Val) static_cast<Type> (Val) # define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val) # else # define YY_CAST(Type, Val) ((Type) (Val)) # define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val)) # endif # endif # ifndef YY_NULLPTR # if defined __cplusplus # if 201103L <= __cplusplus # define YY_NULLPTR nullptr # else # define YY_NULLPTR 0 # endif # else # define YY_NULLPTR ((void*)0) # endif # endif #include "src/parse-gram.h" /* Symbol kind. */ enum yysymbol_kind_t { YYSYMBOL_YYEMPTY = -2, YYSYMBOL_YYEOF = 0, /* "end of file" */ YYSYMBOL_YYerror = 1, /* error */ YYSYMBOL_YYUNDEF = 2, /* "invalid token" */ YYSYMBOL_STRING = 3, /* "string" */ YYSYMBOL_TSTRING = 4, /* "translatable string" */ YYSYMBOL_PERCENT_TOKEN = 5, /* "%token" */ YYSYMBOL_PERCENT_NTERM = 6, /* "%nterm" */ YYSYMBOL_PERCENT_TYPE = 7, /* "%type" */ YYSYMBOL_PERCENT_DESTRUCTOR = 8, /* "%destructor" */ YYSYMBOL_PERCENT_PRINTER = 9, /* "%printer" */ YYSYMBOL_PERCENT_LEFT = 10, /* "%left" */ YYSYMBOL_PERCENT_RIGHT = 11, /* "%right" */ YYSYMBOL_PERCENT_NONASSOC = 12, /* "%nonassoc" */ YYSYMBOL_PERCENT_PRECEDENCE = 13, /* "%precedence" */ YYSYMBOL_PERCENT_PREC = 14, /* "%prec" */ YYSYMBOL_PERCENT_DPREC = 15, /* "%dprec" */ YYSYMBOL_PERCENT_MERGE = 16, /* "%merge" */ YYSYMBOL_PERCENT_CODE = 17, /* "%code" */ YYSYMBOL_PERCENT_DEFAULT_PREC = 18, /* "%default-prec" */ YYSYMBOL_PERCENT_DEFINE = 19, /* "%define" */ YYSYMBOL_PERCENT_ERROR_VERBOSE = 20, /* "%error-verbose" */ YYSYMBOL_PERCENT_EXPECT = 21, /* "%expect" */ YYSYMBOL_PERCENT_EXPECT_RR = 22, /* "%expect-rr" */ YYSYMBOL_PERCENT_FILE_PREFIX = 23, /* "%file-prefix" */ YYSYMBOL_PERCENT_FLAG = 24, /* "%<flag>" */ YYSYMBOL_PERCENT_GLR_PARSER = 25, /* "%glr-parser" */ YYSYMBOL_PERCENT_HEADER = 26, /* "%header" */ YYSYMBOL_PERCENT_INITIAL_ACTION = 27, /* "%initial-action" */ YYSYMBOL_PERCENT_LANGUAGE = 28, /* "%language" */ YYSYMBOL_PERCENT_NAME_PREFIX = 29, /* "%name-prefix" */ YYSYMBOL_PERCENT_NO_DEFAULT_PREC = 30, /* "%no-default-prec" */ YYSYMBOL_PERCENT_NO_LINES = 31, /* "%no-lines" */ YYSYMBOL_PERCENT_NONDETERMINISTIC_PARSER = 32, /* "%nondeterministic-parser" */ YYSYMBOL_PERCENT_OUTPUT = 33, /* "%output" */ YYSYMBOL_PERCENT_PURE_PARSER = 34, /* "%pure-parser" */ YYSYMBOL_PERCENT_REQUIRE = 35, /* "%require" */ YYSYMBOL_PERCENT_SKELETON = 36, /* "%skeleton" */ YYSYMBOL_PERCENT_START = 37, /* "%start" */ YYSYMBOL_PERCENT_TOKEN_TABLE = 38, /* "%token-table" */ YYSYMBOL_PERCENT_VERBOSE = 39, /* "%verbose" */ YYSYMBOL_PERCENT_YACC = 40, /* "%yacc" */ YYSYMBOL_BRACED_CODE = 41, /* "{...}" */ YYSYMBOL_BRACED_PREDICATE = 42, /* "%?{...}" */ YYSYMBOL_BRACKETED_ID = 43, /* "[identifier]" */ YYSYMBOL_CHAR_LITERAL = 44, /* "character literal" */ YYSYMBOL_COLON = 45, /* ":" */ YYSYMBOL_EPILOGUE = 46, /* "epilogue" */ YYSYMBOL_EQUAL = 47, /* "=" */ YYSYMBOL_ID = 48, /* "identifier" */ YYSYMBOL_ID_COLON = 49, /* "identifier:" */ YYSYMBOL_PERCENT_PERCENT = 50, /* "%%" */ YYSYMBOL_PIPE = 51, /* "|" */ YYSYMBOL_PROLOGUE = 52, /* "%{...%}" */ YYSYMBOL_SEMICOLON = 53, /* ";" */ YYSYMBOL_TAG = 54, /* "<tag>" */ YYSYMBOL_TAG_ANY = 55, /* "<*>" */ YYSYMBOL_TAG_NONE = 56, /* "<>" */ YYSYMBOL_INT_LITERAL = 57, /* "integer literal" */ YYSYMBOL_PERCENT_PARAM = 58, /* "%param" */ YYSYMBOL_PERCENT_UNION = 59, /* "%union" */ YYSYMBOL_PERCENT_EMPTY = 60, /* "%empty" */ YYSYMBOL_YYACCEPT = 61, /* $accept */ YYSYMBOL_input = 62, /* input */ YYSYMBOL_prologue_declarations = 63, /* prologue_declarations */ YYSYMBOL_prologue_declaration = 64, /* prologue_declaration */ YYSYMBOL_65_1 = 65, /* $@1 */ YYSYMBOL_params = 66, /* params */ YYSYMBOL_grammar_declaration = 67, /* grammar_declaration */ YYSYMBOL_code_props_type = 68, /* code_props_type */ YYSYMBOL_union_name = 69, /* union_name */ YYSYMBOL_symbol_declaration = 70, /* symbol_declaration */ YYSYMBOL_71_2 = 71, /* $@2 */ YYSYMBOL_72_3 = 72, /* $@3 */ YYSYMBOL_73_4 = 73, /* $@4 */ YYSYMBOL_precedence_declarator = 74, /* precedence_declarator */ YYSYMBOL_75_string_opt = 75, /* string.opt */ YYSYMBOL_76_tag_opt = 76, /* tag.opt */ YYSYMBOL_generic_symlist = 77, /* generic_symlist */ YYSYMBOL_generic_symlist_item = 78, /* generic_symlist_item */ YYSYMBOL_tag = 79, /* tag */ YYSYMBOL_nterm_decls = 80, /* nterm_decls */ YYSYMBOL_token_decls = 81, /* token_decls */ YYSYMBOL_82_token_decl_1 = 82, /* token_decl.1 */ YYSYMBOL_token_decl = 83, /* token_decl */ YYSYMBOL_84_int_opt = 84, /* int.opt */ YYSYMBOL_alias = 85, /* alias */ YYSYMBOL_token_decls_for_prec = 86, /* token_decls_for_prec */ YYSYMBOL_87_token_decl_for_prec_1 = 87, /* token_decl_for_prec.1 */ YYSYMBOL_token_decl_for_prec = 88, /* token_decl_for_prec */ YYSYMBOL_symbol_decls = 89, /* symbol_decls */ YYSYMBOL_90_symbols_1 = 90, /* symbols.1 */ YYSYMBOL_grammar = 91, /* grammar */ YYSYMBOL_rules_or_grammar_declaration = 92, /* rules_or_grammar_declaration */ YYSYMBOL_rules = 93, /* rules */ YYSYMBOL_94_5 = 94, /* $@5 */ YYSYMBOL_95_rhses_1 = 95, /* rhses.1 */ YYSYMBOL_rhs = 96, /* rhs */ YYSYMBOL_97_named_ref_opt = 97, /* named_ref.opt */ YYSYMBOL_variable = 98, /* variable */ YYSYMBOL_value = 99, /* value */ YYSYMBOL_id = 100, /* id */ YYSYMBOL_id_colon = 101, /* id_colon */ YYSYMBOL_symbol = 102, /* symbol */ YYSYMBOL_string_as_id = 103, /* string_as_id */ YYSYMBOL_104_epilogue_opt = 104 /* epilogue.opt */ }; typedef enum yysymbol_kind_t yysymbol_kind_t; /* Unqualified %code blocks. */ #include "system.h" #include <c-ctype.h> #include <quotearg.h> #include <vasnprintf.h> #include <xmemdup0.h> #include "complain.h" #include "conflicts.h" #include "files.h" #include "getargs.h" #include "gram.h" #include "named-ref.h" #include "reader.h" #include "scan-code.h" #include "scan-gram.h" #include "strversion.h" /* Pretend to be at least that version, to check features published in that version while developping it. */ static const char* api_version = "3.8"; static int current_prec = 0; static location current_lhs_loc; static named_ref *current_lhs_named_ref; static symbol *current_lhs_symbol; static symbol_class current_class = unknown_sym; /** Set the new current left-hand side symbol, possibly common * to several right-hand side parts of rule. */ static void current_lhs (symbol *sym, location loc, named_ref *ref); #define YYLLOC_DEFAULT(Current, Rhs, N) \ (Current) = lloc_default (Rhs, N) static YYLTYPE lloc_default (YYLTYPE const *, int); #define YY_LOCATION_PRINT(File, Loc) \ location_print (Loc, File) /* Strip initial '{' and final '}' (must be first and last characters). Return the result. */ static char *strip_braces (char *code); /* Convert CODE by calling code_props_plain_init if PLAIN, otherwise code_props_symbol_action_init. Calls gram_scanner_last_string_free to release the latest string from the scanner (should be CODE). */ static char const *translate_code (char *code, location loc, bool plain); /* Convert CODE by calling code_props_plain_init after having stripped the first and last characters (expected to be '{', and '}'). Calls gram_scanner_last_string_free to release the latest string from the scanner (should be CODE). */ static char const *translate_code_braceless (char *code, location loc); /* Is FILE a valid output file name? */ static bool valid_output_file_name (char const *file); /* Handle a %header directive. */ static void handle_header (location const *loc, char const *value); /* Handle a %error-verbose directive. */ static void handle_error_verbose (location const *loc, char const *directive); /* Handle a %file-prefix directive. */ static void handle_file_prefix (location const *loc, location const *dir_loc, char const *directive, char const *value); /* Handle a %language directive. */ static void handle_language (location const *loc, char const *lang); /* Handle a %name-prefix directive. */ static void handle_name_prefix (location const *loc, char const *directive, char const *value); /* Handle a %pure-parser directive. */ static void handle_pure_parser (location const *loc, char const *directive); /* Handle a %require directive. */ static void handle_require (location const *loc, char const *version); /* Handle a %skeleton directive. */ static void handle_skeleton (location const *loc, char const *skel); /* Handle a %yacc directive. */ static void handle_yacc (location const *loc); /* Implementation of yyerror. */ static void gram_error (location const *, char const *); /* A string that describes a char (e.g., 'a' -> "'a'"). */ static char const *char_name (char); /* Add style to semantic values in traces. */ static void tron (FILE *yyo); static void troff (FILE *yyo); /* Interpret a quoted string (such as `"Hello, \"World\"\n\""`). Manages the memory of the result. */ static char *unquote (const char *str); /* Discard the latest unquoted string. */ static void unquote_free (char *last_string); /** Add a lex-param and/or a parse-param. * * \param type where to push this formal argument. * \param decl the formal argument. Destroyed. * \param loc the location in the source. */ static void add_param (param_type type, char *decl, location loc); static param_type current_param = param_none; #ifdef short # undef short #endif /* On compilers that do not define __PTRDIFF_MAX__ etc., make sure <limits.h> and (if available) <stdint.h> are included so that the code can choose integer types of a good width. */ #ifndef __PTRDIFF_MAX__ # include <limits.h> /* INFRINGES ON USER NAME SPACE */ # if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__ # include <stdint.h> /* INFRINGES ON USER NAME SPACE */ # define YY_STDINT_H # endif #endif /* Narrow types that promote to a signed type and that can represent a signed or unsigned integer of at least N bits. In tables they can save space and decrease cache pressure. Promoting to a signed type helps avoid bugs in integer arithmetic. */ #ifdef __INT_LEAST8_MAX__ typedef __INT_LEAST8_TYPE__ yytype_int8; #elif defined YY_STDINT_H typedef int_least8_t yytype_int8; #else typedef signed char yytype_int8; #endif #ifdef __INT_LEAST16_MAX__ typedef __INT_LEAST16_TYPE__ yytype_int16; #elif defined YY_STDINT_H typedef int_least16_t yytype_int16; #else typedef short yytype_int16; #endif /* Work around bug in HP-UX 11.23, which defines these macros incorrectly for preprocessor constants. This workaround can likely be removed in 2023, as HPE has promised support for HP-UX 11.23 (aka HP-UX 11i v2) only through the end of 2022; see Table 2 of <https://h20195.www2.hpe.com/V2/getpdf.aspx/4AA4-7673ENW.pdf>. */ #ifdef __hpux # undef UINT_LEAST8_MAX # undef UINT_LEAST16_MAX # define UINT_LEAST8_MAX 255 # define UINT_LEAST16_MAX 65535 #endif #if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__ typedef __UINT_LEAST8_TYPE__ yytype_uint8; #elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \ && UINT_LEAST8_MAX <= INT_MAX) typedef uint_least8_t yytype_uint8; #elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX typedef unsigned char yytype_uint8; #else typedef short yytype_uint8; #endif #if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__ typedef __UINT_LEAST16_TYPE__ yytype_uint16; #elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \ && UINT_LEAST16_MAX <= INT_MAX) typedef uint_least16_t yytype_uint16; #elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX typedef unsigned short yytype_uint16; #else typedef int yytype_uint16; #endif #ifndef YYPTRDIFF_T # if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__ # define YYPTRDIFF_T __PTRDIFF_TYPE__ # define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__ # elif defined PTRDIFF_MAX # ifndef ptrdiff_t # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ # endif # define YYPTRDIFF_T ptrdiff_t # define YYPTRDIFF_MAXIMUM PTRDIFF_MAX # else # define YYPTRDIFF_T long # define YYPTRDIFF_MAXIMUM LONG_MAX # endif #endif #ifndef YYSIZE_T # ifdef __SIZE_TYPE__ # define YYSIZE_T __SIZE_TYPE__ # elif defined size_t # define YYSIZE_T size_t # elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__ # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ # define YYSIZE_T size_t # else # define YYSIZE_T unsigned # endif #endif #define YYSIZE_MAXIMUM \ YY_CAST (YYPTRDIFF_T, \ (YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1) \ ? YYPTRDIFF_MAXIMUM \ : YY_CAST (YYSIZE_T, -1))) #define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X)) /* Stored state numbers (used for stacks). */ typedef yytype_uint8 yy_state_t; /* State numbers in computations. */ typedef int yy_state_fast_t; #ifndef YY_ # 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 #ifndef N_ # define N_(Msgid) Msgid #endif #ifndef YY_ATTRIBUTE_PURE # if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__) # define YY_ATTRIBUTE_PURE __attribute__ ((__pure__)) # else # define YY_ATTRIBUTE_PURE # endif #endif #ifndef YY_ATTRIBUTE_UNUSED # if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__) # define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__)) # else # define YY_ATTRIBUTE_UNUSED # endif #endif /* Suppress unused-variable warnings by "using" E. */ #if ! defined lint || defined __GNUC__ # define YY_USE(E) ((void) (E)) #else # define YY_USE(E) /* empty */ #endif /* Suppress an incorrect diagnostic about yylval being uninitialized. */ #if defined __GNUC__ && ! defined __ICC && 406 <= __GNUC__ * 100 + __GNUC_MINOR__ # if __GNUC__ * 100 + __GNUC_MINOR__ < 407 # define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \ _Pragma ("GCC diagnostic push") \ _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"") # else # define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \ _Pragma ("GCC diagnostic push") \ _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"") \ _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"") # endif # define YY_IGNORE_MAYBE_UNINITIALIZED_END \ _Pragma ("GCC diagnostic pop") #else # define YY_INITIAL_VALUE(Value) Value #endif #ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN # define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN # define YY_IGNORE_MAYBE_UNINITIALIZED_END #endif #ifndef YY_INITIAL_VALUE # define YY_INITIAL_VALUE(Value) /* Nothing. */ #endif #if defined __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__ # define YY_IGNORE_USELESS_CAST_BEGIN \ _Pragma ("GCC diagnostic push") \ _Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"") # define YY_IGNORE_USELESS_CAST_END \ _Pragma ("GCC diagnostic pop") #endif #ifndef YY_IGNORE_USELESS_CAST_BEGIN # define YY_IGNORE_USELESS_CAST_BEGIN # define YY_IGNORE_USELESS_CAST_END #endif #define YY_ASSERT(E) ((void) (0 && (E))) #if 1 /* The parser invokes alloca or malloc; define the necessary symbols. */ # ifdef YYSTACK_ALLOC /* Pacify GCC's 'empty if-body' warning. */ # define YYSTACK_FREE(Ptr) do { /* empty */; } while (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 void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ # endif # endif # ifndef YYFREE # define YYFREE free # if ! defined free && ! defined EXIT_SUCCESS void free (void *); /* INFRINGES ON USER NAME SPACE */ # endif # endif # endif # define YYCOPY_NEEDED 1 #endif /* 1 */ #if (! defined yyoverflow \ && (! defined __cplusplus \ || (defined GRAM_LTYPE_IS_TRIVIAL && GRAM_LTYPE_IS_TRIVIAL \ && defined GRAM_STYPE_IS_TRIVIAL && GRAM_STYPE_IS_TRIVIAL))) /* A type that is properly aligned for any stack member. */ union yyalloc { yy_state_t yyss_alloc; YYSTYPE yyvs_alloc; YYLTYPE yyls_alloc; }; /* The size of the maximum gap between one aligned stack and the next. */ # define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1) /* The size of an array large to enough to hold all stacks, each with N elements. */ # define YYSTACK_BYTES(N) \ ((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (YYSTYPE) \ + YYSIZEOF (YYLTYPE)) \ + 2 * YYSTACK_GAP_MAXIMUM) # define YYCOPY_NEEDED 1 /* Relocate STACK from its old location to the new one. The local variables YYSIZE and YYSTACKSIZE give the old and new number of elements in the stack, and YYPTR gives the new location of the stack. Advance YYPTR to a properly aligned location for the next stack. */ # define YYSTACK_RELOCATE(Stack_alloc, Stack) \ do \ { \ YYPTRDIFF_T yynewbytes; \ YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \ Stack = &yyptr->Stack_alloc; \ yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \ yyptr += yynewbytes / YYSIZEOF (*yyptr); \ } \ while (0) #endif #if defined YYCOPY_NEEDED && YYCOPY_NEEDED /* Copy COUNT objects from SRC to DST. The source and destination do not overlap. */ # ifndef YYCOPY # if defined __GNUC__ && 1 < __GNUC__ # define YYCOPY(Dst, Src, Count) \ __builtin_memcpy (Dst, Src, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src))) # else # define YYCOPY(Dst, Src, Count) \ do \ { \ YYPTRDIFF_T yyi; \ for (yyi = 0; yyi < (Count); yyi++) \ (Dst)[yyi] = (Src)[yyi]; \ } \ while (0) # endif # endif #endif /* !YYCOPY_NEEDED */ /* YYFINAL -- State number of the termination state. */ #define YYFINAL 3 /* YYLAST -- Last index in YYTABLE. */ #define YYLAST 240 /* YYNTOKENS -- Number of terminals. */ #define YYNTOKENS 61 /* YYNNTS -- Number of nonterminals. */ #define YYNNTS 44 /* YYNRULES -- Number of rules. */ #define YYNRULES 125 /* YYNSTATES -- Number of states. */ #define YYNSTATES 169 /* YYMAXUTOK -- Last valid token kind. */ #define YYMAXUTOK 315 /* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM as returned by yylex, with out-of-bounds checking. */ #define YYTRANSLATE(YYX) YY_CAST (yysymbol_kind_t, YYX) #if GRAM_DEBUG /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */ static const yytype_int16 yyrline[] = { 0, 314, 314, 323, 324, 328, 329, 335, 339, 344, 345, 346, 347, 348, 349, 354, 359, 360, 361, 362, 363, 372, 372, 373, 374, 375, 376, 377, 378, 379, 380, 384, 385, 394, 395, 399, 410, 414, 418, 426, 436, 437, 447, 448, 454, 467, 467, 472, 472, 477, 477, 482, 492, 493, 494, 495, 500, 501, 505, 506, 511, 512, 516, 517, 521, 522, 523, 536, 545, 549, 553, 561, 562, 566, 579, 580, 585, 586, 587, 605, 609, 613, 621, 623, 628, 635, 645, 649, 653, 661, 667, 680, 681, 687, 688, 689, 696, 696, 704, 705, 706, 711, 714, 716, 718, 720, 722, 724, 726, 728, 730, 735, 736, 745, 769, 770, 771, 772, 784, 786, 810, 815, 816, 821, 829, 830 }; #endif /** Accessing symbol of state STATE. */ #define YY_ACCESSING_SYMBOL(State) YY_CAST (yysymbol_kind_t, yystos[State]) #if 1 /* The user-facing name of the symbol whose (internal) number is YYSYMBOL. No bounds checking. */ static const char *yysymbol_name (yysymbol_kind_t yysymbol) YY_ATTRIBUTE_UNUSED; static const char * yysymbol_name (yysymbol_kind_t yysymbol) { static const char *const yy_sname[] = { N_("end of file"), N_("error"), N_("invalid token"), N_("string"), N_("translatable string"), "%token", "%nterm", "%type", "%destructor", "%printer", "%left", "%right", "%nonassoc", "%precedence", "%prec", "%dprec", "%merge", "%code", "%default-prec", "%define", "%error-verbose", "%expect", "%expect-rr", "%file-prefix", "%<flag>", "%glr-parser", "%header", "%initial-action", "%language", "%name-prefix", "%no-default-prec", "%no-lines", "%nondeterministic-parser", "%output", "%pure-parser", "%require", "%skeleton", "%start", "%token-table", "%verbose", "%yacc", "{...}", "%?{...}", N_("[identifier]"), N_("character literal"), ":", N_("epilogue"), "=", N_("identifier"), N_("identifier:"), "%%", "|", "%{...%}", ";", N_("<tag>"), "<*>", "<>", N_("integer literal"), "%param", "%union", "%empty", "$accept", "input", "prologue_declarations", "prologue_declaration", "$@1", "params", "grammar_declaration", "code_props_type", "union_name", "symbol_declaration", "$@2", "$@3", "$@4", "precedence_declarator", "string.opt", "tag.opt", "generic_symlist", "generic_symlist_item", "tag", "nterm_decls", "token_decls", "token_decl.1", "token_decl", "int.opt", "alias", "token_decls_for_prec", "token_decl_for_prec.1", "token_decl_for_prec", "symbol_decls", "symbols.1", "grammar", "rules_or_grammar_declaration", "rules", "$@5", "rhses.1", "rhs", "named_ref.opt", "variable", "value", "id", "id_colon", "symbol", "string_as_id", "epilogue.opt", YY_NULLPTR }; /* YYTRANSLATABLE[SYMBOL-NUM] -- Whether YY_SNAME[SYMBOL-NUM] is internationalizable. */ static yytype_int8 yytranslatable[] = { 1, 1, 1, 1, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0 }; return (yysymbol < YYNTOKENS && yytranslatable[yysymbol] ? _(yy_sname[yysymbol]) : yy_sname[yysymbol]); } #endif #define YYPACT_NINF (-148) #define yypact_value_is_default(Yyn) \ ((Yyn) == YYPACT_NINF) #define YYTABLE_NINF (-125) #define yytable_value_is_error(Yyn) \ 0 /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing STATE-NUM. */ static const yytype_int16 yypact[] = { -148, 13, 113, -148, -27, -148, -148, -148, -148, -148, -148, -148, -148, -148, -33, -148, -21, -148, -29, -26, 26, -148, -148, 27, -9, 30, 31, -148, -148, -148, 32, -148, 34, 36, 112, -148, -148, -148, 168, -148, -148, -148, -3, -148, -148, 19, -148, 7, -148, -37, -37, 164, -148, 33, -148, 2, -148, -148, -148, -148, -148, -148, -148, -148, -148, -148, -148, -148, -148, -148, 112, -148, -148, -148, 9, -148, 20, 58, -148, -148, 37, 38, -148, 40, 155, 112, 35, 112, -148, 41, -148, -28, 43, -28, -148, 41, -148, 43, 112, 46, 112, -148, -148, -148, -148, -148, -148, -148, -148, 44, -148, -148, -148, -148, -148, 50, -148, -148, -148, -148, 155, -148, -148, -148, 112, 112, -148, -148, -148, -28, -28, -148, 21, 112, 112, -148, 59, -148, -148, 112, -28, -148, -148, -148, 112, -148, -30, 180, -148, -148, 112, 48, 49, 52, 53, -148, -148, -148, 65, 37, 180, -148, -148, -148, -148, -148, 37, -148, -148 }; /* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM. Performed when YYTABLE does not specify something else to do. Zero means the default is an error. */ static const yytype_int8 yydefact[] = { 3, 0, 0, 1, 0, 47, 45, 49, 40, 41, 52, 53, 54, 55, 0, 36, 0, 10, 0, 0, 0, 7, 14, 56, 0, 0, 0, 37, 18, 19, 0, 23, 0, 0, 0, 26, 27, 28, 0, 6, 30, 21, 42, 4, 5, 0, 33, 0, 29, 0, 0, 0, 38, 0, 113, 114, 11, 12, 13, 57, 9, 15, 16, 17, 20, 24, 25, 123, 119, 118, 34, 121, 89, 122, 0, 120, 0, 0, 91, 93, 111, 0, 43, 0, 0, 0, 51, 79, 82, 74, 85, 0, 48, 68, 71, 74, 46, 67, 0, 50, 86, 39, 116, 117, 115, 8, 90, 95, 94, 0, 92, 2, 112, 96, 32, 22, 44, 64, 65, 66, 35, 60, 63, 62, 80, 0, 83, 75, 84, 69, 0, 72, 76, 87, 0, 125, 0, 31, 61, 81, 70, 78, 73, 77, 88, 101, 97, 98, 101, 100, 0, 0, 0, 0, 0, 104, 59, 105, 0, 111, 99, 106, 107, 108, 109, 110, 111, 102, 103 }; /* YYPGOTO[NTERM-NUM]. */ static const yytype_int16 yypgoto[] = { -148, -148, -148, -148, -148, -148, 109, -148, -148, -148, -148, -148, -148, -148, -148, -148, -148, -7, -148, -148, 66, -73, -87, 60, -148, -148, -71, -83, -148, -50, -148, 51, -148, -148, -148, -19, -147, -148, -148, -47, -148, -48, -38, -148 }; /* YYDEFGOTO[NTERM-NUM]. */ static const yytype_uint8 yydefgoto[] = { 0, 1, 2, 43, 81, 115, 76, 45, 83, 46, 50, 49, 51, 47, 60, 158, 120, 121, 122, 96, 92, 93, 94, 128, 142, 86, 87, 88, 99, 70, 77, 78, 79, 136, 146, 147, 113, 55, 105, 71, 80, 72, 73, 111 }; /* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If positive, shift that token. If negative, reduce the rule whose number is the opposite. If YYTABLE_NINF, syntax error. */ static const yytype_int16 yytable[] = { 89, 100, 95, 95, 126, 102, 131, 68, 52, 90, 67, 69, 167, 3, 124, 53, 68, 91, 129, 168, 69, 148, 106, 149, 67, 141, 48, 54, 56, 58, 59, 57, 61, 62, 63, 64, 123, 65, 89, 66, 89, 126, 131, 103, 95, 82, 95, 90, 133, 90, 104, 68, 106, 131, 139, 69, 126, 140, -124, 74, 84, 85, 107, 5, 6, 7, 8, 9, 10, 11, 12, 13, 123, 108, 101, 14, 15, 89, 89, 114, 112, 116, 95, 95, 144, 106, 90, 90, 27, 125, 135, 137, 89, 95, 143, 34, 106, 130, 127, 159, 134, 90, 161, 163, 145, 162, 166, 75, 109, 164, 165, 44, 159, 138, 4, 67, 97, 42, 5, 6, 7, 8, 9, 10, 11, 12, 13, 0, 110, 160, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 0, 132, 68, 0, 67, 0, 69, 0, 0, 38, 0, 39, 40, 67, 0, 74, 0, 41, 42, 5, 6, 7, 8, 9, 10, 11, 12, 13, 0, 67, 0, 14, 15, 0, 0, 0, 0, 0, 0, 0, 150, 151, 152, 0, 27, 68, 0, 153, 154, 69, 0, 34, 0, 0, 68, 117, 118, 119, 69, 0, 0, 0, 0, 75, 98, 0, 0, -58, 155, 0, 68, 0, 0, 42, 69, 0, 0, 0, 0, 0, 156, 0, 0, 0, 0, 0, 157 }; static const yytype_int16 yycheck[] = { 47, 51, 49, 50, 87, 3, 93, 44, 41, 47, 3, 48, 159, 0, 85, 48, 44, 54, 91, 166, 48, 51, 70, 53, 3, 4, 53, 48, 57, 3, 3, 57, 41, 3, 3, 3, 84, 3, 85, 3, 87, 124, 129, 41, 91, 48, 93, 85, 98, 87, 48, 44, 100, 140, 125, 48, 139, 130, 0, 1, 41, 54, 53, 5, 6, 7, 8, 9, 10, 11, 12, 13, 120, 53, 41, 17, 18, 124, 125, 41, 43, 41, 129, 130, 134, 133, 124, 125, 30, 54, 46, 41, 139, 140, 132, 37, 144, 54, 57, 147, 54, 139, 150, 54, 45, 57, 41, 49, 50, 57, 57, 2, 160, 120, 1, 3, 50, 59, 5, 6, 7, 8, 9, 10, 11, 12, 13, -1, 77, 148, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, -1, 95, 44, -1, 3, -1, 48, -1, -1, 50, -1, 52, 53, 3, -1, 1, -1, 58, 59, 5, 6, 7, 8, 9, 10, 11, 12, 13, -1, 3, -1, 17, 18, -1, -1, -1, -1, -1, -1, -1, 14, 15, 16, -1, 30, 44, -1, 21, 22, 48, -1, 37, -1, -1, 44, 54, 55, 56, 48, -1, -1, -1, -1, 49, 54, -1, -1, 41, 42, -1, 44, -1, -1, 59, 48, -1, -1, -1, -1, -1, 54, -1, -1, -1, -1, -1, 60 }; /* YYSTOS[STATE-NUM] -- The symbol kind of the accessing symbol of state STATE-NUM. */ static const yytype_int8 yystos[] = { 0, 62, 63, 0, 1, 5, 6, 7, 8, 9, 10, 11, 12, 13, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 50, 52, 53, 58, 59, 64, 67, 68, 70, 74, 53, 72, 71, 73, 41, 48, 48, 98, 57, 57, 3, 3, 75, 41, 3, 3, 3, 3, 3, 3, 44, 48, 90, 100, 102, 103, 1, 49, 67, 91, 92, 93, 101, 65, 48, 69, 41, 54, 86, 87, 88, 100, 103, 54, 81, 82, 83, 100, 80, 81, 54, 89, 90, 41, 3, 41, 48, 99, 102, 53, 53, 50, 92, 104, 43, 97, 41, 66, 41, 54, 55, 56, 77, 78, 79, 102, 87, 54, 88, 57, 84, 82, 54, 83, 84, 90, 54, 46, 94, 41, 78, 87, 82, 4, 85, 103, 90, 45, 95, 96, 51, 53, 14, 15, 16, 21, 22, 42, 54, 60, 76, 102, 96, 102, 57, 54, 57, 57, 41, 97, 97 }; /* YYR1[RULE-NUM] -- Symbol kind of the left-hand side of rule RULE-NUM. */ static const yytype_int8 yyr1[] = { 0, 61, 62, 63, 63, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 66, 66, 67, 67, 67, 67, 67, 67, 67, 68, 68, 69, 69, 67, 71, 70, 72, 70, 73, 70, 70, 74, 74, 74, 74, 75, 75, 76, 76, 77, 77, 78, 78, 79, 79, 79, 80, 81, 81, 81, 82, 82, 83, 84, 84, 85, 85, 85, 86, 86, 86, 87, 87, 88, 88, 89, 89, 89, 90, 90, 91, 91, 92, 92, 92, 94, 93, 95, 95, 95, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 97, 97, 98, 99, 99, 99, 99, 100, 100, 101, 102, 102, 103, 104, 104 }; /* YYR2[RULE-NUM] -- Number of symbols on the right-hand side of rule RULE-NUM. */ static const yytype_int8 yyr2[] = { 0, 2, 4, 0, 2, 1, 1, 1, 3, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 1, 2, 0, 3, 1, 2, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 0, 1, 3, 0, 3, 0, 3, 0, 3, 2, 1, 1, 1, 1, 0, 1, 0, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 2, 3, 0, 1, 0, 1, 1, 1, 2, 3, 1, 2, 2, 1, 1, 2, 3, 1, 2, 1, 2, 1, 2, 2, 0, 5, 1, 3, 2, 0, 3, 4, 2, 2, 3, 3, 3, 3, 3, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2 }; enum { YYENOMEM = -2 }; #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = GRAM_EMPTY) #define YYACCEPT goto yyacceptlab #define YYABORT goto yyabortlab #define YYERROR goto yyerrorlab #define YYNOMEM goto yyexhaustedlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(Token, Value) \ do \ if (yychar == GRAM_EMPTY) \ { \ yychar = (Token); \ yylval = (Value); \ YYPOPSTACK (yylen); \ yystate = *yyssp; \ YY_LAC_DISCARD ("YYBACKUP"); \ goto yybackup; \ } \ else \ { \ yyerror (&yylloc, YY_("syntax error: cannot back up")); \ YYERROR; \ } \ while (0) /* Backward compatibility with an undocumented macro. Use GRAM_error or GRAM_UNDEF. */ #define YYERRCODE GRAM_UNDEF /* 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). */ #ifndef YYLLOC_DEFAULT # define YYLLOC_DEFAULT(Current, Rhs, N) \ do \ if (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 (0) #endif #define YYRHSLOC(Rhs, K) ((Rhs)[K]) /* Enable debugging if requested. */ #if GRAM_DEBUG # ifndef YYFPRINTF # include <stdio.h> /* INFRINGES ON USER NAME SPACE */ # define YYFPRINTF fprintf # endif # define YYDPRINTF(Args) \ do { \ if (yydebug) \ YYFPRINTF Args; \ } while (0) /* YYLOCATION_PRINT -- Print the location on the stream. This macro was not mandated originally: define only if we know we won't break user code: when these are the locations we know. */ # ifndef YYLOCATION_PRINT # if defined YY_LOCATION_PRINT /* Temporary convenience wrapper in case some people defined the undocumented and private YY_LOCATION_PRINT macros. */ # define YYLOCATION_PRINT(File, Loc) YY_LOCATION_PRINT(File, *(Loc)) # elif defined GRAM_LTYPE_IS_TRIVIAL && GRAM_LTYPE_IS_TRIVIAL /* Print *YYLOCP on YYO. Private, do not rely on its existence. */ YY_ATTRIBUTE_UNUSED static int yy_location_print_ (FILE *yyo, YYLTYPE const * const yylocp) { int res = 0; int end_col = 0 != yylocp->last_column ? yylocp->last_column - 1 : 0; if (0 <= yylocp->first_line) { res += YYFPRINTF (yyo, "%d", yylocp->first_line); if (0 <= yylocp->first_column) res += YYFPRINTF (yyo, ".%d", yylocp->first_column); } if (0 <= yylocp->last_line) { if (yylocp->first_line < yylocp->last_line) { res += YYFPRINTF (yyo, "-%d", yylocp->last_line); if (0 <= end_col) res += YYFPRINTF (yyo, ".%d", end_col); } else if (0 <= end_col && yylocp->first_column < end_col) res += YYFPRINTF (yyo, "-%d", end_col); } return res; } # define YYLOCATION_PRINT yy_location_print_ /* Temporary convenience wrapper in case some people defined the undocumented and private YY_LOCATION_PRINT macros. */ # define YY_LOCATION_PRINT(File, Loc) YYLOCATION_PRINT(File, &(Loc)) # else # define YYLOCATION_PRINT(File, Loc) ((void) 0) /* Temporary convenience wrapper in case some people defined the undocumented and private YY_LOCATION_PRINT macros. */ # define YY_LOCATION_PRINT YYLOCATION_PRINT # endif # endif /* !defined YYLOCATION_PRINT */ # define YY_SYMBOL_PRINT(Title, Kind, Value, Location) \ do { \ if (yydebug) \ { \ YYFPRINTF (stderr, "%s ", Title); \ yy_symbol_print (stderr, \ Kind, Value, Location); \ YYFPRINTF (stderr, "\n"); \ } \ } while (0) /*-----------------------------------. | Print this symbol's value on YYO. | `-----------------------------------*/ static void yy_symbol_value_print (FILE *yyo, yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp) { FILE *yyoutput = yyo; YY_USE (yyoutput); YY_USE (yylocationp); if (!yyvaluep) return; /* "%code pre-printer" blocks. */ tron (yyo); YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN switch (yykind) { case YYSYMBOL_STRING: /* "string" */ { fputs (((*yyvaluep).STRING), yyo); } break; case YYSYMBOL_TSTRING: /* "translatable string" */ { fputs (((*yyvaluep).TSTRING), yyo); } break; case YYSYMBOL_PERCENT_ERROR_VERBOSE: /* "%error-verbose" */ { fputs (((*yyvaluep).PERCENT_ERROR_VERBOSE), yyo); } break; case YYSYMBOL_PERCENT_FILE_PREFIX: /* "%file-prefix" */ { fputs (((*yyvaluep).PERCENT_FILE_PREFIX), yyo); } break; case YYSYMBOL_PERCENT_FLAG: /* "%<flag>" */ { fprintf (yyo, "%%%s", ((*yyvaluep).PERCENT_FLAG)); } break; case YYSYMBOL_PERCENT_NAME_PREFIX: /* "%name-prefix" */ { fputs (((*yyvaluep).PERCENT_NAME_PREFIX), yyo); } break; case YYSYMBOL_PERCENT_PURE_PARSER: /* "%pure-parser" */ { fputs (((*yyvaluep).PERCENT_PURE_PARSER), yyo); } break; case YYSYMBOL_BRACED_CODE: /* "{...}" */ { fputs (((*yyvaluep).BRACED_CODE), yyo); } break; case YYSYMBOL_BRACED_PREDICATE: /* "%?{...}" */ { fputs (((*yyvaluep).BRACED_PREDICATE), yyo); } break; case YYSYMBOL_BRACKETED_ID: /* "[identifier]" */ { fprintf (yyo, "[%s]", ((*yyvaluep).BRACKETED_ID)); } break; case YYSYMBOL_CHAR_LITERAL: /* "character literal" */ { fputs (char_name (((*yyvaluep).CHAR_LITERAL)), yyo); } break; case YYSYMBOL_EPILOGUE: /* "epilogue" */ { fputs (((*yyvaluep).EPILOGUE), yyo); } break; case YYSYMBOL_ID: /* "identifier" */ { fputs (((*yyvaluep).ID), yyo); } break; case YYSYMBOL_ID_COLON: /* "identifier:" */ { fprintf (yyo, "%s:", ((*yyvaluep).ID_COLON)); } break; case YYSYMBOL_PROLOGUE: /* "%{...%}" */ { fputs (((*yyvaluep).PROLOGUE), yyo); } break; case YYSYMBOL_TAG: /* "<tag>" */ { fprintf (yyo, "<%s>", ((*yyvaluep).TAG)); } break; case YYSYMBOL_INT_LITERAL: /* "integer literal" */ { fprintf (yyo, "%d", ((*yyvaluep).INT_LITERAL)); } break; case YYSYMBOL_PERCENT_PARAM: /* "%param" */ { switch (((*yyvaluep).PERCENT_PARAM)) { #define CASE(In, Out) \ case param_ ## In: fputs ("%" #Out, yyo); break CASE (lex, lex-param); CASE (parse, parse-param); CASE (both, param); #undef CASE case param_none: aver (false); break; } } break; case YYSYMBOL_code_props_type: /* code_props_type */ { fprintf (yyo, "%s", code_props_type_string (((*yyvaluep).code_props_type))); } break; case YYSYMBOL_75_string_opt: /* string.opt */ { fputs (((*yyvaluep).yykind_75), yyo); } break; case YYSYMBOL_76_tag_opt: /* tag.opt */ { fputs (((*yyvaluep).yykind_76), yyo); } break; case YYSYMBOL_generic_symlist: /* generic_symlist */ { symbol_list_syms_print (((*yyvaluep).generic_symlist), yyo); } break; case YYSYMBOL_generic_symlist_item: /* generic_symlist_item */ { symbol_list_syms_print (((*yyvaluep).generic_symlist_item), yyo); } break; case YYSYMBOL_tag: /* tag */ { fprintf (yyo, "<%s>", ((*yyvaluep).tag)); } break; case YYSYMBOL_nterm_decls: /* nterm_decls */ { symbol_list_syms_print (((*yyvaluep).nterm_decls), yyo); } break; case YYSYMBOL_token_decls: /* token_decls */ { symbol_list_syms_print (((*yyvaluep).token_decls), yyo); } break; case YYSYMBOL_82_token_decl_1: /* token_decl.1 */ { symbol_list_syms_print (((*yyvaluep).yykind_82), yyo); } break; case YYSYMBOL_token_decl: /* token_decl */ { fprintf (yyo, "%s", ((*yyvaluep).token_decl) ? ((*yyvaluep).token_decl)->tag : "<NULL>"); } break; case YYSYMBOL_84_int_opt: /* int.opt */ { fprintf (yyo, "%d", ((*yyvaluep).yykind_84)); } break; case YYSYMBOL_alias: /* alias */ { fprintf (yyo, "%s", ((*yyvaluep).alias) ? ((*yyvaluep).alias)->tag : "<NULL>"); } break; case YYSYMBOL_token_decls_for_prec: /* token_decls_for_prec */ { symbol_list_syms_print (((*yyvaluep).token_decls_for_prec), yyo); } break; case YYSYMBOL_87_token_decl_for_prec_1: /* token_decl_for_prec.1 */ { symbol_list_syms_print (((*yyvaluep).yykind_87), yyo); } break; case YYSYMBOL_token_decl_for_prec: /* token_decl_for_prec */ { fprintf (yyo, "%s", ((*yyvaluep).token_decl_for_prec) ? ((*yyvaluep).token_decl_for_prec)->tag : "<NULL>"); } break; case YYSYMBOL_symbol_decls: /* symbol_decls */ { symbol_list_syms_print (((*yyvaluep).symbol_decls), yyo); } break; case YYSYMBOL_90_symbols_1: /* symbols.1 */ { symbol_list_syms_print (((*yyvaluep).yykind_90), yyo); } break; case YYSYMBOL_variable: /* variable */ { fputs (((*yyvaluep).variable), yyo); } break; case YYSYMBOL_value: /* value */ { switch (((*yyvaluep).value).kind) { case muscle_code: fprintf (yyo, "{%s}", ((*yyvaluep).value).chars); break; case muscle_keyword: fprintf (yyo, "%s", ((*yyvaluep).value).chars); break; case muscle_string: fprintf (yyo, "\"%s\"", ((*yyvaluep).value).chars); break; } } break; case YYSYMBOL_id: /* id */ { fprintf (yyo, "%s", ((*yyvaluep).id) ? ((*yyvaluep).id)->tag : "<NULL>"); } break; case YYSYMBOL_id_colon: /* id_colon */ { fprintf (yyo, "%s:", ((*yyvaluep).id_colon)->tag); } break; case YYSYMBOL_symbol: /* symbol */ { fprintf (yyo, "%s", ((*yyvaluep).symbol) ? ((*yyvaluep).symbol)->tag : "<NULL>"); } break; case YYSYMBOL_string_as_id: /* string_as_id */ { fprintf (yyo, "%s", ((*yyvaluep).string_as_id) ? ((*yyvaluep).string_as_id)->tag : "<NULL>"); } break; default: break; } YY_IGNORE_MAYBE_UNINITIALIZED_END /* "%code post-printer" blocks. */ troff (yyo); } /*---------------------------. | Print this symbol on YYO. | `---------------------------*/ static void yy_symbol_print (FILE *yyo, yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp) { YYFPRINTF (yyo, "%s %s (", yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name (yykind)); YYLOCATION_PRINT (yyo, yylocationp); YYFPRINTF (yyo, ": "); yy_symbol_value_print (yyo, yykind, yyvaluep, yylocationp); YYFPRINTF (yyo, ")"); } /*------------------------------------------------------------------. | yy_stack_print -- Print the state stack from its BOTTOM up to its | | TOP (included). | `------------------------------------------------------------------*/ static void yy_stack_print (yy_state_t *yybottom, yy_state_t *yytop) { 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 (0) /*------------------------------------------------. | Report that the YYRULE is going to be reduced. | `------------------------------------------------*/ static void yy_reduce_print (yy_state_t *yyssp, YYSTYPE *yyvsp, YYLTYPE *yylsp, int yyrule) { int yylno = yyrline[yyrule]; int yynrhs = yyr2[yyrule]; int yyi; YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n", yyrule - 1, yylno); /* The symbols being reduced. */ for (yyi = 0; yyi < yynrhs; yyi++) { YYFPRINTF (stderr, " $%d = ", yyi + 1); yy_symbol_print (stderr, YY_ACCESSING_SYMBOL (+yyssp[yyi + 1 - yynrhs]), &yyvsp[(yyi + 1) - (yynrhs)], &(yylsp[(yyi + 1) - (yynrhs)])); YYFPRINTF (stderr, "\n"); } } # define YY_REDUCE_PRINT(Rule) \ do { \ if (yydebug) \ yy_reduce_print (yyssp, yyvsp, yylsp, Rule); \ } while (0) /* Nonzero means print parse trace. It is left uninitialized so that multiple parsers can coexist. */ int yydebug; #else /* !GRAM_DEBUG */ # define YYDPRINTF(Args) ((void) 0) # define YY_SYMBOL_PRINT(Title, Kind, Value, Location) # define YY_STACK_PRINT(Bottom, Top) # define YY_REDUCE_PRINT(Rule) #endif /* !GRAM_DEBUG */ /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 #endif /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only if the built-in stack extension method is used). Do not make this value too large; the results are undefined if YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) evaluated with infinite-precision integer arithmetic. */ #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif /* Given a state stack such that *YYBOTTOM is its bottom, such that *YYTOP is either its top or is YYTOP_EMPTY to indicate an empty stack, and such that *YYCAPACITY is the maximum number of elements it can hold without a reallocation, make sure there is enough room to store YYADD more elements. If not, allocate a new stack using YYSTACK_ALLOC, copy the existing elements, and adjust *YYBOTTOM, *YYTOP, and *YYCAPACITY to reflect the new capacity and memory location. If *YYBOTTOM != YYBOTTOM_NO_FREE, then free the old stack using YYSTACK_FREE. Return 0 if successful or if no reallocation is required. Return YYENOMEM if memory is exhausted. */ static int yy_lac_stack_realloc (YYPTRDIFF_T *yycapacity, YYPTRDIFF_T yyadd, #if GRAM_DEBUG char const *yydebug_prefix, char const *yydebug_suffix, #endif yy_state_t **yybottom, yy_state_t *yybottom_no_free, yy_state_t **yytop, yy_state_t *yytop_empty) { YYPTRDIFF_T yysize_old = *yytop == yytop_empty ? 0 : *yytop - *yybottom + 1; YYPTRDIFF_T yysize_new = yysize_old + yyadd; if (*yycapacity < yysize_new) { YYPTRDIFF_T yyalloc = 2 * yysize_new; yy_state_t *yybottom_new; /* Use YYMAXDEPTH for maximum stack size given that the stack should never need to grow larger than the main state stack needs to grow without LAC. */ if (YYMAXDEPTH < yysize_new) { YYDPRINTF ((stderr, "%smax size exceeded%s", yydebug_prefix, yydebug_suffix)); return YYENOMEM; } if (YYMAXDEPTH < yyalloc) yyalloc = YYMAXDEPTH; yybottom_new = YY_CAST (yy_state_t *, YYSTACK_ALLOC (YY_CAST (YYSIZE_T, yyalloc * YYSIZEOF (*yybottom_new)))); if (!yybottom_new) { YYDPRINTF ((stderr, "%srealloc failed%s", yydebug_prefix, yydebug_suffix)); return YYENOMEM; } if (*yytop != yytop_empty) { YYCOPY (yybottom_new, *yybottom, yysize_old); *yytop = yybottom_new + (yysize_old - 1); } if (*yybottom != yybottom_no_free) YYSTACK_FREE (*yybottom); *yybottom = yybottom_new; *yycapacity = yyalloc; } return 0; } /* Establish the initial context for the current lookahead if no initial context is currently established. We define a context as a snapshot of the parser stacks. We define the initial context for a lookahead as the context in which the parser initially examines that lookahead in order to select a syntactic action. Thus, if the lookahead eventually proves syntactically unacceptable (possibly in a later context reached via a series of reductions), the initial context can be used to determine the exact set of tokens that would be syntactically acceptable in the lookahead's place. Moreover, it is the context after which any further semantic actions would be erroneous because they would be determined by a syntactically unacceptable token. YY_LAC_ESTABLISH should be invoked when a reduction is about to be performed in an inconsistent state (which, for the purposes of LAC, includes consistent states that don't know they're consistent because their default reductions have been disabled). Iff there is a lookahead token, it should also be invoked before reporting a syntax error. This latter case is for the sake of the debugging output. For parse.lac=full, the implementation of YY_LAC_ESTABLISH is as follows. If no initial context is currently established for the current lookahead, then check if that lookahead can eventually be shifted if syntactic actions continue from the current context. Report a syntax error if it cannot. */ #define YY_LAC_ESTABLISH \ do { \ if (!yy_lac_established) \ { \ YYDPRINTF ((stderr, \ "LAC: initial context established for %s\n", \ yysymbol_name (yytoken))); \ yy_lac_established = 1; \ switch (yy_lac (yyesa, &yyes, &yyes_capacity, yyssp, yytoken)) \ { \ case YYENOMEM: \ YYNOMEM; \ case 1: \ goto yyerrlab; \ } \ } \ } while (0) /* Discard any previous initial lookahead context because of Event, which may be a lookahead change or an invalidation of the currently established initial context for the current lookahead. The most common example of a lookahead change is a shift. An example of both cases is syntax error recovery. That is, a syntax error occurs when the lookahead is syntactically erroneous for the currently established initial context, so error recovery manipulates the parser stacks to try to find a new initial context in which the current lookahead is syntactically acceptable. If it fails to find such a context, it discards the lookahead. */ #if GRAM_DEBUG # define YY_LAC_DISCARD(Event) \ do { \ if (yy_lac_established) \ { \ YYDPRINTF ((stderr, "LAC: initial context discarded due to " \ Event "\n")); \ yy_lac_established = 0; \ } \ } while (0) #else # define YY_LAC_DISCARD(Event) yy_lac_established = 0 #endif /* Given the stack whose top is *YYSSP, return 0 iff YYTOKEN can eventually (after perhaps some reductions) be shifted, return 1 if not, or return YYENOMEM if memory is exhausted. As preconditions and postconditions: *YYES_CAPACITY is the allocated size of the array to which *YYES points, and either *YYES = YYESA or *YYES points to an array allocated with YYSTACK_ALLOC. yy_lac may overwrite the contents of either array, alter *YYES and *YYES_CAPACITY, and free any old *YYES other than YYESA. */ static int yy_lac (yy_state_t *yyesa, yy_state_t **yyes, YYPTRDIFF_T *yyes_capacity, yy_state_t *yyssp, yysymbol_kind_t yytoken) { yy_state_t *yyes_prev = yyssp; yy_state_t *yyesp = yyes_prev; /* Reduce until we encounter a shift and thereby accept the token. */ YYDPRINTF ((stderr, "LAC: checking lookahead %s:", yysymbol_name (yytoken))); if (yytoken == YYSYMBOL_YYUNDEF) { YYDPRINTF ((stderr, " Always Err\n")); return 1; } while (1) { int yyrule = yypact[+*yyesp]; if (yypact_value_is_default (yyrule) || (yyrule += yytoken) < 0 || YYLAST < yyrule || yycheck[yyrule] != yytoken) { /* Use the default action. */ yyrule = yydefact[+*yyesp]; if (yyrule == 0) { YYDPRINTF ((stderr, " Err\n")); return 1; } } else { /* Use the action from yytable. */ yyrule = yytable[yyrule]; if (yytable_value_is_error (yyrule)) { YYDPRINTF ((stderr, " Err\n")); return 1; } if (0 < yyrule) { YYDPRINTF ((stderr, " S%d\n", yyrule)); return 0; } yyrule = -yyrule; } /* By now we know we have to simulate a reduce. */ YYDPRINTF ((stderr, " R%d", yyrule - 1)); { /* Pop the corresponding number of values from the stack. */ YYPTRDIFF_T yylen = yyr2[yyrule]; /* First pop from the LAC stack as many tokens as possible. */ if (yyesp != yyes_prev) { YYPTRDIFF_T yysize = yyesp - *yyes + 1; if (yylen < yysize) { yyesp -= yylen; yylen = 0; } else { yyesp = yyes_prev; yylen -= yysize; } } /* Only afterwards look at the main stack. */ if (yylen) yyesp = yyes_prev -= yylen; } /* Push the resulting state of the reduction. */ { yy_state_fast_t yystate; { const int yylhs = yyr1[yyrule] - YYNTOKENS; const int yyi = yypgoto[yylhs] + *yyesp; yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyesp ? yytable[yyi] : yydefgoto[yylhs]); } if (yyesp == yyes_prev) { yyesp = *yyes; YY_IGNORE_USELESS_CAST_BEGIN *yyesp = YY_CAST (yy_state_t, yystate); YY_IGNORE_USELESS_CAST_END } else { if (yy_lac_stack_realloc (yyes_capacity, 1, #if GRAM_DEBUG " (", ")", #endif yyes, yyesa, &yyesp, yyes_prev)) { YYDPRINTF ((stderr, "\n")); return YYENOMEM; } YY_IGNORE_USELESS_CAST_BEGIN *++yyesp = YY_CAST (yy_state_t, yystate); YY_IGNORE_USELESS_CAST_END } YYDPRINTF ((stderr, " G%d", yystate)); } } } /* Context of a parse error. */ typedef struct { yy_state_t *yyssp; yy_state_t *yyesa; yy_state_t **yyes; YYPTRDIFF_T *yyes_capacity; yysymbol_kind_t yytoken; YYLTYPE *yylloc; } yypcontext_t; /* Put in YYARG at most YYARGN of the expected tokens given the current YYCTX, and return the number of tokens stored in YYARG. If YYARG is null, return the number of expected tokens (guaranteed to be less than YYNTOKENS). Return YYENOMEM on memory exhaustion. Return 0 if there are more than YYARGN expected tokens, yet fill YYARG up to YYARGN. */ static int yypcontext_expected_tokens (const yypcontext_t *yyctx, yysymbol_kind_t yyarg[], int yyargn) { /* Actual size of YYARG. */ int yycount = 0; int yyx; for (yyx = 0; yyx < YYNTOKENS; ++yyx) { yysymbol_kind_t yysym = YY_CAST (yysymbol_kind_t, yyx); if (yysym != YYSYMBOL_YYerror && yysym != YYSYMBOL_YYUNDEF) switch (yy_lac (yyctx->yyesa, yyctx->yyes, yyctx->yyes_capacity, yyctx->yyssp, yysym)) { case YYENOMEM: return YYENOMEM; case 1: continue; default: if (!yyarg) ++yycount; else if (yycount == yyargn) return 0; else yyarg[yycount++] = yysym; } } if (yyarg && yycount == 0 && 0 < yyargn) yyarg[0] = YYSYMBOL_YYEMPTY; return yycount; } /* The kind of the lookahead of this context. */ static yysymbol_kind_t yypcontext_token (const yypcontext_t *yyctx) YY_ATTRIBUTE_UNUSED; static yysymbol_kind_t yypcontext_token (const yypcontext_t *yyctx) { return yyctx->yytoken; } /* The location of the lookahead of this context. */ static YYLTYPE * yypcontext_location (const yypcontext_t *yyctx) YY_ATTRIBUTE_UNUSED; static YYLTYPE * yypcontext_location (const yypcontext_t *yyctx) { return yyctx->yylloc; } /* User defined function to report a syntax error. */ static int yyreport_syntax_error (const yypcontext_t *yyctx); /*-----------------------------------------------. | Release the memory associated to this symbol. | `-----------------------------------------------*/ static void yydestruct (const char *yymsg, yysymbol_kind_t yykind, YYSTYPE *yyvaluep, YYLTYPE *yylocationp) { YY_USE (yyvaluep); YY_USE (yylocationp); if (!yymsg) yymsg = "Deleting"; YY_SYMBOL_PRINT (yymsg, yykind, yyvaluep, yylocationp); YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN switch (yykind) { case YYSYMBOL_generic_symlist: /* generic_symlist */ { symbol_list_free (((*yyvaluep).generic_symlist)); } break; case YYSYMBOL_generic_symlist_item: /* generic_symlist_item */ { symbol_list_free (((*yyvaluep).generic_symlist_item)); } break; case YYSYMBOL_nterm_decls: /* nterm_decls */ { symbol_list_free (((*yyvaluep).nterm_decls)); } break; case YYSYMBOL_token_decls: /* token_decls */ { symbol_list_free (((*yyvaluep).token_decls)); } break; case YYSYMBOL_82_token_decl_1: /* token_decl.1 */ { symbol_list_free (((*yyvaluep).yykind_82)); } break; case YYSYMBOL_token_decls_for_prec: /* token_decls_for_prec */ { symbol_list_free (((*yyvaluep).token_decls_for_prec)); } break; case YYSYMBOL_87_token_decl_for_prec_1: /* token_decl_for_prec.1 */ { symbol_list_free (((*yyvaluep).yykind_87)); } break; case YYSYMBOL_symbol_decls: /* symbol_decls */ { symbol_list_free (((*yyvaluep).symbol_decls)); } break; case YYSYMBOL_90_symbols_1: /* symbols.1 */ { symbol_list_free (((*yyvaluep).yykind_90)); } break; default: break; } YY_IGNORE_MAYBE_UNINITIALIZED_END } /*----------. | yyparse. | `----------*/ int yyparse (void) { /* Lookahead token kind. */ int yychar; /* The semantic value of the lookahead symbol. */ /* Default value used for initialization, for pacifying older GCCs or non-GCC compilers. */ YY_INITIAL_VALUE (static YYSTYPE yyval_default;) YYSTYPE yylval YY_INITIAL_VALUE (= yyval_default); /* Location data for the lookahead symbol. */ static YYLTYPE yyloc_default # if defined GRAM_LTYPE_IS_TRIVIAL && GRAM_LTYPE_IS_TRIVIAL = { 1, 1, 1, 1 } # endif ; YYLTYPE yylloc = yyloc_default; /* Number of syntax errors so far. */ int yynerrs YY_ATTRIBUTE_UNUSED = 0; yy_state_fast_t yystate = 0; /* Number of tokens to shift before error messages enabled. */ int yyerrstatus = 0; /* Refer to the stacks through separate pointers, to allow yyoverflow to reallocate them elsewhere. */ /* Their size. */ YYPTRDIFF_T yystacksize = YYINITDEPTH; /* The state stack: array, bottom, top. */ yy_state_t yyssa[YYINITDEPTH]; yy_state_t *yyss = yyssa; yy_state_t *yyssp = yyss; /* The semantic value stack: array, bottom, top. */ YYSTYPE yyvsa[YYINITDEPTH]; YYSTYPE *yyvs = yyvsa; YYSTYPE *yyvsp = yyvs; /* The location stack: array, bottom, top. */ YYLTYPE yylsa[YYINITDEPTH]; YYLTYPE *yyls = yylsa; YYLTYPE *yylsp = yyls; yy_state_t yyesa[20]; yy_state_t *yyes = yyesa; YYPTRDIFF_T yyes_capacity = 20 < YYMAXDEPTH ? 20 : YYMAXDEPTH; /* Whether LAC context is established. A Boolean. */ int yy_lac_established = 0; int yyn; /* The return value of yyparse. */ int yyresult; /* Lookahead symbol kind. */ yysymbol_kind_t yytoken = YYSYMBOL_YYEMPTY; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; YYLTYPE yyloc; /* The locations where the error started and ended. */ YYLTYPE yyerror_range[3]; #define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N), yylsp -= (N)) /* The number of symbols on the RHS of the reduced rule. Keep to zero when no symbol should be popped. */ int yylen = 0; YYDPRINTF ((stderr, "Starting parse\n")); yychar = GRAM_EMPTY; /* Cause a token to be read. */ /* User initialization code. */ { /* Bison's grammar can initial empty locations, hence a default location is needed. */ boundary_set (&yylloc.start, grammar_file, 1, 1, 1); boundary_set (&yylloc.end, grammar_file, 1, 1, 1); } yylsp[0] = yylloc; goto yysetstate; /*------------------------------------------------------------. | yynewstate -- push a new state, which is found in yystate. | `------------------------------------------------------------*/ yynewstate: /* In all cases, when you get here, the value and location stacks have just been pushed. So pushing a state here evens the stacks. */ yyssp++; /*--------------------------------------------------------------------. | yysetstate -- set current state (the top of the stack) to yystate. | `--------------------------------------------------------------------*/ yysetstate: YYDPRINTF ((stderr, "Entering state %d\n", yystate)); YY_ASSERT (0 <= yystate && yystate < YYNSTATES); YY_IGNORE_USELESS_CAST_BEGIN *yyssp = YY_CAST (yy_state_t, yystate); YY_IGNORE_USELESS_CAST_END YY_STACK_PRINT (yyss, yyssp); if (yyss + yystacksize - 1 <= yyssp) #if !defined yyoverflow && !defined YYSTACK_RELOCATE YYNOMEM; #else { /* Get the current used size of the three stacks, in elements. */ YYPTRDIFF_T yysize = yyssp - yyss + 1; # if defined yyoverflow { /* Give user a chance to reallocate the stack. Use copies of these so that the &'s don't force the real ones into memory. */ yy_state_t *yyss1 = yyss; YYSTYPE *yyvs1 = yyvs; YYLTYPE *yyls1 = yyls; /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. This used to be a conditional around just the two extra args, but that might be undefined if yyoverflow is a macro. */ yyoverflow (YY_("memory exhausted"), &yyss1, yysize * YYSIZEOF (*yyssp), &yyvs1, yysize * YYSIZEOF (*yyvsp), &yyls1, yysize * YYSIZEOF (*yylsp), &yystacksize); yyss = yyss1; yyvs = yyvs1; yyls = yyls1; } # else /* defined YYSTACK_RELOCATE */ /* Extend the stack our own way. */ if (YYMAXDEPTH <= yystacksize) YYNOMEM; yystacksize *= 2; if (YYMAXDEPTH < yystacksize) yystacksize = YYMAXDEPTH; { yy_state_t *yyss1 = yyss; union yyalloc *yyptr = YY_CAST (union yyalloc *, YYSTACK_ALLOC (YY_CAST (YYSIZE_T, YYSTACK_BYTES (yystacksize)))); if (! yyptr) YYNOMEM; YYSTACK_RELOCATE (yyss_alloc, yyss); YYSTACK_RELOCATE (yyvs_alloc, yyvs); YYSTACK_RELOCATE (yyls_alloc, yyls); # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } # endif yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; yylsp = yyls + yysize - 1; YY_IGNORE_USELESS_CAST_BEGIN YYDPRINTF ((stderr, "Stack size increased to %ld\n", YY_CAST (long, yystacksize))); YY_IGNORE_USELESS_CAST_END if (yyss + yystacksize - 1 <= yyssp) YYABORT; } #endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */ if (yystate == YYFINAL) YYACCEPT; goto yybackup; /*-----------. | yybackup. | `-----------*/ yybackup: /* 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]; if (yypact_value_is_default (yyn)) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ /* YYCHAR is either empty, or end-of-input, or a valid lookahead. */ if (yychar == GRAM_EMPTY) { YYDPRINTF ((stderr, "Reading a token\n")); yychar = yylex (&yylval, &yylloc); } if (yychar <= GRAM_EOF) { yychar = GRAM_EOF; yytoken = YYSYMBOL_YYEOF; YYDPRINTF ((stderr, "Now at end of input.\n")); } else if (yychar == GRAM_error) { /* The scanner already issued an error message, process directly to error recovery. But do not keep the error token as lookahead, it is too special and may lead us to an endless loop in error recovery. */ yychar = GRAM_UNDEF; yytoken = YYSYMBOL_YYerror; yyerror_range[1] = yylloc; goto yyerrlab1; } else { yytoken = YYTRANSLATE (yychar); YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); } /* If the proper action on seeing token YYTOKEN is to reduce or to detect an error, take that action. */ yyn += yytoken; if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) { YY_LAC_ESTABLISH; goto yydefault; } yyn = yytable[yyn]; if (yyn <= 0) { if (yytable_value_is_error (yyn)) goto yyerrlab; yyn = -yyn; YY_LAC_ESTABLISH; goto yyreduce; } /* Count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus) yyerrstatus--; /* Shift the lookahead token. */ YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); yystate = yyn; YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN *++yyvsp = yylval; YY_IGNORE_MAYBE_UNINITIALIZED_END *++yylsp = yylloc; /* Discard the shifted token. */ yychar = GRAM_EMPTY; YY_LAC_DISCARD ("shift"); goto yynewstate; /*-----------------------------------------------------------. | yydefault -- do the default action for the current state. | `-----------------------------------------------------------*/ yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; goto yyreduce; /*-----------------------------. | yyreduce -- do a reduction. | `-----------------------------*/ yyreduce: /* yyn is the number of a rule to reduce with. */ yylen = yyr2[yyn]; /* If YYLEN is nonzero, implement the default value of the action: '$$ = $1'. Otherwise, the following line sets YYVAL to garbage. This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; /* Default location. */ YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen); yyerror_range[1] = yyloc; YY_REDUCE_PRINT (yyn); { int yychar_backup = yychar; switch (yyn) { case 6: /* prologue_declaration: "%{...%}" */ { muscle_code_grow (union_seen ? "post_prologue" : "pre_prologue", translate_code ((yyvsp[0].PROLOGUE), (yylsp[0]), true), (yylsp[0])); code_scanner_last_string_free (); } break; case 7: /* prologue_declaration: "%<flag>" */ { muscle_percent_define_ensure ((yyvsp[0].PERCENT_FLAG), (yylsp[0]), true); } break; case 8: /* prologue_declaration: "%define" variable value */ { muscle_percent_define_insert ((yyvsp[-1].variable), (yyloc), (yyvsp[0].value).kind, (yyvsp[0].value).chars, MUSCLE_PERCENT_DEFINE_GRAMMAR_FILE); } break; case 9: /* prologue_declaration: "%header" string.opt */ { handle_header (&(yylsp[0]), (yyvsp[0].yykind_75)); } break; case 10: /* prologue_declaration: "%error-verbose" */ { handle_error_verbose (&(yyloc), (yyvsp[0].PERCENT_ERROR_VERBOSE)); } break; case 11: /* prologue_declaration: "%expect" "integer literal" */ { expected_sr_conflicts = (yyvsp[0].INT_LITERAL); } break; case 12: /* prologue_declaration: "%expect-rr" "integer literal" */ { expected_rr_conflicts = (yyvsp[0].INT_LITERAL); } break; case 13: /* prologue_declaration: "%file-prefix" "string" */ { handle_file_prefix (&(yyloc), &(yylsp[-1]), (yyvsp[-1].PERCENT_FILE_PREFIX), (yyvsp[0].STRING)); } break; case 14: /* prologue_declaration: "%glr-parser" */ { nondeterministic_parser = true; glr_parser = true; } break; case 15: /* prologue_declaration: "%initial-action" "{...}" */ { muscle_code_grow ("initial_action", translate_code ((yyvsp[0].BRACED_CODE), (yylsp[0]), false), (yylsp[0])); code_scanner_last_string_free (); } break; case 16: /* prologue_declaration: "%language" "string" */ { handle_language (&(yylsp[-1]), (yyvsp[0].STRING)); } break; case 17: /* prologue_declaration: "%name-prefix" "string" */ { handle_name_prefix (&(yyloc), (yyvsp[-1].PERCENT_NAME_PREFIX), (yyvsp[0].STRING)); } break; case 18: /* prologue_declaration: "%no-lines" */ { no_lines_flag = true; } break; case 19: /* prologue_declaration: "%nondeterministic-parser" */ { nondeterministic_parser = true; } break; case 20: /* prologue_declaration: "%output" "string" */ { char *file = unquote ((yyvsp[0].STRING)); if (valid_output_file_name (file)) spec_outfile = file; else complain (&(yylsp[0]), complaint, _("invalid %%output file name ignored")); gram_scanner_last_string_free (); } break; case 21: /* $@1: %empty */ { current_param = (yyvsp[0].PERCENT_PARAM); } break; case 22: /* prologue_declaration: "%param" $@1 params */ { current_param = param_none; } break; case 23: /* prologue_declaration: "%pure-parser" */ { handle_pure_parser (&(yyloc), (yyvsp[0].PERCENT_PURE_PARSER)); } break; case 24: /* prologue_declaration: "%require" "string" */ { handle_require (&(yylsp[0]), (yyvsp[0].STRING)); } break; case 25: /* prologue_declaration: "%skeleton" "string" */ { handle_skeleton (&(yylsp[0]), (yyvsp[0].STRING)); } break; case 26: /* prologue_declaration: "%token-table" */ { token_table_flag = true; } break; case 27: /* prologue_declaration: "%verbose" */ { report_flag |= report_states; } break; case 28: /* prologue_declaration: "%yacc" */ { handle_yacc (&(yyloc)); } break; case 29: /* prologue_declaration: error ";" */ { current_class = unknown_sym; yyerrok; } break; case 31: /* params: params "{...}" */ { add_param (current_param, (yyvsp[0].BRACED_CODE), (yylsp[0])); } break; case 32: /* params: "{...}" */ { add_param (current_param, (yyvsp[0].BRACED_CODE), (yylsp[0])); } break; case 34: /* grammar_declaration: "%start" symbols.1 */ { grammar_start_symbols_add ((yyvsp[0].yykind_90)); } break; case 35: /* grammar_declaration: code_props_type "{...}" generic_symlist */ { code_props code; code_props_symbol_action_init (&code, (yyvsp[-1].BRACED_CODE), (yylsp[-1])); code_props_translate_code (&code); { for (symbol_list *list = (yyvsp[0].generic_symlist); list; list = list->next) symbol_list_code_props_set (list, (yyvsp[-2].code_props_type), &code); symbol_list_free ((yyvsp[0].generic_symlist)); } } break; case 36: /* grammar_declaration: "%default-prec" */ { default_prec = true; } break; case 37: /* grammar_declaration: "%no-default-prec" */ { default_prec = false; } break; case 38: /* grammar_declaration: "%code" "{...}" */ { /* Do not invoke muscle_percent_code_grow here since it invokes muscle_user_name_list_grow. */ muscle_code_grow ("percent_code()", translate_code_braceless ((yyvsp[0].BRACED_CODE), (yylsp[0])), (yylsp[0])); code_scanner_last_string_free (); } break; case 39: /* grammar_declaration: "%code" "identifier" "{...}" */ { muscle_percent_code_grow ((yyvsp[-1].ID), (yylsp[-1]), translate_code_braceless ((yyvsp[0].BRACED_CODE), (yylsp[0])), (yylsp[0])); code_scanner_last_string_free (); } break; case 40: /* code_props_type: "%destructor" */ { (yyval.code_props_type) = destructor; } break; case 41: /* code_props_type: "%printer" */ { (yyval.code_props_type) = printer; } break; case 42: /* union_name: %empty */ {} break; case 43: /* union_name: "identifier" */ { muscle_percent_define_insert ("api.value.union.name", (yylsp[0]), muscle_keyword, (yyvsp[0].ID), MUSCLE_PERCENT_DEFINE_GRAMMAR_FILE); } break; case 44: /* grammar_declaration: "%union" union_name "{...}" */ { union_seen = true; muscle_code_grow ("union_members", translate_code_braceless ((yyvsp[0].BRACED_CODE), (yylsp[0])), (yylsp[0])); code_scanner_last_string_free (); } break; case 45: /* $@2: %empty */ { current_class = nterm_sym; } break; case 46: /* symbol_declaration: "%nterm" $@2 nterm_decls */ { current_class = unknown_sym; symbol_list_free ((yyvsp[0].nterm_decls)); } break; case 47: /* $@3: %empty */ { current_class = token_sym; } break; case 48: /* symbol_declaration: "%token" $@3 token_decls */ { current_class = unknown_sym; symbol_list_free ((yyvsp[0].token_decls)); } break; case 49: /* $@4: %empty */ { current_class = pct_type_sym; } break; case 50: /* symbol_declaration: "%type" $@4 symbol_decls */ { current_class = unknown_sym; symbol_list_free ((yyvsp[0].symbol_decls)); } break; case 51: /* symbol_declaration: precedence_declarator token_decls_for_prec */ { ++current_prec; for (symbol_list *list = (yyvsp[0].token_decls_for_prec); list; list = list->next) symbol_precedence_set (list->content.sym, current_prec, (yyvsp[-1].precedence_declarator), (yylsp[-1])); symbol_list_free ((yyvsp[0].token_decls_for_prec)); } break; case 52: /* precedence_declarator: "%left" */ { (yyval.precedence_declarator) = left_assoc; } break; case 53: /* precedence_declarator: "%right" */ { (yyval.precedence_declarator) = right_assoc; } break; case 54: /* precedence_declarator: "%nonassoc" */ { (yyval.precedence_declarator) = non_assoc; } break; case 55: /* precedence_declarator: "%precedence" */ { (yyval.precedence_declarator) = precedence_assoc; } break; case 56: /* string.opt: %empty */ { (yyval.yykind_75) = NULL; } break; case 57: /* string.opt: "string" */ { (yyval.yykind_75) = (yyvsp[0].STRING); } break; case 58: /* tag.opt: %empty */ { (yyval.yykind_76) = NULL; } break; case 59: /* tag.opt: "<tag>" */ { (yyval.yykind_76) = (yyvsp[0].TAG); } break; case 61: /* generic_symlist: generic_symlist generic_symlist_item */ { (yyval.generic_symlist) = symbol_list_append ((yyvsp[-1].generic_symlist), (yyvsp[0].generic_symlist_item)); } break; case 62: /* generic_symlist_item: symbol */ { (yyval.generic_symlist_item) = symbol_list_sym_new ((yyvsp[0].symbol), (yylsp[0])); } break; case 63: /* generic_symlist_item: tag */ { (yyval.generic_symlist_item) = symbol_list_type_new ((yyvsp[0].tag), (yylsp[0])); } break; case 65: /* tag: "<*>" */ { (yyval.tag) = uniqstr_new ("*"); } break; case 66: /* tag: "<>" */ { (yyval.tag) = uniqstr_new (""); } break; case 68: /* token_decls: token_decl.1 */ { (yyval.token_decls) = (yyvsp[0].yykind_82); } break; case 69: /* token_decls: "<tag>" token_decl.1 */ { (yyval.token_decls) = symbol_list_type_set ((yyvsp[0].yykind_82), (yyvsp[-1].TAG)); } break; case 70: /* token_decls: token_decls "<tag>" token_decl.1 */ { (yyval.token_decls) = symbol_list_append ((yyvsp[-2].token_decls), symbol_list_type_set ((yyvsp[0].yykind_82), (yyvsp[-1].TAG))); } break; case 71: /* token_decl.1: token_decl */ { (yyval.yykind_82) = symbol_list_sym_new ((yyvsp[0].token_decl), (yylsp[0])); } break; case 72: /* token_decl.1: token_decl.1 token_decl */ { (yyval.yykind_82) = symbol_list_append ((yyvsp[-1].yykind_82), symbol_list_sym_new ((yyvsp[0].token_decl), (yylsp[0]))); } break; case 73: /* token_decl: id int.opt alias */ { (yyval.token_decl) = (yyvsp[-2].id); symbol_class_set ((yyvsp[-2].id), current_class, (yylsp[-2]), true); if (0 <= (yyvsp[-1].yykind_84)) symbol_code_set ((yyvsp[-2].id), (yyvsp[-1].yykind_84), (yylsp[-1])); if ((yyvsp[0].alias)) symbol_make_alias ((yyvsp[-2].id), (yyvsp[0].alias), (yylsp[0])); } break; case 74: /* int.opt: %empty */ { (yyval.yykind_84) = -1; } break; case 76: /* alias: %empty */ { (yyval.alias) = NULL; } break; case 77: /* alias: string_as_id */ { (yyval.alias) = (yyvsp[0].string_as_id); } break; case 78: /* alias: "translatable string" */ { (yyval.alias) = symbol_get ((yyvsp[0].TSTRING), (yylsp[0])); symbol_class_set ((yyval.alias), token_sym, (yylsp[0]), false); (yyval.alias)->translatable = true; } break; case 79: /* token_decls_for_prec: token_decl_for_prec.1 */ { (yyval.token_decls_for_prec) = (yyvsp[0].yykind_87); } break; case 80: /* token_decls_for_prec: "<tag>" token_decl_for_prec.1 */ { (yyval.token_decls_for_prec) = symbol_list_type_set ((yyvsp[0].yykind_87), (yyvsp[-1].TAG)); } break; case 81: /* token_decls_for_prec: token_decls_for_prec "<tag>" token_decl_for_prec.1 */ { (yyval.token_decls_for_prec) = symbol_list_append ((yyvsp[-2].token_decls_for_prec), symbol_list_type_set ((yyvsp[0].yykind_87), (yyvsp[-1].TAG))); } break; case 82: /* token_decl_for_prec.1: token_decl_for_prec */ { (yyval.yykind_87) = symbol_list_sym_new ((yyvsp[0].token_decl_for_prec), (yylsp[0])); } break; case 83: /* token_decl_for_prec.1: token_decl_for_prec.1 token_decl_for_prec */ { (yyval.yykind_87) = symbol_list_append ((yyvsp[-1].yykind_87), symbol_list_sym_new ((yyvsp[0].token_decl_for_prec), (yylsp[0]))); } break; case 84: /* token_decl_for_prec: id int.opt */ { (yyval.token_decl_for_prec) = (yyvsp[-1].id); symbol_class_set ((yyvsp[-1].id), token_sym, (yylsp[-1]), false); if (0 <= (yyvsp[0].yykind_84)) symbol_code_set ((yyvsp[-1].id), (yyvsp[0].yykind_84), (yylsp[0])); } break; case 86: /* symbol_decls: symbols.1 */ { (yyval.symbol_decls) = (yyvsp[0].yykind_90); } break; case 87: /* symbol_decls: "<tag>" symbols.1 */ { (yyval.symbol_decls) = symbol_list_type_set ((yyvsp[0].yykind_90), (yyvsp[-1].TAG)); } break; case 88: /* symbol_decls: symbol_decls "<tag>" symbols.1 */ { (yyval.symbol_decls) = symbol_list_append ((yyvsp[-2].symbol_decls), symbol_list_type_set ((yyvsp[0].yykind_90), (yyvsp[-1].TAG))); } break; case 89: /* symbols.1: symbol */ { if (current_class != unknown_sym) symbol_class_set ((yyvsp[0].symbol), current_class, (yylsp[0]), false); (yyval.yykind_90) = symbol_list_sym_new ((yyvsp[0].symbol), (yylsp[0])); } break; case 90: /* symbols.1: symbols.1 symbol */ { if (current_class != unknown_sym) symbol_class_set ((yyvsp[0].symbol), current_class, (yylsp[0]), false); (yyval.yykind_90) = symbol_list_append ((yyvsp[-1].yykind_90), symbol_list_sym_new ((yyvsp[0].symbol), (yylsp[0]))); } break; case 95: /* rules_or_grammar_declaration: error ";" */ { yyerrok; } break; case 96: /* $@5: %empty */ { current_lhs ((yyvsp[-1].id_colon), (yylsp[-1]), (yyvsp[0].yykind_97)); } break; case 97: /* rules: id_colon named_ref.opt $@5 ":" rhses.1 */ { /* Free the current lhs. */ current_lhs (0, (yylsp[-4]), 0); } break; case 98: /* rhses.1: rhs */ { grammar_current_rule_end ((yylsp[0])); } break; case 99: /* rhses.1: rhses.1 "|" rhs */ { grammar_current_rule_end ((yylsp[0])); } break; case 101: /* rhs: %empty */ { grammar_current_rule_begin (current_lhs_symbol, current_lhs_loc, current_lhs_named_ref); } break; case 102: /* rhs: rhs symbol named_ref.opt */ { grammar_current_rule_symbol_append ((yyvsp[-1].symbol), (yylsp[-1]), (yyvsp[0].yykind_97)); } break; case 103: /* rhs: rhs tag.opt "{...}" named_ref.opt */ { grammar_current_rule_action_append ((yyvsp[-1].BRACED_CODE), (yylsp[-1]), (yyvsp[0].yykind_97), (yyvsp[-2].yykind_76)); } break; case 104: /* rhs: rhs "%?{...}" */ { grammar_current_rule_predicate_append ((yyvsp[0].BRACED_PREDICATE), (yylsp[0])); } break; case 105: /* rhs: rhs "%empty" */ { grammar_current_rule_empty_set ((yylsp[0])); } break; case 106: /* rhs: rhs "%prec" symbol */ { grammar_current_rule_prec_set ((yyvsp[0].symbol), (yylsp[0])); } break; case 107: /* rhs: rhs "%dprec" "integer literal" */ { grammar_current_rule_dprec_set ((yyvsp[0].INT_LITERAL), (yylsp[0])); } break; case 108: /* rhs: rhs "%merge" "<tag>" */ { grammar_current_rule_merge_set ((yyvsp[0].TAG), (yylsp[0])); } break; case 109: /* rhs: rhs "%expect" "integer literal" */ { grammar_current_rule_expect_sr ((yyvsp[0].INT_LITERAL), (yylsp[0])); } break; case 110: /* rhs: rhs "%expect-rr" "integer literal" */ { grammar_current_rule_expect_rr ((yyvsp[0].INT_LITERAL), (yylsp[0])); } break; case 111: /* named_ref.opt: %empty */ { (yyval.yykind_97) = NULL; } break; case 112: /* named_ref.opt: "[identifier]" */ { (yyval.yykind_97) = named_ref_new ((yyvsp[0].BRACKETED_ID), (yylsp[0])); } break; case 114: /* value: %empty */ { (yyval.value).kind = muscle_keyword; (yyval.value).chars = ""; } break; case 115: /* value: "identifier" */ { (yyval.value).kind = muscle_keyword; (yyval.value).chars = (yyvsp[0].ID); } break; case 116: /* value: "string" */ { (yyval.value).kind = muscle_string; (yyval.value).chars = unquote ((yyvsp[0].STRING)); gram_scanner_last_string_free ();} break; case 117: /* value: "{...}" */ { (yyval.value).kind = muscle_code; (yyval.value).chars = strip_braces ((yyvsp[0].BRACED_CODE)); gram_scanner_last_string_free (); } break; case 118: /* id: "identifier" */ { (yyval.id) = symbol_from_uniqstr ((yyvsp[0].ID), (yylsp[0])); } break; case 119: /* id: "character literal" */ { const char *var = "api.token.raw"; if (current_class == nterm_sym) { complain (&(yylsp[0]), complaint, _("character literals cannot be nonterminals")); YYERROR; } if (muscle_percent_define_ifdef (var)) { complain (&(yylsp[0]), complaint, _("character literals cannot be used together" " with %s"), var); location loc = muscle_percent_define_get_loc (var); subcomplain (&loc, complaint, _("definition of %s"), var); } (yyval.id) = symbol_get (char_name ((yyvsp[0].CHAR_LITERAL)), (yylsp[0])); symbol_class_set ((yyval.id), token_sym, (yylsp[0]), false); symbol_code_set ((yyval.id), (yyvsp[0].CHAR_LITERAL), (yylsp[0])); } break; case 120: /* id_colon: "identifier:" */ { (yyval.id_colon) = symbol_from_uniqstr ((yyvsp[0].ID_COLON), (yylsp[0])); } break; case 123: /* string_as_id: "string" */ { (yyval.string_as_id) = symbol_get ((yyvsp[0].STRING), (yylsp[0])); symbol_class_set ((yyval.string_as_id), token_sym, (yylsp[0]), false); } break; case 125: /* epilogue.opt: "%%" "epilogue" */ { muscle_code_grow ("epilogue", translate_code ((yyvsp[0].EPILOGUE), (yylsp[0]), true), (yylsp[0])); code_scanner_last_string_free (); } break; default: break; } if (yychar_backup != yychar) YY_LAC_DISCARD ("yychar change"); } /* 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 ("-> $$ =", YY_CAST (yysymbol_kind_t, yyr1[yyn]), &yyval, &yyloc); YYPOPSTACK (yylen); yylen = 0; *++yyvsp = yyval; *++yylsp = yyloc; /* Now 'shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule number reduced by. */ { const int yylhs = yyr1[yyn] - YYNTOKENS; const int yyi = yypgoto[yylhs] + *yyssp; yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp ? yytable[yyi] : yydefgoto[yylhs]); } goto yynewstate; /*--------------------------------------. | 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 == GRAM_EMPTY ? YYSYMBOL_YYEMPTY : YYTRANSLATE (yychar); /* If not already recovering from an error, report this error. */ if (!yyerrstatus) { ++yynerrs; { yypcontext_t yyctx = {yyssp, yyesa, &yyes, &yyes_capacity, yytoken, &yylloc}; if (yychar != GRAM_EMPTY) YY_LAC_ESTABLISH; if (yyreport_syntax_error (&yyctx) == 2) YYNOMEM; } } yyerror_range[1] = yylloc; if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ if (yychar <= GRAM_EOF) { /* Return failure if at end of input. */ if (yychar == GRAM_EOF) YYABORT; } else { yydestruct ("Error: discarding", yytoken, &yylval, &yylloc); yychar = GRAM_EMPTY; } } /* Else will try to reuse lookahead token after shifting the error token. */ goto yyerrlab1; /*---------------------------------------------------. | yyerrorlab -- error raised explicitly by YYERROR. | `---------------------------------------------------*/ yyerrorlab: /* Pacify compilers when the user code never invokes YYERROR and the label yyerrorlab therefore never appears in user code. */ if (0) YYERROR; ++yynerrs; /* Do not reclaim the symbols of the rule whose action triggered this YYERROR. */ YYPOPSTACK (yylen); yylen = 0; YY_STACK_PRINT (yyss, yyssp); yystate = *yyssp; goto yyerrlab1; /*-------------------------------------------------------------. | yyerrlab1 -- common code for both syntax error and YYERROR. | `-------------------------------------------------------------*/ yyerrlab1: yyerrstatus = 3; /* Each real token shifted decrements this. */ /* Pop stack until we find a state that shifts the error token. */ for (;;) { yyn = yypact[yystate]; if (!yypact_value_is_default (yyn)) { yyn += YYSYMBOL_YYerror; if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYSYMBOL_YYerror) { yyn = yytable[yyn]; if (0 < yyn) break; } } /* Pop the current state because it cannot handle the error token. */ if (yyssp == yyss) YYABORT; yyerror_range[1] = *yylsp; yydestruct ("Error: popping", YY_ACCESSING_SYMBOL (yystate), yyvsp, yylsp); YYPOPSTACK (1); yystate = *yyssp; YY_STACK_PRINT (yyss, yyssp); } /* If the stack popping above didn't lose the initial context for the current lookahead token, the shift below will for sure. */ YY_LAC_DISCARD ("error recovery"); YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN *++yyvsp = yylval; YY_IGNORE_MAYBE_UNINITIALIZED_END yyerror_range[2] = yylloc; ++yylsp; YYLLOC_DEFAULT (*yylsp, yyerror_range, 2); /* Shift the error token. */ YY_SYMBOL_PRINT ("Shifting", YY_ACCESSING_SYMBOL (yyn), yyvsp, yylsp); yystate = yyn; goto yynewstate; /*-------------------------------------. | yyacceptlab -- YYACCEPT comes here. | `-------------------------------------*/ yyacceptlab: yyresult = 0; goto yyreturnlab; /*-----------------------------------. | yyabortlab -- YYABORT comes here. | `-----------------------------------*/ yyabortlab: yyresult = 1; goto yyreturnlab; /*-----------------------------------------------------------. | yyexhaustedlab -- YYNOMEM (memory exhaustion) comes here. | `-----------------------------------------------------------*/ yyexhaustedlab: yyerror (&yylloc, YY_("memory exhausted")); yyresult = 2; goto yyreturnlab; /*----------------------------------------------------------. | yyreturnlab -- parsing is finished, clean up and return. | `----------------------------------------------------------*/ yyreturnlab: if (yychar != GRAM_EMPTY) { /* 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, &yylloc); } /* Do not reclaim the symbols of the rule whose action triggered this YYABORT or YYACCEPT. */ YYPOPSTACK (yylen); YY_STACK_PRINT (yyss, yyssp); while (yyssp != yyss) { yydestruct ("Cleanup: popping", YY_ACCESSING_SYMBOL (+*yyssp), yyvsp, yylsp); YYPOPSTACK (1); } #ifndef yyoverflow if (yyss != yyssa) YYSTACK_FREE (yyss); #endif if (yyes != yyesa) YYSTACK_FREE (yyes); return yyresult; } int yyreport_syntax_error (const yypcontext_t *ctx) { int res = 0; /* Arguments of format: reported tokens (one for the "unexpected", one per "expected"). */ enum { ARGS_MAX = 5 }; const char *argv[ARGS_MAX]; int argc = 0; yysymbol_kind_t unexpected = yypcontext_token (ctx); if (unexpected != YYSYMBOL_YYEMPTY) { argv[argc++] = yysymbol_name (unexpected); yysymbol_kind_t expected[ARGS_MAX - 1]; int nexpected = yypcontext_expected_tokens (ctx, expected, ARGS_MAX - 1); if (nexpected < 0) res = nexpected; else for (int i = 0; i < nexpected; ++i) argv[argc++] = yysymbol_name (expected[i]); } syntax_error (*yypcontext_location (ctx), argc, argv); return res; } /* Return the location of the left-hand side of a rule whose right-hand side is RHS[1] ... RHS[N]. Ignore empty nonterminals in the right-hand side, and return an empty location equal to the end boundary of RHS[0] if the right-hand side is empty. */ static YYLTYPE lloc_default (YYLTYPE const *rhs, int n) { YYLTYPE loc; /* SGI MIPSpro 7.4.1m miscompiles "loc.start = loc.end = rhs[n].end;". The bug is fixed in 7.4.2m, but play it safe for now. */ loc.start = rhs[n].end; loc.end = rhs[n].end; /* Ignore empty nonterminals the start of the right-hand side. Do not bother to ignore them at the end of the right-hand side, since empty nonterminals have the same end as their predecessors. */ for (int i = 1; i <= n; i++) if (! equal_boundaries (rhs[i].start, rhs[i].end)) { loc.start = rhs[i].start; break; } return loc; } static char *strip_braces (char *code) { code[strlen (code) - 1] = 0; return code + 1; } static char const * translate_code (char *code, location loc, bool plain) { code_props plain_code; if (plain) code_props_plain_init (&plain_code, code, loc); else code_props_symbol_action_init (&plain_code, code, loc); code_props_translate_code (&plain_code); gram_scanner_last_string_free (); return plain_code.code; } static char const * translate_code_braceless (char *code, location loc) { return translate_code (strip_braces (code), loc, true); } static void add_param (param_type type, char *decl, location loc) { static char const alphanum[26 + 26 + 1 + 10 + 1] = "abcdefghijklmnopqrstuvwxyz" "ABCDEFGHIJKLMNOPQRSTUVWXYZ" "_" "0123456789"; char const *name_start = NULL; { char *p; /* Stop on last actual character. */ for (p = decl; p[1]; p++) if ((p == decl || ! memchr (alphanum, p[-1], sizeof alphanum - 1)) && memchr (alphanum, p[0], sizeof alphanum - 10 - 1)) name_start = p; /* Strip the surrounding '{' and '}', and any blanks just inside the braces. */ --p; while (c_isspace (*p)) --p; p[1] = '\0'; ++decl; while (c_isspace (*decl)) ++decl; } if (! name_start) complain (&loc, complaint, _("missing identifier in parameter declaration")); else { char *name = xmemdup0 (name_start, strspn (name_start, alphanum)); if (type & param_lex) muscle_pair_list_grow ("lex_param", decl, name); if (type & param_parse) muscle_pair_list_grow ("parse_param", decl, name); free (name); } gram_scanner_last_string_free (); } static bool valid_output_file_name (char const *file) { return !strchr (file, '/'); } static void handle_header (location const *loc, char const *value) { header_flag = true; if (value) { char *file = unquote (value); if (valid_output_file_name (file)) spec_header_file = xstrdup (file); else complain (loc, complaint, _("invalid %%header file name ignored")); gram_scanner_last_string_free (); unquote_free (file); } } static void handle_error_verbose (location const *loc, char const *directive) { bison_directive (loc, directive); muscle_percent_define_insert (directive, *loc, muscle_keyword, "", MUSCLE_PERCENT_DEFINE_GRAMMAR_FILE); } static void handle_file_prefix (location const *loc, location const *dir_loc, char const *directive, char const *value_quoted) { char *value = unquote (value_quoted); bison_directive (loc, directive); bool warned = false; if (location_empty (spec_file_prefix_loc)) { spec_file_prefix_loc = *loc; spec_file_prefix = value; } else { duplicate_directive (directive, spec_file_prefix_loc, *loc); warned = true; } if (!warned && STRNEQ (directive, "%file-prefix")) deprecated_directive (dir_loc, directive, "%file-prefix"); } static void handle_language (location const *loc, char const *lang) { language_argmatch (unquote (lang), grammar_prio, *loc); } static void handle_name_prefix (location const *loc, char const *directive, char const *value_quoted) { char *value = unquote (value_quoted); bison_directive (loc, directive); char buf1[1024]; size_t len1 = sizeof (buf1); char *old = asnprintf (buf1, &len1, "%s\"%s\"", directive, value); if (!old) xalloc_die (); if (location_empty (spec_name_prefix_loc)) { spec_name_prefix = value; spec_name_prefix_loc = *loc; char buf2[1024]; size_t len2 = sizeof (buf2); char *new = asnprintf (buf2, &len2, "%%define api.prefix {%s}", value); if (!new) xalloc_die (); deprecated_directive (loc, old, new); if (new != buf2) free (new); } else duplicate_directive (old, spec_file_prefix_loc, *loc); if (old != buf1) free (old); } static void handle_pure_parser (location const *loc, char const *directive) { bison_directive (loc, directive); deprecated_directive (loc, directive, "%define api.pure"); muscle_percent_define_insert ("api.pure", *loc, muscle_keyword, "", MUSCLE_PERCENT_DEFINE_GRAMMAR_FILE); } static void handle_require (location const *loc, char const *version_quoted) { char *version = unquote (version_quoted); required_version = strversion_to_int (version); if (required_version == -1) { complain (loc, complaint, _("invalid version requirement: %s"), version); required_version = 0; } else { const char* package_version = 0 < strverscmp (api_version, PACKAGE_VERSION) ? api_version : PACKAGE_VERSION; if (0 < strverscmp (version, package_version)) { complain (loc, complaint, _("require bison %s, but have %s"), version, package_version); exit (EX_MISMATCH); } } unquote_free (version); gram_scanner_last_string_free (); } static void handle_skeleton (location const *loc, char const *skel_quoted) { char *skel = unquote (skel_quoted); char const *skeleton_user = skel; if (strchr (skeleton_user, '/')) { size_t dir_length = strlen (grammar_file); while (dir_length && grammar_file[dir_length - 1] != '/') --dir_length; while (dir_length && grammar_file[dir_length - 1] == '/') --dir_length; char *skeleton_build = xmalloc (dir_length + 1 + strlen (skeleton_user) + 1); if (dir_length > 0) { memcpy (skeleton_build, grammar_file, dir_length); skeleton_build[dir_length++] = '/'; } strcpy (skeleton_build + dir_length, skeleton_user); skeleton_user = uniqstr_new (skeleton_build); free (skeleton_build); } skeleton_arg (skeleton_user, grammar_prio, *loc); } static void handle_yacc (location const *loc) { const char *directive = "%yacc"; bison_directive (loc, directive); if (location_empty (yacc_loc)) set_yacc (*loc); else duplicate_directive (directive, yacc_loc, *loc); } static void gram_error (location const *loc, char const *msg) { complain (loc, complaint, "%s", msg); } static char const * char_name (char c) { if (c == '\'') return "'\\''"; else { char buf[4]; buf[0] = '\''; buf[1] = c; buf[2] = '\''; buf[3] = '\0'; return quotearg_style (escape_quoting_style, buf); } } static void current_lhs (symbol *sym, location loc, named_ref *ref) { current_lhs_symbol = sym; current_lhs_loc = loc; if (sym) symbol_location_as_lhs_set (sym, loc); /* In order to simplify memory management, named references for lhs are always assigned by deep copy into the current symbol_list node. This is because a single named-ref in the grammar may result in several uses when the user factors lhs between several rules using "|". Therefore free the parser's original copy. */ free (current_lhs_named_ref); current_lhs_named_ref = ref; } static void tron (FILE *yyo) { begin_use_class ("value", yyo); } static void troff (FILE *yyo) { end_use_class ("value", yyo); } /*----------. | Unquote. | `----------*/ struct obstack obstack_for_unquote; void parser_init (void) { obstack_init (&obstack_for_unquote); } void parser_free (void) { obstack_free (&obstack_for_unquote, 0); } static void unquote_free (char *last_string) { obstack_free (&obstack_for_unquote, last_string); } static char * unquote (const char *cp) { #define GROW(Char) \ obstack_1grow (&obstack_for_unquote, Char); for (++cp; *cp && *cp != '"'; ++cp) switch (*cp) { case '"': break; case '\\': ++cp; switch (*cp) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': { int c = cp[0] - '0'; if (c_isdigit (cp[1])) { ++cp; c = c * 8 + cp[0] - '0'; } if (c_isdigit (cp[1])) { ++cp; c = c * 8 + cp[0] - '0'; } GROW (c); } break; case 'a': GROW ('\a'); break; case 'b': GROW ('\b'); break; case 'f': GROW ('\f'); break; case 'n': GROW ('\n'); break; case 'r': GROW ('\r'); break; case 't': GROW ('\t'); break; case 'v': GROW ('\v'); break; case 'x': { int c = 0; while (c_isxdigit (cp[1])) { ++cp; c = (c * 16 + (c_isdigit (cp[0]) ? cp[0] - '0' : c_isupper (cp[0]) ? cp[0] - 'A' : cp[0] - '0')); } GROW (c); break; } } break; default: GROW (*cp); break; } assert (*cp == '"'); ++cp; assert (*cp == '\0'); #undef GROW return obstack_finish0 (&obstack_for_unquote); }