Imported Upstream version 2.5.31

1 files changed, 2103 insertions, 0 deletions

diff --git a/parse.c b/parse.c
new file mode 100644
index 0000000..8e959c2
--- /dev/null
+++ b/parse.c
@@ -0,0 +1,2103 @@
+
+/*  A Bison parser, made from parse.y
+    by GNU Bison version 1.28  */
+
+#define YYBISON 1  /* Identify Bison output.  */
+
+#define	CHAR	257
+#define	NUMBER	258
+#define	SECTEND	259
+#define	SCDECL	260
+#define	XSCDECL	261
+#define	NAME	262
+#define	PREVCCL	263
+#define	EOF_OP	264
+#define	OPTION_OP	265
+#define	OPT_OUTFILE	266
+#define	OPT_PREFIX	267
+#define	OPT_YYCLASS	268
+#define	OPT_HEADER	269
+#define	OPT_TABLES	270
+#define	CCE_ALNUM	271
+#define	CCE_ALPHA	272
+#define	CCE_BLANK	273
+#define	CCE_CNTRL	274
+#define	CCE_DIGIT	275
+#define	CCE_GRAPH	276
+#define	CCE_LOWER	277
+#define	CCE_PRINT	278
+#define	CCE_PUNCT	279
+#define	CCE_SPACE	280
+#define	CCE_UPPER	281
+#define	CCE_XDIGIT	282
+#define	BEGIN_REPEAT_POSIX	283
+#define	END_REPEAT_POSIX	284
+#define	BEGIN_REPEAT_FLEX	285
+#define	END_REPEAT_FLEX	286
+
+#line 29 "parse.y"
+
+/*  Copyright (c) 1990 The Regents of the University of California. */
+/*  All rights reserved. */
+
+/*  This code is derived from software contributed to Berkeley by */
+/*  Vern Paxson. */
+
+/*  The United States Government has rights in this work pursuant */
+/*  to contract no. DE-AC03-76SF00098 between the United States */
+/*  Department of Energy and the University of California. */
+
+/*  This file is part of flex. */
+
+/*  Redistribution and use in source and binary forms, with or without */
+/*  modification, are permitted provided that the following conditions */
+/*  are met: */
+
+/*  1. Redistributions of source code must retain the above copyright */
+/*     notice, this list of conditions and the following disclaimer. */
+/*  2. 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 the name of the University 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 ``AS IS'' AND WITHOUT ANY EXPRESS OR */
+/*  IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED */
+/*  WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR */
+/*  PURPOSE. */
+
+/* Some versions of bison are broken in that they use alloca() but don't
+ * declare it properly.  The following is the patented (just kidding!)
+ * #ifdef chud to fix the problem, courtesy of Francois Pinard.
+ */
+#ifdef YYBISON
+/* AIX requires this to be the first thing in the file.  What a piece.  */
+# ifdef _AIX
+ #pragma alloca
+# endif
+#endif
+
+#include "flexdef.h"
+#include "tables.h"
+
+/* The remainder of the alloca() cruft has to come after including flexdef.h,
+ * so HAVE_ALLOCA_H is (possibly) defined.
+ */
+#ifdef YYBISON
+# ifdef __GNUC__
+#  ifndef alloca
+#   define alloca __builtin_alloca
+#  endif
+# else
+#  if HAVE_ALLOCA_H
+#   include <alloca.h>
+#  else
+#   ifdef __hpux
+void *alloca ();
+#   else
+#    ifdef __TURBOC__
+#     include <malloc.h>
+#    else
+char *alloca ();
+#    endif
+#   endif
+#  endif
+# endif
+#endif
+
+/* Bletch, ^^^^ that was ugly! */
+
+
+int pat, scnum, eps, headcnt, trailcnt, anyccl, lastchar, i, rulelen;
+int trlcontxt, xcluflg, currccl, cclsorted, varlength, variable_trail_rule;
+
+int *scon_stk;
+int scon_stk_ptr;
+
+static int madeany = false;  /* whether we've made the '.' character class */
+int previous_continued_action;	/* whether the previous rule's action was '|' */
+
+#define format_warn3(fmt, a1, a2) \
+	do{ \
+        char fw3_msg[MAXLINE];\
+        snprintf( fw3_msg, MAXLINE,(fmt), (a1), (a2) );\
+        warn( fw3_msg );\
+	}while(0)
+
+/* Expand a POSIX character class expression. */
+#define CCL_EXPR(func) \
+	do{ \
+	int c; \
+	for ( c = 0; c < csize; ++c ) \
+		if ( isascii(c) && func(c) ) \
+			ccladd( currccl, c ); \
+	}while(0)
+
+/* While POSIX defines isblank(), it's not ANSI C. */
+#define IS_BLANK(c) ((c) == ' ' || (c) == '\t')
+
+/* On some over-ambitious machines, such as DEC Alpha's, the default
+ * token type is "long" instead of "int"; this leads to problems with
+ * declaring yylval in flexdef.h.  But so far, all the yacc's I've seen
+ * wrap their definitions of YYSTYPE with "#ifndef YYSTYPE"'s, so the
+ * following should ensure that the default token type is "int".
+ */
+#define YYSTYPE int
+
+#ifndef YYSTYPE
+#define YYSTYPE int
+#endif
+#include <stdio.h>
+
+#ifndef __cplusplus
+#ifndef __STDC__
+#define const
+#endif
+#endif
+
+
+
+#define	YYFINAL		120
+#define	YYFLAG		-32768
+#define	YYNTBASE	54
+
+#define YYTRANSLATE(x) ((unsigned)(x) <= 286 ? yytranslate[x] : 79)
+
+static const char yytranslate[] = {     0,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,    34,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,    48,     2,    42,     2,     2,     2,    49,
+    50,    40,    45,    41,    53,    47,    44,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,    38,
+    33,    39,    46,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+    51,     2,    52,    37,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,    35,    43,    36,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     1,     3,     4,     5,     6,
+     7,     8,     9,    10,    11,    12,    13,    14,    15,    16,
+    17,    18,    19,    20,    21,    22,    23,    24,    25,    26,
+    27,    28,    29,    30,    31,    32
+};
+
+#if YYDEBUG != 0
+static const short yyprhs[] = {     0,
+     0,     6,     7,    11,    14,    15,    17,    19,    21,    23,
+    26,    28,    30,    33,    36,    37,    41,    45,    49,    53,
+    57,    63,    69,    70,    71,    74,    76,    78,    80,    81,
+    86,    90,    91,    95,    97,    99,   101,   104,   108,   111,
+   113,   117,   119,   122,   125,   127,   134,   140,   145,   148,
+   151,   154,   161,   167,   172,   174,   176,   178,   182,   186,
+   188,   192,   197,   202,   205,   208,   209,   211,   213,   215,
+   217,   219,   221,   223,   225,   227,   229,   231,   233,   236
+};
+
+static const short yyrhs[] = {    55,
+    56,    57,    63,    64,     0,     0,    56,    58,    59,     0,
+    56,    60,     0,     0,     1,     0,     5,     0,     6,     0,
+     7,     0,    59,     8,     0,     8,     0,     1,     0,    11,
+    61,     0,    61,    62,     0,     0,    12,    33,     8,     0,
+    13,    33,     8,     0,    14,    33,     8,     0,    15,    33,
+     8,     0,    16,    33,     8,     0,    63,    67,    64,    65,
+    34,     0,    63,    67,    35,    63,    36,     0,     0,     0,
+    37,    70,     0,    70,     0,    10,     0,     1,     0,     0,
+    38,    66,    68,    39,     0,    38,    40,    39,     0,     0,
+    68,    41,    69,     0,    69,     0,     1,     0,     8,     0,
+    72,    71,     0,    72,    71,    42,     0,    71,    42,     0,
+    71,     0,    71,    43,    73,     0,    73,     0,    71,    44,
+     0,    73,    74,     0,    74,     0,    73,    29,     4,    41,
+     4,    30,     0,    73,    29,     4,    41,    30,     0,    73,
+    29,     4,    30,     0,    74,    40,     0,    74,    45,     0,
+    74,    46,     0,    74,    31,     4,    41,     4,    32,     0,
+    74,    31,     4,    41,    32,     0,    74,    31,     4,    32,
+     0,    47,     0,    75,     0,     9,     0,    48,    78,    48,
+     0,    49,    71,    50,     0,     3,     0,    51,    76,    52,
+     0,    51,    37,    76,    52,     0,    76,     3,    53,     3,
+     0,    76,     3,     0,    76,    77,     0,     0,    17,     0,
+    18,     0,    19,     0,    20,     0,    21,     0,    22,     0,
+    23,     0,    24,     0,    25,     0,    26,     0,    27,     0,
+    28,     0,    78,     3,     0,     0
+};
+
+#endif
+
+#if YYDEBUG != 0
+static const short yyrline[] = { 0,
+   142,   171,   179,   180,   181,   182,   186,   194,   197,   201,
+   204,   207,   211,   214,   215,   218,   223,   225,   227,   229,
+   233,   235,   237,   240,   253,   289,   313,   336,   340,   344,
+   347,   364,   368,   370,   372,   376,   399,   455,   458,   501,
+   519,   525,   530,   557,   565,   568,   596,   610,   632,   639,
+   645,   651,   679,   693,   712,   734,   755,   765,   768,   771,
+   785,   788,   795,   849,   860,   867,   875,   876,   877,   878,
+   879,   880,   881,   882,   883,   884,   885,   891,   894,   907
+};
+#endif
+
+
+#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
+
+static const char * const yytname[] = {   "$","error","$undefined.","CHAR","NUMBER",
+"SECTEND","SCDECL","XSCDECL","NAME","PREVCCL","EOF_OP","OPTION_OP","OPT_OUTFILE",
+"OPT_PREFIX","OPT_YYCLASS","OPT_HEADER","OPT_TABLES","CCE_ALNUM","CCE_ALPHA",
+"CCE_BLANK","CCE_CNTRL","CCE_DIGIT","CCE_GRAPH","CCE_LOWER","CCE_PRINT","CCE_PUNCT",
+"CCE_SPACE","CCE_UPPER","CCE_XDIGIT","BEGIN_REPEAT_POSIX","END_REPEAT_POSIX",
+"BEGIN_REPEAT_FLEX","END_REPEAT_FLEX","'='","'\\n'","'{'","'}'","'^'","'<'",
+"'>'","'*'","','","'$'","'|'","'/'","'+'","'?'","'.'","'\\\"'","'('","')'","'['",
+"']'","'-'","goal","initlex","sect1","sect1end","startconddecl","namelist1",
+"options","optionlist","option","sect2","initforrule","flexrule","scon_stk_ptr",
+"scon","namelist2","sconname","rule","re","re2","series","singleton","fullccl",
+"ccl","ccl_expr","string", NULL
+};
+#endif
+
+static const short yyr1[] = {     0,
+    54,    55,    56,    56,    56,    56,    57,    58,    58,    59,
+    59,    59,    60,    61,    61,    62,    62,    62,    62,    62,
+    63,    63,    63,    64,    65,    65,    65,    65,    66,    67,
+    67,    67,    68,    68,    68,    69,    70,    70,    70,    70,
+    71,    71,    72,    73,    73,    73,    73,    73,    74,    74,
+    74,    74,    74,    74,    74,    74,    74,    74,    74,    74,
+    75,    75,    76,    76,    76,    76,    77,    77,    77,    77,
+    77,    77,    77,    77,    77,    77,    77,    77,    78,    78
+};
+
+static const short yyr2[] = {     0,
+     5,     0,     3,     2,     0,     1,     1,     1,     1,     2,
+     1,     1,     2,     2,     0,     3,     3,     3,     3,     3,
+     5,     5,     0,     0,     2,     1,     1,     1,     0,     4,
+     3,     0,     3,     1,     1,     1,     2,     3,     2,     1,
+     3,     1,     2,     2,     1,     6,     5,     4,     2,     2,
+     2,     6,     5,     4,     1,     1,     1,     3,     3,     1,
+     3,     4,     4,     2,     2,     0,     1,     1,     1,     1,
+     1,     1,     1,     1,     1,     1,     1,     1,     2,     0
+};
+
+static const short yydefact[] = {     2,
+     0,     6,     0,     7,     8,     9,    15,    23,     0,     4,
+    13,    32,    12,    11,     3,     0,     0,     0,     0,     0,
+    14,    29,     1,    24,    10,     0,     0,     0,     0,     0,
+     0,     0,    23,     0,    16,    17,    18,    19,    20,    31,
+    35,    36,     0,    34,    32,    28,    60,    57,    27,     0,
+    55,    80,     0,    66,     0,    26,    40,     0,    42,    45,
+    56,    30,     0,    22,    25,     0,     0,    66,     0,    21,
+    39,     0,    43,    37,     0,    44,     0,    49,    50,    51,
+    33,    79,    58,    59,     0,    64,    67,    68,    69,    70,
+    71,    72,    73,    74,    75,    76,    77,    78,    61,    65,
+    41,    38,     0,     0,    62,     0,    48,     0,    54,     0,
+    63,     0,    47,     0,    53,    46,    52,     0,     0,     0
+};
+
+static const short yydefgoto[] = {   118,
+     1,     3,     8,     9,    15,    10,    11,    21,    12,    23,
+    55,    32,    24,    43,    44,    56,    57,    58,    59,    60,
+    61,    69,   100,    66
+};
+
+static const short yypact[] = {-32768,
+    75,-32768,    61,-32768,-32768,-32768,-32768,-32768,    29,-32768,
+    83,     6,-32768,-32768,    24,   -19,     9,    32,    37,    46,
+-32768,    47,-32768,    57,-32768,    96,   100,   101,   102,   103,
+    73,    30,-32768,    -1,-32768,-32768,-32768,-32768,-32768,-32768,
+-32768,-32768,   -28,-32768,    67,-32768,-32768,-32768,-32768,    26,
+-32768,-32768,    26,    76,    80,-32768,    58,    26,    42,    38,
+-32768,-32768,   107,-32768,-32768,     1,    -9,-32768,     0,-32768,
+-32768,    26,-32768,    64,   112,    38,   113,-32768,-32768,-32768,
+-32768,-32768,-32768,-32768,    36,    65,-32768,-32768,-32768,-32768,
+-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
+    42,-32768,   -25,    53,-32768,   116,-32768,     3,-32768,     8,
+-32768,    90,-32768,    89,-32768,-32768,-32768,   122,   123,-32768
+};
+
+static const short yypgoto[] = {-32768,
+-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,    91,   104,
+-32768,-32768,-32768,-32768,    62,    77,   -43,-32768,    54,   -58,
+-32768,    63,-32768,-32768
+};
+
+
+#define	YYLAST		131
+
+
+static const short yytable[] = {    46,
+    76,    47,    86,    82,   107,   -24,   112,    48,    49,    67,
+    62,   114,    63,    26,    74,   108,    87,    88,    89,    90,
+    91,    92,    93,    94,    95,    96,    97,    98,    47,    13,
+    41,    25,   113,    72,    48,    50,    14,    42,    86,   115,
+    84,    27,    76,    22,    47,    51,    52,    53,    83,    54,
+    48,    99,    87,    88,    89,    90,    91,    92,    93,    94,
+    95,    96,    97,    98,    28,     4,     5,     6,    77,    29,
+    75,     7,    51,    52,    53,     2,    54,    78,    30,    -5,
+    -5,    -5,    79,    80,   109,    -5,    31,   105,    51,    52,
+    53,    33,    54,   110,    16,    17,    18,    19,    20,    71,
+    72,    73,    64,    35,    22,   102,    72,    36,    37,    38,
+    39,    40,    68,    70,    42,   103,   104,   106,   111,   116,
+   117,   119,   120,    45,    81,   101,    65,    34,     0,     0,
+    85
+};
+
+static const short yycheck[] = {     1,
+    59,     3,     3,     3,    30,     0,     4,     9,    10,    53,
+    39,     4,    41,    33,    58,    41,    17,    18,    19,    20,
+    21,    22,    23,    24,    25,    26,    27,    28,     3,     1,
+     1,     8,    30,    43,     9,    37,     8,     8,     3,    32,
+    50,    33,   101,    38,     3,    47,    48,    49,    48,    51,
+     9,    52,    17,    18,    19,    20,    21,    22,    23,    24,
+    25,    26,    27,    28,    33,     5,     6,     7,    31,    33,
+    29,    11,    47,    48,    49,     1,    51,    40,    33,     5,
+     6,     7,    45,    46,    32,    11,    40,    52,    47,    48,
+    49,    35,    51,    41,    12,    13,    14,    15,    16,    42,
+    43,    44,    36,     8,    38,    42,    43,     8,     8,     8,
+     8,    39,    37,    34,     8,     4,     4,    53,     3,    30,
+    32,     0,     0,    33,    63,    72,    50,    24,    -1,    -1,
+    68
+};
+/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
+#line 3 "/usr/lib/bison.simple"
+/* This file comes from bison-1.28.  */
+
+/* Skeleton output parser for bison,
+   Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
+
+   This program is free software; you can redistribute it and/or modify
+   it under the terms of the GNU General Public License as published by
+   the Free Software Foundation; either version 2, or (at your option)
+   any later version.
+
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place - Suite 330,
+   Boston, MA 02111-1307, USA.  */
+
+/* As a special exception, when this file is copied by Bison into a
+   Bison output file, you may use that output file without restriction.
+   This special exception was added by the Free Software Foundation
+   in version 1.24 of Bison.  */
+
+/* This is the parser code that is written into each bison parser
+  when the %semantic_parser declaration is not specified in the grammar.
+  It was written by Richard Stallman by simplifying the hairy parser
+  used when %semantic_parser is specified.  */
+
+#ifndef YYSTACK_USE_ALLOCA
+#ifdef alloca
+#define YYSTACK_USE_ALLOCA
+#else /* alloca not defined */
+#ifdef __GNUC__
+#define YYSTACK_USE_ALLOCA
+#define alloca __builtin_alloca
+#else /* not GNU C.  */
+#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))
+#define YYSTACK_USE_ALLOCA
+#include <alloca.h>
+#else /* not sparc */
+/* We think this test detects Watcom and Microsoft C.  */
+/* This used to test MSDOS, but that is a bad idea
+   since that symbol is in the user namespace.  */
+#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
+#if 0 /* No need for malloc.h, which pollutes the namespace;
+	 instead, just don't use alloca.  */
+#include <malloc.h>
+#endif
+#else /* not MSDOS, or __TURBOC__ */
+#if defined(_AIX)
+/* I don't know what this was needed for, but it pollutes the namespace.
+   So I turned it off.   rms, 2 May 1997.  */
+/* #include <malloc.h>  */
+ #pragma alloca
+#define YYSTACK_USE_ALLOCA
+#else /* not MSDOS, or __TURBOC__, or _AIX */
+#if 0
+#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up,
+		 and on HPUX 10.  Eventually we can turn this on.  */
+#define YYSTACK_USE_ALLOCA
+#define alloca __builtin_alloca
+#endif /* __hpux */
+#endif
+#endif /* not _AIX */
+#endif /* not MSDOS, or __TURBOC__ */
+#endif /* not sparc */
+#endif /* not GNU C */
+#endif /* alloca not defined */
+#endif /* YYSTACK_USE_ALLOCA not defined */
+
+#ifdef YYSTACK_USE_ALLOCA
+#define YYSTACK_ALLOC alloca
+#else
+#define YYSTACK_ALLOC malloc
+#endif
+
+/* Note: there must be only one dollar sign in this file.
+   It is replaced by the list of actions, each action
+   as one case of the switch.  */
+
+#define yyerrok		(yyerrstatus = 0)
+#define yyclearin	(yychar = YYEMPTY)
+#define YYEMPTY		-2
+#define YYEOF		0
+#define YYACCEPT	goto yyacceptlab
+#define YYABORT 	goto yyabortlab
+#define YYERROR		goto yyerrlab1
+/* Like YYERROR except do call yyerror.
+   This remains here temporarily to ease the
+   transition to the new meaning of YYERROR, for GCC.
+   Once GCC version 2 has supplanted version 1, this can go.  */
+#define YYFAIL		goto yyerrlab
+#define YYRECOVERING()  (!!yyerrstatus)
+#define YYBACKUP(token, value) \
+do								\
+  if (yychar == YYEMPTY && yylen == 1)				\
+    { yychar = (token), yylval = (value);			\
+      yychar1 = YYTRANSLATE (yychar);				\
+      YYPOPSTACK;						\
+      goto yybackup;						\
+    }								\
+  else								\
+    { yyerror ("syntax error: cannot back up"); YYERROR; }	\
+while (0)
+
+#define YYTERROR	1
+#define YYERRCODE	256
+
+#ifndef YYPURE
+#define YYLEX		yylex()
+#endif
+
+#ifdef YYPURE
+#ifdef YYLSP_NEEDED
+#ifdef YYLEX_PARAM
+#define YYLEX		yylex(&yylval, &yylloc, YYLEX_PARAM)
+#else
+#define YYLEX		yylex(&yylval, &yylloc)
+#endif
+#else /* not YYLSP_NEEDED */
+#ifdef YYLEX_PARAM
+#define YYLEX		yylex(&yylval, YYLEX_PARAM)
+#else
+#define YYLEX		yylex(&yylval)
+#endif
+#endif /* not YYLSP_NEEDED */
+#endif
+
+/* If nonreentrant, generate the variables here */
+
+#ifndef YYPURE
+
+int	yychar;			/*  the lookahead symbol		*/
+YYSTYPE	yylval;			/*  the semantic value of the		*/
+				/*  lookahead symbol			*/
+
+#ifdef YYLSP_NEEDED
+YYLTYPE yylloc;			/*  location data for the lookahead	*/
+				/*  symbol				*/
+#endif
+
+int yynerrs;			/*  number of parse errors so far       */
+#endif  /* not YYPURE */
+
+#if YYDEBUG != 0
+int yydebug;			/*  nonzero means print parse trace	*/
+/* Since this is uninitialized, it does not stop multiple parsers
+   from coexisting.  */
+#endif
+
+/*  YYINITDEPTH indicates the initial size of the parser's stacks	*/
+
+#ifndef	YYINITDEPTH
+#define YYINITDEPTH 200
+#endif
+
+/*  YYMAXDEPTH is the maximum size the stacks can grow to
+    (effective only if the built-in stack extension method is used).  */
+
+#if YYMAXDEPTH == 0
+#undef YYMAXDEPTH
+#endif
+
+#ifndef YYMAXDEPTH
+#define YYMAXDEPTH 10000
+#endif
+
+/* Define __yy_memcpy.  Note that the size argument
+   should be passed with type unsigned int, because that is what the non-GCC
+   definitions require.  With GCC, __builtin_memcpy takes an arg
+   of type size_t, but it can handle unsigned int.  */
+
+#if __GNUC__ > 1		/* GNU C and GNU C++ define this.  */
+#define __yy_memcpy(TO,FROM,COUNT)	__builtin_memcpy(TO,FROM,COUNT)
+#else				/* not GNU C or C++ */
+#ifndef __cplusplus
+
+/* This is the most reliable way to avoid incompatibilities
+   in available built-in functions on various systems.  */
+static void
+__yy_memcpy (to, from, count)
+     char *to;
+     char *from;
+     unsigned int count;
+{
+  register char *f = from;
+  register char *t = to;
+  register int i = count;
+
+  while (i-- > 0)
+    *t++ = *f++;
+}
+
+#else /* __cplusplus */
+
+/* This is the most reliable way to avoid incompatibilities
+   in available built-in functions on various systems.  */
+static void
+__yy_memcpy (char *to, char *from, unsigned int count)
+{
+  register char *t = to;
+  register char *f = from;
+  register int i = count;
+
+  while (i-- > 0)
+    *t++ = *f++;
+}
+
+#endif
+#endif
+
+#line 217 "/usr/lib/bison.simple"
+
+/* 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
+#ifdef __cplusplus
+#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
+#define YYPARSE_PARAM_DECL
+#else /* not __cplusplus */
+#define YYPARSE_PARAM_ARG YYPARSE_PARAM
+#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
+#endif /* not __cplusplus */
+#else /* not YYPARSE_PARAM */
+#define YYPARSE_PARAM_ARG
+#define YYPARSE_PARAM_DECL
+#endif /* not YYPARSE_PARAM */
+
+/* Prevent warning if -Wstrict-prototypes.  */
+#ifdef __GNUC__
+#ifdef YYPARSE_PARAM
+int yyparse (void *);
+#else
+int yyparse (void);
+#endif
+#endif
+
+int
+yyparse(YYPARSE_PARAM_ARG)
+     YYPARSE_PARAM_DECL
+{
+  register int yystate;
+  register int yyn;
+  register short *yyssp;
+  register YYSTYPE *yyvsp;
+  int yyerrstatus;	/*  number of tokens to shift before error messages enabled */
+  int yychar1 = 0;		/*  lookahead token as an internal (translated) token number */
+
+  short	yyssa[YYINITDEPTH];	/*  the state stack			*/
+  YYSTYPE yyvsa[YYINITDEPTH];	/*  the semantic value stack		*/
+
+  short *yyss = yyssa;		/*  refer to the stacks thru separate pointers */
+  YYSTYPE *yyvs = yyvsa;	/*  to allow yyoverflow to reallocate them elsewhere */
+
+#ifdef YYLSP_NEEDED
+  YYLTYPE yylsa[YYINITDEPTH];	/*  the location stack			*/
+  YYLTYPE *yyls = yylsa;
+  YYLTYPE *yylsp;
+
+#define YYPOPSTACK   (yyvsp--, yyssp--, yylsp--)
+#else
+#define YYPOPSTACK   (yyvsp--, yyssp--)
+#endif
+
+  int yystacksize = YYINITDEPTH;
+  int yyfree_stacks = 0;
+
+#ifdef YYPURE
+  int yychar;
+  YYSTYPE yylval;
+  int yynerrs;
+#ifdef YYLSP_NEEDED
+  YYLTYPE yylloc;
+#endif
+#endif
+
+  YYSTYPE yyval;		/*  the variable used to return		*/
+				/*  semantic values from the action	*/
+				/*  routines				*/
+
+  int yylen;
+
+#if YYDEBUG != 0
+  if (yydebug)
+    fprintf(stderr, "Starting parse\n");
+#endif
+
+  yystate = 0;
+  yyerrstatus = 0;
+  yynerrs = 0;
+  yychar = YYEMPTY;		/* Cause a token to be read.  */
+
+  /* Initialize stack pointers.
+     Waste one element of value and location stack
+     so that they stay on the same level as the state stack.
+     The wasted elements are never initialized.  */
+
+  yyssp = yyss - 1;
+  yyvsp = yyvs;
+#ifdef YYLSP_NEEDED
+  yylsp = yyls;
+#endif
+
+/* Push a new state, which is found in  yystate  .  */
+/* In all cases, when you get here, the value and location stacks
+   have just been pushed. so pushing a state here evens the stacks.  */
+yynewstate:
+
+  *++yyssp = yystate;
+
+  if (yyssp >= yyss + yystacksize - 1)
+    {
+      /* Give user a chance to reallocate the stack */
+      /* Use copies of these so that the &'s don't force the real ones into memory. */
+      YYSTYPE *yyvs1 = yyvs;
+      short *yyss1 = yyss;
+#ifdef YYLSP_NEEDED
+      YYLTYPE *yyls1 = yyls;
+#endif
+
+      /* Get the current used size of the three stacks, in elements.  */
+      int size = yyssp - yyss + 1;
+
+#ifdef yyoverflow
+      /* Each stack pointer address is followed by the size of
+	 the data in use in that stack, in bytes.  */
+#ifdef YYLSP_NEEDED
+      /* 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, size * sizeof (*yyssp),
+		 &yyvs1, size * sizeof (*yyvsp),
+		 &yyls1, size * sizeof (*yylsp),
+		 &yystacksize);
+#else
+      yyoverflow("parser stack overflow",
+		 &yyss1, size * sizeof (*yyssp),
+		 &yyvs1, size * sizeof (*yyvsp),
+		 &yystacksize);
+#endif
+
+      yyss = yyss1; yyvs = yyvs1;
+#ifdef YYLSP_NEEDED
+      yyls = yyls1;
+#endif
+#else /* no yyoverflow */
+      /* Extend the stack our own way.  */
+      if (yystacksize >= YYMAXDEPTH)
+	{
+	  yyerror("parser stack overflow");
+	  if (yyfree_stacks)
+	    {
+	      free (yyss);
+	      free (yyvs);
+#ifdef YYLSP_NEEDED
+	      free (yyls);
+#endif
+	    }
+	  return 2;
+	}
+      yystacksize *= 2;
+      if (yystacksize > YYMAXDEPTH)
+	yystacksize = YYMAXDEPTH;
+#ifndef YYSTACK_USE_ALLOCA
+      yyfree_stacks = 1;
+#endif
+      yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
+      __yy_memcpy ((char *)yyss, (char *)yyss1,
+		   size * (unsigned int) sizeof (*yyssp));
+      yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
+      __yy_memcpy ((char *)yyvs, (char *)yyvs1,
+		   size * (unsigned int) sizeof (*yyvsp));
+#ifdef YYLSP_NEEDED
+      yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
+      __yy_memcpy ((char *)yyls, (char *)yyls1,
+		   size * (unsigned int) sizeof (*yylsp));
+#endif
+#endif /* no yyoverflow */
+
+      yyssp = yyss + size - 1;
+      yyvsp = yyvs + size - 1;
+#ifdef YYLSP_NEEDED
+      yylsp = yyls + size - 1;
+#endif
+
+#if YYDEBUG != 0
+      if (yydebug)
+	fprintf(stderr, "Stack size increased to %d\n", yystacksize);
+#endif
+
+      if (yyssp >= yyss + yystacksize - 1)
+	YYABORT;
+    }
+
+#if YYDEBUG != 0
+  if (yydebug)
+    fprintf(stderr, "Entering state %d\n", yystate);
+#endif
+
+  goto 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 == YYFLAG)
+    goto yydefault;
+
+  /* Not known => get a lookahead token if don't already have one.  */
+
+  /* yychar is either YYEMPTY or YYEOF
+     or a valid token in external form.  */
+
+  if (yychar == YYEMPTY)
+    {
+#if YYDEBUG != 0
+      if (yydebug)
+	fprintf(stderr, "Reading a token: ");
+#endif
+      yychar = YYLEX;
+    }
+
+  /* Convert token to internal form (in yychar1) for indexing tables with */
+
+  if (yychar <= 0)		/* This means end of input. */
+    {
+      yychar1 = 0;
+      yychar = YYEOF;		/* Don't call YYLEX any more */
+
+#if YYDEBUG != 0
+      if (yydebug)
+	fprintf(stderr, "Now at end of input.\n");
+#endif
+    }
+  else
+    {
+      yychar1 = YYTRANSLATE(yychar);
+
+#if YYDEBUG != 0
+      if (yydebug)
+	{
+	  fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
+	  /* Give the individual parser a way to print the precise meaning
+	     of a token, for further debugging info.  */
+#ifdef YYPRINT
+	  YYPRINT (stderr, yychar, yylval);
+#endif
+	  fprintf (stderr, ")\n");
+	}
+#endif
+    }
+
+  yyn += yychar1;
+  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
+    goto yydefault;
+
+  yyn = yytable[yyn];
+
+  /* yyn is what to do for this token type in this state.
+     Negative => reduce, -yyn is rule number.
+     Positive => shift, yyn is new state.
+       New state is final state => don't bother to shift,
+       just return success.
+     0, or most negative number => error.  */
+
+  if (yyn < 0)
+    {
+      if (yyn == YYFLAG)
+	goto yyerrlab;
+      yyn = -yyn;
+      goto yyreduce;
+    }
+  else if (yyn == 0)
+    goto yyerrlab;
+
+  if (yyn == YYFINAL)
+    YYACCEPT;
+
+  /* Shift the lookahead token.  */
+
+#if YYDEBUG != 0
+  if (yydebug)
+    fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
+#endif
+
+  /* Discard the token being shifted unless it is eof.  */
+  if (yychar != YYEOF)
+    yychar = YYEMPTY;
+
+  *++yyvsp = yylval;
+#ifdef YYLSP_NEEDED
+  *++yylsp = yylloc;
+#endif
+
+  /* count tokens shifted since error; after three, turn off error status.  */
+  if (yyerrstatus) yyerrstatus--;
+
+  yystate = yyn;
+  goto yynewstate;
+
+/* Do the default action for the current state.  */
+yydefault:
+
+  yyn = yydefact[yystate];
+  if (yyn == 0)
+    goto yyerrlab;
+
+/* Do a reduction.  yyn is the number of a rule to reduce with.  */
+yyreduce:
+  yylen = yyr2[yyn];
+  if (yylen > 0)
+    yyval = yyvsp[1-yylen]; /* implement default value of the action */
+
+#if YYDEBUG != 0
+  if (yydebug)
+    {
+      int i;
+
+      fprintf (stderr, "Reducing via rule %d (line %d), ",
+	       yyn, yyrline[yyn]);
+
+      /* Print the symbols being reduced, and their result.  */
+      for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
+	fprintf (stderr, "%s ", yytname[yyrhs[i]]);
+      fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
+    }
+#endif
+
+
+  switch (yyn) {
+
+case 1:
+#line 143 "parse.y"
+{ /* add default rule */
+			int def_rule;
+
+			pat = cclinit();
+			cclnegate( pat );
+
+			def_rule = mkstate( -pat );
+
+			/* Remember the number of the default rule so we
+			 * don't generate "can't match" warnings for it.
+			 */
+			default_rule = num_rules;
+
+			finish_rule( def_rule, false, 0, 0, 0);
+
+			for ( i = 1; i <= lastsc; ++i )
+				scset[i] = mkbranch( scset[i], def_rule );
+
+			if ( spprdflt )
+				add_action(
+				"YY_FATAL_ERROR( \"flex scanner jammed\" )" );
+			else
+				add_action( "ECHO" );
+
+			add_action( ";\n\tYY_BREAK\n" );
+			;
+    break;}
+case 2:
+#line 172 "parse.y"
+{ /* initialize for processing rules */
+
+			/* Create default DFA start condition. */
+			scinstal( "INITIAL", false );
+			;
+    break;}
+case 6:
+#line 183 "parse.y"
+{ synerr( _("unknown error processing section 1") ); ;
+    break;}
+case 7:
+#line 187 "parse.y"
+{
+			check_options();
+			scon_stk = allocate_integer_array( lastsc + 1 );
+			scon_stk_ptr = 0;
+			;
+    break;}
+case 8:
+#line 195 "parse.y"
+{ xcluflg = false; ;
+    break;}
+case 9:
+#line 198 "parse.y"
+{ xcluflg = true; ;
+    break;}
+case 10:
+#line 202 "parse.y"
+{ scinstal( nmstr, xcluflg ); ;
+    break;}
+case 11:
+#line 205 "parse.y"
+{ scinstal( nmstr, xcluflg ); ;
+    break;}
+case 12:
+#line 208 "parse.y"
+{ synerr( _("bad start condition list") ); ;
+    break;}
+case 16:
+#line 219 "parse.y"
+{
+			outfilename = copy_string( nmstr );
+			did_outfilename = 1;
+			;
+    break;}
+case 17:
+#line 224 "parse.y"
+{ prefix = copy_string( nmstr ); ;
+    break;}
+case 18:
+#line 226 "parse.y"
+{ yyclass = copy_string( nmstr ); ;
+    break;}
+case 19:
+#line 228 "parse.y"
+{ headerfilename = copy_string( nmstr ); ;
+    break;}
+case 20:
+#line 230 "parse.y"
+{ tablesext = true; tablesfilename = copy_string( nmstr ); ;
+    break;}
+case 21:
+#line 234 "parse.y"
+{ scon_stk_ptr = yyvsp[-3]; ;
+    break;}
+case 22:
+#line 236 "parse.y"
+{ scon_stk_ptr = yyvsp[-3]; ;
+    break;}
+case 24:
+#line 241 "parse.y"
+{
+			/* Initialize for a parse of one rule. */
+			trlcontxt = variable_trail_rule = varlength = false;
+			trailcnt = headcnt = rulelen = 0;
+			current_state_type = STATE_NORMAL;
+			previous_continued_action = continued_action;
+			in_rule = true;
+
+			new_rule();
+			;
+    break;}
+case 25:
+#line 254 "parse.y"
+{
+			pat = yyvsp[0];
+			finish_rule( pat, variable_trail_rule,
+				headcnt, trailcnt , previous_continued_action);
+
+			if ( scon_stk_ptr > 0 )
+				{
+				for ( i = 1; i <= scon_stk_ptr; ++i )
+					scbol[scon_stk[i]] =
+						mkbranch( scbol[scon_stk[i]],
+								pat );
+				}
+
+			else
+				{
+				/* Add to all non-exclusive start conditions,
+				 * including the default (0) start condition.
+				 */
+
+				for ( i = 1; i <= lastsc; ++i )
+					if ( ! scxclu[i] )
+						scbol[i] = mkbranch( scbol[i],
+									pat );
+				}
+
+			if ( ! bol_needed )
+				{
+				bol_needed = true;
+
+				if ( performance_report > 1 )
+					pinpoint_message(
+			"'^' operator results in sub-optimal performance" );
+				}
+			;
+    break;}
+case 26:
+#line 290 "parse.y"
+{
+			pat = yyvsp[0];
+			finish_rule( pat, variable_trail_rule,
+				headcnt, trailcnt , previous_continued_action);
+
+			if ( scon_stk_ptr > 0 )
+				{
+				for ( i = 1; i <= scon_stk_ptr; ++i )
+					scset[scon_stk[i]] =
+						mkbranch( scset[scon_stk[i]],
+								pat );
+				}
+
+			else
+				{
+				for ( i = 1; i <= lastsc; ++i )
+					if ( ! scxclu[i] )
+						scset[i] =
+							mkbranch( scset[i],
+								pat );
+				}
+			;
+    break;}
+case 27:
+#line 314 "parse.y"
+{
+			if ( scon_stk_ptr > 0 )
+				build_eof_action();
+	
+			else
+				{
+				/* This EOF applies to all start conditions
+				 * which don't already have EOF actions.
+				 */
+				for ( i = 1; i <= lastsc; ++i )
+					if ( ! sceof[i] )
+						scon_stk[++scon_stk_ptr] = i;
+
+				if ( scon_stk_ptr == 0 )
+					warn(
+			"all start conditions already have <<EOF>> rules" );
+
+				else
+					build_eof_action();
+				}
+			;
+    break;}
+case 28:
+#line 337 "parse.y"
+{ synerr( _("unrecognized rule") ); ;
+    break;}
+case 29:
+#line 341 "parse.y"
+{ yyval = scon_stk_ptr; ;
+    break;}
+case 30:
+#line 345 "parse.y"
+{ yyval = yyvsp[-2]; ;
+    break;}
+case 31:
+#line 348 "parse.y"
+{
+			yyval = scon_stk_ptr;
+
+			for ( i = 1; i <= lastsc; ++i )
+				{
+				int j;
+
+				for ( j = 1; j <= scon_stk_ptr; ++j )
+					if ( scon_stk[j] == i )
+						break;
+
+				if ( j > scon_stk_ptr )
+					scon_stk[++scon_stk_ptr] = i;
+				}
+			;
+    break;}
+case 32:
+#line 365 "parse.y"
+{ yyval = scon_stk_ptr; ;
+    break;}
+case 35:
+#line 373 "parse.y"
+{ synerr( _("bad start condition list") ); ;
+    break;}
+case 36:
+#line 377 "parse.y"
+{
+			if ( (scnum = sclookup( nmstr )) == 0 )
+				format_pinpoint_message(
+					"undeclared start condition %s",
+					nmstr );
+			else
+				{
+				for ( i = 1; i <= scon_stk_ptr; ++i )
+					if ( scon_stk[i] == scnum )
+						{
+						format_warn(
+							"<%s> specified twice",
+							scname[scnum] );
+						break;
+						}
+
+				if ( i > scon_stk_ptr )
+					scon_stk[++scon_stk_ptr] = scnum;
+				}
+			;
+    break;}
+case 37:
+#line 400 "parse.y"
+{
+			if ( transchar[lastst[yyvsp[0]]] != SYM_EPSILON )
+				/* Provide final transition \now/ so it
+				 * will be marked as a trailing context
+				 * state.
+				 */
+				yyvsp[0] = link_machines( yyvsp[0],
+						mkstate( SYM_EPSILON ) );
+
+			mark_beginning_as_normal( yyvsp[0] );
+			current_state_type = STATE_NORMAL;
+
+			if ( previous_continued_action )
+				{
+				/* We need to treat this as variable trailing
+				 * context so that the backup does not happen
+				 * in the action but before the action switch
+				 * statement.  If the backup happens in the
+				 * action, then the rules "falling into" this
+				 * one's action will *also* do the backup,
+				 * erroneously.
+				 */
+				if ( ! varlength || headcnt != 0 )
+					warn(
+		"trailing context made variable due to preceding '|' action" );
+
+				/* Mark as variable. */
+				varlength = true;
+				headcnt = 0;
+
+				}
+
+			if ( lex_compat || (varlength && headcnt == 0) )
+				{ /* variable trailing context rule */
+				/* Mark the first part of the rule as the
+				 * accepting "head" part of a trailing
+				 * context rule.
+				 *
+				 * By the way, we didn't do this at the
+				 * beginning of this production because back
+				 * then current_state_type was set up for a
+				 * trail rule, and add_accept() can create
+				 * a new state ...
+				 */
+				add_accept( yyvsp[-1],
+					num_rules | YY_TRAILING_HEAD_MASK );
+				variable_trail_rule = true;
+				}
+			
+			else
+				trailcnt = rulelen;
+
+			yyval = link_machines( yyvsp[-1], yyvsp[0] );
+			;
+    break;}
+case 38:
+#line 456 "parse.y"
+{ synerr( _("trailing context used twice") ); ;
+    break;}
+case 39:
+#line 459 "parse.y"
+{
+			headcnt = 0;
+			trailcnt = 1;
+			rulelen = 1;
+			varlength = false;
+
+			current_state_type = STATE_TRAILING_CONTEXT;
+
+			if ( trlcontxt )
+				{
+				synerr( _("trailing context used twice") );
+				yyval = mkstate( SYM_EPSILON );
+				}
+
+			else if ( previous_continued_action )
+				{
+				/* See the comment in the rule for "re2 re"
+				 * above.
+				 */
+				warn(
+		"trailing context made variable due to preceding '|' action" );
+
+				varlength = true;
+				}
+
+			if ( lex_compat || varlength )
+				{
+				/* Again, see the comment in the rule for
+				 * "re2 re" above.
+				 */
+				add_accept( yyvsp[-1],
+					num_rules | YY_TRAILING_HEAD_MASK );
+				variable_trail_rule = true;
+				}
+
+			trlcontxt = true;
+
+			eps = mkstate( SYM_EPSILON );
+			yyval = link_machines( yyvsp[-1],
+				link_machines( eps, mkstate( '\n' ) ) );
+			;
+    break;}
+case 40:
+#line 502 "parse.y"
+{
+			yyval = yyvsp[0];
+
+			if ( trlcontxt )
+				{
+				if ( lex_compat || (varlength && headcnt == 0) )
+					/* Both head and trail are
+					 * variable-length.
+					 */
+					variable_trail_rule = true;
+				else
+					trailcnt = rulelen;
+				}
+			;
+    break;}
+case 41:
+#line 520 "parse.y"
+{
+			varlength = true;
+			yyval = mkor( yyvsp[-2], yyvsp[0] );
+			;
+    break;}
+case 42:
+#line 526 "parse.y"
+{ yyval = yyvsp[0]; ;
+    break;}
+case 43:
+#line 531 "parse.y"
+{
+			/* This rule is written separately so the
+			 * reduction will occur before the trailing
+			 * series is parsed.
+			 */
+
+			if ( trlcontxt )
+				synerr( _("trailing context used twice") );
+			else
+				trlcontxt = true;
+
+			if ( varlength )
+				/* We hope the trailing context is
+				 * fixed-length.
+				 */
+				varlength = false;
+			else
+				headcnt = rulelen;
+
+			rulelen = 0;
+
+			current_state_type = STATE_TRAILING_CONTEXT;
+			yyval = yyvsp[-1];
+			;
+    break;}
+case 44:
+#line 558 "parse.y"
+{
+			/* This is where concatenation of adjacent patterns
+			 * gets done.
+			 */
+			yyval = link_machines( yyvsp[-1], yyvsp[0] );
+			;
+    break;}
+case 45:
+#line 566 "parse.y"
+{ yyval = yyvsp[0]; ;
+    break;}
+case 46:
+#line 569 "parse.y"
+{
+			varlength = true;
+
+			if ( yyvsp[-3] > yyvsp[-1] || yyvsp[-3] < 0 )
+				{
+				synerr( _("bad iteration values") );
+				yyval = yyvsp[-5];
+				}
+			else
+				{
+				if ( yyvsp[-3] == 0 )
+					{
+					if ( yyvsp[-1] <= 0 )
+						{
+						synerr(
+						_("bad iteration values") );
+						yyval = yyvsp[-5];
+						}
+					else
+						yyval = mkopt(
+							mkrep( yyvsp[-5], 1, yyvsp[-1] ) );
+					}
+				else
+					yyval = mkrep( yyvsp[-5], yyvsp[-3], yyvsp[-1] );
+				}
+			;
+    break;}
+case 47:
+#line 597 "parse.y"
+{
+			varlength = true;
+
+			if ( yyvsp[-2] <= 0 )
+				{
+				synerr( _("iteration value must be positive") );
+				yyval = yyvsp[-4];
+				}
+
+			else
+				yyval = mkrep( yyvsp[-4], yyvsp[-2], INFINITY );
+			;
+    break;}
+case 48:
+#line 611 "parse.y"
+{
+			/* The series could be something like "(foo)",
+			 * in which case we have no idea what its length
+			 * is, so we punt here.
+			 */
+			varlength = true;
+
+			if ( yyvsp[-1] <= 0 )
+				{
+				  synerr( _("iteration value must be positive")
+					  );
+				yyval = yyvsp[-3];
+				}
+
+			else
+				yyval = link_machines( yyvsp[-3],
+						copysingl( yyvsp[-3], yyvsp[-1] - 1 ) );
+			;
+    break;}
+case 49:
+#line 633 "parse.y"
+{
+			varlength = true;
+
+			yyval = mkclos( yyvsp[-1] );
+			;
+    break;}
+case 50:
+#line 640 "parse.y"
+{
+			varlength = true;
+			yyval = mkposcl( yyvsp[-1] );
+			;
+    break;}
+case 51:
+#line 646 "parse.y"
+{
+			varlength = true;
+			yyval = mkopt( yyvsp[-1] );
+			;
+    break;}
+case 52:
+#line 652 "parse.y"
+{
+			varlength = true;
+
+			if ( yyvsp[-3] > yyvsp[-1] || yyvsp[-3] < 0 )
+				{
+				synerr( _("bad iteration values") );
+				yyval = yyvsp[-5];
+				}
+			else
+				{
+				if ( yyvsp[-3] == 0 )
+					{
+					if ( yyvsp[-1] <= 0 )
+						{
+						synerr(
+						_("bad iteration values") );
+						yyval = yyvsp[-5];
+						}
+					else
+						yyval = mkopt(
+							mkrep( yyvsp[-5], 1, yyvsp[-1] ) );
+					}
+				else
+					yyval = mkrep( yyvsp[-5], yyvsp[-3], yyvsp[-1] );
+				}
+			;
+    break;}
+case 53:
+#line 680 "parse.y"
+{
+			varlength = true;
+
+			if ( yyvsp[-2] <= 0 )
+				{
+				synerr( _("iteration value must be positive") );
+				yyval = yyvsp[-4];
+				}
+
+			else
+				yyval = mkrep( yyvsp[-4], yyvsp[-2], INFINITY );
+			;
+    break;}
+case 54:
+#line 694 "parse.y"
+{
+			/* The singleton could be something like "(foo)",
+			 * in which case we have no idea what its length
+			 * is, so we punt here.
+			 */
+			varlength = true;
+
+			if ( yyvsp[-1] <= 0 )
+				{
+				synerr( _("iteration value must be positive") );
+				yyval = yyvsp[-3];
+				}
+
+			else
+				yyval = link_machines( yyvsp[-3],
+						copysingl( yyvsp[-3], yyvsp[-1] - 1 ) );
+			;
+    break;}
+case 55:
+#line 713 "parse.y"
+{
+			if ( ! madeany )
+				{
+				/* Create the '.' character class. */
+				anyccl = cclinit();
+				ccladd( anyccl, '\n' );
+				cclnegate( anyccl );
+
+				if ( useecs )
+					mkeccl( ccltbl + cclmap[anyccl],
+						ccllen[anyccl], nextecm,
+						ecgroup, csize, csize );
+
+				madeany = true;
+				}
+
+			++rulelen;
+
+			yyval = mkstate( -anyccl );
+			;
+    break;}
+case 56:
+#line 735 "parse.y"
+{
+			if ( ! cclsorted )
+				/* Sort characters for fast searching.  We
+				 * use a shell sort since this list could
+				 * be large.
+				 */
+				cshell( ccltbl + cclmap[yyvsp[0]], ccllen[yyvsp[0]], true );
+
+			if ( useecs )
+				mkeccl( ccltbl + cclmap[yyvsp[0]], ccllen[yyvsp[0]],
+					nextecm, ecgroup, csize, csize );
+
+			++rulelen;
+
+			if (ccl_has_nl[yyvsp[0]])
+				rule_has_nl[num_rules] = true;
+
+			yyval = mkstate( -yyvsp[0] );
+			;
+    break;}
+case 57:
+#line 756 "parse.y"
+{
+			++rulelen;
+
+			if (ccl_has_nl[yyvsp[0]])
+				rule_has_nl[num_rules] = true;
+
+			yyval = mkstate( -yyvsp[0] );
+			;
+    break;}
+case 58:
+#line 766 "parse.y"
+{ yyval = yyvsp[-1]; ;
+    break;}
+case 59:
+#line 769 "parse.y"
+{ yyval = yyvsp[-1]; ;
+    break;}
+case 60:
+#line 772 "parse.y"
+{
+			++rulelen;
+
+			if ( caseins && yyvsp[0] >= 'A' && yyvsp[0] <= 'Z' )
+				yyvsp[0] = clower( yyvsp[0] );
+
+			if (yyvsp[0] == nlch)
+				rule_has_nl[num_rules] = true;
+
+			yyval = mkstate( yyvsp[0] );
+			;
+    break;}
+case 61:
+#line 786 "parse.y"
+{ yyval = yyvsp[-1]; ;
+    break;}
+case 62:
+#line 789 "parse.y"
+{
+			cclnegate( yyvsp[-1] );
+			yyval = yyvsp[-1];
+			;
+    break;}
+case 63:
+#line 796 "parse.y"
+{
+
+			if (caseins)
+			  {
+			    /* Squish the character range to lowercase only if BOTH
+			     * ends of the range are uppercase.
+			     */
+			    if (isupper (yyvsp[-2]) && isupper (yyvsp[0]))
+			      {
+				yyvsp[-2] = tolower (yyvsp[-2]);
+				yyvsp[0] = tolower (yyvsp[0]);
+			      }
+
+			    /* If one end of the range has case and the other
+			     * does not, or the cases are different, then we're not
+			     * sure what range the user is trying to express.
+			     * Examples: [@-z] or [S-t]
+			     */
+			    else if (has_case (yyvsp[-2]) != has_case (yyvsp[0])
+				     || (has_case (yyvsp[-2]) && (b_islower (yyvsp[-2]) != b_islower (yyvsp[0]))))
+			      format_warn3 (
+			      _("the character range [%c-%c] is ambiguous in a case-insensitive scanner"),
+					    yyvsp[-2], yyvsp[0]);
+
+			    /* If the range spans uppercase characters but not
+			     * lowercase (or vice-versa), then should we automatically
+			     * include lowercase characters in the range?
+			     * Example: [@-_] spans [a-z] but not [A-Z]
+			     */
+			    else if (!has_case (yyvsp[-2]) && !has_case (yyvsp[0]) && !range_covers_case (yyvsp[-2], yyvsp[0]))
+			      format_warn3 (
+			      _("the character range [%c-%c] is ambiguous in a case-insensitive scanner"),
+					    yyvsp[-2], yyvsp[0]);
+			  }
+
+			if ( yyvsp[-2] > yyvsp[0] )
+				synerr( _("negative range in character class") );
+
+			else
+				{
+				for ( i = yyvsp[-2]; i <= yyvsp[0]; ++i )
+					ccladd( yyvsp[-3], i );
+
+				/* Keep track if this ccl is staying in
+				 * alphabetical order.
+				 */
+				cclsorted = cclsorted && (yyvsp[-2] > lastchar);
+				lastchar = yyvsp[0];
+				}
+
+			yyval = yyvsp[-3];
+			;
+    break;}
+case 64:
+#line 850 "parse.y"
+{
+			if ( caseins && yyvsp[0] >= 'A' && yyvsp[0] <= 'Z' )
+				yyvsp[0] = clower( yyvsp[0] );
+
+			ccladd( yyvsp[-1], yyvsp[0] );
+			cclsorted = cclsorted && (yyvsp[0] > lastchar);
+			lastchar = yyvsp[0];
+			yyval = yyvsp[-1];
+			;
+    break;}
+case 65:
+#line 861 "parse.y"
+{
+			/* Too hard to properly maintain cclsorted. */
+			cclsorted = false;
+			yyval = yyvsp[-1];
+			;
+    break;}
+case 66:
+#line 868 "parse.y"
+{
+			cclsorted = true;
+			lastchar = 0;
+			currccl = yyval = cclinit();
+			;
+    break;}
+case 67:
+#line 875 "parse.y"
+{ CCL_EXPR(isalnum); ;
+    break;}
+case 68:
+#line 876 "parse.y"
+{ CCL_EXPR(isalpha); ;
+    break;}
+case 69:
+#line 877 "parse.y"
+{ CCL_EXPR(IS_BLANK); ;
+    break;}
+case 70:
+#line 878 "parse.y"
+{ CCL_EXPR(iscntrl); ;
+    break;}
+case 71:
+#line 879 "parse.y"
+{ CCL_EXPR(isdigit); ;
+    break;}
+case 72:
+#line 880 "parse.y"
+{ CCL_EXPR(isgraph); ;
+    break;}
+case 73:
+#line 881 "parse.y"
+{ CCL_EXPR(islower); ;
+    break;}
+case 74:
+#line 882 "parse.y"
+{ CCL_EXPR(isprint); ;
+    break;}
+case 75:
+#line 883 "parse.y"
+{ CCL_EXPR(ispunct); ;
+    break;}
+case 76:
+#line 884 "parse.y"
+{ CCL_EXPR(isspace); ;
+    break;}
+case 77:
+#line 885 "parse.y"
+{
+				if ( caseins )
+					CCL_EXPR(islower);
+				else
+					CCL_EXPR(isupper);
+				;
+    break;}
+case 78:
+#line 891 "parse.y"
+{ CCL_EXPR(isxdigit); ;
+    break;}
+case 79:
+#line 895 "parse.y"
+{
+			if ( caseins && yyvsp[0] >= 'A' && yyvsp[0] <= 'Z' )
+				yyvsp[0] = clower( yyvsp[0] );
+
+			if ( yyvsp[0] == nlch )
+				rule_has_nl[num_rules] = true;
+
+			++rulelen;
+
+			yyval = link_machines( yyvsp[-1], mkstate( yyvsp[0] ) );
+			;
+    break;}
+case 80:
+#line 908 "parse.y"
+{ yyval = mkstate( SYM_EPSILON ); ;
+    break;}
+}
+   /* the action file gets copied in in place of this dollarsign */
+#line 543 "/usr/lib/bison.simple"
+
+  yyvsp -= yylen;
+  yyssp -= yylen;
+#ifdef YYLSP_NEEDED
+  yylsp -= yylen;
+#endif
+
+#if YYDEBUG != 0
+  if (yydebug)
+    {
+      short *ssp1 = yyss - 1;
+      fprintf (stderr, "state stack now");
+      while (ssp1 != yyssp)
+	fprintf (stderr, " %d", *++ssp1);
+      fprintf (stderr, "\n");
+    }
+#endif
+
+  *++yyvsp = yyval;
+
+#ifdef YYLSP_NEEDED
+  yylsp++;
+  if (yylen == 0)
+    {
+      yylsp->first_line = yylloc.first_line;
+      yylsp->first_column = yylloc.first_column;
+      yylsp->last_line = (yylsp-1)->last_line;
+      yylsp->last_column = (yylsp-1)->last_column;
+      yylsp->text = 0;
+    }
+  else
+    {
+      yylsp->last_line = (yylsp+yylen-1)->last_line;
+      yylsp->last_column = (yylsp+yylen-1)->last_column;
+    }
+#endif
+
+  /* Now "shift" the result of the reduction.
+     Determine what state that goes to,
+     based on the state we popped back to
+     and the rule number reduced by.  */
+
+  yyn = yyr1[yyn];
+
+  yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
+  if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+    yystate = yytable[yystate];
+  else
+    yystate = yydefgoto[yyn - YYNTBASE];
+
+  goto yynewstate;
+
+yyerrlab:   /* here on detecting error */
+
+  if (! yyerrstatus)
+    /* If not already recovering from an error, report this error.  */
+    {
+      ++yynerrs;
+
+#ifdef YYERROR_VERBOSE
+      yyn = yypact[yystate];
+
+      if (yyn > YYFLAG && yyn < YYLAST)
+	{
+	  int size = 0;
+	  char *msg;
+	  int x, count;
+
+	  count = 0;
+	  /* Start X at -yyn if nec to avoid negative indexes in yycheck.  */
+	  for (x = (yyn < 0 ? -yyn : 0);
+	       x < (sizeof(yytname) / sizeof(char *)); x++)
+	    if (yycheck[x + yyn] == x)
+	      size += strlen(yytname[x]) + 15, count++;
+	  msg = (char *) malloc(size + 15);
+	  if (msg != 0)
+	    {
+	      strcpy(msg, "parse error");
+
+	      if (count < 5)
+		{
+		  count = 0;
+		  for (x = (yyn < 0 ? -yyn : 0);
+		       x < (sizeof(yytname) / sizeof(char *)); x++)
+		    if (yycheck[x + yyn] == x)
+		      {
+			strcat(msg, count == 0 ? ", expecting `" : " or `");
+			strcat(msg, yytname[x]);
+			strcat(msg, "'");
+			count++;
+		      }
+		}
+	      yyerror(msg);
+	      free(msg);
+	    }
+	  else
+	    yyerror ("parse error; also virtual memory exceeded");
+	}
+      else
+#endif /* YYERROR_VERBOSE */
+	yyerror("parse error");
+    }
+
+  goto yyerrlab1;
+yyerrlab1:   /* here on error raised explicitly by an action */
+
+  if (yyerrstatus == 3)
+    {
+      /* if just tried and failed to reuse lookahead token after an error, discard it.  */
+
+      /* return failure if at end of input */
+      if (yychar == YYEOF)
+	YYABORT;
+
+#if YYDEBUG != 0
+      if (yydebug)
+	fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
+#endif
+
+      yychar = YYEMPTY;
+    }
+
+  /* Else will try to reuse lookahead token
+     after shifting the error token.  */
+
+  yyerrstatus = 3;		/* Each real token shifted decrements this */
+
+  goto yyerrhandle;
+
+yyerrdefault:  /* current state does not do anything special for the error token. */
+
+#if 0
+  /* This is wrong; only states that explicitly want error tokens
+     should shift them.  */
+  yyn = yydefact[yystate];  /* If its default is to accept any token, ok.  Otherwise pop it.*/
+  if (yyn) goto yydefault;
+#endif
+
+yyerrpop:   /* pop the current state because it cannot handle the error token */
+
+  if (yyssp == yyss) YYABORT;
+  yyvsp--;
+  yystate = *--yyssp;
+#ifdef YYLSP_NEEDED
+  yylsp--;
+#endif
+
+#if YYDEBUG != 0
+  if (yydebug)
+    {
+      short *ssp1 = yyss - 1;
+      fprintf (stderr, "Error: state stack now");
+      while (ssp1 != yyssp)
+	fprintf (stderr, " %d", *++ssp1);
+      fprintf (stderr, "\n");
+    }
+#endif
+
+yyerrhandle:
+
+  yyn = yypact[yystate];
+  if (yyn == YYFLAG)
+    goto yyerrdefault;
+
+  yyn += YYTERROR;
+  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
+    goto yyerrdefault;
+
+  yyn = yytable[yyn];
+  if (yyn < 0)
+    {
+      if (yyn == YYFLAG)
+	goto yyerrpop;
+      yyn = -yyn;
+      goto yyreduce;
+    }
+  else if (yyn == 0)
+    goto yyerrpop;
+
+  if (yyn == YYFINAL)
+    YYACCEPT;
+
+#if YYDEBUG != 0
+  if (yydebug)
+    fprintf(stderr, "Shifting error token, ");
+#endif
+
+  *++yyvsp = yylval;
+#ifdef YYLSP_NEEDED
+  *++yylsp = yylloc;
+#endif
+
+  yystate = yyn;
+  goto yynewstate;
+
+ yyacceptlab:
+  /* YYACCEPT comes here.  */
+  if (yyfree_stacks)
+    {
+      free (yyss);
+      free (yyvs);
+#ifdef YYLSP_NEEDED
+      free (yyls);
+#endif
+    }
+  return 0;
+
+ yyabortlab:
+  /* YYABORT comes here.  */
+  if (yyfree_stacks)
+    {
+      free (yyss);
+      free (yyvs);
+#ifdef YYLSP_NEEDED
+      free (yyls);
+#endif
+    }
+  return 1;
+}
+#line 911 "parse.y"
+
+
+
+/* build_eof_action - build the "<<EOF>>" action for the active start
+ *                    conditions
+ */
+
+void build_eof_action()
+	{
+	register int i;
+	char action_text[MAXLINE];
+
+	for ( i = 1; i <= scon_stk_ptr; ++i )
+		{
+		if ( sceof[scon_stk[i]] )
+			format_pinpoint_message(
+				"multiple <<EOF>> rules for start condition %s",
+				scname[scon_stk[i]] );
+
+		else
+			{
+			sceof[scon_stk[i]] = true;
+			sprintf( action_text, "case YY_STATE_EOF(%s):\n",
+				scname[scon_stk[i]] );
+			add_action( action_text );
+			}
+		}
+
+	line_directive_out( (FILE *) 0, 1 );
+
+	/* This isn't a normal rule after all - don't count it as
+	 * such, so we don't have any holes in the rule numbering
+	 * (which make generating "rule can never match" warnings
+	 * more difficult.
+	 */
+	--num_rules;
+	++num_eof_rules;
+	}
+
+
+/* format_synerr - write out formatted syntax error */
+
+void format_synerr( msg, arg )
+const char *msg, arg[];
+	{
+	char errmsg[MAXLINE];
+
+	(void) sprintf( errmsg, msg, arg );
+	synerr( errmsg );
+	}
+
+
+/* synerr - report a syntax error */
+
+void synerr( str )
+const char *str;
+	{
+	syntaxerror = true;
+	pinpoint_message( str );
+	}
+
+
+/* format_warn - write out formatted warning */
+
+void format_warn( msg, arg )
+const char *msg, arg[];
+	{
+	char warn_msg[MAXLINE];
+
+	(void) sprintf( warn_msg, msg, arg );
+	warn( warn_msg );
+	}
+
+
+/* warn - report a warning, unless -w was given */
+
+void warn( str )
+const char *str;
+	{
+	line_warning( str, linenum );
+	}
+
+/* format_pinpoint_message - write out a message formatted with one string,
+ *			     pinpointing its location
+ */
+
+void format_pinpoint_message( msg, arg )
+const char *msg, arg[];
+	{
+	char errmsg[MAXLINE];
+
+	(void) sprintf( errmsg, msg, arg );
+	pinpoint_message( errmsg );
+	}
+
+
+/* pinpoint_message - write out a message, pinpointing its location */
+
+void pinpoint_message( str )
+const char *str;
+	{
+	line_pinpoint( str, linenum );
+	}
+
+
+/* line_warning - report a warning at a given line, unless -w was given */
+
+void line_warning( str, line )
+const char *str;
+int line;
+	{
+	char warning[MAXLINE];
+
+	if ( ! nowarn )
+		{
+		sprintf( warning, "warning, %s", str );
+		line_pinpoint( warning, line );
+		}
+	}
+
+
+/* line_pinpoint - write out a message, pinpointing it at the given line */
+
+void line_pinpoint( str, line )
+const char *str;
+int line;
+	{
+	fprintf( stderr, "%s:%d: %s\n", infilename, line, str );
+	}
+
+
+/* yyerror - eat up an error message from the parser;
+ *	     currently, messages are ignore
+ */
+
+void yyerror( msg )
+const char *msg;
+	{
+	}