📄 adsedgelabelevaluation.tab.c
字号:
/* A Bison parser, made from adsedgelabelevaluation.y by GNU Bison version 1.28 */#define YYBISON 1 /* Identify Bison output. */#define yyparse adsedgelabelevaluationparse#define yylex adsedgelabelevaluationlex#define yyerror adsedgelabelevaluationerror#define yylval adsedgelabelevaluationlval#define yychar adsedgelabelevaluationchar#define yydebug adsedgelabelevaluationdebug#define yynerrs adsedgelabelevaluationnerrs#define QUOTE 257#define OPEN 258#define CLOSE 259#define OPENB 260#define CLOSEB 261#define NL 262#define INTEGER 263#define IDENTIFIER 264#define TRUE 265#define LEQ 266#define GEQ 267#define EQ 268#define NEQ 269#define GT 270#define LT 271#define MINUS 272#define PLUS 273#define OR 274#define TIMES 275#define DIV 276#define AND 277#define NEG 278#define NOT 279#define IN 280#line 1 "adsedgelabelevaluation.y"#include "adsedgelabelevaluationparse.h"#include <math.h>#include <string.h>#include <stdio.h>#include <stdlib.h>#define YYERROR_VERBOSE int proptype[200]; /* should be initialised by caller */ char *propname[200];/* should be initialised by caller */ int boollist[200];/* should be initialised by caller */ int count;/* should be initialised by caller */ int isin; /* true if IN predicate is part of label */ int outcome; /* result */int isintexp,isstrexp;char temp[100];int GetBool(char *s, int t){ int i=0; while (i<count){ if ((!strcmp(propname[i],s))&& (proptype[i]==t)) return boollist[i]; i++; } return -1;}#line 34 "adsedgelabelevaluation.y"typedef union{ int i; char *str;} YYSTYPE;#ifndef YYDEBUG#define YYDEBUG 1#endif#include <stdio.h>#ifndef __cplusplus#ifndef __STDC__#define const#endif#endif#define YYFINAL 44#define YYFLAG -32768#define YYNTBASE 28#define YYTRANSLATE(x) ((unsigned)(x) <= 280 ? yytranslate[x] : 42)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, 27, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26};#if YYDEBUG != 0static const short yyprhs[] = { 0, 0, 2, 6, 7, 9, 10, 14, 16, 18, 22, 24, 28, 30, 33, 37, 42, 44, 45, 49, 50, 53, 56, 58, 60, 62, 64, 66, 68, 70, 72, 73};static const short yyrhs[] = { 29, 0, 30, 31, 41, 0, 0, 10, 0, 0, 6, 32, 7, 0, 33, 0, 34, 0, 33, 20, 34, 0, 35, 0, 34, 23, 35, 0, 36, 0, 25, 35, 0, 4, 32, 5, 0, 26, 4, 10, 5, 0, 11, 0, 0, 10, 37, 38, 0, 0, 39, 9, 0, 40, 3, 0, 14, 0, 15, 0, 16, 0, 17, 0, 13, 0, 12, 0, 14, 0, 15, 0, 0, 22, 10, 0};#endif#if YYDEBUG != 0static const short yyrline[] = { 0, 49, 52, 58, 59, 71, 72, 76, 87, 88, 96, 97, 105, 106, 107, 108, 111, 112, 116, 142, 143, 145, 149, 150, 151, 152, 153, 154, 159, 160, 166, 167};#endif#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)static const char * const yytname[] = { "$","error","$undefined.","QUOTE","OPEN","CLOSE","OPENB","CLOSEB","NL","INTEGER","IDENTIFIER","TRUE","LEQ","GEQ","EQ","NEQ","GT","LT","MINUS","PLUS","OR","TIMES","DIV","AND","NEG","NOT","IN","'^'","input","line","event","guard","pexp","orexp","andexp","literal","atomic","@1","isexp","irel","srel","action", NULL};#endifstatic const short yyr1[] = { 0, 28, 29, 30, 30, 31, 31, 32, 33, 33, 34, 34, 35, 35, 35, 35, 36, 37, 36, 38, 38, 38, 39, 39, 39, 39, 39, 39, 40, 40, 41, 41};static const short yyr2[] = { 0, 1, 3, 0, 1, 0, 3, 1, 1, 3, 1, 3, 1, 2, 3, 4, 1, 0, 3, 0, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2};static const short yydefact[] = { 3, 4, 1, 5, 0, 30, 0, 17, 16, 0, 0, 0, 7, 8, 10, 12, 0, 2, 0, 19, 13, 0, 6, 0, 0, 31, 14, 27, 26, 22, 23, 24, 25, 18, 0, 0, 0, 9, 11, 20, 21, 15, 0, 0, 0};static const short yydefgoto[] = { 42, 2, 3, 5, 11, 12, 13, 14, 15, 19, 33, 34, 35, 17};static const short yypact[] = { -7,-32768,-32768, -2, -4, -20, -4,-32768,-32768, -4, 1, 8, -12, -6,-32768,-32768, 9,-32768, 13, -3,-32768, 10,-32768, -4, -4,-32768,-32768,-32768,-32768, 20, 21,-32768,-32768,-32768, 16, 23, 22, -6,-32768,-32768,-32768,-32768, 28, 29,-32768};static const short yypgoto[] = {-32768,-32768,-32768,-32768, 24,-32768, 11, -8,-32768,-32768,-32768,-32768,-32768,-32768};#define YYLAST 34static const short yytable[] = { 6, 20, 16, 1, 4, 21, 7, 8, 23, 27, 28, 29, 30, 31, 32, 22, 38, 24, 26, 25, 36, 9, 10, -28, -29, 39, 40, 41, 43, 44, 18, 0, 0, 0, 37};static const short yycheck[] = { 4, 9, 22, 10, 6, 4, 10, 11, 20, 12, 13, 14, 15, 16, 17, 7, 24, 23, 5, 10, 10, 25, 26, 3, 3, 9, 3, 5, 0, 0, 6, -1, -1, -1, 23};/* -*-C-*- Note some compilers choke on comments on `#line' lines. */#line 3 "/usr/lib/bison.simple"/* This file comes from bison-1.28. *//* Skeleton output parser for bison, Copyright (C) 1984, 1989, 1990 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 2, 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *//* As a special exception, when this file is copied by Bison into a Bison output file, you may use that output file without restriction. This special exception was added by the Free Software Foundation in version 1.24 of Bison. *//* 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. */#ifndef YYSTACK_USE_ALLOCA#ifdef alloca#define YYSTACK_USE_ALLOCA#else /* alloca not defined */#ifdef __GNUC__#define YYSTACK_USE_ALLOCA#define alloca __builtin_alloca#else /* not GNU C. */#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))#define YYSTACK_USE_ALLOCA#include <alloca.h>#else /* not sparc *//* We think this test detects Watcom and Microsoft C. *//* This used to test MSDOS, but that is a bad idea since that symbol is in the user namespace. */#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)#if 0 /* No need for malloc.h, which pollutes the namespace; instead, just don't use alloca. */#include <malloc.h>#endif#else /* not MSDOS, or __TURBOC__ */#if defined(_AIX)/* I don't know what this was needed for, but it pollutes the namespace. So I turned it off. rms, 2 May 1997. *//* #include <malloc.h> */ #pragma alloca#define YYSTACK_USE_ALLOCA#else /* not MSDOS, or __TURBOC__, or _AIX */#if 0#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up, and on HPUX 10. Eventually we can turn this on. */#define YYSTACK_USE_ALLOCA#define alloca __builtin_alloca#endif /* __hpux */#endif#endif /* not _AIX */#endif /* not MSDOS, or __TURBOC__ */#endif /* not sparc */#endif /* not GNU C */#endif /* alloca not defined */#endif /* YYSTACK_USE_ALLOCA not defined */#ifdef YYSTACK_USE_ALLOCA#define YYSTACK_ALLOC alloca#else#define YYSTACK_ALLOC malloc#endif/* 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 goto yyacceptlab#define YYABORT goto yyabortlab#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#ifdef YYLEX_PARAM#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM)#else#define YYLEX yylex(&yylval, &yylloc)#endif#else /* not YYLSP_NEEDED */#ifdef YYLEX_PARAM#define YYLEX yylex(&yylval, YYLEX_PARAM)#else#define YYLEX yylex(&yylval)#endif#endif /* not YYLSP_NEEDED */#endif/* If nonreentrant, generate the variables here */#ifndef YYPUREint yychar; /* the lookahead symbol */YYSTYPE yylval; /* the semantic value of the */ /* lookahead symbol */#ifdef YYLSP_NEEDEDYYLTYPE yylloc; /* location data for the lookahead */ /* symbol */#endifint yynerrs; /* number of parse errors so far */#endif /* not YYPURE */#if YYDEBUG != 0int 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
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -