dotparse.c   [plain text]

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

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

#define	T_graph	257
#define	T_digraph	258
#define	T_strict	259
#define	T_node	260
#define	T_edge	261
#define	T_edgeop	262
#define	T_id	263
#define	T_subgraph	264

#line 1 "dotparse.y"

#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

#include <stdio.h>
typedef void *Tobj;

#include "dot2l.h"

#ifdef HAVE_STDLIB_H
# include <stdlib.h>
#endif
#include <string.h>

static char portstr[SMALLBUF];

#line 19 "dotparse.y"
typedef union {
    long i;
    char *s;
    void *o;
} YYSTYPE;
#include <stdio.h>

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



#define	YYFINAL		88
#define	YYFLAG		-32768
#define	YYNTBASE	22

#define YYTRANSLATE(x) ((unsigned)(x) <= 264 ? yytranslate[x] : 56)

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,    15,
    17,     2,     2,    16,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,    14,    13,     2,
    21,     2,     2,    18,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
    19,     2,    20,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,    11,     2,    12,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     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
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     1,     8,    10,    11,    13,    16,    18,    21,    23,
    24,    26,    29,    31,    34,    36,    38,    40,    42,    43,
    47,    50,    52,    53,    54,    60,    61,    62,    68,    71,
    72,    77,    80,    81,    86,    87,    89,    91,    94,    97,
   100,   107,   110,   111,   115,   117,   119,   121,   123,   125,
   128,   129,   133,   137,   138,   142,   143,   145,   150,   151,
   156,   158
};

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

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
    33,    35,    37,    39,    43,    45,    47,    49,    53,    54,
    57,    58,    61,    62,    65,    66,    67,    68,    71,    72,
    75,    79,    83,    86,    88,    89,    92,    94,    97,    99,
   101,   101,   103,   105,   107,   108,   109,   110,   111,   114,
   118,   127,   133,   136,   137,   141,   143,   145,   149,   152,
   153,   156,   159,   160,   163,   167,   168,   171,   173,   173,
   175,   179
};
#endif


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

static const char * const yytname[] = {   "$","error","$undefined.","T_graph",
"T_digraph","T_strict","T_node","T_edge","T_edgeop","T_id","T_subgraph","'{'",
"'}'","';'","':'","'('","','","')'","'@'","'['","']'","'='","file","@1","graph_type",
"stmt_list","stmt_list1","stmt","stmt1","node_stmt","@2","node_id","node_name",
"edge_stmt","@3","@4","@5","@6","edgeRHS","@7","@8","node_port","port_location",
"port_angle","attr_stmt","@9","attr_class","opt_attr_list","rec_attr_list","attr_list",
"inside_attr_list","attr_set","optcomma","subg_stmt","@10","subg_hdr", NULL
};
#endif

static const short yyr1[] = {     0,
    23,    22,    22,    22,    24,    24,    24,    24,    25,    25,
    26,    26,    27,    27,    28,    28,    28,    28,    30,    29,
    31,    32,    34,    35,    33,    36,    37,    33,    38,    39,
    38,    38,    40,    38,    41,    41,    41,    41,    41,    42,
    42,    43,    45,    44,    44,    46,    46,    46,    47,    48,
    48,    49,    50,    50,    51,    52,    52,    53,    54,    53,
    53,    55
};

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

static const short yydefact[] = {     0,
     3,     5,     7,     0,     0,     6,     8,     1,     0,    10,
    46,    47,    48,    22,     0,    59,     0,     9,    11,    13,
    15,    19,    35,    16,    17,    43,    45,    18,    61,     0,
    62,    10,     2,    12,    14,    51,     0,     0,     0,    21,
    36,    37,     0,     0,    10,    55,     0,    20,    49,     0,
    24,    40,     0,    42,    39,    38,    54,    44,    27,     0,
    60,    50,    22,    29,    32,    51,     0,     0,     0,    56,
    51,    58,     0,     0,    25,     0,    52,    57,    54,    28,
    31,    34,     0,    53,    41,     0,     0,     0
};

