Download src/lm/jsgf_parser.c from camenduru/pocketsphinx: direct link, hf CLI and curl.
- Browser
- Download file 49.7 kB
-
https://huggingface.co/camenduru/pocketsphinx/resolve/main/src/lm/jsgf_parser.c
- Command line
-
hf download hf://camenduru/pocketsphinx/src/lm/jsgf_parser.c
-
curl -L -o jsgf_parser.c https://huggingface.co/camenduru/pocketsphinx/resolve/main/src/lm/jsgf_parser.c
49.7 kB
| /* A Bison parser, made by GNU Bison 2.4.1. */ | |
| /* Skeleton implementation for Bison's Yacc-like parsers in C | |
| Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006 | |
| Free Software Foundation, Inc. | |
| This program is free software: you can redistribute it and/or modify | |
| it under the terms of the GNU General Public License as published by | |
| the Free Software Foundation, either version 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. */ | |
| /* Bison version. */ | |
| /* Skeleton name. */ | |
| /* Pure parsers. */ | |
| /* Push parsers. */ | |
| /* Pull parsers. */ | |
| /* Using locations. */ | |
| /* Copy the first part of user declarations. */ | |
| /* Line 189 of yacc.c */ | |
| /* Suppress warnings from generated code */ | |
| void yyerror(yyscan_t lex, jsgf_t *jsgf, const char *s); | |
| /* Line 189 of yacc.c */ | |
| /* Enabling traces. */ | |
| /* Enabling verbose error messages. */ | |
| /* Enabling the token table. */ | |
| /* Tokens. */ | |
| /* Put the tokens into the symbol table, so that GDB and other debuggers | |
| know about them. */ | |
| enum yytokentype { | |
| HEADER = 258, | |
| GRAMMAR = 259, | |
| IMPORT = 260, | |
| PUBLIC = 261, | |
| TOKEN = 262, | |
| RULENAME = 263, | |
| TAG = 264, | |
| WEIGHT = 265 | |
| }; | |
| /* Tokens. */ | |
| typedef union YYSTYPE | |
| { | |
| /* Line 214 of yacc.c */ | |
| char *name; | |
| float weight; | |
| jsgf_rule_t *rule; | |
| jsgf_rhs_t *rhs; | |
| jsgf_atom_t *atom; | |
| /* Line 214 of yacc.c */ | |
| } YYSTYPE; | |
| /* Copy the second part of user declarations. */ | |
| /* Line 264 of yacc.c */ | |
| typedef YYTYPE_UINT8 yytype_uint8; | |
| typedef unsigned char yytype_uint8; | |
| typedef YYTYPE_INT8 yytype_int8; | |
| typedef signed char yytype_int8; | |
| typedef short int yytype_int8; | |
| typedef YYTYPE_UINT16 yytype_uint16; | |
| typedef unsigned short int yytype_uint16; | |
| typedef YYTYPE_INT16 yytype_int16; | |
| typedef short int yytype_int16; | |
| /* Suppress unused-variable warnings by "using" E. */ | |
| /* Identity function, used to suppress warnings about constant conditions. */ | |
| static int | |
| YYID (int yyi) | |
| static int | |
| YYID (yyi) | |
| int yyi; | |
| { | |
| return yyi; | |
| } | |
| /* The parser invokes alloca or malloc; define the necessary symbols. */ | |
| /* Pacify GCC's `empty if-body' warning. */ | |
| /* 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. */ | |
| void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ | |
| void free (void *); /* INFRINGES ON USER NAME SPACE */ | |
| /* A type that is properly aligned for any stack member. */ | |
| union yyalloc | |
| { | |
| yytype_int16 yyss_alloc; | |
| YYSTYPE yyvs_alloc; | |
| }; | |
| /* The size of the maximum gap between one aligned stack and the next. */ | |
| /* The size of an array large to enough to hold all stacks, each with | |
| N elements. */ | |
| /* Copy COUNT objects from FROM to TO. The source and destination do | |
| not overlap. */ | |
| /* 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. */ | |
| /* YYFINAL -- State number of the termination state. */ | |
| /* YYLAST -- Last index in YYTABLE. */ | |
| /* YYNTOKENS -- Number of terminals. */ | |
| /* YYNNTS -- Number of nonterminals. */ | |
| /* YYNRULES -- Number of rules. */ | |
| /* YYNRULES -- Number of states. */ | |
| /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ | |
| /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ | |
| static const yytype_uint8 yytranslate[] = | |
| { | |
| 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 14, 15, 18, 19, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 11, | |
| 2, 12, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 16, 2, 17, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 13, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 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 | |
| }; | |
| /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in | |
| YYRHS. */ | |
| static const yytype_uint8 yyprhs[] = | |
| { | |
| 0, 0, 3, 5, 8, 12, 15, 18, 22, 27, | |
| 33, 37, 39, 42, 46, 48, 51, 56, 62, 64, | |
| 68, 70, 73, 75, 78, 80, 83, 87, 91, 93, | |
| 95, 97, 99, 102 | |
| }; | |
| /* YYRHS -- A `-1'-separated list of the rules' RHS. */ | |
| static const yytype_int8 yyrhs[] = | |
| { | |
| 21, 0, -1, 22, -1, 22, 27, -1, 22, 25, | |
| 27, -1, 23, 24, -1, 3, 11, -1, 3, 7, | |
| 11, -1, 3, 7, 7, 11, -1, 3, 7, 7, | |
| 7, 11, -1, 4, 7, 11, -1, 26, -1, 25, | |
| 26, -1, 5, 8, 11, -1, 28, -1, 27, 28, | |
| -1, 8, 12, 29, 11, -1, 6, 8, 12, 29, | |
| 11, -1, 30, -1, 29, 13, 30, -1, 31, -1, | |
| 30, 31, -1, 32, -1, 31, 9, -1, 35, -1, | |
| 10, 35, -1, 14, 29, 15, -1, 16, 29, 17, | |
| -1, 7, -1, 8, -1, 33, -1, 34, -1, 35, | |
| 18, -1, 35, 19, -1 | |
| }; | |
| /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ | |
| static const yytype_uint8 yyrline[] = | |
| { | |
| 0, 82, 82, 83, 84, 87, 90, 91, 92, 93, | |
| 97, 100, 101, 104, 107, 108, 111, 112, 115, 116, | |
| 121, 123, 127, 128, 132, 133, 136, 139, 142, 143, | |
| 144, 145, 146, 147 | |
| }; | |
| /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. | |
| First, the terminals, then, starting at YYNTOKENS, nonterminals. */ | |
| static const char *const yytname[] = | |
| { | |
| "$end", "error", "$undefined", "HEADER", "GRAMMAR", "IMPORT", "PUBLIC", | |
| "TOKEN", "RULENAME", "TAG", "WEIGHT", "';'", "'='", "'|'", "'('", "')'", | |
| "'['", "']'", "'*'", "'+'", "$accept", "grammar", "header", | |
| "jsgf_header", "grammar_header", "import_header", "import_statement", | |
| "rule_list", "rule", "alternate_list", "rule_expansion", | |
| "tagged_rule_item", "rule_item", "rule_group", "rule_optional", | |
| "rule_atom", 0 | |
| }; | |
| /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to | |
| token YYLEX-NUM. */ | |
| static const yytype_uint16 yytoknum[] = | |
| { | |
| 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, | |
| 265, 59, 61, 124, 40, 41, 91, 93, 42, 43 | |
| }; | |
| /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ | |
| static const yytype_uint8 yyr1[] = | |
| { | |
| 0, 20, 21, 21, 21, 22, 23, 23, 23, 23, | |
| 24, 25, 25, 26, 27, 27, 28, 28, 29, 29, | |
| 30, 30, 31, 31, 32, 32, 33, 34, 35, 35, | |
| 35, 35, 35, 35 | |
| }; | |
| /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ | |
| static const yytype_uint8 yyr2[] = | |
| { | |
| 0, 2, 1, 2, 3, 2, 2, 3, 4, 5, | |
| 3, 1, 2, 3, 1, 2, 4, 5, 1, 3, | |
| 1, 2, 1, 2, 1, 2, 3, 3, 1, 1, | |
| 1, 1, 2, 2 | |
| }; | |
| /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state | |
| STATE-NUM when YYTABLE doesn't specify something else to do. Zero | |
| means the default is an error. */ | |
| static const yytype_uint8 yydefact[] = | |
| { | |
| 0, 0, 0, 2, 0, 0, 6, 1, 0, 0, | |
| 0, 0, 11, 3, 14, 0, 5, 0, 7, 0, | |
| 0, 0, 12, 4, 15, 0, 0, 8, 13, 0, | |
| 28, 29, 0, 0, 0, 0, 18, 20, 22, 30, | |
| 31, 24, 10, 9, 0, 25, 0, 0, 16, 0, | |
| 21, 23, 32, 33, 17, 26, 27, 19 | |
| }; | |
| /* YYDEFGOTO[NTERM-NUM]. */ | |
| static const yytype_int8 yydefgoto[] = | |
| { | |
| -1, 2, 3, 4, 16, 11, 12, 13, 14, 35, | |
| 36, 37, 38, 39, 40, 41 | |
| }; | |
| /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing | |
| STATE-NUM. */ | |
| static const yytype_int8 yypact[] = | |
| { | |
| -1, -2, 36, 22, 35, 8, -37, -37, 32, 33, | |
| 30, 22, -37, 17, -37, 37, -37, 13, -37, 34, | |
| 31, -4, -37, 17, -37, 38, 39, -37, -37, -4, | |
| -37, -37, 0, -4, -4, 18, -4, 42, -37, -37, | |
| -37, 19, -37, -37, 21, 19, 20, 9, -37, -4, | |
| 42, -37, -37, -37, -37, -37, -37, -4 | |
| }; | |
| /* YYPGOTO[NTERM-NUM]. */ | |
| static const yytype_int8 yypgoto[] = | |
| { | |
| -37, -37, -37, -37, -37, -37, 41, 43, -12, -16, | |
| -3, -36, -37, -37, -37, 15 | |
| }; | |
| /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If | |
| positive, shift that token. If negative, reduce the rule which | |
| number is the opposite. If zero, do what YYDEFACT says. | |
| If YYTABLE_NINF, syntax error. */ | |
| static const yytype_uint8 yytable[] = | |
| { | |
| 50, 24, 1, 30, 31, 5, 32, 30, 31, 6, | |
| 33, 24, 34, 44, 33, 17, 34, 46, 47, 18, | |
| 26, 50, 49, 9, 27, 10, 56, 8, 9, 48, | |
| 10, 49, 54, 49, 49, 55, 7, 52, 53, 15, | |
| 19, 20, 21, 29, 25, 28, 57, 45, 0, 42, | |
| 43, 51, 22, 0, 23 | |
| }; | |
| static const yytype_int8 yycheck[] = | |
| { | |
| 36, 13, 3, 7, 8, 7, 10, 7, 8, 11, | |
| 14, 23, 16, 29, 14, 7, 16, 33, 34, 11, | |
| 7, 57, 13, 6, 11, 8, 17, 5, 6, 11, | |
| 8, 13, 11, 13, 13, 15, 0, 18, 19, 4, | |
| 8, 8, 12, 12, 7, 11, 49, 32, -1, 11, | |
| 11, 9, 11, -1, 11 | |
| }; | |
| /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing | |
| symbol of state STATE-NUM. */ | |
| static const yytype_uint8 yystos[] = | |
| { | |
| 0, 3, 21, 22, 23, 7, 11, 0, 5, 6, | |
| 8, 25, 26, 27, 28, 4, 24, 7, 11, 8, | |
| 8, 12, 26, 27, 28, 7, 7, 11, 11, 12, | |
| 7, 8, 10, 14, 16, 29, 30, 31, 32, 33, | |
| 34, 35, 11, 11, 29, 35, 29, 29, 11, 13, | |
| 31, 9, 18, 19, 11, 15, 17, 30 | |
| }; | |
| /* Like YYERROR except do call yyerror. This remains here temporarily | |
| to ease the transition to the new meaning of YYERROR, for GCC. | |
| Once GCC version 2 has supplanted version 1, this can go. */ | |
| /* 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). */ | |
| /* YY_LOCATION_PRINT -- Print the location on the stream. | |
| This macro was not mandated originally: define only if we know | |
| we won't break user code: when these are the locations we know. */ | |
| /* YYLEX -- calling `yylex' with the right arguments. */ | |
| /* Enable debugging if requested. */ | |
| /*--------------------------------. | |
| | Print this symbol on YYOUTPUT. | | |
| `--------------------------------*/ | |
| /*ARGSUSED*/ | |
| static void | |
| yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, void* yyscanner, jsgf_t *jsgf) | |
| static void | |
| yy_symbol_value_print (yyoutput, yytype, yyvaluep, yyscanner, jsgf) | |
| FILE *yyoutput; | |
| int yytype; | |
| YYSTYPE const * const yyvaluep; | |
| void* yyscanner; | |
| jsgf_t *jsgf; | |
| { | |
| if (!yyvaluep) | |
| return; | |
| YYUSE (yyscanner); | |
| YYUSE (jsgf); | |
| if (yytype < YYNTOKENS) | |
| YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); | |
| YYUSE (yyoutput); | |
| switch (yytype) | |
| { | |
| default: | |
| break; | |
| } | |
| } | |
| /*--------------------------------. | |
| | Print this symbol on YYOUTPUT. | | |
| `--------------------------------*/ | |
| static void | |
| yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, void* yyscanner, jsgf_t *jsgf) | |
| static void | |
| yy_symbol_print (yyoutput, yytype, yyvaluep, yyscanner, jsgf) | |
| FILE *yyoutput; | |
| int yytype; | |
| YYSTYPE const * const yyvaluep; | |
| void* yyscanner; | |
| jsgf_t *jsgf; | |
| { | |
| if (yytype < YYNTOKENS) | |
| YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); | |
| else | |
| YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); | |
| yy_symbol_value_print (yyoutput, yytype, yyvaluep, yyscanner, jsgf); | |
| YYFPRINTF (yyoutput, ")"); | |
| } | |
| /*------------------------------------------------------------------. | |
| | yy_stack_print -- Print the state stack from its BOTTOM up to its | | |
| | TOP (included). | | |
| `------------------------------------------------------------------*/ | |
| static void | |
| yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop) | |
| static void | |
| yy_stack_print (yybottom, yytop) | |
| yytype_int16 *yybottom; | |
| yytype_int16 *yytop; | |
| { | |
| YYFPRINTF (stderr, "Stack now"); | |
| for (; yybottom <= yytop; yybottom++) | |
| { | |
| int yybot = *yybottom; | |
| YYFPRINTF (stderr, " %d", yybot); | |
| } | |
| YYFPRINTF (stderr, "\n"); | |
| } | |
| /*------------------------------------------------. | |
| | Report that the YYRULE is going to be reduced. | | |
| `------------------------------------------------*/ | |
| static void | |
| yy_reduce_print (YYSTYPE *yyvsp, int yyrule, void* yyscanner, jsgf_t *jsgf) | |
| static void | |
| yy_reduce_print (yyvsp, yyrule, yyscanner, jsgf) | |
| YYSTYPE *yyvsp; | |
| int yyrule; | |
| void* yyscanner; | |
| jsgf_t *jsgf; | |
| { | |
| 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)]) | |
| , yyscanner, jsgf); | |
| YYFPRINTF (stderr, "\n"); | |
| } | |
| } | |
| /* Nonzero means print parse trace. It is left uninitialized so that | |
| multiple parsers can coexist. */ | |
| int yydebug; | |
| /* YYINITDEPTH -- initial size of the parser's stacks. */ | |
| /* 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. */ | |
| /* Return the length of YYSTR. */ | |
| static YYSIZE_T | |
| yystrlen (const char *yystr) | |
| static YYSIZE_T | |
| yystrlen (yystr) | |
| const char *yystr; | |
| { | |
| YYSIZE_T yylen; | |
| for (yylen = 0; yystr[yylen]; yylen++) | |
| continue; | |
| return yylen; | |
| } | |
| /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in | |
| YYDEST. */ | |
| static char * | |
| yystpcpy (char *yydest, const char *yysrc) | |
| static char * | |
| yystpcpy (yydest, yysrc) | |
| char *yydest; | |
| const char *yysrc; | |
| { | |
| char *yyd = yydest; | |
| const char *yys = yysrc; | |
| while ((*yyd++ = *yys++) != '\0') | |
| continue; | |
| return yyd - 1; | |
| } | |
| /* 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; | |
| } | |
| /* Copy into YYRESULT an error message about the unexpected token | |
| YYCHAR while in state YYSTATE. Return the number of bytes copied, | |
| including the terminating null byte. If YYRESULT is null, do not | |
| copy anything; just return the number of bytes that would be | |
| copied. As a special case, return 0 if an ordinary "syntax error" | |
| message will do. Return YYSIZE_MAXIMUM if overflow occurs during | |
| size calculation. */ | |
| static YYSIZE_T | |
| yysyntax_error (char *yyresult, int yystate, int yychar) | |
| { | |
| int yyn = yypact[yystate]; | |
| if (! (YYPACT_NINF < yyn && yyn <= YYLAST)) | |
| return 0; | |
| else | |
| { | |
| int yytype = YYTRANSLATE (yychar); | |
| YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]); | |
| YYSIZE_T yysize = yysize0; | |
| YYSIZE_T yysize1; | |
| int yysize_overflow = 0; | |
| enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; | |
| char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; | |
| int yyx; | |
| /* This is so xgettext sees the translatable formats that are | |
| constructed on the fly. */ | |
| YY_("syntax error, unexpected %s"); | |
| YY_("syntax error, unexpected %s, expecting %s"); | |
| YY_("syntax error, unexpected %s, expecting %s or %s"); | |
| YY_("syntax error, unexpected %s, expecting %s or %s or %s"); | |
| YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"); | |
| char *yyfmt; | |
| char const *yyf; | |
| static char const yyunexpected[] = "syntax error, unexpected %s"; | |
| static char const yyexpecting[] = ", expecting %s"; | |
| static char const yyor[] = " or %s"; | |
| char yyformat[sizeof yyunexpected | |
| + sizeof yyexpecting - 1 | |
| + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2) | |
| * (sizeof yyor - 1))]; | |
| char const *yyprefix = yyexpecting; | |
| /* Start YYX at -YYN if negative to avoid negative indexes in | |
| YYCHECK. */ | |
| int yyxbegin = yyn < 0 ? -yyn : 0; | |
| /* Stay within bounds of both yycheck and yytname. */ | |
| int yychecklim = YYLAST - yyn + 1; | |
| int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; | |
| int yycount = 1; | |
| yyarg[0] = yytname[yytype]; | |
| yyfmt = yystpcpy (yyformat, yyunexpected); | |
| for (yyx = yyxbegin; yyx < yyxend; ++yyx) | |
| if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) | |
| { | |
| if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) | |
| { | |
| yycount = 1; | |
| yysize = yysize0; | |
| yyformat[sizeof yyunexpected - 1] = '\0'; | |
| break; | |
| } | |
| yyarg[yycount++] = yytname[yyx]; | |
| yysize1 = yysize + yytnamerr (0, yytname[yyx]); | |
| yysize_overflow |= (yysize1 < yysize); | |
| yysize = yysize1; | |
| yyfmt = yystpcpy (yyfmt, yyprefix); | |
| yyprefix = yyor; | |
| } | |
| yyf = YY_(yyformat); | |
| yysize1 = yysize + yystrlen (yyf); | |
| yysize_overflow |= (yysize1 < yysize); | |
| yysize = yysize1; | |
| if (yysize_overflow) | |
| return YYSIZE_MAXIMUM; | |
| if (yyresult) | |
| { | |
| /* Avoid sprintf, as that infringes on the user's name space. | |
| Don't have undefined behavior even if the translation | |
| produced a string with the wrong number of "%s"s. */ | |
| char *yyp = yyresult; | |
| int yyi = 0; | |
| while ((*yyp = *yyf) != '\0') | |
| { | |
| if (*yyp == '%' && yyf[1] == 's' && yyi < yycount) | |
| { | |
| yyp += yytnamerr (yyp, yyarg[yyi++]); | |
| yyf += 2; | |
| } | |
| else | |
| { | |
| yyp++; | |
| yyf++; | |
| } | |
| } | |
| } | |
| return yysize; | |
| } | |
| } | |
| /*-----------------------------------------------. | |
| | Release the memory associated to this symbol. | | |
| `-----------------------------------------------*/ | |
| /*ARGSUSED*/ | |
| static void | |
| yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep, void* yyscanner, jsgf_t *jsgf) | |
| static void | |
| yydestruct (yymsg, yytype, yyvaluep, yyscanner, jsgf) | |
| const char *yymsg; | |
| int yytype; | |
| YYSTYPE *yyvaluep; | |
| void* yyscanner; | |
| jsgf_t *jsgf; | |
| { | |
| YYUSE (yyvaluep); | |
| YYUSE (yyscanner); | |
| YYUSE (jsgf); | |
| if (!yymsg) | |
| yymsg = "Deleting"; | |
| YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); | |
| switch (yytype) | |
| { | |
| default: | |
| break; | |
| } | |
| } | |
| /* Prevent warnings from -Wmissing-prototypes. */ | |
| int yyparse (void *YYPARSE_PARAM); | |
| int yyparse (); | |
| int yyparse (void* yyscanner, jsgf_t *jsgf); | |
| int yyparse (); | |
| /*-------------------------. | |
| | yyparse or yypush_parse. | | |
| `-------------------------*/ | |
| int | |
| yyparse (void *YYPARSE_PARAM) | |
| int | |
| yyparse (YYPARSE_PARAM) | |
| void *YYPARSE_PARAM; | |
| int | |
| yyparse (void* yyscanner, jsgf_t *jsgf) | |
| int | |
| yyparse (yyscanner, jsgf) | |
| void* yyscanner; | |
| jsgf_t *jsgf; | |
| { | |
| /* The lookahead symbol. */ | |
| int yychar; | |
| /* The semantic value of the lookahead symbol. */ | |
| YYSTYPE yylval; | |
| /* Number of syntax errors so far. */ | |
| int yynerrs; | |
| int yystate; | |
| /* Number of tokens to shift before error messages enabled. */ | |
| int yyerrstatus; | |
| /* The stacks and their tools: | |
| `yyss': related to states. | |
| `yyvs': related to semantic values. | |
| Refer to the stacks thru separate pointers, to allow yyoverflow | |
| to reallocate them elsewhere. */ | |
| /* The state stack. */ | |
| yytype_int16 yyssa[YYINITDEPTH]; | |
| yytype_int16 *yyss; | |
| yytype_int16 *yyssp; | |
| /* The semantic value stack. */ | |
| YYSTYPE yyvsa[YYINITDEPTH]; | |
| YYSTYPE *yyvs; | |
| YYSTYPE *yyvsp; | |
| YYSIZE_T yystacksize; | |
| 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; | |
| /* Buffer for error messages, and its allocated size. */ | |
| char yymsgbuf[128]; | |
| char *yymsg = yymsgbuf; | |
| YYSIZE_T yymsg_alloc = sizeof yymsgbuf; | |
| /* 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; | |
| yyerrstatus = 0; | |
| yynerrs = 0; | |
| yychar = YYEMPTY; /* Cause a token to be read. */ | |
| /* Initialize stack pointers. | |
| Waste one element of value and location stack | |
| so that they stay on the same level as the state stack. | |
| The wasted elements are never initialized. */ | |
| yyssp = yyss; | |
| yyvsp = yyvs; | |
| goto yysetstate; | |
| /*------------------------------------------------------------. | |
| | yynewstate -- Push a new state, which is found in yystate. | | |
| `------------------------------------------------------------*/ | |
| yynewstate: | |
| /* In all cases, when you get here, the value and location stacks | |
| have just been pushed. So pushing a state here evens the stacks. */ | |
| yyssp++; | |
| yysetstate: | |
| *yyssp = yystate; | |
| if (yyss + yystacksize - 1 <= yyssp) | |
| { | |
| /* Get the current used size of the three stacks, in elements. */ | |
| YYSIZE_T yysize = yyssp - yyss + 1; | |
| { | |
| /* Give user a chance to reallocate the stack. Use copies of | |
| these so that the &'s don't force the real ones into | |
| memory. */ | |
| YYSTYPE *yyvs1 = yyvs; | |
| yytype_int16 *yyss1 = yyss; | |
| /* Each stack pointer address is followed by the size of the | |
| data in use in that stack, in bytes. This used to be a | |
| conditional around just the two extra args, but that might | |
| be undefined if yyoverflow is a macro. */ | |
| yyoverflow (YY_("memory exhausted"), | |
| &yyss1, yysize * sizeof (*yyssp), | |
| &yyvs1, yysize * sizeof (*yyvsp), | |
| &yystacksize); | |
| yyss = yyss1; | |
| yyvs = yyvs1; | |
| } | |
| goto yyexhaustedlab; | |
| /* Extend the stack our own way. */ | |
| if (YYMAXDEPTH <= yystacksize) | |
| goto yyexhaustedlab; | |
| yystacksize *= 2; | |
| if (YYMAXDEPTH < yystacksize) | |
| yystacksize = YYMAXDEPTH; | |
| { | |
| yytype_int16 *yyss1 = yyss; | |
| union yyalloc *yyptr = | |
| (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); | |
| if (! yyptr) | |
| goto yyexhaustedlab; | |
| YYSTACK_RELOCATE (yyss_alloc, yyss); | |
| YYSTACK_RELOCATE (yyvs_alloc, yyvs); | |
| if (yyss1 != yyssa) | |
| YYSTACK_FREE (yyss1); | |
| } | |
| yyssp = yyss + yysize - 1; | |
| yyvsp = yyvs + yysize - 1; | |
| YYDPRINTF ((stderr, "Stack size increased to %lu\n", | |
| (unsigned long int) yystacksize)); | |
| if (yyss + yystacksize - 1 <= yyssp) | |
| YYABORT; | |
| } | |
| YYDPRINTF ((stderr, "Entering state %d\n", yystate)); | |
| 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 (yyn == YYPACT_NINF) | |
| goto yydefault; | |
| /* Not known => get a lookahead token if don't already have one. */ | |
| /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ | |
| if (yychar == YYEMPTY) | |
| { | |
| YYDPRINTF ((stderr, "Reading a token: ")); | |
| yychar = YYLEX; | |
| } | |
| if (yychar <= YYEOF) | |
| { | |
| yychar = yytoken = YYEOF; | |
| YYDPRINTF ((stderr, "Now at end of input.\n")); | |
| } | |
| else | |
| { | |
| yytoken = YYTRANSLATE (yychar); | |
| YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); | |
| } | |
| /* If the proper action on seeing token YYTOKEN is to reduce or to | |
| detect an error, take that action. */ | |
| yyn += yytoken; | |
| if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) | |
| goto yydefault; | |
| yyn = yytable[yyn]; | |
| if (yyn <= 0) | |
| { | |
| if (yyn == 0 || yyn == YYTABLE_NINF) | |
| goto yyerrlab; | |
| yyn = -yyn; | |
| goto yyreduce; | |
| } | |
| /* 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); | |
| /* Discard the shifted token. */ | |
| yychar = YYEMPTY; | |
| yystate = yyn; | |
| *++yyvsp = yylval; | |
| 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]; | |
| YY_REDUCE_PRINT (yyn); | |
| switch (yyn) | |
| { | |
| case 5: | |
| /* Line 1455 of yacc.c */ | |
| { jsgf->name = (yyvsp[(2) - (2)].name); } | |
| break; | |
| case 7: | |
| /* Line 1455 of yacc.c */ | |
| { jsgf->version = (yyvsp[(2) - (3)].name); } | |
| break; | |
| case 8: | |
| /* Line 1455 of yacc.c */ | |
| { jsgf->version = (yyvsp[(2) - (4)].name); jsgf->charset = (yyvsp[(3) - (4)].name); } | |
| break; | |
| case 9: | |
| /* Line 1455 of yacc.c */ | |
| { jsgf->version = (yyvsp[(2) - (5)].name); jsgf->charset = (yyvsp[(3) - (5)].name); | |
| jsgf->locale = (yyvsp[(4) - (5)].name); } | |
| break; | |
| case 10: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.name) = (yyvsp[(2) - (3)].name); } | |
| break; | |
| case 13: | |
| /* Line 1455 of yacc.c */ | |
| { jsgf_import_rule(jsgf, (yyvsp[(2) - (3)].name)); ckd_free((yyvsp[(2) - (3)].name)); } | |
| break; | |
| case 16: | |
| /* Line 1455 of yacc.c */ | |
| { jsgf_define_rule(jsgf, (yyvsp[(1) - (4)].name), (yyvsp[(3) - (4)].rhs), 0); ckd_free((yyvsp[(1) - (4)].name)); } | |
| break; | |
| case 17: | |
| /* Line 1455 of yacc.c */ | |
| { jsgf_define_rule(jsgf, (yyvsp[(2) - (5)].name), (yyvsp[(4) - (5)].rhs), 1); ckd_free((yyvsp[(2) - (5)].name)); } | |
| break; | |
| case 18: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.rhs) = (yyvsp[(1) - (1)].rhs); (yyval.rhs)->atoms = glist_reverse((yyval.rhs)->atoms); } | |
| break; | |
| case 19: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.rhs) = (yyvsp[(3) - (3)].rhs); | |
| (yyval.rhs)->atoms = glist_reverse((yyval.rhs)->atoms); | |
| (yyval.rhs)->alt = (yyvsp[(1) - (3)].rhs); } | |
| break; | |
| case 20: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.rhs) = ckd_calloc(1, sizeof(*(yyval.rhs))); | |
| (yyval.rhs)->atoms = glist_add_ptr((yyval.rhs)->atoms, (yyvsp[(1) - (1)].atom)); } | |
| break; | |
| case 21: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.rhs) = (yyvsp[(1) - (2)].rhs); | |
| (yyval.rhs)->atoms = glist_add_ptr((yyval.rhs)->atoms, (yyvsp[(2) - (2)].atom)); } | |
| break; | |
| case 23: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.atom) = (yyvsp[(1) - (2)].atom); | |
| (yyval.atom)->tags = glist_add_ptr((yyval.atom)->tags, (yyvsp[(2) - (2)].name)); } | |
| break; | |
| case 25: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.atom) = (yyvsp[(2) - (2)].atom); (yyval.atom)->weight = (yyvsp[(1) - (2)].weight); } | |
| break; | |
| case 26: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.rule) = jsgf_define_rule(jsgf, NULL, (yyvsp[(2) - (3)].rhs), 0); } | |
| break; | |
| case 27: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.rule) = jsgf_optional_new(jsgf, (yyvsp[(2) - (3)].rhs)); } | |
| break; | |
| case 28: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.atom) = jsgf_atom_new((yyvsp[(1) - (1)].name), 1.0); ckd_free((yyvsp[(1) - (1)].name)); } | |
| break; | |
| case 29: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.atom) = jsgf_atom_new((yyvsp[(1) - (1)].name), 1.0); ckd_free((yyvsp[(1) - (1)].name)); } | |
| break; | |
| case 30: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.atom) = jsgf_atom_new((yyvsp[(1) - (1)].rule)->name, 1.0); } | |
| break; | |
| case 31: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.atom) = jsgf_atom_new((yyvsp[(1) - (1)].rule)->name, 1.0); } | |
| break; | |
| case 32: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.atom) = jsgf_kleene_new(jsgf, (yyvsp[(1) - (2)].atom), 0); } | |
| break; | |
| case 33: | |
| /* Line 1455 of yacc.c */ | |
| { (yyval.atom) = jsgf_kleene_new(jsgf, (yyvsp[(1) - (2)].atom), 1); } | |
| break; | |
| /* Line 1455 of yacc.c */ | |
| default: break; | |
| } | |
| YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); | |
| YYPOPSTACK (yylen); | |
| yylen = 0; | |
| YY_STACK_PRINT (yyss, yyssp); | |
| *++yyvsp = yyval; | |
| /* Now `shift' the result of the reduction. Determine what state | |
| that goes to, based on the state we popped back to and the rule | |
| number reduced by. */ | |
| yyn = yyr1[yyn]; | |
| yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; | |
| if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) | |
| yystate = yytable[yystate]; | |
| else | |
| yystate = yydefgoto[yyn - YYNTOKENS]; | |
| goto yynewstate; | |
| /*------------------------------------. | |
| | yyerrlab -- here on detecting error | | |
| `------------------------------------*/ | |
| yyerrlab: | |
| /* If not already recovering from an error, report this error. */ | |
| if (!yyerrstatus) | |
| { | |
| ++yynerrs; | |
| yyerror (yyscanner, jsgf, YY_("syntax error")); | |
| { | |
| YYSIZE_T yysize = yysyntax_error (0, yystate, yychar); | |
| if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM) | |
| { | |
| YYSIZE_T yyalloc = 2 * yysize; | |
| if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM)) | |
| yyalloc = YYSTACK_ALLOC_MAXIMUM; | |
| if (yymsg != yymsgbuf) | |
| YYSTACK_FREE (yymsg); | |
| yymsg = (char *) YYSTACK_ALLOC (yyalloc); | |
| if (yymsg) | |
| yymsg_alloc = yyalloc; | |
| else | |
| { | |
| yymsg = yymsgbuf; | |
| yymsg_alloc = sizeof yymsgbuf; | |
| } | |
| } | |
| if (0 < yysize && yysize <= yymsg_alloc) | |
| { | |
| (void) yysyntax_error (yymsg, yystate, yychar); | |
| yyerror (yyscanner, jsgf, yymsg); | |
| } | |
| else | |
| { | |
| yyerror (yyscanner, jsgf, YY_("syntax error")); | |
| if (yysize != 0) | |
| goto yyexhaustedlab; | |
| } | |
| } | |
| } | |
| if (yyerrstatus == 3) | |
| { | |
| /* If just tried and failed to reuse lookahead token after an | |
| error, discard it. */ | |
| if (yychar <= YYEOF) | |
| { | |
| /* Return failure if at end of input. */ | |
| if (yychar == YYEOF) | |
| YYABORT; | |
| } | |
| else | |
| { | |
| yydestruct ("Error: discarding", | |
| yytoken, &yylval, yyscanner, jsgf); | |
| yychar = YYEMPTY; | |
| } | |
| } | |
| /* Else will try to reuse lookahead token after shifting the error | |
| token. */ | |
| goto yyerrlab1; | |
| /*---------------------------------------------------. | |
| | yyerrorlab -- error raised explicitly by YYERROR. | | |
| `---------------------------------------------------*/ | |
| yyerrorlab: | |
| /* Pacify compilers like GCC when the user code never invokes | |
| YYERROR and the label yyerrorlab therefore never appears in user | |
| code. */ | |
| if (/*CONSTCOND*/ 0) | |
| goto yyerrorlab; | |
| /* Do not reclaim the symbols of the rule which action triggered | |
| this YYERROR. */ | |
| YYPOPSTACK (yylen); | |
| yylen = 0; | |
| YY_STACK_PRINT (yyss, yyssp); | |
| yystate = *yyssp; | |
| goto yyerrlab1; | |
| /*-------------------------------------------------------------. | |
| | yyerrlab1 -- common code for both syntax error and YYERROR. | | |
| `-------------------------------------------------------------*/ | |
| yyerrlab1: | |
| yyerrstatus = 3; /* Each real token shifted decrements this. */ | |
| for (;;) | |
| { | |
| yyn = yypact[yystate]; | |
| if (yyn != YYPACT_NINF) | |
| { | |
| yyn += YYTERROR; | |
| if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) | |
| { | |
| yyn = yytable[yyn]; | |
| if (0 < yyn) | |
| break; | |
| } | |
| } | |
| /* Pop the current state because it cannot handle the error token. */ | |
| if (yyssp == yyss) | |
| YYABORT; | |
| yydestruct ("Error: popping", | |
| yystos[yystate], yyvsp, yyscanner, jsgf); | |
| YYPOPSTACK (1); | |
| yystate = *yyssp; | |
| YY_STACK_PRINT (yyss, yyssp); | |
| } | |
| *++yyvsp = yylval; | |
| /* Shift the error token. */ | |
| YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); | |
| yystate = yyn; | |
| goto yynewstate; | |
| /*-------------------------------------. | |
| | yyacceptlab -- YYACCEPT comes here. | | |
| `-------------------------------------*/ | |
| yyacceptlab: | |
| yyresult = 0; | |
| goto yyreturn; | |
| /*-----------------------------------. | |
| | yyabortlab -- YYABORT comes here. | | |
| `-----------------------------------*/ | |
| yyabortlab: | |
| yyresult = 1; | |
| goto yyreturn; | |
| /*-------------------------------------------------. | |
| | yyexhaustedlab -- memory exhaustion comes here. | | |
| `-------------------------------------------------*/ | |
| yyexhaustedlab: | |
| yyerror (yyscanner, jsgf, YY_("memory exhausted")); | |
| yyresult = 2; | |
| /* Fall through. */ | |
| yyreturn: | |
| if (yychar != YYEMPTY) | |
| yydestruct ("Cleanup: discarding lookahead", | |
| yytoken, &yylval, yyscanner, jsgf); | |
| /* 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, yyscanner, jsgf); | |
| YYPOPSTACK (1); | |
| } | |
| if (yyss != yyssa) | |
| YYSTACK_FREE (yyss); | |
| if (yymsg != yymsgbuf) | |
| YYSTACK_FREE (yymsg); | |
| /* Make sure YYID is used. */ | |
| return YYID (yyresult); | |
| } | |
| /* Line 1675 of yacc.c */ | |
| void | |
| yyerror(yyscan_t lex, jsgf_t *jsgf, const char *s) | |
| { | |
| (void)jsgf; | |
| E_ERROR("%s at line %d current token '%s'\n", s, yyget_lineno(lex), yyget_text(lex)); | |
| } | |