
/*  A Bison parser, made from xftgram.y
    by GNU Bison version 1.28  */

#define YYBISON 1  /* Identify Bison output.  */

#define yyparse KfiXftConfigparse
#define yylex KfiXftConfiglex
#define yyerror KfiXftConfigerror
#define yylval KfiXftConfiglval
#define yychar KfiXftConfigchar
#define yydebug KfiXftConfigdebug
#define yynerrs KfiXftConfignerrs
#define	INTEGER	257
#define	DOUBLE	258
#define	STRING	259
#define	NAME	260
#define	ANY	261
#define	ALL	262
#define	DIR	263
#define	INCLUDE	264
#define	INCLUDEIF	265
#define	MATCH	266
#define	EDIT	267
#define	TOK_TRUE	268
#define	TOK_FALSE	269
#define	TOK_NIL	270
#define	EQUAL	271
#define	SEMI	272
#define	QUEST	273
#define	COLON	274
#define	OROR	275
#define	ANDAND	276
#define	EQEQ	277
#define	NOTEQ	278
#define	LESS	279
#define	LESSEQ	280
#define	MORE	281
#define	MOREEQ	282
#define	PLUS	283
#define	MINUS	284
#define	TIMES	285
#define	DIVIDE	286
#define	NOT	287

#line 25 "xftgram.y"


#include <stdlib.h>
#include <stdio.h>
#include "xftint.h"


#line 33 "xftgram.y"
typedef union {
    int		ival;
    double	dval;
    char	*sval;
    XftExpr	*eval;
    XftPattern	*pval;
    XftValue	vval;
    XftEdit	*Eval;
    XftOp	oval;
    XftQual	qval;
    XftTest	*tval;
} YYSTYPE;
#ifndef YYDEBUG
#define YYDEBUG 1
#endif

#include <stdio.h>

#ifndef __cplusplus
#ifndef __STDC__
#define const
#endif
#endif



#define	YYFINAL		83
#define	YYFLAG		-32768
#define	YYNTBASE	34

#define YYTRANSLATE(x) ((unsigned)(x) <= 287 ? yytranslate[x] : 46)

static const char yytranslate[] = {     0,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     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,    33
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     3,     4,     7,    10,    13,    18,    21,    22,    27,
    29,    31,    32,    34,    36,    38,    40,    42,    44,    46,
    48,    50,    52,    54,    56,    58,    60,    63,    64,    69,
    71,    74,    77,    79,    81,    83,    85,    87,    89,    91,
    95,    99,   103,   107,   111,   115,   119,   123,   127,   131,
   135,   139,   142
};

static const short yyrhs[] = {    34,
    35,     0,     0,     9,     5,     0,    10,     5,     0,    11,
     5,     0,    12,    36,    13,    42,     0,    37,    36,     0,
     0,    38,    39,    40,    41,     0,     7,     0,     8,     0,
     0,     6,     0,    17,     0,    23,     0,    24,     0,    25,
     0,    26,     0,    27,     0,    28,     0,     3,     0,     4,
     0,     5,     0,    14,     0,    15,     0,    16,     0,    43,
    42,     0,     0,    39,    44,    45,    18,     0,    17,     0,
    29,    17,     0,    17,    29,     0,     3,     0,     4,     0,
     5,     0,    14,     0,    15,     0,    16,     0,     6,     0,
    45,    21,    45,     0,    45,    22,    45,     0,    45,    23,
    45,     0,    45,    24,    45,     0,    45,    25,    45,     0,
    45,    26,    45,     0,    45,    27,    45,     0,    45,    28,
    45,     0,    45,    29,    45,     0,    45,    30,    45,     0,
    45,    31,    45,     0,    45,    32,    45,     0,    33,    45,
     0,    45,    19,    45,    20,    45,     0
};

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
    73,    74,    76,    78,    80,    82,    85,    87,    90,    93,
    95,    97,   100,   105,   107,   109,   111,   113,   115,   117,
   120,   125,   130,   135,   140,   145,   150,   152,   155,   158,
   160,   162,   165,   167,   169,   171,   173,   175,   177,   179,
   181,   183,   185,   187,   189,   191,   193,   195,   197,   199,
   201,   203,   205
};
#endif


#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)

static const char * const yytname[] = {   "$","error","$undefined.","INTEGER",
"DOUBLE","STRING","NAME","ANY","ALL","DIR","INCLUDE","INCLUDEIF","MATCH","EDIT",
"TOK_TRUE","TOK_FALSE","TOK_NIL","EQUAL","SEMI","QUEST","COLON","OROR","ANDAND",
"EQEQ","NOTEQ","LESS","LESSEQ","MORE","MOREEQ","PLUS","MINUS","TIMES","DIVIDE",
"NOT","configs","config","tests","test","qual","field","compare","value","edits",
"edit","eqop","expr", NULL
};
#endif

