2319 lines
57 KiB
C
2319 lines
57 KiB
C
/* A Bison parser, made by GNU Bison 2.4.2. */
|
||
|
||
/* Skeleton implementation for Bison's Yacc-like parsers in C
|
||
|
||
Copyright (C) 1984, 1989-1990, 2000-2006, 2009-2010 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 <http://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. */
|
||
|
||
/* All symbols defined below should begin with yy or YY, to avoid
|
||
infringing on user name space. This should be done even for local
|
||
variables, as they might otherwise be expanded by user macros.
|
||
There are some unavoidable exceptions within include files to
|
||
define necessary library symbols; they are noted "INFRINGES ON
|
||
USER NAME SPACE" below. */
|
||
|
||
/* Identify Bison output. */
|
||
#define YYBISON 1
|
||
|
||
/* Bison version. */
|
||
#define YYBISON_VERSION "2.4.2"
|
||
|
||
/* Skeleton name. */
|
||
#define YYSKELETON_NAME "yacc.c"
|
||
|
||
/* Pure parsers. */
|
||
#define YYPURE 0
|
||
|
||
/* Push parsers. */
|
||
#define YYPUSH 0
|
||
|
||
/* Pull parsers. */
|
||
#define YYPULL 1
|
||
|
||
/* Using locations. */
|
||
#define YYLSP_NEEDED 0
|
||
|
||
|
||
|
||
/* Copy the first part of user declarations. */
|
||
|
||
/* Line 189 of yacc.c */
|
||
#line 1 "egrep.y"
|
||
|
||
/*===========================================================================
|
||
Copyright (c) 1998-2000, The Santa Cruz Operation
|
||
All rights reserved.
|
||
|
||
Redistribution and use in source and binary forms, with or without
|
||
modification, are permitted provided that the following conditions are met:
|
||
|
||
*Redistributions of source code must retain the above copyright notice,
|
||
this list of conditions and the following disclaimer.
|
||
|
||
*Redistributions in binary form must reproduce the above copyright notice,
|
||
this list of conditions and the following disclaimer in the documentation
|
||
and/or other materials provided with the distribution.
|
||
|
||
*Neither name of The Santa Cruz Operation nor the names of its contributors
|
||
may be used to endorse or promote products derived from this software
|
||
without specific prior written permission.
|
||
|
||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
|
||
IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
|
||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE
|
||
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
||
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
||
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
||
INTERRUPTION)
|
||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
|
||
DAMAGE.
|
||
=========================================================================*/
|
||
|
||
/* $Id: egrep.y,v 1.11 2006/04/21 10:45:48 broeker Exp $ */
|
||
|
||
/*
|
||
* egrep -- fine lines containing a regular expression
|
||
*/
|
||
|
||
/* Line 189 of yacc.c */
|
||
#line 47 "egrep.y"
|
||
|
||
#include "global.h"
|
||
#include <ctype.h>
|
||
#include <stdio.h>
|
||
|
||
#include <setjmp.h> /* jmp_buf */
|
||
|
||
#define nextch() (*input++)
|
||
|
||
#define MAXLIN 350
|
||
#define MAXPOS 4000
|
||
#define NCHARS 256
|
||
#define NSTATES 128
|
||
#define FINAL -1
|
||
static char gotofn[NSTATES][NCHARS];
|
||
static int state[NSTATES];
|
||
static char out[NSTATES];
|
||
static unsigned int line;
|
||
static int name[MAXLIN];
|
||
static unsigned int left[MAXLIN];
|
||
static unsigned int right[MAXLIN];
|
||
static unsigned int parent[MAXLIN];
|
||
static int foll[MAXLIN];
|
||
static int positions[MAXPOS];
|
||
static char chars[MAXLIN];
|
||
static int nxtpos;
|
||
static int nxtchar;
|
||
static int tmpstat[MAXLIN];
|
||
static int initstat[MAXLIN];
|
||
static int xstate;
|
||
static int count;
|
||
static int icount;
|
||
static char *input;
|
||
static long lnum;
|
||
static int iflag;
|
||
static jmp_buf env; /* setjmp/longjmp buffer */
|
||
static char *message; /* error message */
|
||
|
||
/* Internal prototypes: */
|
||
static void cfoll(int v);
|
||
static void cgotofn(void);
|
||
static int cstate(int v);
|
||
static int member(int symb, int set, int torf);
|
||
static int notin(int n);
|
||
static void synerror(void);
|
||
static void overflo(void);
|
||
static void add(int *array, int n);
|
||
static void follow(unsigned int v);
|
||
static int unary(int x, int d);
|
||
static int node(int x, int l, int r);
|
||
static unsigned int cclenter(int x);
|
||
static unsigned int enter(int x);
|
||
|
||
static int yylex(void);
|
||
static int yyerror(char *);
|
||
|
||
|
||
/* Line 189 of yacc.c */
|
||
#line 171 "egrep.c"
|
||
|
||
/* Enabling traces. */
|
||
#ifndef YYDEBUG
|
||
# define YYDEBUG 0
|
||
#endif
|
||
|
||
/* Enabling verbose error messages. */
|
||
#ifdef YYERROR_VERBOSE
|
||
# undef YYERROR_VERBOSE
|
||
# define YYERROR_VERBOSE 1
|
||
#else
|
||
# define YYERROR_VERBOSE 0
|
||
#endif
|
||
|
||
/* Enabling the token table. */
|
||
#ifndef YYTOKEN_TABLE
|
||
# define YYTOKEN_TABLE 0
|
||
#endif
|
||
|
||
|
||
/* Tokens. */
|
||
#ifndef YYTOKENTYPE
|
||
# define YYTOKENTYPE
|
||
/* Put the tokens into the symbol table, so that GDB and other debuggers
|
||
know about them. */
|
||
enum yytokentype {
|
||
CHAR = 258,
|
||
DOT = 259,
|
||
CCL = 260,
|
||
NCCL = 261,
|
||
OR = 262,
|
||
CAT = 263,
|
||
STAR = 264,
|
||
PLUS = 265,
|
||
QUEST = 266
|
||
};
|
||
#endif
|
||
/* Tokens. */
|
||
#define CHAR 258
|
||
#define DOT 259
|
||
#define CCL 260
|
||
#define NCCL 261
|
||
#define OR 262
|
||
#define CAT 263
|
||
#define STAR 264
|
||
#define PLUS 265
|
||
#define QUEST 266
|
||
|
||
|
||
|
||
|
||
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
|
||
typedef int YYSTYPE;
|
||
# define YYSTYPE_IS_TRIVIAL 1
|
||
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
|
||
# define YYSTYPE_IS_DECLARED 1
|
||
#endif
|
||
|
||
|
||
/* Copy the second part of user declarations. */
|
||
|
||
|
||
/* Line 264 of yacc.c */
|
||
#line 235 "egrep.c"
|
||
|
||
#ifdef short
|
||
# undef short
|
||
#endif
|
||
|
||
#ifdef YYTYPE_UINT8
|
||
typedef YYTYPE_UINT8 yytype_uint8;
|
||
#else
|
||
typedef unsigned char yytype_uint8;
|
||
#endif
|
||
|
||
#ifdef YYTYPE_INT8
|
||
typedef YYTYPE_INT8 yytype_int8;
|
||
#elif (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
typedef signed char yytype_int8;
|
||
#else
|
||
typedef short int yytype_int8;
|
||
#endif
|
||
|
||
#ifdef YYTYPE_UINT16
|
||
typedef YYTYPE_UINT16 yytype_uint16;
|
||
#else
|
||
typedef unsigned short int yytype_uint16;
|
||
#endif
|
||
|
||
#ifdef YYTYPE_INT16
|
||
typedef YYTYPE_INT16 yytype_int16;
|
||
#else
|
||
typedef short int yytype_int16;
|
||
#endif
|
||
|
||
#ifndef YYSIZE_T
|
||
# ifdef __SIZE_TYPE__
|
||
# define YYSIZE_T __SIZE_TYPE__
|
||
# elif defined size_t
|
||
# define YYSIZE_T size_t
|
||
# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
||
# define YYSIZE_T size_t
|
||
# else
|
||
# define YYSIZE_T unsigned int
|
||
# endif
|
||
#endif
|
||
|
||
#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
|
||
|
||
#ifndef YY_
|
||
# if defined YYENABLE_NLS && YYENABLE_NLS
|
||
# if ENABLE_NLS
|
||
# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
|
||
# define YY_(msgid) dgettext ("bison-runtime", msgid)
|
||
# endif
|
||
# endif
|
||
# ifndef YY_
|
||
# define YY_(msgid) msgid
|
||
# endif
|
||
#endif
|
||
|
||
/* Suppress unused-variable warnings by "using" E. */
|
||
#if ! defined lint || defined __GNUC__
|
||
# define YYUSE(e) ((void) (e))
|
||
#else
|
||
# define YYUSE(e) /* empty */
|
||
#endif
|
||
|
||
/* Identity function, used to suppress warnings about constant conditions. */
|
||
#ifndef lint
|
||
# define YYID(n) (n)
|
||
#else
|
||
#if (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
static int
|
||
YYID (int yyi)
|
||
#else
|
||
static int
|
||
YYID (yyi)
|
||
int yyi;
|
||
#endif
|
||
{
|
||
return yyi;
|
||
}
|
||
#endif
|
||
|
||
#if ! defined yyoverflow || YYERROR_VERBOSE
|
||
|
||
/* The parser invokes alloca or malloc; define the necessary symbols. */
|
||
|
||
# ifdef YYSTACK_USE_ALLOCA
|
||
# if YYSTACK_USE_ALLOCA
|
||
# ifdef __GNUC__
|
||
# define YYSTACK_ALLOC __builtin_alloca
|
||
# elif defined __BUILTIN_VA_ARG_INCR
|
||
# include <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 _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
||
# ifndef _STDLIB_H
|
||
# define _STDLIB_H 1
|
||
# endif
|
||
# endif
|
||
# endif
|
||
# endif
|
||
# endif
|
||
|
||
# ifdef YYSTACK_ALLOC
|
||
/* Pacify GCC's `empty if-body' warning. */
|
||
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
|
||
# ifndef YYSTACK_ALLOC_MAXIMUM
|
||
/* The OS might guarantee only one guard page at the bottom of the stack,
|
||
and a page size can be as small as 4096 bytes. So we cannot safely
|
||
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
|
||
to allow for a few compiler-allocated temporary stack slots. */
|
||
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
|
||
# endif
|
||
# else
|
||
# define YYSTACK_ALLOC YYMALLOC
|
||
# define YYSTACK_FREE YYFREE
|
||
# ifndef YYSTACK_ALLOC_MAXIMUM
|
||
# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
|
||
# endif
|
||
# if (defined __cplusplus && ! defined _STDLIB_H \
|
||
&& ! ((defined YYMALLOC || defined malloc) \
|
||
&& (defined YYFREE || defined free)))
|
||
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
||
# ifndef _STDLIB_H
|
||
# define _STDLIB_H 1
|
||
# endif
|
||
# endif
|
||
# ifndef YYMALLOC
|
||
# define YYMALLOC malloc
|
||
# if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
|
||
# endif
|
||
# endif
|
||
# ifndef YYFREE
|
||
# define YYFREE free
|
||
# if ! defined free && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
void free (void *); /* INFRINGES ON USER NAME SPACE */
|
||
# endif
|
||
# endif
|
||
# endif
|
||
#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
|
||
|
||
|
||
#if (! defined yyoverflow \
|
||
&& (! defined __cplusplus \
|
||
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
|
||
|
||
/* A type that is properly aligned for any stack member. */
|
||
union yyalloc
|
||
{
|
||
yytype_int16 yyss_alloc;
|
||
YYSTYPE yyvs_alloc;
|
||
};
|
||
|
||
/* The size of the maximum gap between one aligned stack and the next. */
|
||
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
|
||
|
||
/* The size of an array large to enough to hold all stacks, each with
|
||
N elements. */
|
||
# define YYSTACK_BYTES(N) \
|
||
((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \
|
||
+ YYSTACK_GAP_MAXIMUM)
|
||
|
||
/* Copy COUNT objects from FROM to TO. The source and destination do
|
||
not overlap. */
|
||
# ifndef YYCOPY
|
||
# if defined __GNUC__ && 1 < __GNUC__
|
||
# define YYCOPY(To, From, Count) \
|
||
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
|
||
# else
|
||
# define YYCOPY(To, From, Count) \
|
||
do \
|
||
{ \
|
||
YYSIZE_T yyi; \
|
||
for (yyi = 0; yyi < (Count); yyi++) \
|
||
(To)[yyi] = (From)[yyi]; \
|
||
} \
|
||
while (YYID (0))
|
||
# endif
|
||
# endif
|
||
|
||
/* Relocate STACK from its old location to the new one. The
|
||
local variables YYSIZE and YYSTACKSIZE give the old and new number of
|
||
elements in the stack, and YYPTR gives the new location of the
|
||
stack. Advance YYPTR to a properly aligned location for the next
|
||
stack. */
|
||
# define YYSTACK_RELOCATE(Stack_alloc, Stack) \
|
||
do \
|
||
{ \
|
||
YYSIZE_T yynewbytes; \
|
||
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
|
||
Stack = &yyptr->Stack_alloc; \
|
||
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
|
||
yyptr += yynewbytes / sizeof (*yyptr); \
|
||
} \
|
||
while (YYID (0))
|
||
|
||
#endif
|
||
|
||
/* YYFINAL -- State number of the termination state. */
|
||
#define YYFINAL 6
|
||
/* YYLAST -- Last index in YYTABLE. */
|
||
#define YYLAST 108
|
||
|
||
/* YYNTOKENS -- Number of terminals. */
|
||
#define YYNTOKENS 14
|
||
/* YYNNTS -- Number of nonterminals. */
|
||
#define YYNNTS 5
|
||
/* YYNRULES -- Number of rules. */
|
||
#define YYNRULES 18
|
||
/* YYNRULES -- Number of states. */
|
||
#define YYNSTATES 25
|
||
|
||
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
|
||
#define YYUNDEFTOK 2
|
||
#define YYMAXUTOK 266
|
||
|
||
#define YYTRANSLATE(YYX) \
|
||
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
|
||
|
||
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
|
||
static const yytype_uint8 yytranslate[] =
|
||
{
|
||
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
12, 13, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 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
|
||
};
|
||
|
||
#if YYDEBUG
|
||
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
|
||
YYRHS. */
|
||
static const yytype_uint8 yyprhs[] =
|
||
{
|
||
0, 0, 3, 5, 8, 13, 17, 21, 22, 24,
|
||
26, 28, 30, 34, 37, 40, 43, 46, 50
|
||
};
|
||
|
||
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
|
||
static const yytype_int8 yyrhs[] =
|
||
{
|
||
15, 0, -1, 16, -1, 17, 18, -1, 7, 17,
|
||
18, 7, -1, 7, 17, 18, -1, 17, 18, 7,
|
||
-1, -1, 3, -1, 4, -1, 5, -1, 6, -1,
|
||
18, 7, 18, -1, 18, 18, -1, 18, 9, -1,
|
||
18, 10, -1, 18, 11, -1, 12, 18, 13, -1,
|
||
1, -1
|
||
};
|
||
|
||
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
|
||
static const yytype_uint8 yyrline[] =
|
||
{
|
||
0, 105, 105, 110, 112, 114, 116, 120, 123, 125,
|
||
127, 129, 133, 135, 137, 139, 141, 143, 145
|
||
};
|
||
#endif
|
||
|
||
#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
|
||
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
|
||
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
|
||
static const char *const yytname[] =
|
||
{
|
||
"$end", "error", "$undefined", "CHAR", "DOT", "CCL", "NCCL", "OR",
|
||
"CAT", "STAR", "PLUS", "QUEST", "'('", "')'", "$accept", "s", "t", "b",
|
||
"r", 0
|
||
};
|
||
#endif
|
||
|
||
# ifdef YYPRINT
|
||
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
|
||
token YYLEX-NUM. */
|
||
static const yytype_uint16 yytoknum[] =
|
||
{
|
||
0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
|
||
265, 266, 40, 41
|
||
};
|
||
# endif
|
||
|
||
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
|
||
static const yytype_uint8 yyr1[] =
|
||
{
|
||
0, 14, 15, 16, 16, 16, 16, 17, 18, 18,
|
||
18, 18, 18, 18, 18, 18, 18, 18, 18
|
||
};
|
||
|
||
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
|
||
static const yytype_uint8 yyr2[] =
|
||
{
|
||
0, 2, 1, 2, 4, 3, 3, 0, 1, 1,
|
||
1, 1, 3, 2, 2, 2, 2, 3, 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 yytype_uint8 yydefact[] =
|
||
{
|
||
7, 7, 0, 2, 0, 0, 1, 18, 8, 9,
|
||
10, 11, 0, 0, 0, 0, 0, 14, 15, 16,
|
||
0, 0, 0, 17, 0
|
||
};
|
||
|
||
/* YYDEFGOTO[NTERM-NUM]. */
|
||
static const yytype_int8 yydefgoto[] =
|
||
{
|
||
-1, 2, 3, 4, 20
|
||
};
|
||
|
||
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
||
STATE-NUM. */
|
||
#define YYPACT_NINF -5
|
||
static const yytype_int8 yypact[] =
|
||
{
|
||
2, -5, 3, -5, 1, 1, -5, -5, -5, -5,
|
||
-5, -5, 1, 47, 60, 72, 86, -5, -5, -5,
|
||
19, 96, 1, -5, 33
|
||
};
|
||
|
||
/* YYPGOTO[NTERM-NUM]. */
|
||
static const yytype_int8 yypgoto[] =
|
||
{
|
||
-5, -5, -5, 9, -4
|
||
};
|
||
|
||
/* 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, syntax error. */
|
||
#define YYTABLE_NINF -14
|
||
static const yytype_int8 yytable[] =
|
||
{
|
||
13, 14, 7, 6, 8, 9, 10, 11, 15, 1,
|
||
5, 0, 24, 12, 0, 0, 0, 24, 24, -13,
|
||
7, 0, -13, -13, -13, -13, -13, 0, 17, 18,
|
||
19, -13, -13, -12, 7, 0, 8, 9, 10, 11,
|
||
-12, 0, 17, 18, 19, 12, -12, -3, 7, 0,
|
||
8, 9, 10, 11, 16, 0, 17, 18, 19, 12,
|
||
-5, 7, 0, 8, 9, 10, 11, 21, 0, 17,
|
||
18, 19, 12, 7, 0, 8, 9, 10, 11, 22,
|
||
0, 17, 18, 19, 12, 23, -6, 7, 0, 8,
|
||
9, 10, 11, 0, 0, 0, -4, 7, 12, 8,
|
||
9, 10, 11, 0, 0, 0, 0, 0, 12
|
||
};
|
||
|
||
static const yytype_int8 yycheck[] =
|
||
{
|
||
4, 5, 1, 0, 3, 4, 5, 6, 12, 7,
|
||
1, -1, 16, 12, -1, -1, -1, 21, 22, 0,
|
||
1, -1, 3, 4, 5, 6, 7, -1, 9, 10,
|
||
11, 12, 13, 0, 1, -1, 3, 4, 5, 6,
|
||
7, -1, 9, 10, 11, 12, 13, 0, 1, -1,
|
||
3, 4, 5, 6, 7, -1, 9, 10, 11, 12,
|
||
0, 1, -1, 3, 4, 5, 6, 7, -1, 9,
|
||
10, 11, 12, 1, -1, 3, 4, 5, 6, 7,
|
||
-1, 9, 10, 11, 12, 13, 0, 1, -1, 3,
|
||
4, 5, 6, -1, -1, -1, 0, 1, 12, 3,
|
||
4, 5, 6, -1, -1, -1, -1, -1, 12
|
||
};
|
||
|
||
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
|
||
symbol of state STATE-NUM. */
|
||
static const yytype_uint8 yystos[] =
|
||
{
|
||
0, 7, 15, 16, 17, 17, 0, 1, 3, 4,
|
||
5, 6, 12, 18, 18, 18, 7, 9, 10, 11,
|
||
18, 7, 7, 13, 18
|
||
};
|
||
|
||
#define yyerrok (yyerrstatus = 0)
|
||
#define yyclearin (yychar = YYEMPTY)
|
||
#define YYEMPTY (-2)
|
||
#define YYEOF 0
|
||
|
||
#define YYACCEPT goto yyacceptlab
|
||
#define YYABORT goto yyabortlab
|
||
#define YYERROR goto yyerrorlab
|
||
|
||
|
||
/* Like YYERROR except do call yyerror. This remains here temporarily
|
||
to ease the transition to the new meaning of YYERROR, for GCC.
|
||
Once GCC version 2 has supplanted version 1, this can go. However,
|
||
YYFAIL appears to be in use. Nevertheless, it is formally deprecated
|
||
in Bison 2.4.2's NEWS entry, where a plan to phase it out is
|
||
discussed. */
|
||
|
||
#define YYFAIL goto yyerrlab
|
||
#if defined YYFAIL
|
||
/* This is here to suppress warnings from the GCC cpp's
|
||
-Wunused-macros. Normally we don't worry about that warning, but
|
||
some users do, and we want to make it easy for users to remove
|
||
YYFAIL uses, which will produce warnings from Bison 2.5. */
|
||
#endif
|
||
|
||
#define YYRECOVERING() (!!yyerrstatus)
|
||
|
||
#define YYBACKUP(Token, Value) \
|
||
do \
|
||
if (yychar == YYEMPTY && yylen == 1) \
|
||
{ \
|
||
yychar = (Token); \
|
||
yylval = (Value); \
|
||
yytoken = YYTRANSLATE (yychar); \
|
||
YYPOPSTACK (1); \
|
||
goto yybackup; \
|
||
} \
|
||
else \
|
||
{ \
|
||
yyerror (YY_("syntax error: cannot back up")); \
|
||
YYERROR; \
|
||
} \
|
||
while (YYID (0))
|
||
|
||
|
||
#define YYTERROR 1
|
||
#define YYERRCODE 256
|
||
|
||
|
||
/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
|
||
If N is 0, then set CURRENT to the empty location which ends
|
||
the previous symbol: RHS[0] (always defined). */
|
||
|
||
#define YYRHSLOC(Rhs, K) ((Rhs)[K])
|
||
#ifndef YYLLOC_DEFAULT
|
||
# define YYLLOC_DEFAULT(Current, Rhs, N) \
|
||
do \
|
||
if (YYID (N)) \
|
||
{ \
|
||
(Current).first_line = YYRHSLOC (Rhs, 1).first_line; \
|
||
(Current).first_column = YYRHSLOC (Rhs, 1).first_column; \
|
||
(Current).last_line = YYRHSLOC (Rhs, N).last_line; \
|
||
(Current).last_column = YYRHSLOC (Rhs, N).last_column; \
|
||
} \
|
||
else \
|
||
{ \
|
||
(Current).first_line = (Current).last_line = \
|
||
YYRHSLOC (Rhs, 0).last_line; \
|
||
(Current).first_column = (Current).last_column = \
|
||
YYRHSLOC (Rhs, 0).last_column; \
|
||
} \
|
||
while (YYID (0))
|
||
#endif
|
||
|
||
|
||
/* YY_LOCATION_PRINT -- Print the location on the stream.
|
||
This macro was not mandated originally: define only if we know
|
||
we won't break user code: when these are the locations we know. */
|
||
|
||
#ifndef YY_LOCATION_PRINT
|
||
# if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
|
||
# define YY_LOCATION_PRINT(File, Loc) \
|
||
fprintf (File, "%d.%d-%d.%d", \
|
||
(Loc).first_line, (Loc).first_column, \
|
||
(Loc).last_line, (Loc).last_column)
|
||
# else
|
||
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
|
||
# endif
|
||
#endif
|
||
|
||
|
||
/* YYLEX -- calling `yylex' with the right arguments. */
|
||
|
||
#ifdef YYLEX_PARAM
|
||
# define YYLEX yylex (YYLEX_PARAM)
|
||
#else
|
||
# define YYLEX yylex ()
|
||
#endif
|
||
|
||
/* 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 (YYID (0))
|
||
|
||
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
|
||
do { \
|
||
if (yydebug) \
|
||
{ \
|
||
YYFPRINTF (stderr, "%s ", Title); \
|
||
yy_symbol_print (stderr, \
|
||
Type, Value); \
|
||
YYFPRINTF (stderr, "\n"); \
|
||
} \
|
||
} while (YYID (0))
|
||
|
||
|
||
/*--------------------------------.
|
||
| Print this symbol on YYOUTPUT. |
|
||
`--------------------------------*/
|
||
|
||
/*ARGSUSED*/
|
||
#if (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
static void
|
||
yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
|
||
#else
|
||
static void
|
||
yy_symbol_value_print (yyoutput, yytype, yyvaluep)
|
||
FILE *yyoutput;
|
||
int yytype;
|
||
YYSTYPE const * const yyvaluep;
|
||
#endif
|
||
{
|
||
if (!yyvaluep)
|
||
return;
|
||
# ifdef YYPRINT
|
||
if (yytype < YYNTOKENS)
|
||
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
|
||
# else
|
||
YYUSE (yyoutput);
|
||
# endif
|
||
switch (yytype)
|
||
{
|
||
default:
|
||
break;
|
||
}
|
||
}
|
||
|
||
|
||
/*--------------------------------.
|
||
| Print this symbol on YYOUTPUT. |
|
||
`--------------------------------*/
|
||
|
||
#if (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
static void
|
||
yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
|
||
#else
|
||
static void
|
||
yy_symbol_print (yyoutput, yytype, yyvaluep)
|
||
FILE *yyoutput;
|
||
int yytype;
|
||
YYSTYPE const * const yyvaluep;
|
||
#endif
|
||
{
|
||
if (yytype < YYNTOKENS)
|
||
YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
|
||
else
|
||
YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
|
||
|
||
yy_symbol_value_print (yyoutput, yytype, yyvaluep);
|
||
YYFPRINTF (yyoutput, ")");
|
||
}
|
||
|
||
/*------------------------------------------------------------------.
|
||
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
|
||
| TOP (included). |
|
||
`------------------------------------------------------------------*/
|
||
|
||
#if (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
static void
|
||
yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
|
||
#else
|
||
static void
|
||
yy_stack_print (yybottom, yytop)
|
||
yytype_int16 *yybottom;
|
||
yytype_int16 *yytop;
|
||
#endif
|
||
{
|
||
YYFPRINTF (stderr, "Stack now");
|
||
for (; yybottom <= yytop; yybottom++)
|
||
{
|
||
int yybot = *yybottom;
|
||
YYFPRINTF (stderr, " %d", yybot);
|
||
}
|
||
YYFPRINTF (stderr, "\n");
|
||
}
|
||
|
||
# define YY_STACK_PRINT(Bottom, Top) \
|
||
do { \
|
||
if (yydebug) \
|
||
yy_stack_print ((Bottom), (Top)); \
|
||
} while (YYID (0))
|
||
|
||
|
||
/*------------------------------------------------.
|
||
| Report that the YYRULE is going to be reduced. |
|
||
`------------------------------------------------*/
|
||
|
||
#if (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
static void
|
||
yy_reduce_print (YYSTYPE *yyvsp, int yyrule)
|
||
#else
|
||
static void
|
||
yy_reduce_print (yyvsp, yyrule)
|
||
YYSTYPE *yyvsp;
|
||
int yyrule;
|
||
#endif
|
||
{
|
||
int yynrhs = yyr2[yyrule];
|
||
int yyi;
|
||
unsigned long int yylno = yyrline[yyrule];
|
||
YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
|
||
yyrule - 1, yylno);
|
||
/* The symbols being reduced. */
|
||
for (yyi = 0; yyi < yynrhs; yyi++)
|
||
{
|
||
YYFPRINTF (stderr, " $%d = ", yyi + 1);
|
||
yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
|
||
&(yyvsp[(yyi + 1) - (yynrhs)])
|
||
);
|
||
YYFPRINTF (stderr, "\n");
|
||
}
|
||
}
|
||
|
||
# define YY_REDUCE_PRINT(Rule) \
|
||
do { \
|
||
if (yydebug) \
|
||
yy_reduce_print (yyvsp, Rule); \
|
||
} while (YYID (0))
|
||
|
||
/* Nonzero means print parse trace. It is left uninitialized so that
|
||
multiple parsers can coexist. */
|
||
int yydebug;
|
||
#else /* !YYDEBUG */
|
||
# define YYDPRINTF(Args)
|
||
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
|
||
# define YY_STACK_PRINT(Bottom, Top)
|
||
# define YY_REDUCE_PRINT(Rule)
|
||
#endif /* !YYDEBUG */
|
||
|
||
|
||
/* YYINITDEPTH -- initial size of the parser's stacks. */
|
||
#ifndef YYINITDEPTH
|
||
# define YYINITDEPTH 200
|
||
#endif
|
||
|
||
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
|
||
if the built-in stack extension method is used).
|
||
|
||
Do not make this value too large; the results are undefined if
|
||
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
|
||
evaluated with infinite-precision integer arithmetic. */
|
||
|
||
#ifndef YYMAXDEPTH
|
||
# define YYMAXDEPTH 10000
|
||
#endif
|
||
|
||
|
||
|
||
#if YYERROR_VERBOSE
|
||
|
||
# ifndef yystrlen
|
||
# if defined __GLIBC__ && defined _STRING_H
|
||
# define yystrlen strlen
|
||
# else
|
||
/* Return the length of YYSTR. */
|
||
#if (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
static YYSIZE_T
|
||
yystrlen (const char *yystr)
|
||
#else
|
||
static YYSIZE_T
|
||
yystrlen (yystr)
|
||
const char *yystr;
|
||
#endif
|
||
{
|
||
YYSIZE_T yylen;
|
||
for (yylen = 0; yystr[yylen]; yylen++)
|
||
continue;
|
||
return yylen;
|
||
}
|
||
# endif
|
||
# endif
|
||
|
||
# ifndef yystpcpy
|
||
# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
|
||
# define yystpcpy stpcpy
|
||
# else
|
||
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
|
||
YYDEST. */
|
||
#if (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
static char *
|
||
yystpcpy (char *yydest, const char *yysrc)
|
||
#else
|
||
static char *
|
||
yystpcpy (yydest, yysrc)
|
||
char *yydest;
|
||
const char *yysrc;
|
||
#endif
|
||
{
|
||
char *yyd = yydest;
|
||
const char *yys = yysrc;
|
||
|
||
while ((*yyd++ = *yys++) != '\0')
|
||
continue;
|
||
|
||
return yyd - 1;
|
||
}
|
||
# endif
|
||
# endif
|
||
|
||
# ifndef yytnamerr
|
||
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
|
||
quotes and backslashes, so that it's suitable for yyerror. The
|
||
heuristic is that double-quoting is unnecessary unless the string
|
||
contains an apostrophe, a comma, or backslash (other than
|
||
backslash-backslash). YYSTR is taken from yytname. If YYRES is
|
||
null, do not copy; instead, return the length of what the result
|
||
would have been. */
|
||
static YYSIZE_T
|
||
yytnamerr (char *yyres, const char *yystr)
|
||
{
|
||
if (*yystr == '"')
|
||
{
|
||
YYSIZE_T yyn = 0;
|
||
char const *yyp = yystr;
|
||
|
||
for (;;)
|
||
switch (*++yyp)
|
||
{
|
||
case '\'':
|
||
case ',':
|
||
goto do_not_strip_quotes;
|
||
|
||
case '\\':
|
||
if (*++yyp != '\\')
|
||
goto do_not_strip_quotes;
|
||
/* Fall through. */
|
||
default:
|
||
if (yyres)
|
||
yyres[yyn] = *yyp;
|
||
yyn++;
|
||
break;
|
||
|
||
case '"':
|
||
if (yyres)
|
||
yyres[yyn] = '\0';
|
||
return yyn;
|
||
}
|
||
do_not_strip_quotes: ;
|
||
}
|
||
|
||
if (! yyres)
|
||
return yystrlen (yystr);
|
||
|
||
return yystpcpy (yyres, yystr) - yyres;
|
||
}
|
||
# endif
|
||
|
||
/* Copy into YYRESULT an error message about the unexpected token
|
||
YYCHAR while in state YYSTATE. Return the number of bytes copied,
|
||
including the terminating null byte. If YYRESULT is null, do not
|
||
copy anything; just return the number of bytes that would be
|
||
copied. As a special case, return 0 if an ordinary "syntax error"
|
||
message will do. Return YYSIZE_MAXIMUM if overflow occurs during
|
||
size calculation. */
|
||
static YYSIZE_T
|
||
yysyntax_error (char *yyresult, int yystate, int yychar)
|
||
{
|
||
int yyn = yypact[yystate];
|
||
|
||
if (! (YYPACT_NINF < yyn && yyn <= YYLAST))
|
||
return 0;
|
||
else
|
||
{
|
||
int yytype = YYTRANSLATE (yychar);
|
||
YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]);
|
||
YYSIZE_T yysize = yysize0;
|
||
YYSIZE_T yysize1;
|
||
int yysize_overflow = 0;
|
||
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
|
||
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
|
||
int yyx;
|
||
|
||
# if 0
|
||
/* This is so xgettext sees the translatable formats that are
|
||
constructed on the fly. */
|
||
YY_("syntax error, unexpected %s");
|
||
YY_("syntax error, unexpected %s, expecting %s");
|
||
YY_("syntax error, unexpected %s, expecting %s or %s");
|
||
YY_("syntax error, unexpected %s, expecting %s or %s or %s");
|
||
YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s");
|
||
# endif
|
||
char *yyfmt;
|
||
char const *yyf;
|
||
static char const yyunexpected[] = "syntax error, unexpected %s";
|
||
static char const yyexpecting[] = ", expecting %s";
|
||
static char const yyor[] = " or %s";
|
||
char yyformat[sizeof yyunexpected
|
||
+ sizeof yyexpecting - 1
|
||
+ ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2)
|
||
* (sizeof yyor - 1))];
|
||
char const *yyprefix = yyexpecting;
|
||
|
||
/* Start YYX at -YYN if negative to avoid negative indexes in
|
||
YYCHECK. */
|
||
int yyxbegin = yyn < 0 ? -yyn : 0;
|
||
|
||
/* Stay within bounds of both yycheck and yytname. */
|
||
int yychecklim = YYLAST - yyn + 1;
|
||
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
|
||
int yycount = 1;
|
||
|
||
yyarg[0] = yytname[yytype];
|
||
yyfmt = yystpcpy (yyformat, yyunexpected);
|
||
|
||
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
|
||
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
||
{
|
||
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
|
||
{
|
||
yycount = 1;
|
||
yysize = yysize0;
|
||
yyformat[sizeof yyunexpected - 1] = '\0';
|
||
break;
|
||
}
|
||
yyarg[yycount++] = yytname[yyx];
|
||
yysize1 = yysize + yytnamerr (0, yytname[yyx]);
|
||
yysize_overflow |= (yysize1 < yysize);
|
||
yysize = yysize1;
|
||
yyfmt = yystpcpy (yyfmt, yyprefix);
|
||
yyprefix = yyor;
|
||
}
|
||
|
||
yyf = YY_(yyformat);
|
||
yysize1 = yysize + yystrlen (yyf);
|
||
yysize_overflow |= (yysize1 < yysize);
|
||
yysize = yysize1;
|
||
|
||
if (yysize_overflow)
|
||
return YYSIZE_MAXIMUM;
|
||
|
||
if (yyresult)
|
||
{
|
||
/* Avoid sprintf, as that infringes on the user's name space.
|
||
Don't have undefined behavior even if the translation
|
||
produced a string with the wrong number of "%s"s. */
|
||
char *yyp = yyresult;
|
||
int yyi = 0;
|
||
while ((*yyp = *yyf) != '\0')
|
||
{
|
||
if (*yyp == '%' && yyf[1] == 's' && yyi < yycount)
|
||
{
|
||
yyp += yytnamerr (yyp, yyarg[yyi++]);
|
||
yyf += 2;
|
||
}
|
||
else
|
||
{
|
||
yyp++;
|
||
yyf++;
|
||
}
|
||
}
|
||
}
|
||
return yysize;
|
||
}
|
||
}
|
||
#endif /* YYERROR_VERBOSE */
|
||
|
||
|
||
/*-----------------------------------------------.
|
||
| Release the memory associated to this symbol. |
|
||
`-----------------------------------------------*/
|
||
|
||
/*ARGSUSED*/
|
||
#if (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
static void
|
||
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
|
||
#else
|
||
static void
|
||
yydestruct (yymsg, yytype, yyvaluep)
|
||
const char *yymsg;
|
||
int yytype;
|
||
YYSTYPE *yyvaluep;
|
||
#endif
|
||
{
|
||
YYUSE (yyvaluep);
|
||
|
||
if (!yymsg)
|
||
yymsg = "Deleting";
|
||
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
|
||
|
||
switch (yytype)
|
||
{
|
||
|
||
default:
|
||
break;
|
||
}
|
||
}
|
||
|
||
/* Prevent warnings from -Wmissing-prototypes. */
|
||
#ifdef YYPARSE_PARAM
|
||
#if defined __STDC__ || defined __cplusplus
|
||
int yyparse (void *YYPARSE_PARAM);
|
||
#else
|
||
int yyparse ();
|
||
#endif
|
||
#else /* ! YYPARSE_PARAM */
|
||
#if defined __STDC__ || defined __cplusplus
|
||
int yyparse (void);
|
||
#else
|
||
int yyparse ();
|
||
#endif
|
||
#endif /* ! YYPARSE_PARAM */
|
||
|
||
|
||
/* The lookahead symbol. */
|
||
int yychar;
|
||
|
||
/* The semantic value of the lookahead symbol. */
|
||
YYSTYPE yylval;
|
||
|
||
/* Number of syntax errors so far. */
|
||
int yynerrs;
|
||
|
||
|
||
|
||
/*-------------------------.
|
||
| yyparse or yypush_parse. |
|
||
`-------------------------*/
|
||
|
||
#ifdef YYPARSE_PARAM
|
||
#if (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
int
|
||
yyparse (void *YYPARSE_PARAM)
|
||
#else
|
||
int
|
||
yyparse (YYPARSE_PARAM)
|
||
void *YYPARSE_PARAM;
|
||
#endif
|
||
#else /* ! YYPARSE_PARAM */
|
||
#if (defined __STDC__ || defined __C99__FUNC__ \
|
||
|| defined __cplusplus || defined _MSC_VER)
|
||
int
|
||
yyparse (void)
|
||
#else
|
||
int
|
||
yyparse ()
|
||
|
||
#endif
|
||
#endif
|
||
{
|
||
|
||
|
||
int yystate;
|
||
/* Number of tokens to shift before error messages enabled. */
|
||
int yyerrstatus;
|
||
|
||
/* The stacks and their tools:
|
||
`yyss': related to states.
|
||
`yyvs': related to semantic values.
|
||
|
||
Refer to the stacks thru separate pointers, to allow yyoverflow
|
||
to reallocate them elsewhere. */
|
||
|
||
/* The state stack. */
|
||
yytype_int16 yyssa[YYINITDEPTH];
|
||
yytype_int16 *yyss;
|
||
yytype_int16 *yyssp;
|
||
|
||
/* The semantic value stack. */
|
||
YYSTYPE yyvsa[YYINITDEPTH];
|
||
YYSTYPE *yyvs;
|
||
YYSTYPE *yyvsp;
|
||
|
||
YYSIZE_T yystacksize;
|
||
|
||
int yyn;
|
||
int yyresult;
|
||
/* Lookahead token as an internal (translated) token number. */
|
||
int yytoken;
|
||
/* The variables used to return semantic value and location from the
|
||
action routines. */
|
||
YYSTYPE yyval;
|
||
|
||
#if YYERROR_VERBOSE
|
||
/* Buffer for error messages, and its allocated size. */
|
||
char yymsgbuf[128];
|
||
char *yymsg = yymsgbuf;
|
||
YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
|
||
#endif
|
||
|
||
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
|
||
|
||
/* The number of symbols on the RHS of the reduced rule.
|
||
Keep to zero when no symbol should be popped. */
|
||
int yylen = 0;
|
||
|
||
yytoken = 0;
|
||
yyss = yyssa;
|
||
yyvs = yyvsa;
|
||
yystacksize = YYINITDEPTH;
|
||
|
||
YYDPRINTF ((stderr, "Starting parse\n"));
|
||
|
||
yystate = 0;
|
||
yyerrstatus = 0;
|
||
yynerrs = 0;
|
||
yychar = YYEMPTY; /* Cause a token to be read. */
|
||
|
||
/* Initialize stack pointers.
|
||
Waste one element of value and location stack
|
||
so that they stay on the same level as the state stack.
|
||
The wasted elements are never initialized. */
|
||
yyssp = yyss;
|
||
yyvsp = yyvs;
|
||
|
||
goto yysetstate;
|
||
|
||
/*------------------------------------------------------------.
|
||
| yynewstate -- Push a new state, which is found in yystate. |
|
||
`------------------------------------------------------------*/
|
||
yynewstate:
|
||
/* In all cases, when you get here, the value and location stacks
|
||
have just been pushed. So pushing a state here evens the stacks. */
|
||
yyssp++;
|
||
|
||
yysetstate:
|
||
*yyssp = yystate;
|
||
|
||
if (yyss + yystacksize - 1 <= yyssp)
|
||
{
|
||
/* Get the current used size of the three stacks, in elements. */
|
||
YYSIZE_T yysize = yyssp - yyss + 1;
|
||
|
||
#ifdef yyoverflow
|
||
{
|
||
/* Give user a chance to reallocate the stack. Use copies of
|
||
these so that the &'s don't force the real ones into
|
||
memory. */
|
||
YYSTYPE *yyvs1 = yyvs;
|
||
yytype_int16 *yyss1 = yyss;
|
||
|
||
/* Each stack pointer address is followed by the size of the
|
||
data in use in that stack, in bytes. This used to be a
|
||
conditional around just the two extra args, but that might
|
||
be undefined if yyoverflow is a macro. */
|
||
yyoverflow (YY_("memory exhausted"),
|
||
&yyss1, yysize * sizeof (*yyssp),
|
||
&yyvs1, yysize * sizeof (*yyvsp),
|
||
&yystacksize);
|
||
|
||
yyss = yyss1;
|
||
yyvs = yyvs1;
|
||
}
|
||
#else /* no yyoverflow */
|
||
# ifndef YYSTACK_RELOCATE
|
||
goto yyexhaustedlab;
|
||
# else
|
||
/* Extend the stack our own way. */
|
||
if (YYMAXDEPTH <= yystacksize)
|
||
goto yyexhaustedlab;
|
||
yystacksize *= 2;
|
||
if (YYMAXDEPTH < yystacksize)
|
||
yystacksize = YYMAXDEPTH;
|
||
|
||
{
|
||
yytype_int16 *yyss1 = yyss;
|
||
union yyalloc *yyptr =
|
||
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
|
||
if (! yyptr)
|
||
goto yyexhaustedlab;
|
||
YYSTACK_RELOCATE (yyss_alloc, yyss);
|
||
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
|
||
# 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 (yyss + yystacksize - 1 <= yyssp)
|
||
YYABORT;
|
||
}
|
||
|
||
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
|
||
|
||
if (yystate == YYFINAL)
|
||
YYACCEPT;
|
||
|
||
goto yybackup;
|
||
|
||
/*-----------.
|
||
| yybackup. |
|
||
`-----------*/
|
||
yybackup:
|
||
|
||
/* Do appropriate processing given the current state. Read a
|
||
lookahead token if we need one and don't already have one. */
|
||
|
||
/* First try to decide what to do without reference to lookahead token. */
|
||
yyn = yypact[yystate];
|
||
if (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 lookahead symbol. */
|
||
if (yychar == YYEMPTY)
|
||
{
|
||
YYDPRINTF ((stderr, "Reading a token: "));
|
||
yychar = YYLEX;
|
||
}
|
||
|
||
if (yychar <= YYEOF)
|
||
{
|
||
yychar = yytoken = YYEOF;
|
||
YYDPRINTF ((stderr, "Now at end of input.\n"));
|
||
}
|
||
else
|
||
{
|
||
yytoken = YYTRANSLATE (yychar);
|
||
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
|
||
}
|
||
|
||
/* If the proper action on seeing token YYTOKEN is to reduce or to
|
||
detect an error, take that action. */
|
||
yyn += yytoken;
|
||
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
|
||
goto yydefault;
|
||
yyn = yytable[yyn];
|
||
if (yyn <= 0)
|
||
{
|
||
if (yyn == 0 || yyn == YYTABLE_NINF)
|
||
goto yyerrlab;
|
||
yyn = -yyn;
|
||
goto yyreduce;
|
||
}
|
||
|
||
/* Count tokens shifted since error; after three, turn off error
|
||
status. */
|
||
if (yyerrstatus)
|
||
yyerrstatus--;
|
||
|
||
/* Shift the lookahead token. */
|
||
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
|
||
|
||
/* Discard the shifted token. */
|
||
yychar = YYEMPTY;
|
||
|
||
yystate = yyn;
|
||
*++yyvsp = yylval;
|
||
|
||
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:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 106 "egrep.y"
|
||
{ unary(FINAL, (yyvsp[(1) - (1)]));
|
||
line--;
|
||
}
|
||
break;
|
||
|
||
case 3:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 111 "egrep.y"
|
||
{ (yyval) = node(CAT, (yyvsp[(1) - (2)]), (yyvsp[(2) - (2)])); }
|
||
break;
|
||
|
||
case 4:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 113 "egrep.y"
|
||
{ (yyval) = node(CAT, (yyvsp[(2) - (4)]), (yyvsp[(3) - (4)])); }
|
||
break;
|
||
|
||
case 5:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 115 "egrep.y"
|
||
{ (yyval) = node(CAT, (yyvsp[(2) - (3)]), (yyvsp[(3) - (3)])); }
|
||
break;
|
||
|
||
case 6:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 117 "egrep.y"
|
||
{ (yyval) = node(CAT, (yyvsp[(1) - (3)]), (yyvsp[(2) - (3)])); }
|
||
break;
|
||
|
||
case 7:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 120 "egrep.y"
|
||
{ (yyval) = enter(DOT);
|
||
(yyval) = unary(STAR, (yyval)); }
|
||
break;
|
||
|
||
case 8:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 124 "egrep.y"
|
||
{ (yyval) = enter((yyvsp[(1) - (1)])); }
|
||
break;
|
||
|
||
case 9:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 126 "egrep.y"
|
||
{ (yyval) = enter(DOT); }
|
||
break;
|
||
|
||
case 10:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 128 "egrep.y"
|
||
{ (yyval) = cclenter(CCL); }
|
||
break;
|
||
|
||
case 11:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 130 "egrep.y"
|
||
{ (yyval) = cclenter(NCCL); }
|
||
break;
|
||
|
||
case 12:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 134 "egrep.y"
|
||
{ (yyval) = node(OR, (yyvsp[(1) - (3)]), (yyvsp[(3) - (3)])); }
|
||
break;
|
||
|
||
case 13:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 136 "egrep.y"
|
||
{ (yyval) = node(CAT, (yyvsp[(1) - (2)]), (yyvsp[(2) - (2)])); }
|
||
break;
|
||
|
||
case 14:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 138 "egrep.y"
|
||
{ (yyval) = unary(STAR, (yyvsp[(1) - (2)])); }
|
||
break;
|
||
|
||
case 15:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 140 "egrep.y"
|
||
{ (yyval) = unary(PLUS, (yyvsp[(1) - (2)])); }
|
||
break;
|
||
|
||
case 16:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 142 "egrep.y"
|
||
{ (yyval) = unary(QUEST, (yyvsp[(1) - (2)])); }
|
||
break;
|
||
|
||
case 17:
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 144 "egrep.y"
|
||
{ (yyval) = (yyvsp[(2) - (3)]); }
|
||
break;
|
||
|
||
|
||
|
||
/* Line 1464 of yacc.c */
|
||
#line 1574 "egrep.c"
|
||
default: break;
|
||
}
|
||
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
|
||
|
||
YYPOPSTACK (yylen);
|
||
yylen = 0;
|
||
YY_STACK_PRINT (yyss, yyssp);
|
||
|
||
*++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
|
||
yyerror (YY_("syntax error"));
|
||
#else
|
||
{
|
||
YYSIZE_T yysize = yysyntax_error (0, yystate, yychar);
|
||
if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM)
|
||
{
|
||
YYSIZE_T yyalloc = 2 * yysize;
|
||
if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM))
|
||
yyalloc = YYSTACK_ALLOC_MAXIMUM;
|
||
if (yymsg != yymsgbuf)
|
||
YYSTACK_FREE (yymsg);
|
||
yymsg = (char *) YYSTACK_ALLOC (yyalloc);
|
||
if (yymsg)
|
||
yymsg_alloc = yyalloc;
|
||
else
|
||
{
|
||
yymsg = yymsgbuf;
|
||
yymsg_alloc = sizeof yymsgbuf;
|
||
}
|
||
}
|
||
|
||
if (0 < yysize && yysize <= yymsg_alloc)
|
||
{
|
||
(void) yysyntax_error (yymsg, yystate, yychar);
|
||
yyerror (yymsg);
|
||
}
|
||
else
|
||
{
|
||
yyerror (YY_("syntax error"));
|
||
if (yysize != 0)
|
||
goto yyexhaustedlab;
|
||
}
|
||
}
|
||
#endif
|
||
}
|
||
|
||
|
||
|
||
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);
|
||
yychar = YYEMPTY;
|
||
}
|
||
}
|
||
|
||
/* Else will try to reuse lookahead token after shifting the error
|
||
token. */
|
||
goto yyerrlab1;
|
||
|
||
|
||
/*---------------------------------------------------.
|
||
| yyerrorlab -- error raised explicitly by YYERROR. |
|
||
`---------------------------------------------------*/
|
||
yyerrorlab:
|
||
|
||
/* Pacify compilers like GCC when the user code never invokes
|
||
YYERROR and the label yyerrorlab therefore never appears in user
|
||
code. */
|
||
if (/*CONSTCOND*/ 0)
|
||
goto yyerrorlab;
|
||
|
||
/* Do not reclaim the symbols of the rule which action triggered
|
||
this YYERROR. */
|
||
YYPOPSTACK (yylen);
|
||
yylen = 0;
|
||
YY_STACK_PRINT (yyss, yyssp);
|
||
yystate = *yyssp;
|
||
goto yyerrlab1;
|
||
|
||
|
||
/*-------------------------------------------------------------.
|
||
| yyerrlab1 -- common code for both syntax error and YYERROR. |
|
||
`-------------------------------------------------------------*/
|
||
yyerrlab1:
|
||
yyerrstatus = 3; /* Each real token shifted decrements this. */
|
||
|
||
for (;;)
|
||
{
|
||
yyn = yypact[yystate];
|
||
if (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;
|
||
|
||
|
||
yydestruct ("Error: popping",
|
||
yystos[yystate], yyvsp);
|
||
YYPOPSTACK (1);
|
||
yystate = *yyssp;
|
||
YY_STACK_PRINT (yyss, yyssp);
|
||
}
|
||
|
||
*++yyvsp = yylval;
|
||
|
||
|
||
/* Shift the error token. */
|
||
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
|
||
|
||
yystate = yyn;
|
||
goto yynewstate;
|
||
|
||
|
||
/*-------------------------------------.
|
||
| yyacceptlab -- YYACCEPT comes here. |
|
||
`-------------------------------------*/
|
||
yyacceptlab:
|
||
yyresult = 0;
|
||
goto yyreturn;
|
||
|
||
/*-----------------------------------.
|
||
| yyabortlab -- YYABORT comes here. |
|
||
`-----------------------------------*/
|
||
yyabortlab:
|
||
yyresult = 1;
|
||
goto yyreturn;
|
||
|
||
#if !defined(yyoverflow) || YYERROR_VERBOSE
|
||
/*-------------------------------------------------.
|
||
| yyexhaustedlab -- memory exhaustion comes here. |
|
||
`-------------------------------------------------*/
|
||
yyexhaustedlab:
|
||
yyerror (YY_("memory exhausted"));
|
||
yyresult = 2;
|
||
/* Fall through. */
|
||
#endif
|
||
|
||
yyreturn:
|
||
if (yychar != YYEMPTY)
|
||
yydestruct ("Cleanup: discarding lookahead",
|
||
yytoken, &yylval);
|
||
/* Do not reclaim the symbols of the rule which action triggered
|
||
this YYABORT or YYACCEPT. */
|
||
YYPOPSTACK (yylen);
|
||
YY_STACK_PRINT (yyss, yyssp);
|
||
while (yyssp != yyss)
|
||
{
|
||
yydestruct ("Cleanup: popping",
|
||
yystos[*yyssp], yyvsp);
|
||
YYPOPSTACK (1);
|
||
}
|
||
#ifndef yyoverflow
|
||
if (yyss != yyssa)
|
||
YYSTACK_FREE (yyss);
|
||
#endif
|
||
#if YYERROR_VERBOSE
|
||
if (yymsg != yymsgbuf)
|
||
YYSTACK_FREE (yymsg);
|
||
#endif
|
||
/* Make sure YYID is used. */
|
||
return YYID (yyresult);
|
||
}
|
||
|
||
|
||
|
||
/* Line 1684 of yacc.c */
|
||
#line 148 "egrep.y"
|
||
|
||
static int
|
||
yyerror(char *s)
|
||
{
|
||
message = s;
|
||
longjmp(env, 1);
|
||
return 1; /* silence a warning */
|
||
}
|
||
|
||
static int
|
||
yylex(void)
|
||
{
|
||
int cclcnt, x;
|
||
char c, d;
|
||
|
||
switch(c = nextch()) {
|
||
case '|':
|
||
return (OR);
|
||
case '*':
|
||
return (STAR);
|
||
case '+':
|
||
return (PLUS);
|
||
case '?':
|
||
return (QUEST);
|
||
case '(':
|
||
return (c);
|
||
case ')':
|
||
return (c);
|
||
case '.':
|
||
return (DOT);
|
||
case '\0':
|
||
return (0);
|
||
case '\n':
|
||
return (OR);
|
||
case '[':
|
||
x = CCL;
|
||
cclcnt = 0;
|
||
count = nxtchar++;
|
||
if ((c = nextch()) == '^') {
|
||
x = NCCL;
|
||
c = nextch();
|
||
}
|
||
do {
|
||
if (c == '\0')
|
||
synerror();
|
||
if (c == '-'
|
||
&& cclcnt > 0
|
||
&& chars[nxtchar-1] != 0) {
|
||
if ((d = nextch()) != 0) {
|
||
c = chars[nxtchar-1];
|
||
while ((unsigned int)c < (unsigned int)d) {
|
||
if (nxtchar >= MAXLIN)
|
||
overflo();
|
||
chars[nxtchar++] = ++c;
|
||
cclcnt++;
|
||
}
|
||
continue;
|
||
} /* if() */
|
||
} /* if() */
|
||
if (nxtchar >= MAXLIN)
|
||
overflo();
|
||
chars[nxtchar++] = c;
|
||
cclcnt++;
|
||
} while ((c = nextch()) != ']');
|
||
chars[count] = cclcnt;
|
||
return (x);
|
||
case '\\':
|
||
if ((c = nextch()) == '\0')
|
||
synerror();
|
||
/* not reached */
|
||
case '$':
|
||
case '^':
|
||
c = '\n';
|
||
/* fall through */
|
||
default:
|
||
yylval = c;
|
||
return (CHAR);
|
||
}
|
||
}
|
||
|
||
static void
|
||
synerror(void)
|
||
{
|
||
yyerror("Syntax error");
|
||
}
|
||
|
||
static unsigned int
|
||
enter(int x)
|
||
{
|
||
if(line >= MAXLIN)
|
||
overflo();
|
||
name[line] = x;
|
||
left[line] = 0;
|
||
right[line] = 0;
|
||
return(line++);
|
||
}
|
||
|
||
static unsigned int
|
||
cclenter(int x)
|
||
{
|
||
unsigned int linno;
|
||
|
||
linno = enter(x);
|
||
right[linno] = count;
|
||
return (linno);
|
||
}
|
||
|
||
static int
|
||
node(int x, int l, int r)
|
||
{
|
||
if(line >= MAXLIN)
|
||
overflo();
|
||
name[line] = x;
|
||
left[line] = l;
|
||
right[line] = r;
|
||
parent[l] = line;
|
||
parent[r] = line;
|
||
return(line++);
|
||
}
|
||
|
||
static int
|
||
unary(int x, int d)
|
||
{
|
||
if(line >= MAXLIN)
|
||
overflo();
|
||
name[line] = x;
|
||
left[line] = d;
|
||
right[line] = 0;
|
||
parent[d] = line;
|
||
return(line++);
|
||
}
|
||
|
||
static void
|
||
overflo(void)
|
||
{
|
||
yyerror("internal table overflow");
|
||
}
|
||
|
||
static void
|
||
cfoll(int v)
|
||
{
|
||
unsigned int i;
|
||
|
||
if (left[v] == 0) {
|
||
count = 0;
|
||
for (i = 1; i <= line; i++)
|
||
tmpstat[i] = 0;
|
||
follow(v);
|
||
add(foll, v);
|
||
} else if (right[v] == 0)
|
||
cfoll(left[v]);
|
||
else {
|
||
cfoll(left[v]);
|
||
cfoll(right[v]);
|
||
}
|
||
}
|
||
|
||
static void
|
||
cgotofn(void)
|
||
{
|
||
unsigned int i, n, s;
|
||
int c, k;
|
||
char symbol[NCHARS];
|
||
unsigned int j, l, pc, pos;
|
||
unsigned int nc;
|
||
int curpos;
|
||
unsigned int num, number, newpos;
|
||
|
||
count = 0;
|
||
for (n=3; n<=line; n++)
|
||
tmpstat[n] = 0;
|
||
if (cstate(line-1)==0) {
|
||
tmpstat[line] = 1;
|
||
count++;
|
||
out[0] = 1;
|
||
}
|
||
for (n=3; n<=line; n++)
|
||
initstat[n] = tmpstat[n];
|
||
count--; /*leave out position 1 */
|
||
icount = count;
|
||
tmpstat[1] = 0;
|
||
add(state, 0);
|
||
n = 0;
|
||
for (s = 0; s <= n; s++) {
|
||
if (out[s] == 1)
|
||
continue;
|
||
for (i = 0; i < NCHARS; i++)
|
||
symbol[i] = 0;
|
||
num = positions[state[s]];
|
||
count = icount;
|
||
for (i = 3; i <= line; i++)
|
||
tmpstat[i] = initstat[i];
|
||
pos = state[s] + 1;
|
||
for (i = 0; i < num; i++) {
|
||
curpos = positions[pos];
|
||
if ((c = name[curpos]) >= 0) {
|
||
if (c < NCHARS) {
|
||
symbol[c] = 1;
|
||
} else if (c == DOT) {
|
||
for (k = 0; k < NCHARS; k++)
|
||
if (k != '\n')
|
||
symbol[k] = 1;
|
||
} else if (c == CCL) {
|
||
nc = chars[right[curpos]];
|
||
pc = right[curpos] + 1;
|
||
for (j = 0; j < nc; j++)
|
||
symbol[(unsigned char)(chars[pc++])] = 1;
|
||
} else if (c == NCCL) {
|
||
nc = chars[right[curpos]];
|
||
for (j = 0; j < NCHARS; j++) {
|
||
pc = right[curpos] + 1;
|
||
for (l = 0; l < nc; l++)
|
||
if (j==(unsigned char)(chars[pc++]))
|
||
goto cont;
|
||
if (j != '\n')
|
||
symbol[j] = 1;
|
||
cont:
|
||
;
|
||
}
|
||
}
|
||
}
|
||
pos++;
|
||
} /* for (i) */
|
||
for (c=0; c<NCHARS; c++) {
|
||
if (symbol[c] == 1) {
|
||
/* nextstate(s,c) */
|
||
count = icount;
|
||
for (i=3; i <= line; i++)
|
||
tmpstat[i] = initstat[i];
|
||
pos = state[s] + 1;
|
||
for (i=0; i<num; i++) {
|
||
curpos = positions[pos];
|
||
if ((k = name[curpos]) >= 0)
|
||
if ((k == c)
|
||
|| (k == DOT)
|
||
|| (k == CCL && member(c, right[curpos], 1))
|
||
|| (k == NCCL && member(c, right[curpos], 0))
|
||
) {
|
||
number = positions[foll[curpos]];
|
||
newpos = foll[curpos] + 1;
|
||
for (j = 0; j < number; j++) {
|
||
if (tmpstat[positions[newpos]] != 1) {
|
||
tmpstat[positions[newpos]] = 1;
|
||
count++;
|
||
}
|
||
newpos++;
|
||
}
|
||
}
|
||
pos++;
|
||
} /* end nextstate */
|
||
if (notin(n)) {
|
||
if (n >= NSTATES)
|
||
overflo();
|
||
add(state, ++n);
|
||
if (tmpstat[line] == 1)
|
||
out[n] = 1;
|
||
gotofn[s][c] = n;
|
||
} else {
|
||
gotofn[s][c] = xstate;
|
||
}
|
||
} /* if (symbol) */
|
||
} /* for(c) */
|
||
} /* for(s) */
|
||
}
|
||
|
||
static int
|
||
cstate(int v)
|
||
{
|
||
int b;
|
||
if (left[v] == 0) {
|
||
if (tmpstat[v] != 1) {
|
||
tmpstat[v] = 1;
|
||
count++;
|
||
}
|
||
return(1);
|
||
}
|
||
else if (right[v] == 0) {
|
||
if (cstate(left[v]) == 0) return (0);
|
||
else if (name[v] == PLUS) return (1);
|
||
else return (0);
|
||
}
|
||
else if (name[v] == CAT) {
|
||
if (cstate(left[v]) == 0 && cstate(right[v]) == 0) return (0);
|
||
else return (1);
|
||
}
|
||
else { /* name[v] == OR */
|
||
b = cstate(right[v]);
|
||
if (cstate(left[v]) == 0 || b == 0) return (0);
|
||
else return (1);
|
||
}
|
||
}
|
||
|
||
static int
|
||
member(int symb, int set, int torf)
|
||
{
|
||
unsigned int i, num, pos;
|
||
|
||
num = chars[set];
|
||
pos = set + 1;
|
||
for (i = 0; i < num; i++)
|
||
if (symb == (unsigned char)(chars[pos++]))
|
||
return (torf);
|
||
return (!torf);
|
||
}
|
||
|
||
static int
|
||
notin(int n)
|
||
{
|
||
int i, j, pos;
|
||
for (i=0; i<=n; i++) {
|
||
if (positions[state[i]] == count) {
|
||
pos = state[i] + 1;
|
||
for (j=0; j < count; j++)
|
||
if (tmpstat[positions[pos++]] != 1) goto nxt;
|
||
xstate = i;
|
||
return (0);
|
||
}
|
||
nxt: ;
|
||
}
|
||
return (1);
|
||
}
|
||
|
||
static void
|
||
add(int *array, int n)
|
||
{
|
||
unsigned int i;
|
||
|
||
if (nxtpos + count > MAXPOS)
|
||
overflo();
|
||
array[n] = nxtpos;
|
||
positions[nxtpos++] = count;
|
||
for (i=3; i <= line; i++) {
|
||
if (tmpstat[i] == 1) {
|
||
positions[nxtpos++] = i;
|
||
}
|
||
}
|
||
}
|
||
|
||
static void
|
||
follow(unsigned int v)
|
||
{
|
||
unsigned int p;
|
||
|
||
if (v == line)
|
||
return;
|
||
p = parent[v];
|
||
switch(name[p]) {
|
||
case STAR:
|
||
case PLUS: cstate(v);
|
||
follow(p);
|
||
return;
|
||
|
||
case OR:
|
||
case QUEST: follow(p);
|
||
return;
|
||
|
||
case CAT:
|
||
if (v == left[p]) {
|
||
if (cstate(right[p]) == 0) {
|
||
follow(p);
|
||
return;
|
||
}
|
||
} else
|
||
follow(p);
|
||
return;
|
||
case FINAL:
|
||
if (tmpstat[line] != 1) {
|
||
tmpstat[line] = 1;
|
||
count++;
|
||
}
|
||
return;
|
||
}
|
||
}
|
||
|
||
char *
|
||
egrepinit(char *egreppat)
|
||
{
|
||
/* initialize the global data */
|
||
memset(gotofn, 0, sizeof(gotofn));
|
||
memset(state, 0, sizeof(state));
|
||
memset(out, 0, sizeof(out));
|
||
line = 1;
|
||
memset(name, 0, sizeof(name));
|
||
memset(left, 0, sizeof(left));
|
||
memset(right, 0, sizeof(right));
|
||
memset(parent, 0, sizeof(parent));
|
||
memset(foll, 0, sizeof(foll));
|
||
memset(positions, 0, sizeof(positions));
|
||
memset(chars, 0, sizeof(chars));
|
||
nxtpos = 0;
|
||
nxtchar = 0;
|
||
memset(tmpstat, 0, sizeof(tmpstat));
|
||
memset(initstat, 0, sizeof(initstat));
|
||
xstate = 0;
|
||
count = 0;
|
||
icount = 0;
|
||
input = egreppat;
|
||
message = NULL;
|
||
if (setjmp(env) == 0) {
|
||
yyparse();
|
||
cfoll(line-1);
|
||
cgotofn();
|
||
}
|
||
return(message);
|
||
}
|
||
|
||
int
|
||
egrep(char *file, FILE *output, char *format)
|
||
{
|
||
char *p;
|
||
unsigned int cstat;
|
||
int ccount;
|
||
char buf[2*BUFSIZ];
|
||
char *nlp;
|
||
unsigned int istat;
|
||
int in_line;
|
||
FILE *fptr;
|
||
|
||
if ((fptr = myfopen(file, "r")) == NULL)
|
||
return(-1);
|
||
|
||
ccount = 0;
|
||
lnum = 1;
|
||
in_line = 0;
|
||
p = buf;
|
||
nlp = p;
|
||
if ((ccount = fread(p, sizeof(char), BUFSIZ, fptr)) <= 0)
|
||
goto done;
|
||
in_line = 1;
|
||
istat = cstat = (unsigned int) gotofn[0]['\n'];
|
||
if (out[cstat])
|
||
goto found;
|
||
for (;;) {
|
||
if (!iflag)
|
||
cstat = (unsigned int) gotofn[cstat][(unsigned int)*p&0377];
|
||
/* all input chars made positive */
|
||
else
|
||
cstat = (unsigned int) gotofn[cstat][tolower((int)*p&0377)];
|
||
/* for -i option*/
|
||
if (out[cstat]) {
|
||
found:
|
||
for(;;) {
|
||
if (*p++ == '\n') {
|
||
in_line = 0;
|
||
succeed:
|
||
fprintf(output, format, file, lnum);
|
||
if (p <= nlp) {
|
||
while (nlp < &buf[2*BUFSIZ])
|
||
putc(*nlp++, output);
|
||
nlp = buf;
|
||
}
|
||
while (nlp < p)
|
||
putc(*nlp++, output);
|
||
lnum++;
|
||
nlp = p;
|
||
if ((out[(cstat=istat)]) == 0)
|
||
goto brk2;
|
||
} /* if (p++ == \n) */
|
||
cfound:
|
||
if (--ccount <= 0) {
|
||
if (p <= &buf[BUFSIZ]) {
|
||
ccount = fread(p, sizeof(char), BUFSIZ, fptr);
|
||
} else if (p == &buf[2*BUFSIZ]) {
|
||
p = buf;
|
||
ccount = fread(p, sizeof(char), BUFSIZ, fptr);
|
||
} else {
|
||
ccount = fread(p, sizeof(char), &buf[2*BUFSIZ] - p,
|
||
fptr);
|
||
}
|
||
if (ccount <= 0) {
|
||
if (in_line) {
|
||
in_line = 0;
|
||
goto succeed;
|
||
}
|
||
goto done;
|
||
}
|
||
} /* if(ccount <= 0) */
|
||
in_line = 1;
|
||
} /* for(ever) */
|
||
} /* if(out[cstat]) */
|
||
|
||
if (*p++ == '\n') {
|
||
in_line = 0;
|
||
lnum++;
|
||
nlp = p;
|
||
if (out[(cstat=istat)])
|
||
goto cfound;
|
||
}
|
||
brk2:
|
||
if (--ccount <= 0) {
|
||
if (p <= &buf[BUFSIZ]) {
|
||
ccount = fread(p, sizeof(char), BUFSIZ, fptr);
|
||
} else if (p == &buf[2*BUFSIZ]) {
|
||
p = buf;
|
||
ccount = fread(p, sizeof(char), BUFSIZ, fptr);
|
||
} else {
|
||
ccount = fread(p, sizeof(char), &buf[2*BUFSIZ] - p, fptr);
|
||
}
|
||
if (ccount <= 0)
|
||
break;
|
||
}
|
||
in_line = 1;
|
||
}
|
||
done:
|
||
fclose(fptr);
|
||
return(0);
|
||
}
|
||
|
||
/* FIXME HBB: should export this to a separate file and use
|
||
* AC_REPLACE_FUNCS() */
|
||
#if !STDC_HEADERS && !defined(HAVE_MEMSET) && !defined(HAVE_MEMORY_H)
|
||
/*LINTLIBRARY*/
|
||
/*
|
||
* Set an array of n chars starting at sp to the character c.
|
||
* Return sp.
|
||
*/
|
||
char *
|
||
memset(char *sp, char c, int n)
|
||
{
|
||
char *sp0 = sp;
|
||
|
||
while (--n >= 0)
|
||
*sp++ = c;
|
||
return (sp0);
|
||
}
|
||
#endif
|
||
|
||
void
|
||
egrepcaseless(int i)
|
||
{
|
||
iflag = i; /* simulate "egrep -i" */
|
||
}
|
||
|