---

yacc_out_ebnf.c

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

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

#define yyparse ebnf_parse
#define yylex ebnf_lex
#define yyerror ebnf_error
#define yylval ebnf_lval
#define yychar ebnf_char
#define yydebug ebnf_debug
#define yynerrs ebnf_nerrs
#define NEW 257
#define POST_NAMING_FUNCTION    258
#define FUNCTION_NAME   259
#define XML_FUNCTION    260
#define XMLNS_FUNCTION  261
#define EXTERNAL_FUNCTION   262
#define WORD    263
#define WORD_FOR_CONTENT    264
#define WORD_FOR_TEXT   265
#define PRODUCES    266
#define LABEL   267
#define CHARACTER_SET   268
#define DQSTRING    269
#define SQSTRING    270
#define SENDTO  271
#define IF  272
#define THEN    273
#define END 274
#define DEFINE  275
#define ADDTO   276
#define INCLUDEIN   277
#define INFER   278
#define WHEN    279
#define SPAWN   280
#define CONTAINS    281
#define NOT 282
#define APPENDTOTEXT    283
#define OUTPUT  284
#define ADD 285
#define INCLUDE 286
#define IN  287
#define TEXTBUFFER  288
#define CLEARTEXT   289
#define INTEGER 290
#define REPEAT_FUNCTION 291
#define PREFIXCOMMAND   292

#line 2 "ebnf.c.y"


  /*

    There's an odd tension in using yacc -- do you build the
    output on yacc's stack or in some global space...?  Which approach
    seems best seems to vary a lot. 
    

    This grammar is funny in that rules and expressions are
    treated as different things, but I don't think they need
    to be.  If they are not, then we need the regexp postfix 
    operators in normal code, but I think that's fine.

    Oh -- and that darned " " omitted operator.  Foo.  That should be
    a comma to make everything beautiful.   It clears up any
    ambiguity on * + and ?, too.

    also, we have XML_FUNCTION and XMLNS_FUNCTION as tokens which 
    is probably also not necessary, when I have the model clear
    enough.


    The meaning of ::= ?
    It turns into SOMETHING about some input.....

   */

#ifndef lint
static char id[] = "$Id: yacc__out__ebnf_8c-source.html,v 1.9 2001/10/10 20:41:00 sandro Exp $";
#endif

#include <stdio.h>
#include <assert.h>
#include <string.h>
#include <malloc.h>
#include <stdlib.h>   /* for atoi */
#include "hashmap.h"

#define NOT_IMPLEMENTED if (1) { fprintf(stderr, "Feature not yet implemented (%s:%d).\n", __FILE__, __LINE__); abort(); }

/* ****************************************************************

       LEXER STUFF  (input)

**************************************************************** */

#include "ebnf.h"
extern int yylex();

extern FILE *yyin;
extern char *lexer_source_begin;
extern char *lexer_source_end;
extern char *yytext;
extern int lineno;
extern char linebuf[];

int lineno=0;

char* lexer_source_begin;
char* lexer_source_end;

/* ****************************************************************

       GRAMMAR STUFF   (output)

**************************************************************** */

#define UNLIM -1

#include "abstract_grammar.h"

Grammar *grammar;
Rule* current_rule;
Branch* current_branch;

int stack_pointer=0;
#define STACK_SIZE 2   /* maximum nesting of parens and such */
Rule *rule_stack[STACK_SIZE];
Branch *branch_stack[STACK_SIZE];
void push();
void pop();
void repeated(int min, int max);
void charset();

struct defined_word {
    char* string; 
    enum part part;
};

static void new_word(char *);
static void clear_words();
static int defined_word_search(char *);

static Hashmap prefixMap;

static struct value* new_current_content();
static void add_prefix(char*, char*);
static char* with_prefix(char*, char*, char*);

// Only do deletes if they are POINTERS on the stack
//#define YYDELETEVAL(x,y) delete x
//#define YYDELETEPOSN(x,y) delete x
#define YYDELETEVAL(x,y) 
#define YYDELETEPOSN(x,y)


#line 135 "ebnf.c.y"
typedef union {
  char *as_c_string;
  int as_integer;
  struct action *as_action;
  struct condition *as_condition;
  struct value *as_value;
  struct defined_word *as_defined_word;
} YYSTYPE;
#include <stdio.h>

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



#define YYFINAL     157
#define YYFLAG      -32768
#define YYNTBASE    53

