Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
48 kB · 1495 lines
C++
at develop
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496/* A Bison parser, made by GNU Bison 3.7.6. */
/* Bison implementation for Yacc-like parsers in C
Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2021 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 <https://www.gnu.org/licenses/>. */
/* As a special exception, you may create a larger work that contains part or all of the Bison parser skeleton and distribute that work under terms of your choice, so long as that work isn't itself a parser generator using the skeleton or a modified version thereof as a parser skeleton. Alternatively, if you modify or redistribute the parser skeleton itself, you may (at your option) remove this special exception, which will cause the skeleton and the resulting Bison output files to be licensed under the GNU General Public License without this special exception.
This special exception was added by the Free Software Foundation in version 2.2 of Bison. */
/* C LALR(1) parser skeleton written by Richard Stallman, by simplifying the original so-called "semantic" parser. */
/* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual, especially those whose name start with YY_ or yy_. They are private implementation details that can be changed or removed. */
/* 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, and Bison version. */#define YYBISON 30706
/* Bison version string. */#define YYBISON_VERSION "3.7.6"
/* Skeleton name. */#define YYSKELETON_NAME "yacc.c"
/* Pure parsers. */#define YYPURE 0
/* Push parsers. */#define YYPUSH 0
/* Pull parsers. */#define YYPULL 1
/* Substitute the variable and function names. */#define yyparse regex_yyparse#define yylex regex_yylex#define yyerror regex_yyerror#define yydebug regex_yydebug#define yynerrs regex_yynerrs#define yylval regex_yylval#define yychar regex_yychar
/* First part of user prologue. */
#include <cstdlib>#include <cstdio>#include <memory>#include <unordered_set>#include <unordered_map>
#include <gecode/minimodel.hh>#include <minizinc/values.hh>using namespace Gecode;using namespace MiniZinc;
typedef struct yy_buffer_state *YY_BUFFER_STATE;YY_BUFFER_STATE regex_yy_scan_string ( const char* yy_str );
extern int yylex();extern FILE* yyin;
typedef struct REContext{ REG* expr; const IntSetVal& dom; const std::unordered_map<std::string, int>& idMap;} REContext;
void yyerror(REContext& ctx, const char* s);
# ifndef YY_CAST# ifdef __cplusplus# define YY_CAST(Type, Val) static_cast<Type> (Val)# define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)# else# define YY_CAST(Type, Val) ((Type) (Val))# define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))# endif# endif# ifndef YY_NULLPTR# if defined __cplusplus# if 201103L <= __cplusplus# define YY_NULLPTR nullptr# else# define YY_NULLPTR 0# endif# else# define YY_NULLPTR ((void*)0)# endif# endif
#include <minizinc/support/regex_parser.tab.hh>/* Symbol kind. */enum yysymbol_kind_t{ YYSYMBOL_YYEMPTY = -2, YYSYMBOL_YYEOF = 0, /* "end of file" */ YYSYMBOL_YYerror = 1, /* error */ YYSYMBOL_YYUNDEF = 2, /* "invalid token" */ YYSYMBOL_R_INTEGER = 3, /* R_INTEGER */ YYSYMBOL_R_GROUP_OPEN = 4, /* "(" */ YYSYMBOL_R_GROUP_CLOSE = 5, /* ")" */ YYSYMBOL_R_STAR = 6, /* "*" */ YYSYMBOL_R_PLUS = 7, /* "+" */ YYSYMBOL_R_ANY = 8, /* "." */ YYSYMBOL_R_UNION = 9, /* "|" */ YYSYMBOL_R_OPTIONAL = 10, /* "?" */ YYSYMBOL_R_QUANT_OPEN = 11, /* "{" */ YYSYMBOL_R_QUANT_CLOSE = 12, /* "}" */ YYSYMBOL_R_COMMA = 13, /* "," */ YYSYMBOL_R_CLASS_OPEN = 14, /* "[" */ YYSYMBOL_R_CLASS_CLOSE = 15, /* "]" */ YYSYMBOL_R_CLASS_RANGE = 16, /* "-" */ YYSYMBOL_R_CLASS_NEG = 17, /* "^" */ YYSYMBOL_R_IDENTIFIER = 18, /* R_IDENTIFIER */ YYSYMBOL_YYACCEPT = 19, /* $accept */ YYSYMBOL_regex = 20, /* regex */ YYSYMBOL_expression = 21, /* expression */ YYSYMBOL_term = 22, /* term */ YYSYMBOL_factor = 23, /* factor */ YYSYMBOL_atom = 24, /* atom */ YYSYMBOL_set_items = 25, /* set_items */ YYSYMBOL_set_item = 26, /* set_item */ YYSYMBOL_literal = 27 /* literal */};typedef enum yysymbol_kind_t yysymbol_kind_t;
#ifdef short# undef short#endif
/* On compilers that do not define __PTRDIFF_MAX__ etc., make sure <limits.h> and (if available) <stdint.h> are included so that the code can choose integer types of a good width. */
#ifndef __PTRDIFF_MAX__# include <limits.h> /* INFRINGES ON USER NAME SPACE */# if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__# include <stdint.h> /* INFRINGES ON USER NAME SPACE */# define YY_STDINT_H# endif#endif
/* Narrow types that promote to a signed type and that can represent a signed or unsigned integer of at least N bits. In tables they can save space and decrease cache pressure. Promoting to a signed type helps avoid bugs in integer arithmetic. */
#ifdef __INT_LEAST8_MAX__typedef __INT_LEAST8_TYPE__ yytype_int8;#elif defined YY_STDINT_Htypedef int_least8_t yytype_int8;#elsetypedef signed char yytype_int8;#endif
#ifdef __INT_LEAST16_MAX__typedef __INT_LEAST16_TYPE__ yytype_int16;#elif defined YY_STDINT_Htypedef int_least16_t yytype_int16;#elsetypedef short yytype_int16;#endif
/* Work around bug in HP-UX 11.23, which defines these macros incorrectly for preprocessor constants. This workaround can likely be removed in 2023, as HPE has promised support for HP-UX 11.23 (aka HP-UX 11i v2) only through the end of 2022; see Table 2 of <https://h20195.www2.hpe.com/V2/getpdf.aspx/4AA4-7673ENW.pdf>. */#ifdef __hpux# undef UINT_LEAST8_MAX# undef UINT_LEAST16_MAX# define UINT_LEAST8_MAX 255# define UINT_LEAST16_MAX 65535#endif
#if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__typedef __UINT_LEAST8_TYPE__ yytype_uint8;#elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \ && UINT_LEAST8_MAX <= INT_MAX)typedef uint_least8_t yytype_uint8;#elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAXtypedef unsigned char yytype_uint8;#elsetypedef short yytype_uint8;#endif
#if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__typedef __UINT_LEAST16_TYPE__ yytype_uint16;#elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \ && UINT_LEAST16_MAX <= INT_MAX)typedef uint_least16_t yytype_uint16;#elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAXtypedef unsigned short yytype_uint16;#elsetypedef int yytype_uint16;#endif
#ifndef YYPTRDIFF_T# if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__# define YYPTRDIFF_T __PTRDIFF_TYPE__# define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__# elif defined PTRDIFF_MAX# ifndef ptrdiff_t# include <stddef.h> /* INFRINGES ON USER NAME SPACE */# endif# define YYPTRDIFF_T ptrdiff_t# define YYPTRDIFF_MAXIMUM PTRDIFF_MAX# else# define YYPTRDIFF_T long# define YYPTRDIFF_MAXIMUM LONG_MAX# endif#endif
#ifndef YYSIZE_T# ifdef __SIZE_TYPE__# define YYSIZE_T __SIZE_TYPE__# elif defined size_t# define YYSIZE_T size_t# elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__# include <stddef.h> /* INFRINGES ON USER NAME SPACE */# define YYSIZE_T size_t# else# define YYSIZE_T unsigned# endif#endif
#define YYSIZE_MAXIMUM \ YY_CAST (YYPTRDIFF_T, \ (YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1) \ ? YYPTRDIFF_MAXIMUM \ : YY_CAST (YYSIZE_T, -1)))
#define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X))
/* Stored state numbers (used for stacks). */typedef yytype_int8 yy_state_t;
/* State numbers in computations. */typedef int yy_state_fast_t;
#ifndef YY_# if defined YYENABLE_NLS && YYENABLE_NLS# if ENABLE_NLS# include <libintl.h> /* INFRINGES ON USER NAME SPACE */# define YY_(Msgid) dgettext ("bison-runtime", Msgid)# endif# endif# ifndef YY_# define YY_(Msgid) Msgid# endif#endif
#ifndef YY_ATTRIBUTE_PURE# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)# define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))# else# define YY_ATTRIBUTE_PURE# endif#endif
#ifndef YY_ATTRIBUTE_UNUSED# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)# define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))# else# define YY_ATTRIBUTE_UNUSED# endif#endif
/* Suppress unused-variable warnings by "using" E. */#if ! defined lint || defined __GNUC__# define YY_USE(E) ((void) (E))#else# define YY_USE(E) /* empty */#endif
#if defined __GNUC__ && ! defined __ICC && 407 <= __GNUC__ * 100 + __GNUC_MINOR__/* Suppress an incorrect diagnostic about yylval being uninitialized. */# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \ _Pragma ("GCC diagnostic push") \ _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"") \ _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")# define YY_IGNORE_MAYBE_UNINITIALIZED_END \ _Pragma ("GCC diagnostic pop")#else# define YY_INITIAL_VALUE(Value) Value#endif#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN# define YY_IGNORE_MAYBE_UNINITIALIZED_END#endif#ifndef YY_INITIAL_VALUE# define YY_INITIAL_VALUE(Value) /* Nothing. */#endif
#if defined __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__# define YY_IGNORE_USELESS_CAST_BEGIN \ _Pragma ("GCC diagnostic push") \ _Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")# define YY_IGNORE_USELESS_CAST_END \ _Pragma ("GCC diagnostic pop")#endif#ifndef YY_IGNORE_USELESS_CAST_BEGIN# define YY_IGNORE_USELESS_CAST_BEGIN# define YY_IGNORE_USELESS_CAST_END#endif
#define YY_ASSERT(E) ((void) (0 && (E)))
#if !defined yyoverflow
/* 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 <alloca.h> /* INFRINGES ON USER NAME SPACE */# elif defined _AIX# define YYSTACK_ALLOC __alloca# elif defined _MSC_VER# include <malloc.h> /* INFRINGES ON USER NAME SPACE */# define alloca _alloca# else# define YYSTACK_ALLOC alloca# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ /* Use EXIT_SUCCESS as a witness for stdlib.h. */# 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 (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 <stdlib.h> /* INFRINGES ON USER NAME SPACE */# ifndef EXIT_SUCCESS# define EXIT_SUCCESS 0# endif# endif# ifndef YYMALLOC# define YYMALLOC malloc# if ! defined malloc && ! defined EXIT_SUCCESSvoid *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */# endif# endif# ifndef YYFREE# define YYFREE free# if ! defined free && ! defined EXIT_SUCCESSvoid free (void *); /* INFRINGES ON USER NAME SPACE */# endif# endif# endif#endif /* !defined yyoverflow */
#if (! defined yyoverflow \ && (! defined __cplusplus \ || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */union yyalloc{ yy_state_t yyss_alloc; YYSTYPE yyvs_alloc;};
/* The size of the maximum gap between one aligned stack and the next. */# define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with N elements. */# define YYSTACK_BYTES(N) \ ((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (YYSTYPE)) \ + 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 \ { \ YYPTRDIFF_T yynewbytes; \ YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \ Stack = &yyptr->Stack_alloc; \ yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \ yyptr += yynewbytes / YYSIZEOF (*yyptr); \ } \ while (0)
#endif
#if defined YYCOPY_NEEDED && YYCOPY_NEEDED/* Copy COUNT objects from SRC to DST. The source and destination do not overlap. */# ifndef YYCOPY# if defined __GNUC__ && 1 < __GNUC__# define YYCOPY(Dst, Src, Count) \ __builtin_memcpy (Dst, Src, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src)))# else# define YYCOPY(Dst, Src, Count) \ do \ { \ YYPTRDIFF_T yyi; \ for (yyi = 0; yyi < (Count); yyi++) \ (Dst)[yyi] = (Src)[yyi]; \ } \ while (0)# endif# endif#endif /* !YYCOPY_NEEDED */
/* YYFINAL -- State number of the termination state. */#define YYFINAL 17/* YYLAST -- Last index in YYTABLE. */#define YYLAST 34
/* YYNTOKENS -- Number of terminals. */#define YYNTOKENS 19/* YYNNTS -- Number of nonterminals. */#define YYNNTS 9/* YYNRULES -- Number of rules. */#define YYNRULES 24/* YYNSTATES -- Number of states. */#define YYNSTATES 38
/* YYMAXUTOK -- Last valid token kind. */#define YYMAXUTOK 273
/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM as returned by yylex, with out-of-bounds checking. */#define YYTRANSLATE(YYX) \ (0 <= (YYX) && (YYX) <= YYMAXUTOK \ ? YY_CAST (yysymbol_kind_t, yytranslate[YYX]) \ : YYSYMBOL_YYUNDEF)
/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM as returned by yylex. */static const yytype_int8 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};
#if YYDEBUG /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */static const yytype_uint8 yyrline[] ={ 0, 75, 75, 82, 83, 91, 92, 100, 101, 106, 111, 116, 121, 126, 133, 135, 140, 150, 165, 169, 170, 180, 184, 198, 199};#endif
/** Accessing symbol of state STATE. */#define YY_ACCESSING_SYMBOL(State) YY_CAST (yysymbol_kind_t, yystos[State])
#if YYDEBUG || 0/* The user-facing name of the symbol whose (internal) number is YYSYMBOL. No bounds checking. */static const char *yysymbol_name (yysymbol_kind_t yysymbol) YY_ATTRIBUTE_UNUSED;
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. First, the terminals, then, starting at YYNTOKENS, nonterminals. */static const char *const yytname[] ={ "\"end of file\"", "error", "\"invalid token\"", "R_INTEGER", "\"(\"", "\")\"", "\"*\"", "\"+\"", "\".\"", "\"|\"", "\"?\"", "\"{\"", "\"}\"", "\",\"", "\"[\"", "\"]\"", "\"-\"", "\"^\"", "R_IDENTIFIER", "$accept", "regex", "expression", "term", "factor", "atom", "set_items", "set_item", "literal", YY_NULLPTR};
static const char *yysymbol_name (yysymbol_kind_t yysymbol){ return yytname[yysymbol];}#endif
#ifdef YYPRINT/* YYTOKNUM[NUM] -- (External) token number corresponding to the (internal) symbol number NUM (which must be that of a token). */static const yytype_int16 yytoknum[] ={ 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273};#endif
#define YYPACT_NINF (-8)
#define yypact_value_is_default(Yyn) \ ((Yyn) == YYPACT_NINF)
#define YYTABLE_NINF (-1)
#define yytable_value_is_error(Yyn) \ 0
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing STATE-NUM. */static const yytype_int8 yypact[] ={ 0, -8, 0, -8, 2, -8, 13, -8, -7, 0, 16, -8, 10, 3, 18, 3, 9, -8, 0, -8, -8, -8, -8, 25, -8, 19, -8, -8, 3, -8, 17, -8, -8, -8, 4, 20, -8, -8};
/* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM. Performed when YYTABLE does not specify something else to do. Zero means the default is an error. */static const yytype_int8 yydefact[] ={ 0, 23, 0, 15, 0, 24, 0, 2, 3, 5, 7, 14, 0, 0, 0, 19, 21, 1, 0, 6, 8, 9, 10, 0, 18, 0, 16, 20, 0, 4, 0, 17, 22, 11, 0, 0, 12, 13};
/* YYPGOTO[NTERM-NUM]. */static const yytype_int8 yypgoto[] ={ -8, -8, -1, 22, -8, -8, -3, -8, -4};
/* YYDEFGOTO[NTERM-NUM]. */static const yytype_int8 yydefgoto[] ={ 0, 6, 7, 8, 9, 10, 14, 15, 11};
/* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If positive, shift that token. If negative, reduce the rule whose number is the opposite. If YYTABLE_NINF, syntax error. */static const yytype_int8 yytable[] ={ 16, 12, 18, 1, 2, 1, 1, 35, 3, 16, 25, 16, 27, 17, 4, 24, 36, 29, 5, 13, 5, 5, 20, 21, 32, 28, 22, 23, 30, 33, 34, 19, 37, 26, 31};
static const yytype_int8 yycheck[] ={ 4, 2, 9, 3, 4, 3, 3, 3, 8, 13, 13, 15, 15, 0, 14, 5, 12, 18, 18, 17, 18, 18, 6, 7, 28, 16, 10, 11, 3, 12, 13, 9, 12, 15, 15};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing symbol of state STATE-NUM. */static const yytype_int8 yystos[] ={ 0, 3, 4, 8, 14, 18, 20, 21, 22, 23, 24, 27, 21, 17, 25, 26, 27, 0, 9, 22, 6, 7, 10, 11, 5, 25, 15, 25, 16, 21, 3, 15, 27, 12, 13, 3, 12, 12};
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */static const yytype_int8 yyr1[] ={ 0, 19, 20, 21, 21, 22, 22, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 25, 25, 26, 26, 27, 27};
/* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */static const yytype_int8 yyr2[] ={ 0, 2, 1, 1, 3, 1, 2, 1, 2, 2, 2, 4, 5, 6, 1, 1, 3, 4, 3, 1, 2, 1, 3, 1, 1};
enum { YYENOMEM = -2 };
#define yyerrok (yyerrstatus = 0)#define yyclearin (yychar = YYEMPTY)
#define YYACCEPT goto yyacceptlab#define YYABORT goto yyabortlab#define YYERROR goto yyerrorlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY) \ { \ yychar = (Token); \ yylval = (Value); \ YYPOPSTACK (yylen); \ yystate = *yyssp; \ goto yybackup; \ } \ else \ { \ yyerror (ctx, YY_("syntax error: cannot back up")); \ YYERROR; \ } \ while (0)
/* Backward compatibility with an undocumented macro. Use YYerror or YYUNDEF. */#define YYERRCODE YYUNDEF
/* Enable debugging if requested. */#if YYDEBUG
# ifndef YYFPRINTF# include <stdio.h> /* INFRINGES ON USER NAME SPACE */# define YYFPRINTF fprintf# endif
# define YYDPRINTF(Args) \do { \ if (yydebug) \ YYFPRINTF Args; \} while (0)
/* This macro is provided for backward compatibility. */# ifndef YY_LOCATION_PRINT# define YY_LOCATION_PRINT(File, Loc) ((void) 0)# endif
# define YY_SYMBOL_PRINT(Title, Kind, Value, Location) \do { \ if (yydebug) \ { \ YYFPRINTF (stderr, "%s ", Title); \ yy_symbol_print (stderr, \ Kind, Value, ctx); \ YYFPRINTF (stderr, "\n"); \ } \} while (0)
/*-----------------------------------.| Print this symbol's value on YYO. |`-----------------------------------*/
static voidyy_symbol_value_print (FILE *yyo, yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep, REContext& ctx){ FILE *yyoutput = yyo; YY_USE (yyoutput); YY_USE (ctx); if (!yyvaluep) return;# ifdef YYPRINT if (yykind < YYNTOKENS) YYPRINT (yyo, yytoknum[yykind], *yyvaluep);# endif YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN YY_USE (yykind); YY_IGNORE_MAYBE_UNINITIALIZED_END}
/*---------------------------.| Print this symbol on YYO. |`---------------------------*/
static voidyy_symbol_print (FILE *yyo, yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep, REContext& ctx){ YYFPRINTF (yyo, "%s %s (", yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name (yykind));
yy_symbol_value_print (yyo, yykind, yyvaluep, ctx); YYFPRINTF (yyo, ")");}
/*------------------------------------------------------------------.| yy_stack_print -- Print the state stack from its BOTTOM up to its || TOP (included). |`------------------------------------------------------------------*/
static voidyy_stack_print (yy_state_t *yybottom, yy_state_t *yytop){ 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 (0)
/*------------------------------------------------.| Report that the YYRULE is going to be reduced. |`------------------------------------------------*/
static voidyy_reduce_print (yy_state_t *yyssp, YYSTYPE *yyvsp, int yyrule, REContext& ctx){ int yylno = yyrline[yyrule]; int yynrhs = yyr2[yyrule]; int yyi; YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n", yyrule - 1, yylno); /* The symbols being reduced. */ for (yyi = 0; yyi < yynrhs; yyi++) { YYFPRINTF (stderr, " $%d = ", yyi + 1); yy_symbol_print (stderr, YY_ACCESSING_SYMBOL (+yyssp[yyi + 1 - yynrhs]), &yyvsp[(yyi + 1) - (yynrhs)], ctx); YYFPRINTF (stderr, "\n"); }}
# define YY_REDUCE_PRINT(Rule) \do { \ if (yydebug) \ yy_reduce_print (yyssp, yyvsp, Rule, ctx); \} while (0)
/* Nonzero means print parse trace. It is left uninitialized so that multiple parsers can coexist. */int yydebug;#else /* !YYDEBUG */# define YYDPRINTF(Args) ((void) 0)# define YY_SYMBOL_PRINT(Title, Kind, 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
/*-----------------------------------------------.| Release the memory associated to this symbol. |`-----------------------------------------------*/
static voidyydestruct (const char *yymsg, yysymbol_kind_t yykind, YYSTYPE *yyvaluep, REContext& ctx){ YY_USE (yyvaluep); YY_USE (ctx); if (!yymsg) yymsg = "Deleting"; YY_SYMBOL_PRINT (yymsg, yykind, yyvaluep, yylocationp);
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN YY_USE (yykind); YY_IGNORE_MAYBE_UNINITIALIZED_END}
/* Lookahead token kind. */int yychar;
/* The semantic value of the lookahead symbol. */YYSTYPE yylval;/* Number of syntax errors so far. */int yynerrs;
/*----------.| yyparse. |`----------*/
intyyparse (REContext& ctx){ yy_state_fast_t yystate = 0; /* Number of tokens to shift before error messages enabled. */ int yyerrstatus = 0;
/* Refer to the stacks through separate pointers, to allow yyoverflow to reallocate them elsewhere. */
/* Their size. */ YYPTRDIFF_T yystacksize = YYINITDEPTH;
/* The state stack: array, bottom, top. */ yy_state_t yyssa[YYINITDEPTH]; yy_state_t *yyss = yyssa; yy_state_t *yyssp = yyss;
/* The semantic value stack: array, bottom, top. */ YYSTYPE yyvsa[YYINITDEPTH]; YYSTYPE *yyvs = yyvsa; YYSTYPE *yyvsp = yyvs;
int yyn; /* The return value of yyparse. */ int yyresult; /* Lookahead symbol kind. */ yysymbol_kind_t yytoken = YYSYMBOL_YYEMPTY; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval;
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
/* The number of symbols on the RHS of the reduced rule. Keep to zero when no symbol should be popped. */ int yylen = 0;
YYDPRINTF ((stderr, "Starting parse\n"));
yychar = YYEMPTY; /* Cause a token to be read. */ goto yysetstate;
/*------------------------------------------------------------.| yynewstate -- push a new state, which is found in yystate. |`------------------------------------------------------------*/yynewstate: /* In all cases, when you get here, the value and location stacks have just been pushed. So pushing a state here evens the stacks. */ yyssp++;
/*--------------------------------------------------------------------.| yysetstate -- set current state (the top of the stack) to yystate. |`--------------------------------------------------------------------*/yysetstate: YYDPRINTF ((stderr, "Entering state %d\n", yystate)); YY_ASSERT (0 <= yystate && yystate < YYNSTATES); YY_IGNORE_USELESS_CAST_BEGIN *yyssp = YY_CAST (yy_state_t, yystate); YY_IGNORE_USELESS_CAST_END YY_STACK_PRINT (yyss, yyssp);
if (yyss + yystacksize - 1 <= yyssp)#if !defined yyoverflow && !defined YYSTACK_RELOCATE goto yyexhaustedlab;#else { /* Get the current used size of the three stacks, in elements. */ YYPTRDIFF_T yysize = yyssp - yyss + 1;
# if defined 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. */ yy_state_t *yyss1 = yyss; YYSTYPE *yyvs1 = yyvs;
/* 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 * YYSIZEOF (*yyssp), &yyvs1, yysize * YYSIZEOF (*yyvsp), &yystacksize); yyss = yyss1; yyvs = yyvs1; }# else /* defined YYSTACK_RELOCATE */ /* Extend the stack our own way. */ if (YYMAXDEPTH <= yystacksize) goto yyexhaustedlab; yystacksize *= 2; if (YYMAXDEPTH < yystacksize) yystacksize = YYMAXDEPTH;
{ yy_state_t *yyss1 = yyss; union yyalloc *yyptr = YY_CAST (union yyalloc *, YYSTACK_ALLOC (YY_CAST (YYSIZE_T, YYSTACK_BYTES (yystacksize)))); if (! yyptr) goto yyexhaustedlab; YYSTACK_RELOCATE (yyss_alloc, yyss); YYSTACK_RELOCATE (yyvs_alloc, yyvs);# undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); }# endif
yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1;
YY_IGNORE_USELESS_CAST_BEGIN YYDPRINTF ((stderr, "Stack size increased to %ld\n", YY_CAST (long, yystacksize))); YY_IGNORE_USELESS_CAST_END
if (yyss + yystacksize - 1 <= yyssp) YYABORT; }#endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */
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 empty, or end-of-input, or a valid lookahead. */ if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token\n")); yychar = yylex (); }
if (yychar <= YYEOF) { yychar = YYEOF; yytoken = YYSYMBOL_YYEOF; YYDPRINTF ((stderr, "Now at end of input.\n")); } else if (yychar == YYerror) { /* The scanner already issued an error message, process directly to error recovery. But do not keep the error token as lookahead, it is too special and may lead us to an endless loop in error recovery. */ yychar = YYUNDEF; yytoken = YYSYMBOL_YYerror; goto yyerrlab1; } 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); yystate = yyn; YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN *++yyvsp = yylval; YY_IGNORE_MAYBE_UNINITIALIZED_END
/* Discard the shifted token. */ yychar = YYEMPTY; goto yynewstate;
/*-----------------------------------------------------------.| yydefault -- do the default action for the current state. |`-----------------------------------------------------------*/yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; goto yyreduce;
/*-----------------------------.| yyreduce -- do a reduction. |`-----------------------------*/yyreduce: /* yyn is the number of a rule to reduce with. */ yylen = yyr2[yyn];
/* If YYLEN is nonzero, implement the default value of the action: '$$ = $1'.
Otherwise, the following line sets YYVAL to garbage. This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen];
YY_REDUCE_PRINT (yyn); switch (yyn) { case 2: /* regex: expression */ { *ctx.expr = (*(yyvsp[0].rValue)); delete (yyvsp[0].rValue); } break;
case 4: /* expression: term "|" expression */ { *(yyvsp[-2].rValue) = *(yyvsp[-2].rValue) | *(yyvsp[0].rValue); delete (yyvsp[0].rValue); (yyval.rValue) = (yyvsp[-2].rValue); } break;
case 6: /* term: factor term */ { *(yyvsp[-1].rValue) = *(yyvsp[-1].rValue) + *(yyvsp[0].rValue); delete (yyvsp[0].rValue); (yyval.rValue) = (yyvsp[-1].rValue); } break;
case 8: /* factor: atom "*" */ { *(yyvsp[-1].rValue) = *(*(yyvsp[-1].rValue)); (yyval.rValue) = (yyvsp[-1].rValue); } break;
case 9: /* factor: atom "+" */ { *(yyvsp[-1].rValue) = +(*(yyvsp[-1].rValue)); (yyval.rValue) = (yyvsp[-1].rValue); } break;
case 10: /* factor: atom "?" */ { *(yyvsp[-1].rValue) = (*(yyvsp[-1].rValue))(0, 1); (yyval.rValue) = (yyvsp[-1].rValue); } break;
case 11: /* factor: atom "{" R_INTEGER "}" */ { *(yyvsp[-3].rValue) = (*(yyvsp[-3].rValue))((yyvsp[-1].iValue), (yyvsp[-1].iValue)); (yyval.rValue) = (yyvsp[-3].rValue); } break;
case 12: /* factor: atom "{" R_INTEGER "," "}" */ { *(yyvsp[-4].rValue) = (*(yyvsp[-4].rValue))((yyvsp[-2].iValue)); (yyval.rValue) = (yyvsp[-4].rValue); } break;
case 13: /* factor: atom "{" R_INTEGER "," R_INTEGER "}" */ { *(yyvsp[-5].rValue) = (*(yyvsp[-5].rValue))((yyvsp[-3].iValue), (yyvsp[-1].iValue)); (yyval.rValue) = (yyvsp[-5].rValue); } break;
case 14: /* atom: literal */ { (yyval.rValue) = new REG((yyvsp[0].iValue)); } break;
case 15: /* atom: "." */ { IntArgs range = IntArgs::create(ctx.dom.max().toInt() - ctx.dom.min().toInt() + 1, ctx.dom.min().toInt()); (yyval.rValue) = new REG(range); } break;
case 16: /* atom: "[" set_items "]" */ { std::vector<int> v; v.reserve((yyvsp[-1].setValue)->size()); for(auto i : *(yyvsp[-1].setValue)) { v.push_back(i); } delete (yyvsp[-1].setValue); (yyval.rValue) = new REG(IntArgs(v)); } break;
case 17: /* atom: "[" "^" set_items "]" */ { std::vector<int> diff; std::unordered_set<int> domain; for(int i = ctx.dom.min().toInt(); i<=ctx.dom.max().toInt(); ++i) { domain.insert(i); } std::set_difference( domain.begin(), domain.end(), (yyvsp[-1].setValue)->begin(), (yyvsp[-1].setValue)->end(), std::inserter(diff, diff.begin()) ); delete (yyvsp[-1].setValue); (yyval.rValue) = new REG(IntArgs(diff)); } break;
case 18: /* atom: "(" expression ")" */ { (yyval.rValue) = (yyvsp[-1].rValue); } break;
case 20: /* set_items: set_item set_items */ { (yyval.setValue) = (yyvsp[-1].setValue); for (auto i : *(yyvsp[0].setValue)) { (yyvsp[-1].setValue)->insert(i); } delete (yyvsp[0].setValue); } break;
case 21: /* set_item: literal */ { (yyval.setValue) = new std::unordered_set<int>({(yyvsp[0].iValue)}); } break;
case 22: /* set_item: literal "-" literal */ { int from = (yyvsp[-2].iValue); int to = (yyvsp[0].iValue); if (to < from) { std::swap(from,to); } (yyval.setValue) = new std::unordered_set<int>; for(int i = from; i<=to; ++i) { (yyval.setValue)->insert(i); } } break;
case 24: /* literal: R_IDENTIFIER */ { std::string s((yyvsp[0].sValue)); auto find = ctx.idMap.find(s); if (find == ctx.idMap.end()) { throw std::runtime_error("Unknown identifier: " + s); } (yyval.iValue) = find->second; } break;
default: break; } /* User semantic actions sometimes alter yychar, and that requires that yytoken be updated with the new translation. We take the approach of translating immediately before every use of yytoken. One alternative is translating here after every semantic action, but that translation would be missed if the semantic action invokes YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an incorrect destructor might then be invoked immediately. In the case of YYERROR or YYBACKUP, subsequent parser actions might lead to an incorrect destructor call or verbose syntax error message before the lookahead is translated. */ YY_SYMBOL_PRINT ("-> $$ =", YY_CAST (yysymbol_kind_t, yyr1[yyn]), &yyval, &yyloc);
YYPOPSTACK (yylen); yylen = 0;
*++yyvsp = yyval;
/* Now 'shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule number reduced by. */ { const int yylhs = yyr1[yyn] - YYNTOKENS; const int yyi = yypgoto[yylhs] + *yyssp; yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp ? yytable[yyi] : yydefgoto[yylhs]); }
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 ? YYSYMBOL_YYEMPTY : YYTRANSLATE (yychar); /* If not already recovering from an error, report this error. */ if (!yyerrstatus) { ++yynerrs; yyerror (ctx, YY_("syntax error")); }
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, ctx); 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 when the user code never invokes YYERROR and the label yyerrorlab therefore never appears in user code. */ if (0) YYERROR;
/* Do not reclaim the symbols of the rule whose action triggered this YYERROR. */ YYPOPSTACK (yylen); yylen = 0; YY_STACK_PRINT (yyss, yyssp); yystate = *yyssp; goto yyerrlab1;
/*-------------------------------------------------------------.| yyerrlab1 -- common code for both syntax error and YYERROR. |`-------------------------------------------------------------*/yyerrlab1: yyerrstatus = 3; /* Each real token shifted decrements this. */
/* Pop stack until we find a state that shifts the error token. */ for (;;) { yyn = yypact[yystate]; if (!yypact_value_is_default (yyn)) { yyn += YYSYMBOL_YYerror; if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYSYMBOL_YYerror) { yyn = yytable[yyn]; if (0 < yyn) break; } }
/* Pop the current state because it cannot handle the error token. */ if (yyssp == yyss) YYABORT;
yydestruct ("Error: popping", YY_ACCESSING_SYMBOL (yystate), yyvsp, ctx); YYPOPSTACK (1); yystate = *yyssp; YY_STACK_PRINT (yyss, yyssp); }
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN *++yyvsp = yylval; YY_IGNORE_MAYBE_UNINITIALIZED_END
/* Shift the error token. */ YY_SYMBOL_PRINT ("Shifting", YY_ACCESSING_SYMBOL (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/*-------------------------------------------------.| yyexhaustedlab -- memory exhaustion comes here. |`-------------------------------------------------*/yyexhaustedlab: yyerror (ctx, YY_("memory exhausted")); yyresult = 2; goto yyreturn;#endif
/*-------------------------------------------------------.| yyreturn -- parsing is finished, clean up and return. |`-------------------------------------------------------*/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, ctx); } /* Do not reclaim the symbols of the rule whose action triggered this YYABORT or YYACCEPT. */ YYPOPSTACK (yylen); YY_STACK_PRINT (yyss, yyssp); while (yyssp != yyss) { yydestruct ("Cleanup: popping", YY_ACCESSING_SYMBOL (+*yyssp), yyvsp, ctx); YYPOPSTACK (1); }#ifndef yyoverflow if (yyss != yyssa) YYSTACK_FREE (yyss);#endif
return yyresult;}
void yyerror(REContext& ctx, const char* s) { // TODO: Add error location throw std::runtime_error("Cannot parse regular expression: " + std::string(s));}
std::unique_ptr<REG> regex_from_string(const std::string& regex_str, const IntSetVal& domain, const std::unordered_map<std::string, int>& identifiers) { REG* expr = new REG(); regex_yy_scan_string(regex_str.c_str()); REContext rctx = REContext{expr, domain, identifiers}; int err = yyparse(rctx); if (err != 0) { throw std::runtime_error("Cannot parse regular expression, error code " + std::to_string(err)); } return std::unique_ptr<REG>(expr);}