static const short yyr1[] = {     0,
    34,    34,    35,    35,    35,    35,    36,    36,    37,    38,
    38,    38,    39,    40,    40,    40,    40,    40,    40,    40,
    41,    41,    41,    41,    41,    41,    42,    42,    43,    44,
    44,    44,    45,    45,    45,    45,    45,    45,    45,    45,
    45,    45,    45,    45,    45,    45,    45,    45,    45,    45,
    45,    45,    45
};

static const short yyr2[] = {     0,
     2,     0,     2,     2,     2,     4,     2,     0,     4,     1,
     1,     0,     1,     1,     1,     1,     1,     1,     1,     1,
     1,     1,     1,     1,     1,     1,     2,     0,     4,     1,
     2,     2,     1,     1,     1,     1,     1,     1,     1,     3,
     3,     3,     3,     3,     3,     3,     3,     3,     3,     3,
     3,     2,     5
};

static const short yydefact[] = {     2,
     0,     0,     0,     0,     8,     1,     3,     4,     5,    10,
    11,     0,     8,     0,    28,     7,    13,     0,     0,     6,
    28,    14,    15,    16,    17,    18,    19,    20,     0,    30,
     0,     0,    27,    21,    22,    23,    24,    25,    26,     9,
    32,    31,    33,    34,    35,    39,    36,    37,    38,     0,
     0,    52,    29,     0,     0,     0,     0,     0,     0,     0,
     0,     0,     0,     0,     0,     0,     0,    40,    41,    42,
    43,    44,    45,    46,    47,    48,    49,    50,    51,     0,
    53,     0,     0
};

static const short yydefgoto[] = {     1,
     6,    12,    13,    14,    19,    29,    40,    20,    21,    32,
    51
};

static const short yypact[] = {-32768,
    84,    -2,    13,    14,    79,-32768,-32768,-32768,-32768,-32768,
-32768,    15,    79,    30,    30,-32768,-32768,    80,     0,-32768,
    30,-32768,-32768,-32768,-32768,-32768,-32768,-32768,    76,    20,
    49,    17,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,    17,
    16,-32768,-32768,    17,    17,    17,    17,    17,    17,    17,
    17,    17,    17,    17,    17,    17,    32,    87,    97,   105,
   105,    -5,    -5,    -5,    -5,   -30,   -30,-32768,-32768,    17,
    46,    82,-32768
};

static const short yypgoto[] = {-32768,
-32768,    70,-32768,-32768,    74,-32768,-32768,    68,-32768,-32768,
   -50
};


#define	YYLAST		137


static const short yytable[] = {    52,
    65,    66,     7,    67,    68,    69,    70,    71,    72,    73,
    74,    75,    76,    77,    78,    79,    30,     8,     9,    43,
    44,    45,    46,    63,    64,    65,    66,    15,    31,    81,
    47,    48,    49,    53,    54,    17,    55,    56,    57,    58,
    59,    60,    61,    62,    63,    64,    65,    66,    41,    50,
    54,    80,    55,    56,    57,    58,    59,    60,    61,    62,
    63,    64,    65,    66,    54,    42,    55,    56,    57,    58,
    59,    60,    61,    62,    63,    64,    65,    66,    34,    35,
    36,    83,    16,    82,   -12,    10,    11,    18,    33,    37,
    38,    39,     2,     3,     4,     5,    22,     0,     0,     0,
     0,     0,    23,    24,    25,    26,    27,    28,    56,    57,
    58,    59,    60,    61,    62,    63,    64,    65,    66,    57,
    58,    59,    60,    61,    62,    63,    64,    65,    66,    59,
    60,    61,    62,    63,    64,    65,    66
};