#define YYTRANSLATE(x) ((unsigned)(x) <= 292 ? yytranslate[x] : 90)

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,    45,
    44,    49,    50,    42,    48,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,    52,    39,     2,
    43,     2,    51,    47,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,    40,    46,    41,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     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,    34,    35,    36,
    37,    38
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     2,     4,     7,     8,    10,    16,    20,    21,    23,
    25,    27,    28,    30,    34,    38,    42,    45,    48,    52,
    55,    59,    62,    65,    67,    74,    79,    84,    89,    94,
    97,   101,   106,   109,   111,   113,   115,   119,   123,   125,
   127,   131,   133,   135,   137,   139,   143,   145,   147,   149,
   151,   153,   154,   156,   158,   162,   164,   166,   167,   172,
   174,   177,   179,   181,   185,   189,   192,   195,   198,   204,
   212,   213,   219,   220,   225,   227,   229,   231,   237,   243,
   247,   251,   253,   255,   257,   259,   261
};

static const short yyrhs[] = {    54,
     0,    56,     0,    56,    54,     0,     0,    39,     0,    57,
    58,    12,    59,    55,     0,    57,    61,    39,     0,     0,
    13,     0,    86,     0,    75,     0,     0,    61,     0,    61,
    39,    60,     0,    40,    60,    41,     0,    38,    86,    87,
     0,     3,    86,     0,    30,    86,     0,    22,    66,    66,
     0,    31,    66,     0,    23,    66,    66,     0,    32,    66,
     0,    29,    66,     0,    35,     0,    33,    66,    25,    64,
    24,    61,     0,    24,    64,    25,    61,     0,    25,    64,
    24,    61,     0,    26,    62,    42,    63,     0,    17,    62,
    42,    66,     0,    21,     1,     0,    21,    86,     1,     0,
    21,    86,    43,     1,     0,    22,     1,     0,     9,     0,
     9,     0,    65,     0,    65,    39,    64,     0,    86,    27,
    66,     0,    67,     0,    69,     0,    68,    72,    44,     0,
     5,     0,    70,     0,    71,     0,    84,     0,    45,    66,
    44,     0,    87,     0,    34,     0,    86,     0,    10,     0,
    11,     0,     0,    73,     0,    74,     0,    74,    42,    73,
     0,    66,     0,    77,     0,     0,    77,    46,    76,    75,
     0,    79,     0,    77,    79,     0,    47,     0,    81,     0,
    79,    78,    61,     0,    81,    48,    81,     0,    81,    49,
     0,    81,    50,     0,    81,    51,     0,    37,    81,    42,
    89,    44,     0,    37,    81,    42,    89,    42,    89,    44,
     0,     0,    81,     4,    86,    80,    44,     0,     0,    45,
    82,    75,    44,     0,    87,     0,    86,     0,    85,     0,
     6,    83,    42,    75,    44,     0,     8,    86,    42,    87,
    44,     0,    86,    52,    86,     0,    86,    52,    86,     0,
    14,     0,     9,     0,    88,     0,    16,     0,    15,     0,
    36,     0
};

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
   159,   162,   163,   166,   166,   168,   172,   184,   185,   188,
   195,   202,   206,   207,   218,   220,   225,   231,   238,   245,
   252,   259,   266,   272,   277,   278,   279,   280,   281,   283,
   284,   285,   286,   288,   289,   307,   308,   315,   327,   336,
   337,   358,   365,   368,   385,   386,   388,   394,   401,   408,
   415,   424,   426,   429,   430,   437,   447,   448,   450,   451,
   452,   455,   458,   459,   464,   465,   466,   467,   468,   472,
   476,   481,   482,   486,   496,   525,   533,   534,   535,   538,
   542,   550,   556,   560,   566,   567,   570
};
#endif


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

static const char * const yytname[] = {   "$","error","$undefined.","NEW","POST_NAMING_FUNCTION",
"FUNCTION_NAME","XML_FUNCTION","XMLNS_FUNCTION","EXTERNAL_FUNCTION","WORD","WORD_FOR_CONTENT",
"WORD_FOR_TEXT","PRODUCES","LABEL","CHARACTER_SET","DQSTRING","SQSTRING","SENDTO",
"IF","THEN","END","DEFINE","ADDTO","INCLUDEIN","INFER","WHEN","SPAWN","CONTAINS",
"NOT","APPENDTOTEXT","OUTPUT","ADD","INCLUDE","IN","TEXTBUFFER","CLEARTEXT",
"INTEGER","REPEAT_FUNCTION","PREFIXCOMMAND","';'","'{'","'}'","','","'='","')'",
"'('","'|'","'@'","'-'","'*'","'+'","'?'","':'","grammar","clauses","optional_semi",
"clause","optional_label","left","right","actions","action","portname","production",
"compound_boolean_expression","boolean_expression","expr","expr10","function_name",
"expr20","expr90","defined_word","parameters","non_empty_parameters","parameter",
"pattern","@1","branch","annotation_flag","term_expr","@2","term","@3","xmlqname",
"rdfqname","charset","word","string","quoted_string","integer", NULL
};
#endif

