/* A Bison parser, made from request.y */ #define CLOSE_ROUND_BRACKET 258 #define OPEN_ROUND_BRACKET 259 #define REQUEST_STRING 260 #define NON_QUOTED_TEXT_STRING 261 #define DOUBLE_QUOTED_TEXT_STRING 262 #define SINGLE_QUOTED_TEXT_STRING 263 #define IF_ 264 #define ELSE_ 265 #define UNKNOWN_ 266 #define ENDIF_ 267 #define SCOPE_DATA_ITEM_ 268 #define SCOPE_LOOP_PACKET_ 269 #define SCOPE_LOOP_STRUCTURE_ 270 #define SCOPE_SAVE_FRAME_ 271 #define SCOPE_DATA_BLOCK_ 272 #define SCOPE_FILE_ 273 #define ENDSCOPE_ 274 #define UNION_ 275 #define INTERSECTION_ 276 #define ASCII_LESS_ 277 #define ASCII_LESS_OR_EQUAL_ 278 #define ASCII_GREATER_ 279 #define ASCII_GREATER_OR_EQUAL_ 280 #define REAL_LESS_ 281 #define REAL_LESS_OR_EQUAL_ 282 #define REAL_GREATER_ 283 #define REAL_GREATER_OR_EQUAL_ 284 #define SUB_STRING_ 285 #define NOT_SUB_STRING_ 286 #define EQUAL_STRINGS_ 287 #define NOT_EQUAL_STRINGS_ 288 #define REAL_EQUAL_ 289 #define REAL_NOT_EQUAL_ 290 #define COMPLEMENT_ 291 #define ASSUME_TRUE_ 292 #define REG_EXP_ 293 #line 11 "request.y" #include "diagmesg.h" #include "sf_space.h" #include "request_space.h" /* local variables */ char *request_string = NULL; Request_Seq **next_req = NULL; extern Data_Item *current_di; int request_line_count = 1; char *last_request_token = NULL; #include "request_scanner.c" /* request_scanner defines malloc so * its important that it comes in before utilitys */ #include "utilitys.h" #include "sf_search.h" #include "operators.h" /* /usr/include/string.h */ extern char * strncat(/* char *s1, const char *s2, size_t n */); extern char * strpbrk(/* const char *s1, const char *s2 */); /* redefine yylex */ #ifdef yylex #undef yylex #endif #define yylex request_scanner /* BOTCHES to help in compiling */ /* redefine yyparse */ #ifdef yyparse #undef yyparse #endif #define yyparse parse_request #define yyerror request_error #ifdef YYDEBUG #define xmalloc malloc #endif extern char *re_comp(char *); extern re_exec(char *); /* end BOTCHES */ /* programming macros */ #define BUILD_COMPARISON_FN( d, f, l ) \ { \ Malloc( Conditional_Request, d); \ d->tag = COMPARISON_FN; \ d->cond.comparison_fn.function = f; \ d->cond.comparison_fn.left = l; \ d->cond.comparison_fn.right = current_di; \ } while(0) #define BUILD_BINARY_FN( d, f, l, r) \ { \ Malloc( Conditional_Request, d); \ d->tag = BINARY_FN; \ d->cond.binary_fn.function = f; \ d->cond.binary_fn.left = l; \ d->cond.binary_fn.right = r; \ } while(0) /* global variables */ extern Request_Seq *requests; #line 85 "request.y" typedef union { char *string; Request_Seq *star_request_value; Conditional_Request *conditional_request_value; Request *request_value; Data_Item *data_item_val; } YYSTYPE; #ifndef YYLTYPE typedef struct yyltype { int timestamp; int first_line; int first_column; int last_line; int last_column; char *text; } yyltype; #define YYLTYPE yyltype #endif #ifndef YYDEBUG #define YYDEBUG 1 #endif #include #ifndef __STDC__ #define const #endif #define YYFINAL 84 #define YYFLAG -32768 #define YYNTBASE 39 #define YYTRANSLATE(x) ((unsigned)(x) <= 293 ? yytranslate[x] : 44) static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38 }; static const short yyprhs[] = { 0, 0, 1, 3, 5, 10, 17, 26, 33, 37, 41, 45, 49, 53, 57, 61, 65, 69, 73, 77, 81, 85, 89, 93, 97, 101, 105, 109, 113, 117, 121, 125, 128, 131, 133, 138, 140, 142, 144, 145 }; static const short yyrhs[] = { -1, 43, 0, 41, 0, 9, 41, 43, 12, 0, 9, 41, 43, 10, 43, 12, 0, 9, 41, 43, 10, 43, 11, 43, 12, 0, 9, 41, 43, 11, 43, 12, 0, 13, 43, 19, 0, 14, 43, 19, 0, 15, 43, 19, 0, 16, 43, 19, 0, 17, 43, 19, 0, 18, 43, 19, 0, 4, 41, 3, 0, 41, 20, 41, 0, 41, 21, 41, 0, 41, 32, 42, 0, 41, 33, 42, 0, 41, 30, 42, 0, 41, 31, 42, 0, 41, 22, 42, 0, 41, 23, 42, 0, 41, 24, 42, 0, 41, 25, 42, 0, 41, 34, 42, 0, 41, 35, 42, 0, 41, 26, 42, 0, 41, 27, 42, 0, 41, 28, 42, 0, 41, 29, 42, 0, 36, 41, 0, 37, 41, 0, 5, 0, 38, 4, 5, 3, 0, 6, 0, 7, 0, 8, 0, 0, 43, 40, 0 }; #if YYDEBUG != 0 static const short yyrline[] = { 0, 118, 122, 129, 138, 150, 161, 172, 184, 194, 204, 214, 223, 232, 244, 251, 257, 263, 269, 275, 281, 287, 293, 299, 305, 311, 317, 323, 329, 335, 341, 348, 357, 366, 374, 383, 389, 394, 401, 408 }; static const char * const yytname[] = { "$", "error","$illegal.","CLOSE_ROUND_BRACKET","OPEN_ROUND_BRACKET","REQUEST_STRING","NON_QUOTED_TEXT_STRING","DOUBLE_QUOTED_TEXT_STRING","SINGLE_QUOTED_TEXT_STRING","IF_","ELSE_", "UNKNOWN_","ENDIF_","SCOPE_DATA_ITEM_","SCOPE_LOOP_PACKET_","SCOPE_LOOP_STRUCTURE_","SCOPE_SAVE_FRAME_","SCOPE_DATA_BLOCK_","SCOPE_FILE_","ENDSCOPE_","UNION_", "INTERSECTION_","ASCII_LESS_","ASCII_LESS_OR_EQUAL_","ASCII_GREATER_","ASCII_GREATER_OR_EQUAL_","REAL_LESS_","REAL_LESS_OR_EQUAL_","REAL_GREATER_","REAL_GREATER_OR_EQUAL_","SUB_STRING_", "NOT_SUB_STRING_","EQUAL_STRINGS_","NOT_EQUAL_STRINGS_","REAL_EQUAL_","REAL_NOT_EQUAL_","COMPLEMENT_","ASSUME_TRUE_","REG_EXP_","star_request","a_request", "conditional_request","data_item","sequence_of_requests","" }; #endif static const short yyr1[] = { 0, 39, 39, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 42, 42, 42, 43, 43 }; static const short yyr2[] = { 0, 0, 1, 1, 4, 6, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 4, 1, 1, 1, 0, 2 }; static const short yydefact[] = { 38, 2, 0, 33, 0, 38, 38, 38, 38, 38, 38, 0, 0, 0, 39, 3, 0, 38, 0, 0, 0, 0, 0, 0, 31, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 0, 8, 9, 10, 11, 12, 13, 0, 15, 16, 35, 36, 37, 21, 22, 23, 24, 27, 28, 29, 30, 19, 20, 17, 18, 25, 26, 38, 38, 4, 34, 0, 0, 38, 5, 7, 0, 6, 0, 0, 0 }; static const short yydefgoto[] = { 82, 14, 15, 57, 1 }; static const short yypact[] = { 6, 216, 41,-32768, 41,-32768,-32768,-32768,-32768,-32768,-32768, 41, 41, 3,-32768, 253, 237, 253, 45, 71, 87, 113, 129, 155,-32768,-32768, 5, 41, 41, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62,-32768, 4,-32768,-32768,-32768,-32768,-32768,-32768, 8, 268, 282,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768, 19, 171,-32768,-32768,-32768, 201, -32768, 25, 26,-32768 }; static const short yypgoto[] = {-32768, -32768, 108, 288, -5 }; #define YYLAST 330 static const short yytable[] = { 18, 19, 20, 21, 22, 23, -1, 26, 2, 3, 51, 74, 44, 4, 71, 72, 73, 5, 6, 7, 8, 9, 10, 2, 3, 83, 84, 0, 4, 0, 77, 78, 5, 6, 7, 8, 9, 10, 0, 0, 11, 12, 13, 0, 0, 2, 3, 0, 0, 2, 3, 0, 0, 0, 4, 11, 12, 13, 5, 6, 7, 8, 9, 10, 45, 0, 75, 76, 54, 55, 56, 0, 80, 0, 0, 2, 3, 11, 12, 13, 4, 11, 12, 13, 5, 6, 7, 8, 9, 10, 46, 2, 3, 0, 0, 0, 4, 0, 0, 0, 5, 6, 7, 8, 9, 10, 47, 11, 12, 13, 16, 0, 17, 0, 0, 0, 0, 2, 3, 24, 25, 0, 4, 11, 12, 13, 5, 6, 7, 8, 9, 10, 48, 2, 3, 52, 53, 0, 4, 0, 0, 0, 5, 6, 7, 8, 9, 10, 49, 11, 12, 13, 0, 0, 0, 0, 0, 0, 0, 2, 3, 0, 0, 0, 4, 11, 12, 13, 5, 6, 7, 8, 9, 10, 50, 2, 3, 0, 0, 0, 4, 0, 0, 79, 5, 6, 7, 8, 9, 10, 0, 11, 12, 13, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 11, 12, 13, 4, 0, 0, 81, 5, 6, 7, 8, 9, 10, 2, 3, 0, 0, 0, 4, 0, 0, 0, 5, 6, 7, 8, 9, 10, 0, 0, 11, 12, 13, 43, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 12, 13, 0, 0, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70 }; static const short yycheck[] = { 5, 6, 7, 8, 9, 10, 0, 4, 4, 5, 5, 3, 17, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 4, 5, 0, 0, -1, 9, -1, 11, 12, 13, 14, 15, 16, 17, 18, -1, -1, 36, 37, 38, -1, -1, 4, 5, -1, -1, 4, 5, -1, -1, -1, 9, 36, 37, 38, 13, 14, 15, 16, 17, 18, 19, -1, 71, 72, 6, 7, 8, -1, 77, -1, -1, 4, 5, 36, 37, 38, 9, 36, 37, 38, 13, 14, 15, 16, 17, 18, 19, 4, 5, -1, -1, -1, 9, -1, -1, -1, 13, 14, 15, 16, 17, 18, 19, 36, 37, 38, 2, -1, 4, -1, -1, -1, -1, 4, 5, 11, 12, -1, 9, 36, 37, 38, 13, 14, 15, 16, 17, 18, 19, 4, 5, 27, 28, -1, 9, -1, -1, -1, 13, 14, 15, 16, 17, 18, 19, 36, 37, 38, -1, -1, -1, -1, -1, -1, -1, 4, 5, -1, -1, -1, 9, 36, 37, 38, 13, 14, 15, 16, 17, 18, 19, 4, 5, -1, -1, -1, 9, -1, -1, 12, 13, 14, 15, 16, 17, 18, -1, 36, 37, 38, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 4, 5, 36, 37, 38, 9, -1, -1, 12, 13, 14, 15, 16, 17, 18, 4, 5, -1, -1, -1, 9, -1, -1, -1, 13, 14, 15, 16, 17, 18, -1, -1, 36, 37, 38, 3, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 36, 37, 38, -1, -1, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42 }; /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ #line 3 "/usr/gnu/lib/bison.simple" /* Skeleton output parser for bison, Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman 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 1, 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, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef alloca #ifdef __GNUC__ #define alloca __builtin_alloca #else /* Not GNU C. */ #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) #include #else /* Not sparc */ #ifdef MSDOS #include #endif /* MSDOS */ #endif /* Not sparc. */ #endif /* Not GNU C. */ #endif /* alloca not defined. */ /* This is the parser code that is written into each bison parser when the %semantic_parser declaration is not specified in the grammar. It was written by Richard Stallman by simplifying the hairy parser used when %semantic_parser is specified. */ /* Note: there must be only one dollar sign in this file. It is replaced by the list of actions, each action as one case of the switch. */ #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT return(0) #define YYABORT return(1) #define YYERROR goto yyerrlab1 /* 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. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(token, value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { yychar = (token), yylval = (value); \ yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { yyerror ("syntax error: cannot back up"); YYERROR; } \ while (0) #define YYTERROR 1 #define YYERRCODE 256 #ifndef YYPURE #define YYLEX yylex() #endif #ifdef YYPURE #ifdef YYLSP_NEEDED #define YYLEX yylex(&yylval, &yylloc) #else #define YYLEX yylex(&yylval) #endif #endif /* If nonreentrant, generate the variables here */ #ifndef YYPURE int yychar; /* the lookahead symbol */ YYSTYPE yylval; /* the semantic value of the */ /* lookahead symbol */ #ifdef YYLSP_NEEDED YYLTYPE yylloc; /* location data for the lookahead */ /* symbol */ #endif int yynerrs; /* number of parse errors so far */ #endif /* not YYPURE */ #if YYDEBUG != 0 int yydebug; /* nonzero means print parse trace */ /* Since this is uninitialized, it does not stop multiple parsers from coexisting. */ #endif /* YYINITDEPTH indicates the initial size of the parser's stacks */ #ifndef YYINITDEPTH #define YYINITDEPTH 200 #endif /* YYMAXDEPTH is the maximum size the stacks can grow to (effective only if the built-in stack extension method is used). */ #if YYMAXDEPTH == 0 #undef YYMAXDEPTH #endif #ifndef YYMAXDEPTH #define YYMAXDEPTH 10000 #endif #ifndef __cplusplus /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_bcopy (from, to, count) char *from; char *to; int count; { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #else /* __cplusplus */ /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_bcopy (char *from, char *to, int count) { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #endif #line 160 "/usr/gnu/lib/bison.simple" int yyparse() { register int yystate; register int yyn; register short *yyssp; register YYSTYPE *yyvsp; int yyerrstatus; /* number of tokens to shift before error messages enabled */ int yychar1; /* lookahead token as an internal (translated) token number */ short yyssa[YYINITDEPTH]; /* the state stack */ YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ short *yyss = yyssa; /* refer to the stacks thru separate pointers */ YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ #ifdef YYLSP_NEEDED YYLTYPE *yyls = yylsa; YYLTYPE *yylsp; YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ #define YYPOPSTACK (yyvsp--, yysp--, yylsp--) #else #define YYPOPSTACK (yyvsp--, yysp--) #endif int yystacksize = YYINITDEPTH; #ifdef YYPURE int yychar; YYSTYPE yylval; int yynerrs; #ifdef YYLSP_NEEDED YYLTYPE yylloc; #endif #endif YYSTYPE yyval; /* the variable used to return */ /* semantic values from the action */ /* routines */ int yylen; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Starting parse\n"); #endif 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. */ yyssp = yyss - 1; yyvsp = yyvs; #ifdef YYLSP_NEEDED yylsp = yyls; #endif /* Push a new state, which is found in yystate . */ /* In all cases, when you get here, the value and location stacks have just been pushed. so pushing a state here evens the stacks. */ yynewstate: *++yyssp = yystate; if (yyssp >= yyss + yystacksize - 1) { /* Give user a chance to reallocate the stack */ /* Use copies of these so that the &'s don't force the real ones into memory. */ YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; #ifdef YYLSP_NEEDED YYLTYPE *yyls1 = yyls; #endif /* Get the current used size of the three stacks, in elements. */ int size = yyssp - yyss + 1; #ifdef yyoverflow /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. */ yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), #ifdef YYLSP_NEEDED &yyls1, size * sizeof (*yylsp), #endif &yystacksize); yyss = yyss1; yyvs = yyvs1; #ifdef YYLSP_NEEDED yyls = yyls1; #endif #else /* no yyoverflow */ /* Extend the stack our own way. */ if (yystacksize >= YYMAXDEPTH) { yyerror("parser stack overflow"); return 2; } yystacksize *= 2; if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; yyss = (short *) alloca (yystacksize * sizeof (*yyssp)); __yy_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp)); yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp)); __yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp)); #ifdef YYLSP_NEEDED yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp)); __yy_bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp)); #endif #endif /* no yyoverflow */ yyssp = yyss + size - 1; yyvsp = yyvs + size - 1; #ifdef YYLSP_NEEDED yylsp = yyls + size - 1; #endif #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Stack size increased to %d\n", yystacksize); #endif if (yyssp >= yyss + yystacksize - 1) YYABORT; } #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Entering state %d\n", yystate); #endif yybackup: /* Do appropriate processing given the current state. */ /* Read a lookahead token if we need one and don't already have one. */ /* yyresume: */ /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; if (yyn == YYFLAG) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ /* yychar is either YYEMPTY or YYEOF or a valid token in external form. */ if (yychar == YYEMPTY) { #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Reading a token: "); #endif yychar = YYLEX; } /* Convert token to internal form (in yychar1) for indexing tables with */ if (yychar <= 0) /* This means end of input. */ { yychar1 = 0; yychar = YYEOF; /* Don't call YYLEX any more */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Now at end of input.\n"); #endif } else { yychar1 = YYTRANSLATE(yychar); #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Next token is %d (%s)\n", yychar, yytname[yychar1]); #endif } yyn += yychar1; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; yyn = yytable[yyn]; /* yyn is what to do for this token type in this state. Negative => reduce, -yyn is rule number. Positive => shift, yyn is new state. New state is final state => don't bother to shift, just return success. 0, or most negative number => error. */ if (yyn < 0) { if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); #endif /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif /* count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus) yyerrstatus--; yystate = yyn; goto yynewstate; /* Do the default action for the current state. */ yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; /* Do a reduction. yyn is the number of a rule to reduce with. */ yyreduce: yylen = yyr2[yyn]; yyval = yyvsp[1-yylen]; /* implement default value of the action */ #if YYDEBUG != 0 if (yydebug) { int i; fprintf (stderr, "Reducing via rule %d (line %d), ", yyn, yyrline[yyn]); /* Print the symboles being reduced, and their result. */ for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) fprintf (stderr, "%s ", yytname[yyrhs[i]]); fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); } #endif switch (yyn) { case 1: #line 119 "request.y" { INFORM_MSG("Starting Interpreter for Request Language."); ; break;} case 2: #line 123 "request.y" { DEBUG_MSG("star_request : sequence_of_requests"); requests = yyvsp[0].star_request_value; ; break;} case 3: #line 131 "request.y" { DEBUG_MSG("a_request : conditional_request"); Malloc( Request, yyval.request_value ); yyval.request_value->tag = CONDITIONAL; yyval.request_value->request.conditional = yyvsp[0].conditional_request_value; ; break;} case 4: #line 139 "request.y" { DEBUG_MSG("a_request : IF_ conditional_request sequence_of_requests ENDIF_"); Malloc( Request, yyval.request_value ); yyval.request_value->tag = BRANCHING; Malloc( Branching_Request, yyval.request_value->request.branching ); yyval.request_value->request.branching->condition = yyvsp[-2].conditional_request_value; yyval.request_value->request.branching->true_branch = yyvsp[-1].star_request_value; yyval.request_value->request.branching->false_branch = NULL; yyval.request_value->request.branching->unknown_branch = NULL; ; break;} case 5: #line 151 "request.y" { DEBUG_MSG("a_request : IF_ conditional_request sequence_of_requests ELSE_ sequence_of_requests ENDIF_"); Malloc( Request, yyval.request_value ); yyval.request_value->tag = BRANCHING; Malloc( Branching_Request, yyval.request_value->request.branching ); yyval.request_value->request.branching->condition = yyvsp[-4].conditional_request_value; yyval.request_value->request.branching->true_branch = yyvsp[-3].star_request_value; yyval.request_value->request.branching->false_branch = yyvsp[-1].star_request_value; yyval.request_value->request.branching->unknown_branch = NULL; ; break;} case 6: #line 162 "request.y" { DEBUG_MSG("a_request : IF_ conditional_request sequence_of_requests ELSE_ sequence_of_requests UNKNOWN_ sequence_of_requests ENDIF_"); Malloc( Request, yyval.request_value ); yyval.request_value->tag = BRANCHING; Malloc( Branching_Request, yyval.request_value->request.branching ); yyval.request_value->request.branching->condition = yyvsp[-6].conditional_request_value; yyval.request_value->request.branching->true_branch = yyvsp[-5].star_request_value; yyval.request_value->request.branching->false_branch = yyvsp[-3].star_request_value; yyval.request_value->request.branching->unknown_branch = yyvsp[-1].star_request_value; ; break;} case 7: #line 173 "request.y" { DEBUG_MSG("a_request : IF_ conditional_request sequence_of_requests UNKNOWN_ sequence_of_requests ENDIF_"); Malloc( Request, yyval.request_value ); yyval.request_value->tag = BRANCHING; Malloc( Branching_Request, yyval.request_value->request.branching ); yyval.request_value->request.branching->condition = yyvsp[-4].conditional_request_value; yyval.request_value->request.branching->true_branch = yyvsp[-3].star_request_value; yyval.request_value->request.branching->false_branch = NULL; yyval.request_value->request.branching->unknown_branch = yyvsp[-1].star_request_value; ; break;} case 8: #line 185 "request.y" { DEBUG_MSG("a_request : SCOPE_DATA_ITEM_ sequence_of_requests ENDSCOPE_"); Malloc( Request, yyval.request_value ); yyval.request_value->tag = SCOPE; Malloc( Scope_Request, yyval.request_value->request.scope ); yyval.request_value->request.scope->scope = SCOPE_DATA_ITEM; yyval.request_value->request.scope->reqs = yyvsp[-1].star_request_value; ; break;} case 9: #line 195 "request.y" { DEBUG_MSG("a_request : SCOPE_LOOP_PACKET_ sequence_of_requests ENDSCOPE_"); Malloc( Request, yyval.request_value ); yyval.request_value->tag = SCOPE; Malloc( Scope_Request, yyval.request_value->request.scope ); yyval.request_value->request.scope->scope = SCOPE_LOOP_PACKET; yyval.request_value->request.scope->reqs = yyvsp[-1].star_request_value; ; break;} case 10: #line 205 "request.y" { DEBUG_MSG("a_request : SCOPE_LOOP_STRUCTURE_ sequence_of_requests ENDSCOPE_"); Malloc( Request, yyval.request_value ); yyval.request_value->tag = SCOPE; Malloc( Scope_Request, yyval.request_value->request.scope ); yyval.request_value->request.scope->scope = SCOPE_LOOP_STRUCTURE; yyval.request_value->request.scope->reqs = yyvsp[-1].star_request_value; ; break;} case 11: #line 215 "request.y" { DEBUG_MSG("a_request : SCOPE_SAVE_FRAME_ sequence_of_requests ENDSCOPE_"); Malloc( Request, yyval.request_value ); yyval.request_value->tag = SCOPE; Malloc( Scope_Request, yyval.request_value->request.scope ); yyval.request_value->request.scope->scope = SCOPE_SAVE_FRAME; yyval.request_value->request.scope->reqs = yyvsp[-1].star_request_value; ; break;} case 12: #line 224 "request.y" { DEBUG_MSG("a_request : SCOPE_DATA_BLOCK_ sequence_of_requests ENDSCOPE_"); Malloc( Request, yyval.request_value ); yyval.request_value->tag = SCOPE; Malloc( Scope_Request, yyval.request_value->request.scope ); yyval.request_value->request.scope->scope = SCOPE_DATA_BLOCK; yyval.request_value->request.scope->reqs = yyvsp[-1].star_request_value; ; break;} case 13: #line 233 "request.y" { DEBUG_MSG("a_request : SCOPE_FILE_ sequence_of_requests ENDSCOPE_"); Malloc( Request, yyval.request_value ); yyval.request_value->tag = SCOPE; Malloc( Scope_Request, yyval.request_value->request.scope ); yyval.request_value->request.scope->scope = SCOPE_FILE; yyval.request_value->request.scope->reqs = yyvsp[-1].star_request_value; ; break;} case 14: #line 246 "request.y" { DEBUG_MSG("conditional_request : ( conditional_request )"); yyval.conditional_request_value = yyvsp[-1].conditional_request_value; ; break;} case 15: #line 252 "request.y" { DEBUG_MSG("conditional_request : conditional_request UNION_ conditional_request"); BUILD_BINARY_FN( yyval.conditional_request_value, UNION, yyvsp[-2].conditional_request_value, yyvsp[0].conditional_request_value); ; break;} case 16: #line 258 "request.y" { DEBUG_MSG("conditional_request : conditional_request INTERSECTION_ conditional_request"); BUILD_BINARY_FN( yyval.conditional_request_value, INTERSECTION, yyvsp[-2].conditional_request_value, yyvsp[0].conditional_request_value ); ; break;} case 17: #line 264 "request.y" { DEBUG_MSG("conditional_request : conditional_request EQUAL_STRINGS_ data_item"); BUILD_COMPARISON_FN( yyval.conditional_request_value, EQUAL_STRINGS, yyvsp[-2].conditional_request_value ); ; break;} case 18: #line 270 "request.y" { DEBUG_MSG("conditional_request : conditional_request NOT_EQUAL_STRINGS_ data_item"); BUILD_COMPARISON_FN( yyval.conditional_request_value, NOT_EQUAL_STRINGS, yyvsp[-2].conditional_request_value ); ; break;} case 19: #line 276 "request.y" { DEBUG_MSG("conditional_request : conditional_request SUB_STRING_ data_item"); BUILD_COMPARISON_FN( yyval.conditional_request_value, SUB_STRING, yyvsp[-2].conditional_request_value ); ; break;} case 20: #line 282 "request.y" { DEBUG_MSG("conditional_request : conditional_request NOT_SUB_STRING_ data_item"); BUILD_COMPARISON_FN( yyval.conditional_request_value, NOT_SUB_STRING, yyvsp[-2].conditional_request_value ); ; break;} case 21: #line 288 "request.y" { DEBUG_MSG("conditional_request : conditional_request ASCII_LESS_ data_item"); BUILD_COMPARISON_FN( yyval.conditional_request_value, ASCII_LESS, yyvsp[-2].conditional_request_value ); ; break;} case 22: #line 294 "request.y" { DEBUG_MSG("conditional_request : conditional_request ASCII_LESS_OR_EQUAL data_item"); BUILD_COMPARISON_FN( yyval.conditional_request_value, ASCII_LESS_OR_EQUAL, yyvsp[-2].conditional_request_value ); ; break;} case 23: #line 300 "request.y" { DEBUG_MSG("conditional_request : conditional_request ASCII_GREATER data_item"); BUILD_COMPARISON_FN( yyval.conditional_request_value, ASCII_GREATER, yyvsp[-2].conditional_request_value ); ; break;} case 24: #line 306 "request.y" { DEBUG_MSG("conditional_request : conditional_request ASCII_GREATER_OR_EQUAL data_item"); BUILD_COMPARISON_FN( yyval.conditional_request_value, ASCII_GREATER_OR_EQUAL, yyvsp[-2].conditional_request_value ); ; break;} case 25: #line 312 "request.y" { DEBUG_MSG("conditional_request : conditional_request REAL_EQUAL data_item"); BUILD_COMPARISON_FN( yyval.conditional_request_value, REAL_EQUAL, yyvsp[-2].conditional_request_value ); ; break;} case 26: #line 318 "request.y" { DEBUG_MSG("conditional_request : conditional_request REAL_NOT_EQUAL data_item"); BUILD_COMPARISON_FN( yyval.conditional_request_value, REAL_NOT_EQUAL, yyvsp[-2].conditional_request_value ); ; break;} case 27: #line 324 "request.y" { DEBUG_MSG("conditional_request : conditional_request REAL_LESS data_item"); BUILD_COMPARISON_FN( yyval.conditional_request_value, REAL_LESS, yyvsp[-2].conditional_request_value ); ; break;} case 28: #line 330 "request.y" { DEBUG_MSG("conditional_request : conditional_request REAL_LESS_OR_EQUAL data_item"); BUILD_COMPARISON_FN( yyval.conditional_request_value, REAL_LESS_OR_EQUAL, yyvsp[-2].conditional_request_value ); ; break;} case 29: #line 336 "request.y" { DEBUG_MSG("conditional_request : conditional_request REAL_GREATER data_item"); BUILD_COMPARISON_FN( yyval.conditional_request_value, REAL_GREATER, yyvsp[-2].conditional_request_value ); ; break;} case 30: #line 342 "request.y" { DEBUG_MSG("conditional_request : conditional_request REAL_GREATER_OR_EQUAL data_item"); BUILD_COMPARISON_FN( yyval.conditional_request_value, REAL_GREATER_OR_EQUAL, yyvsp[-2].conditional_request_value ); ; break;} case 31: #line 349 "request.y" { DEBUG_MSG("conditional_request : COMPLEMENT conditional_request"); Malloc( Conditional_Request, yyval.conditional_request_value); yyval.conditional_request_value->tag = UNARY_FN; yyval.conditional_request_value->cond.unary_fn.function = COMPLEMENT; yyval.conditional_request_value->cond.unary_fn.right = yyvsp[0].conditional_request_value; ; break;} case 32: #line 358 "request.y" { DEBUG_MSG("conditional_request : ASSUME_TRUE_ conditional_request"); Malloc( Conditional_Request, yyval.conditional_request_value); yyval.conditional_request_value->tag = UNARY_FN; yyval.conditional_request_value->cond.unary_fn.function = ASSUME_TRUE; yyval.conditional_request_value->cond.unary_fn.right = yyvsp[0].conditional_request_value; ; break;} case 33: #line 367 "request.y" { DEBUG_MSG("conditional_request : REQUEST_STRING"); Malloc( Conditional_Request, yyval.conditional_request_value); yyval.conditional_request_value->tag = RE_STRING; yyval.conditional_request_value->cond.re_string = wildcard_to_re( request_string ); ; break;} case 34: #line 375 "request.y" { DEBUG_MSG("conditional_request : reg_exp_"); Malloc( Conditional_Request, yyval.conditional_request_value); yyval.conditional_request_value->tag = RE_STRING; yyval.conditional_request_value->cond.re_string = request_string; ; break;} case 35: #line 385 "request.y" { DEBUG_MSG("data_item : NON_QUOTED_TEXT_STRING "); yyval.data_item_val = current_di; ; break;} case 36: #line 390 "request.y" { DEBUG_MSG("data_item : DOUBLE_QUOTED_TEXT_STRING "); yyval.data_item_val = current_di; ; break;} case 37: #line 395 "request.y" { DEBUG_MSG("data_item : SINGLE_QUOTED_TEXT_STRING "); yyval.data_item_val = current_di; ; break;} case 38: #line 403 "request.y" { DEBUG_MSG("sequence_of_requests : empty"); yyval.star_request_value = NULL; ; break;} case 39: #line 409 "request.y" { register Request_Seq *tmp; DEBUG_MSG("sequence_of_requests : sequence_of_requests a_request"); Malloc( Request_Seq, tmp); tmp->req = yyvsp[0].request_value; tmp->next = NULL; if( yyvsp[-1].star_request_value ) { register Request_Seq *t = yyvsp[-1].star_request_value; while( t->next ) t = t->next; yyval.star_request_value = yyvsp[-1].star_request_value; t->next = tmp; } else yyval.star_request_value = tmp; ; break;} } /* the action file gets copied in in place of this dollarsign */ #line 423 "/usr/gnu/lib/bison.simple" yyvsp -= yylen; yyssp -= yylen; #ifdef YYLSP_NEEDED yylsp -= yylen; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif *++yyvsp = yyval; #ifdef YYLSP_NEEDED yylsp++; if (yylen == 0) { yylsp->first_line = yylloc.first_line; yylsp->first_column = yylloc.first_column; yylsp->last_line = (yylsp-1)->last_line; yylsp->last_column = (yylsp-1)->last_column; yylsp->text = 0; } else { yylsp->last_line = (yylsp+yylen-1)->last_line; yylsp->last_column = (yylsp+yylen-1)->last_column; } #endif /* 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 - YYNTBASE] + *yyssp; if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; yyerrlab: /* here on detecting error */ if (! yyerrstatus) /* If not already recovering from an error, report this error. */ { ++yynerrs; #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; if (yyn > YYFLAG && yyn < YYLAST) { int size = 0; char *msg; int x, count; count = 0; for (x = 0; x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) size += strlen(yytname[x]) + 15, count++; msg = (char *) xmalloc(size + 15); strcpy(msg, "parse error"); if (count < 5) { count = 0; for (x = 0; x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) { strcat(msg, count == 0 ? ", expecting `" : " or `"); strcat(msg, yytname[x]); strcat(msg, "'"); count++; } } yyerror(msg); free(msg); } else #endif /* YYERROR_VERBOSE */ yyerror("parse error"); } yyerrlab1: /* here on error raised explicitly by an action */ if (yyerrstatus == 3) { /* if just tried and failed to reuse lookahead token after an error, discard it. */ /* return failure if at end of input */ if (yychar == YYEOF) YYABORT; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); #endif yychar = YYEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ yyerrstatus = 3; /* Each real token shifted decrements this */ goto yyerrhandle; yyerrdefault: /* current state does not do anything special for the error token. */ #if 0 /* This is wrong; only states that explicitly want error tokens should shift them. */ yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ if (yyn) goto yydefault; #endif yyerrpop: /* pop the current state because it cannot handle the error token */ if (yyssp == yyss) YYABORT; yyvsp--; yystate = *--yyssp; #ifdef YYLSP_NEEDED yylsp--; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "Error: state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif yyerrhandle: yyn = yypact[yystate]; if (yyn == YYFLAG) goto yyerrdefault; yyn += YYTERROR; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) goto yyerrdefault; yyn = yytable[yyn]; if (yyn < 0) { if (yyn == YYFLAG) goto yyerrpop; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting error token, "); #endif *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif yystate = yyn; goto yynewstate; } #line 426 "request.y" yyerror(char *s) { char *t; int i = YYTRANSLATE(yychar); /* assume 12 chars will be enough to print an int */ t = (char *)malloc( (22 + 12 + 1) * sizeof(char)); ERROR_MSG(sprintf( t, "Syntax Error in line: %-12d", request_line_count)); free( t ); t = (char *)malloc( (12 + strlen(yytname[i]) + 1) * sizeof(char)); ERROR_MSG(sprintf( t, "Unexpected %s,", yytname[i])); ERROR_MSG(last_request_token); free( t ); }