static const short yydefgoto[] = {    86,
     9,     5,    17,    18,    19,    20,    21,    36,    22,    23,
    24,    37,    66,    44,    71,    51,    73,    74,    40,    41,
    42,    25,    43,    26,    48,    49,    58,    69,    27,    79,
    28,    32,    29
};

static const short yypact[] = {    16,
-32768,-32768,-32768,     1,     3,-32768,-32768,-32768,    13,     0,
-32768,-32768,-32768,     4,    18,-32768,    23,     0,-32768,    15,
-32768,    26,     8,-32768,-32768,-32768,-32768,    28,    27,    30,
-32768,     0,-32768,-32768,-32768,-32768,    29,    -1,    31,-32768,
    24,    32,    25,    29,     0,-32768,    33,-32768,    25,    22,
-32768,-32768,    34,-32768,-32768,-32768,    38,-32768,-32768,    36,
-32768,-32768,-32768,    41,    42,-32768,    35,     4,    21,    37,
-32768,-32768,    29,    29,-32768,    43,-32768,-32768,    38,-32768,
-32768,-32768,    39,-32768,-32768,    54,    55,-32768
};

static const short yypgoto[] = {-32768,
-32768,-32768,   -30,-32768,    40,-32768,-32768,-32768,     7,-32768,
-32768,-32768,-32768,-32768,-32768,   -44,-32768,-32768,-32768,    17,
    19,-32768,-32768,-32768,   -53,-32768,    12,   -17,   -56,-32768,
    14,-32768,-32768
};


#define	YYLAST		64


static const short yytable[] = {    59,
    70,    47,    11,     6,     7,    12,    13,    52,    14,    15,
    16,     8,    75,    53,    60,    -4,     1,    80,     2,     3,
     4,    38,    70,    10,    30,    39,    31,    35,    81,    82,
    63,    15,    16,   -23,    33,   -26,    50,    45,    46,    54,
    77,    39,    67,    57,    61,    38,    68,    72,   -30,   -33,
    76,    83,    78,    87,    88,    85,    64,    34,    56,    55,
    62,    84,     0,    65
};

