Download OpenTimer_OpenTimer/ot/sdc/json/c/json.tab.c from SAIFIINDUSTRIES/verilog_data-2: direct link, hf CLI and curl.
- Browser
- Download file 56.6 kB
-
https://huggingface.co/datasets/SAIFIINDUSTRIES/verilog_data-2/resolve/main/OpenTimer_OpenTimer/ot/sdc/json/c/json.tab.c
- Command line
-
hf download hf://datasets/SAIFIINDUSTRIES/verilog_data-2/OpenTimer_OpenTimer/ot/sdc/json/c/json.tab.c
-
curl -L -o json.tab.c https://huggingface.co/datasets/SAIFIINDUSTRIES/verilog_data-2/resolve/main/OpenTimer_OpenTimer/ot/sdc/json/c/json.tab.c
56.6 kB
| /* A Bison parser, made by GNU Bison 3.0.2. */ | |
| /* Bison implementation for Yacc-like parsers in C | |
| Copyright (C) 1984, 1989-1990, 2000-2013 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. */ | |
| /* Copy the first part of user declarations. */ | |
| /* * ** *** ***** ******** ************* ********************* */ | |
| typedef union YYSTYPE YYSTYPE; | |
| static void jsonerror (struct context *, const char *); | |
| static int jsonlexp (YYSTYPE *lvalp, struct context *context); | |
| /* * ** *** ***** ******** ************* ********************* | |
| ** User declarations <EOF> | |
| */ | |
| /* Enabling verbose error messages. */ | |
| /* Debug traces. */ | |
| extern int yydebug; | |
| /* Token type. */ | |
| enum yytokentype | |
| { | |
| STRING = 258, | |
| CONSTANT = 259 | |
| }; | |
| /* Value type. */ | |
| typedef union YYSTYPE YYSTYPE; | |
| union YYSTYPE | |
| { | |
| Tcl_Obj *obj; | |
| struct { | |
| Tcl_Obj *key; | |
| Tcl_Obj *val; | |
| } keyval; | |
| }; | |
| int yyparse (struct context* context); | |
| /* Copy the second part of user declarations. */ | |
| typedef YYTYPE_UINT8 yytype_uint8; | |
| typedef unsigned char yytype_uint8; | |
| typedef YYTYPE_INT8 yytype_int8; | |
| typedef signed char 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. */ | |
| /* Suppress an incorrect diagnostic about yylval being uninitialized. */ | |
| /* The parser invokes alloca or malloc; define the necessary symbols. */ | |
| /* Use EXIT_SUCCESS as a witness for stdlib.h. */ | |
| /* 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. */ | |
| /* 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. */ | |
| /* Copy COUNT objects from SRC to DST. The source and destination do | |
| not overlap. */ | |
| /* YYFINAL -- State number of the termination state. */ | |
| /* YYLAST -- Last index in YYTABLE. */ | |
| /* YYNTOKENS -- Number of terminals. */ | |
| /* YYNNTS -- Number of nonterminals. */ | |
| /* YYNRULES -- Number of rules. */ | |
| /* YYNSTATES -- Number of states. */ | |
| /* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned | |
| by yylex, with out-of-bounds checking. */ | |
| /* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM | |
| as returned by yylex, without out-of-bounds checking. */ | |
| static const yytype_uint8 yytranslate[] = | |
| { | |
| 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 9, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 10, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 7, 2, 8, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 5, 2, 6, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 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 | |
| }; | |
| /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */ | |
| static const yytype_uint8 yyrline[] = | |
| { | |
| 0, 65, 65, 76, 79, 83, 89, 93, 99, 103, | |
| 110, 116, 124, 131, 137, 141, 142, 143 | |
| }; | |
| /* 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", "STRING", "CONSTANT", "'{'", "'}'", | |
| "'['", "']'", "','", "':'", "$accept", "tree", "json", "object", "list", | |
| "values", "members", "member", "string", "value", YY_NULLPTR | |
| }; | |
| /* YYTOKNUM[NUM] -- (External) token number corresponding to the | |
| (internal) symbol number NUM (which must be that of a token). */ | |
| static const yytype_uint16 yytoknum[] = | |
| { | |
| 0, 256, 257, 258, 259, 123, 125, 91, 93, 44, | |
| 58 | |
| }; | |
| /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing | |
| STATE-NUM. */ | |
| static const yytype_int8 yypact[] = | |
| { | |
| 5, -6, -6, 8, -1, 15, -6, -6, -6, -6, | |
| -6, -6, 7, -6, -5, -6, 12, -6, -6, -6, | |
| 19, 5, -6, 5, -6, -6, -6 | |
| }; | |
| /* 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_uint8 yydefact[] = | |
| { | |
| 0, 13, 14, 0, 0, 0, 2, 16, 17, 15, | |
| 3, 5, 0, 10, 0, 7, 0, 8, 1, 4, | |
| 0, 0, 6, 0, 11, 12, 9 | |
| }; | |
| /* YYPGOTO[NTERM-NUM]. */ | |
| static const yytype_int8 yypgoto[] = | |
| { | |
| -6, -6, -6, -6, -6, -6, -6, 3, -2, -4 | |
| }; | |
| /* YYDEFGOTO[NTERM-NUM]. */ | |
| static const yytype_int8 yydefgoto[] = | |
| { | |
| -1, 5, 6, 7, 8, 16, 12, 13, 9, 10 | |
| }; | |
| /* 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_uint8 yytable[] = | |
| { | |
| 17, 14, 1, 2, 3, 21, 4, 15, 1, 2, | |
| 3, 1, 4, 19, 11, 18, 20, 25, 14, 26, | |
| 22, 23, 1, 24 | |
| }; | |
| static const yytype_uint8 yycheck[] = | |
| { | |
| 4, 3, 3, 4, 5, 10, 7, 8, 3, 4, | |
| 5, 3, 7, 6, 6, 0, 9, 21, 20, 23, | |
| 8, 9, 3, 20 | |
| }; | |
| /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing | |
| symbol of state STATE-NUM. */ | |
| static const yytype_uint8 yystos[] = | |
| { | |
| 0, 3, 4, 5, 7, 12, 13, 14, 15, 19, | |
| 20, 6, 17, 18, 19, 8, 16, 20, 0, 6, | |
| 9, 10, 8, 9, 18, 20, 20 | |
| }; | |
| /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ | |
| static const yytype_uint8 yyr1[] = | |
| { | |
| 0, 11, 12, 13, 14, 14, 15, 15, 16, 16, | |
| 17, 17, 18, 19, 20, 20, 20, 20 | |
| }; | |
| /* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */ | |
| static const yytype_uint8 yyr2[] = | |
| { | |
| 0, 2, 1, 1, 3, 2, 3, 2, 1, 3, | |
| 1, 3, 3, 1, 1, 1, 1, 1 | |
| }; | |
| /* Error token number */ | |
| /* Enable debugging if requested. */ | |
| /* This macro is provided for backward compatibility. */ | |
| /*----------------------------------------. | |
| | Print this symbol's value on YYOUTPUT. | | |
| `----------------------------------------*/ | |
| static void | |
| yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, struct context* context) | |
| { | |
| FILE *yyo = yyoutput; | |
| YYUSE (yyo); | |
| YYUSE (context); | |
| if (!yyvaluep) | |
| return; | |
| if (yytype < YYNTOKENS) | |
| YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); | |
| YYUSE (yytype); | |
| } | |
| /*--------------------------------. | |
| | Print this symbol on YYOUTPUT. | | |
| `--------------------------------*/ | |
| static void | |
| yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, struct context* context) | |
| { | |
| YYFPRINTF (yyoutput, "%s %s (", | |
| yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]); | |
| yy_symbol_value_print (yyoutput, yytype, yyvaluep, context); | |
| 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) | |
| { | |
| 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 (yytype_int16 *yyssp, YYSTYPE *yyvsp, int yyrule, struct context* context) | |
| { | |
| unsigned long int yylno = yyrline[yyrule]; | |
| int yynrhs = yyr2[yyrule]; | |
| int yyi; | |
| 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, | |
| yystos[yyssp[yyi + 1 - yynrhs]], | |
| &(yyvsp[(yyi + 1) - (yynrhs)]) | |
| , context); | |
| 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) | |
| { | |
| 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) | |
| { | |
| 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 *YYMSG, which is of size *YYMSG_ALLOC, an error message | |
| about the unexpected token YYTOKEN for the state stack whose top is | |
| YYSSP. | |
| Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is | |
| not large enough to hold the message. In that case, also set | |
| *YYMSG_ALLOC to the required number of bytes. Return 2 if the | |
| required number of bytes is too large to store. */ | |
| static int | |
| yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg, | |
| yytype_int16 *yyssp, int yytoken) | |
| { | |
| YYSIZE_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]); | |
| YYSIZE_T yysize = yysize0; | |
| enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; | |
| /* Internationalized format string. */ | |
| const char *yyformat = YY_NULLPTR; | |
| /* Arguments of yyformat. */ | |
| char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; | |
| /* Number of reported tokens (one for the "unexpected", one per | |
| "expected"). */ | |
| int yycount = 0; | |
| /* There are many possibilities here to consider: | |
| - If this state is a consistent state with a default action, then | |
| the only way this function was invoked is if the default action | |
| is an error action. In that case, don't check for expected | |
| tokens because there are none. | |
| - The only way there can be no lookahead present (in yychar) is if | |
| this state is a consistent state with a default action. Thus, | |
| detecting the absence of a lookahead is sufficient to determine | |
| that there is no unexpected or expected token to report. In that | |
| case, just report a simple "syntax error". | |
| - Don't assume there isn't a lookahead just because this state is a | |
| consistent state with a default action. There might have been a | |
| previous inconsistent state, consistent state with a non-default | |
| action, or user semantic action that manipulated yychar. | |
| - Of course, the expected token list depends on states to have | |
| correct lookahead information, and it depends on the parser not | |
| to perform extra reductions after fetching a lookahead from the | |
| scanner and before detecting a syntax error. Thus, state merging | |
| (from LALR or IELR) and default reductions corrupt the expected | |
| token list. However, the list is correct for canonical LR with | |
| one exception: it will still contain any token that will not be | |
| accepted due to an error action in a later state. | |
| */ | |
| if (yytoken != YYEMPTY) | |
| { | |
| int yyn = yypact[*yyssp]; | |
| yyarg[yycount++] = yytname[yytoken]; | |
| if (!yypact_value_is_default (yyn)) | |
| { | |
| /* Start YYX at -YYN if negative to avoid negative indexes in | |
| YYCHECK. In other words, skip the first -YYN actions for | |
| this state because they are default actions. */ | |
| int yyxbegin = yyn < 0 ? -yyn : 0; | |
| /* Stay within bounds of both yycheck and yytname. */ | |
| int yychecklim = YYLAST - yyn + 1; | |
| int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; | |
| int yyx; | |
| for (yyx = yyxbegin; yyx < yyxend; ++yyx) | |
| if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR | |
| && !yytable_value_is_error (yytable[yyx + yyn])) | |
| { | |
| if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) | |
| { | |
| yycount = 1; | |
| yysize = yysize0; | |
| break; | |
| } | |
| yyarg[yycount++] = yytname[yyx]; | |
| { | |
| YYSIZE_T yysize1 = yysize + yytnamerr (YY_NULLPTR, yytname[yyx]); | |
| if (! (yysize <= yysize1 | |
| && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) | |
| return 2; | |
| yysize = yysize1; | |
| } | |
| } | |
| } | |
| } | |
| switch (yycount) | |
| { | |
| YYCASE_(0, YY_("syntax error")); | |
| YYCASE_(1, YY_("syntax error, unexpected %s")); | |
| YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s")); | |
| YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s")); | |
| YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s")); | |
| YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s")); | |
| } | |
| { | |
| YYSIZE_T yysize1 = yysize + yystrlen (yyformat); | |
| if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) | |
| return 2; | |
| yysize = yysize1; | |
| } | |
| if (*yymsg_alloc < yysize) | |
| { | |
| *yymsg_alloc = 2 * yysize; | |
| if (! (yysize <= *yymsg_alloc | |
| && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM)) | |
| *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM; | |
| return 1; | |
| } | |
| /* Avoid sprintf, as that infringes on the user's name space. | |
| Don't have undefined behavior even if the translation | |
| produced a string with the wrong number of "%s"s. */ | |
| { | |
| char *yyp = *yymsg; | |
| int yyi = 0; | |
| while ((*yyp = *yyformat) != '\0') | |
| if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount) | |
| { | |
| yyp += yytnamerr (yyp, yyarg[yyi++]); | |
| yyformat += 2; | |
| } | |
| else | |
| { | |
| yyp++; | |
| yyformat++; | |
| } | |
| } | |
| return 0; | |
| } | |
| /*-----------------------------------------------. | |
| | Release the memory associated to this symbol. | | |
| `-----------------------------------------------*/ | |
| static void | |
| yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep, struct context* context) | |
| { | |
| YYUSE (yyvaluep); | |
| YYUSE (context); | |
| if (!yymsg) | |
| yymsg = "Deleting"; | |
| YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); | |
| YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN | |
| YYUSE (yytype); | |
| YY_IGNORE_MAYBE_UNINITIALIZED_END | |
| } | |
| /*----------. | |
| | yyparse. | | |
| `----------*/ | |
| int | |
| yyparse (struct context* context) | |
| { | |
| /* The lookahead symbol. */ | |
| 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); | |
| /* 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 through 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 = 0; | |
| /* 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; | |
| yyssp = yyss = yyssa; | |
| yyvsp = yyvs = yyvsa; | |
| yystacksize = YYINITDEPTH; | |
| YYDPRINTF ((stderr, "Starting parse\n")); | |
| yystate = 0; | |
| yyerrstatus = 0; | |
| yynerrs = 0; | |
| yychar = YYEMPTY; /* Cause a token to be read. */ | |
| 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 (yypact_value_is_default (yyn)) | |
| 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 (&yylval, context); | |
| } | |
| 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 (yytable_value_is_error (yyn)) | |
| 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; | |
| YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN | |
| *++yyvsp = yylval; | |
| YY_IGNORE_MAYBE_UNINITIALIZED_END | |
| 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 2: | |
| { | |
| REDUCE("TREE"); | |
| if (context->I) { | |
| Tcl_SetObjResult(context->I, (yyvsp[0].obj)); | |
| TRACE ((" RESULT (%s)\n", Tcl_GetString((yyvsp[0].obj)))); | |
| } | |
| context->result = TCL_OK; | |
| } | |
| break; | |
| case 4: | |
| { | |
| (yyval.obj) = (yyvsp[-1].obj); | |
| } | |
| break; | |
| case 5: | |
| { | |
| (yyval.obj) = Tcl_NewObj(); | |
| } | |
| break; | |
| case 6: | |
| { | |
| (yyval.obj) = (yyvsp[-1].obj); | |
| } | |
| break; | |
| case 7: | |
| { | |
| (yyval.obj) = Tcl_NewObj(); | |
| } | |
| break; | |
| case 8: | |
| { | |
| (yyval.obj) = Tcl_NewListObj(1, &(yyvsp[0].obj)); | |
| } | |
| break; | |
| case 9: | |
| { | |
| Tcl_ListObjAppendElement(NULL, (yyvsp[-2].obj), (yyvsp[0].obj)); | |
| (yyval.obj) = (yyvsp[-2].obj); | |
| } | |
| break; | |
| case 10: | |
| { | |
| (yyval.obj) = Tcl_NewListObj(0, NULL); | |
| Tcl_ListObjAppendElement(NULL, (yyval.obj), (yyvsp[0].keyval).key); | |
| Tcl_ListObjAppendElement(NULL, (yyval.obj), (yyvsp[0].keyval).val); | |
| } | |
| break; | |
| case 11: | |
| { | |
| Tcl_ListObjAppendElement(NULL, (yyvsp[-2].obj), (yyvsp[0].keyval).key); | |
| Tcl_ListObjAppendElement(NULL, (yyvsp[-2].obj), (yyvsp[0].keyval).val); | |
| (yyval.obj) = (yyvsp[-2].obj); | |
| } | |
| break; | |
| case 12: | |
| { | |
| (yyval.keyval).key = (yyvsp[-2].obj); | |
| (yyval.keyval).val = (yyvsp[0].obj); | |
| } | |
| break; | |
| case 13: | |
| { | |
| (yyval.obj) = context->obj; | |
| } | |
| break; | |
| case 14: | |
| { | |
| (yyval.obj) = context->obj; | |
| } | |
| break; | |
| default: break; | |
| } | |
| /* User semantic actions sometimes alter yychar, and that requires | |
| that yytoken be updated with the new translation. We take the | |
| approach of translating immediately before every use of yytoken. | |
| One alternative is translating here after every semantic action, | |
| but that translation would be missed if the semantic action invokes | |
| YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or | |
| if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an | |
| incorrect destructor might then be invoked immediately. In the | |
| case of YYERROR or YYBACKUP, subsequent parser actions might lead | |
| to an incorrect destructor call or verbose syntax error message | |
| before the lookahead is translated. */ | |
| YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); | |
| YYPOPSTACK (yylen); | |
| yylen = 0; | |
| YY_STACK_PRINT (yyss, yyssp); | |
| *++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: | |
| /* Make sure we have latest lookahead translation. See comments at | |
| user semantic actions for why this is necessary. */ | |
| yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar); | |
| /* If not already recovering from an error, report this error. */ | |
| if (!yyerrstatus) | |
| { | |
| ++yynerrs; | |
| yyerror (context, YY_("syntax error")); | |
| { | |
| char const *yymsgp = YY_("syntax error"); | |
| int yysyntax_error_status; | |
| yysyntax_error_status = YYSYNTAX_ERROR; | |
| if (yysyntax_error_status == 0) | |
| yymsgp = yymsg; | |
| else if (yysyntax_error_status == 1) | |
| { | |
| if (yymsg != yymsgbuf) | |
| YYSTACK_FREE (yymsg); | |
| yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc); | |
| if (!yymsg) | |
| { | |
| yymsg = yymsgbuf; | |
| yymsg_alloc = sizeof yymsgbuf; | |
| yysyntax_error_status = 2; | |
| } | |
| else | |
| { | |
| yysyntax_error_status = YYSYNTAX_ERROR; | |
| yymsgp = yymsg; | |
| } | |
| } | |
| yyerror (context, yymsgp); | |
| if (yysyntax_error_status == 2) | |
| 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, context); | |
| 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 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. */ | |
| for (;;) | |
| { | |
| yyn = yypact[yystate]; | |
| if (!yypact_value_is_default (yyn)) | |
| { | |
| 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, context); | |
| YYPOPSTACK (1); | |
| yystate = *yyssp; | |
| YY_STACK_PRINT (yyss, yyssp); | |
| } | |
| YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN | |
| *++yyvsp = yylval; | |
| YY_IGNORE_MAYBE_UNINITIALIZED_END | |
| /* 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 (context, YY_("memory exhausted")); | |
| yyresult = 2; | |
| /* Fall through. */ | |
| yyreturn: | |
| if (yychar != YYEMPTY) | |
| { | |
| /* Make sure we have latest lookahead translation. See comments at | |
| user semantic actions for why this is necessary. */ | |
| yytoken = YYTRANSLATE (yychar); | |
| yydestruct ("Cleanup: discarding lookahead", | |
| yytoken, &yylval, context); | |
| } | |
| /* 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", | |
| yystos[*yyssp], yyvsp, context); | |
| YYPOPSTACK (1); | |
| } | |
| if (yyss != yyssa) | |
| YYSTACK_FREE (yyss); | |
| if (yymsg != yymsgbuf) | |
| YYSTACK_FREE (yymsg); | |
| return yyresult; | |
| } | |
| /* * ** *** ***** ******** ************* ********************* | |
| ** User definitions | |
| */ | |
| void | |
| jsonparse (struct context* context) | |
| { | |
| yyparse (context); | |
| } | |
| void | |
| jsonskip(struct context *context) | |
| { | |
| while (context->remaining) { | |
| switch (*context->text) { | |
| case '\n': | |
| case ' ': | |
| case '\t': | |
| case '\r': | |
| DRAIN(1); | |
| continue; | |
| } | |
| break; | |
| } | |
| } | |
| static int | |
| jsonlexp(YYSTYPE *lvalp, struct context *context) | |
| { | |
| const char *bp = NULL; | |
| /* Question: Why not plain numbers 1,2 for the states | |
| * but these specific hex patterns ? | |
| */ | |
| enum { | |
| PLAIN = 0x0000ff00, | |
| INSTR = 0x00ff0000 | |
| } lstate; | |
| double d; | |
| char *end; | |
| const char *p; | |
| int initialized = 0; | |
| /* | |
| * Do not auto-lex beyond a full json structure. | |
| */ | |
| if (context->result == TCL_OK) { | |
| TOKEN ("<<eof>>"); | |
| return 0; | |
| } | |
| /* | |
| * Quickly skip and ignore whitespace. | |
| */ | |
| while (context->remaining) { | |
| switch (*context->text) { | |
| case '\n': | |
| case ' ': | |
| case '\t': | |
| case '\r': | |
| DRAIN(1); | |
| continue; | |
| } | |
| break; | |
| } | |
| /* | |
| * Handle the token following the whitespace. Small state machine to | |
| * handle strings and escapes in them, and bare words (various | |
| * contants, and numbers). | |
| */ | |
| for (lstate = PLAIN; context->remaining > 0; DRAIN(1)) { | |
| if (lstate == INSTR) { | |
| if (*context->text == '"') { | |
| /* | |
| * End of quoted string | |
| */ | |
| STORESTRINGSEGMENT(); | |
| DRAIN(1); | |
| TOKEN1 ("STRING"); | |
| return STRING; | |
| } | |
| if (*context->text == '\\') { | |
| /* | |
| * Escaped sequence. The 9 sequences specified at json.org | |
| * are: | |
| * \" \\ \/ \b \f \n \r \t \uXXXX | |
| */ | |
| char buf[TCL_UTF_MAX]; | |
| int len, consumed; | |
| STORESTRINGSEGMENT(); | |
| /* | |
| * Perform additional checks to restrict the set of accepted | |
| * escape sequence to what is allowed by json.org instead of | |
| * Tcl_UtfBackslash. | |
| */ | |
| if (!HAVE(1)) { | |
| Tcl_AppendToObj(context->obj, "\\", 1); | |
| yyerror(context,"incomplete escape at <<eof> error"); | |
| TOKEN("incomplete escape at <<eof>> error"); | |
| return -1; | |
| } | |
| switch (context->text[1]) { | |
| case '"': | |
| case '\\': | |
| case '/': | |
| case 'b': | |
| case 'f': | |
| case 'n': | |
| case 'r': | |
| case 't': | |
| break; | |
| case 'u': | |
| if (!HAVE(5)) { | |
| Tcl_AppendToObj(context->obj, "\\u", 2); | |
| yyerror(context,"incomplete escape at <<eof> error"); | |
| TOKEN("incomplete escape at <<eof>> error"); | |
| return -1; | |
| } | |
| break; | |
| default: | |
| Tcl_AppendToObj(context->obj, context->text + 1, 1); | |
| yyerror(context,"bad escape"); | |
| TOKEN("bad escape"); | |
| return -1; | |
| } | |
| /* | |
| * XXX Tcl_UtfBackslash() may be more | |
| * XXX permissive, than JSON standard. | |
| * XXX But that may be a good thing: | |
| * XXX "be generous in what you accept". | |
| */ | |
| len = Tcl_UtfBackslash(context->text, | |
| &consumed, buf); | |
| DRAIN(consumed - 1); | |
| bp = context->text + 1; | |
| Tcl_AppendToObj(context->obj, buf, len); | |
| } | |
| continue; | |
| } | |
| switch (*context->text) { | |
| case ',': | |
| case '{': | |
| case ':': | |
| case '}': | |
| case '[': | |
| case ']': | |
| DRAIN(1); | |
| TOKEN (context->text[-1]); | |
| return context->text[-1]; | |
| case 't': | |
| if ((context->remaining < 4) || | |
| strncmp("rue", context->text + 1, 3)) | |
| goto bareword; | |
| DRAIN(4); | |
| context->obj = TRUE_O; | |
| TOKEN1 ("CONSTANT"); | |
| return CONSTANT; | |
| case 'f': | |
| if ((context->remaining < 5) || | |
| strncmp("alse", context->text + 1, 4)) | |
| goto bareword; | |
| DRAIN(5); | |
| context->obj = FALSE_O; | |
| TOKEN1 ("CONSTANT"); | |
| return CONSTANT; | |
| case 'n': | |
| if ((context->remaining < 4) || | |
| strncmp("ull", context->text + 1, 3)) | |
| goto bareword; | |
| DRAIN(4); | |
| context->obj = NULL_O; | |
| TOKEN1 ("CONSTANT"); | |
| return CONSTANT; | |
| case '"': | |
| bp = context->text + 1; | |
| lstate = INSTR; | |
| continue; | |
| case '\\': | |
| yyerror(context,"Escape character outside of string"); | |
| TOKEN ("escape error"); | |
| return -1; | |
| } | |
| /* | |
| * We already considered the null, true, and false | |
| * above, so it can only be a number now. | |
| * | |
| * NOTE: At this point we do not care about double | |
| * versus integer, nor about the possible integer | |
| * range. We generate a plain string Tcl_Obj and leave | |
| * it to the user of the generated structure to | |
| * convert to a number when actually needed. This | |
| * defered conversion also ensures that the Tcl and | |
| * platform we are building against does not matter | |
| * regarding integer range, only the abilities of the | |
| * Tcl at runtime. | |
| */ | |
| d = strtod(context->text, &end); | |
| if (end == context->text) | |
| goto bareword; /* Nothing parsed */ | |
| context->obj = Tcl_NewStringObj (context->text, | |
| end - context->text); | |
| context->remaining -= (end - context->text); | |
| context->text = end; | |
| TOKEN1 ("CONSTANT"); | |
| return CONSTANT; | |
| } | |
| TOKEN ("<<eof>>"); | |
| return 0; | |
| bareword: | |
| yyerror(context,"Bare word encountered"); | |
| TOKEN ("bare word error"); | |
| return -1; | |
| } | |
| int | |
| jsonlex(struct context *context) | |
| { | |
| const char *bp = NULL; | |
| /* Question: Why not plain numbers 1,2 for the states | |
| * but these specific hex patterns ? | |
| */ | |
| enum { | |
| PLAIN = 0x0000ff00, | |
| INSTR = 0x00ff0000 | |
| } lstate; | |
| double d; | |
| char *end; | |
| const char *p; | |
| int initialized = 0; | |
| while (context->remaining) { | |
| /* Iterate over the whole string and check all tokens. | |
| * Nothing else. | |
| */ | |
| /* | |
| * Quickly skip and ignore whitespace. | |
| */ | |
| while (context->remaining) { | |
| switch (*context->text) { | |
| case '\n': | |
| case ' ': | |
| case '\t': | |
| case '\r': | |
| DRAIN(1); | |
| continue; | |
| } | |
| break; | |
| } | |
| /* | |
| * Handle the token following the whitespace. Small state machine to | |
| * handle strings and escapes in them, and bare words (various | |
| * contants, and numbers). | |
| */ | |
| for (lstate = PLAIN; context->remaining > 0; DRAIN(1)) { | |
| if (lstate == INSTR) { | |
| if (*context->text == '"') { | |
| /* | |
| * End of quoted string | |
| */ | |
| DRAIN(1); | |
| goto next_token; | |
| } | |
| if (*context->text == '\\') { | |
| /* | |
| * Escaped sequence | |
| */ | |
| char buf[TCL_UTF_MAX]; | |
| int len, consumed; | |
| /* | |
| * XXX Tcl_UtfBackslash() may be more | |
| * XXX permissive, than JSON standard. | |
| * XXX But that may be a good thing: | |
| * XXX "be generous in what you accept". | |
| */ | |
| len = Tcl_UtfBackslash(context->text, &consumed, buf); | |
| DRAIN(consumed - 1); | |
| } | |
| continue; | |
| } | |
| switch (*context->text) { | |
| case ',': | |
| case '{': | |
| case ':': | |
| case '}': | |
| case '[': | |
| case ']': | |
| DRAIN(1); | |
| goto next_token; | |
| case 't': | |
| if ((context->remaining < 4) || | |
| strncmp("rue", context->text + 1, 3)) | |
| return -1; /* bare word */ | |
| DRAIN(4); | |
| goto next_token; | |
| case 'f': | |
| if ((context->remaining < 5) || | |
| strncmp("alse", context->text + 1, 4)) | |
| return -1; /* bare word */ | |
| DRAIN(5); | |
| goto next_token; | |
| case 'n': | |
| if ((context->remaining < 4) || | |
| strncmp("ull", context->text + 1, 3)) | |
| return -1; /* bare word */ | |
| DRAIN(4); | |
| goto next_token; | |
| case '"': | |
| bp = context->text + 1; | |
| lstate = INSTR; | |
| continue; | |
| case '\\': | |
| /* Escape outside string, abort. */ | |
| return -1; | |
| } | |
| /* | |
| * We already considered the null, true, and false | |
| * above, so it can only be a number now. | |
| * | |
| * NOTE: At this point we do not care about double | |
| * versus integer, nor about the possible integer | |
| * range. We generate a plain string Tcl_Obj and leave | |
| * it to the user of the generated structure to | |
| * convert to a number when actually needed. This | |
| * defered conversion also ensures that the Tcl and | |
| * platform we are building against does not matter | |
| * regarding integer range, only the abilities of the | |
| * Tcl at runtime. | |
| */ | |
| d = strtod(context->text, &end); | |
| if (end == context->text) | |
| return -1; /* bare word */ | |
| context->remaining -= (end - context->text); | |
| context->text = end; | |
| goto next_token; | |
| } | |
| return 0; | |
| next_token: | |
| continue; | |
| } | |
| } | |
| static void | |
| jsonerror(struct context *context, const char *message) | |
| { | |
| char *fullmessage; | |
| char *yytext; | |
| int yyleng; | |
| if (context->has_error) return; | |
| if (context->obj) { | |
| yytext = Tcl_GetStringFromObj(context->obj, &yyleng); | |
| fullmessage = Tcl_Alloc(strlen(message) + 63 + yyleng); | |
| sprintf(fullmessage, "%s %d bytes before end, around ``%.*s''", | |
| message, context->remaining, yyleng, yytext); | |
| } else { | |
| fullmessage = Tcl_Alloc(strlen(message) + 63); | |
| sprintf(fullmessage, "%s %d bytes before end", | |
| message, context->remaining); | |
| } | |
| TRACE ((">>> %s\n",fullmessage)); | |
| Tcl_SetResult (context->I, fullmessage, TCL_DYNAMIC); | |
| Tcl_SetErrorCode (context->I, "JSON", "SYNTAX", NULL); | |
| context->has_error = 1; | |
| } | |