static const short yyr1[] = {     0,
    53,    54,    54,    55,    55,    56,    56,    57,    57,    58,
    59,    60,    60,    60,    61,    61,    61,    61,    61,    61,
    61,    61,    61,    61,    61,    61,    61,    61,    61,    61,
    61,    61,    61,    62,    63,    64,    64,    65,    66,    67,
    67,    68,    69,    70,    70,    70,    70,    70,    71,    71,
    71,    72,    72,    73,    73,    74,    75,    76,    75,    77,
    77,    78,    79,    79,    79,    79,    79,    79,    79,    79,
    80,    79,    82,    81,    81,    81,    81,    81,    81,    83,
    84,    85,    86,    87,    88,    88,    89
};

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

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

static const short yydefgoto[] = {   155,
     2,   118,     3,     4,    23,    90,    61,    62,    28,   109,
    50,    51,    70,    40,    41,    42,    43,    44,    71,    72,
    73,    91,   135,    92,   122,    93,   147,    94,   116,   112,
    45,    95,    46,    47,    48,   144
};

static const short yypact[] = {     3,
-32768,-32768,    22,   157,-32768,    19,-32768,    24,    29,     9,
   100,    19,    19,    24,   100,    19,   100,   100,   100,-32768,
    19,   181,    25,    -8,-32768,-32768,-32768,    -3,-32768,    12,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,   100,   100,-32768,
   100,-32768,-32768,-32768,-32768,   -11,-32768,-32768,   100,    15,
     5,    18,    32,     0,-32768,-32768,-32768,-32768,    21,    11,
     7,    10,   127,-32768,   100,-32768,    56,    14,-32768,-32768,
    17,-32768,    20,    19,-32768,   181,    19,   100,   181,    54,
    19,-32768,-32768,   181,    19,    19,-32768,   140,-32768,    27,
-32768,    92,    33,     2,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,   100,-32768,-32768,-32768,-32768,-32768,-32768,-32768,    40,
-32768,    30,    31,    45,    47,   127,-32768,-32768,-32768,    33,
-32768,   181,    19,   140,-32768,-32768,-32768,-32768,   181,   127,
    19,    11,    35,    23,   127,-32768,-32768,-32768,-32768,    51,
-32768,    52,-32768,   -21,-32768,-32768,    53,-32768,-32768,    35,
-32768,-32768,    55,-32768,    91,   102,-32768
};

static const short yypgoto[] = {-32768,
   101,-32768,-32768,-32768,-32768,-32768,    34,    -1,    89,-32768,
   -12,-32768,    75,-32768,-32768,-32768,-32768,-32768,-32768,    28,
-32768,  -101,-32768,-32768,-32768,    58,-32768,   -77,-32768,-32768,
-32768,-32768,    -4,   -56,-32768,   -33
};


#define YYLAST      221


static const short yytable[] = {    25,
    53,    26,    24,    82,    30,   123,    97,    52,    52,    31,
   115,    56,    66,    32,   134,     1,    60,     7,    33,    34,
   150,    -2,   151,    35,    36,    35,    36,     7,   140,    29,
    64,    97,    27,   146,     1,    97,    63,     7,    65,    76,
    74,    80,    37,    77,    78,    81,   138,    83,    84,   124,
   125,   126,   127,    38,    67,    79,    99,   100,    96,    97,
   101,   102,   108,   129,   105,   117,   145,    97,   110,   103,
   143,   130,    52,    97,   104,   142,    52,   107,    97,   121,
   113,   114,   131,    96,    39,    49,   132,    96,   133,    55,
   156,    57,    58,    59,   148,   149,   152,    85,   154,    86,
     7,   157,    54,     5,    32,    87,    35,    36,     7,    33,
    34,    96,    68,    69,    35,    36,   153,   111,   137,    96,
   136,     0,     0,    75,     0,    96,   141,   139,    88,   128,
    96,     0,    85,    37,    86,     7,    89,   119,     0,    98,
    87,    35,    36,     0,    38,    85,     0,    86,     7,   120,
     0,     0,   106,    87,    35,    36,     0,     0,     0,     6,
     0,     0,     0,    88,     0,     7,     0,     0,     0,     0,
     0,    89,     0,     8,     0,     0,     0,     9,    10,    11,
    12,    13,    14,     6,    89,    15,    16,    17,    18,    19,
     0,    20,     0,     0,    21,     0,    22,     8,     0,     0,
     0,     9,    10,    11,    12,    13,    14,     0,     0,    15,
    16,    17,    18,    19,     0,    20,     0,     0,    21,     0,
    22
};