static const short yycheck[] = {    50,
    31,    32,     5,    54,    55,    56,    57,    58,    59,    60,
    61,    62,    63,    64,    65,    66,    17,     5,     5,     3,
     4,     5,     6,    29,    30,    31,    32,    13,    29,    80,
    14,    15,    16,    18,    19,     6,    21,    22,    23,    24,
    25,    26,    27,    28,    29,    30,    31,    32,    29,    33,
    19,    20,    21,    22,    23,    24,    25,    26,    27,    28,
    29,    30,    31,    32,    19,    17,    21,    22,    23,    24,
    25,    26,    27,    28,    29,    30,    31,    32,     3,     4,
     5,     0,    13,     0,     6,     7,     8,    14,    21,    14,
    15,    16,     9,    10,    11,    12,    17,    -1,    -1,    -1,
    -1,    -1,    23,    24,    25,    26,    27,    28,    22,    23,
    24,    25,    26,    27,    28,    29,    30,    31,    32,    23,
    24,    25,    26,    27,    28,    29,    30,    31,    32,    25,
    26,    27,    28,    29,    30,    31,    32
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/share/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 YYPARSE_RETURN_TYPE
#define YYPARSE_RETURN_TYPE int
#endif


#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 222 "/usr/share/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
YYPARSE_RETURN_TYPE
yyparse (void *);
#else
YYPARSE_RETURN_TYPE
yyparse (void);
#endif
#endif

YYPARSE_RETURN_TYPE
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;
#ifndef YYSTACK_USE_ALLOCA
  int yyfree_stacks = 0;
#endif

#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");
#ifndef YYSTACK_USE_ALLOCA
	  if (yyfree_stacks)
	    {
	      free (yyss);
	      free (yyvs);
#ifdef YYLSP_NEEDED
	      free (yyls);
#endif
	    }
#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 3:
#line 77 "xftgram.y"
{ XftConfigAddDir (yyvsp[0].sval); ;
    break;}
case 4:
#line 79 "xftgram.y"
{ XftConfigPushInput (yyvsp[0].sval, True); ;
    break;}
case 5:
#line 81 "xftgram.y"
{ XftConfigPushInput (yyvsp[0].sval, False); ;
    break;}
case 6:
#line 83 "xftgram.y"
{ XftConfigAddEdit (yyvsp[-2].tval, yyvsp[0].Eval); ;
    break;}
case 7:
#line 86 "xftgram.y"
{ yyvsp[-1].tval->next = yyvsp[0].tval; yyval.tval = yyvsp[-1].tval; ;
    break;}
case 8:
#line 88 "xftgram.y"
{ yyval.tval = 0; ;
    break;}
case 9:
#line 91 "xftgram.y"
{ yyval.tval = XftTestCreate (yyvsp[-3].qval, yyvsp[-2].sval, yyvsp[-1].oval, yyvsp[0].vval); ;
    break;}
case 10:
#line 94 "xftgram.y"
{ yyval.qval = XftQualAny; ;
    break;}
case 11:
#line 96 "xftgram.y"
{ yyval.qval = XftQualAll; ;
    break;}
case 12:
#line 98 "xftgram.y"
{ yyval.qval = XftQualAny; ;
    break;}
case 13:
#line 101 "xftgram.y"
{ 
		    yyval.sval = XftConfigSaveField (yyvsp[0].sval); 
		;
    break;}
case 14:
#line 106 "xftgram.y"
{ yyval.oval = XftOpEqual; ;
    break;}
case 15:
#line 108 "xftgram.y"
{ yyval.oval = XftOpEqual; ;
    break;}
case 16:
#line 110 "xftgram.y"
{ yyval.oval = XftOpNotEqual; ;
    break;}
case 17:
#line 112 "xftgram.y"
{ yyval.oval = XftOpLess; ;
    break;}
case 18:
#line 114 "xftgram.y"
{ yyval.oval = XftOpLessEqual; ;
    break;}
case 19:
#line 116 "xftgram.y"
{ yyval.oval = XftOpMore; ;
    break;}
case 20:
#line 118 "xftgram.y"
{ yyval.oval = XftOpMoreEqual; ;
    break;}
case 21:
#line 121 "xftgram.y"
{
		    yyval.vval.type = XftTypeInteger;
		    yyval.vval.u.i = yyvsp[0].ival;
		;
    break;}
case 22:
#line 126 "xftgram.y"
{
		    yyval.vval.type = XftTypeDouble;
		    yyval.vval.u.d = yyvsp[0].dval;
		;
    break;}
case 23:
#line 131 "xftgram.y"
{
		    yyval.vval.type = XftTypeString;
		    yyval.vval.u.s = yyvsp[0].sval;
		;
    break;}
case 24:
#line 136 "xftgram.y"
{
		    yyval.vval.type = XftTypeBool;
		    yyval.vval.u.b = True;
		;
    break;}
case 25:
#line 141 "xftgram.y"
{
		    yyval.vval.type = XftTypeBool;
		    yyval.vval.u.b = False;
		;
    break;}
case 26:
#line 146 "xftgram.y"
{
		    yyval.vval.type = XftTypeVoid;
		;
    break;}
case 27:
#line 151 "xftgram.y"
{ yyvsp[-1].Eval->next = yyvsp[0].Eval; yyval.Eval = yyvsp[-1].Eval; ;
    break;}
case 28:
#line 153 "xftgram.y"
{ yyval.Eval = 0; ;
    break;}
case 29:
#line 156 "xftgram.y"
{ yyval.Eval = XftEditCreate (yyvsp[-3].sval, yyvsp[-2].oval, yyvsp[-1].eval); ;
    break;}
case 30:
#line 159 "xftgram.y"
{ yyval.oval = XftOpAssign; ;
    break;}
case 31:
#line 161 "xftgram.y"
{ yyval.oval = XftOpPrepend; ;
    break;}
case 32:
#line 163 "xftgram.y"
{ yyval.oval = XftOpAppend; ;
    break;}
case 33:
#line 166 "xftgram.y"
{ yyval.eval = XftExprCreateInteger (yyvsp[0].ival); ;
    break;}
case 34:
#line 168 "xftgram.y"
{ yyval.eval = XftExprCreateDouble (yyvsp[0].dval); ;
    break;}
case 35:
#line 170 "xftgram.y"
{ yyval.eval = XftExprCreateString (yyvsp[0].sval); ;
    break;}
case 36:
#line 172 "xftgram.y"
{ yyval.eval = XftExprCreateBool (True); ;
    break;}
case 37:
#line 174 "xftgram.y"
{ yyval.eval = XftExprCreateBool (False); ;
    break;}
case 38:
#line 176 "xftgram.y"
{ yyval.eval = XftExprCreateNil (); ;
    break;}
case 39:
#line 178 "xftgram.y"
{ yyval.eval = XftExprCreateField (yyvsp[0].sval); ;
    break;}
case 40:
#line 180 "xftgram.y"
{ yyval.eval = XftExprCreateOp (yyvsp[-2].eval, XftOpOr, yyvsp[0].eval); ;
    break;}
case 41:
#line 182 "xftgram.y"
{ yyval.eval = XftExprCreateOp (yyvsp[-2].eval, XftOpAnd, yyvsp[0].eval); ;
    break;}
case 42:
#line 184 "xftgram.y"
{ yyval.eval = XftExprCreateOp (yyvsp[-2].eval, XftOpEqual, yyvsp[0].eval); ;
    break;}
case 43:
#line 186 "xftgram.y"
{ yyval.eval = XftExprCreateOp (yyvsp[-2].eval, XftOpNotEqual, yyvsp[0].eval); ;
    break;}
case 44:
#line 188 "xftgram.y"
{ yyval.eval = XftExprCreateOp (yyvsp[-2].eval, XftOpLess, yyvsp[0].eval); ;
    break;}
case 45:
#line 190 "xftgram.y"
{ yyval.eval = XftExprCreateOp (yyvsp[-2].eval, XftOpLessEqual, yyvsp[0].eval); ;
    break;}
case 46:
#line 192 "xftgram.y"
{ yyval.eval = XftExprCreateOp (yyvsp[-2].eval, XftOpMore, yyvsp[0].eval); ;
    break;}
case 47:
#line 194 "xftgram.y"
{ yyval.eval = XftExprCreateOp (yyvsp[-2].eval, XftOpMoreEqual, yyvsp[0].eval); ;
    break;}
case 48:
#line 196 "xftgram.y"
{ yyval.eval = XftExprCreateOp (yyvsp[-2].eval, XftOpPlus, yyvsp[0].eval); ;
    break;}
case 49:
#line 198 "xftgram.y"
{ yyval.eval = XftExprCreateOp (yyvsp[-2].eval, XftOpMinus, yyvsp[0].eval); ;
    break;}
case 50:
#line 200 "xftgram.y"
{ yyval.eval = XftExprCreateOp (yyvsp[-2].eval, XftOpTimes, yyvsp[0].eval); ;
    break;}
case 51:
#line 202 "xftgram.y"
{ yyval.eval = XftExprCreateOp (yyvsp[-2].eval, XftOpDivide, yyvsp[0].eval); ;
    break;}
case 52:
#line 204 "xftgram.y"
{ yyval.eval = XftExprCreateOp (yyvsp[0].eval, XftOpNot, (XftExpr *) 0); ;
    break;}
case 53:
#line 206 "xftgram.y"
{ yyval.eval = XftExprCreateOp (yyvsp[-4].eval, XftOpQuest, XftExprCreateOp (yyvsp[-2].eval, XftOpQuest, yyvsp[0].eval)); ;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 554 "/usr/share/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.  */
#ifndef YYSTACK_USE_ALLOCA
  if (yyfree_stacks)
    {
      free (yyss);
      free (yyvs);
#ifdef YYLSP_NEEDED
      free (yyls);
#endif
    }
#endif
  return 0;

 yyabortlab:
  /* YYABORT comes here.  */
#ifndef YYSTACK_USE_ALLOCA
  if (yyfree_stacks)
    {
      free (yyss);
      free (yyvs);
#ifdef YYLSP_NEEDED
      free (yyls);
#endif
    }
#endif    
  return 1;
}
#line 208 "xftgram.y"


int
XftConfigwrap (void)
{
    return 1;
}

void
XftConfigerror (char *fmt, ...)
{
    va_list	args;

    fprintf (stderr, "\"%s\": line %d, ", XftConfigFile, XftConfigLineno);
    va_start (args, fmt);
    vfprintf (stderr, fmt, args);
    va_end (args);
    fprintf (stderr, "\n");
}

XftTest *
XftTestCreate (XftQual qual, const char *field, XftOp compare, XftValue value)
{
    XftTest	*test = (XftTest *) malloc (sizeof (XftTest));;

    if (test)
    {
	test->next = 0;
	test->qual = qual;
	test->field = _XftSaveString (field);
	test->op = compare;
	if (value.type == XftTypeString)
	    value.u.s = _XftSaveString (value.u.s);
	test->value = value;
    }
    return test;
}

XftExpr *
XftExprCreateInteger (int i)
{
    XftExpr *e = (XftExpr *) malloc (sizeof (XftExpr));

    if (e)
    {
	e->op = XftOpInteger;
	e->u.ival = i;
    }
    return e;
}

XftExpr *
XftExprCreateDouble (double d)
{
    XftExpr *e = (XftExpr *) malloc (sizeof (XftExpr));

    if (e)
    {
	e->op = XftOpDouble;
	e->u.dval = d;
    }
    return e;
}

XftExpr *
XftExprCreateString (const char *s)
{
    XftExpr *e = (XftExpr *) malloc (sizeof (XftExpr));

    if (e)
    {
	e->op = XftOpString;
	e->u.sval = _XftSaveString (s);
    }
    return e;
}

XftExpr *
XftExprCreateBool (Bool b)
{
    XftExpr *e = (XftExpr *) malloc (sizeof (XftExpr));

    if (e)
    {
	e->op = XftOpBool;
	e->u.bval = b;
    }
    return e;
}

XftExpr *
XftExprCreateNil (void)
{
    XftExpr *e = (XftExpr *) malloc (sizeof (XftExpr));

    if (e)
    {
	e->op = XftOpNil;
    }
    return e;
}

XftExpr *
XftExprCreateField (const char *field)
{
    XftExpr *e = (XftExpr *) malloc (sizeof (XftExpr));

    if (e)
    {
	e->op = XftOpField;
	e->u.field = _XftSaveString (field);
    }
    return e;
}

XftExpr *
XftExprCreateOp (XftExpr *left, XftOp op, XftExpr *right)
{
    XftExpr *e = (XftExpr *) malloc (sizeof (XftExpr));

    if (e)
    {
	e->op = op;
	e->u.tree.left = left;
	e->u.tree.right = right;
    }
    return e;
}

void
XftExprDestroy (XftExpr *e)
{
    switch (e->op) {
    case XftOpInteger:
	break;
    case XftOpDouble:
	break;
    case XftOpString:
	free (e->u.sval);
	break;
    case XftOpBool:
	break;
    case XftOpField:
	free (e->u.field);
	break;
    case XftOpAssign:
    case XftOpPrepend:
    case XftOpAppend:
	break;
    case XftOpOr:
    case XftOpAnd:
    case XftOpEqual:
    case XftOpNotEqual:
    case XftOpLess:
    case XftOpLessEqual:
    case XftOpMore:
    case XftOpMoreEqual:
    case XftOpPlus:
    case XftOpMinus:
    case XftOpTimes:
    case XftOpDivide:
    case XftOpQuest:
	XftExprDestroy (e->u.tree.right);
	/* fall through */
    case XftOpNot:
	XftExprDestroy (e->u.tree.left);
	break;
    case XftOpNil:
	break;
    }
    free (e);
}

XftEdit *
XftEditCreate (const char *field, XftOp op, XftExpr *expr)
{
    XftEdit *e = (XftEdit *) malloc (sizeof (XftEdit));

    if (e)
    {
	e->next = 0;
	e->field = _XftSaveString (field);
	e->op = op;
	e->expr = expr;
    }
    return e;
}

void
XftEditDestroy (XftEdit *e)
{
    if (e->next)
	XftEditDestroy (e->next);
    free ((void *) e->field);
    if (e->expr)
	XftExprDestroy (e->expr);
}

char *
XftConfigSaveField (const char *field)
{
    return _XftSaveString (field);
}
