diff --git a/jv_utf8_tables.gen.h b/jv_utf8_tables.gen.h new file mode 100644 index 00000000..24d9a63a --- /dev/null +++ b/jv_utf8_tables.gen.h @@ -0,0 +1,35 @@ +#define UTF8_CONTINUATION_BYTE ((unsigned char)255) +static const unsigned char utf8_coding_length[] = + {0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, + 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, + 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, + 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, + 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, + 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, + 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, + 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, + 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, + 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, + 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, + 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, + 0x00, 0x00, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, + 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, + 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, + 0x04, 0x04, 0x04, 0x04, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}; +static const unsigned char utf8_coding_bits[] = + {0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, + 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, + 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, + 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, + 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, + 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, + 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, + 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, + 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, + 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, + 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, + 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, + 0x00, 0x00, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, + 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, 0x1f, + 0x0f, 0x0f, 0x0f, 0x0f, 0x0f, 0x0f, 0x0f, 0x0f, 0x0f, 0x0f, 0x0f, 0x0f, 0x0f, 0x0f, 0x0f, 0x0f, + 0x07, 0x07, 0x07, 0x07, 0x07, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}; diff --git a/lexer.gen.c b/lexer.gen.c new file mode 100644 index 00000000..a2f55400 --- /dev/null +++ b/lexer.gen.c @@ -0,0 +1,2296 @@ +#line 2 "lexer.gen.c" + +#line 4 "lexer.gen.c" + +#define YY_INT_ALIGNED short int + +/* A lexical scanner generated by flex */ + +#define FLEX_SCANNER +#define YY_FLEX_MAJOR_VERSION 2 +#define YY_FLEX_MINOR_VERSION 5 +#define YY_FLEX_SUBMINOR_VERSION 35 +#if YY_FLEX_SUBMINOR_VERSION > 0 +#define FLEX_BETA +#endif + +/* First, we deal with platform-specific or compiler-specific issues. */ + +/* begin standard C headers. */ +#include +#include +#include +#include + +/* end standard C headers. */ + +/* flex integer type definitions */ + +#ifndef FLEXINT_H +#define FLEXINT_H + +/* C99 systems have . Non-C99 systems may or may not. */ + +#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L + +/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, + * if you want the limit (max/min) macros for int types. + */ +#ifndef __STDC_LIMIT_MACROS +#define __STDC_LIMIT_MACROS 1 +#endif + +#include +typedef int8_t flex_int8_t; +typedef uint8_t flex_uint8_t; +typedef int16_t flex_int16_t; +typedef uint16_t flex_uint16_t; +typedef int32_t flex_int32_t; +typedef uint32_t flex_uint32_t; +#else +typedef signed char flex_int8_t; +typedef short int flex_int16_t; +typedef int flex_int32_t; +typedef unsigned char flex_uint8_t; +typedef unsigned short int flex_uint16_t; +typedef unsigned int flex_uint32_t; + +/* Limits of integral types. */ +#ifndef INT8_MIN +#define INT8_MIN (-128) +#endif +#ifndef INT16_MIN +#define INT16_MIN (-32767-1) +#endif +#ifndef INT32_MIN +#define INT32_MIN (-2147483647-1) +#endif +#ifndef INT8_MAX +#define INT8_MAX (127) +#endif +#ifndef INT16_MAX +#define INT16_MAX (32767) +#endif +#ifndef INT32_MAX +#define INT32_MAX (2147483647) +#endif +#ifndef UINT8_MAX +#define UINT8_MAX (255U) +#endif +#ifndef UINT16_MAX +#define UINT16_MAX (65535U) +#endif +#ifndef UINT32_MAX +#define UINT32_MAX (4294967295U) +#endif + +#endif /* ! C99 */ + +#endif /* ! FLEXINT_H */ + +#ifdef __cplusplus + +/* The "const" storage-class-modifier is valid. */ +#define YY_USE_CONST + +#else /* ! __cplusplus */ + +/* C99 requires __STDC__ to be defined as 1. */ +#if defined (__STDC__) + +#define YY_USE_CONST + +#endif /* defined (__STDC__) */ +#endif /* ! __cplusplus */ + +#ifdef YY_USE_CONST +#define yyconst const +#else +#define yyconst +#endif + +/* Returned upon end-of-file. */ +#define YY_NULL 0 + +/* Promotes a possibly negative, possibly signed char to an unsigned + * integer for use as an array index. If the signed char is negative, + * we want to instead treat it as an 8-bit unsigned char, hence the + * double cast. + */ +#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) + +/* An opaque pointer. */ +#ifndef YY_TYPEDEF_YY_SCANNER_T +#define YY_TYPEDEF_YY_SCANNER_T +typedef void* yyscan_t; +#endif + +/* For convenience, these vars (plus the bison vars far below) + are macros in the reentrant scanner. */ +#define yyin yyg->yyin_r +#define yyout yyg->yyout_r +#define yyextra yyg->yyextra_r +#define yyleng yyg->yyleng_r +#define yytext yyg->yytext_r +#define yylineno (YY_CURRENT_BUFFER_LVALUE->yy_bs_lineno) +#define yycolumn (YY_CURRENT_BUFFER_LVALUE->yy_bs_column) +#define yy_flex_debug yyg->yy_flex_debug_r + +/* Enter a start condition. This macro really ought to take a parameter, + * but we do it the disgusting crufty way forced on us by the ()-less + * definition of BEGIN. + */ +#define BEGIN yyg->yy_start = 1 + 2 * + +/* Translate the current start state into a value that can be later handed + * to BEGIN to return to the state. The YYSTATE alias is for lex + * compatibility. + */ +#define YY_START ((yyg->yy_start - 1) / 2) +#define YYSTATE YY_START + +/* Action number for EOF rule of a given start state. */ +#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) + +/* Special action meaning "start processing a new file". */ +#define YY_NEW_FILE jq_yyrestart(yyin ,yyscanner ) + +#define YY_END_OF_BUFFER_CHAR 0 + +/* Size of default input buffer. */ +#ifndef YY_BUF_SIZE +#ifdef __ia64__ +/* On IA-64, the buffer size is 16k, not 8k. + * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case. + * Ditto for the __ia64__ case accordingly. + */ +#define YY_BUF_SIZE 32768 +#else +#define YY_BUF_SIZE 16384 +#endif /* __ia64__ */ +#endif + +/* The state buf must be large enough to hold one state per character in the main buffer. + */ +#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type)) + +#ifndef YY_TYPEDEF_YY_BUFFER_STATE +#define YY_TYPEDEF_YY_BUFFER_STATE +typedef struct yy_buffer_state *YY_BUFFER_STATE; +#endif + +#define EOB_ACT_CONTINUE_SCAN 0 +#define EOB_ACT_END_OF_FILE 1 +#define EOB_ACT_LAST_MATCH 2 + + #define YY_LESS_LINENO(n) + +/* Return all but the first "n" matched characters back to the input stream. */ +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + int yyless_macro_arg = (n); \ + YY_LESS_LINENO(yyless_macro_arg);\ + *yy_cp = yyg->yy_hold_char; \ + YY_RESTORE_YY_MORE_OFFSET \ + yyg->yy_c_buf_p = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \ + YY_DO_BEFORE_ACTION; /* set up yytext again */ \ + } \ + while ( 0 ) + +#define unput(c) yyunput( c, yyg->yytext_ptr , yyscanner ) + +#ifndef YY_TYPEDEF_YY_SIZE_T +#define YY_TYPEDEF_YY_SIZE_T +typedef size_t yy_size_t; +#endif + +#ifndef YY_STRUCT_YY_BUFFER_STATE +#define YY_STRUCT_YY_BUFFER_STATE +struct yy_buffer_state + { + FILE *yy_input_file; + + char *yy_ch_buf; /* input buffer */ + char *yy_buf_pos; /* current position in input buffer */ + + /* Size of input buffer in bytes, not including room for EOB + * characters. + */ + yy_size_t yy_buf_size; + + /* Number of characters read into yy_ch_buf, not including EOB + * characters. + */ + int yy_n_chars; + + /* Whether we "own" the buffer - i.e., we know we created it, + * and can realloc() it to grow it, and should free() it to + * delete it. + */ + int yy_is_our_buffer; + + /* Whether this is an "interactive" input source; if so, and + * if we're using stdio for input, then we want to use getc() + * instead of fread(), to make sure we stop fetching input after + * each newline. + */ + int yy_is_interactive; + + /* Whether we're considered to be at the beginning of a line. + * If so, '^' rules will be active on the next match, otherwise + * not. + */ + int yy_at_bol; + + int yy_bs_lineno; /**< The line count. */ + int yy_bs_column; /**< The column count. */ + + /* Whether to try to fill the input buffer when we reach the + * end of it. + */ + int yy_fill_buffer; + + int yy_buffer_status; + +#define YY_BUFFER_NEW 0 +#define YY_BUFFER_NORMAL 1 + /* When an EOF's been seen but there's still some text to process + * then we mark the buffer as YY_EOF_PENDING, to indicate that we + * shouldn't try reading from the input source any more. We might + * still have a bunch of tokens to match, though, because of + * possible backing-up. + * + * When we actually see the EOF, we change the status to "new" + * (via jq_yyrestart()), so that the user can continue scanning by + * just pointing yyin at a new input file. + */ +#define YY_BUFFER_EOF_PENDING 2 + + }; +#endif /* !YY_STRUCT_YY_BUFFER_STATE */ + +/* We provide macros for accessing buffer states in case in the + * future we want to put the buffer states in a more general + * "scanner state". + * + * Returns the top of the stack, or NULL. + */ +#define YY_CURRENT_BUFFER ( yyg->yy_buffer_stack \ + ? yyg->yy_buffer_stack[yyg->yy_buffer_stack_top] \ + : NULL) + +/* Same as previous macro, but useful when we know that the buffer stack is not + * NULL or when we need an lvalue. For internal use only. + */ +#define YY_CURRENT_BUFFER_LVALUE yyg->yy_buffer_stack[yyg->yy_buffer_stack_top] + +void jq_yyrestart (FILE *input_file ,yyscan_t yyscanner ); +void jq_yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner ); +YY_BUFFER_STATE jq_yy_create_buffer (FILE *file,int size ,yyscan_t yyscanner ); +void jq_yy_delete_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner ); +void jq_yy_flush_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner ); +void jq_yypush_buffer_state (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner ); +void jq_yypop_buffer_state (yyscan_t yyscanner ); + +static void jq_yyensure_buffer_stack (yyscan_t yyscanner ); +static void jq_yy_load_buffer_state (yyscan_t yyscanner ); +static void jq_yy_init_buffer (YY_BUFFER_STATE b,FILE *file ,yyscan_t yyscanner ); + +#define YY_FLUSH_BUFFER jq_yy_flush_buffer(YY_CURRENT_BUFFER ,yyscanner) + +YY_BUFFER_STATE jq_yy_scan_buffer (char *base,yy_size_t size ,yyscan_t yyscanner ); +YY_BUFFER_STATE jq_yy_scan_string (yyconst char *yy_str ,yyscan_t yyscanner ); +YY_BUFFER_STATE jq_yy_scan_bytes (yyconst char *bytes,int len ,yyscan_t yyscanner ); + +void *jq_yyalloc (yy_size_t ,yyscan_t yyscanner ); +void *jq_yyrealloc (void *,yy_size_t ,yyscan_t yyscanner ); +void jq_yyfree (void * ,yyscan_t yyscanner ); + +#define yy_new_buffer jq_yy_create_buffer + +#define yy_set_interactive(is_interactive) \ + { \ + if ( ! YY_CURRENT_BUFFER ){ \ + jq_yyensure_buffer_stack (yyscanner); \ + YY_CURRENT_BUFFER_LVALUE = \ + jq_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \ + } \ + YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ + } + +#define yy_set_bol(at_bol) \ + { \ + if ( ! YY_CURRENT_BUFFER ){\ + jq_yyensure_buffer_stack (yyscanner); \ + YY_CURRENT_BUFFER_LVALUE = \ + jq_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \ + } \ + YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ + } + +#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) + +/* Begin user sect3 */ + +#define jq_yywrap(n) 1 +#define YY_SKIP_YYWRAP + +typedef unsigned char YY_CHAR; + +typedef int yy_state_type; + +#define yytext_ptr yytext_r + +static yy_state_type yy_get_previous_state (yyscan_t yyscanner ); +static yy_state_type yy_try_NUL_trans (yy_state_type current_state ,yyscan_t yyscanner); +static int yy_get_next_buffer (yyscan_t yyscanner ); +static void yy_fatal_error (yyconst char msg[] ,yyscan_t yyscanner ); + +/* Done after the current pattern has been matched and before the + * corresponding action - sets up yytext. + */ +#define YY_DO_BEFORE_ACTION \ + yyg->yytext_ptr = yy_bp; \ + yyleng = (size_t) (yy_cp - yy_bp); \ + yyg->yy_hold_char = *yy_cp; \ + *yy_cp = '\0'; \ + yyg->yy_c_buf_p = yy_cp; + +#define YY_NUM_RULES 33 +#define YY_END_OF_BUFFER 34 +/* This struct is not used in this scanner, + but its presence is necessary. */ +struct yy_trans_info + { + flex_int32_t yy_verify; + flex_int32_t yy_nxt; + }; +static yyconst flex_int16_t yy_accept[84] = + { 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 34, 32, 31, 31, 24, 20, 21, 22, + 20, 20, 20, 20, 20, 23, 20, 20, 20, 30, + 30, 30, 30, 30, 30, 30, 20, 28, 28, 26, + 29, 31, 15, 13, 23, 14, 0, 11, 16, 18, + 1, 19, 30, 30, 2, 30, 30, 30, 4, 9, + 30, 12, 28, 27, 25, 27, 0, 23, 17, 8, + 3, 30, 30, 10, 30, 0, 27, 7, 6, 5, + 27, 27, 0 + } ; + +static yyconst flex_int32_t yy_ec[256] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 2, 1, 4, 1, 5, 1, 1, 1, 6, + 7, 8, 9, 10, 11, 12, 13, 14, 14, 14, + 14, 14, 14, 14, 14, 14, 14, 15, 16, 17, + 18, 19, 1, 1, 20, 20, 20, 20, 21, 20, + 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, + 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, + 22, 23, 24, 1, 25, 1, 26, 20, 20, 27, + + 28, 29, 20, 30, 31, 20, 20, 32, 20, 33, + 34, 20, 20, 35, 36, 37, 38, 20, 20, 20, + 20, 20, 39, 40, 41, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1 + } ; + +static yyconst flex_int32_t yy_meta[42] = + { 0, + 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, + 3, 1, 4, 1, 5, 3, 3, 3, 3, 3, + 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, + 1 + } ; + +static yyconst flex_int16_t yy_base[92] = + { 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 39, 41, 132, 133, 44, 46, 133, 133, 133, 133, + 113, 98, 38, 39, 41, 49, 96, 93, 85, 0, + 22, 74, 33, 72, 65, 69, 80, 0, 0, 133, + 51, 66, 133, 133, 59, 133, 65, 79, 133, 133, + 133, 133, 0, 69, 0, 66, 47, 67, 0, 0, + 65, 133, 0, 69, 133, 68, 76, 74, 133, 0, + 0, 57, 57, 0, 51, 66, 59, 0, 0, 0, + 58, 52, 133, 104, 107, 112, 117, 120, 122, 124, + 126 + + } ; + +static yyconst flex_int16_t yy_def[92] = + { 0, + 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 84, 84, 83, 83, 83, 83, 83, 83, 83, 83, + 83, 83, 83, 83, 83, 83, 83, 83, 83, 85, + 85, 85, 85, 85, 85, 85, 83, 86, 86, 83, + 87, 83, 83, 83, 83, 83, 83, 83, 83, 83, + 83, 83, 85, 85, 85, 85, 85, 85, 85, 85, + 85, 83, 86, 83, 83, 88, 83, 83, 83, 85, + 85, 85, 85, 85, 85, 87, 89, 85, 85, 85, + 90, 91, 0, 83, 83, 83, 83, 83, 83, 83, + 83 + + } ; + +static yyconst flex_int16_t yy_nxt[175] = + { 0, + 14, 15, 16, 17, 18, 19, 20, 21, 22, 18, + 23, 24, 25, 26, 18, 18, 27, 28, 29, 30, + 30, 19, 14, 20, 30, 31, 32, 33, 30, 30, + 34, 30, 30, 35, 30, 30, 36, 30, 19, 37, + 20, 39, 40, 39, 40, 42, 42, 42, 42, 45, + 45, 45, 45, 48, 54, 46, 65, 55, 49, 47, + 45, 41, 45, 41, 57, 58, 47, 42, 42, 47, + 45, 83, 45, 67, 76, 67, 47, 72, 68, 47, + 76, 76, 73, 80, 79, 78, 47, 68, 66, 68, + 76, 76, 75, 74, 71, 70, 69, 62, 61, 60, + + 59, 56, 52, 66, 38, 38, 38, 38, 38, 53, + 51, 53, 63, 50, 63, 44, 63, 64, 64, 64, + 64, 64, 77, 77, 81, 81, 82, 82, 64, 64, + 43, 83, 13, 83, 83, 83, 83, 83, 83, 83, + 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, + 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, + 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, + 83, 83, 83, 83 + } ; + +static yyconst flex_int16_t yy_chk[175] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 11, 11, 12, 12, 15, 15, 16, 16, 23, + 24, 23, 24, 25, 31, 23, 41, 31, 25, 24, + 26, 11, 26, 12, 33, 33, 24, 42, 42, 26, + 45, 76, 45, 47, 82, 47, 26, 57, 47, 45, + 81, 77, 57, 75, 73, 72, 45, 68, 41, 67, + 66, 64, 61, 58, 56, 54, 48, 37, 36, 35, + + 34, 32, 29, 76, 84, 84, 84, 84, 84, 85, + 28, 85, 86, 27, 86, 22, 86, 87, 87, 87, + 87, 87, 88, 88, 89, 89, 90, 90, 91, 91, + 21, 13, 83, 83, 83, 83, 83, 83, 83, 83, + 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, + 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, + 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, + 83, 83, 83, 83 + } ; + +/* The intent behind this definition is that it'll catch + * any uses of REJECT which flex missed. + */ +#define REJECT reject_used_but_not_detected +#define yymore() yymore_used_but_not_detected +#define YY_MORE_ADJ 0 +#define YY_RESTORE_YY_MORE_OFFSET +#line 1 "lexer.l" +#line 2 "lexer.l" +#include "compile.h" +#include "parser.gen.h" /* Generated by bison. */ + +#define YY_USER_ACTION \ + do { \ + yylloc->start = jq_yyget_extra(yyscanner); \ + yylloc->end = yylloc->start + yyleng; \ + jq_yyset_extra(yylloc->end,yyscanner); \ + } while (0); + + + + + + +#line 20 "lexer.l" + static int enter(int opening, int state, yyscan_t yyscanner); + static int try_exit(int closing, int state, yyscan_t yyscanner); +#define YY_NO_INPUT 1 +#line 529 "lexer.gen.c" + +#define INITIAL 0 +#define IN_PAREN 1 +#define IN_BRACKET 2 +#define IN_BRACE 3 +#define IN_QQINTERP 4 +#define IN_QQSTRING 5 + +#ifndef YY_NO_UNISTD_H +/* Special case for "unistd.h", since it is non-ANSI. We include it way + * down here because we want the user's section 1 to have been scanned first. + * The user has a chance to override it with an option. + */ +#include +#endif + +#define YY_EXTRA_TYPE int + +/* Holds the entire state of the reentrant scanner. */ +struct yyguts_t + { + + /* User-defined. Not touched by flex. */ + YY_EXTRA_TYPE yyextra_r; + + /* The rest are the same as the globals declared in the non-reentrant scanner. */ + FILE *yyin_r, *yyout_r; + size_t yy_buffer_stack_top; /**< index of top of stack. */ + size_t yy_buffer_stack_max; /**< capacity of stack. */ + YY_BUFFER_STATE * yy_buffer_stack; /**< Stack as an array. */ + char yy_hold_char; + int yy_n_chars; + int yyleng_r; + char *yy_c_buf_p; + int yy_init; + int yy_start; + int yy_did_buffer_switch_on_eof; + int yy_start_stack_ptr; + int yy_start_stack_depth; + int *yy_start_stack; + yy_state_type yy_last_accepting_state; + char* yy_last_accepting_cpos; + + int yylineno_r; + int yy_flex_debug_r; + + char *yytext_r; + int yy_more_flag; + int yy_more_len; + + YYSTYPE * yylval_r; + + YYLTYPE * yylloc_r; + + }; /* end struct yyguts_t */ + +static int yy_init_globals (yyscan_t yyscanner ); + + /* This must go here because YYSTYPE and YYLTYPE are included + * from bison output in section 1.*/ + # define yylval yyg->yylval_r + + # define yylloc yyg->yylloc_r + +int jq_yylex_init (yyscan_t* scanner); + +int jq_yylex_init_extra (YY_EXTRA_TYPE user_defined,yyscan_t* scanner); + +/* Accessor methods to globals. + These are made visible to non-reentrant scanners for convenience. */ + +int jq_yylex_destroy (yyscan_t yyscanner ); + +int jq_yyget_debug (yyscan_t yyscanner ); + +void jq_yyset_debug (int debug_flag ,yyscan_t yyscanner ); + +YY_EXTRA_TYPE jq_yyget_extra (yyscan_t yyscanner ); + +void jq_yyset_extra (YY_EXTRA_TYPE user_defined ,yyscan_t yyscanner ); + +FILE *jq_yyget_in (yyscan_t yyscanner ); + +void jq_yyset_in (FILE * in_str ,yyscan_t yyscanner ); + +FILE *jq_yyget_out (yyscan_t yyscanner ); + +void jq_yyset_out (FILE * out_str ,yyscan_t yyscanner ); + +int jq_yyget_leng (yyscan_t yyscanner ); + +char *jq_yyget_text (yyscan_t yyscanner ); + +int jq_yyget_lineno (yyscan_t yyscanner ); + +void jq_yyset_lineno (int line_number ,yyscan_t yyscanner ); + +YYSTYPE * jq_yyget_lval (yyscan_t yyscanner ); + +void jq_yyset_lval (YYSTYPE * yylval_param ,yyscan_t yyscanner ); + + YYLTYPE *jq_yyget_lloc (yyscan_t yyscanner ); + + void jq_yyset_lloc (YYLTYPE * yylloc_param ,yyscan_t yyscanner ); + +/* Macros after this point can all be overridden by user definitions in + * section 1. + */ + +#ifndef YY_SKIP_YYWRAP +#ifdef __cplusplus +extern "C" int jq_yywrap (yyscan_t yyscanner ); +#else +extern int jq_yywrap (yyscan_t yyscanner ); +#endif +#endif + +#ifndef yytext_ptr +static void yy_flex_strncpy (char *,yyconst char *,int ,yyscan_t yyscanner); +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen (yyconst char * ,yyscan_t yyscanner); +#endif + +#ifndef YY_NO_INPUT + +#ifdef __cplusplus +static int yyinput (yyscan_t yyscanner ); +#else +static int input (yyscan_t yyscanner ); +#endif + +#endif + + static void yy_push_state (int new_state ,yyscan_t yyscanner); + + static void yy_pop_state (yyscan_t yyscanner ); + + static int yy_top_state (yyscan_t yyscanner ); + +/* Amount of stuff to slurp up with each read. */ +#ifndef YY_READ_BUF_SIZE +#ifdef __ia64__ +/* On IA-64, the buffer size is 16k, not 8k */ +#define YY_READ_BUF_SIZE 16384 +#else +#define YY_READ_BUF_SIZE 8192 +#endif /* __ia64__ */ +#endif + +/* Copy whatever the last rule matched to the standard output. */ +#ifndef ECHO +/* This used to be an fputs(), but since the string might contain NUL's, + * we now use fwrite(). + */ +#define ECHO do { if (fwrite( yytext, yyleng, 1, yyout )) {} } while (0) +#endif + +/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, + * is returned in "result". + */ +#ifndef YY_INPUT +#define YY_INPUT(buf,result,max_size) \ + if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \ + { \ + int c = '*'; \ + size_t n; \ + for ( n = 0; n < max_size && \ + (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ + buf[n] = (char) c; \ + if ( c == '\n' ) \ + buf[n++] = (char) c; \ + if ( c == EOF && ferror( yyin ) ) \ + YY_FATAL_ERROR( "input in flex scanner failed" ); \ + result = n; \ + } \ + else \ + { \ + errno=0; \ + while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \ + { \ + if( errno != EINTR) \ + { \ + YY_FATAL_ERROR( "input in flex scanner failed" ); \ + break; \ + } \ + errno=0; \ + clearerr(yyin); \ + } \ + }\ +\ + +#endif + +/* No semi-colon after return; correct usage is to write "yyterminate();" - + * we don't want an extra ';' after the "return" because that will cause + * some compilers to complain about unreachable statements. + */ +#ifndef yyterminate +#define yyterminate() return YY_NULL +#endif + +/* Number of entries by which start-condition stack grows. */ +#ifndef YY_START_STACK_INCR +#define YY_START_STACK_INCR 25 +#endif + +/* Report a fatal error. */ +#ifndef YY_FATAL_ERROR +#define YY_FATAL_ERROR(msg) yy_fatal_error( msg , yyscanner) +#endif + +/* end tables serialization structures and prototypes */ + +/* Default declaration of generated scanner - a define so the user can + * easily add parameters. + */ +#ifndef YY_DECL +#define YY_DECL_IS_OURS 1 + +extern int jq_yylex \ + (YYSTYPE * yylval_param,YYLTYPE * yylloc_param ,yyscan_t yyscanner); + +#define YY_DECL int jq_yylex \ + (YYSTYPE * yylval_param, YYLTYPE * yylloc_param , yyscan_t yyscanner) +#endif /* !YY_DECL */ + +/* Code executed at the beginning of each rule, after yytext and yyleng + * have been set up. + */ +#ifndef YY_USER_ACTION +#define YY_USER_ACTION +#endif + +/* Code executed at the end of each rule. */ +#ifndef YY_BREAK +#define YY_BREAK break; +#endif + +#define YY_RULE_SETUP \ + YY_USER_ACTION + +/** The main scanner function which does all the work. + */ +YY_DECL +{ + register yy_state_type yy_current_state; + register char *yy_cp, *yy_bp; + register int yy_act; + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + +#line 32 "lexer.l" + + +#line 785 "lexer.gen.c" + + yylval = yylval_param; + + yylloc = yylloc_param; + + if ( !yyg->yy_init ) + { + yyg->yy_init = 1; + +#ifdef YY_USER_INIT + YY_USER_INIT; +#endif + + if ( ! yyg->yy_start ) + yyg->yy_start = 1; /* first start state */ + + if ( ! yyin ) + yyin = stdin; + + if ( ! yyout ) + yyout = stdout; + + if ( ! YY_CURRENT_BUFFER ) { + jq_yyensure_buffer_stack (yyscanner); + YY_CURRENT_BUFFER_LVALUE = + jq_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); + } + + jq_yy_load_buffer_state(yyscanner ); + } + + while ( 1 ) /* loops until end-of-file is reached */ + { + yy_cp = yyg->yy_c_buf_p; + + /* Support of yytext. */ + *yy_cp = yyg->yy_hold_char; + + /* yy_bp points to the position in yy_ch_buf of the start of + * the current run. + */ + yy_bp = yy_cp; + + yy_current_state = yyg->yy_start; +yy_match: + do + { + register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; + if ( yy_accept[yy_current_state] ) + { + yyg->yy_last_accepting_state = yy_current_state; + yyg->yy_last_accepting_cpos = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 84 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + ++yy_cp; + } + while ( yy_base[yy_current_state] != 133 ); + +yy_find_action: + yy_act = yy_accept[yy_current_state]; + if ( yy_act == 0 ) + { /* have to back up */ + yy_cp = yyg->yy_last_accepting_cpos; + yy_current_state = yyg->yy_last_accepting_state; + yy_act = yy_accept[yy_current_state]; + } + + YY_DO_BEFORE_ACTION; + +do_action: /* This label is used only to access EOF actions. */ + + switch ( yy_act ) + { /* beginning of action switch */ + case 0: /* must back up */ + /* undo the effects of YY_DO_BEFORE_ACTION */ + *yy_cp = yyg->yy_hold_char; + yy_cp = yyg->yy_last_accepting_cpos; + yy_current_state = yyg->yy_last_accepting_state; + goto yy_find_action; + +case 1: +YY_RULE_SETUP +#line 34 "lexer.l" +{ return EQ; } + YY_BREAK +case 2: +YY_RULE_SETUP +#line 35 "lexer.l" +{ return AS; } + YY_BREAK +case 3: +YY_RULE_SETUP +#line 36 "lexer.l" +{ return DEF; } + YY_BREAK +case 4: +YY_RULE_SETUP +#line 37 "lexer.l" +{ return IF; } + YY_BREAK +case 5: +YY_RULE_SETUP +#line 38 "lexer.l" +{ return THEN; } + YY_BREAK +case 6: +YY_RULE_SETUP +#line 39 "lexer.l" +{ return ELSE; } + YY_BREAK +case 7: +YY_RULE_SETUP +#line 40 "lexer.l" +{ return ELSE_IF; } + YY_BREAK +case 8: +YY_RULE_SETUP +#line 41 "lexer.l" +{ return AND; } + YY_BREAK +case 9: +YY_RULE_SETUP +#line 42 "lexer.l" +{ return OR; } + YY_BREAK +case 10: +YY_RULE_SETUP +#line 43 "lexer.l" +{ return END; } + YY_BREAK +case 11: +YY_RULE_SETUP +#line 44 "lexer.l" +{ return DEFINEDOR; } + YY_BREAK +case 12: +YY_RULE_SETUP +#line 45 "lexer.l" +{ return SETPIPE; } + YY_BREAK +case 13: +YY_RULE_SETUP +#line 46 "lexer.l" +{ return SETPLUS; } + YY_BREAK +case 14: +YY_RULE_SETUP +#line 47 "lexer.l" +{ return SETMINUS; } + YY_BREAK +case 15: +YY_RULE_SETUP +#line 48 "lexer.l" +{ return SETMULT; } + YY_BREAK +case 16: +YY_RULE_SETUP +#line 49 "lexer.l" +{ return SETDIV; } + YY_BREAK +case 17: +YY_RULE_SETUP +#line 50 "lexer.l" +{ return SETDEFINEDOR; } + YY_BREAK +case 18: +YY_RULE_SETUP +#line 51 "lexer.l" +{ return LESSEQ; } + YY_BREAK +case 19: +YY_RULE_SETUP +#line 52 "lexer.l" +{ return GREATEREQ; } + YY_BREAK +case 20: +YY_RULE_SETUP +#line 53 "lexer.l" +{ return yytext[0];} + YY_BREAK +case 21: +YY_RULE_SETUP +#line 55 "lexer.l" +{ + return enter(yytext[0], YY_START, yyscanner); +} + YY_BREAK +case 22: +YY_RULE_SETUP +#line 59 "lexer.l" +{ + return try_exit(yytext[0], YY_START, yyscanner); +} + YY_BREAK +case 23: +YY_RULE_SETUP +#line 64 "lexer.l" +{ + yylval->literal = jv_parse_sized(yytext, yyleng); return LITERAL; +} + YY_BREAK +case 24: +YY_RULE_SETUP +#line 68 "lexer.l" +{ + yy_push_state(IN_QQSTRING, yyscanner); + return QQSTRING_START; +} + YY_BREAK + +case 25: +YY_RULE_SETUP +#line 74 "lexer.l" +{ + return enter(QQSTRING_INTERP_START, YY_START, yyscanner); + } + YY_BREAK +case 26: +YY_RULE_SETUP +#line 77 "lexer.l" +{ + yy_pop_state(yyscanner); + return QQSTRING_END; + } + YY_BREAK +case 27: +/* rule 27 can match eol */ +YY_RULE_SETUP +#line 81 "lexer.l" +{ + /* pass escapes to the json parser */ + jv escapes = jv_string_fmt("\"%.*s\"", yyleng, yytext); + yylval->literal = jv_parse_sized(jv_string_value(escapes), jv_string_length(jv_copy(escapes))); + jv_free(escapes); + return QQSTRING_TEXT; + } + YY_BREAK +case 28: +/* rule 28 can match eol */ +YY_RULE_SETUP +#line 88 "lexer.l" +{ + yylval->literal = jv_string_sized(yytext, yyleng); + return QQSTRING_TEXT; + } + YY_BREAK +case 29: +YY_RULE_SETUP +#line 92 "lexer.l" +{ + return INVALID_CHARACTER; + } + YY_BREAK + +case 30: +YY_RULE_SETUP +#line 98 "lexer.l" +{ yylval->literal = jv_string(yytext); return IDENT;} + YY_BREAK +case 31: +/* rule 31 can match eol */ +YY_RULE_SETUP +#line 100 "lexer.l" +{} + YY_BREAK +case 32: +YY_RULE_SETUP +#line 102 "lexer.l" +{ return INVALID_CHARACTER; } + YY_BREAK +case 33: +YY_RULE_SETUP +#line 104 "lexer.l" +YY_FATAL_ERROR( "flex scanner jammed" ); + YY_BREAK +#line 1067 "lexer.gen.c" +case YY_STATE_EOF(INITIAL): +case YY_STATE_EOF(IN_PAREN): +case YY_STATE_EOF(IN_BRACKET): +case YY_STATE_EOF(IN_BRACE): +case YY_STATE_EOF(IN_QQINTERP): +case YY_STATE_EOF(IN_QQSTRING): + yyterminate(); + + case YY_END_OF_BUFFER: + { + /* Amount of text matched not including the EOB char. */ + int yy_amount_of_matched_text = (int) (yy_cp - yyg->yytext_ptr) - 1; + + /* Undo the effects of YY_DO_BEFORE_ACTION. */ + *yy_cp = yyg->yy_hold_char; + YY_RESTORE_YY_MORE_OFFSET + + if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW ) + { + /* We're scanning a new file or input source. It's + * possible that this happened because the user + * just pointed yyin at a new source and called + * jq_yylex(). If so, then we have to assure + * consistency between YY_CURRENT_BUFFER and our + * globals. Here is the right place to do so, because + * this is the first action (other than possibly a + * back-up) that will match for the new input source. + */ + yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; + YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin; + YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL; + } + + /* Note that here we test for yy_c_buf_p "<=" to the position + * of the first EOB in the buffer, since yy_c_buf_p will + * already have been incremented past the NUL character + * (since all states make transitions on EOB to the + * end-of-buffer state). Contrast this with the test + * in input(). + */ + if ( yyg->yy_c_buf_p <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] ) + { /* This was really a NUL. */ + yy_state_type yy_next_state; + + yyg->yy_c_buf_p = yyg->yytext_ptr + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state( yyscanner ); + + /* Okay, we're now positioned to make the NUL + * transition. We couldn't have + * yy_get_previous_state() go ahead and do it + * for us because it doesn't know how to deal + * with the possibility of jamming (and we don't + * want to build jamming into it because then it + * will run more slowly). + */ + + yy_next_state = yy_try_NUL_trans( yy_current_state , yyscanner); + + yy_bp = yyg->yytext_ptr + YY_MORE_ADJ; + + if ( yy_next_state ) + { + /* Consume the NUL. */ + yy_cp = ++yyg->yy_c_buf_p; + yy_current_state = yy_next_state; + goto yy_match; + } + + else + { + yy_cp = yyg->yy_c_buf_p; + goto yy_find_action; + } + } + + else switch ( yy_get_next_buffer( yyscanner ) ) + { + case EOB_ACT_END_OF_FILE: + { + yyg->yy_did_buffer_switch_on_eof = 0; + + if ( jq_yywrap(yyscanner ) ) + { + /* Note: because we've taken care in + * yy_get_next_buffer() to have set up + * yytext, we can now set up + * yy_c_buf_p so that if some total + * hoser (like flex itself) wants to + * call the scanner after we return the + * YY_NULL, it'll still work - another + * YY_NULL will get returned. + */ + yyg->yy_c_buf_p = yyg->yytext_ptr + YY_MORE_ADJ; + + yy_act = YY_STATE_EOF(YY_START); + goto do_action; + } + + else + { + if ( ! yyg->yy_did_buffer_switch_on_eof ) + YY_NEW_FILE; + } + break; + } + + case EOB_ACT_CONTINUE_SCAN: + yyg->yy_c_buf_p = + yyg->yytext_ptr + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state( yyscanner ); + + yy_cp = yyg->yy_c_buf_p; + yy_bp = yyg->yytext_ptr + YY_MORE_ADJ; + goto yy_match; + + case EOB_ACT_LAST_MATCH: + yyg->yy_c_buf_p = + &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars]; + + yy_current_state = yy_get_previous_state( yyscanner ); + + yy_cp = yyg->yy_c_buf_p; + yy_bp = yyg->yytext_ptr + YY_MORE_ADJ; + goto yy_find_action; + } + break; + } + + default: + YY_FATAL_ERROR( + "fatal flex scanner internal error--no action found" ); + } /* end of action switch */ + } /* end of scanning one token */ +} /* end of jq_yylex */ + +/* yy_get_next_buffer - try to read in a new buffer + * + * Returns a code representing an action: + * EOB_ACT_LAST_MATCH - + * EOB_ACT_CONTINUE_SCAN - continue scanning from current position + * EOB_ACT_END_OF_FILE - end of file + */ +static int yy_get_next_buffer (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf; + register char *source = yyg->yytext_ptr; + register int number_to_move, i; + int ret_val; + + if ( yyg->yy_c_buf_p > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] ) + YY_FATAL_ERROR( + "fatal flex scanner internal error--end of buffer missed" ); + + if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 ) + { /* Don't try to fill the buffer, so this is an EOF. */ + if ( yyg->yy_c_buf_p - yyg->yytext_ptr - YY_MORE_ADJ == 1 ) + { + /* We matched a single character, the EOB, so + * treat this as a final EOF. + */ + return EOB_ACT_END_OF_FILE; + } + + else + { + /* We matched some text prior to the EOB, first + * process it. + */ + return EOB_ACT_LAST_MATCH; + } + } + + /* Try to read more data. */ + + /* First move last chars to start of buffer. */ + number_to_move = (int) (yyg->yy_c_buf_p - yyg->yytext_ptr) - 1; + + for ( i = 0; i < number_to_move; ++i ) + *(dest++) = *(source++); + + if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING ) + /* don't do the read, it's not guaranteed to return an EOF, + * just force an EOF + */ + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars = 0; + + else + { + int num_to_read = + YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1; + + while ( num_to_read <= 0 ) + { /* Not enough room in the buffer - grow it. */ + + /* just a shorter name for the current buffer */ + YY_BUFFER_STATE b = YY_CURRENT_BUFFER; + + int yy_c_buf_p_offset = + (int) (yyg->yy_c_buf_p - b->yy_ch_buf); + + if ( b->yy_is_our_buffer ) + { + int new_size = b->yy_buf_size * 2; + + if ( new_size <= 0 ) + b->yy_buf_size += b->yy_buf_size / 8; + else + b->yy_buf_size *= 2; + + b->yy_ch_buf = (char *) + /* Include room in for 2 EOB chars. */ + jq_yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ,yyscanner ); + } + else + /* Can't grow it, we don't own it. */ + b->yy_ch_buf = 0; + + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( + "fatal error - scanner input buffer overflow" ); + + yyg->yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset]; + + num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size - + number_to_move - 1; + + } + + if ( num_to_read > YY_READ_BUF_SIZE ) + num_to_read = YY_READ_BUF_SIZE; + + /* Read in more data. */ + YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]), + yyg->yy_n_chars, (size_t) num_to_read ); + + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars; + } + + if ( yyg->yy_n_chars == 0 ) + { + if ( number_to_move == YY_MORE_ADJ ) + { + ret_val = EOB_ACT_END_OF_FILE; + jq_yyrestart(yyin ,yyscanner); + } + + else + { + ret_val = EOB_ACT_LAST_MATCH; + YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = + YY_BUFFER_EOF_PENDING; + } + } + + else + ret_val = EOB_ACT_CONTINUE_SCAN; + + if ((yy_size_t) (yyg->yy_n_chars + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { + /* Extend the array by 50%, plus the number we really need. */ + yy_size_t new_size = yyg->yy_n_chars + number_to_move + (yyg->yy_n_chars >> 1); + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) jq_yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ,yyscanner ); + if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); + } + + yyg->yy_n_chars += number_to_move; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] = YY_END_OF_BUFFER_CHAR; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR; + + yyg->yytext_ptr = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0]; + + return ret_val; +} + +/* yy_get_previous_state - get the state just before the EOB char was reached */ + + static yy_state_type yy_get_previous_state (yyscan_t yyscanner) +{ + register yy_state_type yy_current_state; + register char *yy_cp; + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + yy_current_state = yyg->yy_start; + + for ( yy_cp = yyg->yytext_ptr + YY_MORE_ADJ; yy_cp < yyg->yy_c_buf_p; ++yy_cp ) + { + register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); + if ( yy_accept[yy_current_state] ) + { + yyg->yy_last_accepting_state = yy_current_state; + yyg->yy_last_accepting_cpos = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 84 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + } + + return yy_current_state; +} + +/* yy_try_NUL_trans - try to make a transition on the NUL character + * + * synopsis + * next_state = yy_try_NUL_trans( current_state ); + */ + static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state , yyscan_t yyscanner) +{ + register int yy_is_jam; + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* This var may be unused depending upon options. */ + register char *yy_cp = yyg->yy_c_buf_p; + + register YY_CHAR yy_c = 1; + if ( yy_accept[yy_current_state] ) + { + yyg->yy_last_accepting_state = yy_current_state; + yyg->yy_last_accepting_cpos = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 84 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + yy_is_jam = (yy_current_state == 83); + + return yy_is_jam ? 0 : yy_current_state; +} + +#ifndef YY_NO_INPUT +#ifdef __cplusplus + static int yyinput (yyscan_t yyscanner) +#else + static int input (yyscan_t yyscanner) +#endif + +{ + int c; + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + *yyg->yy_c_buf_p = yyg->yy_hold_char; + + if ( *yyg->yy_c_buf_p == YY_END_OF_BUFFER_CHAR ) + { + /* yy_c_buf_p now points to the character we want to return. + * If this occurs *before* the EOB characters, then it's a + * valid NUL; if not, then we've hit the end of the buffer. + */ + if ( yyg->yy_c_buf_p < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] ) + /* This was really a NUL. */ + *yyg->yy_c_buf_p = '\0'; + + else + { /* need more input */ + int offset = yyg->yy_c_buf_p - yyg->yytext_ptr; + ++yyg->yy_c_buf_p; + + switch ( yy_get_next_buffer( yyscanner ) ) + { + case EOB_ACT_LAST_MATCH: + /* This happens because yy_g_n_b() + * sees that we've accumulated a + * token and flags that we need to + * try matching the token before + * proceeding. But for input(), + * there's no matching to consider. + * So convert the EOB_ACT_LAST_MATCH + * to EOB_ACT_END_OF_FILE. + */ + + /* Reset buffer status. */ + jq_yyrestart(yyin ,yyscanner); + + /*FALLTHROUGH*/ + + case EOB_ACT_END_OF_FILE: + { + if ( jq_yywrap(yyscanner ) ) + return EOF; + + if ( ! yyg->yy_did_buffer_switch_on_eof ) + YY_NEW_FILE; +#ifdef __cplusplus + return yyinput(yyscanner); +#else + return input(yyscanner); +#endif + } + + case EOB_ACT_CONTINUE_SCAN: + yyg->yy_c_buf_p = yyg->yytext_ptr + offset; + break; + } + } + } + + c = *(unsigned char *) yyg->yy_c_buf_p; /* cast for 8-bit char's */ + *yyg->yy_c_buf_p = '\0'; /* preserve yytext */ + yyg->yy_hold_char = *++yyg->yy_c_buf_p; + + return c; +} +#endif /* ifndef YY_NO_INPUT */ + +/** Immediately switch to a different input stream. + * @param input_file A readable stream. + * @param yyscanner The scanner object. + * @note This function does not reset the start condition to @c INITIAL . + */ + void jq_yyrestart (FILE * input_file , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + if ( ! YY_CURRENT_BUFFER ){ + jq_yyensure_buffer_stack (yyscanner); + YY_CURRENT_BUFFER_LVALUE = + jq_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); + } + + jq_yy_init_buffer(YY_CURRENT_BUFFER,input_file ,yyscanner); + jq_yy_load_buffer_state(yyscanner ); +} + +/** Switch to a different input buffer. + * @param new_buffer The new input buffer. + * @param yyscanner The scanner object. + */ + void jq_yy_switch_to_buffer (YY_BUFFER_STATE new_buffer , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + /* TODO. We should be able to replace this entire function body + * with + * jq_yypop_buffer_state(); + * jq_yypush_buffer_state(new_buffer); + */ + jq_yyensure_buffer_stack (yyscanner); + if ( YY_CURRENT_BUFFER == new_buffer ) + return; + + if ( YY_CURRENT_BUFFER ) + { + /* Flush out information for old buffer. */ + *yyg->yy_c_buf_p = yyg->yy_hold_char; + YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p; + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars; + } + + YY_CURRENT_BUFFER_LVALUE = new_buffer; + jq_yy_load_buffer_state(yyscanner ); + + /* We don't actually know whether we did this switch during + * EOF (jq_yywrap()) processing, but the only time this flag + * is looked at is after jq_yywrap() is called, so it's safe + * to go ahead and always set it. + */ + yyg->yy_did_buffer_switch_on_eof = 1; +} + +static void jq_yy_load_buffer_state (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; + yyg->yytext_ptr = yyg->yy_c_buf_p = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos; + yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file; + yyg->yy_hold_char = *yyg->yy_c_buf_p; +} + +/** Allocate and initialize an input buffer state. + * @param file A readable stream. + * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE. + * @param yyscanner The scanner object. + * @return the allocated buffer state. + */ + YY_BUFFER_STATE jq_yy_create_buffer (FILE * file, int size , yyscan_t yyscanner) +{ + YY_BUFFER_STATE b; + + b = (YY_BUFFER_STATE) jq_yyalloc(sizeof( struct yy_buffer_state ) ,yyscanner ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in jq_yy_create_buffer()" ); + + b->yy_buf_size = size; + + /* yy_ch_buf has to be 2 characters longer than the size given because + * we need to put in 2 end-of-buffer characters. + */ + b->yy_ch_buf = (char *) jq_yyalloc(b->yy_buf_size + 2 ,yyscanner ); + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in jq_yy_create_buffer()" ); + + b->yy_is_our_buffer = 1; + + jq_yy_init_buffer(b,file ,yyscanner); + + return b; +} + +/** Destroy the buffer. + * @param b a buffer created with jq_yy_create_buffer() + * @param yyscanner The scanner object. + */ + void jq_yy_delete_buffer (YY_BUFFER_STATE b , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + if ( ! b ) + return; + + if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */ + YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0; + + if ( b->yy_is_our_buffer ) + jq_yyfree((void *) b->yy_ch_buf ,yyscanner ); + + jq_yyfree((void *) b ,yyscanner ); +} + +#ifndef __cplusplus +extern int isatty (int ); +#endif /* __cplusplus */ + +/* Initializes or reinitializes a buffer. + * This function is sometimes called more than once on the same buffer, + * such as during a jq_yyrestart() or at EOF. + */ + static void jq_yy_init_buffer (YY_BUFFER_STATE b, FILE * file , yyscan_t yyscanner) + +{ + int oerrno = errno; + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + jq_yy_flush_buffer(b ,yyscanner); + + b->yy_input_file = file; + b->yy_fill_buffer = 1; + + /* If b is the current buffer, then jq_yy_init_buffer was _probably_ + * called from jq_yyrestart() or through yy_get_next_buffer. + * In that case, we don't want to reset the lineno or column. + */ + if (b != YY_CURRENT_BUFFER){ + b->yy_bs_lineno = 1; + b->yy_bs_column = 0; + } + + b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; + + errno = oerrno; +} + +/** Discard all buffered characters. On the next scan, YY_INPUT will be called. + * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER. + * @param yyscanner The scanner object. + */ + void jq_yy_flush_buffer (YY_BUFFER_STATE b , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + if ( ! b ) + return; + + b->yy_n_chars = 0; + + /* We always need two end-of-buffer characters. The first causes + * a transition to the end-of-buffer state. The second causes + * a jam in that state. + */ + b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; + b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; + + b->yy_buf_pos = &b->yy_ch_buf[0]; + + b->yy_at_bol = 1; + b->yy_buffer_status = YY_BUFFER_NEW; + + if ( b == YY_CURRENT_BUFFER ) + jq_yy_load_buffer_state(yyscanner ); +} + +/** Pushes the new state onto the stack. The new state becomes + * the current state. This function will allocate the stack + * if necessary. + * @param new_buffer The new state. + * @param yyscanner The scanner object. + */ +void jq_yypush_buffer_state (YY_BUFFER_STATE new_buffer , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + if (new_buffer == NULL) + return; + + jq_yyensure_buffer_stack(yyscanner); + + /* This block is copied from jq_yy_switch_to_buffer. */ + if ( YY_CURRENT_BUFFER ) + { + /* Flush out information for old buffer. */ + *yyg->yy_c_buf_p = yyg->yy_hold_char; + YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p; + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars; + } + + /* Only push if top exists. Otherwise, replace top. */ + if (YY_CURRENT_BUFFER) + yyg->yy_buffer_stack_top++; + YY_CURRENT_BUFFER_LVALUE = new_buffer; + + /* copied from jq_yy_switch_to_buffer. */ + jq_yy_load_buffer_state(yyscanner ); + yyg->yy_did_buffer_switch_on_eof = 1; +} + +/** Removes and deletes the top of the stack, if present. + * The next element becomes the new top. + * @param yyscanner The scanner object. + */ +void jq_yypop_buffer_state (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + if (!YY_CURRENT_BUFFER) + return; + + jq_yy_delete_buffer(YY_CURRENT_BUFFER ,yyscanner); + YY_CURRENT_BUFFER_LVALUE = NULL; + if (yyg->yy_buffer_stack_top > 0) + --yyg->yy_buffer_stack_top; + + if (YY_CURRENT_BUFFER) { + jq_yy_load_buffer_state(yyscanner ); + yyg->yy_did_buffer_switch_on_eof = 1; + } +} + +/* Allocates the stack if it does not exist. + * Guarantees space for at least one push. + */ +static void jq_yyensure_buffer_stack (yyscan_t yyscanner) +{ + int num_to_alloc; + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + if (!yyg->yy_buffer_stack) { + + /* First allocation is just for 2 elements, since we don't know if this + * scanner will even need a stack. We use 2 instead of 1 to avoid an + * immediate realloc on the next call. + */ + num_to_alloc = 1; + yyg->yy_buffer_stack = (struct yy_buffer_state**)jq_yyalloc + (num_to_alloc * sizeof(struct yy_buffer_state*) + , yyscanner); + if ( ! yyg->yy_buffer_stack ) + YY_FATAL_ERROR( "out of dynamic memory in jq_yyensure_buffer_stack()" ); + + memset(yyg->yy_buffer_stack, 0, num_to_alloc * sizeof(struct yy_buffer_state*)); + + yyg->yy_buffer_stack_max = num_to_alloc; + yyg->yy_buffer_stack_top = 0; + return; + } + + if (yyg->yy_buffer_stack_top >= (yyg->yy_buffer_stack_max) - 1){ + + /* Increase the buffer to prepare for a possible push. */ + int grow_size = 8 /* arbitrary grow size */; + + num_to_alloc = yyg->yy_buffer_stack_max + grow_size; + yyg->yy_buffer_stack = (struct yy_buffer_state**)jq_yyrealloc + (yyg->yy_buffer_stack, + num_to_alloc * sizeof(struct yy_buffer_state*) + , yyscanner); + if ( ! yyg->yy_buffer_stack ) + YY_FATAL_ERROR( "out of dynamic memory in jq_yyensure_buffer_stack()" ); + + /* zero only the new slots.*/ + memset(yyg->yy_buffer_stack + yyg->yy_buffer_stack_max, 0, grow_size * sizeof(struct yy_buffer_state*)); + yyg->yy_buffer_stack_max = num_to_alloc; + } +} + +/** Setup the input buffer state to scan directly from a user-specified character buffer. + * @param base the character buffer + * @param size the size in bytes of the character buffer + * @param yyscanner The scanner object. + * @return the newly allocated buffer state object. + */ +YY_BUFFER_STATE jq_yy_scan_buffer (char * base, yy_size_t size , yyscan_t yyscanner) +{ + YY_BUFFER_STATE b; + + if ( size < 2 || + base[size-2] != YY_END_OF_BUFFER_CHAR || + base[size-1] != YY_END_OF_BUFFER_CHAR ) + /* They forgot to leave room for the EOB's. */ + return 0; + + b = (YY_BUFFER_STATE) jq_yyalloc(sizeof( struct yy_buffer_state ) ,yyscanner ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in jq_yy_scan_buffer()" ); + + b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ + b->yy_buf_pos = b->yy_ch_buf = base; + b->yy_is_our_buffer = 0; + b->yy_input_file = 0; + b->yy_n_chars = b->yy_buf_size; + b->yy_is_interactive = 0; + b->yy_at_bol = 1; + b->yy_fill_buffer = 0; + b->yy_buffer_status = YY_BUFFER_NEW; + + jq_yy_switch_to_buffer(b ,yyscanner ); + + return b; +} + +/** Setup the input buffer state to scan a string. The next call to jq_yylex() will + * scan from a @e copy of @a str. + * @param yystr a NUL-terminated string to scan + * @param yyscanner The scanner object. + * @return the newly allocated buffer state object. + * @note If you want to scan bytes that may contain NUL values, then use + * jq_yy_scan_bytes() instead. + */ +YY_BUFFER_STATE jq_yy_scan_string (yyconst char * yystr , yyscan_t yyscanner) +{ + + return jq_yy_scan_bytes(yystr,strlen(yystr) ,yyscanner); +} + +/** Setup the input buffer state to scan the given bytes. The next call to jq_yylex() will + * scan from a @e copy of @a bytes. + * @param yybytes the byte buffer to scan + * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes. + * @param yyscanner The scanner object. + * @return the newly allocated buffer state object. + */ +YY_BUFFER_STATE jq_yy_scan_bytes (yyconst char * yybytes, int _yybytes_len , yyscan_t yyscanner) +{ + YY_BUFFER_STATE b; + char *buf; + yy_size_t n; + int i; + + /* Get memory for full buffer, including space for trailing EOB's. */ + n = _yybytes_len + 2; + buf = (char *) jq_yyalloc(n ,yyscanner ); + if ( ! buf ) + YY_FATAL_ERROR( "out of dynamic memory in jq_yy_scan_bytes()" ); + + for ( i = 0; i < _yybytes_len; ++i ) + buf[i] = yybytes[i]; + + buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR; + + b = jq_yy_scan_buffer(buf,n ,yyscanner); + if ( ! b ) + YY_FATAL_ERROR( "bad buffer in jq_yy_scan_bytes()" ); + + /* It's okay to grow etc. this buffer, and we should throw it + * away when we're done. + */ + b->yy_is_our_buffer = 1; + + return b; +} + + static void yy_push_state (int new_state , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + if ( yyg->yy_start_stack_ptr >= yyg->yy_start_stack_depth ) + { + yy_size_t new_size; + + yyg->yy_start_stack_depth += YY_START_STACK_INCR; + new_size = yyg->yy_start_stack_depth * sizeof( int ); + + if ( ! yyg->yy_start_stack ) + yyg->yy_start_stack = (int *) jq_yyalloc(new_size ,yyscanner ); + + else + yyg->yy_start_stack = (int *) jq_yyrealloc((void *) yyg->yy_start_stack,new_size ,yyscanner ); + + if ( ! yyg->yy_start_stack ) + YY_FATAL_ERROR( "out of memory expanding start-condition stack" ); + } + + yyg->yy_start_stack[yyg->yy_start_stack_ptr++] = YY_START; + + BEGIN(new_state); +} + + static void yy_pop_state (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + if ( --yyg->yy_start_stack_ptr < 0 ) + YY_FATAL_ERROR( "start-condition stack underflow" ); + + BEGIN(yyg->yy_start_stack[yyg->yy_start_stack_ptr]); +} + + static int yy_top_state (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yyg->yy_start_stack[yyg->yy_start_stack_ptr - 1]; +} + +#ifndef YY_EXIT_FAILURE +#define YY_EXIT_FAILURE 2 +#endif + +static void yy_fatal_error (yyconst char* msg , yyscan_t yyscanner) +{ + (void) fprintf( stderr, "%s\n", msg ); + exit( YY_EXIT_FAILURE ); +} + +/* Redefine yyless() so it works in section 3 code. */ + +#undef yyless +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + int yyless_macro_arg = (n); \ + YY_LESS_LINENO(yyless_macro_arg);\ + yytext[yyleng] = yyg->yy_hold_char; \ + yyg->yy_c_buf_p = yytext + yyless_macro_arg; \ + yyg->yy_hold_char = *yyg->yy_c_buf_p; \ + *yyg->yy_c_buf_p = '\0'; \ + yyleng = yyless_macro_arg; \ + } \ + while ( 0 ) + +/* Accessor methods (get/set functions) to struct members. */ + +/** Get the user-defined data for this scanner. + * @param yyscanner The scanner object. + */ +YY_EXTRA_TYPE jq_yyget_extra (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yyextra; +} + +/** Get the current line number. + * @param yyscanner The scanner object. + */ +int jq_yyget_lineno (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + if (! YY_CURRENT_BUFFER) + return 0; + + return yylineno; +} + +/** Get the current column number. + * @param yyscanner The scanner object. + */ +int jq_yyget_column (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + if (! YY_CURRENT_BUFFER) + return 0; + + return yycolumn; +} + +/** Get the input stream. + * @param yyscanner The scanner object. + */ +FILE *jq_yyget_in (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yyin; +} + +/** Get the output stream. + * @param yyscanner The scanner object. + */ +FILE *jq_yyget_out (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yyout; +} + +/** Get the length of the current token. + * @param yyscanner The scanner object. + */ +int jq_yyget_leng (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yyleng; +} + +/** Get the current token. + * @param yyscanner The scanner object. + */ + +char *jq_yyget_text (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yytext; +} + +/** Set the user-defined data. This data is never touched by the scanner. + * @param user_defined The data to be associated with this scanner. + * @param yyscanner The scanner object. + */ +void jq_yyset_extra (YY_EXTRA_TYPE user_defined , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + yyextra = user_defined ; +} + +/** Set the current line number. + * @param line_number + * @param yyscanner The scanner object. + */ +void jq_yyset_lineno (int line_number , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + /* lineno is only valid if an input buffer exists. */ + if (! YY_CURRENT_BUFFER ) + yy_fatal_error( "jq_yyset_lineno called with no buffer" , yyscanner); + + yylineno = line_number; +} + +/** Set the current column. + * @param line_number + * @param yyscanner The scanner object. + */ +void jq_yyset_column (int column_no , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + /* column is only valid if an input buffer exists. */ + if (! YY_CURRENT_BUFFER ) + yy_fatal_error( "jq_yyset_column called with no buffer" , yyscanner); + + yycolumn = column_no; +} + +/** Set the input stream. This does not discard the current + * input buffer. + * @param in_str A readable stream. + * @param yyscanner The scanner object. + * @see jq_yy_switch_to_buffer + */ +void jq_yyset_in (FILE * in_str , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + yyin = in_str ; +} + +void jq_yyset_out (FILE * out_str , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + yyout = out_str ; +} + +int jq_yyget_debug (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yy_flex_debug; +} + +void jq_yyset_debug (int bdebug , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + yy_flex_debug = bdebug ; +} + +/* Accessor methods for yylval and yylloc */ + +YYSTYPE * jq_yyget_lval (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yylval; +} + +void jq_yyset_lval (YYSTYPE * yylval_param , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + yylval = yylval_param; +} + +YYLTYPE *jq_yyget_lloc (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yylloc; +} + +void jq_yyset_lloc (YYLTYPE * yylloc_param , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + yylloc = yylloc_param; +} + +/* User-visible API */ + +/* jq_yylex_init is special because it creates the scanner itself, so it is + * the ONLY reentrant function that doesn't take the scanner as the last argument. + * That's why we explicitly handle the declaration, instead of using our macros. + */ + +int jq_yylex_init(yyscan_t* ptr_yy_globals) + +{ + if (ptr_yy_globals == NULL){ + errno = EINVAL; + return 1; + } + + *ptr_yy_globals = (yyscan_t) jq_yyalloc ( sizeof( struct yyguts_t ), NULL ); + + if (*ptr_yy_globals == NULL){ + errno = ENOMEM; + return 1; + } + + /* By setting to 0xAA, we expose bugs in yy_init_globals. Leave at 0x00 for releases. */ + memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t)); + + return yy_init_globals ( *ptr_yy_globals ); +} + +/* jq_yylex_init_extra has the same functionality as jq_yylex_init, but follows the + * convention of taking the scanner as the last argument. Note however, that + * this is a *pointer* to a scanner, as it will be allocated by this call (and + * is the reason, too, why this function also must handle its own declaration). + * The user defined value in the first argument will be available to jq_yyalloc in + * the yyextra field. + */ + +int jq_yylex_init_extra(YY_EXTRA_TYPE yy_user_defined,yyscan_t* ptr_yy_globals ) + +{ + struct yyguts_t dummy_yyguts; + + jq_yyset_extra (yy_user_defined, &dummy_yyguts); + + if (ptr_yy_globals == NULL){ + errno = EINVAL; + return 1; + } + + *ptr_yy_globals = (yyscan_t) jq_yyalloc ( sizeof( struct yyguts_t ), &dummy_yyguts ); + + if (*ptr_yy_globals == NULL){ + errno = ENOMEM; + return 1; + } + + /* By setting to 0xAA, we expose bugs in + yy_init_globals. Leave at 0x00 for releases. */ + memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t)); + + jq_yyset_extra (yy_user_defined, *ptr_yy_globals); + + return yy_init_globals ( *ptr_yy_globals ); +} + +static int yy_init_globals (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + /* Initialization is the same as for the non-reentrant scanner. + * This function is called from jq_yylex_destroy(), so don't allocate here. + */ + + yyg->yy_buffer_stack = 0; + yyg->yy_buffer_stack_top = 0; + yyg->yy_buffer_stack_max = 0; + yyg->yy_c_buf_p = (char *) 0; + yyg->yy_init = 0; + yyg->yy_start = 0; + + yyg->yy_start_stack_ptr = 0; + yyg->yy_start_stack_depth = 0; + yyg->yy_start_stack = NULL; + +/* Defined in main.c */ +#ifdef YY_STDINIT + yyin = stdin; + yyout = stdout; +#else + yyin = (FILE *) 0; + yyout = (FILE *) 0; +#endif + + /* For future reference: Set errno on error, since we are called by + * jq_yylex_init() + */ + return 0; +} + +/* jq_yylex_destroy is for both reentrant and non-reentrant scanners. */ +int jq_yylex_destroy (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + /* Pop the buffer stack, destroying each element. */ + while(YY_CURRENT_BUFFER){ + jq_yy_delete_buffer(YY_CURRENT_BUFFER ,yyscanner ); + YY_CURRENT_BUFFER_LVALUE = NULL; + jq_yypop_buffer_state(yyscanner); + } + + /* Destroy the stack itself. */ + jq_yyfree(yyg->yy_buffer_stack ,yyscanner); + yyg->yy_buffer_stack = NULL; + + /* Destroy the start condition stack. */ + jq_yyfree(yyg->yy_start_stack ,yyscanner ); + yyg->yy_start_stack = NULL; + + /* Reset the globals. This is important in a non-reentrant scanner so the next time + * jq_yylex() is called, initialization will occur. */ + yy_init_globals( yyscanner); + + /* Destroy the main struct (reentrant only). */ + jq_yyfree ( yyscanner , yyscanner ); + yyscanner = NULL; + return 0; +} + +/* + * Internal utility routines. + */ + +#ifndef yytext_ptr +static void yy_flex_strncpy (char* s1, yyconst char * s2, int n , yyscan_t yyscanner) +{ + register int i; + for ( i = 0; i < n; ++i ) + s1[i] = s2[i]; +} +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen (yyconst char * s , yyscan_t yyscanner) +{ + register int n; + for ( n = 0; s[n]; ++n ) + ; + + return n; +} +#endif + +void *jq_yyalloc (yy_size_t size , yyscan_t yyscanner) +{ + return (void *) malloc( size ); +} + +void *jq_yyrealloc (void * ptr, yy_size_t size , yyscan_t yyscanner) +{ + /* The cast to (char *) in the following accommodates both + * implementations that use char* generic pointers, and those + * that use void* generic pointers. It works with the latter + * because both ANSI C and C++ allow castless assignment from + * any pointer type to void*, and deal with argument conversions + * as though doing an assignment. + */ + return (void *) realloc( (char *) ptr, size ); +} + +void jq_yyfree (void * ptr , yyscan_t yyscanner) +{ + free( (char *) ptr ); /* see jq_yyrealloc() for (char *) cast */ +} + +#define YYTABLES_NAME "yytables" + +#line 104 "lexer.l" + + +/* perhaps these should be calls... */ +/* +"true" { return TRUE; } +"false" { return FALSE; } +"null" { return NULL; } +*/ +static int try_exit(int c, int state, yyscan_t yyscanner) { + char match = 0; + int ret; + switch (state) { + case IN_PAREN: match = ret = ')'; break; + case IN_BRACKET: match = ret = ']'; break; + case IN_BRACE: match = ret = '}'; break; + + case IN_QQINTERP: + match = ')'; + ret = QQSTRING_INTERP_END; + break; + } + assert(match); + if (match == c) { + yy_pop_state(yyscanner); + return ret; + } else { + // FIXME: should we pop? Give a better error at least + return INVALID_CHARACTER; + } +} + +static int enter(int c, int currstate, yyscan_t yyscanner) { + int state = 0; + switch (c) { + case '(': state = IN_PAREN; break; + case '[': state = IN_BRACKET; break; + case '{': state = IN_BRACE; break; + case QQSTRING_INTERP_START: state = IN_QQINTERP; break; + } + assert(state); + yy_push_state(state, yyscanner); + return c; +} + diff --git a/lexer.gen.h b/lexer.gen.h new file mode 100644 index 00000000..5804e150 --- /dev/null +++ b/lexer.gen.h @@ -0,0 +1,362 @@ +#ifndef jq_yyHEADER_H +#define jq_yyHEADER_H 1 +#define jq_yyIN_HEADER 1 + +#line 6 "lexer.gen.h" + +#line 8 "lexer.gen.h" + +#define YY_INT_ALIGNED short int + +/* A lexical scanner generated by flex */ + +#define FLEX_SCANNER +#define YY_FLEX_MAJOR_VERSION 2 +#define YY_FLEX_MINOR_VERSION 5 +#define YY_FLEX_SUBMINOR_VERSION 35 +#if YY_FLEX_SUBMINOR_VERSION > 0 +#define FLEX_BETA +#endif + +/* First, we deal with platform-specific or compiler-specific issues. */ + +/* begin standard C headers. */ +#include +#include +#include +#include + +/* end standard C headers. */ + +/* flex integer type definitions */ + +#ifndef FLEXINT_H +#define FLEXINT_H + +/* C99 systems have . Non-C99 systems may or may not. */ + +#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L + +/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, + * if you want the limit (max/min) macros for int types. + */ +#ifndef __STDC_LIMIT_MACROS +#define __STDC_LIMIT_MACROS 1 +#endif + +#include +typedef int8_t flex_int8_t; +typedef uint8_t flex_uint8_t; +typedef int16_t flex_int16_t; +typedef uint16_t flex_uint16_t; +typedef int32_t flex_int32_t; +typedef uint32_t flex_uint32_t; +#else +typedef signed char flex_int8_t; +typedef short int flex_int16_t; +typedef int flex_int32_t; +typedef unsigned char flex_uint8_t; +typedef unsigned short int flex_uint16_t; +typedef unsigned int flex_uint32_t; + +/* Limits of integral types. */ +#ifndef INT8_MIN +#define INT8_MIN (-128) +#endif +#ifndef INT16_MIN +#define INT16_MIN (-32767-1) +#endif +#ifndef INT32_MIN +#define INT32_MIN (-2147483647-1) +#endif +#ifndef INT8_MAX +#define INT8_MAX (127) +#endif +#ifndef INT16_MAX +#define INT16_MAX (32767) +#endif +#ifndef INT32_MAX +#define INT32_MAX (2147483647) +#endif +#ifndef UINT8_MAX +#define UINT8_MAX (255U) +#endif +#ifndef UINT16_MAX +#define UINT16_MAX (65535U) +#endif +#ifndef UINT32_MAX +#define UINT32_MAX (4294967295U) +#endif + +#endif /* ! C99 */ + +#endif /* ! FLEXINT_H */ + +#ifdef __cplusplus + +/* The "const" storage-class-modifier is valid. */ +#define YY_USE_CONST + +#else /* ! __cplusplus */ + +/* C99 requires __STDC__ to be defined as 1. */ +#if defined (__STDC__) + +#define YY_USE_CONST + +#endif /* defined (__STDC__) */ +#endif /* ! __cplusplus */ + +#ifdef YY_USE_CONST +#define yyconst const +#else +#define yyconst +#endif + +/* An opaque pointer. */ +#ifndef YY_TYPEDEF_YY_SCANNER_T +#define YY_TYPEDEF_YY_SCANNER_T +typedef void* yyscan_t; +#endif + +/* For convenience, these vars (plus the bison vars far below) + are macros in the reentrant scanner. */ +#define yyin yyg->yyin_r +#define yyout yyg->yyout_r +#define yyextra yyg->yyextra_r +#define yyleng yyg->yyleng_r +#define yytext yyg->yytext_r +#define yylineno (YY_CURRENT_BUFFER_LVALUE->yy_bs_lineno) +#define yycolumn (YY_CURRENT_BUFFER_LVALUE->yy_bs_column) +#define yy_flex_debug yyg->yy_flex_debug_r + +/* Size of default input buffer. */ +#ifndef YY_BUF_SIZE +#ifdef __ia64__ +/* On IA-64, the buffer size is 16k, not 8k. + * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case. + * Ditto for the __ia64__ case accordingly. + */ +#define YY_BUF_SIZE 32768 +#else +#define YY_BUF_SIZE 16384 +#endif /* __ia64__ */ +#endif + +#ifndef YY_TYPEDEF_YY_BUFFER_STATE +#define YY_TYPEDEF_YY_BUFFER_STATE +typedef struct yy_buffer_state *YY_BUFFER_STATE; +#endif + +#ifndef YY_TYPEDEF_YY_SIZE_T +#define YY_TYPEDEF_YY_SIZE_T +typedef size_t yy_size_t; +#endif + +#ifndef YY_STRUCT_YY_BUFFER_STATE +#define YY_STRUCT_YY_BUFFER_STATE +struct yy_buffer_state + { + FILE *yy_input_file; + + char *yy_ch_buf; /* input buffer */ + char *yy_buf_pos; /* current position in input buffer */ + + /* Size of input buffer in bytes, not including room for EOB + * characters. + */ + yy_size_t yy_buf_size; + + /* Number of characters read into yy_ch_buf, not including EOB + * characters. + */ + int yy_n_chars; + + /* Whether we "own" the buffer - i.e., we know we created it, + * and can realloc() it to grow it, and should free() it to + * delete it. + */ + int yy_is_our_buffer; + + /* Whether this is an "interactive" input source; if so, and + * if we're using stdio for input, then we want to use getc() + * instead of fread(), to make sure we stop fetching input after + * each newline. + */ + int yy_is_interactive; + + /* Whether we're considered to be at the beginning of a line. + * If so, '^' rules will be active on the next match, otherwise + * not. + */ + int yy_at_bol; + + int yy_bs_lineno; /**< The line count. */ + int yy_bs_column; /**< The column count. */ + + /* Whether to try to fill the input buffer when we reach the + * end of it. + */ + int yy_fill_buffer; + + int yy_buffer_status; + + }; +#endif /* !YY_STRUCT_YY_BUFFER_STATE */ + +void jq_yyrestart (FILE *input_file ,yyscan_t yyscanner ); +void jq_yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner ); +YY_BUFFER_STATE jq_yy_create_buffer (FILE *file,int size ,yyscan_t yyscanner ); +void jq_yy_delete_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner ); +void jq_yy_flush_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner ); +void jq_yypush_buffer_state (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner ); +void jq_yypop_buffer_state (yyscan_t yyscanner ); + +YY_BUFFER_STATE jq_yy_scan_buffer (char *base,yy_size_t size ,yyscan_t yyscanner ); +YY_BUFFER_STATE jq_yy_scan_string (yyconst char *yy_str ,yyscan_t yyscanner ); +YY_BUFFER_STATE jq_yy_scan_bytes (yyconst char *bytes,int len ,yyscan_t yyscanner ); + +void *jq_yyalloc (yy_size_t ,yyscan_t yyscanner ); +void *jq_yyrealloc (void *,yy_size_t ,yyscan_t yyscanner ); +void jq_yyfree (void * ,yyscan_t yyscanner ); + +/* Begin user sect3 */ + +#define jq_yywrap(n) 1 +#define YY_SKIP_YYWRAP + +#define yytext_ptr yytext_r + +#ifdef YY_HEADER_EXPORT_START_CONDITIONS +#define INITIAL 0 +#define IN_PAREN 1 +#define IN_BRACKET 2 +#define IN_BRACE 3 +#define IN_QQINTERP 4 +#define IN_QQSTRING 5 + +#endif + +#ifndef YY_NO_UNISTD_H +/* Special case for "unistd.h", since it is non-ANSI. We include it way + * down here because we want the user's section 1 to have been scanned first. + * The user has a chance to override it with an option. + */ +#include +#endif + +#define YY_EXTRA_TYPE int + +int jq_yylex_init (yyscan_t* scanner); + +int jq_yylex_init_extra (YY_EXTRA_TYPE user_defined,yyscan_t* scanner); + +/* Accessor methods to globals. + These are made visible to non-reentrant scanners for convenience. */ + +int jq_yylex_destroy (yyscan_t yyscanner ); + +int jq_yyget_debug (yyscan_t yyscanner ); + +void jq_yyset_debug (int debug_flag ,yyscan_t yyscanner ); + +YY_EXTRA_TYPE jq_yyget_extra (yyscan_t yyscanner ); + +void jq_yyset_extra (YY_EXTRA_TYPE user_defined ,yyscan_t yyscanner ); + +FILE *jq_yyget_in (yyscan_t yyscanner ); + +void jq_yyset_in (FILE * in_str ,yyscan_t yyscanner ); + +FILE *jq_yyget_out (yyscan_t yyscanner ); + +void jq_yyset_out (FILE * out_str ,yyscan_t yyscanner ); + +int jq_yyget_leng (yyscan_t yyscanner ); + +char *jq_yyget_text (yyscan_t yyscanner ); + +int jq_yyget_lineno (yyscan_t yyscanner ); + +void jq_yyset_lineno (int line_number ,yyscan_t yyscanner ); + +YYSTYPE * jq_yyget_lval (yyscan_t yyscanner ); + +void jq_yyset_lval (YYSTYPE * yylval_param ,yyscan_t yyscanner ); + + YYLTYPE *jq_yyget_lloc (yyscan_t yyscanner ); + + void jq_yyset_lloc (YYLTYPE * yylloc_param ,yyscan_t yyscanner ); + +/* Macros after this point can all be overridden by user definitions in + * section 1. + */ + +#ifndef YY_SKIP_YYWRAP +#ifdef __cplusplus +extern "C" int jq_yywrap (yyscan_t yyscanner ); +#else +extern int jq_yywrap (yyscan_t yyscanner ); +#endif +#endif + +#ifndef yytext_ptr +static void yy_flex_strncpy (char *,yyconst char *,int ,yyscan_t yyscanner); +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen (yyconst char * ,yyscan_t yyscanner); +#endif + +#ifndef YY_NO_INPUT + +#endif + +/* Amount of stuff to slurp up with each read. */ +#ifndef YY_READ_BUF_SIZE +#ifdef __ia64__ +/* On IA-64, the buffer size is 16k, not 8k */ +#define YY_READ_BUF_SIZE 16384 +#else +#define YY_READ_BUF_SIZE 8192 +#endif /* __ia64__ */ +#endif + +/* Number of entries by which start-condition stack grows. */ +#ifndef YY_START_STACK_INCR +#define YY_START_STACK_INCR 25 +#endif + +/* Default declaration of generated scanner - a define so the user can + * easily add parameters. + */ +#ifndef YY_DECL +#define YY_DECL_IS_OURS 1 + +extern int jq_yylex \ + (YYSTYPE * yylval_param,YYLTYPE * yylloc_param ,yyscan_t yyscanner); + +#define YY_DECL int jq_yylex \ + (YYSTYPE * yylval_param, YYLTYPE * yylloc_param , yyscan_t yyscanner) +#endif /* !YY_DECL */ + +/* yy_get_previous_state - get the state just before the EOB char was reached */ + +#undef YY_NEW_FILE +#undef YY_FLUSH_BUFFER +#undef yy_set_bol +#undef yy_new_buffer +#undef yy_set_interactive +#undef YY_DO_BEFORE_ACTION + +#ifdef YY_DECL_IS_OURS +#undef YY_DECL_IS_OURS +#undef YY_DECL +#endif + +#line 104 "lexer.l" + + +#line 361 "lexer.gen.h" +#undef jq_yyIN_HEADER +#endif /* jq_yyHEADER_H */ diff --git a/parser.gen.c b/parser.gen.c new file mode 100644 index 00000000..346a94b9 --- /dev/null +++ b/parser.gen.c @@ -0,0 +1,2830 @@ +/* A Bison parser, made by GNU Bison 2.5. */ + +/* Bison implementation for Yacc-like parsers in C + + Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc. + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . */ + +/* As a special exception, you may create a larger work that contains + part or all of the Bison parser skeleton and distribute that work + under terms of your choice, so long as that work isn't itself a + parser generator using the skeleton or a modified version thereof + as a parser skeleton. Alternatively, if you modify or redistribute + the parser skeleton itself, you may (at your option) remove this + special exception, which will cause the skeleton and the resulting + Bison output files to be licensed under the GNU General Public + License without this special exception. + + This special exception was added by the Free Software Foundation in + version 2.2 of Bison. */ + +/* C LALR(1) parser skeleton written by Richard Stallman, by + simplifying the original so-called "semantic" parser. */ + +/* All symbols defined below should begin with yy or YY, to avoid + infringing on user name space. This should be done even for local + variables, as they might otherwise be expanded by user macros. + There are some unavoidable exceptions within include files to + define necessary library symbols; they are noted "INFRINGES ON + USER NAME SPACE" below. */ + +/* Identify Bison output. */ +#define YYBISON 1 + +/* Bison version. */ +#define YYBISON_VERSION "2.5" + +/* Skeleton name. */ +#define YYSKELETON_NAME "yacc.c" + +/* Pure parsers. */ +#define YYPURE 1 + +/* Push parsers. */ +#define YYPUSH 0 + +/* Pull parsers. */ +#define YYPULL 1 + +/* Using locations. */ +#define YYLSP_NEEDED 1 + + + +/* Copy the first part of user declarations. */ + +/* Line 268 of yacc.c */ +#line 1 "parser.y" + +#include +#include +#include "compile.h" + + +/* Line 268 of yacc.c */ +#line 78 "parser.gen.c" + +/* Enabling traces. */ +#ifndef YYDEBUG +# define YYDEBUG 0 +#endif + +/* Enabling verbose error messages. */ +#ifdef YYERROR_VERBOSE +# undef YYERROR_VERBOSE +# define YYERROR_VERBOSE 1 +#else +# define YYERROR_VERBOSE 1 +#endif + +/* Enabling the token table. */ +#ifndef YYTOKEN_TABLE +# define YYTOKEN_TABLE 0 +#endif + +/* "%code requires" blocks. */ + +/* Line 288 of yacc.c */ +#line 6 "parser.y" + +#include "locfile.h" +#define YYLTYPE location +#define YYLLOC_DEFAULT(Loc, Rhs, N) \ + do { \ + if (N) { \ + (Loc).start = YYRHSLOC(Rhs, 1).start; \ + (Loc).end = YYRHSLOC(Rhs, N).end; \ + } else { \ + (Loc).start = YYRHSLOC(Rhs, 0).end; \ + (Loc).end = YYRHSLOC(Rhs, 0).end; \ + } \ + } while (0) + + + +/* Line 288 of yacc.c */ +#line 119 "parser.gen.c" + +/* Tokens. */ +#ifndef YYTOKENTYPE +# define YYTOKENTYPE + /* Put the tokens into the symbol table, so that GDB and other debuggers + know about them. */ + enum yytokentype { + INVALID_CHARACTER = 258, + IDENT = 259, + LITERAL = 260, + EQ = 261, + DEFINEDOR = 262, + AS = 263, + DEF = 264, + IF = 265, + THEN = 266, + ELSE = 267, + ELSE_IF = 268, + END = 269, + AND = 270, + OR = 271, + SETPIPE = 272, + SETPLUS = 273, + SETMINUS = 274, + SETMULT = 275, + SETDIV = 276, + SETDEFINEDOR = 277, + LESSEQ = 278, + GREATEREQ = 279, + QQSTRING_START = 280, + QQSTRING_TEXT = 281, + QQSTRING_INTERP_START = 282, + QQSTRING_INTERP_END = 283, + QQSTRING_END = 284 + }; +#endif + + + +#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED +typedef union YYSTYPE +{ + +/* Line 293 of yacc.c */ +#line 24 "parser.y" + + jv literal; + block blk; + + + +/* Line 293 of yacc.c */ +#line 172 "parser.gen.c" +} YYSTYPE; +# define YYSTYPE_IS_TRIVIAL 1 +# define yystype YYSTYPE /* obsolescent; will be withdrawn */ +# define YYSTYPE_IS_DECLARED 1 +#endif + +#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED +typedef struct YYLTYPE +{ + int first_line; + int first_column; + int last_line; + int last_column; +} YYLTYPE; +# define yyltype YYLTYPE /* obsolescent; will be withdrawn */ +# define YYLTYPE_IS_DECLARED 1 +# define YYLTYPE_IS_TRIVIAL 1 +#endif + + +/* Copy the second part of user declarations. */ + +/* Line 343 of yacc.c */ +#line 85 "parser.y" + +#include "lexer.gen.h" +#define FAIL(loc, msg) \ + do { \ + location l = loc; \ + yyerror(&l, answer, errors, locations, lexer, msg); \ + /*YYERROR*/; \ + } while (0) + +void yyerror(YYLTYPE* loc, block* answer, int* errors, + struct locfile* locations, yyscan_t lexer, const char *s){ + (*errors)++; + locfile_locate(locations, *loc, "error: %s", s); +} + +int yylex(YYSTYPE* yylval, YYLTYPE* yylloc, block* answer, int* errors, + struct locfile* locations, yyscan_t lexer) { + while (1) { + int tok = jq_yylex(yylval, yylloc, lexer); + if (tok == INVALID_CHARACTER) { + FAIL(*yylloc, "Invalid character"); + } else { + if ((tok == LITERAL || tok == QQSTRING_TEXT) && !jv_is_valid(yylval->literal)) { + jv msg = jv_invalid_get_msg(jv_copy(yylval->literal)); + if (jv_get_kind(msg) == JV_KIND_STRING) { + FAIL(*yylloc, jv_string_value(msg)); + } else { + FAIL(*yylloc, "Invalid literal"); + } + jv_free(msg); + jv_free(yylval->literal); + yylval->literal = jv_null(); + } + return tok; + } + } +} + +static block gen_dictpair(block k, block v) { + block b = gen_subexp(k); + block_append(&b, gen_subexp(v)); + block_append(&b, gen_op_simple(INSERT)); + return b; +} + +static block gen_index(block obj, block key) { + return block_join(obj, block_join(gen_subexp(key), gen_op_simple(INDEX))); +} + +static block gen_binop(block a, block b, int op) { + const char* funcname = 0; + switch (op) { + case '+': funcname = "_plus"; break; + case '-': funcname = "_minus"; break; + case '*': funcname = "_multiply"; break; + case '/': funcname = "_divide"; break; + case EQ: funcname = "_equal"; break; + case '<': funcname = "_less"; break; + case '>': funcname = "_greater"; break; + case LESSEQ: funcname = "_lesseq"; break; + case GREATEREQ: funcname = "_greatereq"; break; + } + assert(funcname); + + block c = gen_noop(); + block_append(&c, gen_subexp(a)); + block_append(&c, gen_subexp(b)); + block_append(&c, gen_op_call(CALL_1_1, gen_op_block_unbound(CLOSURE_REF, funcname))); + return c; +} + +static block gen_format(block a) { + return block_join(a, gen_op_call(CALL_1_1, gen_op_block_unbound(CLOSURE_REF, "tostring"))); +} + +static block gen_update(block a, block op, int optype) { + block assign = a; + block_append(&assign, gen_op_simple(DUP)); + if (optype) { + op = gen_binop(gen_noop(), op, optype); + } + block_append(&assign, op); + return gen_assign(assign); +} + + + +/* Line 343 of yacc.c */ +#line 285 "parser.gen.c" + +#ifdef short +# undef short +#endif + +#ifdef YYTYPE_UINT8 +typedef YYTYPE_UINT8 yytype_uint8; +#else +typedef unsigned char yytype_uint8; +#endif + +#ifdef YYTYPE_INT8 +typedef YYTYPE_INT8 yytype_int8; +#elif (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +typedef signed char yytype_int8; +#else +typedef short int yytype_int8; +#endif + +#ifdef YYTYPE_UINT16 +typedef YYTYPE_UINT16 yytype_uint16; +#else +typedef unsigned short int yytype_uint16; +#endif + +#ifdef YYTYPE_INT16 +typedef YYTYPE_INT16 yytype_int16; +#else +typedef short int yytype_int16; +#endif + +#ifndef YYSIZE_T +# ifdef __SIZE_TYPE__ +# define YYSIZE_T __SIZE_TYPE__ +# elif defined size_t +# define YYSIZE_T size_t +# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +# include /* INFRINGES ON USER NAME SPACE */ +# define YYSIZE_T size_t +# else +# define YYSIZE_T unsigned int +# endif +#endif + +#define YYSIZE_MAXIMUM ((YYSIZE_T) -1) + +#ifndef YY_ +# if defined YYENABLE_NLS && YYENABLE_NLS +# if ENABLE_NLS +# include /* INFRINGES ON USER NAME SPACE */ +# define YY_(msgid) dgettext ("bison-runtime", msgid) +# endif +# endif +# ifndef YY_ +# define YY_(msgid) msgid +# endif +#endif + +/* Suppress unused-variable warnings by "using" E. */ +#if ! defined lint || defined __GNUC__ +# define YYUSE(e) ((void) (e)) +#else +# define YYUSE(e) /* empty */ +#endif + +/* Identity function, used to suppress warnings about constant conditions. */ +#ifndef lint +# define YYID(n) (n) +#else +#if (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +static int +YYID (int yyi) +#else +static int +YYID (yyi) + int yyi; +#endif +{ + return yyi; +} +#endif + +#if ! defined yyoverflow || YYERROR_VERBOSE + +/* The parser invokes alloca or malloc; define the necessary symbols. */ + +# ifdef YYSTACK_USE_ALLOCA +# if YYSTACK_USE_ALLOCA +# ifdef __GNUC__ +# define YYSTACK_ALLOC __builtin_alloca +# elif defined __BUILTIN_VA_ARG_INCR +# include /* INFRINGES ON USER NAME SPACE */ +# elif defined _AIX +# define YYSTACK_ALLOC __alloca +# elif defined _MSC_VER +# include /* INFRINGES ON USER NAME SPACE */ +# define alloca _alloca +# else +# define YYSTACK_ALLOC alloca +# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +# include /* INFRINGES ON USER NAME SPACE */ +# ifndef EXIT_SUCCESS +# define EXIT_SUCCESS 0 +# endif +# endif +# endif +# endif +# endif + +# ifdef YYSTACK_ALLOC + /* Pacify GCC's `empty if-body' warning. */ +# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0)) +# ifndef YYSTACK_ALLOC_MAXIMUM + /* The OS might guarantee only one guard page at the bottom of the stack, + and a page size can be as small as 4096 bytes. So we cannot safely + invoke alloca (N) if N exceeds 4096. Use a slightly smaller number + to allow for a few compiler-allocated temporary stack slots. */ +# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */ +# endif +# else +# define YYSTACK_ALLOC YYMALLOC +# define YYSTACK_FREE YYFREE +# ifndef YYSTACK_ALLOC_MAXIMUM +# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM +# endif +# if (defined __cplusplus && ! defined EXIT_SUCCESS \ + && ! ((defined YYMALLOC || defined malloc) \ + && (defined YYFREE || defined free))) +# include /* INFRINGES ON USER NAME SPACE */ +# ifndef EXIT_SUCCESS +# define EXIT_SUCCESS 0 +# endif +# endif +# ifndef YYMALLOC +# define YYMALLOC malloc +# if ! defined malloc && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ +# endif +# endif +# ifndef YYFREE +# define YYFREE free +# if ! defined free && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +void free (void *); /* INFRINGES ON USER NAME SPACE */ +# endif +# endif +# endif +#endif /* ! defined yyoverflow || YYERROR_VERBOSE */ + + +#if (! defined yyoverflow \ + && (! defined __cplusplus \ + || (defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL \ + && defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) + +/* A type that is properly aligned for any stack member. */ +union yyalloc +{ + yytype_int16 yyss_alloc; + YYSTYPE yyvs_alloc; + YYLTYPE yyls_alloc; +}; + +/* The size of the maximum gap between one aligned stack and the next. */ +# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) + +/* The size of an array large to enough to hold all stacks, each with + N elements. */ +# define YYSTACK_BYTES(N) \ + ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \ + + 2 * YYSTACK_GAP_MAXIMUM) + +# 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 \ + { \ + YYSIZE_T yynewbytes; \ + YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \ + Stack = &yyptr->Stack_alloc; \ + yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ + yyptr += yynewbytes / sizeof (*yyptr); \ + } \ + while (YYID (0)) + +#endif + +#if defined YYCOPY_NEEDED && YYCOPY_NEEDED +/* Copy COUNT objects from FROM to TO. The source and destination do + not overlap. */ +# ifndef YYCOPY +# if defined __GNUC__ && 1 < __GNUC__ +# define YYCOPY(To, From, Count) \ + __builtin_memcpy (To, From, (Count) * sizeof (*(From))) +# else +# define YYCOPY(To, From, Count) \ + do \ + { \ + YYSIZE_T yyi; \ + for (yyi = 0; yyi < (Count); yyi++) \ + (To)[yyi] = (From)[yyi]; \ + } \ + while (YYID (0)) +# endif +# endif +#endif /* !YYCOPY_NEEDED */ + +/* YYFINAL -- State number of the termination state. */ +#define YYFINAL 35 +/* YYLAST -- Last index in YYTABLE. */ +#define YYLAST 808 + +/* YYNTOKENS -- Number of terminals. */ +#define YYNTOKENS 49 +/* YYNNTS -- Number of nonterminals. */ +#define YYNNTS 12 +/* YYNRULES -- Number of rules. */ +#define YYNRULES 68 +/* YYNRULES -- Number of states. */ +#define YYNSTATES 147 + +/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ +#define YYUNDEFTOK 2 +#define YYMAXUTOK 284 + +#define YYTRANSLATE(YYX) \ + ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) + +/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ +static const yytype_uint8 yytranslate[] = +{ + 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 40, 2, 2, 2, + 42, 43, 38, 36, 32, 37, 44, 39, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 41, 30, + 34, 33, 35, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 45, 2, 46, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 47, 31, 48, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, + 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, + 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, + 25, 26, 27, 28, 29 +}; + +#if YYDEBUG +/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in + YYRHS. */ +static const yytype_uint8 yyprhs[] = +{ + 0, 0, 3, 5, 7, 8, 11, 14, 21, 27, + 31, 35, 39, 43, 47, 51, 55, 59, 63, 67, + 71, 75, 79, 83, 87, 91, 95, 99, 103, 107, + 111, 115, 117, 119, 123, 129, 138, 139, 142, 147, + 153, 157, 161, 163, 165, 169, 172, 177, 181, 183, + 187, 191, 194, 198, 201, 203, 208, 212, 216, 221, + 225, 226, 228, 232, 236, 240, 244, 246, 252 +}; + +/* YYRHS -- A `-1'-separated list of the rules' RHS. */ +static const yytype_int8 yyrhs[] = +{ + 50, 0, -1, 52, -1, 51, -1, -1, 54, 51, + -1, 54, 52, -1, 58, 8, 40, 4, 31, 52, + -1, 10, 52, 11, 52, 56, -1, 10, 52, 1, + -1, 52, 33, 52, -1, 52, 16, 52, -1, 52, + 15, 52, -1, 52, 7, 52, -1, 52, 22, 52, + -1, 52, 17, 52, -1, 52, 31, 52, -1, 52, + 32, 52, -1, 52, 36, 52, -1, 52, 18, 52, + -1, 52, 37, 52, -1, 52, 19, 52, -1, 52, + 38, 52, -1, 52, 20, 52, -1, 52, 39, 52, + -1, 52, 21, 52, -1, 52, 6, 52, -1, 52, + 34, 52, -1, 52, 35, 52, -1, 52, 23, 52, + -1, 52, 24, 52, -1, 53, -1, 58, -1, 25, + 55, 29, -1, 9, 4, 41, 52, 30, -1, 9, + 4, 42, 4, 43, 41, 52, 30, -1, -1, 55, + 26, -1, 55, 27, 52, 28, -1, 13, 52, 11, + 52, 56, -1, 12, 52, 14, -1, 57, 31, 57, + -1, 58, -1, 44, -1, 58, 44, 4, -1, 44, + 4, -1, 58, 45, 52, 46, -1, 58, 45, 46, + -1, 5, -1, 42, 52, 43, -1, 45, 52, 46, + -1, 45, 46, -1, 47, 59, 48, -1, 40, 4, + -1, 4, -1, 4, 42, 52, 43, -1, 42, 1, + 43, -1, 45, 1, 46, -1, 58, 45, 1, 46, + -1, 47, 1, 48, -1, -1, 60, -1, 60, 32, + 59, -1, 1, 32, 59, -1, 4, 41, 57, -1, + 53, 41, 57, -1, 4, -1, 42, 52, 43, 41, + 57, -1, 42, 1, 43, 41, 57, -1 +}; + +/* YYRLINE[YYN] -- source line where rule number YYN was defined. */ +static const yytype_uint16 yyrline[] = +{ + 0, 174, 174, 177, 182, 185, 190, 194, 201, 204, + 209, 218, 222, 226, 230, 234, 238, 242, 246, 250, + 254, 258, 262, 266, 270, 274, 278, 282, 286, 290, + 294, 298, 302, 307, 312, 318, 326, 329, 332, 338, + 341, 346, 350, 356, 359, 362, 366, 369, 372, 375, + 378, 381, 384, 389, 393, 397, 407, 408, 409, 410, + 413, 416, 417, 418, 421, 424, 427, 431, 434 +}; +#endif + +#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE +/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. + First, the terminals, then, starting at YYNTOKENS, nonterminals. */ +static const char *const yytname[] = +{ + "$end", "error", "$undefined", "INVALID_CHARACTER", "IDENT", "LITERAL", + "\"==\"", "\"//\"", "\"as\"", "\"def\"", "\"if\"", "\"then\"", + "\"else\"", "\"elif\"", "\"end\"", "\"and\"", "\"or\"", "\"|=\"", + "\"+=\"", "\"-=\"", "\"*=\"", "\"/=\"", "\"//=\"", "\"<=\"", "\">=\"", + "QQSTRING_START", "QQSTRING_TEXT", "QQSTRING_INTERP_START", + "QQSTRING_INTERP_END", "QQSTRING_END", "';'", "'|'", "','", "'='", "'<'", + "'>'", "'+'", "'-'", "'*'", "'/'", "'$'", "':'", "'('", "')'", "'.'", + "'['", "']'", "'{'", "'}'", "$accept", "TopLevel", "FuncDefs", "Exp", + "String", "FuncDef", "QQString", "ElseBody", "ExpD", "Term", "MkDict", + "MkDictPair", 0 +}; +#endif + +# ifdef YYPRINT +/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to + token YYLEX-NUM. */ +static const yytype_uint16 yytoknum[] = +{ + 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, + 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, + 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, + 59, 124, 44, 61, 60, 62, 43, 45, 42, 47, + 36, 58, 40, 41, 46, 91, 93, 123, 125 +}; +# endif + +/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ +static const yytype_uint8 yyr1[] = +{ + 0, 49, 50, 50, 51, 51, 52, 52, 52, 52, + 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, + 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, + 52, 52, 52, 53, 54, 54, 55, 55, 55, 56, + 56, 57, 57, 58, 58, 58, 58, 58, 58, 58, + 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, + 59, 59, 59, 59, 60, 60, 60, 60, 60 +}; + +/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ +static const yytype_uint8 yyr2[] = +{ + 0, 2, 1, 1, 0, 2, 2, 6, 5, 3, + 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, + 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, + 3, 1, 1, 3, 5, 8, 0, 2, 4, 5, + 3, 3, 1, 1, 3, 2, 4, 3, 1, 3, + 3, 2, 3, 2, 1, 4, 3, 3, 4, 3, + 0, 1, 3, 3, 3, 3, 1, 5, 5 +}; + +/* YYDEFACT[STATE-NAME] -- Default reduction number in state STATE-NUM. + Performed when YYTABLE doesn't specify something else to do. Zero + means the default is an error. */ +static const yytype_uint8 yydefact[] = +{ + 4, 54, 48, 0, 0, 36, 0, 0, 43, 0, + 0, 0, 3, 2, 31, 4, 32, 0, 0, 0, + 0, 0, 53, 0, 0, 45, 0, 51, 0, 0, + 66, 0, 0, 0, 61, 1, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 5, 6, 0, + 0, 0, 0, 0, 0, 9, 0, 37, 0, 33, + 56, 49, 57, 50, 0, 59, 0, 0, 0, 0, + 52, 0, 26, 13, 12, 11, 15, 19, 21, 23, + 25, 14, 29, 30, 16, 17, 10, 27, 28, 18, + 20, 22, 24, 0, 44, 0, 47, 0, 55, 0, + 0, 0, 0, 0, 63, 64, 42, 0, 0, 65, + 62, 0, 58, 46, 34, 0, 0, 0, 8, 38, + 0, 0, 0, 0, 0, 0, 0, 41, 68, 67, + 7, 0, 40, 0, 35, 0, 39 +}; + +/* YYDEFGOTO[NTERM-NUM]. */ +static const yytype_int16 yydefgoto[] = +{ + -1, 11, 12, 58, 14, 20, 21, 128, 115, 16, + 33, 34 +}; + +/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing + STATE-NUM. */ +#define YYPACT_NINF -74 +static const yytype_int16 yypact[] = +{ + 194, -40, -74, 10, 194, -74, 16, 137, 18, 77, + 63, 28, -74, 651, -74, 194, 54, 194, -26, 311, + 194, -16, -74, -13, 345, -74, -17, -74, 236, -27, + -8, 150, -7, 12, 3, -74, 194, 194, 194, 194, + 194, 194, 194, 194, 194, 194, 194, 194, 194, 194, + 194, 194, 194, 194, 194, 194, 194, -74, 651, 34, + 71, 127, 379, 194, 73, -74, 194, -74, 194, -74, + -74, -74, -74, -74, 72, -74, 181, -11, 413, 181, + -74, 72, 177, 719, 763, 769, 744, 744, 744, 744, + 744, 744, 177, 177, 685, 719, 744, 177, 177, -14, + -14, -74, -74, 75, -74, 37, -74, 270, -74, 481, + 41, 447, 515, 48, -74, 58, -18, 44, 49, 58, + -74, 60, -74, -74, -74, 51, 194, 194, -74, -74, + 181, 181, 181, 194, 194, 549, 583, -74, 58, 58, + 685, 617, -74, 194, -74, 447, -74 +}; + +/* YYPGOTO[NTERM-NUM]. */ +static const yytype_int8 yypgoto[] = +{ + -74, -74, 78, 0, -9, 8, -74, -51, -61, -73, + -62, -74 +}; + +/* 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 YYTABLE_NINF, syntax error. */ +#define YYTABLE_NINF -61 +static const yytype_int16 yytable[] = +{ + 13, 32, 17, 116, 19, 74, 116, 24, 15, 28, + 67, 68, 114, 69, 18, 63, 64, 62, 119, 120, + 22, 75, 25, 15, 55, 56, 60, 61, 35, 72, + 70, 78, 117, 76, 79, 81, 82, 83, 84, 85, + 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, + 96, 97, 98, 99, 100, 101, 102, 116, 116, 116, + 80, 107, 59, 109, 29, 32, 111, 30, 112, 137, + 138, 139, 32, 113, 103, 104, 30, 110, 26, 121, + 74, 1, 2, 122, 125, 131, 3, 4, 5, 130, + 132, 133, 134, 57, 146, 0, 0, 5, 60, 61, + 0, 0, 5, 0, 0, 31, 0, 0, 0, 0, + 0, -60, 0, 0, 31, 0, 0, 6, 0, 7, + -60, 8, 9, 27, 10, 0, 135, 136, 105, 0, + 0, 1, 2, 140, 141, 0, 3, 4, 23, 0, + 0, 1, 2, 145, 0, 0, 3, 4, 0, 0, + 0, 77, 5, 0, 1, 2, 0, 0, 0, 3, + 4, 0, 5, 0, 0, 0, 0, 6, 0, 7, + 0, 8, 9, 106, 10, 5, 0, 6, 0, 7, + 0, 8, 9, -61, 10, 1, 2, 0, 0, 0, + 6, 0, 7, 0, 8, 9, 0, 10, 1, 2, + -61, -61, 0, 3, 4, 0, 0, 0, 0, 0, + 0, -61, -61, 53, 54, 55, 56, 0, 0, 5, + 0, 6, 0, 7, 0, 8, 9, 0, 10, 0, + 0, 0, 0, 0, 6, 0, 7, 0, 8, 9, + 0, 10, 36, 37, 0, 0, 0, 0, 0, 0, + 0, 38, 39, 40, 41, 42, 43, 44, 45, 46, + 47, 0, 0, 0, 0, 0, 0, 48, 49, 50, + 51, 52, 53, 54, 55, 56, 36, 37, 0, 0, + 0, 0, 73, 0, 0, 38, 39, 40, 41, 42, + 43, 44, 45, 46, 47, 0, 0, 0, 0, 0, + 0, 48, 49, 50, 51, 52, 53, 54, 55, 56, + 0, 0, 65, 0, 0, 0, 123, 36, 37, 0, + 0, 0, 66, 0, 0, 0, 38, 39, 40, 41, + 42, 43, 44, 45, 46, 47, 0, 0, 0, 0, + 0, 0, 48, 49, 50, 51, 52, 53, 54, 55, + 56, 36, 37, 0, 0, 0, 0, 0, 0, 0, + 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, + 0, 0, 0, 0, 0, 0, 48, 49, 50, 51, + 52, 53, 54, 55, 56, 36, 37, 0, 71, 0, + 0, 0, 0, 0, 38, 39, 40, 41, 42, 43, + 44, 45, 46, 47, 0, 0, 0, 0, 0, 0, + 48, 49, 50, 51, 52, 53, 54, 55, 56, 36, + 37, 0, 108, 0, 0, 0, 0, 0, 38, 39, + 40, 41, 42, 43, 44, 45, 46, 47, 0, 0, + 0, 0, 0, 0, 48, 49, 50, 51, 52, 53, + 54, 55, 56, 36, 37, 0, 118, 0, 0, 126, + 127, 0, 38, 39, 40, 41, 42, 43, 44, 45, + 46, 47, 0, 0, 0, 0, 0, 0, 48, 49, + 50, 51, 52, 53, 54, 55, 56, 36, 37, 0, + 0, 0, 0, 0, 0, 0, 38, 39, 40, 41, + 42, 43, 44, 45, 46, 47, 0, 0, 0, 0, + 0, 124, 48, 49, 50, 51, 52, 53, 54, 55, + 56, 36, 37, 0, 0, 0, 0, 0, 0, 0, + 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, + 0, 0, 0, 129, 0, 0, 48, 49, 50, 51, + 52, 53, 54, 55, 56, 36, 37, 0, 0, 0, + 0, 0, 0, 142, 38, 39, 40, 41, 42, 43, + 44, 45, 46, 47, 0, 0, 0, 0, 0, 0, + 48, 49, 50, 51, 52, 53, 54, 55, 56, 36, + 37, 0, 0, 0, 143, 0, 0, 0, 38, 39, + 40, 41, 42, 43, 44, 45, 46, 47, 0, 0, + 0, 0, 0, 0, 48, 49, 50, 51, 52, 53, + 54, 55, 56, 36, 37, 0, 0, 0, 0, 0, + 0, 0, 38, 39, 40, 41, 42, 43, 44, 45, + 46, 47, 0, 0, 0, 0, 0, 144, 48, 49, + 50, 51, 52, 53, 54, 55, 56, 36, 37, 0, + 0, 0, 0, 0, 0, 0, 38, 39, 40, 41, + 42, 43, 44, 45, 46, 47, 0, 0, 0, 0, + 0, 0, 48, 49, 50, 51, 52, 53, 54, 55, + 56, 36, 37, 0, 0, 0, 0, 0, 0, 0, + 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, + 0, 0, 0, 0, 0, 0, 0, 49, 50, 51, + 52, 53, 54, 55, 56, 36, 37, 0, 0, 0, + 0, 0, 0, 0, 38, 39, 40, 41, 42, 43, + 44, 45, 46, 47, 0, 0, 0, 0, 0, 0, + 36, 0, 50, 51, 52, 53, 54, 55, 56, 38, + 39, -61, -61, -61, -61, -61, -61, 46, 47, 36, + 0, 0, 0, 0, 0, 36, 0, -61, 51, 52, + 53, 54, 55, 56, 38, 0, 46, 47, 0, 0, + 0, 0, 46, 47, 0, 0, 0, 51, 52, 53, + 54, 55, 56, 51, 52, 53, 54, 55, 56 +}; + +#define yypact_value_is_default(yystate) \ + ((yystate) == (-74)) + +#define yytable_value_is_error(yytable_value) \ + ((yytable_value) == (-61)) + +static const yytype_int16 yycheck[] = +{ + 0, 10, 42, 76, 4, 32, 79, 7, 0, 9, + 26, 27, 74, 29, 4, 41, 42, 17, 79, 81, + 4, 48, 4, 15, 38, 39, 44, 45, 0, 46, + 43, 31, 43, 41, 41, 32, 36, 37, 38, 39, + 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, + 50, 51, 52, 53, 54, 55, 56, 130, 131, 132, + 48, 61, 8, 63, 1, 74, 66, 4, 68, 130, + 131, 132, 81, 1, 40, 4, 4, 4, 1, 4, + 32, 4, 5, 46, 43, 41, 9, 10, 25, 31, + 41, 31, 41, 15, 145, -1, -1, 25, 44, 45, + -1, -1, 25, -1, -1, 42, -1, -1, -1, -1, + -1, 48, -1, -1, 42, -1, -1, 40, -1, 42, + 48, 44, 45, 46, 47, -1, 126, 127, 1, -1, + -1, 4, 5, 133, 134, -1, 9, 10, 1, -1, + -1, 4, 5, 143, -1, -1, 9, 10, -1, -1, + -1, 1, 25, -1, 4, 5, -1, -1, -1, 9, + 10, -1, 25, -1, -1, -1, -1, 40, -1, 42, + -1, 44, 45, 46, 47, 25, -1, 40, -1, 42, + -1, 44, 45, 6, 47, 4, 5, -1, -1, -1, + 40, -1, 42, -1, 44, 45, -1, 47, 4, 5, + 23, 24, -1, 9, 10, -1, -1, -1, -1, -1, + -1, 34, 35, 36, 37, 38, 39, -1, -1, 25, + -1, 40, -1, 42, -1, 44, 45, -1, 47, -1, + -1, -1, -1, -1, 40, -1, 42, -1, 44, 45, + -1, 47, 6, 7, -1, -1, -1, -1, -1, -1, + -1, 15, 16, 17, 18, 19, 20, 21, 22, 23, + 24, -1, -1, -1, -1, -1, -1, 31, 32, 33, + 34, 35, 36, 37, 38, 39, 6, 7, -1, -1, + -1, -1, 46, -1, -1, 15, 16, 17, 18, 19, + 20, 21, 22, 23, 24, -1, -1, -1, -1, -1, + -1, 31, 32, 33, 34, 35, 36, 37, 38, 39, + -1, -1, 1, -1, -1, -1, 46, 6, 7, -1, + -1, -1, 11, -1, -1, -1, 15, 16, 17, 18, + 19, 20, 21, 22, 23, 24, -1, -1, -1, -1, + -1, -1, 31, 32, 33, 34, 35, 36, 37, 38, + 39, 6, 7, -1, -1, -1, -1, -1, -1, -1, + 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, + -1, -1, -1, -1, -1, -1, 31, 32, 33, 34, + 35, 36, 37, 38, 39, 6, 7, -1, 43, -1, + -1, -1, -1, -1, 15, 16, 17, 18, 19, 20, + 21, 22, 23, 24, -1, -1, -1, -1, -1, -1, + 31, 32, 33, 34, 35, 36, 37, 38, 39, 6, + 7, -1, 43, -1, -1, -1, -1, -1, 15, 16, + 17, 18, 19, 20, 21, 22, 23, 24, -1, -1, + -1, -1, -1, -1, 31, 32, 33, 34, 35, 36, + 37, 38, 39, 6, 7, -1, 43, -1, -1, 12, + 13, -1, 15, 16, 17, 18, 19, 20, 21, 22, + 23, 24, -1, -1, -1, -1, -1, -1, 31, 32, + 33, 34, 35, 36, 37, 38, 39, 6, 7, -1, + -1, -1, -1, -1, -1, -1, 15, 16, 17, 18, + 19, 20, 21, 22, 23, 24, -1, -1, -1, -1, + -1, 30, 31, 32, 33, 34, 35, 36, 37, 38, + 39, 6, 7, -1, -1, -1, -1, -1, -1, -1, + 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, + -1, -1, -1, 28, -1, -1, 31, 32, 33, 34, + 35, 36, 37, 38, 39, 6, 7, -1, -1, -1, + -1, -1, -1, 14, 15, 16, 17, 18, 19, 20, + 21, 22, 23, 24, -1, -1, -1, -1, -1, -1, + 31, 32, 33, 34, 35, 36, 37, 38, 39, 6, + 7, -1, -1, -1, 11, -1, -1, -1, 15, 16, + 17, 18, 19, 20, 21, 22, 23, 24, -1, -1, + -1, -1, -1, -1, 31, 32, 33, 34, 35, 36, + 37, 38, 39, 6, 7, -1, -1, -1, -1, -1, + -1, -1, 15, 16, 17, 18, 19, 20, 21, 22, + 23, 24, -1, -1, -1, -1, -1, 30, 31, 32, + 33, 34, 35, 36, 37, 38, 39, 6, 7, -1, + -1, -1, -1, -1, -1, -1, 15, 16, 17, 18, + 19, 20, 21, 22, 23, 24, -1, -1, -1, -1, + -1, -1, 31, 32, 33, 34, 35, 36, 37, 38, + 39, 6, 7, -1, -1, -1, -1, -1, -1, -1, + 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, + -1, -1, -1, -1, -1, -1, -1, 32, 33, 34, + 35, 36, 37, 38, 39, 6, 7, -1, -1, -1, + -1, -1, -1, -1, 15, 16, 17, 18, 19, 20, + 21, 22, 23, 24, -1, -1, -1, -1, -1, -1, + 6, -1, 33, 34, 35, 36, 37, 38, 39, 15, + 16, 17, 18, 19, 20, 21, 22, 23, 24, 6, + -1, -1, -1, -1, -1, 6, -1, 33, 34, 35, + 36, 37, 38, 39, 15, -1, 23, 24, -1, -1, + -1, -1, 23, 24, -1, -1, -1, 34, 35, 36, + 37, 38, 39, 34, 35, 36, 37, 38, 39 +}; + +/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing + symbol of state STATE-NUM. */ +static const yytype_uint8 yystos[] = +{ + 0, 4, 5, 9, 10, 25, 40, 42, 44, 45, + 47, 50, 51, 52, 53, 54, 58, 42, 4, 52, + 54, 55, 4, 1, 52, 4, 1, 46, 52, 1, + 4, 42, 53, 59, 60, 0, 6, 7, 15, 16, + 17, 18, 19, 20, 21, 22, 23, 24, 31, 32, + 33, 34, 35, 36, 37, 38, 39, 51, 52, 8, + 44, 45, 52, 41, 42, 1, 11, 26, 27, 29, + 43, 43, 46, 46, 32, 48, 41, 1, 52, 41, + 48, 32, 52, 52, 52, 52, 52, 52, 52, 52, + 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, + 52, 52, 52, 40, 4, 1, 46, 52, 43, 52, + 4, 52, 52, 1, 59, 57, 58, 43, 43, 57, + 59, 4, 46, 46, 30, 43, 12, 13, 56, 28, + 31, 41, 41, 31, 41, 52, 52, 57, 57, 57, + 52, 52, 14, 11, 30, 52, 56 +}; + +#define yyerrok (yyerrstatus = 0) +#define yyclearin (yychar = YYEMPTY) +#define YYEMPTY (-2) +#define YYEOF 0 + +#define YYACCEPT goto yyacceptlab +#define YYABORT goto yyabortlab +#define YYERROR goto yyerrorlab + + +/* Like YYERROR except do call yyerror. This remains here temporarily + to ease the transition to the new meaning of YYERROR, for GCC. + Once GCC version 2 has supplanted version 1, this can go. However, + YYFAIL appears to be in use. Nevertheless, it is formally deprecated + in Bison 2.4.2's NEWS entry, where a plan to phase it out is + discussed. */ + +#define YYFAIL goto yyerrlab +#if defined YYFAIL + /* This is here to suppress warnings from the GCC cpp's + -Wunused-macros. Normally we don't worry about that warning, but + some users do, and we want to make it easy for users to remove + YYFAIL uses, which will produce warnings from Bison 2.5. */ +#endif + +#define YYRECOVERING() (!!yyerrstatus) + +#define YYBACKUP(Token, Value) \ +do \ + if (yychar == YYEMPTY && yylen == 1) \ + { \ + yychar = (Token); \ + yylval = (Value); \ + YYPOPSTACK (1); \ + goto yybackup; \ + } \ + else \ + { \ + yyerror (&yylloc, answer, errors, locations, lexer, YY_("syntax error: cannot back up")); \ + YYERROR; \ + } \ +while (YYID (0)) + + +#define YYTERROR 1 +#define YYERRCODE 256 + + +/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. + If N is 0, then set CURRENT to the empty location which ends + the previous symbol: RHS[0] (always defined). */ + +#define YYRHSLOC(Rhs, K) ((Rhs)[K]) +#ifndef YYLLOC_DEFAULT +# define YYLLOC_DEFAULT(Current, Rhs, N) \ + do \ + if (YYID (N)) \ + { \ + (Current).first_line = YYRHSLOC (Rhs, 1).first_line; \ + (Current).first_column = YYRHSLOC (Rhs, 1).first_column; \ + (Current).last_line = YYRHSLOC (Rhs, N).last_line; \ + (Current).last_column = YYRHSLOC (Rhs, N).last_column; \ + } \ + else \ + { \ + (Current).first_line = (Current).last_line = \ + YYRHSLOC (Rhs, 0).last_line; \ + (Current).first_column = (Current).last_column = \ + YYRHSLOC (Rhs, 0).last_column; \ + } \ + while (YYID (0)) +#endif + + +/* YY_LOCATION_PRINT -- Print the location on the stream. + This macro was not mandated originally: define only if we know + we won't break user code: when these are the locations we know. */ + +#ifndef YY_LOCATION_PRINT +# if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL +# define YY_LOCATION_PRINT(File, Loc) \ + fprintf (File, "%d.%d-%d.%d", \ + (Loc).first_line, (Loc).first_column, \ + (Loc).last_line, (Loc).last_column) +# else +# define YY_LOCATION_PRINT(File, Loc) ((void) 0) +# endif +#endif + + +/* YYLEX -- calling `yylex' with the right arguments. */ + +#ifdef YYLEX_PARAM +# define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM) +#else +# define YYLEX yylex (&yylval, &yylloc, answer, errors, locations, lexer) +#endif + +/* Enable debugging if requested. */ +#if YYDEBUG + +# ifndef YYFPRINTF +# include /* INFRINGES ON USER NAME SPACE */ +# define YYFPRINTF fprintf +# endif + +# define YYDPRINTF(Args) \ +do { \ + if (yydebug) \ + YYFPRINTF Args; \ +} while (YYID (0)) + +# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ +do { \ + if (yydebug) \ + { \ + YYFPRINTF (stderr, "%s ", Title); \ + yy_symbol_print (stderr, \ + Type, Value, Location, answer, errors, locations, lexer); \ + YYFPRINTF (stderr, "\n"); \ + } \ +} while (YYID (0)) + + +/*--------------------------------. +| Print this symbol on YYOUTPUT. | +`--------------------------------*/ + +/*ARGSUSED*/ +#if (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +static void +yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp, block* answer, int* errors, struct locfile* locations, yyscan_t lexer) +#else +static void +yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, answer, errors, locations, lexer) + FILE *yyoutput; + int yytype; + YYSTYPE const * const yyvaluep; + YYLTYPE const * const yylocationp; + block* answer; + int* errors; + struct locfile* locations; + yyscan_t lexer; +#endif +{ + if (!yyvaluep) + return; + YYUSE (yylocationp); + YYUSE (answer); + YYUSE (errors); + YYUSE (locations); + YYUSE (lexer); +# ifdef YYPRINT + if (yytype < YYNTOKENS) + YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); +# else + YYUSE (yyoutput); +# endif + switch (yytype) + { + default: + break; + } +} + + +/*--------------------------------. +| Print this symbol on YYOUTPUT. | +`--------------------------------*/ + +#if (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +static void +yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp, block* answer, int* errors, struct locfile* locations, yyscan_t lexer) +#else +static void +yy_symbol_print (yyoutput, yytype, yyvaluep, yylocationp, answer, errors, locations, lexer) + FILE *yyoutput; + int yytype; + YYSTYPE const * const yyvaluep; + YYLTYPE const * const yylocationp; + block* answer; + int* errors; + struct locfile* locations; + yyscan_t lexer; +#endif +{ + if (yytype < YYNTOKENS) + YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); + else + YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); + + YY_LOCATION_PRINT (yyoutput, *yylocationp); + YYFPRINTF (yyoutput, ": "); + yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, answer, errors, locations, lexer); + YYFPRINTF (yyoutput, ")"); +} + +/*------------------------------------------------------------------. +| yy_stack_print -- Print the state stack from its BOTTOM up to its | +| TOP (included). | +`------------------------------------------------------------------*/ + +#if (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +static void +yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop) +#else +static void +yy_stack_print (yybottom, yytop) + yytype_int16 *yybottom; + yytype_int16 *yytop; +#endif +{ + YYFPRINTF (stderr, "Stack now"); + for (; yybottom <= yytop; yybottom++) + { + int yybot = *yybottom; + YYFPRINTF (stderr, " %d", yybot); + } + YYFPRINTF (stderr, "\n"); +} + +# define YY_STACK_PRINT(Bottom, Top) \ +do { \ + if (yydebug) \ + yy_stack_print ((Bottom), (Top)); \ +} while (YYID (0)) + + +/*------------------------------------------------. +| Report that the YYRULE is going to be reduced. | +`------------------------------------------------*/ + +#if (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +static void +yy_reduce_print (YYSTYPE *yyvsp, YYLTYPE *yylsp, int yyrule, block* answer, int* errors, struct locfile* locations, yyscan_t lexer) +#else +static void +yy_reduce_print (yyvsp, yylsp, yyrule, answer, errors, locations, lexer) + YYSTYPE *yyvsp; + YYLTYPE *yylsp; + int yyrule; + block* answer; + int* errors; + struct locfile* locations; + yyscan_t lexer; +#endif +{ + int yynrhs = yyr2[yyrule]; + int yyi; + unsigned long int yylno = yyrline[yyrule]; + YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", + yyrule - 1, yylno); + /* The symbols being reduced. */ + for (yyi = 0; yyi < yynrhs; yyi++) + { + YYFPRINTF (stderr, " $%d = ", yyi + 1); + yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi], + &(yyvsp[(yyi + 1) - (yynrhs)]) + , &(yylsp[(yyi + 1) - (yynrhs)]) , answer, errors, locations, lexer); + YYFPRINTF (stderr, "\n"); + } +} + +# define YY_REDUCE_PRINT(Rule) \ +do { \ + if (yydebug) \ + yy_reduce_print (yyvsp, yylsp, Rule, answer, errors, locations, lexer); \ +} while (YYID (0)) + +/* Nonzero means print parse trace. It is left uninitialized so that + multiple parsers can coexist. */ +int yydebug; +#else /* !YYDEBUG */ +# define YYDPRINTF(Args) +# define YY_SYMBOL_PRINT(Title, Type, Value, Location) +# define YY_STACK_PRINT(Bottom, Top) +# define YY_REDUCE_PRINT(Rule) +#endif /* !YYDEBUG */ + + +/* YYINITDEPTH -- initial size of the parser's stacks. */ +#ifndef YYINITDEPTH +# define YYINITDEPTH 200 +#endif + +/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only + if the built-in stack extension method is used). + + Do not make this value too large; the results are undefined if + YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) + evaluated with infinite-precision integer arithmetic. */ + +#ifndef YYMAXDEPTH +# define YYMAXDEPTH 10000 +#endif + + +#if YYERROR_VERBOSE + +# ifndef yystrlen +# if defined __GLIBC__ && defined _STRING_H +# define yystrlen strlen +# else +/* Return the length of YYSTR. */ +#if (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +static YYSIZE_T +yystrlen (const char *yystr) +#else +static YYSIZE_T +yystrlen (yystr) + const char *yystr; +#endif +{ + YYSIZE_T yylen; + for (yylen = 0; yystr[yylen]; yylen++) + continue; + return yylen; +} +# endif +# endif + +# ifndef yystpcpy +# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE +# define yystpcpy stpcpy +# else +/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in + YYDEST. */ +#if (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +static char * +yystpcpy (char *yydest, const char *yysrc) +#else +static char * +yystpcpy (yydest, yysrc) + char *yydest; + const char *yysrc; +#endif +{ + char *yyd = yydest; + const char *yys = yysrc; + + while ((*yyd++ = *yys++) != '\0') + continue; + + return yyd - 1; +} +# endif +# endif + +# ifndef yytnamerr +/* Copy to YYRES the contents of YYSTR after stripping away unnecessary + quotes and backslashes, so that it's suitable for yyerror. The + heuristic is that double-quoting is unnecessary unless the string + contains an apostrophe, a comma, or backslash (other than + backslash-backslash). YYSTR is taken from yytname. If YYRES is + null, do not copy; instead, return the length of what the result + would have been. */ +static YYSIZE_T +yytnamerr (char *yyres, const char *yystr) +{ + if (*yystr == '"') + { + YYSIZE_T yyn = 0; + char const *yyp = yystr; + + for (;;) + switch (*++yyp) + { + case '\'': + case ',': + goto do_not_strip_quotes; + + case '\\': + if (*++yyp != '\\') + goto do_not_strip_quotes; + /* Fall through. */ + default: + if (yyres) + yyres[yyn] = *yyp; + yyn++; + break; + + case '"': + if (yyres) + yyres[yyn] = '\0'; + return yyn; + } + do_not_strip_quotes: ; + } + + if (! yyres) + return yystrlen (yystr); + + return yystpcpy (yyres, yystr) - yyres; +} +# endif + +/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message + about the unexpected token YYTOKEN for the state stack whose top is + YYSSP. + + Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is + not large enough to hold the message. In that case, also set + *YYMSG_ALLOC to the required number of bytes. Return 2 if the + required number of bytes is too large to store. */ +static int +yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg, + yytype_int16 *yyssp, int yytoken) +{ + YYSIZE_T yysize0 = yytnamerr (0, yytname[yytoken]); + YYSIZE_T yysize = yysize0; + YYSIZE_T yysize1; + enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; + /* Internationalized format string. */ + const char *yyformat = 0; + /* Arguments of yyformat. */ + char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; + /* Number of reported tokens (one for the "unexpected", one per + "expected"). */ + int yycount = 0; + + /* There are many possibilities here to consider: + - Assume YYFAIL is not used. It's too flawed to consider. See + + for details. YYERROR is fine as it does not invoke this + function. + - If this state is a consistent state with a default action, then + the only way this function was invoked is if the default action + is an error action. In that case, don't check for expected + tokens because there are none. + - The only way there can be no lookahead present (in yychar) is if + this state is a consistent state with a default action. Thus, + detecting the absence of a lookahead is sufficient to determine + that there is no unexpected or expected token to report. In that + case, just report a simple "syntax error". + - Don't assume there isn't a lookahead just because this state is a + consistent state with a default action. There might have been a + previous inconsistent state, consistent state with a non-default + action, or user semantic action that manipulated yychar. + - Of course, the expected token list depends on states to have + correct lookahead information, and it depends on the parser not + to perform extra reductions after fetching a lookahead from the + scanner and before detecting a syntax error. Thus, state merging + (from LALR or IELR) and default reductions corrupt the expected + token list. However, the list is correct for canonical LR with + one exception: it will still contain any token that will not be + accepted due to an error action in a later state. + */ + if (yytoken != YYEMPTY) + { + int yyn = yypact[*yyssp]; + yyarg[yycount++] = yytname[yytoken]; + if (!yypact_value_is_default (yyn)) + { + /* Start YYX at -YYN if negative to avoid negative indexes in + YYCHECK. In other words, skip the first -YYN actions for + this state because they are default actions. */ + int yyxbegin = yyn < 0 ? -yyn : 0; + /* Stay within bounds of both yycheck and yytname. */ + int yychecklim = YYLAST - yyn + 1; + int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; + int yyx; + + for (yyx = yyxbegin; yyx < yyxend; ++yyx) + if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR + && !yytable_value_is_error (yytable[yyx + yyn])) + { + if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) + { + yycount = 1; + yysize = yysize0; + break; + } + yyarg[yycount++] = yytname[yyx]; + yysize1 = yysize + yytnamerr (0, yytname[yyx]); + if (! (yysize <= yysize1 + && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) + return 2; + yysize = yysize1; + } + } + } + + switch (yycount) + { +# define YYCASE_(N, S) \ + case N: \ + yyformat = S; \ + break + YYCASE_(0, YY_("syntax error")); + YYCASE_(1, YY_("syntax error, unexpected %s")); + YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s")); + YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s")); + YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s")); + YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s")); +# undef YYCASE_ + } + + yysize1 = yysize + yystrlen (yyformat); + if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) + return 2; + yysize = yysize1; + + if (*yymsg_alloc < yysize) + { + *yymsg_alloc = 2 * yysize; + if (! (yysize <= *yymsg_alloc + && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM)) + *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM; + return 1; + } + + /* Avoid sprintf, as that infringes on the user's name space. + Don't have undefined behavior even if the translation + produced a string with the wrong number of "%s"s. */ + { + char *yyp = *yymsg; + int yyi = 0; + while ((*yyp = *yyformat) != '\0') + if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount) + { + yyp += yytnamerr (yyp, yyarg[yyi++]); + yyformat += 2; + } + else + { + yyp++; + yyformat++; + } + } + return 0; +} +#endif /* YYERROR_VERBOSE */ + +/*-----------------------------------------------. +| Release the memory associated to this symbol. | +`-----------------------------------------------*/ + +/*ARGSUSED*/ +#if (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +static void +yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep, YYLTYPE *yylocationp, block* answer, int* errors, struct locfile* locations, yyscan_t lexer) +#else +static void +yydestruct (yymsg, yytype, yyvaluep, yylocationp, answer, errors, locations, lexer) + const char *yymsg; + int yytype; + YYSTYPE *yyvaluep; + YYLTYPE *yylocationp; + block* answer; + int* errors; + struct locfile* locations; + yyscan_t lexer; +#endif +{ + YYUSE (yyvaluep); + YYUSE (yylocationp); + YYUSE (answer); + YYUSE (errors); + YYUSE (locations); + YYUSE (lexer); + + if (!yymsg) + yymsg = "Deleting"; + YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); + + switch (yytype) + { + case 4: /* "IDENT" */ + +/* Line 1391 of yacc.c */ +#line 29 "parser.y" + { jv_free((yyvaluep->literal)); }; + +/* Line 1391 of yacc.c */ +#line 1511 "parser.gen.c" + break; + case 5: /* "LITERAL" */ + +/* Line 1391 of yacc.c */ +#line 29 "parser.y" + { jv_free((yyvaluep->literal)); }; + +/* Line 1391 of yacc.c */ +#line 1520 "parser.gen.c" + break; + case 26: /* "QQSTRING_TEXT" */ + +/* Line 1391 of yacc.c */ +#line 29 "parser.y" + { jv_free((yyvaluep->literal)); }; + +/* Line 1391 of yacc.c */ +#line 1529 "parser.gen.c" + break; + case 51: /* "FuncDefs" */ + +/* Line 1391 of yacc.c */ +#line 30 "parser.y" + { block_free((yyvaluep->blk)); }; + +/* Line 1391 of yacc.c */ +#line 1538 "parser.gen.c" + break; + case 52: /* "Exp" */ + +/* Line 1391 of yacc.c */ +#line 30 "parser.y" + { block_free((yyvaluep->blk)); }; + +/* Line 1391 of yacc.c */ +#line 1547 "parser.gen.c" + break; + case 53: /* "String" */ + +/* Line 1391 of yacc.c */ +#line 30 "parser.y" + { block_free((yyvaluep->blk)); }; + +/* Line 1391 of yacc.c */ +#line 1556 "parser.gen.c" + break; + case 54: /* "FuncDef" */ + +/* Line 1391 of yacc.c */ +#line 30 "parser.y" + { block_free((yyvaluep->blk)); }; + +/* Line 1391 of yacc.c */ +#line 1565 "parser.gen.c" + break; + case 55: /* "QQString" */ + +/* Line 1391 of yacc.c */ +#line 30 "parser.y" + { block_free((yyvaluep->blk)); }; + +/* Line 1391 of yacc.c */ +#line 1574 "parser.gen.c" + break; + case 56: /* "ElseBody" */ + +/* Line 1391 of yacc.c */ +#line 30 "parser.y" + { block_free((yyvaluep->blk)); }; + +/* Line 1391 of yacc.c */ +#line 1583 "parser.gen.c" + break; + case 57: /* "ExpD" */ + +/* Line 1391 of yacc.c */ +#line 30 "parser.y" + { block_free((yyvaluep->blk)); }; + +/* Line 1391 of yacc.c */ +#line 1592 "parser.gen.c" + break; + case 58: /* "Term" */ + +/* Line 1391 of yacc.c */ +#line 30 "parser.y" + { block_free((yyvaluep->blk)); }; + +/* Line 1391 of yacc.c */ +#line 1601 "parser.gen.c" + break; + case 59: /* "MkDict" */ + +/* Line 1391 of yacc.c */ +#line 30 "parser.y" + { block_free((yyvaluep->blk)); }; + +/* Line 1391 of yacc.c */ +#line 1610 "parser.gen.c" + break; + case 60: /* "MkDictPair" */ + +/* Line 1391 of yacc.c */ +#line 30 "parser.y" + { block_free((yyvaluep->blk)); }; + +/* Line 1391 of yacc.c */ +#line 1619 "parser.gen.c" + break; + + default: + break; + } +} + + +/* Prevent warnings from -Wmissing-prototypes. */ +#ifdef YYPARSE_PARAM +#if defined __STDC__ || defined __cplusplus +int yyparse (void *YYPARSE_PARAM); +#else +int yyparse (); +#endif +#else /* ! YYPARSE_PARAM */ +#if defined __STDC__ || defined __cplusplus +int yyparse (block* answer, int* errors, struct locfile* locations, yyscan_t lexer); +#else +int yyparse (); +#endif +#endif /* ! YYPARSE_PARAM */ + + +/*----------. +| yyparse. | +`----------*/ + +#ifdef YYPARSE_PARAM +#if (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +int +yyparse (void *YYPARSE_PARAM) +#else +int +yyparse (YYPARSE_PARAM) + void *YYPARSE_PARAM; +#endif +#else /* ! YYPARSE_PARAM */ +#if (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +int +yyparse (block* answer, int* errors, struct locfile* locations, yyscan_t lexer) +#else +int +yyparse (answer, errors, locations, lexer) + block* answer; + int* errors; + struct locfile* locations; + yyscan_t lexer; +#endif +#endif +{ +/* The lookahead symbol. */ +int yychar; + +/* The semantic value of the lookahead symbol. */ +YYSTYPE yylval; + +/* Location data for the lookahead symbol. */ +YYLTYPE yylloc; + + /* 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. + `yyls': related to locations. + + Refer to the stacks thru separate pointers, to allow yyoverflow + to reallocate them elsewhere. */ + + /* The state stack. */ + yytype_int16 yyssa[YYINITDEPTH]; + yytype_int16 *yyss; + yytype_int16 *yyssp; + + /* The semantic value stack. */ + YYSTYPE yyvsa[YYINITDEPTH]; + YYSTYPE *yyvs; + YYSTYPE *yyvsp; + + /* The location stack. */ + YYLTYPE yylsa[YYINITDEPTH]; + YYLTYPE *yyls; + YYLTYPE *yylsp; + + /* The locations where the error started and ended. */ + YYLTYPE yyerror_range[3]; + + 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; + YYLTYPE yyloc; + +#if YYERROR_VERBOSE + /* Buffer for error messages, and its allocated size. */ + char yymsgbuf[128]; + char *yymsg = yymsgbuf; + YYSIZE_T yymsg_alloc = sizeof yymsgbuf; +#endif + +#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; + + yytoken = 0; + yyss = yyssa; + yyvs = yyvsa; + yyls = yylsa; + 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; + yylsp = yyls; + +#if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL + /* Initialize the default location before parsing starts. */ + yylloc.first_line = yylloc.last_line = 1; + yylloc.first_column = yylloc.last_column = 1; +#endif + + goto yysetstate; + +/*------------------------------------------------------------. +| yynewstate -- Push a new state, which is found in yystate. | +`------------------------------------------------------------*/ + yynewstate: + /* In all cases, when you get here, the value and location stacks + have just been pushed. So pushing a state here evens the stacks. */ + yyssp++; + + yysetstate: + *yyssp = yystate; + + if (yyss + yystacksize - 1 <= yyssp) + { + /* Get the current used size of the three stacks, in elements. */ + YYSIZE_T yysize = yyssp - yyss + 1; + +#ifdef yyoverflow + { + /* Give user a chance to reallocate the stack. Use copies of + these so that the &'s don't force the real ones into + memory. */ + YYSTYPE *yyvs1 = yyvs; + yytype_int16 *yyss1 = yyss; + YYLTYPE *yyls1 = yyls; + + /* Each stack pointer address is followed by the size of the + data in use in that stack, in bytes. This used to be a + conditional around just the two extra args, but that might + be undefined if yyoverflow is a macro. */ + yyoverflow (YY_("memory exhausted"), + &yyss1, yysize * sizeof (*yyssp), + &yyvs1, yysize * sizeof (*yyvsp), + &yyls1, yysize * sizeof (*yylsp), + &yystacksize); + + yyls = yyls1; + yyss = yyss1; + yyvs = yyvs1; + } +#else /* no yyoverflow */ +# ifndef YYSTACK_RELOCATE + goto yyexhaustedlab; +# else + /* Extend the stack our own way. */ + if (YYMAXDEPTH <= yystacksize) + goto yyexhaustedlab; + yystacksize *= 2; + if (YYMAXDEPTH < yystacksize) + yystacksize = YYMAXDEPTH; + + { + yytype_int16 *yyss1 = yyss; + union yyalloc *yyptr = + (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); + if (! yyptr) + goto yyexhaustedlab; + YYSTACK_RELOCATE (yyss_alloc, yyss); + YYSTACK_RELOCATE (yyvs_alloc, yyvs); + YYSTACK_RELOCATE (yyls_alloc, yyls); +# undef YYSTACK_RELOCATE + if (yyss1 != yyssa) + YYSTACK_FREE (yyss1); + } +# endif +#endif /* no yyoverflow */ + + yyssp = yyss + yysize - 1; + yyvsp = yyvs + yysize - 1; + yylsp = yyls + yysize - 1; + + YYDPRINTF ((stderr, "Stack size increased to %lu\n", + (unsigned long int) yystacksize)); + + if (yyss + yystacksize - 1 <= yyssp) + YYABORT; + } + + YYDPRINTF ((stderr, "Entering state %d\n", yystate)); + + 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; + } + + 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; + *++yyvsp = yylval; + *++yylsp = yylloc; + goto yynewstate; + + +/*-----------------------------------------------------------. +| yydefault -- do the default action for the current state. | +`-----------------------------------------------------------*/ +yydefault: + yyn = yydefact[yystate]; + if (yyn == 0) + goto yyerrlab; + goto yyreduce; + + +/*-----------------------------. +| yyreduce -- Do a reduction. | +`-----------------------------*/ +yyreduce: + /* yyn is the number of a rule to reduce with. */ + yylen = yyr2[yyn]; + + /* If YYLEN is nonzero, implement the default value of the action: + `$$ = $1'. + + Otherwise, the following line sets YYVAL to garbage. + This behavior is undocumented and Bison + users should not rely upon it. Assigning to YYVAL + unconditionally makes the parser a bit smaller, and it avoids a + GCC warning that YYVAL may be used uninitialized. */ + yyval = yyvsp[1-yylen]; + + /* Default location. */ + YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen); + YY_REDUCE_PRINT (yyn); + switch (yyn) + { + case 2: + +/* Line 1806 of yacc.c */ +#line 174 "parser.y" + { + *answer = (yyvsp[(1) - (1)].blk); +} + break; + + case 3: + +/* Line 1806 of yacc.c */ +#line 177 "parser.y" + { + *answer = (yyvsp[(1) - (1)].blk); +} + break; + + case 4: + +/* Line 1806 of yacc.c */ +#line 182 "parser.y" + { + (yyval.blk) = gen_noop(); +} + break; + + case 5: + +/* Line 1806 of yacc.c */ +#line 185 "parser.y" + { + (yyval.blk) = block_join((yyvsp[(1) - (2)].blk), (yyvsp[(2) - (2)].blk)); +} + break; + + case 6: + +/* Line 1806 of yacc.c */ +#line 190 "parser.y" + { + (yyval.blk) = block_bind((yyvsp[(1) - (2)].blk), (yyvsp[(2) - (2)].blk), OP_IS_CALL_PSEUDO); +} + break; + + case 7: + +/* Line 1806 of yacc.c */ +#line 194 "parser.y" + { + (yyval.blk) = gen_op_simple(DUP); + block_append(&(yyval.blk), (yyvsp[(1) - (6)].blk)); + block_append(&(yyval.blk), block_bind(gen_op_var_unbound(STOREV, jv_string_value((yyvsp[(4) - (6)].literal))), (yyvsp[(6) - (6)].blk), OP_HAS_VARIABLE)); + jv_free((yyvsp[(4) - (6)].literal)); +} + break; + + case 8: + +/* Line 1806 of yacc.c */ +#line 201 "parser.y" + { + (yyval.blk) = gen_cond((yyvsp[(2) - (5)].blk), (yyvsp[(4) - (5)].blk), (yyvsp[(5) - (5)].blk)); +} + break; + + case 9: + +/* Line 1806 of yacc.c */ +#line 204 "parser.y" + { + FAIL((yyloc), "Possibly unterminated 'if' statment"); + (yyval.blk) = (yyvsp[(2) - (3)].blk); +} + break; + + case 10: + +/* Line 1806 of yacc.c */ +#line 209 "parser.y" + { + block assign = gen_op_simple(DUP); + block_append(&assign, (yyvsp[(3) - (3)].blk)); + block_append(&assign, gen_op_simple(SWAP)); + block_append(&assign, (yyvsp[(1) - (3)].blk)); + block_append(&assign, gen_op_simple(SWAP)); + (yyval.blk) = gen_assign(assign); +} + break; + + case 11: + +/* Line 1806 of yacc.c */ +#line 218 "parser.y" + { + (yyval.blk) = gen_or((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk)); +} + break; + + case 12: + +/* Line 1806 of yacc.c */ +#line 222 "parser.y" + { + (yyval.blk) = gen_and((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk)); +} + break; + + case 13: + +/* Line 1806 of yacc.c */ +#line 226 "parser.y" + { + (yyval.blk) = gen_definedor((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk)); +} + break; + + case 14: + +/* Line 1806 of yacc.c */ +#line 230 "parser.y" + { + (yyval.blk) = gen_update((yyvsp[(1) - (3)].blk), gen_definedor(gen_noop(), (yyvsp[(3) - (3)].blk)), 0); +} + break; + + case 15: + +/* Line 1806 of yacc.c */ +#line 234 "parser.y" + { + (yyval.blk) = gen_update((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk), 0); +} + break; + + case 16: + +/* Line 1806 of yacc.c */ +#line 238 "parser.y" + { + (yyval.blk) = block_join((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk)); +} + break; + + case 17: + +/* Line 1806 of yacc.c */ +#line 242 "parser.y" + { + (yyval.blk) = gen_both((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk)); +} + break; + + case 18: + +/* Line 1806 of yacc.c */ +#line 246 "parser.y" + { + (yyval.blk) = gen_binop((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk), '+'); +} + break; + + case 19: + +/* Line 1806 of yacc.c */ +#line 250 "parser.y" + { + (yyval.blk) = gen_update((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk), '+'); +} + break; + + case 20: + +/* Line 1806 of yacc.c */ +#line 254 "parser.y" + { + (yyval.blk) = gen_binop((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk), '-'); +} + break; + + case 21: + +/* Line 1806 of yacc.c */ +#line 258 "parser.y" + { + (yyval.blk) = gen_update((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk), '-'); +} + break; + + case 22: + +/* Line 1806 of yacc.c */ +#line 262 "parser.y" + { + (yyval.blk) = gen_binop((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk), '*'); +} + break; + + case 23: + +/* Line 1806 of yacc.c */ +#line 266 "parser.y" + { + (yyval.blk) = gen_update((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk), '*'); +} + break; + + case 24: + +/* Line 1806 of yacc.c */ +#line 270 "parser.y" + { + (yyval.blk) = gen_binop((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk), '/'); +} + break; + + case 25: + +/* Line 1806 of yacc.c */ +#line 274 "parser.y" + { + (yyval.blk) = gen_update((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk), '/'); +} + break; + + case 26: + +/* Line 1806 of yacc.c */ +#line 278 "parser.y" + { + (yyval.blk) = gen_binop((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk), EQ); +} + break; + + case 27: + +/* Line 1806 of yacc.c */ +#line 282 "parser.y" + { + (yyval.blk) = gen_binop((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk), '<'); +} + break; + + case 28: + +/* Line 1806 of yacc.c */ +#line 286 "parser.y" + { + (yyval.blk) = gen_binop((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk), '>'); +} + break; + + case 29: + +/* Line 1806 of yacc.c */ +#line 290 "parser.y" + { + (yyval.blk) = gen_binop((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk), LESSEQ); +} + break; + + case 30: + +/* Line 1806 of yacc.c */ +#line 294 "parser.y" + { + (yyval.blk) = gen_binop((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk), GREATEREQ); +} + break; + + case 31: + +/* Line 1806 of yacc.c */ +#line 298 "parser.y" + { + (yyval.blk) = (yyvsp[(1) - (1)].blk); +} + break; + + case 32: + +/* Line 1806 of yacc.c */ +#line 302 "parser.y" + { + (yyval.blk) = (yyvsp[(1) - (1)].blk); +} + break; + + case 33: + +/* Line 1806 of yacc.c */ +#line 307 "parser.y" + { + (yyval.blk) = (yyvsp[(2) - (3)].blk); +} + break; + + case 34: + +/* Line 1806 of yacc.c */ +#line 312 "parser.y" + { + block body = block_join((yyvsp[(4) - (5)].blk), gen_op_simple(RET)); + (yyval.blk) = gen_op_block_defn_rec(CLOSURE_CREATE, jv_string_value((yyvsp[(2) - (5)].literal)), body); + jv_free((yyvsp[(2) - (5)].literal)); +} + break; + + case 35: + +/* Line 1806 of yacc.c */ +#line 318 "parser.y" + { + block body = block_bind(gen_op_block_unbound(CLOSURE_PARAM, jv_string_value((yyvsp[(4) - (8)].literal))), block_join((yyvsp[(7) - (8)].blk), gen_op_simple(RET)), OP_IS_CALL_PSEUDO); + (yyval.blk) = gen_op_block_defn_rec(CLOSURE_CREATE, jv_string_value((yyvsp[(2) - (8)].literal)), body); + jv_free((yyvsp[(2) - (8)].literal)); + jv_free((yyvsp[(4) - (8)].literal)); +} + break; + + case 36: + +/* Line 1806 of yacc.c */ +#line 326 "parser.y" + { + (yyval.blk) = gen_op_const(LOADK, jv_string("")); +} + break; + + case 37: + +/* Line 1806 of yacc.c */ +#line 329 "parser.y" + { + (yyval.blk) = gen_binop((yyvsp[(1) - (2)].blk), gen_op_const(LOADK, (yyvsp[(2) - (2)].literal)), '+'); +} + break; + + case 38: + +/* Line 1806 of yacc.c */ +#line 332 "parser.y" + { + (yyval.blk) = gen_binop((yyvsp[(1) - (4)].blk), gen_format((yyvsp[(3) - (4)].blk)), '+'); +} + break; + + case 39: + +/* Line 1806 of yacc.c */ +#line 338 "parser.y" + { + (yyval.blk) = gen_cond((yyvsp[(2) - (5)].blk), (yyvsp[(4) - (5)].blk), (yyvsp[(5) - (5)].blk)); +} + break; + + case 40: + +/* Line 1806 of yacc.c */ +#line 341 "parser.y" + { + (yyval.blk) = (yyvsp[(2) - (3)].blk); +} + break; + + case 41: + +/* Line 1806 of yacc.c */ +#line 346 "parser.y" + { + (yyval.blk) = block_join((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk)); +} + break; + + case 42: + +/* Line 1806 of yacc.c */ +#line 350 "parser.y" + { + (yyval.blk) = (yyvsp[(1) - (1)].blk); +} + break; + + case 43: + +/* Line 1806 of yacc.c */ +#line 356 "parser.y" + { + (yyval.blk) = gen_noop(); +} + break; + + case 44: + +/* Line 1806 of yacc.c */ +#line 359 "parser.y" + { + (yyval.blk) = gen_index((yyvsp[(1) - (3)].blk), gen_op_const(LOADK, (yyvsp[(3) - (3)].literal))); +} + break; + + case 45: + +/* Line 1806 of yacc.c */ +#line 362 "parser.y" + { + (yyval.blk) = gen_index(gen_noop(), gen_op_const(LOADK, (yyvsp[(2) - (2)].literal))); +} + break; + + case 46: + +/* Line 1806 of yacc.c */ +#line 366 "parser.y" + { + (yyval.blk) = gen_index((yyvsp[(1) - (4)].blk), (yyvsp[(3) - (4)].blk)); +} + break; + + case 47: + +/* Line 1806 of yacc.c */ +#line 369 "parser.y" + { + (yyval.blk) = block_join((yyvsp[(1) - (3)].blk), gen_op_simple(EACH)); +} + break; + + case 48: + +/* Line 1806 of yacc.c */ +#line 372 "parser.y" + { + (yyval.blk) = gen_op_const(LOADK, (yyvsp[(1) - (1)].literal)); +} + break; + + case 49: + +/* Line 1806 of yacc.c */ +#line 375 "parser.y" + { + (yyval.blk) = (yyvsp[(2) - (3)].blk); +} + break; + + case 50: + +/* Line 1806 of yacc.c */ +#line 378 "parser.y" + { + (yyval.blk) = gen_collect((yyvsp[(2) - (3)].blk)); +} + break; + + case 51: + +/* Line 1806 of yacc.c */ +#line 381 "parser.y" + { + (yyval.blk) = gen_op_const(LOADK, jv_array()); +} + break; + + case 52: + +/* Line 1806 of yacc.c */ +#line 384 "parser.y" + { + (yyval.blk) = gen_subexp(gen_op_const(LOADK, jv_object())); + block_append(&(yyval.blk), (yyvsp[(2) - (3)].blk)); + block_append(&(yyval.blk), gen_op_simple(POP)); +} + break; + + case 53: + +/* Line 1806 of yacc.c */ +#line 389 "parser.y" + { + (yyval.blk) = gen_location((yyloc), gen_op_var_unbound(LOADV, jv_string_value((yyvsp[(2) - (2)].literal)))); + jv_free((yyvsp[(2) - (2)].literal)); +} + break; + + case 54: + +/* Line 1806 of yacc.c */ +#line 393 "parser.y" + { + (yyval.blk) = gen_location((yyloc), gen_op_call(CALL_1_1, gen_op_block_unbound(CLOSURE_REF, jv_string_value((yyvsp[(1) - (1)].literal))))); + jv_free((yyvsp[(1) - (1)].literal)); +} + break; + + case 55: + +/* Line 1806 of yacc.c */ +#line 397 "parser.y" + { + (yyval.blk) = gen_op_call(CALL_1_1, + block_join(gen_op_block_unbound(CLOSURE_REF, jv_string_value((yyvsp[(1) - (4)].literal))), + block_bind(gen_op_block_defn(CLOSURE_CREATE, + "lambda", + block_join((yyvsp[(3) - (4)].blk), gen_op_simple(RET))), + gen_noop(), OP_IS_CALL_PSEUDO))); + (yyval.blk) = gen_location((yylsp[(1) - (4)]), (yyval.blk)); + jv_free((yyvsp[(1) - (4)].literal)); +} + break; + + case 56: + +/* Line 1806 of yacc.c */ +#line 407 "parser.y" + { (yyval.blk) = gen_noop(); } + break; + + case 57: + +/* Line 1806 of yacc.c */ +#line 408 "parser.y" + { (yyval.blk) = gen_noop(); } + break; + + case 58: + +/* Line 1806 of yacc.c */ +#line 409 "parser.y" + { (yyval.blk) = (yyvsp[(1) - (4)].blk); } + break; + + case 59: + +/* Line 1806 of yacc.c */ +#line 410 "parser.y" + { (yyval.blk) = gen_noop(); } + break; + + case 60: + +/* Line 1806 of yacc.c */ +#line 413 "parser.y" + { + (yyval.blk)=gen_noop(); +} + break; + + case 61: + +/* Line 1806 of yacc.c */ +#line 416 "parser.y" + { (yyval.blk) = (yyvsp[(1) - (1)].blk); } + break; + + case 62: + +/* Line 1806 of yacc.c */ +#line 417 "parser.y" + { (yyval.blk)=block_join((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk)); } + break; + + case 63: + +/* Line 1806 of yacc.c */ +#line 418 "parser.y" + { (yyval.blk) = (yyvsp[(3) - (3)].blk); } + break; + + case 64: + +/* Line 1806 of yacc.c */ +#line 421 "parser.y" + { + (yyval.blk) = gen_dictpair(gen_op_const(LOADK, (yyvsp[(1) - (3)].literal)), (yyvsp[(3) - (3)].blk)); + } + break; + + case 65: + +/* Line 1806 of yacc.c */ +#line 424 "parser.y" + { + (yyval.blk) = gen_dictpair((yyvsp[(1) - (3)].blk), (yyvsp[(3) - (3)].blk)); + } + break; + + case 66: + +/* Line 1806 of yacc.c */ +#line 427 "parser.y" + { + (yyval.blk) = gen_dictpair(gen_op_const(LOADK, jv_copy((yyvsp[(1) - (1)].literal))), + gen_index(gen_noop(), gen_op_const(LOADK, (yyvsp[(1) - (1)].literal)))); + } + break; + + case 67: + +/* Line 1806 of yacc.c */ +#line 431 "parser.y" + { + (yyval.blk) = gen_dictpair((yyvsp[(2) - (5)].blk), (yyvsp[(5) - (5)].blk)); + } + break; + + case 68: + +/* Line 1806 of yacc.c */ +#line 434 "parser.y" + { (yyval.blk) = (yyvsp[(5) - (5)].blk); } + break; + + + +/* Line 1806 of yacc.c */ +#line 2564 "parser.gen.c" + default: break; + } + /* User semantic actions sometimes alter yychar, and that requires + that yytoken be updated with the new translation. We take the + approach of translating immediately before every use of yytoken. + One alternative is translating here after every semantic action, + but that translation would be missed if the semantic action invokes + YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or + if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an + incorrect destructor might then be invoked immediately. In the + case of YYERROR or YYBACKUP, subsequent parser actions might lead + to an incorrect destructor call or verbose syntax error message + before the lookahead is translated. */ + YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); + + YYPOPSTACK (yylen); + yylen = 0; + YY_STACK_PRINT (yyss, yyssp); + + *++yyvsp = yyval; + *++yylsp = yyloc; + + /* Now `shift' the result of the reduction. Determine what state + that goes to, based on the state we popped back to and the rule + number reduced by. */ + + yyn = yyr1[yyn]; + + yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; + if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) + yystate = yytable[yystate]; + else + yystate = yydefgoto[yyn - YYNTOKENS]; + + goto yynewstate; + + +/*------------------------------------. +| yyerrlab -- here on detecting error | +`------------------------------------*/ +yyerrlab: + /* 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; +#if ! YYERROR_VERBOSE + yyerror (&yylloc, answer, errors, locations, lexer, YY_("syntax error")); +#else +# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \ + yyssp, yytoken) + { + char const *yymsgp = YY_("syntax error"); + int yysyntax_error_status; + yysyntax_error_status = YYSYNTAX_ERROR; + if (yysyntax_error_status == 0) + yymsgp = yymsg; + else if (yysyntax_error_status == 1) + { + if (yymsg != yymsgbuf) + YYSTACK_FREE (yymsg); + yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc); + if (!yymsg) + { + yymsg = yymsgbuf; + yymsg_alloc = sizeof yymsgbuf; + yysyntax_error_status = 2; + } + else + { + yysyntax_error_status = YYSYNTAX_ERROR; + yymsgp = yymsg; + } + } + yyerror (&yylloc, answer, errors, locations, lexer, yymsgp); + if (yysyntax_error_status == 2) + goto yyexhaustedlab; + } +# undef YYSYNTAX_ERROR +#endif + } + + yyerror_range[1] = yylloc; + + 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, &yylloc, answer, errors, locations, lexer); + 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; + + yyerror_range[1] = yylsp[1-yylen]; + /* Do not reclaim the symbols of the rule which action triggered + this YYERROR. */ + YYPOPSTACK (yylen); + yylen = 0; + YY_STACK_PRINT (yyss, yyssp); + yystate = *yyssp; + goto yyerrlab1; + + +/*-------------------------------------------------------------. +| yyerrlab1 -- common code for both syntax error and YYERROR. | +`-------------------------------------------------------------*/ +yyerrlab1: + yyerrstatus = 3; /* Each real token shifted decrements this. */ + + for (;;) + { + yyn = yypact[yystate]; + if (!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; + + yyerror_range[1] = *yylsp; + yydestruct ("Error: popping", + yystos[yystate], yyvsp, yylsp, answer, errors, locations, lexer); + YYPOPSTACK (1); + yystate = *yyssp; + YY_STACK_PRINT (yyss, yyssp); + } + + *++yyvsp = yylval; + + yyerror_range[2] = yylloc; + /* Using YYLLOC is tempting, but would change the location of + the lookahead. YYLOC is available though. */ + YYLLOC_DEFAULT (yyloc, yyerror_range, 2); + *++yylsp = yyloc; + + /* Shift the error token. */ + YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); + + yystate = yyn; + goto yynewstate; + + +/*-------------------------------------. +| yyacceptlab -- YYACCEPT comes here. | +`-------------------------------------*/ +yyacceptlab: + yyresult = 0; + goto yyreturn; + +/*-----------------------------------. +| yyabortlab -- YYABORT comes here. | +`-----------------------------------*/ +yyabortlab: + yyresult = 1; + goto yyreturn; + +#if !defined(yyoverflow) || YYERROR_VERBOSE +/*-------------------------------------------------. +| yyexhaustedlab -- memory exhaustion comes here. | +`-------------------------------------------------*/ +yyexhaustedlab: + yyerror (&yylloc, answer, errors, locations, lexer, YY_("memory exhausted")); + yyresult = 2; + /* Fall through. */ +#endif + +yyreturn: + if (yychar != YYEMPTY) + { + /* Make sure we have latest lookahead translation. See comments at + user semantic actions for why this is necessary. */ + yytoken = YYTRANSLATE (yychar); + yydestruct ("Cleanup: discarding lookahead", + yytoken, &yylval, &yylloc, answer, errors, locations, lexer); + } + /* Do not reclaim the symbols of the rule which action triggered + this YYABORT or YYACCEPT. */ + YYPOPSTACK (yylen); + YY_STACK_PRINT (yyss, yyssp); + while (yyssp != yyss) + { + yydestruct ("Cleanup: popping", + yystos[*yyssp], yyvsp, yylsp, answer, errors, locations, lexer); + YYPOPSTACK (1); + } +#ifndef yyoverflow + if (yyss != yyssa) + YYSTACK_FREE (yyss); +#endif +#if YYERROR_VERBOSE + if (yymsg != yymsgbuf) + YYSTACK_FREE (yymsg); +#endif + /* Make sure YYID is used. */ + return YYID (yyresult); +} + + + +/* Line 2067 of yacc.c */ +#line 435 "parser.y" + + +int jq_parse(struct locfile* locations, block* answer) { + yyscan_t scanner; + YY_BUFFER_STATE buf; + jq_yylex_init_extra(0, &scanner); + buf = jq_yy_scan_bytes(locations->data, locations->length, scanner); + int errors = 0; + *answer = gen_noop(); + yyparse(answer, &errors, locations, scanner); + jq_yy_delete_buffer(buf, scanner); + jq_yylex_destroy(scanner); + if (errors > 0) { + block_free(*answer); + *answer = gen_noop(); + } + return errors; +} + +int jq_parse_library(struct locfile* locations, block* answer) { + int errs = jq_parse(locations, answer); + if (errs) return errs; + if (!block_has_only_binders(*answer, OP_IS_CALL_PSEUDO)) { + locfile_locate(locations, UNKNOWN_LOCATION, "error: library should only have function definitions, not a main expression"); + return 1; + } + return 0; +} + diff --git a/parser.gen.h b/parser.gen.h new file mode 100644 index 00000000..49bf4cc7 --- /dev/null +++ b/parser.gen.h @@ -0,0 +1,130 @@ +/* A Bison parser, made by GNU Bison 2.5. */ + +/* Bison interface for Yacc-like parsers in C + + Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc. + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . */ + +/* 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. */ + +/* "%code requires" blocks. */ + +/* Line 2068 of yacc.c */ +#line 6 "parser.y" + +#include "locfile.h" +#define YYLTYPE location +#define YYLLOC_DEFAULT(Loc, Rhs, N) \ + do { \ + if (N) { \ + (Loc).start = YYRHSLOC(Rhs, 1).start; \ + (Loc).end = YYRHSLOC(Rhs, N).end; \ + } else { \ + (Loc).start = YYRHSLOC(Rhs, 0).end; \ + (Loc).end = YYRHSLOC(Rhs, 0).end; \ + } \ + } while (0) + + + +/* Line 2068 of yacc.c */ +#line 55 "parser.gen.h" + +/* Tokens. */ +#ifndef YYTOKENTYPE +# define YYTOKENTYPE + /* Put the tokens into the symbol table, so that GDB and other debuggers + know about them. */ + enum yytokentype { + INVALID_CHARACTER = 258, + IDENT = 259, + LITERAL = 260, + EQ = 261, + DEFINEDOR = 262, + AS = 263, + DEF = 264, + IF = 265, + THEN = 266, + ELSE = 267, + ELSE_IF = 268, + END = 269, + AND = 270, + OR = 271, + SETPIPE = 272, + SETPLUS = 273, + SETMINUS = 274, + SETMULT = 275, + SETDIV = 276, + SETDEFINEDOR = 277, + LESSEQ = 278, + GREATEREQ = 279, + QQSTRING_START = 280, + QQSTRING_TEXT = 281, + QQSTRING_INTERP_START = 282, + QQSTRING_INTERP_END = 283, + QQSTRING_END = 284 + }; +#endif + + + +#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED +typedef union YYSTYPE +{ + +/* Line 2068 of yacc.c */ +#line 24 "parser.y" + + jv literal; + block blk; + + + +/* Line 2068 of yacc.c */ +#line 108 "parser.gen.h" +} YYSTYPE; +# define YYSTYPE_IS_TRIVIAL 1 +# define yystype YYSTYPE /* obsolescent; will be withdrawn */ +# define YYSTYPE_IS_DECLARED 1 +#endif + + + +#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED +typedef struct YYLTYPE +{ + int first_line; + int first_column; + int last_line; + int last_column; +} YYLTYPE; +# define yyltype YYLTYPE /* obsolescent; will be withdrawn */ +# define YYLTYPE_IS_DECLARED 1 +# define YYLTYPE_IS_TRIVIAL 1 +#endif + + + diff --git a/parser.gen.info b/parser.gen.info new file mode 100644 index 00000000..6c84d979 --- /dev/null +++ b/parser.gen.info @@ -0,0 +1,3283 @@ +Terminals unused in grammar + + INVALID_CHARACTER + + +Grammar + + 0 $accept: TopLevel $end + + 1 TopLevel: Exp + 2 | FuncDefs + + 3 FuncDefs: /* empty */ + 4 | FuncDef FuncDefs + + 5 Exp: FuncDef Exp + 6 | Term "as" '$' IDENT '|' Exp + 7 | "if" Exp "then" Exp ElseBody + 8 | "if" Exp error + 9 | Exp '=' Exp + 10 | Exp "or" Exp + 11 | Exp "and" Exp + 12 | Exp "//" Exp + 13 | Exp "//=" Exp + 14 | Exp "|=" Exp + 15 | Exp '|' Exp + 16 | Exp ',' Exp + 17 | Exp '+' Exp + 18 | Exp "+=" Exp + 19 | Exp '-' Exp + 20 | Exp "-=" Exp + 21 | Exp '*' Exp + 22 | Exp "*=" Exp + 23 | Exp '/' Exp + 24 | Exp "/=" Exp + 25 | Exp "==" Exp + 26 | Exp '<' Exp + 27 | Exp '>' Exp + 28 | Exp "<=" Exp + 29 | Exp ">=" Exp + 30 | String + 31 | Term + + 32 String: QQSTRING_START QQString QQSTRING_END + + 33 FuncDef: "def" IDENT ':' Exp ';' + 34 | "def" IDENT '(' IDENT ')' ':' Exp ';' + + 35 QQString: /* empty */ + 36 | QQString QQSTRING_TEXT + 37 | QQString QQSTRING_INTERP_START Exp QQSTRING_INTERP_END + + 38 ElseBody: "elif" Exp "then" Exp ElseBody + 39 | "else" Exp "end" + + 40 ExpD: ExpD '|' ExpD + 41 | Term + + 42 Term: '.' + 43 | Term '.' IDENT + 44 | '.' IDENT + 45 | Term '[' Exp ']' + 46 | Term '[' ']' + 47 | LITERAL + 48 | '(' Exp ')' + 49 | '[' Exp ']' + 50 | '[' ']' + 51 | '{' MkDict '}' + 52 | '$' IDENT + 53 | IDENT + 54 | IDENT '(' Exp ')' + 55 | '(' error ')' + 56 | '[' error ']' + 57 | Term '[' error ']' + 58 | '{' error '}' + + 59 MkDict: /* empty */ + 60 | MkDictPair + 61 | MkDictPair ',' MkDict + 62 | error ',' MkDict + + 63 MkDictPair: IDENT ':' ExpD + 64 | String ':' ExpD + 65 | IDENT + 66 | '(' Exp ')' ':' ExpD + 67 | '(' error ')' ':' ExpD + + +Terminals, with rules where they appear + +$end (0) 0 +'$' (36) 6 52 +'(' (40) 34 48 54 55 66 67 +')' (41) 34 48 54 55 66 67 +'*' (42) 21 +'+' (43) 17 +',' (44) 16 61 62 +'-' (45) 19 +'.' (46) 42 43 44 +'/' (47) 23 +':' (58) 33 34 63 64 66 67 +';' (59) 33 34 +'<' (60) 26 +'=' (61) 9 +'>' (62) 27 +'[' (91) 45 46 49 50 56 57 +']' (93) 45 46 49 50 56 57 +'{' (123) 51 58 +'|' (124) 6 15 40 +'}' (125) 51 58 +error (256) 8 55 56 57 58 62 67 +INVALID_CHARACTER (258) +IDENT (259) 6 33 34 43 44 52 53 54 63 65 +LITERAL (260) 47 +"==" (261) 25 +"//" (262) 12 +"as" (263) 6 +"def" (264) 33 34 +"if" (265) 7 8 +"then" (266) 7 38 +"else" (267) 39 +"elif" (268) 38 +"end" (269) 39 +"and" (270) 11 +"or" (271) 10 +"|=" (272) 14 +"+=" (273) 18 +"-=" (274) 20 +"*=" (275) 22 +"/=" (276) 24 +"//=" (277) 13 +"<=" (278) 28 +">=" (279) 29 +QQSTRING_START (280) 32 +QQSTRING_TEXT (281) 36 +QQSTRING_INTERP_START (282) 37 +QQSTRING_INTERP_END (283) 37 +QQSTRING_END (284) 32 + + +Nonterminals, with rules where they appear + +$accept (49) + on left: 0 +TopLevel (50) + on left: 1 2, on right: 0 +FuncDefs (51) + on left: 3 4, on right: 2 4 +Exp (52) + on left: 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 + 25 26 27 28 29 30 31, on right: 1 5 6 7 8 9 10 11 12 13 14 15 16 + 17 18 19 20 21 22 23 24 25 26 27 28 29 33 34 37 38 39 45 48 49 + 54 66 +String (53) + on left: 32, on right: 30 64 +FuncDef (54) + on left: 33 34, on right: 4 5 +QQString (55) + on left: 35 36 37, on right: 32 36 37 +ElseBody (56) + on left: 38 39, on right: 7 38 +ExpD (57) + on left: 40 41, on right: 40 63 64 66 67 +Term (58) + on left: 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58, on right: + 6 31 41 43 45 46 57 +MkDict (59) + on left: 59 60 61 62, on right: 51 61 62 +MkDictPair (60) + on left: 63 64 65 66 67, on right: 60 61 + + +state 0 + + 0 $accept: . TopLevel $end + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + $default reduce using rule 3 (FuncDefs) + + TopLevel go to state 11 + FuncDefs go to state 12 + Exp go to state 13 + String go to state 14 + FuncDef go to state 15 + Term go to state 16 + + +state 1 + + 53 Term: IDENT . + 54 | IDENT . '(' Exp ')' + + '(' shift, and go to state 17 + + $default reduce using rule 53 (Term) + + +state 2 + + 47 Term: LITERAL . + + $default reduce using rule 47 (Term) + + +state 3 + + 33 FuncDef: "def" . IDENT ':' Exp ';' + 34 | "def" . IDENT '(' IDENT ')' ':' Exp ';' + + IDENT shift, and go to state 18 + + +state 4 + + 7 Exp: "if" . Exp "then" Exp ElseBody + 8 | "if" . Exp error + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 19 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 5 + + 32 String: QQSTRING_START . QQString QQSTRING_END + + $default reduce using rule 35 (QQString) + + QQString go to state 21 + + +state 6 + + 52 Term: '$' . IDENT + + IDENT shift, and go to state 22 + + +state 7 + + 48 Term: '(' . Exp ')' + 55 | '(' . error ')' + + error shift, and go to state 23 + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 24 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 8 + + 42 Term: '.' . + 44 | '.' . IDENT + + IDENT shift, and go to state 25 + + $default reduce using rule 42 (Term) + + +state 9 + + 49 Term: '[' . Exp ']' + 50 | '[' . ']' + 56 | '[' . error ']' + + error shift, and go to state 26 + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + ']' shift, and go to state 27 + '{' shift, and go to state 10 + + Exp go to state 28 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 10 + + 51 Term: '{' . MkDict '}' + 58 | '{' . error '}' + + error shift, and go to state 29 + IDENT shift, and go to state 30 + QQSTRING_START shift, and go to state 5 + '(' shift, and go to state 31 + + '}' reduce using rule 59 (MkDict) + + String go to state 32 + MkDict go to state 33 + MkDictPair go to state 34 + + +state 11 + + 0 $accept: TopLevel . $end + + $end shift, and go to state 35 + + +state 12 + + 2 TopLevel: FuncDefs . + + $default reduce using rule 2 (TopLevel) + + +state 13 + + 1 TopLevel: Exp . + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + $default reduce using rule 1 (TopLevel) + + +state 14 + + 30 Exp: String . + + $default reduce using rule 30 (Exp) + + +state 15 + + 4 FuncDefs: FuncDef . FuncDefs + 5 Exp: FuncDef . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + $default reduce using rule 3 (FuncDefs) + + FuncDefs go to state 57 + Exp go to state 58 + String go to state 14 + FuncDef go to state 15 + Term go to state 16 + + +state 16 + + 6 Exp: Term . "as" '$' IDENT '|' Exp + 31 | Term . + 43 Term: Term . '.' IDENT + 45 | Term . '[' Exp ']' + 46 | Term . '[' ']' + 57 | Term . '[' error ']' + + "as" shift, and go to state 59 + '.' shift, and go to state 60 + '[' shift, and go to state 61 + + $default reduce using rule 31 (Exp) + + +state 17 + + 54 Term: IDENT '(' . Exp ')' + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 62 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 18 + + 33 FuncDef: "def" IDENT . ':' Exp ';' + 34 | "def" IDENT . '(' IDENT ')' ':' Exp ';' + + ':' shift, and go to state 63 + '(' shift, and go to state 64 + + +state 19 + + 7 Exp: "if" Exp . "then" Exp ElseBody + 8 | "if" Exp . error + 9 | Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + error shift, and go to state 65 + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "then" shift, and go to state 66 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + +state 20 + + 5 Exp: FuncDef . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 58 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 21 + + 32 String: QQSTRING_START QQString . QQSTRING_END + 36 QQString: QQString . QQSTRING_TEXT + 37 | QQString . QQSTRING_INTERP_START Exp QQSTRING_INTERP_END + + QQSTRING_TEXT shift, and go to state 67 + QQSTRING_INTERP_START shift, and go to state 68 + QQSTRING_END shift, and go to state 69 + + +state 22 + + 52 Term: '$' IDENT . + + $default reduce using rule 52 (Term) + + +state 23 + + 55 Term: '(' error . ')' + + ')' shift, and go to state 70 + + +state 24 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + 48 Term: '(' Exp . ')' + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + ')' shift, and go to state 71 + + +state 25 + + 44 Term: '.' IDENT . + + $default reduce using rule 44 (Term) + + +state 26 + + 56 Term: '[' error . ']' + + ']' shift, and go to state 72 + + +state 27 + + 50 Term: '[' ']' . + + $default reduce using rule 50 (Term) + + +state 28 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + 49 Term: '[' Exp . ']' + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + ']' shift, and go to state 73 + + +state 29 + + 58 Term: '{' error . '}' + 62 MkDict: error . ',' MkDict + + ',' shift, and go to state 74 + '}' shift, and go to state 75 + + +state 30 + + 63 MkDictPair: IDENT . ':' ExpD + 65 | IDENT . + + ':' shift, and go to state 76 + + $default reduce using rule 65 (MkDictPair) + + +state 31 + + 66 MkDictPair: '(' . Exp ')' ':' ExpD + 67 | '(' . error ')' ':' ExpD + + error shift, and go to state 77 + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 78 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 32 + + 64 MkDictPair: String . ':' ExpD + + ':' shift, and go to state 79 + + +state 33 + + 51 Term: '{' MkDict . '}' + + '}' shift, and go to state 80 + + +state 34 + + 60 MkDict: MkDictPair . + 61 | MkDictPair . ',' MkDict + + ',' shift, and go to state 81 + + $default reduce using rule 60 (MkDict) + + +state 35 + + 0 $accept: TopLevel $end . + + $default accept + + +state 36 + + 25 Exp: Exp "==" . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 82 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 37 + + 12 Exp: Exp "//" . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 83 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 38 + + 11 Exp: Exp "and" . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 84 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 39 + + 10 Exp: Exp "or" . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 85 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 40 + + 14 Exp: Exp "|=" . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 86 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 41 + + 18 Exp: Exp "+=" . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 87 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 42 + + 20 Exp: Exp "-=" . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 88 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 43 + + 22 Exp: Exp "*=" . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 89 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 44 + + 24 Exp: Exp "/=" . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 90 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 45 + + 13 Exp: Exp "//=" . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 91 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 46 + + 28 Exp: Exp "<=" . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 92 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 47 + + 29 Exp: Exp ">=" . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 93 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 48 + + 15 Exp: Exp '|' . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 94 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 49 + + 16 Exp: Exp ',' . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 95 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 50 + + 9 Exp: Exp '=' . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 96 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 51 + + 26 Exp: Exp '<' . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 97 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 52 + + 27 Exp: Exp '>' . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 98 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 53 + + 17 Exp: Exp '+' . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 99 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 54 + + 19 Exp: Exp '-' . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 100 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 55 + + 21 Exp: Exp '*' . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 101 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 56 + + 23 Exp: Exp '/' . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 102 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 57 + + 4 FuncDefs: FuncDef FuncDefs . + + $default reduce using rule 4 (FuncDefs) + + +state 58 + + 5 Exp: FuncDef Exp . + 9 | Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + $default reduce using rule 5 (Exp) + + +state 59 + + 6 Exp: Term "as" . '$' IDENT '|' Exp + + '$' shift, and go to state 103 + + +state 60 + + 43 Term: Term '.' . IDENT + + IDENT shift, and go to state 104 + + +state 61 + + 45 Term: Term '[' . Exp ']' + 46 | Term '[' . ']' + 57 | Term '[' . error ']' + + error shift, and go to state 105 + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + ']' shift, and go to state 106 + '{' shift, and go to state 10 + + Exp go to state 107 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 62 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + 54 Term: IDENT '(' Exp . ')' + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + ')' shift, and go to state 108 + + +state 63 + + 33 FuncDef: "def" IDENT ':' . Exp ';' + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 109 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 64 + + 34 FuncDef: "def" IDENT '(' . IDENT ')' ':' Exp ';' + + IDENT shift, and go to state 110 + + +state 65 + + 8 Exp: "if" Exp error . + + $default reduce using rule 8 (Exp) + + +state 66 + + 7 Exp: "if" Exp "then" . Exp ElseBody + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 111 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 67 + + 36 QQString: QQString QQSTRING_TEXT . + + $default reduce using rule 36 (QQString) + + +state 68 + + 37 QQString: QQString QQSTRING_INTERP_START . Exp QQSTRING_INTERP_END + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 112 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 69 + + 32 String: QQSTRING_START QQString QQSTRING_END . + + $default reduce using rule 32 (String) + + +state 70 + + 55 Term: '(' error ')' . + + $default reduce using rule 55 (Term) + + +state 71 + + 48 Term: '(' Exp ')' . + + $default reduce using rule 48 (Term) + + +state 72 + + 56 Term: '[' error ']' . + + $default reduce using rule 56 (Term) + + +state 73 + + 49 Term: '[' Exp ']' . + + $default reduce using rule 49 (Term) + + +state 74 + + 62 MkDict: error ',' . MkDict + + error shift, and go to state 113 + IDENT shift, and go to state 30 + QQSTRING_START shift, and go to state 5 + '(' shift, and go to state 31 + + '}' reduce using rule 59 (MkDict) + + String go to state 32 + MkDict go to state 114 + MkDictPair go to state 34 + + +state 75 + + 58 Term: '{' error '}' . + + $default reduce using rule 58 (Term) + + +state 76 + + 63 MkDictPair: IDENT ':' . ExpD + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + ExpD go to state 115 + Term go to state 116 + + +state 77 + + 67 MkDictPair: '(' error . ')' ':' ExpD + + ')' shift, and go to state 117 + + +state 78 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + 66 MkDictPair: '(' Exp . ')' ':' ExpD + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + ')' shift, and go to state 118 + + +state 79 + + 64 MkDictPair: String ':' . ExpD + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + ExpD go to state 119 + Term go to state 116 + + +state 80 + + 51 Term: '{' MkDict '}' . + + $default reduce using rule 51 (Term) + + +state 81 + + 61 MkDict: MkDictPair ',' . MkDict + + error shift, and go to state 113 + IDENT shift, and go to state 30 + QQSTRING_START shift, and go to state 5 + '(' shift, and go to state 31 + + '}' reduce using rule 59 (MkDict) + + String go to state 32 + MkDict go to state 120 + MkDictPair go to state 34 + + +state 82 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 25 | Exp "==" Exp . + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + "==" error (nonassociative) + "<=" error (nonassociative) + ">=" error (nonassociative) + '<' error (nonassociative) + '>' error (nonassociative) + + $default reduce using rule 25 (Exp) + + +state 83 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 12 | Exp "//" Exp . + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + $default reduce using rule 12 (Exp) + + +state 84 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 11 | Exp "and" Exp . + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + $default reduce using rule 11 (Exp) + + +state 85 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 10 | Exp "or" Exp . + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "and" shift, and go to state 38 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + $default reduce using rule 10 (Exp) + + +state 86 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 14 | Exp "|=" Exp . + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + "|=" error (nonassociative) + "+=" error (nonassociative) + "-=" error (nonassociative) + "*=" error (nonassociative) + "/=" error (nonassociative) + "//=" error (nonassociative) + '=' error (nonassociative) + + $default reduce using rule 14 (Exp) + + +state 87 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 18 | Exp "+=" Exp . + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + "|=" error (nonassociative) + "+=" error (nonassociative) + "-=" error (nonassociative) + "*=" error (nonassociative) + "/=" error (nonassociative) + "//=" error (nonassociative) + '=' error (nonassociative) + + $default reduce using rule 18 (Exp) + + +state 88 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 20 | Exp "-=" Exp . + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + "|=" error (nonassociative) + "+=" error (nonassociative) + "-=" error (nonassociative) + "*=" error (nonassociative) + "/=" error (nonassociative) + "//=" error (nonassociative) + '=' error (nonassociative) + + $default reduce using rule 20 (Exp) + + +state 89 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 22 | Exp "*=" Exp . + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + "|=" error (nonassociative) + "+=" error (nonassociative) + "-=" error (nonassociative) + "*=" error (nonassociative) + "/=" error (nonassociative) + "//=" error (nonassociative) + '=' error (nonassociative) + + $default reduce using rule 22 (Exp) + + +state 90 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 24 | Exp "/=" Exp . + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + "|=" error (nonassociative) + "+=" error (nonassociative) + "-=" error (nonassociative) + "*=" error (nonassociative) + "/=" error (nonassociative) + "//=" error (nonassociative) + '=' error (nonassociative) + + $default reduce using rule 24 (Exp) + + +state 91 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 13 | Exp "//=" Exp . + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + "|=" error (nonassociative) + "+=" error (nonassociative) + "-=" error (nonassociative) + "*=" error (nonassociative) + "/=" error (nonassociative) + "//=" error (nonassociative) + '=' error (nonassociative) + + $default reduce using rule 13 (Exp) + + +state 92 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 28 | Exp "<=" Exp . + 29 | Exp . ">=" Exp + + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + "==" error (nonassociative) + "<=" error (nonassociative) + ">=" error (nonassociative) + '<' error (nonassociative) + '>' error (nonassociative) + + $default reduce using rule 28 (Exp) + + +state 93 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + 29 | Exp ">=" Exp . + + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + "==" error (nonassociative) + "<=" error (nonassociative) + ">=" error (nonassociative) + '<' error (nonassociative) + '>' error (nonassociative) + + $default reduce using rule 29 (Exp) + + +state 94 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 15 | Exp '|' Exp . + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + $default reduce using rule 15 (Exp) + + +state 95 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 16 | Exp ',' Exp . + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + $default reduce using rule 16 (Exp) + + +state 96 + + 9 Exp: Exp . '=' Exp + 9 | Exp '=' Exp . + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + "|=" error (nonassociative) + "+=" error (nonassociative) + "-=" error (nonassociative) + "*=" error (nonassociative) + "/=" error (nonassociative) + "//=" error (nonassociative) + '=' error (nonassociative) + + $default reduce using rule 9 (Exp) + + +state 97 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 26 | Exp '<' Exp . + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + "==" error (nonassociative) + "<=" error (nonassociative) + ">=" error (nonassociative) + '<' error (nonassociative) + '>' error (nonassociative) + + $default reduce using rule 26 (Exp) + + +state 98 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 27 | Exp '>' Exp . + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + "==" error (nonassociative) + "<=" error (nonassociative) + ">=" error (nonassociative) + '<' error (nonassociative) + '>' error (nonassociative) + + $default reduce using rule 27 (Exp) + + +state 99 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 17 | Exp '+' Exp . + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + $default reduce using rule 17 (Exp) + + +state 100 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 19 | Exp '-' Exp . + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + $default reduce using rule 19 (Exp) + + +state 101 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 21 | Exp '*' Exp . + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + $default reduce using rule 21 (Exp) + + +state 102 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 23 | Exp '/' Exp . + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + $default reduce using rule 23 (Exp) + + +state 103 + + 6 Exp: Term "as" '$' . IDENT '|' Exp + + IDENT shift, and go to state 121 + + +state 104 + + 43 Term: Term '.' IDENT . + + $default reduce using rule 43 (Term) + + +state 105 + + 57 Term: Term '[' error . ']' + + ']' shift, and go to state 122 + + +state 106 + + 46 Term: Term '[' ']' . + + $default reduce using rule 46 (Term) + + +state 107 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + 45 Term: Term '[' Exp . ']' + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + ']' shift, and go to state 123 + + +state 108 + + 54 Term: IDENT '(' Exp ')' . + + $default reduce using rule 54 (Term) + + +state 109 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + 33 FuncDef: "def" IDENT ':' Exp . ';' + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + ';' shift, and go to state 124 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + +state 110 + + 34 FuncDef: "def" IDENT '(' IDENT . ')' ':' Exp ';' + + ')' shift, and go to state 125 + + +state 111 + + 7 Exp: "if" Exp "then" Exp . ElseBody + 9 | Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "else" shift, and go to state 126 + "elif" shift, and go to state 127 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + ElseBody go to state 128 + + +state 112 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + 37 QQString: QQString QQSTRING_INTERP_START Exp . QQSTRING_INTERP_END + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + QQSTRING_INTERP_END shift, and go to state 129 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + +state 113 + + 62 MkDict: error . ',' MkDict + + ',' shift, and go to state 74 + + +state 114 + + 62 MkDict: error ',' MkDict . + + $default reduce using rule 62 (MkDict) + + +state 115 + + 40 ExpD: ExpD . '|' ExpD + 63 MkDictPair: IDENT ':' ExpD . + + '|' shift, and go to state 130 + + $default reduce using rule 63 (MkDictPair) + + +state 116 + + 41 ExpD: Term . + 43 Term: Term . '.' IDENT + 45 | Term . '[' Exp ']' + 46 | Term . '[' ']' + 57 | Term . '[' error ']' + + '.' shift, and go to state 60 + '[' shift, and go to state 61 + + $default reduce using rule 41 (ExpD) + + +state 117 + + 67 MkDictPair: '(' error ')' . ':' ExpD + + ':' shift, and go to state 131 + + +state 118 + + 66 MkDictPair: '(' Exp ')' . ':' ExpD + + ':' shift, and go to state 132 + + +state 119 + + 40 ExpD: ExpD . '|' ExpD + 64 MkDictPair: String ':' ExpD . + + '|' shift, and go to state 130 + + $default reduce using rule 64 (MkDictPair) + + +state 120 + + 61 MkDict: MkDictPair ',' MkDict . + + $default reduce using rule 61 (MkDict) + + +state 121 + + 6 Exp: Term "as" '$' IDENT . '|' Exp + + '|' shift, and go to state 133 + + +state 122 + + 57 Term: Term '[' error ']' . + + $default reduce using rule 57 (Term) + + +state 123 + + 45 Term: Term '[' Exp ']' . + + $default reduce using rule 45 (Term) + + +state 124 + + 33 FuncDef: "def" IDENT ':' Exp ';' . + + $default reduce using rule 33 (FuncDef) + + +state 125 + + 34 FuncDef: "def" IDENT '(' IDENT ')' . ':' Exp ';' + + ':' shift, and go to state 134 + + +state 126 + + 39 ElseBody: "else" . Exp "end" + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 135 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 127 + + 38 ElseBody: "elif" . Exp "then" Exp ElseBody + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 136 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 128 + + 7 Exp: "if" Exp "then" Exp ElseBody . + + $default reduce using rule 7 (Exp) + + +state 129 + + 37 QQString: QQString QQSTRING_INTERP_START Exp QQSTRING_INTERP_END . + + $default reduce using rule 37 (QQString) + + +state 130 + + 40 ExpD: ExpD '|' . ExpD + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + ExpD go to state 137 + Term go to state 116 + + +state 131 + + 67 MkDictPair: '(' error ')' ':' . ExpD + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + ExpD go to state 138 + Term go to state 116 + + +state 132 + + 66 MkDictPair: '(' Exp ')' ':' . ExpD + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + ExpD go to state 139 + Term go to state 116 + + +state 133 + + 6 Exp: Term "as" '$' IDENT '|' . Exp + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 140 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 134 + + 34 FuncDef: "def" IDENT '(' IDENT ')' ':' . Exp ';' + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 141 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 135 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + 39 ElseBody: "else" Exp . "end" + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "end" shift, and go to state 142 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + +state 136 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + 38 ElseBody: "elif" Exp . "then" Exp ElseBody + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "then" shift, and go to state 143 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + +state 137 + + 40 ExpD: ExpD . '|' ExpD + 40 | ExpD '|' ExpD . + + $default reduce using rule 40 (ExpD) + + +state 138 + + 40 ExpD: ExpD . '|' ExpD + 67 MkDictPair: '(' error ')' ':' ExpD . + + '|' shift, and go to state 130 + + $default reduce using rule 67 (MkDictPair) + + +state 139 + + 40 ExpD: ExpD . '|' ExpD + 66 MkDictPair: '(' Exp ')' ':' ExpD . + + '|' shift, and go to state 130 + + $default reduce using rule 66 (MkDictPair) + + +state 140 + + 6 Exp: Term "as" '$' IDENT '|' Exp . + 9 | Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + $default reduce using rule 6 (Exp) + + +state 141 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + 34 FuncDef: "def" IDENT '(' IDENT ')' ':' Exp . ';' + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + ';' shift, and go to state 144 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + +state 142 + + 39 ElseBody: "else" Exp "end" . + + $default reduce using rule 39 (ElseBody) + + +state 143 + + 38 ElseBody: "elif" Exp "then" . Exp ElseBody + + IDENT shift, and go to state 1 + LITERAL shift, and go to state 2 + "def" shift, and go to state 3 + "if" shift, and go to state 4 + QQSTRING_START shift, and go to state 5 + '$' shift, and go to state 6 + '(' shift, and go to state 7 + '.' shift, and go to state 8 + '[' shift, and go to state 9 + '{' shift, and go to state 10 + + Exp go to state 145 + String go to state 14 + FuncDef go to state 20 + Term go to state 16 + + +state 144 + + 34 FuncDef: "def" IDENT '(' IDENT ')' ':' Exp ';' . + + $default reduce using rule 34 (FuncDef) + + +state 145 + + 9 Exp: Exp . '=' Exp + 10 | Exp . "or" Exp + 11 | Exp . "and" Exp + 12 | Exp . "//" Exp + 13 | Exp . "//=" Exp + 14 | Exp . "|=" Exp + 15 | Exp . '|' Exp + 16 | Exp . ',' Exp + 17 | Exp . '+' Exp + 18 | Exp . "+=" Exp + 19 | Exp . '-' Exp + 20 | Exp . "-=" Exp + 21 | Exp . '*' Exp + 22 | Exp . "*=" Exp + 23 | Exp . '/' Exp + 24 | Exp . "/=" Exp + 25 | Exp . "==" Exp + 26 | Exp . '<' Exp + 27 | Exp . '>' Exp + 28 | Exp . "<=" Exp + 29 | Exp . ">=" Exp + 38 ElseBody: "elif" Exp "then" Exp . ElseBody + + "==" shift, and go to state 36 + "//" shift, and go to state 37 + "else" shift, and go to state 126 + "elif" shift, and go to state 127 + "and" shift, and go to state 38 + "or" shift, and go to state 39 + "|=" shift, and go to state 40 + "+=" shift, and go to state 41 + "-=" shift, and go to state 42 + "*=" shift, and go to state 43 + "/=" shift, and go to state 44 + "//=" shift, and go to state 45 + "<=" shift, and go to state 46 + ">=" shift, and go to state 47 + '|' shift, and go to state 48 + ',' shift, and go to state 49 + '=' shift, and go to state 50 + '<' shift, and go to state 51 + '>' shift, and go to state 52 + '+' shift, and go to state 53 + '-' shift, and go to state 54 + '*' shift, and go to state 55 + '/' shift, and go to state 56 + + ElseBody go to state 146 + + +state 146 + + 38 ElseBody: "elif" Exp "then" Exp ElseBody . + + $default reduce using rule 38 (ElseBody)