static const short yycheck[] = {    44,
    57,    32,     3,     3,     4,     6,     7,     9,     9,    10,
    11,     9,    66,    15,    45,     0,     1,    71,     3,     4,
     5,    14,    79,    11,    21,    18,     9,    13,    73,    74,
     9,    10,    11,     8,    12,     8,     8,    11,     9,     9,
    20,    18,     9,    19,    12,    14,     9,    12,     8,     8,
    16,     9,    16,     0,     0,    17,    50,    18,    42,    41,
    49,    79,    -1,    50
};
/* -*-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 34 "dotparse.y"
{ D2Lbegin (yyvsp[0].s); free (yyvsp[0].s); ;
    break;}
case 2:
#line 36 "dotparse.y"
{ D2Lend (); ;
    break;}
case 3:
#line 38 "dotparse.y"
{ D2Labort (); ;
    break;}
case 4:
#line 40 "dotparse.y"
{ D2Labort (); ;
    break;}
case 5:
#line 44 "dotparse.y"
{ gtype = "graph"; etype = "--"; ;
    break;}
case 6:
#line 46 "dotparse.y"
{ gtype = "strict graph"; etype = "--"; ;
    break;}
case 7:
#line 48 "dotparse.y"
{ gtype = "digraph"; etype = "->"; ;
    break;}
case 8:
#line 50 "dotparse.y"
{ gtype = "strict digraph"; etype = "->"; ;
    break;}
case 18:
#line 68 "dotparse.y"
{;
    break;}
case 19:
#line 71 "dotparse.y"
{ attrclass = NODE; portstr[0] = '\000'; ;
    break;}
case 20:
#line 72 "dotparse.y"
{ attrclass = GRAPH; ;
    break;}
case 21:
#line 76 "dotparse.y"
{ yyval.o = yyvsp[-1].o; ;
    break;}
case 22:
#line 80 "dotparse.y"
{ yyval.o = D2Linsertnode (yyvsp[0].s); free (yyvsp[0].s); ;
    break;}
case 23:
#line 84 "dotparse.y"
{ D2Lbeginedge (NODE, yyvsp[0].o, portstr); portstr[0] = '\000'; ;
    break;}
case 24:
#line 86 "dotparse.y"
{ attrclass = EDGE; ;
    break;}
case 25:
#line 88 "dotparse.y"
{ D2Lendedge (); attrclass = GRAPH; ;
    break;}
case 26:
#line 90 "dotparse.y"
{ D2Lbeginedge (GRAPH, yyvsp[0].o, ""); ;
    break;}
case 27:
#line 92 "dotparse.y"
{ attrclass = EDGE; ;
    break;}
case 28:
#line 94 "dotparse.y"
{ D2Lendedge (); attrclass = GRAPH; ;
    break;}
case 29:
#line 98 "dotparse.y"
{ D2Lmidedge (NODE, yyvsp[0].o, portstr); portstr[0] = '\000'; ;
    break;}
case 30:
#line 100 "dotparse.y"
{ D2Lmidedge (NODE, yyvsp[0].o, portstr); portstr[0] = '\000'; ;
    break;}
case 32:
#line 102 "dotparse.y"
{ D2Lmidedge (GRAPH, yyvsp[0].o, ""); portstr[0] = '\000'; ;
    break;}
case 33:
#line 104 "dotparse.y"
{ D2Lmidedge (GRAPH, yyvsp[0].o, ""); portstr[0] = '\000'; ;
    break;}
case 40:
#line 115 "dotparse.y"
{
        strcat (portstr, yyvsp[0].s); free (yyvsp[0].s);
    ;
    break;}
case 41:
#line 119 "dotparse.y"
{
        strcat (portstr, "("); strcat (portstr, yyvsp[-3].s);
        strcat (portstr, ","); strcat (portstr, yyvsp[-1].s);
        strcat (portstr, ")");
        free (yyvsp[-3].s), free (yyvsp[-1].s);
    ;
    break;}
case 42:
#line 128 "dotparse.y"
{
        strcat (portstr, "@"); strcat (portstr, yyvsp[0].s); free (yyvsp[0].s);
    ;
    break;}
case 43:
#line 134 "dotparse.y"
{ inattrstmt = TRUE; ;
    break;}
case 44:
#line 136 "dotparse.y"
{ attrclass = GRAPH; inattrstmt = FALSE; ;
    break;}
case 45:
#line 138 "dotparse.y"
{ attrclass = GRAPH; ;
    break;}
case 46:
#line 142 "dotparse.y"
{ attrclass = GRAPH; ;
    break;}
case 47:
#line 144 "dotparse.y"
{ attrclass = NODE; ;
    break;}
case 48:
#line 146 "dotparse.y"
{ attrclass = EDGE; ;
    break;}
case 55:
#line 164 "dotparse.y"
{ D2Lsetattr (yyvsp[-2].s, yyvsp[0].s); free (yyvsp[-2].s); free (yyvsp[0].s); ;
    break;}
case 58:
#line 172 "dotparse.y"
{ yyval.o = D2Lpopgraph (); ;
    break;}
case 59:
#line 173 "dotparse.y"
{ D2Lpushgraph (NULL); ;
    break;}
case 60:
#line 174 "dotparse.y"
{ yyval.o = D2Lpopgraph (); ;
    break;}
case 61:
#line 176 "dotparse.y"
{ yyval.o = D2Lpopgraph (); ;
    break;}
case 62:
#line 180 "dotparse.y"
{ D2Lpushgraph (yyvsp[0].s); free (yyvsp[0].s); ;
    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 182 "dotparse.y"