static const short yycheck[] = {     4,
    13,     6,     4,    60,     9,     4,    63,    12,    13,     1,
    88,    16,     1,     5,   116,    13,    21,     9,    10,    11,
    42,     0,    44,    15,    16,    15,    16,     9,   130,     1,
    39,    88,     9,   135,    13,    92,    12,     9,    42,    25,
    52,    42,    34,    39,    27,    25,   124,    41,    39,    48,
    49,    50,    51,    45,    43,    24,     1,    44,    63,   116,
    44,    42,     9,    24,    77,    39,    44,   124,    81,    74,
    36,    42,    77,   130,    76,   132,    81,    79,   135,    47,
    85,    86,    52,    88,    10,    11,    42,    92,    42,    15,
     0,    17,    18,    19,    44,    44,    44,     6,    44,     8,
     9,     0,    14,     3,     5,    14,    15,    16,     9,    10,
    11,   116,    38,    39,    15,    16,   150,    84,   123,   124,
   122,    -1,    -1,    49,    -1,   130,   131,   129,    37,   102,
   135,    -1,     6,    34,     8,     9,    45,    46,    -1,    65,
    14,    15,    16,    -1,    45,     6,    -1,     8,     9,    92,
    -1,    -1,    78,    14,    15,    16,    -1,    -1,    -1,     3,
    -1,    -1,    -1,    37,    -1,     9,    -1,    -1,    -1,    -1,
    -1,    45,    -1,    17,    -1,    -1,    -1,    21,    22,    23,
    24,    25,    26,     3,    45,    29,    30,    31,    32,    33,
    -1,    35,    -1,    -1,    38,    -1,    40,    17,    -1,    -1,
    -1,    21,    22,    23,    24,    25,    26,    -1,    -1,    29,
    30,    31,    32,    33,    -1,    35,    -1,    -1,    38,    -1,
    40
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/share/misc/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/share/misc/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 6:
#line 169 "ebnf.c.y"
{ 
       current_rule = 0; 
     ;
    break;}
case 7:
#line 173 "ebnf.c.y"
{ /* add this action to the end of the grammar's general list of actions */
      if (grammar->actions == 0) {
        grammar->actions = yyvsp[-1].as_action;
    grammar->last_action = yyvsp[-1].as_action;
      } else {
        grammar->last_action->next = yyvsp[-1].as_action;
    grammar->last_action = yyvsp[-1].as_action;
      }
    ;
    break;}
case 10:
#line 189 "ebnf.c.y"
{ current_rule = add_rule(grammar, yyvsp[0].as_c_string);
      current_branch = add_branch(current_rule);
      free(yyvsp[0].as_c_string);
    ;
    break;}
case 12:
#line 203 "ebnf.c.y"
{
        yyval.as_action = 0;
      ;
    break;}
case 14:
#line 208 "ebnf.c.y"
{ 
      if (yyvsp[-2].as_action) {
          yyval.as_action = yyvsp[-2].as_action;
          yyvsp[-2].as_action->next = yyvsp[0].as_action;
      } else {
          yyval.as_action = 0;
      }
      ;
    break;}
case 15:
#line 218 "ebnf.c.y"
{   yyval.as_action = yyvsp[-1].as_action;  ;
    break;}
case 16:
#line 221 "ebnf.c.y"
{
      add_prefix(yyvsp[-1].as_c_string, yyvsp[0].as_c_string);
      yyval.as_action = 0;
      ;
    break;}
case 17:
#line 226 "ebnf.c.y"
{
      new_word(yyvsp[0].as_c_string);
      free(yyvsp[0].as_c_string);
      yyval.as_action = 0;
      ;
    break;}
case 18:
#line 232 "ebnf.c.y"
{
      new_word(yyvsp[0].as_c_string);
          grammar->output_name=strdup(yytext);
      free(yyvsp[0].as_c_string);
      yyval.as_action = 0;
      ;
    break;}
case 19:
#line 239 "ebnf.c.y"
{
        yyval.as_action = (Action*) calloc(1, sizeof(Action));
    yyval.as_action->type = addto;
    yyval.as_action->as.addto.set = yyvsp[-1].as_value;
    yyval.as_action->as.addto.object = yyvsp[0].as_value;
      ;
    break;}
case 20:
#line 246 "ebnf.c.y"
{
        yyval.as_action = (Action*) calloc(1, sizeof(Action));
    yyval.as_action->type = addto;
    yyval.as_action->as.addto.set = new_current_content();
    yyval.as_action->as.addto.object = yyvsp[0].as_value;
      ;
    break;}
case 21:
#line 253 "ebnf.c.y"
{
    yyval.as_action = (Action*) calloc(1, sizeof(Action));
    yyval.as_action->type = includein;
    yyval.as_action->as.includein.outer = yyvsp[-1].as_value;
    yyval.as_action->as.includein.inner = yyvsp[0].as_value;
      ;
    break;}
case 22:
#line 260 "ebnf.c.y"
{
    yyval.as_action = (Action*) calloc(1, sizeof(Action));
    yyval.as_action->type = includein;
    yyval.as_action->as.includein.outer = new_current_content();
    yyval.as_action->as.includein.inner = yyvsp[0].as_value;
      ;
    break;}
case 23:
#line 267 "ebnf.c.y"
{
        yyval.as_action = (Action*) calloc(1, sizeof(Action));
    yyval.as_action->type = appendtotext;
    yyval.as_action->as.appendtotext.text = yyvsp[0].as_value;
      ;
    break;}
case 24:
#line 273 "ebnf.c.y"
{
        yyval.as_action = (Action*) calloc(1, sizeof(Action));
    yyval.as_action->type = cleartext;
      ;
    break;}
case 25:
#line 277 "ebnf.c.y"
{ NOT_IMPLEMENTED; ;
    break;}
case 26:
#line 278 "ebnf.c.y"
{ NOT_IMPLEMENTED; ;
    break;}
case 27:
#line 279 "ebnf.c.y"
{ NOT_IMPLEMENTED; ;
    break;}
case 28:
#line 280 "ebnf.c.y"
{ NOT_IMPLEMENTED; ;
    break;}
case 29:
#line 281 "ebnf.c.y"
{ NOT_IMPLEMENTED; ;
    break;}
case 30:
#line 283 "ebnf.c.y"
{ fprintf(stderr, "define not followed by word\n"); ;
    break;}
case 31:
#line 284 "ebnf.c.y"
{ fprintf(stderr, "define word not followed by =\n"); ;
    break;}
case 32:
#line 285 "ebnf.c.y"
{ fprintf(stderr, "define word = not followed by expr\n"); ;
    break;}
case 33:
#line 286 "ebnf.c.y"
{ fprintf(stderr, "usage: addto <word> <tuple>\n"); ;
    break;}
case 38:
#line 316 "ebnf.c.y"
{
        yyval.as_condition = (Condition*) calloc(1, sizeof(Condition));
    yyval.as_condition->type=contains;
    yyval.as_condition->as.contains.container=yyvsp[-2].as_c_string;
    yyval.as_condition->as.contains.object=yyvsp[0].as_value;
      ;
    break;}
case 39:
#line 328 "ebnf.c.y"
{
    yyval.as_value = yyvsp[0].as_value;
    fprintf(stderr, "value is of type %d\n", yyvsp[0].as_value->type);
    ;
    break;}
case 41:
#line 338 "ebnf.c.y"
{
       if (!strcmp(yyvsp[-2].as_c_string, "rdfid")) {
          if (yyvsp[-1].as_value->next) {
        fprintf(stderr, "rdfid() takes only one parameter\n");
        abort();
          }
          yyval.as_value = (Value*) calloc(1, sizeof(Value));
          yyval.as_value->type=rdfid;
      yyval.as_value->as.rdfid.id=yyvsp[-1].as_value->as.literal_string.string;
       } else if (!strcmp(yyvsp[-2].as_c_string, "tuple")) {
          yyval.as_value = (Value*) calloc(1, sizeof(Value));
          yyval.as_value->type=tuple;
      yyval.as_value->as.tuple.first=yyvsp[-1].as_value;
       } else {
         fprintf(stderr, "Function \"%s\" not defined.\n", yyvsp[-2].as_c_string);
     abort();
       }             
     ;
    break;}
case 42:
#line 359 "ebnf.c.y"
{
      yytext[strlen(yytext)] = '\0';
      yyval.as_c_string = strdup(yytext);
    ;
    break;}
case 44:
#line 369 "ebnf.c.y"
{
          fprintf(stderr, "got a 'defined_word', \"%s\", \"%s\"\n", yytext, yyvsp[0].as_defined_word->string);
      {
      int pos = defined_word_search(yyvsp[0].as_defined_word->string);
      if (pos== -1) {
          yyval.as_value = (Value*) calloc(1, sizeof(Value));
          yyval.as_value->type=local_name;
          yyval.as_value->as.local_name.name=yyvsp[0].as_defined_word->string;
      } else {
          yyval.as_value = (Value*) calloc(1, sizeof(Value));
          yyval.as_value->type=subst;
          yyval.as_value->as.subst.position=pos;
          yyval.as_value->as.subst.part = yyvsp[0].as_defined_word->part;
      }
      free(yyvsp[0].as_defined_word);
      };
    break;}
case 46:
#line 387 "ebnf.c.y"
{ yyval.as_value = yyvsp[-1].as_value; ;
    break;}
case 47:
#line 389 "ebnf.c.y"
{    
        yyval.as_value = (Value*) calloc(1, sizeof(Value));
    yyval.as_value->type=literal_string;
    yyval.as_value->as.literal_string.string=yyvsp[0].as_c_string;
     ;
    break;}
case 48:
#line 395 "ebnf.c.y"
{
        yyval.as_value = (Value*) calloc(1, sizeof(Value));
    yyval.as_value->type=text_buffer;
     ;
    break;}
case 49:
#line 402 "ebnf.c.y"
{    
     fprintf(stderr, "<WORD: %s>", yyvsp[0].as_c_string);
     yyval.as_defined_word = (struct defined_word *) calloc(1, sizeof(struct defined_word));
     yyval.as_defined_word->string = yyvsp[0].as_c_string;
     yyval.as_defined_word->part=value_part;
     ;
    break;}
case 50:
#line 409 "ebnf.c.y"
{    
     fprintf(stderr, "<WORD FOR CONTENT>");
     yyval.as_defined_word = (struct defined_word *) calloc(1, sizeof(struct defined_word));
     yyval.as_defined_word->string = strdup(yytext);
     yyval.as_defined_word->part=content_part;
     ;
    break;}
case 51:
#line 416 "ebnf.c.y"
{    
     fprintf(stderr, "<WORD FOR TEXT>");
     yyval.as_defined_word = (struct defined_word *) calloc(1, sizeof(struct defined_word));
     yyval.as_defined_word->string = strdup(yytext);
     yyval.as_defined_word->part=text_part;
     ;
    break;}
case 52:
#line 425 "ebnf.c.y"
{ yyval.as_value = 0; ;
    break;}
case 55:
#line 431 "ebnf.c.y"
{ 
        yyval.as_value = yyvsp[-2].as_value;
        yyvsp[-2].as_value->next = yyvsp[0].as_value;
      ;
    break;}
case 56:
#line 438 "ebnf.c.y"
{
     fprintf(stderr, "got parameter\n");
      ;
    break;}
case 58:
#line 448 "ebnf.c.y"
{ current_branch = add_branch(current_rule); ;
    break;}
case 64:
#line 460 "ebnf.c.y"
{
        ((Term *)current_branch->tree.last)->actions = yyvsp[0].as_action;
    clear_words();
      ;
    break;}
case 65:
#line 464 "ebnf.c.y"
{ NOT_IMPLEMENTED; ;
    break;}
case 66:
#line 465 "ebnf.c.y"
{ repeated(0,UNLIM); ;
    break;}
case 67:
#line 466 "ebnf.c.y"
{ repeated(1,UNLIM); ;
    break;}
case 68:
#line 467 "ebnf.c.y"
{ repeated(0,1); ;
    break;}
case 69:
#line 469 "ebnf.c.y"
{ 
        repeated(yyvsp[-1].as_integer, UNLIM);
      ;
    break;}
case 70:
#line 473 "ebnf.c.y"
{ 
        repeated(yyvsp[-3].as_integer, yyvsp[-1].as_integer);
      ;
    break;}
case 71:
#line 476 "ebnf.c.y"
{
      free(((Term *)current_branch->tree.last)->name);
      ((Term *)current_branch->tree.last)->name = yyvsp[0].as_c_string;
    ;
    break;}
case 73:
#line 482 "ebnf.c.y"
{
          push();
          current_rule = add_anonymous_rule(grammar);
          current_branch = add_branch(current_rule);
        ;
    break;}
case 74:
#line 487 "ebnf.c.y"
{ Rule *r = current_rule;
       Term *t;

       pop();
       t = add_term(current_branch);
       t->type = rule_pointer;
       t->data.rule_pointer = r;
       t->name = strdup("_parens");
      ;
    break;}
case 75:
#line 497 "ebnf.c.y"
{ 
    char *p = yyvsp[0].as_c_string;
    while (*p) {
        Term *t = add_term(current_branch);
        char c = *p++;
        t->type = literal;
        if (c == '\\') {
        switch (*p++) {
        case '\0': 
            yyerror("backslash as last char inside quotes"); 
            break;
        case 'n':
            c = '\n';
            break;
        case 'r':
            c = '\r';
            break;
        case '\\':
            c = '\\';
            break;
        default:
            yyerror("unknown backslash-escape");
        }
        }
        t->data.literal = c;
        t->name = strdup("_literal");
    }
    ;
    break;}
case 76:
#line 526 "ebnf.c.y"
{
       Term *t;
       t = add_term(current_branch);
       t->type = rule_name;
       t->data.rule_name = yyvsp[0].as_c_string;
       t->name = strdup(yyvsp[0].as_c_string);
    ;
    break;}
case 78:
#line 534 "ebnf.c.y"
{ NOT_IMPLEMENTED; ;
    break;}
case 79:
#line 535 "ebnf.c.y"
{ NOT_IMPLEMENTED; ;
    break;}
case 80:
#line 539 "ebnf.c.y"
{ NOT_IMPLEMENTED; ;
    break;}
case 81:
#line 543 "ebnf.c.y"
{ 
          yyval.as_value = (Value*) calloc(1, sizeof(Value));
          yyval.as_value->type=rdfid;
      yyval.as_value->as.rdfid.id=with_prefix(yyvsp[-2].as_c_string, "", yyvsp[0].as_c_string);
      ;
    break;}
case 82:
#line 551 "ebnf.c.y"
{
    charset();
    ;
    break;}
case 83:
#line 557 "ebnf.c.y"
{ yyval.as_c_string = strdup(yytext); ;
    break;}
case 84:
#line 561 "ebnf.c.y"
{
      yytext[strlen(yytext)-1] = '\0';
      yyval.as_c_string = strdup(yytext+1);
    ;
    break;}
case 87:
#line 571 "ebnf.c.y"
{
      yyval.as_integer = atoi(yytext);
    ;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 543 "/usr/share/misc/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 575 "ebnf.c.y"


void yyerror(char *errmsg) {
  fprintf(stderr, "%s near \"%s\" (line %d)\nbad line: %s\n", 
          errmsg, yytext, lineno, linebuf);     
}

int yyparse(void);

void do_parse() {
  grammar = new_grammar();
  hashmap_open(&prefixMap, 5);
  yyparse();
  /* print_grammar(stdout, grammar); */
}


void parse(char* expr) 
{
  lexer_source_begin = expr;
  lexer_source_end = lexer_source_begin+strlen(expr);
  do_parse();
}

void parse_stdin() 
{
  do_parse();
}

Grammar* parse_file(const char* filename) 
{
  if (filename[0] == '-' && filename[1] == '\0') { 
      parse_stdin(); return grammar; 
  }
  yyin = fopen(filename, "r");
  if (!yyin) {
    fprintf(stderr, "file \"%s\":", filename);
    perror("can't open");
    return 0;
  }
  do_parse();
  return grammar;
}

void push() {
   if (stack_pointer >= STACK_SIZE) {
     fprintf(stderr, "overflow of metagrammar stack: nesting is more than %d levels\n", STACK_SIZE);
     exit(1);
   }
   rule_stack[stack_pointer] = current_rule;
   branch_stack[stack_pointer] = current_branch;
   stack_pointer++;
}
void pop() {
  assert(stack_pointer > 0);
  stack_pointer--;
  current_rule = rule_stack[stack_pointer];
  current_branch = branch_stack[stack_pointer];
}

/*
  change the most recently added term into a rule which says that term
  can be appear at least min and at most max times.

  a ::= b?              a  ::= _1
                        _1 ::= | b

  a ::= b*              a  ::= _1
                        _1 ::=  | b | b _1

  a ::= b+              a  ::= _1
                        _1 ::= b | b _1


  */
void repeated(int min, int max) {
  Rule *r = add_anonymous_rule(grammar);
  Term *t = dltree_unlink_last_child(current_branch);   /* aka $1 */
  int i;
  int do_unlim = 0;

  if (max == UNLIM) {
    do_unlim = 1;
    max = min;
    if (max == 0) max = 1;
  }

  for (i=min; i<=max; i++) {
    /* add a branch with i occurances of t */
    Branch *b = add_branch(r);    
    int j;
    for (j=0; j<i; j++) {
      Term *tt = add_term(b);
      printf("adding bit %d %d\n", i, j);
      grammar_copy_term(t, tt);
    }
    if (do_unlim && i>0) {
      /* add a repeat (right-recursion) to this rule */
      Rule *rr = add_anonymous_rule(grammar);
      Branch *bb1 = add_branch(rr);
      Branch *bb2 = add_branch(rr);
      Term *t1 = add_term(bb2);
      Term *t2 = add_term(bb2);
      Term *tt;
      grammar_copy_term(t, t1);
      t2->type = rule_pointer;
      t2->data.rule_pointer = rr;
      t2->name = strdup("_repeat_self");
      tt = add_term(b);
      tt->type = rule_pointer;
      tt->data.rule_pointer = rr;
      tt->name = strdup("_repeat_unlim");
      do_unlim = 0;
    }
  } 

  t = add_term(current_branch);
  t->type = rule_pointer;
  t->data.rule_pointer = r;
  t->name = strdup("_repeat");
}

static struct word_list_entry {
    char *word;
    struct word_list_entry *next;
} *words = 0;

void new_word(char *new_word) 
{
    struct word_list_entry *old_words = words;
    words = (struct word_list_entry *) calloc(1, sizeof(struct word_list_entry));
    words->word = strdup(new_word);
    words->next = old_words;
}

void clear_words()
{
    /* BUG: SHOULD FREE THEM ALL */
    words = 0;
}

int defined_word_search(char *word) 
{
    struct word_list_entry *wp;
    /* check "local" variables */
    for (wp = words; wp; wp=wp->next) {
    if (!strcmp(wp->word, word)) {
        return -1;  /* found local term */
    }
    }

    if (current_rule) {
    if (!strcmp(current_rule->name, word)) {
        return 0;  /* it's the left-hand term */
    }
    
    {
        int pos = 1;
        Term *t = (Term *)current_branch->tree.first;
        
        while (t) {
        if (t->name && !strcmp(t->name, word)) {
            return pos;
        }
        pos++;
        t = (Term*)((DLTreeNode*)t)->next;
        }
    }
    }

    fprintf(stderr, "Undefined term \"%s\" on line %d\nLine %d: %s\n", 
        word, lineno, lineno, linebuf);     
    exit(1);
}


void charset()
{
    Term *t = add_term(current_branch);
    t->type = rule_pointer;
    t->data.rule_pointer = add_charset(grammar, ebnf_charset);
    t->name = strdup("_charset");
}
 
struct value* new_current_content()
{
    Value* v = (Value*) calloc(1, sizeof(Value));
    v->type=current_content;
    return v;
}


void add_prefix(char* prefix, char* expansion)
{
    hashmap_put(&prefixMap, prefix, 0, expansion, 0);
    fprintf(stderr, "Added prefix: %s => %s\n", prefix, expansion);
}

/* return malloc'd expanded version of name */
char* with_prefix(char *prefix, char *sep, char *suffix) 
{
    char *result;
    char *expansion = hashmap_get(&prefixMap, prefix, 0);
    if (!expansion) {
    yyerror("defined xml/rdf prefix used");
    expansion = "_unknown_";
    }
    if (!sep) sep="";
    result = (char*)malloc(strlen(expansion)+strlen(sep)+strlen(suffix)+1);
    if (result) sprintf(result, "%s%s%s", expansion, sep, suffix);
    return result;
}

---

Home to blindfold. This page generated via doxygen 1.2.11.1 Wed Oct 10 16:40:33 2001.