|
|
|
|
/* A Bison parser, made from qregexpparser.y, by GNU bison 1.75. */
|
|
|
|
|
|
|
|
|
|
/* Skeleton parser for Yacc-like parsing with Bison,
|
|
|
|
|
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 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., 51 Franklin Street, Fifth Floor,
|
|
|
|
|
Boston, MA 02110-1301, 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. */
|
|
|
|
|
|
|
|
|
|
/* 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
|
|
|
|
|
|
|
|
|
|
/* Pure parsers. */
|
|
|
|
|
#define YYPURE 0
|
|
|
|
|
|
|
|
|
|
/* Using locations. */
|
|
|
|
|
#define YYLSP_NEEDED 0
|
|
|
|
|
|
|
|
|
|
/* If NAME_PREFIX is specified substitute the variables and functions
|
|
|
|
|
names. */
|
|
|
|
|
#define yyparse qregexpparse
|
|
|
|
|
#define yylex qregexplex
|
|
|
|
|
#define yyerror qregexperror
|
|
|
|
|
#define yylval qregexplval
|
|
|
|
|
#define yychar qregexpchar
|
|
|
|
|
#define yydebug qregexpdebug
|
|
|
|
|
#define yynerrs qregexpnerrs
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Tokens. */
|
|
|
|
|
#ifndef YYTOKENTYPE
|
|
|
|
|
# define YYTOKENTYPE
|
|
|
|
|
/* Put the tokens into the symbol table, so that GDB and other debuggers
|
|
|
|
|
know about them. */
|
|
|
|
|
enum yytokentype {
|
|
|
|
|
TOK_Dot = 258,
|
|
|
|
|
TOK_Dollar = 259,
|
|
|
|
|
TOK_Carat = 260,
|
|
|
|
|
TOK_MagicLeftParent = 261,
|
|
|
|
|
TOK_PosLookAhead = 262,
|
|
|
|
|
TOK_NegLookAhead = 263,
|
|
|
|
|
TOK_LeftParen = 264,
|
|
|
|
|
TOK_RightParent = 265,
|
|
|
|
|
TOK_Bar = 266,
|
|
|
|
|
TOK_Quantifier = 267,
|
|
|
|
|
TOK_BackRef = 268,
|
|
|
|
|
TOK_CharClass = 269,
|
|
|
|
|
TOK_Char = 270,
|
|
|
|
|
TOK_EscapeChar = 271,
|
|
|
|
|
TOK_PosWordChar = 272,
|
|
|
|
|
TOK_PosNonWordChar = 273
|
|
|
|
|
};
|
|
|
|
|
#endif
|
|
|
|
|
#define TOK_Dot 258
|
|
|
|
|
#define TOK_Dollar 259
|
|
|
|
|
#define TOK_Carat 260
|
|
|
|
|
#define TOK_MagicLeftParent 261
|
|
|
|
|
#define TOK_PosLookAhead 262
|
|
|
|
|
#define TOK_NegLookAhead 263
|
|
|
|
|
#define TOK_LeftParen 264
|
|
|
|
|
#define TOK_RightParent 265
|
|
|
|
|
#define TOK_Bar 266
|
|
|
|
|
#define TOK_Quantifier 267
|
|
|
|
|
#define TOK_BackRef 268
|
|
|
|
|
#define TOK_CharClass 269
|
|
|
|
|
#define TOK_Char 270
|
|
|
|
|
#define TOK_EscapeChar 271
|
|
|
|
|
#define TOK_PosWordChar 272
|
|
|
|
|
#define TOK_PosNonWordChar 273
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Copy the first part of user declarations. */
|
|
|
|
|
#line 18 "qregexpparser.y"
|
|
|
|
|
|
|
|
|
|
#ifdef TQT_ONLY
|
|
|
|
|
#include "compat.h"
|
|
|
|
|
#else
|
|
|
|
|
#include <klocale.h>
|
|
|
|
|
#include <kmessagebox.h>
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#include <tqstring.h>
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
|
|
|
|
|
#include "regexp.h"
|
|
|
|
|
#include "textregexp.h"
|
|
|
|
|
#include "textrangeregexp.h"
|
|
|
|
|
#include "repeatregexp.h"
|
|
|
|
|
#include "lookaheadregexp.h"
|
|
|
|
|
#include "concregexp.h"
|
|
|
|
|
#include "altnregexp.h"
|
|
|
|
|
#include "positionregexp.h"
|
|
|
|
|
#include "dotregexp.h"
|
|
|
|
|
#include "compoundregexp.h"
|
|
|
|
|
|
|
|
|
|
extern int yylex();
|
|
|
|
|
extern void setParseData( TQString str );
|
|
|
|
|
int yyerror (const char *);
|
|
|
|
|
void setParseResult( RegExp* );
|
|
|
|
|
RegExp* parseTQtRegExp( TQString qstr, bool* ok );
|
|
|
|
|
static RegExp* parseResult;
|
|
|
|
|
static int _index;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* 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 0
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#ifndef YYSTYPE
|
|
|
|
|
#line 49 "qregexpparser.y"
|
|
|
|
|
typedef union {
|
|
|
|
|
struct {
|
|
|
|
|
int min;
|
|
|
|
|
int max;
|
|
|
|
|
} range;
|
|
|
|
|
int backRef;
|
|
|
|
|
RegExp* regexp;
|
|
|
|
|
char ch;
|
|
|
|
|
} yystype;
|
|
|
|
|
/* Line 193 of /usr/share/bison/yacc.c. */
|
|
|
|
|
#line 159 "gen_qregexpparser.cc"
|
|
|
|
|
# define YYSTYPE yystype
|
|
|
|
|
# define YYSTYPE_IS_TRIVIAL 1
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#ifndef YYLTYPE
|
|
|
|
|
typedef struct yyltype
|
|
|
|
|
{
|
|
|
|
|
int first_line;
|
|
|
|
|
int first_column;
|
|
|
|
|
int last_line;
|
|
|
|
|
int last_column;
|
|
|
|
|
} yyltype;
|
|
|
|
|
# define YYLTYPE yyltype
|
|
|
|
|
# define YYLTYPE_IS_TRIVIAL 1
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Copy the second part of user declarations. */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Line 213 of /usr/share/bison/yacc.c. */
|
|
|
|
|
#line 180 "gen_qregexpparser.cc"
|
|
|
|
|
|
|
|
|
|
#if ! defined (yyoverflow) || YYERROR_VERBOSE
|
|
|
|
|
|
|
|
|
|
/* The parser invokes alloca or malloc; define the necessary symbols. */
|
|
|
|
|
|
|
|
|
|
# if YYSTACK_USE_ALLOCA
|
|
|
|
|
# define YYSTACK_ALLOC alloca
|
|
|
|
|
# else
|
|
|
|
|
# ifndef YYSTACK_USE_ALLOCA
|
|
|
|
|
# if defined (alloca) || defined (_ALLOCA_H)
|
|
|
|
|
# define YYSTACK_ALLOC alloca
|
|
|
|
|
# else
|
|
|
|
|
# ifdef __GNUC__
|
|
|
|
|
# define YYSTACK_ALLOC __builtin_alloca
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
|
|
|
|
|
# ifdef YYSTACK_ALLOC
|
|
|
|
|
/* Pacify GCC's `empty if-body' warning. */
|
|
|
|
|
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
|
|
|
|
|
# else
|
|
|
|
|
# if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# define YYSIZE_T size_t
|
|
|
|
|
# endif
|
|
|
|
|
# define YYSTACK_ALLOC malloc
|
|
|
|
|
# define YYSTACK_FREE free
|
|
|
|
|
# endif
|
|
|
|
|
#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#if (! defined (yyoverflow) \
|
|
|
|
|
&& (! defined (__cplusplus) \
|
|
|
|
|
|| (YYLTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
|
|
|
|
|
|
|
|
|
|
/* A type that is properly aligned for any stack member. */
|
|
|
|
|
union yyalloc
|
|
|
|
|
{
|
|
|
|
|
short yyss;
|
|
|
|
|
YYSTYPE yyvs;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* The size of the maximum gap between one aligned stack and the next. */
|
|
|
|
|
# define YYSTACK_GAP_MAX (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 (short) + sizeof (YYSTYPE)) \
|
|
|
|
|
+ YYSTACK_GAP_MAX)
|
|
|
|
|
|
|
|
|
|
/* Copy COUNT objects from FROM to TO. The source and destination do
|
|
|
|
|
not overlap. */
|
|
|
|
|
# ifndef YYCOPY
|
|
|
|
|
# if 1 < __GNUC__
|
|
|
|
|
# define YYCOPY(To, From, Count) \
|
|
|
|
|
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
|
|
|
|
|
# else
|
|
|
|
|
# define YYCOPY(To, From, Count) \
|
|
|
|
|
do \
|
|
|
|
|
{ \
|
|
|
|
|
register YYSIZE_T yyi; \
|
|
|
|
|
for (yyi = 0; yyi < (Count); yyi++) \
|
|
|
|
|
(To)[yyi] = (From)[yyi]; \
|
|
|
|
|
} \
|
|
|
|
|
while (0)
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
|
|
|
|
|
/* 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) \
|
|
|
|
|
do \
|
|
|
|
|
{ \
|
|
|
|
|
YYSIZE_T yynewbytes; \
|
|
|
|
|
YYCOPY (&yyptr->Stack, Stack, yysize); \
|
|
|
|
|
Stack = &yyptr->Stack; \
|
|
|
|
|
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAX; \
|
|
|
|
|
yyptr += yynewbytes / sizeof (*yyptr); \
|
|
|
|
|
} \
|
|
|
|
|
while (0)
|
|
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
typedef signed char yysigned_char;
|
|
|
|
|
#else
|
|
|
|
|
typedef short yysigned_char;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* YYFINAL -- State number of the termination state. */
|
|
|
|
|
#define YYFINAL 27
|
|
|
|
|
#define YYLAST 47
|
|
|
|
|
|
|
|
|
|
/* YYNTOKENS -- Number of terminals. */
|
|
|
|
|
#define YYNTOKENS 19
|
|
|
|
|
/* YYNNTS -- Number of nonterminals. */
|
|
|
|
|
#define YYNNTS 8
|
|
|
|
|
/* YYNRULES -- Number of rules. */
|
|
|
|
|
#define YYNRULES 27
|
|
|
|
|
/* YYNRULES -- Number of states. */
|
|
|
|
|
#define YYNSTATES 36
|
|
|
|
|
|
|
|
|
|
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
|
|
|
|
|
#define YYUNDEFTOK 2
|
|
|
|
|
#define YYMAXUTOK 273
|
|
|
|
|
|
|
|
|
|
#define YYTRANSLATE(X) \
|
|
|
|
|
((unsigned)(X) <= YYMAXUTOK ? yytranslate[X] : YYUNDEFTOK)
|
|
|
|
|
|
|
|
|
|
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
|
|
|
|
|
static const unsigned 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
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#if YYDEBUG
|
|
|
|
|
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
|
|
|
|
|
YYRHS. */
|
|
|
|
|
static const unsigned char yyprhs[] =
|
|
|
|
|
{
|
|
|
|
|
0, 0, 3, 4, 6, 8, 12, 14, 17, 20,
|
|
|
|
|
22, 25, 27, 30, 32, 36, 40, 44, 48, 50,
|
|
|
|
|
52, 54, 56, 58, 60, 62, 64, 66
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
|
|
|
|
|
static const yysigned_char yyrhs[] =
|
|
|
|
|
{
|
|
|
|
|
21, 0, -1, -1, 22, -1, 20, -1, 22, 11,
|
|
|
|
|
23, -1, 23, -1, 22, 11, -1, 11, 23, -1,
|
|
|
|
|
11, -1, 23, 24, -1, 24, -1, 25, 12, -1,
|
|
|
|
|
25, -1, 9, 22, 10, -1, 6, 22, 10, -1,
|
|
|
|
|
7, 22, 10, -1, 8, 22, 10, -1, 14, -1,
|
|
|
|
|
26, -1, 4, -1, 5, -1, 3, -1, 13, -1,
|
|
|
|
|
17, -1, 18, -1, 15, -1, 16, -1
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
|
|
|
|
|
static const unsigned char yyrline[] =
|
|
|
|
|
{
|
|
|
|
|
0, 80, 80, 82, 83, 86, 96, 97, 107, 112,
|
|
|
|
|
115, 129, 136, 139, 142, 145, 146, 149, 152, 153,
|
|
|
|
|
154, 155, 156, 157, 172, 173, 176, 182
|
|
|
|
|
};
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#if YYDEBUG || YYERROR_VERBOSE
|
|
|
|
|
/* YYTNME[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", "TOK_Dot", "TOK_Dollar", "TOK_Carat",
|
|
|
|
|
"TOK_MagicLeftParent", "TOK_PosLookAhead", "TOK_NegLookAhead",
|
|
|
|
|
"TOK_LeftParen", "TOK_RightParent", "TOK_Bar", "TOK_Quantifier",
|
|
|
|
|
"TOK_BackRef", "TOK_CharClass", "TOK_Char", "TOK_EscapeChar",
|
|
|
|
|
"TOK_PosWordChar", "TOK_PosNonWordChar", "$accept", "empty", "regexp",
|
|
|
|
|
"expression", "term", "factor", "atom", "char", 0
|
|
|
|
|
};
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
# ifdef YYPRINT
|
|
|
|
|
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
|
|
|
|
|
token YYLEX-NUM. */
|
|
|
|
|
static const unsigned short yytoknum[] =
|
|
|
|
|
{
|
|
|
|
|
0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
|
|
|
|
|
265, 266, 267, 268, 269, 270, 271, 272, 273
|
|
|
|
|
};
|
|
|
|
|
# endif
|
|
|
|
|
|
|
|
|
|
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
|
|
|
|
|
static const unsigned char yyr1[] =
|
|
|
|
|
{
|
|
|
|
|
0, 19, 20, 21, 21, 22, 22, 22, 22, 22,
|
|
|
|
|
23, 23, 24, 24, 25, 25, 25, 25, 25, 25,
|
|
|
|
|
25, 25, 25, 25, 25, 25, 26, 26
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
|
|
|
|
|
static const unsigned char yyr2[] =
|
|
|
|
|
{
|
|
|
|
|
0, 2, 0, 1, 1, 3, 1, 2, 2, 1,
|
|
|
|
|
2, 1, 2, 1, 3, 3, 3, 3, 1, 1,
|
|
|
|
|
1, 1, 1, 1, 1, 1, 1, 1
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
|
|
|
|
|
STATE-NUM when YYTABLE doesn't specify something else to do. Zero
|
|
|
|
|
means the default is an error. */
|
|
|
|
|
static const unsigned char yydefact[] =
|
|
|
|
|
{
|
|
|
|
|
2, 22, 20, 21, 0, 0, 0, 0, 9, 23,
|
|
|
|
|
18, 26, 27, 24, 25, 4, 0, 3, 6, 11,
|
|
|
|
|
13, 19, 0, 0, 0, 0, 8, 1, 7, 10,
|
|
|
|
|
12, 15, 16, 17, 14, 5
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYDEFGOTO[NTERM-NUM]. */
|
|
|
|
|
static const yysigned_char yydefgoto[] =
|
|
|
|
|
{
|
|
|
|
|
-1, 15, 16, 17, 18, 19, 20, 21
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
|
|
|
|
STATE-NUM. */
|
|
|
|
|
#define YYPACT_NINF -18
|
|
|
|
|
static const yysigned_char yypact[] =
|
|
|
|
|
{
|
|
|
|
|
-1, -18, -18, -18, -1, -1, -1, -1, 18, -18,
|
|
|
|
|
-18, -18, -18, -18, -18, -18, 11, 8, 18, -18,
|
|
|
|
|
16, -18, 19, 31, 34, 36, 18, -18, 18, -18,
|
|
|
|
|
-18, -18, -18, -18, -18, 18
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYPGOTO[NTERM-NUM]. */
|
|
|
|
|
static const yysigned_char yypgoto[] =
|
|
|
|
|
{
|
|
|
|
|
-18, -18, -18, 33, -8, -17, -18, -18
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* 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 zero, do what YYDEFACT says.
|
|
|
|
|
If YYTABLE_NINF, parse error. */
|
|
|
|
|
#define YYTABLE_NINF -1
|
|
|
|
|
static const unsigned char yytable[] =
|
|
|
|
|
{
|
|
|
|
|
26, 29, 1, 2, 3, 4, 5, 6, 7, 29,
|
|
|
|
|
8, 27, 9, 10, 11, 12, 13, 14, 29, 28,
|
|
|
|
|
35, 1, 2, 3, 4, 5, 6, 7, 30, 31,
|
|
|
|
|
28, 9, 10, 11, 12, 13, 14, 22, 23, 24,
|
|
|
|
|
25, 32, 28, 0, 33, 28, 34, 28
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static const yysigned_char yycheck[] =
|
|
|
|
|
{
|
|
|
|
|
8, 18, 3, 4, 5, 6, 7, 8, 9, 26,
|
|
|
|
|
11, 0, 13, 14, 15, 16, 17, 18, 35, 11,
|
|
|
|
|
28, 3, 4, 5, 6, 7, 8, 9, 12, 10,
|
|
|
|
|
11, 13, 14, 15, 16, 17, 18, 4, 5, 6,
|
|
|
|
|
7, 10, 11, -1, 10, 11, 10, 11
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
|
|
|
|
|
symbol of state STATE-NUM. */
|
|
|
|
|
static const unsigned char yystos[] =
|
|
|
|
|
{
|
|
|
|
|
0, 3, 4, 5, 6, 7, 8, 9, 11, 13,
|
|
|
|
|
14, 15, 16, 17, 18, 20, 21, 22, 23, 24,
|
|
|
|
|
25, 26, 22, 22, 22, 22, 23, 0, 11, 24,
|
|
|
|
|
12, 10, 10, 10, 10, 23
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__)
|
|
|
|
|
# define YYSIZE_T __SIZE_TYPE__
|
|
|
|
|
#endif
|
|
|
|
|
#if ! defined (YYSIZE_T) && defined (size_t)
|
|
|
|
|
# define YYSIZE_T size_t
|
|
|
|
|
#endif
|
|
|
|
|
#if ! defined (YYSIZE_T)
|
|
|
|
|
# if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# define YYSIZE_T size_t
|
|
|
|
|
# endif
|
|
|
|
|
#endif
|
|
|
|
|
#if ! defined (YYSIZE_T)
|
|
|
|
|
# define YYSIZE_T unsigned int
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#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
|
|
|
|
|
|
|
|
|
|
/* YYLLOC_DEFAULT -- Compute the default location (before the actions
|
|
|
|
|
are run). */
|
|
|
|
|
|
|
|
|
|
#ifndef YYLLOC_DEFAULT
|
|
|
|
|
# define YYLLOC_DEFAULT(Current, Rhs, N) \
|
|
|
|
|
Current.first_line = Rhs[1].first_line; \
|
|
|
|
|
Current.first_column = Rhs[1].first_column; \
|
|
|
|
|
Current.last_line = Rhs[N].last_line; \
|
|
|
|
|
Current.last_column = Rhs[N].last_column;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* YYLEX -- calling `yylex' with the right arguments. */
|
|
|
|
|
|
|
|
|
|
#define YYLEX yylex ()
|
|
|
|
|
|
|
|
|
|
/* 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)
|
|
|
|
|
# define YYDSYMPRINT(Args) \
|
|
|
|
|
do { \
|
|
|
|
|
if (yydebug) \
|
|
|
|
|
yysymprint Args; \
|
|
|
|
|
} while (0)
|
|
|
|
|
/* Nonzero means print parse trace. It is left uninitialized so that
|
|
|
|
|
multiple parsers can coexist. */
|
|
|
|
|
int yydebug;
|
|
|
|
|
#else /* !YYDEBUG */
|
|
|
|
|
# define YYDPRINTF(Args)
|
|
|
|
|
# define YYDSYMPRINT(Args)
|
|
|
|
|
#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
|
|
|
|
|
SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH)
|
|
|
|
|
evaluated with infinite-precision integer arithmetic. */
|
|
|
|
|
|
|
|
|
|
#if YYMAXDEPTH == 0
|
|
|
|
|
# undef YYMAXDEPTH
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#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. */
|
|
|
|
|
static YYSIZE_T
|
|
|
|
|
# if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
yystrlen (const char *yystr)
|
|
|
|
|
# else
|
|
|
|
|
yystrlen (yystr)
|
|
|
|
|
const char *yystr;
|
|
|
|
|
# endif
|
|
|
|
|
{
|
|
|
|
|
register const char *yys = yystr;
|
|
|
|
|
|
|
|
|
|
while (*yys++ != '\0')
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
return yys - yystr - 1;
|
|
|
|
|
}
|
|
|
|
|
# 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. */
|
|
|
|
|
static char *
|
|
|
|
|
# if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
yystpcpy (char *yydest, const char *yysrc)
|
|
|
|
|
# else
|
|
|
|
|
yystpcpy (yydest, yysrc)
|
|
|
|
|
char *yydest;
|
|
|
|
|
const char *yysrc;
|
|
|
|
|
# endif
|
|
|
|
|
{
|
|
|
|
|
register char *yyd = yydest;
|
|
|
|
|
register const char *yys = yysrc;
|
|
|
|
|
|
|
|
|
|
while ((*yyd++ = *yys++) != '\0')
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
return yyd - 1;
|
|
|
|
|
}
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
|
|
|
|
|
#endif /* !YYERROR_VERBOSE */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#if YYDEBUG
|
|
|
|
|
/*-----------------------------.
|
|
|
|
|
| Print this symbol on YYOUT. |
|
|
|
|
|
`-----------------------------*/
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
yysymprint (FILE* yyout, int yytype, YYSTYPE yyvalue)
|
|
|
|
|
#else
|
|
|
|
|
yysymprint (yyout, yytype, yyvalue)
|
|
|
|
|
FILE* yyout;
|
|
|
|
|
int yytype;
|
|
|
|
|
YYSTYPE yyvalue;
|
|
|
|
|
#endif
|
|
|
|
|
{
|
|
|
|
|
/* Pacify ``unused variable'' warnings. */
|
|
|
|
|
(void) yyvalue;
|
|
|
|
|
|
|
|
|
|
if (yytype < YYNTOKENS)
|
|
|
|
|
{
|
|
|
|
|
YYFPRINTF (yyout, "token %s (", yytname[yytype]);
|
|
|
|
|
# ifdef YYPRINT
|
|
|
|
|
YYPRINT (yyout, yytoknum[yytype], yyvalue);
|
|
|
|
|
# endif
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
YYFPRINTF (yyout, "nterm %s (", yytname[yytype]);
|
|
|
|
|
|
|
|
|
|
switch (yytype)
|
|
|
|
|
{
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
YYFPRINTF (yyout, ")");
|
|
|
|
|
}
|
|
|
|
|
#endif /* YYDEBUG. */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------------------.
|
|
|
|
|
| Release the memory associated to this symbol. |
|
|
|
|
|
`-----------------------------------------------*/
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
yydestruct (int yytype, YYSTYPE yyvalue)
|
|
|
|
|
#else
|
|
|
|
|
yydestruct (yytype, yyvalue)
|
|
|
|
|
int yytype;
|
|
|
|
|
YYSTYPE yyvalue;
|
|
|
|
|
#endif
|
|
|
|
|
{
|
|
|
|
|
/* Pacify ``unused variable'' warnings. */
|
|
|
|
|
(void) yyvalue;
|
|
|
|
|
|
|
|
|
|
switch (yytype)
|
|
|
|
|
{
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* The user can define YYPARSE_PARAM as the name of an argument to be passed
|
|
|
|
|
into yyparse. The argument should have type void *.
|
|
|
|
|
It should actually point to an object.
|
|
|
|
|
Grammar actions can access the variable by casting it
|
|
|
|
|
to the proper pointer type. */
|
|
|
|
|
|
|
|
|
|
#ifdef YYPARSE_PARAM
|
|
|
|
|
# if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
# define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
|
|
|
|
|
# define YYPARSE_PARAM_DECL
|
|
|
|
|
# else
|
|
|
|
|
# define YYPARSE_PARAM_ARG YYPARSE_PARAM
|
|
|
|
|
# define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
|
|
|
|
|
# endif
|
|
|
|
|
#else /* !YYPARSE_PARAM */
|
|
|
|
|
# define YYPARSE_PARAM_ARG
|
|
|
|
|
# define YYPARSE_PARAM_DECL
|
|
|
|
|
#endif /* !YYPARSE_PARAM */
|
|
|
|
|
|
|
|
|
|
/* Prevent warning if -Wstrict-prototypes. */
|
|
|
|
|
#ifdef __GNUC__
|
|
|
|
|
# ifdef YYPARSE_PARAM
|
|
|
|
|
int yyparse (void *);
|
|
|
|
|
# else
|
|
|
|
|
int yyparse (void);
|
|
|
|
|
# endif
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* The lookahead symbol. */
|
|
|
|
|
int yychar;
|
|
|
|
|
|
|
|
|
|
/* The semantic value of the lookahead symbol. */
|
|
|
|
|
YYSTYPE yylval;
|
|
|
|
|
|
|
|
|
|
/* Number of parse errors so far. */
|
|
|
|
|
int yynerrs;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
yyparse (YYPARSE_PARAM_ARG)
|
|
|
|
|
YYPARSE_PARAM_DECL
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
register int yystate;
|
|
|
|
|
register int yyn;
|
|
|
|
|
int yyresult;
|
|
|
|
|
/* Number of tokens to shift before error messages enabled. */
|
|
|
|
|
int yyerrstatus;
|
|
|
|
|
/* Lookahead token as an internal (translated) token number. */
|
|
|
|
|
int yychar1 = 0;
|
|
|
|
|
|
|
|
|
|
/* Three 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. */
|
|
|
|
|
short yyssa[YYINITDEPTH];
|
|
|
|
|
short *yyss = yyssa;
|
|
|
|
|
register short *yyssp;
|
|
|
|
|
|
|
|
|
|
/* The semantic value stack. */
|
|
|
|
|
YYSTYPE yyvsa[YYINITDEPTH];
|
|
|
|
|
YYSTYPE *yyvs = yyvsa;
|
|
|
|
|
register YYSTYPE *yyvsp;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define YYPOPSTACK (yyvsp--, yyssp--)
|
|
|
|
|
|
|
|
|
|
YYSIZE_T yystacksize = YYINITDEPTH;
|
|
|
|
|
|
|
|
|
|
/* The variables used to return semantic value and location from the
|
|
|
|
|
action routines. */
|
|
|
|
|
YYSTYPE yyval;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* When reducing, the number of symbols on the RHS of the reduced
|
|
|
|
|
rule. */
|
|
|
|
|
int yylen;
|
|
|
|
|
|
|
|
|
|
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;
|
|
|
|
|
|
|
|
|
|
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 (yyssp >= yyss + yystacksize - 1)
|
|
|
|
|
{
|
|
|
|
|
/* 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;
|
|
|
|
|
short *yyss1 = yyss;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Each stack pointer address is followed by the size of the
|
|
|
|
|
data in use in that stack, in bytes. This used to be a
|
|
|
|
|
conditional around just the two extra args, but that might
|
|
|
|
|
be undefined if yyoverflow is a macro. */
|
|
|
|
|
yyoverflow ("parser stack overflow",
|
|
|
|
|
&yyss1, yysize * sizeof (*yyssp),
|
|
|
|
|
&yyvs1, yysize * sizeof (*yyvsp),
|
|
|
|
|
|
|
|
|
|
&yystacksize);
|
|
|
|
|
|
|
|
|
|
yyss = yyss1;
|
|
|
|
|
yyvs = yyvs1;
|
|
|
|
|
}
|
|
|
|
|
#else /* no yyoverflow */
|
|
|
|
|
# ifndef YYSTACK_RELOCATE
|
|
|
|
|
goto yyoverflowlab;
|
|
|
|
|
# else
|
|
|
|
|
/* Extend the stack our own way. */
|
|
|
|
|
if (yystacksize >= YYMAXDEPTH)
|
|
|
|
|
goto yyoverflowlab;
|
|
|
|
|
yystacksize *= 2;
|
|
|
|
|
if (yystacksize > YYMAXDEPTH)
|
|
|
|
|
yystacksize = YYMAXDEPTH;
|
|
|
|
|
|
|
|
|
|
{
|
|
|
|
|
short *yyss1 = yyss;
|
|
|
|
|
union yyalloc *yyptr =
|
|
|
|
|
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
|
|
|
|
|
if (! yyptr)
|
|
|
|
|
goto yyoverflowlab;
|
|
|
|
|
YYSTACK_RELOCATE (yyss);
|
|
|
|
|
YYSTACK_RELOCATE (yyvs);
|
|
|
|
|
|
|
|
|
|
# undef YYSTACK_RELOCATE
|
|
|
|
|
if (yyss1 != yyssa)
|
|
|
|
|
YYSTACK_FREE (yyss1);
|
|
|
|
|
}
|
|
|
|
|
# endif
|
|
|
|
|
#endif /* no yyoverflow */
|
|
|
|
|
|
|
|
|
|
yyssp = yyss + yysize - 1;
|
|
|
|
|
yyvsp = yyvs + yysize - 1;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
|
|
|
|
|
(unsigned long int) yystacksize));
|
|
|
|
|
|
|
|
|
|
if (yyssp >= yyss + yystacksize - 1)
|
|
|
|
|
YYABORT;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
|
|
|
|
|
|
|
|
|
|
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. */
|
|
|
|
|
/* yyresume: */
|
|
|
|
|
|
|
|
|
|
/* First try to decide what to do without reference to lookahead token. */
|
|
|
|
|
|
|
|
|
|
yyn = yypact[yystate];
|
|
|
|
|
if (yyn == YYPACT_NINF)
|
|
|
|
|
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)
|
|
|
|
|
{
|
|
|
|
|
YYDPRINTF ((stderr, "Reading a token: "));
|
|
|
|
|
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. */
|
|
|
|
|
|
|
|
|
|
YYDPRINTF ((stderr, "Now at end of input.\n"));
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
yychar1 = YYTRANSLATE (yychar);
|
|
|
|
|
|
|
|
|
|
/* We have to keep this `#if YYDEBUG', since we use variables
|
|
|
|
|
which are defined only if `YYDEBUG' is set. */
|
|
|
|
|
YYDPRINTF ((stderr, "Next token is "));
|
|
|
|
|
YYDSYMPRINT ((stderr, yychar1, yylval));
|
|
|
|
|
YYDPRINTF ((stderr, "\n"));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* If the proper action on seeing token YYCHAR1 is to reduce or to
|
|
|
|
|
detect an error, take that action. */
|
|
|
|
|
yyn += yychar1;
|
|
|
|
|
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yychar1)
|
|
|
|
|
goto yydefault;
|
|
|
|
|
yyn = yytable[yyn];
|
|
|
|
|
if (yyn <= 0)
|
|
|
|
|
{
|
|
|
|
|
if (yyn == 0 || yyn == YYTABLE_NINF)
|
|
|
|
|
goto yyerrlab;
|
|
|
|
|
yyn = -yyn;
|
|
|
|
|
goto yyreduce;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (yyn == YYFINAL)
|
|
|
|
|
YYACCEPT;
|
|
|
|
|
|
|
|
|
|
/* Shift the lookahead token. */
|
|
|
|
|
YYDPRINTF ((stderr, "Shifting token %d (%s), ",
|
|
|
|
|
yychar, yytname[yychar1]));
|
|
|
|
|
|
|
|
|
|
/* Discard the token being shifted unless it is eof. */
|
|
|
|
|
if (yychar != YYEOF)
|
|
|
|
|
yychar = YYEMPTY;
|
|
|
|
|
|
|
|
|
|
*++yyvsp = yylval;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Count tokens shifted since error; after three, turn off error
|
|
|
|
|
status. */
|
|
|
|
|
if (yyerrstatus)
|
|
|
|
|
yyerrstatus--;
|
|
|
|
|
|
|
|
|
|
yystate = yyn;
|
|
|
|
|
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];
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#if YYDEBUG
|
|
|
|
|
/* We have to keep this `#if YYDEBUG', since we use variables which
|
|
|
|
|
are defined only if `YYDEBUG' is set. */
|
|
|
|
|
if (yydebug)
|
|
|
|
|
{
|
|
|
|
|
int yyi;
|
|
|
|
|
|
|
|
|
|
YYFPRINTF (stderr, "Reducing via rule %d (line %d), ",
|
|
|
|
|
yyn - 1, yyrline[yyn]);
|
|
|
|
|
|
|
|
|
|
/* Print the symbols being reduced, and their result. */
|
|
|
|
|
for (yyi = yyprhs[yyn]; yyrhs[yyi] >= 0; yyi++)
|
|
|
|
|
YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]);
|
|
|
|
|
YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]);
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
switch (yyn)
|
|
|
|
|
{
|
|
|
|
|
case 3:
|
|
|
|
|
#line 82 "qregexpparser.y"
|
|
|
|
|
{ setParseResult( yyvsp[0].regexp) ; }
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 4:
|
|
|
|
|
#line 83 "qregexpparser.y"
|
|
|
|
|
{ setParseResult( new ConcRegExp( false ) ); }
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 5:
|
|
|
|
|
#line 86 "qregexpparser.y"
|
|
|
|
|
{
|
|
|
|
|
if ( dynamic_cast<AltnRegExp*>( yyvsp[-2].regexp ) ) {
|
|
|
|
|
yyval.regexp = yyvsp[-2].regexp;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
yyval.regexp = new AltnRegExp( false );
|
|
|
|
|
dynamic_cast<AltnRegExp*>( yyval.regexp )->addRegExp( yyvsp[-2].regexp );
|
|
|
|
|
}
|
|
|
|
|
dynamic_cast<AltnRegExp*>( yyval.regexp )->addRegExp( yyvsp[0].regexp );
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 6:
|
|
|
|
|
#line 96 "qregexpparser.y"
|
|
|
|
|
{ yyval.regexp = yyvsp[0].regexp; }
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 7:
|
|
|
|
|
#line 97 "qregexpparser.y"
|
|
|
|
|
{
|
|
|
|
|
if ( dynamic_cast<AltnRegExp*>( yyvsp[-1].regexp ) ) {
|
|
|
|
|
yyval.regexp = yyvsp[-1].regexp;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
yyval.regexp = new AltnRegExp( false );
|
|
|
|
|
dynamic_cast<AltnRegExp*>( yyval.regexp )->addRegExp( yyvsp[-1].regexp );
|
|
|
|
|
}
|
|
|
|
|
dynamic_cast<AltnRegExp*>( yyval.regexp )->addRegExp( new TextRegExp( false, TQString::fromLatin1("") ) );
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 8:
|
|
|
|
|
#line 107 "qregexpparser.y"
|
|
|
|
|
{
|
|
|
|
|
yyval.regexp = new AltnRegExp( false );
|
|
|
|
|
dynamic_cast<AltnRegExp*>( yyval.regexp )->addRegExp( new TextRegExp( false, TQString::fromLatin1("") ) );
|
|
|
|
|
dynamic_cast<AltnRegExp*>( yyval.regexp )->addRegExp( yyvsp[0].regexp );
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 9:
|
|
|
|
|
#line 112 "qregexpparser.y"
|
|
|
|
|
{ yyval.regexp = new AltnRegExp( false ); }
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 10:
|
|
|
|
|
#line 115 "qregexpparser.y"
|
|
|
|
|
{
|
|
|
|
|
RegExp* last = dynamic_cast<ConcRegExp*>( yyvsp[-1].regexp )->lastRegExp();
|
|
|
|
|
TextRegExp *reg1, *reg2;
|
|
|
|
|
|
|
|
|
|
if ( last && ( reg1 = dynamic_cast<TextRegExp*>( last ) ) &&
|
|
|
|
|
( reg2 = dynamic_cast<TextRegExp*>( yyvsp[0].regexp ) ) ) {
|
|
|
|
|
reg1->append( reg2->text() );
|
|
|
|
|
delete reg2;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
dynamic_cast<ConcRegExp*>(yyval.regexp)->addRegExp( yyvsp[0].regexp );
|
|
|
|
|
}
|
|
|
|
|
yyval.regexp = yyvsp[-1].regexp;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 11:
|
|
|
|
|
#line 129 "qregexpparser.y"
|
|
|
|
|
{
|
|
|
|
|
ConcRegExp* reg = new ConcRegExp( false );
|
|
|
|
|
reg->addRegExp( yyvsp[0].regexp );
|
|
|
|
|
yyval.regexp = reg;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 12:
|
|
|
|
|
#line 136 "qregexpparser.y"
|
|
|
|
|
{
|
|
|
|
|
yyval.regexp = new RepeatRegExp( false, yyvsp[0].range.min, yyvsp[0].range.max, yyvsp[-1].regexp );
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 13:
|
|
|
|
|
#line 139 "qregexpparser.y"
|
|
|
|
|
{ yyval.regexp = yyvsp[0].regexp; }
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 14:
|
|
|
|
|
#line 142 "qregexpparser.y"
|
|
|
|
|
{
|
|
|
|
|
yyval.regexp = yyvsp[-1].regexp;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 15:
|
|
|
|
|
#line 145 "qregexpparser.y"
|
|
|
|
|
{ yyval.regexp = yyvsp[-1].regexp; }
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 16:
|
|
|
|
|
#line 146 "qregexpparser.y"
|
|
|
|
|
{
|
|
|
|
|
yyval.regexp = new LookAheadRegExp( false, LookAheadRegExp::POSITIVE, yyvsp[-1].regexp );
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 17:
|
|
|
|
|
#line 149 "qregexpparser.y"
|
|
|
|
|
{
|
|
|
|
|
yyval.regexp = new LookAheadRegExp( false, LookAheadRegExp::NEGATIVE, yyvsp[-1].regexp );
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 18:
|
|
|
|
|
#line 152 "qregexpparser.y"
|
|
|
|
|
{ yyval.regexp = yyvsp[0].regexp; }
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 19:
|
|
|
|
|
#line 153 "qregexpparser.y"
|
|
|
|
|
{ yyval.regexp = yyvsp[0].regexp; }
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 20:
|
|
|
|
|
#line 154 "qregexpparser.y"
|
|
|
|
|
{ yyval.regexp = new PositionRegExp( false, PositionRegExp::ENDLINE ); }
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 21:
|
|
|
|
|
#line 155 "qregexpparser.y"
|
|
|
|
|
{ yyval.regexp = new PositionRegExp( false, PositionRegExp::BEGLINE ); }
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 22:
|
|
|
|
|
#line 156 "qregexpparser.y"
|
|
|
|
|
{ yyval.regexp = new DotRegExp( false ); }
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 23:
|
|
|
|
|
#line 157 "qregexpparser.y"
|
|
|
|
|
{
|
|
|
|
|
TQString match = TQString(TQString::fromLocal8Bit("\\%1")).arg( yyvsp[0].backRef );
|
|
|
|
|
yyval.regexp = new TextRegExp( false, match );
|
|
|
|
|
KMessageBox::information(0,i18n("<qt>Back reference regular expressions are not supported.<p>"
|
|
|
|
|
"<tt>\\1</tt>, <tt>\\2</tt>, ... are <i>back references</i>, meaning they refer to "
|
|
|
|
|
"previous matches. "
|
|
|
|
|
"Unfortunately this is not supported in the current version of this editor.<p>"
|
|
|
|
|
"In the graphical area the text <b>%1</b> has been inserted. This is however "
|
|
|
|
|
"just a workaround to ensure that the application handles the regexp at all. "
|
|
|
|
|
"Therefore, as soon as you edit the regular expression in the graphical area, "
|
|
|
|
|
"the back reference will be replaced by matching the text <b>%2</b> literally.")
|
|
|
|
|
.arg( match ).arg( match ),
|
|
|
|
|
i18n("Back reference regular expressions not supported"),
|
|
|
|
|
TQString::fromLocal8Bit("backReferenceNotSupported") );
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 24:
|
|
|
|
|
#line 172 "qregexpparser.y"
|
|
|
|
|
{ yyval.regexp = new PositionRegExp( false, PositionRegExp::WORDBOUNDARY ); }
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 25:
|
|
|
|
|
#line 173 "qregexpparser.y"
|
|
|
|
|
{ yyval.regexp = new PositionRegExp( false, PositionRegExp::NONWORDBOUNDARY ); }
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 26:
|
|
|
|
|
#line 176 "qregexpparser.y"
|
|
|
|
|
{
|
|
|
|
|
if ( yyvsp[0].ch == '{' || yyvsp[0].ch == '}' || yyvsp[0].ch == '[' || yyvsp[0].ch == ']' || yyvsp[0].ch == '\\' ) {
|
|
|
|
|
yyerror( "illigal character - needs escaping" );
|
|
|
|
|
}
|
|
|
|
|
yyval.regexp = new TextRegExp( false, TQString(TQString::fromLocal8Bit("%1")).arg(yyvsp[0].ch));
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 27:
|
|
|
|
|
#line 182 "qregexpparser.y"
|
|
|
|
|
{ yyval.regexp = new TextRegExp( false, TQString(TQString::fromLocal8Bit("%1")).arg(yyvsp[0].ch)); }
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Line 1016 of /usr/share/bison/yacc.c. */
|
|
|
|
|
#line 1209 "gen_qregexpparser.cc"
|
|
|
|
|
|
|
|
|
|
yyvsp -= yylen;
|
|
|
|
|
yyssp -= yylen;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#if YYDEBUG
|
|
|
|
|
if (yydebug)
|
|
|
|
|
{
|
|
|
|
|
short *yyssp1 = yyss - 1;
|
|
|
|
|
YYFPRINTF (stderr, "state stack now");
|
|
|
|
|
while (yyssp1 != yyssp)
|
|
|
|
|
YYFPRINTF (stderr, " %d", *++yyssp1);
|
|
|
|
|
YYFPRINTF (stderr, "\n");
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
*++yyvsp = yyval;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Now `shift' the result of the reduction. Determine what state
|
|
|
|
|
that goes to, based on the state we popped back to and the rule
|
|
|
|
|
number reduced by. */
|
|
|
|
|
|
|
|
|
|
yyn = yyr1[yyn];
|
|
|
|
|
|
|
|
|
|
yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
|
|
|
|
|
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
|
|
|
|
|
yystate = yytable[yystate];
|
|
|
|
|
else
|
|
|
|
|
yystate = yydefgoto[yyn - YYNTOKENS];
|
|
|
|
|
|
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*------------------------------------.
|
|
|
|
|
| yyerrlab -- here on detecting error |
|
|
|
|
|
`------------------------------------*/
|
|
|
|
|
yyerrlab:
|
|
|
|
|
/* If not already recovering from an error, report this error. */
|
|
|
|
|
if (!yyerrstatus)
|
|
|
|
|
{
|
|
|
|
|
++yynerrs;
|
|
|
|
|
#if YYERROR_VERBOSE
|
|
|
|
|
yyn = yypact[yystate];
|
|
|
|
|
|
|
|
|
|
if (YYPACT_NINF < yyn && yyn < YYLAST)
|
|
|
|
|
{
|
|
|
|
|
YYSIZE_T yysize = 0;
|
|
|
|
|
int yytype = YYTRANSLATE (yychar);
|
|
|
|
|
char *yymsg;
|
|
|
|
|
int yyx, yycount;
|
|
|
|
|
|
|
|
|
|
yycount = 0;
|
|
|
|
|
/* Start YYX at -YYN if negative to avoid negative indexes in
|
|
|
|
|
YYCHECK. */
|
|
|
|
|
for (yyx = yyn < 0 ? -yyn : 0;
|
|
|
|
|
yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++)
|
|
|
|
|
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
|
|
|
|
yysize += yystrlen (yytname[yyx]) + 15, yycount++;
|
|
|
|
|
yysize += yystrlen ("parse error, unexpected ") + 1;
|
|
|
|
|
yysize += yystrlen (yytname[yytype]);
|
|
|
|
|
yymsg = (char *) YYSTACK_ALLOC (yysize);
|
|
|
|
|
if (yymsg != 0)
|
|
|
|
|
{
|
|
|
|
|
char *yyp = yystpcpy (yymsg, "parse error, unexpected ");
|
|
|
|
|
yyp = yystpcpy (yyp, yytname[yytype]);
|
|
|
|
|
|
|
|
|
|
if (yycount < 5)
|
|
|
|
|
{
|
|
|
|
|
yycount = 0;
|
|
|
|
|
for (yyx = yyn < 0 ? -yyn : 0;
|
|
|
|
|
yyx < (int) (sizeof (yytname) / sizeof (char *));
|
|
|
|
|
yyx++)
|
|
|
|
|
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
|
|
|
|
{
|
|
|
|
|
const char *yyq = ! yycount ? ", expecting " : " or ";
|
|
|
|
|
yyp = yystpcpy (yyp, yyq);
|
|
|
|
|
yyp = yystpcpy (yyp, yytname[yyx]);
|
|
|
|
|
yycount++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
yyerror (yymsg);
|
|
|
|
|
YYSTACK_FREE (yymsg);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
yyerror ("parse error; also virtual memory exhausted");
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
#endif /* YYERROR_VERBOSE */
|
|
|
|
|
yyerror ("parse error");
|
|
|
|
|
}
|
|
|
|
|
goto yyerrlab1;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*----------------------------------------------------.
|
|
|
|
|
| yyerrlab1 -- error raised explicitly by an action. |
|
|
|
|
|
`----------------------------------------------------*/
|
|
|
|
|
yyerrlab1:
|
|
|
|
|
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)
|
|
|
|
|
{
|
|
|
|
|
/* Pop the error token. */
|
|
|
|
|
YYPOPSTACK;
|
|
|
|
|
/* Pop the rest of the stack. */
|
|
|
|
|
while (yyssp > yyss)
|
|
|
|
|
{
|
|
|
|
|
YYDPRINTF ((stderr, "Error: popping "));
|
|
|
|
|
YYDSYMPRINT ((stderr,
|
|
|
|
|
yystos[*yyssp],
|
|
|
|
|
*yyvsp));
|
|
|
|
|
YYDPRINTF ((stderr, "\n"));
|
|
|
|
|
yydestruct (yystos[*yyssp], *yyvsp);
|
|
|
|
|
YYPOPSTACK;
|
|
|
|
|
}
|
|
|
|
|
YYABORT;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
YYDPRINTF ((stderr, "Discarding token %d (%s).\n",
|
|
|
|
|
yychar, yytname[yychar1]));
|
|
|
|
|
yydestruct (yychar1, yylval);
|
|
|
|
|
yychar = YYEMPTY;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Else will try to reuse lookahead token after shifting the error
|
|
|
|
|
token. */
|
|
|
|
|
|
|
|
|
|
yyerrstatus = 3; /* Each real token shifted decrements this. */
|
|
|
|
|
|
|
|
|
|
for (;;)
|
|
|
|
|
{
|
|
|
|
|
yyn = yypact[yystate];
|
|
|
|
|
if (yyn != YYPACT_NINF)
|
|
|
|
|
{
|
|
|
|
|
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;
|
|
|
|
|
|
|
|
|
|
YYDPRINTF ((stderr, "Error: popping "));
|
|
|
|
|
YYDSYMPRINT ((stderr,
|
|
|
|
|
yystos[*yyssp], *yyvsp));
|
|
|
|
|
YYDPRINTF ((stderr, "\n"));
|
|
|
|
|
|
|
|
|
|
yydestruct (yystos[yystate], *yyvsp);
|
|
|
|
|
yyvsp--;
|
|
|
|
|
yystate = *--yyssp;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#if YYDEBUG
|
|
|
|
|
if (yydebug)
|
|
|
|
|
{
|
|
|
|
|
short *yyssp1 = yyss - 1;
|
|
|
|
|
YYFPRINTF (stderr, "Error: state stack now");
|
|
|
|
|
while (yyssp1 != yyssp)
|
|
|
|
|
YYFPRINTF (stderr, " %d", *++yyssp1);
|
|
|
|
|
YYFPRINTF (stderr, "\n");
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (yyn == YYFINAL)
|
|
|
|
|
YYACCEPT;
|
|
|
|
|
|
|
|
|
|
YYDPRINTF ((stderr, "Shifting error token, "));
|
|
|
|
|
|
|
|
|
|
*++yyvsp = yylval;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
yystate = yyn;
|
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*-------------------------------------.
|
|
|
|
|
| yyacceptlab -- YYACCEPT comes here. |
|
|
|
|
|
`-------------------------------------*/
|
|
|
|
|
yyacceptlab:
|
|
|
|
|
yyresult = 0;
|
|
|
|
|
goto yyreturn;
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------.
|
|
|
|
|
| yyabortlab -- YYABORT comes here. |
|
|
|
|
|
`-----------------------------------*/
|
|
|
|
|
yyabortlab:
|
|
|
|
|
yyresult = 1;
|
|
|
|
|
goto yyreturn;
|
|
|
|
|
|
|
|
|
|
#ifndef yyoverflow
|
|
|
|
|
/*----------------------------------------------.
|
|
|
|
|
| yyoverflowlab -- parser overflow comes here. |
|
|
|
|
|
`----------------------------------------------*/
|
|
|
|
|
yyoverflowlab:
|
|
|
|
|
yyerror ("parser stack overflow");
|
|
|
|
|
yyresult = 2;
|
|
|
|
|
/* Fall through. */
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
yyreturn:
|
|
|
|
|
#ifndef yyoverflow
|
|
|
|
|
if (yyss != yyssa)
|
|
|
|
|
YYSTACK_FREE (yyss);
|
|
|
|
|
#endif
|
|
|
|
|
return yyresult;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#line 185 "qregexpparser.y"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
RegExp* parseTQtRegExp( TQString qstr, bool* ok ) {
|
|
|
|
|
_index = 0;
|
|
|
|
|
parseResult = 0;
|
|
|
|
|
setParseData( qstr );
|
|
|
|
|
yyparse();
|
|
|
|
|
*ok = ( yynerrs == 0 );
|
|
|
|
|
return parseResult;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void setParseResult( RegExp* regexp ) {
|
|
|
|
|
parseResult = regexp;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int yyerror(const char *) {
|
|
|
|
|
yynerrs++;
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|