undns 0.4.0a

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 172a71497f8cb1d0558209759e1cef205647bd69
+  data.tar.gz: 0153427521413f744190b0ca5ed22df7b779ec28
+SHA512:
+  metadata.gz: 44bcd261073d51c10511309d632e33a295eac06c5c058caa2052305d05bfa2cbc096296080a04a9052b56e297a899d1193b4d3eeabbb81cd9cb232b9d84b6873
+  data.tar.gz: 69aef9f6be887818868c264df2c07c79e652f952cd87f23507e8efc2f75e493647459176a527ed8505a61ffa243da39284f7061d29617fafb03aa74bab22d815

data/bin/undns_decode

@@ -0,0 +1,29 @@
+#!/usr/bin/env ruby
+
+require 'undns'
+
+# this is a demo driver code only.  If you're writing an
+# analysis, you'll want to take this template and use it
+# within your own code that might read hostnames from a 
+# file or database then only extract the information you're
+# really interested in, like location or asn.  The startup cost
+# of loading the undns ruleset is intentionally high to 
+# amortize repeated lookups.
+
+if(ARGV.length < 1) then raise "need a router hostname" end
+
+#Undns.want_conventions_debug = 1
+Undns.load_ruleset # ("Conventions.dat")
+Undns.want_debug = 1
+as = 0
+puts "AS%d\t" % (Undns.get_asn_bydns(ARGV[0])) +
+  "-- which AS this hostname matches (or 0)" 
+puts "@%s\t" % Undns.get_loc(as, ARGV[0]) +
+  "-- where in the world"  
+puts "is a %s\t" % Undns.get_role(as, ARGV[0]) +
+  "-- backbone or gateway or customer"
+
+puts "Unique %s\t" % Undns.get_identifier(as, ARGV[0]) +
+  "-- a fragment that represents its identity within the AS"
+puts "POPtag %s\t" % Undns.get_poptag(as, ARGV[0]) +
+  "-- a fragment that represents the POP within a city"

data/ext/undns/buffer.c

@@ -0,0 +1,247 @@
+/*
+ * Copyright (c) 2002
+ * Neil Spring and the University of Washington.
+ * All rights reserved. 
+ * Copyright (c) 1999 
+ * Eric Hoffman
+ * 
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. The name of the author(s) may not be used to endorse or promote
+ *    products derived from this software without specific prior
+ *    written permission.  
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ * IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifdef HAVE_CONFIG_H
+#include <config.h>
+#endif
+#include <string.h>
+#include <stdio.h>
+#include <stdarg.h>
+#include <stdlib.h>
+#include <assert.h>
+// #include "timer.h"
+typedef unsigned int when;
+#ifndef FISHTIME_HZ
+#define FISHTIME_HZ ((when)1000)
+#endif
+
+/* open */
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <fcntl.h>
+/* end open */
+
+#ifdef WIN32
+#include "win32.h"
+#else
+#include <netinet/in.h> 
+#endif
+#include "buffer.h"
+
+// 
+// unsigned int ipv4_addr_from_string(const char *x)
+// {
+//   int a,b,c,d;
+//   unsigned int t;
+// 
+//   a=b=c=d=0;
+//   if (sscanf(x,"%d.%d.%d.%d",&a,&b,&c,&d)>0){
+//     return(htonl(a<<24|b<<16|c<<8|d));
+//   } else {
+//     sscanf(x,"x%x",&t);
+//     return(htonl(t));
+//   }
+// }
+
+char *buffer_contents(buffer b)
+{
+  return(b->contents);
+}
+
+#define is_digit(c) ((char_to_digit(c) >= 0) && (char_to_digit(c) <= 9))
+#define char_to_digit(c) (int)((c) - '0')
+
+static char hex_digits[]="0123456789abcdef";
+
+void buffer_concat(buffer b,buffer k)
+{
+  while ((b->length-b->fill)< k->fill)
+    b->contents=(char *)realloc(b->contents,b->length+=k->fill+2);
+
+  memcpy(b->contents+b->fill,k->contents,k->fill);
+  b->contents[b->fill+=k->fill]=0;
+}
+
+void buffer_append(buffer b,const char *item,int len)
+{
+  while ((b->length-b->fill)< (len+1))
+    b->contents=(char *)realloc(b->contents,b->length*=2);
+
+  memcpy(b->contents+b->fill,item,len);
+  b->contents[b->fill+=len]=0;
+}
+
+void vbprintf(buffer b,const char *fmt, va_list ap)
+{
+  const char *fc;     /* pointer to current format character */
+  int qf;       /* flag to quit reading % format */ 
+  int min_len, len;
+  char *c;
+  char type;
+  unsigned int x,a1;
+  int i, j,base, negative;
+  int rfill;
+  char reverse[20];
+
+  for (fc=fmt;*fc;fc++){  
+    if (*fc != '%') {
+      buffer_append(b,fc,1);
+    } else{ 
+      min_len=0;
+      qf=0;
+      fc++;
+
+      if (*fc=='0') { 
+	fc++;
+	while (is_digit(*fc) && *fc)
+	  min_len=10*min_len + char_to_digit(*fc++);
+      }
+      
+      type=*fc;
+      base =0;
+      negative=0;
+      switch (type) {
+        
+      case '%':
+        buffer_append(b,"%",1);
+        break;
+
+      case 't':
+	buffer_append(b,reverse,
+		      sprintf (reverse,"%f",
+			       (float)(va_arg(ap,when))/(float)FISHTIME_HZ));
+	break;
+
+      case 'b':
+	buffer_concat(b,va_arg(ap, buffer));
+	break;
+
+      case 'a':
+        a1 = va_arg(ap, unsigned int);
+	a1=htonl(a1);
+	bprintf(b,"%d.",(a1>>24)&255);
+	bprintf(b,"%d.",(a1>>16)&255);
+	bprintf(b,"%d.",(a1>>8)&255);
+	bprintf(b,"%d",a1&255);
+	break;
+
+      case 's':
+        c = va_arg(ap, char *);
+        if (!c) c= (char *)"(null)";
+        len=strlen(c);
+        for (i=0;i<min_len-len;i++)
+            buffer_append(b," ",1);
+        buffer_append(b,c,len);
+        break;
+        
+      case 'x':
+        base=16;
+      case 'o':
+        if (!base) base=8;
+      case 'u':
+        if (!base) base=10;
+      case 'd':     case 'i':
+        x = va_arg(ap, unsigned int );
+        if (!base){
+          base=10;
+          if ((negative=((int)x <0))){
+            buffer_append(b,"-",1); 
+            x=(unsigned)(-1*(int)x);
+          }
+        }
+        if (x){
+          for ( i=0,rfill=19; i<12 && x; i++, x/=base) 
+	    reverse[rfill--]=hex_digits[x%base];
+	  for (j=i;j<min_len;j++) buffer_append(b,"0",1);
+	  buffer_append(b,reverse+rfill+1,i);
+        } else {
+          buffer_append(b,"0",1);
+          i=1;
+        }
+        break;
+      default:
+        break;
+      }
+    }
+  }
+}
+
+void bprintf(buffer b,const char *fmt, ...)
+{
+  va_list ap;
+  va_start(ap,fmt);
+  vbprintf(b,fmt,ap);
+  va_end(ap);
+}
+
+buffer create_buffer(int len)
+{
+  buffer b=(buffer)malloc(sizeof(struct buffer_st));
+  assert(b!=NULL);
+  b->contents=(char *)malloc(b->length=len);
+  b->fill=0;
+  b->contents[0]=0;
+  return(b);
+}
+
+void free_buffer(buffer b)
+{
+  free(b->contents);
+  free(b);
+}
+
+
+int writef(int (*f)(void *, char *, int),void *a,const char *format,...)
+{
+  buffer b=create_buffer(10);
+  va_list ap;
+  va_start(ap,format);
+  vbprintf(b,format,ap);
+  (void)((*f)(a,b->contents,b->fill));
+  va_end(ap);
+  free_buffer(b);
+	 
+  return(0);
+}
+
+int openf(int flags,char *format,...)
+{
+  buffer b=create_buffer(10);
+  va_list ap;
+  va_start(ap,format);
+  vbprintf(b,format,ap);
+  (void)open(b->contents,flags,0666);
+  va_end(ap);
+  free_buffer(b);
+
+	return(0);
+}

data/ext/undns/buffer.h

@@ -0,0 +1,59 @@
+/*
+ * Copyright (c) 2002
+ * Neil Spring and the University of Washington.
+ * Copyright (c) 1999 
+ * Eric Hoffman
+ * 
+ * All rights reserved. 
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. The name of the author(s) may not be used to endorse or promote
+ *    products derived from this software without specific prior
+ *    written permission.  
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ * IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef _buffer_h
+#define _buffer_h
+#include "nscommon.h"
+
+
+NS_BEGIN_DECLS
+
+#include <stdarg.h>
+
+typedef struct buffer_st {
+  int length;
+  int fill;
+  char *contents;
+} *buffer;
+
+/*@notnull@*/ /*@only@*/
+buffer create_buffer(int len);
+void free_buffer(/*@null@*/ /*@out@*/ /*@only@*/buffer b)  /*@modifies b@*/;
+
+void vbprintf(buffer b,const char *fmt, va_list ap);
+void bprintf(buffer b,const char *fmt, ...);
+void buffer_append(buffer b,const char *item,int len);
+int writef(int (*f)(void *, char *, int),void *a,const char *format,...);
+unsigned int ipv4_addr_from_string(const char *x);
+
+NS_END_DECLS
+#endif

data/ext/undns/config.h

@@ -0,0 +1,2 @@
+
+/* placeholder */

data/ext/undns/conventions.c

@@ -0,0 +1,1813 @@
+/* A Bison parser, made by GNU Bison 3.0.2.  */
+
+/* Bison implementation for Yacc-like parsers in C
+
+   Copyright (C) 1984, 1989-1990, 2000-2013 Free Software Foundation, Inc.
+
+   This program is free software: you can redistribute it and/or modify
+   it under the terms of the GNU General Public License as published by
+   the Free Software Foundation, either version 3 of the License, or
+   (at your option) any later version.
+
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program.  If not, see <http://www.gnu.org/licenses/>.  */
+
+/* As a special exception, you may create a larger work that contains
+   part or all of the Bison parser skeleton and distribute that work
+   under terms of your choice, so long as that work isn't itself a
+   parser generator using the skeleton or a modified version thereof
+   as a parser skeleton.  Alternatively, if you modify or redistribute
+   the parser skeleton itself, you may (at your option) remove this
+   special exception, which will cause the skeleton and the resulting
+   Bison output files to be licensed under the GNU General Public
+   License without this special exception.
+
+   This special exception was added by the Free Software Foundation in
+   version 2.2 of Bison.  */
+
+/* C LALR(1) parser skeleton written by Richard Stallman, by
+   simplifying the original so-called "semantic" parser.  */
+
+/* All symbols defined below should begin with yy or YY, to avoid
+   infringing on user name space.  This should be done even for local
+   variables, as they might otherwise be expanded by user macros.
+   There are some unavoidable exceptions within include files to
+   define necessary library symbols; they are noted "INFRINGES ON
+   USER NAME SPACE" below.  */
+
+/* Identify Bison output.  */
+#define YYBISON 1
+
+/* Bison version.  */
+#define YYBISON_VERSION "3.0.2"
+
+/* Skeleton name.  */
+#define YYSKELETON_NAME "yacc.c"
+
+/* Pure parsers.  */
+#define YYPURE 0
+
+/* Push parsers.  */
+#define YYPUSH 0
+
+/* Pull parsers.  */
+#define YYPULL 1
+
+
+/* Substitute the variable and function names.  */
+#define yyparse         conv_yyparse
+#define yylex           conv_yylex
+#define yyerror         conv_yyerror
+#define yydebug         conv_yydebug
+#define yynerrs         conv_yynerrs
+
+#define yylval          conv_yylval
+#define yychar          conv_yychar
+
+/* Copy the first part of user declarations.  */
+#line 1 "conventions.y" /* yacc.c:339  */
+
+  // #define _GNU_SOURCE
+#include <config.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <sys/types.h>
+#include <regex.h>
+#include "ruleset.h"
+#include "typed_hashtable.h"
+#include "hashes.h"
+  int yyerror(const char *string);
+  int yylex(void);
+  extern boolean want_debug;
+  extern boolean want_conventions_debug;
+  extern asnc_hashtable Ruleset;
+  extern const char *currentfilename(void);
+  extern void print_stack_trace();
+  extern int linenum;
+  
+  boolean set_asn(struct convention *c, void *asn_i) {
+    long asn = (long)asn_i;
+    c->asn=asn;
+    return TRUE;
+  }
+  
+  
+
+#line 102 "conventions.c" /* yacc.c:339  */
+
+# ifndef YY_NULLPTR
+#  if defined __cplusplus && 201103L <= __cplusplus
+#   define YY_NULLPTR nullptr
+#  else
+#   define YY_NULLPTR 0
+#  endif
+# endif
+
+/* Enabling verbose error messages.  */
+#ifdef YYERROR_VERBOSE
+# undef YYERROR_VERBOSE
+# define YYERROR_VERBOSE 1
+#else
+# define YYERROR_VERBOSE 0
+#endif
+
+/* In a future release of Bison, this section will be replaced
+   by #include "y.tab.h".  */
+#ifndef YY_CONV_YY_Y_TAB_H_INCLUDED
+# define YY_CONV_YY_Y_TAB_H_INCLUDED
+/* Debug traces.  */
+#ifndef YYDEBUG
+# define YYDEBUG 0
+#endif
+#if YYDEBUG
+extern int conv_yydebug;
+#endif
+
+/* Token type.  */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+  enum yytokentype
+  {
+    TOK_QID = 258,
+    TOK_ID = 259,
+    TOK_NUMBER = 260,
+    TOK_REGEX = 261
+  };
+#endif
+/* Tokens.  */
+#define TOK_QID 258
+#define TOK_ID 259
+#define TOK_NUMBER 260
+#define TOK_REGEX 261
+
+/* Value type.  */
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+typedef union YYSTYPE YYSTYPE;
+union YYSTYPE
+{
+#line 27 "conventions.y" /* yacc.c:355  */
+
+  struct asnc *asnc;
+  int in;
+  char *cp;
+  struct stringpair *binding;
+  struct expression *expr;
+  struct convention *conv;
+  struct key_decl *kvb;
+  conv_queue cq;
+  key_hashtable dict;
+  boolean bool;
+
+#line 167 "conventions.c" /* yacc.c:355  */
+};
+# define YYSTYPE_IS_TRIVIAL 1
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+
+extern YYSTYPE conv_yylval;
+
+int conv_yyparse (void);
+
+#endif /* !YY_CONV_YY_Y_TAB_H_INCLUDED  */
+
+/* Copy the second part of user declarations.  */
+
+#line 182 "conventions.c" /* yacc.c:358  */
+
+#ifdef short
+# undef short
+#endif
+
+#ifdef YYTYPE_UINT8
+typedef YYTYPE_UINT8 yytype_uint8;
+#else
+typedef unsigned char yytype_uint8;
+#endif
+
+#ifdef YYTYPE_INT8
+typedef YYTYPE_INT8 yytype_int8;
+#else
+typedef signed char yytype_int8;
+#endif
+
+#ifdef YYTYPE_UINT16
+typedef YYTYPE_UINT16 yytype_uint16;
+#else
+typedef unsigned short int yytype_uint16;
+#endif
+
+#ifdef YYTYPE_INT16
+typedef YYTYPE_INT16 yytype_int16;
+#else
+typedef short int yytype_int16;
+#endif
+
+#ifndef YYSIZE_T
+# ifdef __SIZE_TYPE__
+#  define YYSIZE_T __SIZE_TYPE__
+# elif defined size_t
+#  define YYSIZE_T size_t
+# elif ! defined YYSIZE_T
+#  include <stddef.h> /* INFRINGES ON USER NAME SPACE */
+#  define YYSIZE_T size_t
+# else
+#  define YYSIZE_T unsigned int
+# endif
+#endif
+
+#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
+
+#ifndef YY_
+# if defined YYENABLE_NLS && YYENABLE_NLS
+#  if ENABLE_NLS
+#   include <libintl.h> /* INFRINGES ON USER NAME SPACE */
+#   define YY_(Msgid) dgettext ("bison-runtime", Msgid)
+#  endif
+# endif
+# ifndef YY_
+#  define YY_(Msgid) Msgid
+# endif
+#endif
+
+#ifndef YY_ATTRIBUTE
+# if (defined __GNUC__                                               \
+      && (2 < __GNUC__ || (__GNUC__ == 2 && 96 <= __GNUC_MINOR__)))  \
+     || defined __SUNPRO_C && 0x5110 <= __SUNPRO_C
+#  define YY_ATTRIBUTE(Spec) __attribute__(Spec)
+# else
+#  define YY_ATTRIBUTE(Spec) /* empty */
+# endif
+#endif
+
+#ifndef YY_ATTRIBUTE_PURE
+# define YY_ATTRIBUTE_PURE   YY_ATTRIBUTE ((__pure__))
+#endif
+
+#ifndef YY_ATTRIBUTE_UNUSED
+# define YY_ATTRIBUTE_UNUSED YY_ATTRIBUTE ((__unused__))
+#endif
+
+#if !defined _Noreturn \
+     && (!defined __STDC_VERSION__ || __STDC_VERSION__ < 201112)
+# if defined _MSC_VER && 1200 <= _MSC_VER
+#  define _Noreturn __declspec (noreturn)
+# else
+#  define _Noreturn YY_ATTRIBUTE ((__noreturn__))
+# endif
+#endif
+
+/* Suppress unused-variable warnings by "using" E.  */
+#if ! defined lint || defined __GNUC__
+# define YYUSE(E) ((void) (E))
+#else
+# define YYUSE(E) /* empty */
+#endif
+
+#if defined __GNUC__ && 407 <= __GNUC__ * 100 + __GNUC_MINOR__
+/* Suppress an incorrect diagnostic about yylval being uninitialized.  */
+# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
+    _Pragma ("GCC diagnostic push") \
+    _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")\
+    _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
+# define YY_IGNORE_MAYBE_UNINITIALIZED_END \
+    _Pragma ("GCC diagnostic pop")
+#else
+# define YY_INITIAL_VALUE(Value) Value
+#endif
+#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
+# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
+# define YY_IGNORE_MAYBE_UNINITIALIZED_END
+#endif
+#ifndef YY_INITIAL_VALUE
+# define YY_INITIAL_VALUE(Value) /* Nothing. */
+#endif
+
+
+#if ! defined yyoverflow || YYERROR_VERBOSE
+
+/* The parser invokes alloca or malloc; define the necessary symbols.  */
+
+# ifdef YYSTACK_USE_ALLOCA
+#  if YYSTACK_USE_ALLOCA
+#   ifdef __GNUC__
+#    define YYSTACK_ALLOC __builtin_alloca
+#   elif defined __BUILTIN_VA_ARG_INCR
+#    include <alloca.h> /* INFRINGES ON USER NAME SPACE */
+#   elif defined _AIX
+#    define YYSTACK_ALLOC __alloca
+#   elif defined _MSC_VER
+#    include <malloc.h> /* INFRINGES ON USER NAME SPACE */
+#    define alloca _alloca
+#   else
+#    define YYSTACK_ALLOC alloca
+#    if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
+#     include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+      /* Use EXIT_SUCCESS as a witness for stdlib.h.  */
+#     ifndef EXIT_SUCCESS
+#      define EXIT_SUCCESS 0
+#     endif
+#    endif
+#   endif
+#  endif
+# endif
+
+# ifdef YYSTACK_ALLOC
+   /* Pacify GCC's 'empty if-body' warning.  */
+#  define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
+#  ifndef YYSTACK_ALLOC_MAXIMUM
+    /* The OS might guarantee only one guard page at the bottom of the stack,
+       and a page size can be as small as 4096 bytes.  So we cannot safely
+       invoke alloca (N) if N exceeds 4096.  Use a slightly smaller number
+       to allow for a few compiler-allocated temporary stack slots.  */
+#   define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
+#  endif
+# else
+#  define YYSTACK_ALLOC YYMALLOC
+#  define YYSTACK_FREE YYFREE
+#  ifndef YYSTACK_ALLOC_MAXIMUM
+#   define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
+#  endif
+#  if (defined __cplusplus && ! defined EXIT_SUCCESS \
+       && ! ((defined YYMALLOC || defined malloc) \
+             && (defined YYFREE || defined free)))
+#   include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+#   ifndef EXIT_SUCCESS
+#    define EXIT_SUCCESS 0
+#   endif
+#  endif
+#  ifndef YYMALLOC
+#   define YYMALLOC malloc
+#   if ! defined malloc && ! defined EXIT_SUCCESS
+void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
+#   endif
+#  endif
+#  ifndef YYFREE
+#   define YYFREE free
+#   if ! defined free && ! defined EXIT_SUCCESS
+void free (void *); /* INFRINGES ON USER NAME SPACE */
+#   endif
+#  endif
+# endif
+#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
+
+
+#if (! defined yyoverflow \
+     && (! defined __cplusplus \
+         || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
+
+/* A type that is properly aligned for any stack member.  */
+union yyalloc
+{
+  yytype_int16 yyss_alloc;
+  YYSTYPE yyvs_alloc;
+};
+
+/* The size of the maximum gap between one aligned stack and the next.  */
+# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
+
+/* The size of an array large to enough to hold all stacks, each with
+   N elements.  */
+# define YYSTACK_BYTES(N) \
+     ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \
+      + YYSTACK_GAP_MAXIMUM)
+
+# define YYCOPY_NEEDED 1
+
+/* Relocate STACK from its old location to the new one.  The
+   local variables YYSIZE and YYSTACKSIZE give the old and new number of
+   elements in the stack, and YYPTR gives the new location of the
+   stack.  Advance YYPTR to a properly aligned location for the next
+   stack.  */
+# define YYSTACK_RELOCATE(Stack_alloc, Stack)                           \
+    do                                                                  \
+      {                                                                 \
+        YYSIZE_T yynewbytes;                                            \
+        YYCOPY (&yyptr->Stack_alloc, Stack, yysize);                    \
+        Stack = &yyptr->Stack_alloc;                                    \
+        yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
+        yyptr += yynewbytes / sizeof (*yyptr);                          \
+      }                                                                 \
+    while (0)
+
+#endif
+
+#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
+/* Copy COUNT objects from SRC to DST.  The source and destination do
+   not overlap.  */
+# ifndef YYCOPY
+#  if defined __GNUC__ && 1 < __GNUC__
+#   define YYCOPY(Dst, Src, Count) \
+      __builtin_memcpy (Dst, Src, (Count) * sizeof (*(Src)))
+#  else
+#   define YYCOPY(Dst, Src, Count)              \
+      do                                        \
+        {                                       \
+          YYSIZE_T yyi;                         \
+          for (yyi = 0; yyi < (Count); yyi++)   \
+            (Dst)[yyi] = (Src)[yyi];            \
+        }                                       \
+      while (0)
+#  endif
+# endif
+#endif /* !YYCOPY_NEEDED */
+
+/* YYFINAL -- State number of the termination state.  */
+#define YYFINAL  2
+/* YYLAST -- Last index in YYTABLE.  */
+#define YYLAST   50
+
+/* YYNTOKENS -- Number of terminals.  */
+#define YYNTOKENS  11
+/* YYNNTS -- Number of nonterminals.  */
+#define YYNNTS  9
+/* YYNRULES -- Number of rules.  */
+#define YYNRULES  28
+/* YYNSTATES -- Number of states.  */
+#define YYNSTATES  49
+
+/* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned
+   by yylex, with out-of-bounds checking.  */
+#define YYUNDEFTOK  2
+#define YYMAXUTOK   261
+
+#define YYTRANSLATE(YYX)                                                \
+  ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
+
+/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
+   as returned by yylex, without out-of-bounds checking.  */
+static const yytype_uint8 yytranslate[] =
+{
+       0,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     9,
+       2,    10,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     7,     2,     8,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     1,     2,     3,     4,
+       5,     6
+};
+
+#if YYDEBUG
+  /* YYRLINE[YYN] -- Source line where rule number YYN was defined.  */
+static const yytype_uint8 yyrline[] =
+{
+       0,    54,    54,    62,    68,    79,   119,   122,   126,   128,
+     130,   132,   134,   136,   141,   146,   153,   156,   164,   172,
+     176,   180,   184,   190,   190,   192,   212,   216,   222
+};
+#endif
+
+#if YYDEBUG || YYERROR_VERBOSE || 0
+/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
+   First, the terminals, then, starting at YYNTOKENS, nonterminals.  */
+static const char *const yytname[] =
+{
+  "$end", "error", "$undefined", "TOK_QID", "TOK_ID", "TOK_NUMBER",
+  "TOK_REGEX", "'{'", "'}'", "';'", "'='", "$accept", "conventions", "asn",
+  "expressionlist", "expression", "keyvalbinding", "quotableident",
+  "bindingtable", "binding", YY_NULLPTR
+};
+#endif
+
+# ifdef YYPRINT
+/* YYTOKNUM[NUM] -- (External) token number corresponding to the
+   (internal) symbol number NUM (which must be that of a token).  */
+static const yytype_uint16 yytoknum[] =
+{
+       0,   256,   257,   258,   259,   260,   261,   123,   125,    59,
+      61
+};
+# endif
+
+#define YYPACT_NINF -22
+
+#define yypact_value_is_default(Yystate) \
+  (!!((Yystate) == (-22)))
+
+#define YYTABLE_NINF -27
+
+#define yytable_value_is_error(Yytable_value) \
+  0
+
+  /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
+     STATE-NUM.  */
+static const yytype_int8 yypact[] =
+{
+     -22,     3,   -22,    39,   -22,     2,   -22,   -22,    33,    36,
+      12,   -22,   -22,   -22,   -22,     0,   -22,    13,   -22,     1,
+     -22,   -22,    14,   -22,    23,    21,    26,   -22,   -22,    16,
+     -22,    25,    42,   -22,    -2,   -22,    30,   -22,   -22,    44,
+      44,   -22,   -22,    32,   -22,   -22,   -22,   -22,   -22
+};
+
+  /* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM.
+     Performed when YYTABLE does not specify something else to do.  Zero
+     means the default is an error.  */
+static const yytype_uint8 yydefact[] =
+{
+       3,     0,     1,     0,     2,     0,     7,     7,     0,     0,
+       0,     4,     6,     5,    15,     0,    12,     0,    22,     0,
+      14,     8,     0,    21,     0,     0,     0,    13,     9,     0,
+      20,     0,     0,    10,     0,    19,     0,    26,    11,     0,
+       0,    16,    25,     0,    24,    23,    27,    28,    17
+};
+
+  /* YYPGOTO[NTERM-NUM].  */
+static const yytype_int8 yypgoto[] =
+{
+     -22,   -22,   -22,    43,   -22,   -17,   -21,     6,   -22
+};
+
+  /* YYDEFGOTO[NTERM-NUM].  */
+static const yytype_int8 yydefgoto[] =
+{
+      -1,     1,     4,     8,    12,    17,    46,    36,    42
+};
+
+  /* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM.  If
+     positive, shift that token.  If negative, reduce the rule whose
+     number is the opposite.  If YYTABLE_NINF, syntax error.  */
+static const yytype_int8 yytable[] =
+{
+      22,    18,    23,     2,    24,    29,    25,    38,     3,     7,
+      19,    26,    34,    14,    20,    27,    15,    15,    15,    47,
+      15,    16,    21,    28,    30,    33,    35,   -18,    31,   -26,
+     -26,    32,   -18,   -26,    39,    40,    39,    40,    41,    10,
+      48,    11,    10,    43,    13,     5,     6,    44,    45,    37,
+       9
+};
+
+static const yytype_uint8 yycheck[] =
+{
+      17,     1,     1,     0,     3,    22,     5,     9,     5,     7,
+      10,    10,    29,     1,     1,     1,     4,     4,     4,    40,
+       4,     9,     9,     9,     1,     9,     1,     4,     7,     4,
+       5,     5,     9,     8,     4,     5,     4,     5,     8,     6,
+       8,     8,     6,    37,     8,     6,     7,     3,     4,     7,
+       7
+};
+
+  /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
+     symbol of state STATE-NUM.  */
+static const yytype_uint8 yystos[] =
+{
+       0,    12,     0,     5,    13,     6,     7,     7,    14,    14,
+       6,     8,    15,     8,     1,     4,     9,    16,     1,    10,
+       1,     9,    16,     1,     3,     5,    10,     1,     9,    16,
+       1,     7,     5,     9,    16,     1,    18,     7,     9,     4,
+       5,     8,    19,    18,     3,     4,    17,    17,     8
+};
+
+  /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives.  */
+static const yytype_uint8 yyr1[] =
+{
+       0,    11,    12,    12,    13,    13,    14,    14,    15,    15,
+      15,    15,    15,    15,    15,    15,    16,    16,    16,    16,
+      16,    16,    16,    17,    17,    18,    18,    19,    19
+};
+
+  /* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN.  */
+static const yytype_uint8 yyr2[] =
+{
+       0,     2,     2,     0,     4,     5,     2,     0,     3,     4,
+       5,     6,     2,     4,     3,     2,     6,     7,     3,     5,
+       4,     3,     2,     1,     1,     2,     0,     2,     2
+};
+
+
+#define yyerrok         (yyerrstatus = 0)
+#define yyclearin       (yychar = YYEMPTY)
+#define YYEMPTY         (-2)
+#define YYEOF           0
+
+#define YYACCEPT        goto yyacceptlab
+#define YYABORT         goto yyabortlab
+#define YYERROR         goto yyerrorlab
+
+
+#define YYRECOVERING()  (!!yyerrstatus)
+
+#define YYBACKUP(Token, Value)                                  \
+do                                                              \
+  if (yychar == YYEMPTY)                                        \
+    {                                                           \
+      yychar = (Token);                                         \
+      yylval = (Value);                                         \
+      YYPOPSTACK (yylen);                                       \
+      yystate = *yyssp;                                         \
+      goto yybackup;                                            \
+    }                                                           \
+  else                                                          \
+    {                                                           \
+      yyerror (YY_("syntax error: cannot back up")); \
+      YYERROR;                                                  \
+    }                                                           \
+while (0)
+
+/* Error token number */
+#define YYTERROR        1
+#define YYERRCODE       256
+
+
+
+/* Enable debugging if requested.  */
+#if YYDEBUG
+
+# ifndef YYFPRINTF
+#  include <stdio.h> /* INFRINGES ON USER NAME SPACE */
+#  define YYFPRINTF fprintf
+# endif
+
+# define YYDPRINTF(Args)                        \
+do {                                            \
+  if (yydebug)                                  \
+    YYFPRINTF Args;                             \
+} while (0)
+
+/* This macro is provided for backward compatibility. */
+#ifndef YY_LOCATION_PRINT
+# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
+#endif
+
+
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)                    \
+do {                                                                      \
+  if (yydebug)                                                            \
+    {                                                                     \
+      YYFPRINTF (stderr, "%s ", Title);                                   \
+      yy_symbol_print (stderr,                                            \
+                  Type, Value); \
+      YYFPRINTF (stderr, "\n");                                           \
+    }                                                                     \
+} while (0)
+
+
+/*----------------------------------------.
+| Print this symbol's value on YYOUTPUT.  |
+`----------------------------------------*/
+
+static void
+yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
+{
+  FILE *yyo = yyoutput;
+  YYUSE (yyo);
+  if (!yyvaluep)
+    return;
+# ifdef YYPRINT
+  if (yytype < YYNTOKENS)
+    YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
+# endif
+  YYUSE (yytype);
+}
+
+
+/*--------------------------------.
+| Print this symbol on YYOUTPUT.  |
+`--------------------------------*/
+
+static void
+yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
+{
+  YYFPRINTF (yyoutput, "%s %s (",
+             yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]);
+
+  yy_symbol_value_print (yyoutput, yytype, yyvaluep);
+  YYFPRINTF (yyoutput, ")");
+}
+
+/*------------------------------------------------------------------.
+| yy_stack_print -- Print the state stack from its BOTTOM up to its |
+| TOP (included).                                                   |
+`------------------------------------------------------------------*/
+
+static void
+yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
+{
+  YYFPRINTF (stderr, "Stack now");
+  for (; yybottom <= yytop; yybottom++)
+    {
+      int yybot = *yybottom;
+      YYFPRINTF (stderr, " %d", yybot);
+    }
+  YYFPRINTF (stderr, "\n");
+}
+
+# define YY_STACK_PRINT(Bottom, Top)                            \
+do {                                                            \
+  if (yydebug)                                                  \
+    yy_stack_print ((Bottom), (Top));                           \
+} while (0)
+
+
+/*------------------------------------------------.
+| Report that the YYRULE is going to be reduced.  |
+`------------------------------------------------*/
+
+static void
+yy_reduce_print (yytype_int16 *yyssp, YYSTYPE *yyvsp, int yyrule)
+{
+  unsigned long int yylno = yyrline[yyrule];
+  int yynrhs = yyr2[yyrule];
+  int yyi;
+  YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
+             yyrule - 1, yylno);
+  /* The symbols being reduced.  */
+  for (yyi = 0; yyi < yynrhs; yyi++)
+    {
+      YYFPRINTF (stderr, "   $%d = ", yyi + 1);
+      yy_symbol_print (stderr,
+                       yystos[yyssp[yyi + 1 - yynrhs]],
+                       &(yyvsp[(yyi + 1) - (yynrhs)])
+                                              );
+      YYFPRINTF (stderr, "\n");
+    }
+}
+
+# define YY_REDUCE_PRINT(Rule)          \
+do {                                    \
+  if (yydebug)                          \
+    yy_reduce_print (yyssp, yyvsp, Rule); \
+} while (0)
+
+/* Nonzero means print parse trace.  It is left uninitialized so that
+   multiple parsers can coexist.  */
+int yydebug;
+#else /* !YYDEBUG */
+# define YYDPRINTF(Args)
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
+# define YY_STACK_PRINT(Bottom, Top)
+# define YY_REDUCE_PRINT(Rule)
+#endif /* !YYDEBUG */
+
+
+/* YYINITDEPTH -- initial size of the parser's stacks.  */
+#ifndef YYINITDEPTH
+# define YYINITDEPTH 200
+#endif
+
+/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
+   if the built-in stack extension method is used).
+
+   Do not make this value too large; the results are undefined if
+   YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
+   evaluated with infinite-precision integer arithmetic.  */
+
+#ifndef YYMAXDEPTH
+# define YYMAXDEPTH 10000
+#endif
+
+
+#if YYERROR_VERBOSE
+
+# ifndef yystrlen
+#  if defined __GLIBC__ && defined _STRING_H
+#   define yystrlen strlen
+#  else
+/* Return the length of YYSTR.  */
+static YYSIZE_T
+yystrlen (const char *yystr)
+{
+  YYSIZE_T yylen;
+  for (yylen = 0; yystr[yylen]; yylen++)
+    continue;
+  return yylen;
+}
+#  endif
+# endif
+
+# ifndef yystpcpy
+#  if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
+#   define yystpcpy stpcpy
+#  else
+/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
+   YYDEST.  */
+static char *
+yystpcpy (char *yydest, const char *yysrc)
+{
+  char *yyd = yydest;
+  const char *yys = yysrc;
+
+  while ((*yyd++ = *yys++) != '\0')
+    continue;
+
+  return yyd - 1;
+}
+#  endif
+# endif
+
+# ifndef yytnamerr
+/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
+   quotes and backslashes, so that it's suitable for yyerror.  The
+   heuristic is that double-quoting is unnecessary unless the string
+   contains an apostrophe, a comma, or backslash (other than
+   backslash-backslash).  YYSTR is taken from yytname.  If YYRES is
+   null, do not copy; instead, return the length of what the result
+   would have been.  */
+static YYSIZE_T
+yytnamerr (char *yyres, const char *yystr)
+{
+  if (*yystr == '"')
+    {
+      YYSIZE_T yyn = 0;
+      char const *yyp = yystr;
+
+      for (;;)
+        switch (*++yyp)
+          {
+          case '\'':
+          case ',':
+            goto do_not_strip_quotes;
+
+          case '\\':
+            if (*++yyp != '\\')
+              goto do_not_strip_quotes;
+            /* Fall through.  */
+          default:
+            if (yyres)
+              yyres[yyn] = *yyp;
+            yyn++;
+            break;
+
+          case '"':
+            if (yyres)
+              yyres[yyn] = '\0';
+            return yyn;
+          }
+    do_not_strip_quotes: ;
+    }
+
+  if (! yyres)
+    return yystrlen (yystr);
+
+  return yystpcpy (yyres, yystr) - yyres;
+}
+# endif
+
+/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message
+   about the unexpected token YYTOKEN for the state stack whose top is
+   YYSSP.
+
+   Return 0 if *YYMSG was successfully written.  Return 1 if *YYMSG is
+   not large enough to hold the message.  In that case, also set
+   *YYMSG_ALLOC to the required number of bytes.  Return 2 if the
+   required number of bytes is too large to store.  */
+static int
+yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg,
+                yytype_int16 *yyssp, int yytoken)
+{
+  YYSIZE_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]);
+  YYSIZE_T yysize = yysize0;
+  enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
+  /* Internationalized format string. */
+  const char *yyformat = YY_NULLPTR;
+  /* Arguments of yyformat. */
+  char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
+  /* Number of reported tokens (one for the "unexpected", one per
+     "expected"). */
+  int yycount = 0;
+
+  /* There are many possibilities here to consider:
+     - If this state is a consistent state with a default action, then
+       the only way this function was invoked is if the default action
+       is an error action.  In that case, don't check for expected
+       tokens because there are none.
+     - The only way there can be no lookahead present (in yychar) is if
+       this state is a consistent state with a default action.  Thus,
+       detecting the absence of a lookahead is sufficient to determine
+       that there is no unexpected or expected token to report.  In that
+       case, just report a simple "syntax error".
+     - Don't assume there isn't a lookahead just because this state is a
+       consistent state with a default action.  There might have been a
+       previous inconsistent state, consistent state with a non-default
+       action, or user semantic action that manipulated yychar.
+     - Of course, the expected token list depends on states to have
+       correct lookahead information, and it depends on the parser not
+       to perform extra reductions after fetching a lookahead from the
+       scanner and before detecting a syntax error.  Thus, state merging
+       (from LALR or IELR) and default reductions corrupt the expected
+       token list.  However, the list is correct for canonical LR with
+       one exception: it will still contain any token that will not be
+       accepted due to an error action in a later state.
+  */
+  if (yytoken != YYEMPTY)
+    {
+      int yyn = yypact[*yyssp];
+      yyarg[yycount++] = yytname[yytoken];
+      if (!yypact_value_is_default (yyn))
+        {
+          /* Start YYX at -YYN if negative to avoid negative indexes in
+             YYCHECK.  In other words, skip the first -YYN actions for
+             this state because they are default actions.  */
+          int yyxbegin = yyn < 0 ? -yyn : 0;
+          /* Stay within bounds of both yycheck and yytname.  */
+          int yychecklim = YYLAST - yyn + 1;
+          int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
+          int yyx;
+
+          for (yyx = yyxbegin; yyx < yyxend; ++yyx)
+            if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR
+                && !yytable_value_is_error (yytable[yyx + yyn]))
+              {
+                if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
+                  {
+                    yycount = 1;
+                    yysize = yysize0;
+                    break;
+                  }
+                yyarg[yycount++] = yytname[yyx];
+                {
+                  YYSIZE_T yysize1 = yysize + yytnamerr (YY_NULLPTR, yytname[yyx]);
+                  if (! (yysize <= yysize1
+                         && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
+                    return 2;
+                  yysize = yysize1;
+                }
+              }
+        }
+    }
+
+  switch (yycount)
+    {
+# define YYCASE_(N, S)                      \
+      case N:                               \
+        yyformat = S;                       \
+      break
+      YYCASE_(0, YY_("syntax error"));
+      YYCASE_(1, YY_("syntax error, unexpected %s"));
+      YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
+      YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
+      YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
+      YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
+# undef YYCASE_
+    }
+
+  {
+    YYSIZE_T yysize1 = yysize + yystrlen (yyformat);
+    if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
+      return 2;
+    yysize = yysize1;
+  }
+
+  if (*yymsg_alloc < yysize)
+    {
+      *yymsg_alloc = 2 * yysize;
+      if (! (yysize <= *yymsg_alloc
+             && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
+        *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
+      return 1;
+    }
+
+  /* Avoid sprintf, as that infringes on the user's name space.
+     Don't have undefined behavior even if the translation
+     produced a string with the wrong number of "%s"s.  */
+  {
+    char *yyp = *yymsg;
+    int yyi = 0;
+    while ((*yyp = *yyformat) != '\0')
+      if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
+        {
+          yyp += yytnamerr (yyp, yyarg[yyi++]);
+          yyformat += 2;
+        }
+      else
+        {
+          yyp++;
+          yyformat++;
+        }
+  }
+  return 0;
+}
+#endif /* YYERROR_VERBOSE */
+
+/*-----------------------------------------------.
+| Release the memory associated to this symbol.  |
+`-----------------------------------------------*/
+
+static void
+yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
+{
+  YYUSE (yyvaluep);
+  if (!yymsg)
+    yymsg = "Deleting";
+  YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
+
+  YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
+  YYUSE (yytype);
+  YY_IGNORE_MAYBE_UNINITIALIZED_END
+}
+
+
+
+
+/* The lookahead symbol.  */
+int yychar;
+
+/* The semantic value of the lookahead symbol.  */
+YYSTYPE yylval;
+/* Number of syntax errors so far.  */
+int yynerrs;
+
+
+/*----------.
+| yyparse.  |
+`----------*/
+
+int
+yyparse (void)
+{
+    int yystate;
+    /* Number of tokens to shift before error messages enabled.  */
+    int yyerrstatus;
+
+    /* The stacks and their tools:
+       'yyss': related to states.
+       'yyvs': related to semantic values.
+
+       Refer to the stacks through separate pointers, to allow yyoverflow
+       to reallocate them elsewhere.  */
+
+    /* The state stack.  */
+    yytype_int16 yyssa[YYINITDEPTH];
+    yytype_int16 *yyss;
+    yytype_int16 *yyssp;
+
+    /* The semantic value stack.  */
+    YYSTYPE yyvsa[YYINITDEPTH];
+    YYSTYPE *yyvs;
+    YYSTYPE *yyvsp;
+
+    YYSIZE_T yystacksize;
+
+  int yyn;
+  int yyresult;
+  /* Lookahead token as an internal (translated) token number.  */
+  int yytoken = 0;
+  /* The variables used to return semantic value and location from the
+     action routines.  */
+  YYSTYPE yyval;
+
+#if YYERROR_VERBOSE
+  /* Buffer for error messages, and its allocated size.  */
+  char yymsgbuf[128];
+  char *yymsg = yymsgbuf;
+  YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
+#endif
+
+#define YYPOPSTACK(N)   (yyvsp -= (N), yyssp -= (N))
+
+  /* The number of symbols on the RHS of the reduced rule.
+     Keep to zero when no symbol should be popped.  */
+  int yylen = 0;
+
+  yyssp = yyss = yyssa;
+  yyvsp = yyvs = yyvsa;
+  yystacksize = YYINITDEPTH;
+
+  YYDPRINTF ((stderr, "Starting parse\n"));
+
+  yystate = 0;
+  yyerrstatus = 0;
+  yynerrs = 0;
+  yychar = YYEMPTY; /* Cause a token to be read.  */
+  goto yysetstate;
+
+/*------------------------------------------------------------.
+| yynewstate -- Push a new state, which is found in yystate.  |
+`------------------------------------------------------------*/
+ yynewstate:
+  /* In all cases, when you get here, the value and location stacks
+     have just been pushed.  So pushing a state here evens the stacks.  */
+  yyssp++;
+
+ yysetstate:
+  *yyssp = yystate;
+
+  if (yyss + yystacksize - 1 <= yyssp)
+    {
+      /* Get the current used size of the three stacks, in elements.  */
+      YYSIZE_T yysize = yyssp - yyss + 1;
+
+#ifdef yyoverflow
+      {
+        /* Give user a chance to reallocate the stack.  Use copies of
+           these so that the &'s don't force the real ones into
+           memory.  */
+        YYSTYPE *yyvs1 = yyvs;
+        yytype_int16 *yyss1 = yyss;
+
+        /* Each stack pointer address is followed by the size of the
+           data in use in that stack, in bytes.  This used to be a
+           conditional around just the two extra args, but that might
+           be undefined if yyoverflow is a macro.  */
+        yyoverflow (YY_("memory exhausted"),
+                    &yyss1, yysize * sizeof (*yyssp),
+                    &yyvs1, yysize * sizeof (*yyvsp),
+                    &yystacksize);
+
+        yyss = yyss1;
+        yyvs = yyvs1;
+      }
+#else /* no yyoverflow */
+# ifndef YYSTACK_RELOCATE
+      goto yyexhaustedlab;
+# else
+      /* Extend the stack our own way.  */
+      if (YYMAXDEPTH <= yystacksize)
+        goto yyexhaustedlab;
+      yystacksize *= 2;
+      if (YYMAXDEPTH < yystacksize)
+        yystacksize = YYMAXDEPTH;
+
+      {
+        yytype_int16 *yyss1 = yyss;
+        union yyalloc *yyptr =
+          (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
+        if (! yyptr)
+          goto yyexhaustedlab;
+        YYSTACK_RELOCATE (yyss_alloc, yyss);
+        YYSTACK_RELOCATE (yyvs_alloc, yyvs);
+#  undef YYSTACK_RELOCATE
+        if (yyss1 != yyssa)
+          YYSTACK_FREE (yyss1);
+      }
+# endif
+#endif /* no yyoverflow */
+
+      yyssp = yyss + yysize - 1;
+      yyvsp = yyvs + yysize - 1;
+
+      YYDPRINTF ((stderr, "Stack size increased to %lu\n",
+                  (unsigned long int) yystacksize));
+
+      if (yyss + yystacksize - 1 <= yyssp)
+        YYABORT;
+    }
+
+  YYDPRINTF ((stderr, "Entering state %d\n", yystate));
+
+  if (yystate == YYFINAL)
+    YYACCEPT;
+
+  goto yybackup;
+
+/*-----------.
+| yybackup.  |
+`-----------*/
+yybackup:
+
+  /* Do appropriate processing given the current state.  Read a
+     lookahead token if we need one and don't already have one.  */
+
+  /* First try to decide what to do without reference to lookahead token.  */
+  yyn = yypact[yystate];
+  if (yypact_value_is_default (yyn))
+    goto yydefault;
+
+  /* Not known => get a lookahead token if don't already have one.  */
+
+  /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol.  */
+  if (yychar == YYEMPTY)
+    {
+      YYDPRINTF ((stderr, "Reading a token: "));
+      yychar = yylex ();
+    }
+
+  if (yychar <= YYEOF)
+    {
+      yychar = yytoken = YYEOF;
+      YYDPRINTF ((stderr, "Now at end of input.\n"));
+    }
+  else
+    {
+      yytoken = YYTRANSLATE (yychar);
+      YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
+    }
+
+  /* If the proper action on seeing token YYTOKEN is to reduce or to
+     detect an error, take that action.  */
+  yyn += yytoken;
+  if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
+    goto yydefault;
+  yyn = yytable[yyn];
+  if (yyn <= 0)
+    {
+      if (yytable_value_is_error (yyn))
+        goto yyerrlab;
+      yyn = -yyn;
+      goto yyreduce;
+    }
+
+  /* Count tokens shifted since error; after three, turn off error
+     status.  */
+  if (yyerrstatus)
+    yyerrstatus--;
+
+  /* Shift the lookahead token.  */
+  YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
+
+  /* Discard the shifted token.  */
+  yychar = YYEMPTY;
+
+  yystate = yyn;
+  YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
+  *++yyvsp = yylval;
+  YY_IGNORE_MAYBE_UNINITIALIZED_END
+
+  goto yynewstate;
+
+
+/*-----------------------------------------------------------.
+| yydefault -- do the default action for the current state.  |
+`-----------------------------------------------------------*/
+yydefault:
+  yyn = yydefact[yystate];
+  if (yyn == 0)
+    goto yyerrlab;
+  goto yyreduce;
+
+
+/*-----------------------------.
+| yyreduce -- Do a reduction.  |
+`-----------------------------*/
+yyreduce:
+  /* yyn is the number of a rule to reduce with.  */
+  yylen = yyr2[yyn];
+
+  /* If YYLEN is nonzero, implement the default value of the action:
+     '$$ = $1'.
+
+     Otherwise, the following line sets YYVAL to garbage.
+     This behavior is undocumented and Bison
+     users should not rely upon it.  Assigning to YYVAL
+     unconditionally makes the parser a bit smaller, and it avoids a
+     GCC warning that YYVAL may be used uninitialized.  */
+  yyval = yyvsp[1-yylen];
+
+
+  YY_REDUCE_PRINT (yyn);
+  switch (yyn)
+    {
+        case 2:
+#line 54 "conventions.y" /* yacc.c:1646  */
+    {
+  if( asnc_ht_lookup(Ruleset, (yyvsp[0].asnc)) ) { 
+    printf("%s:%d warning: we've already got one asn '%d'\n",
+           currentfilename(), linenum, (yyvsp[0].asnc)->asn);
+    print_stack_trace();
+  } 
+  asnc_ht_insert(Ruleset, (yyvsp[0].asnc));
+}
+#line 1286 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 3:
+#line 62 "conventions.y" /* yacc.c:1646  */
+    {
+  Ruleset = asnc_ht_new(20,
+                   (asnc_hash_fn)hash_int,
+                   (asnc_iseq_fn)isequal_int, NULL);
+}
+#line 1296 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 4:
+#line 68 "conventions.y" /* yacc.c:1646  */
+    {
+  (yyval.asnc) = malloc(sizeof(struct asnc));
+  (yyval.asnc)->asn = (yyvsp[-3].in);
+  (yyval.asnc)->prefilter_regex = NULL;
+  (yyval.asnc)->conventions = (yyvsp[-1].cq);
+  set_file_and_line(&(yyval.asnc)->inst, currentfilename(), linenum);
+  conv_q_iterate_nonconst( (yyval.asnc)->conventions, set_asn, (void *)(yyval.asnc)->asn );
+  if(want_debug && conv_q_length( (yyval.asnc)->conventions) > 2) {
+    fprintf(stderr, "ASN %u has %lu unguarded expressions, an optimization opportunity.\n", 
+            (yyval.asnc)->asn, conv_q_length( (yyval.asnc)->conventions)); 
+  }
+}
+#line 1313 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 5:
+#line 79 "conventions.y" /* yacc.c:1646  */
+    {
+  (yyval.asnc) = malloc(sizeof(struct asnc));
+  memset((yyval.asnc), 0, sizeof(struct asnc));
+  (yyval.asnc)->asn = (yyvsp[-4].in);
+  (yyval.asnc)->prefilter_regex = (yyvsp[-3].cp);
+  set_file_and_line(&(yyval.asnc)->inst, currentfilename(), linenum);
+
+  /* posix egrep interprets intervals (eg. {1,32}) nicely */
+#ifdef DEPRECATED_GNU_REGEX
+  re_syntax_options = RE_SYNTAX_POSIX_EGREP;
+  {
+    const char *errstr = 
+      re_compile_pattern((yyvsp[-3].cp), strlen((yyvsp[-3].cp)), &((yyval.asnc)->prefilter_rpbuf));
+    if (errstr != NULL) {
+      fprintf(stderr, "error in compiling regular expression '%s': %s\n",
+              (yyvsp[-3].cp), errstr);
+      fprintf(stderr, "proceeding without it; error in compiling regular expression '%s': %s\n",
+              (yyvsp[-3].cp), errstr);
+    }
+  }
+#else
+  {
+    int error = regcomp(&((yyval.asnc)->prefilter_rpbuf), (yyvsp[-3].cp), REG_EXTENDED);
+    if(error) {
+      char *err = malloc(256);  
+      err[255]='\0';
+      regerror(error, &((yyval.asnc)->prefilter_rpbuf), err, 255); 
+      fprintf(stderr, "error in compiling regular expression '%s': %s\n",
+              (yyvsp[-3].cp), err);
+      fprintf(stderr, "proceeding without it; error in compiling regular expression '%s': %s\n",
+              (yyvsp[-3].cp), err);
+      free(err); /* why not. */
+    }
+  }
+#endif
+
+  (yyval.asnc)->conventions = (yyvsp[-1].cq);
+  conv_q_iterate_nonconst( (yyval.asnc)->conventions, set_asn, (void *)(yyval.asnc)->asn );
+}
+#line 1357 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 6:
+#line 119 "conventions.y" /* yacc.c:1646  */
+    { /* this is an ordered list */
+  (yyval.cq) = (yyvsp[-1].cq);
+  conv_q_append((yyvsp[-1].cq), (yyvsp[0].conv));
+}
+#line 1366 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 7:
+#line 122 "conventions.y" /* yacc.c:1646  */
+    {
+  (yyval.cq) = conv_q_new(NULL, NULL);
+}
+#line 1374 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 8:
+#line 126 "conventions.y" /* yacc.c:1646  */
+    {
+  (yyval.conv) = new_convention((yyvsp[-2].cp), (yyvsp[-1].kvb), NULL, NULL, NULL, currentfilename(), linenum);
+}
+#line 1382 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 9:
+#line 128 "conventions.y" /* yacc.c:1646  */
+    {
+  (yyval.conv) = new_convention((yyvsp[-3].cp), (yyvsp[-2].kvb), (yyvsp[-1].kvb), NULL, NULL, currentfilename(), linenum);
+}
+#line 1390 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 10:
+#line 130 "conventions.y" /* yacc.c:1646  */
+    {
+  (yyval.conv) = new_convention((yyvsp[-4].cp), (yyvsp[-3].kvb), (yyvsp[-2].kvb), (yyvsp[-1].kvb), NULL, currentfilename(), linenum);
+}
+#line 1398 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 11:
+#line 132 "conventions.y" /* yacc.c:1646  */
+    {
+  (yyval.conv) = new_convention((yyvsp[-5].cp), (yyvsp[-4].kvb), (yyvsp[-3].kvb), (yyvsp[-2].kvb), (yyvsp[-1].kvb), currentfilename(), linenum);
+}
+#line 1406 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 12:
+#line 134 "conventions.y" /* yacc.c:1646  */
+    {
+  (yyval.conv) = new_convention((yyvsp[-1].cp), NULL, NULL, NULL, NULL, currentfilename(), linenum);
+}
+#line 1414 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 13:
+#line 136 "conventions.y" /* yacc.c:1646  */
+    {
+  printf("%s:%d parse error in rule, expected ';'\n",
+         currentfilename(), linenum);
+  print_stack_trace();
+  (yyval.conv) = new_convention((yyvsp[-3].cp), (yyvsp[-2].kvb), (yyvsp[-1].kvb), NULL, NULL, currentfilename(), linenum);
+}
+#line 1425 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 14:
+#line 141 "conventions.y" /* yacc.c:1646  */
+    {
+  printf("%s:%d parse error in rule, expected ';'\n",
+         currentfilename(), linenum);
+  print_stack_trace();
+  (yyval.conv) = new_convention((yyvsp[-2].cp), (yyvsp[-1].kvb), NULL, NULL, NULL, currentfilename(), linenum);
+}
+#line 1436 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 15:
+#line 146 "conventions.y" /* yacc.c:1646  */
+    {
+  printf("%s:%d parse error after regex '%s'\n",
+         currentfilename(), linenum, (yyvsp[-1].cp));
+  print_stack_trace();
+  (yyval.conv) = new_convention((yyvsp[-1].cp), NULL, NULL, NULL, NULL, currentfilename(), linenum);
+}
+#line 1447 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 16:
+#line 153 "conventions.y" /* yacc.c:1646  */
+    {
+  (yyval.kvb) = new_key_decl((yyvsp[-5].cp), (yyvsp[-3].in), FALSE, (yyvsp[-1].dict));
+  set_file_and_line(&(yyval.kvb)->inst, currentfilename(), linenum);
+}
+#line 1456 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 17:
+#line 156 "conventions.y" /* yacc.c:1646  */
+    {
+  (yyval.kvb) = new_key_decl((yyvsp[-6].cp), (yyvsp[-3].in), TRUE, (yyvsp[-1].dict));
+  if((yyval.kvb) == NULL) {
+    printf("%s:%d bad type declaration '%s = %d'\n", 
+           currentfilename(), linenum, (yyvsp[-6].cp), (yyvsp[-3].in));
+  } else {
+    set_file_and_line(&(yyval.kvb)->inst, currentfilename(), linenum);
+  }
+}
+#line 1470 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 18:
+#line 164 "conventions.y" /* yacc.c:1646  */
+    {
+  (yyval.kvb) = new_key_decl_const((yyvsp[-2].cp), (yyvsp[0].cp));
+  if((yyval.kvb) == NULL) {
+    printf("%s:%d bad type declaration '%s = %s'\n", 
+           currentfilename(), linenum, (yyvsp[-2].cp), (yyvsp[0].cp));
+  } else {
+    set_file_and_line(&(yyval.kvb)->inst, currentfilename(), linenum);
+  }
+}
+#line 1484 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 19:
+#line 172 "conventions.y" /* yacc.c:1646  */
+    { 
+  printf("%s:%d parse error after '%s = %d {' (expecting binding table)\n",
+         currentfilename(), linenum, (yyvsp[-4].cp), (yyvsp[-2].in));
+  print_stack_trace();
+}
+#line 1494 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 20:
+#line 176 "conventions.y" /* yacc.c:1646  */
+    {
+  printf("%s:%d parse error after '%s = quid' (expecting ';')\n",
+         currentfilename(), linenum, (yyvsp[-3].cp));
+  print_stack_trace();
+}
+#line 1504 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 21:
+#line 180 "conventions.y" /* yacc.c:1646  */
+    {
+  printf("%s:%d parse error after '%s =' (expecting '{' or quid.)\n",
+         currentfilename(), linenum, (yyvsp[-2].cp));
+  print_stack_trace();
+}
+#line 1514 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 22:
+#line 184 "conventions.y" /* yacc.c:1646  */
+    {
+  printf("%s:%d parse error after id '%s'\n",
+         currentfilename(), linenum, (yyvsp[-1].cp));
+  print_stack_trace();
+}
+#line 1524 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 25:
+#line 192 "conventions.y" /* yacc.c:1646  */
+    {
+  struct stringpair *existing;
+  (yyval.dict) = (yyvsp[-1].dict);
+  /* make sure it's not already there */
+  if((existing = key_ht_lookup((yyval.dict), (yyvsp[0].binding))) != NULL) {
+    if(want_debug) {
+      if(strcmp(existing->value, (yyvsp[0].binding)->value)) {
+        printf("%s:%d key %s inconsistently redefined from %s to %s.\n", 
+               currentfilename(), linenum, (yyvsp[0].binding)->key, existing->value, (yyvsp[0].binding)->value);
+        print_stack_trace();
+        printf("  this is okay if that's what you want it to do.\n");
+      } else if(want_conventions_debug) {  
+        /* seems unnecessary to spew this often. */
+        printf("%s:%d key %s doubly defined to %s.\n", 
+               currentfilename(), linenum, (yyvsp[0].binding)->key, existing->value);
+        print_stack_trace();
+      }
+    }
+  }
+  key_ht_insert((yyval.dict), (yyvsp[0].binding));
+}
+#line 1550 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 26:
+#line 212 "conventions.y" /* yacc.c:1646  */
+    {
+  (yyval.dict) = key_ht_new_k(50, pstring_hash, pstring_isequal, NULL);
+}
+#line 1558 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 27:
+#line 216 "conventions.y" /* yacc.c:1646  */
+    {
+  (yyval.binding) = (struct stringpair *)malloc(sizeof(struct stringpair));
+  (yyval.binding)->key = (yyvsp[-1].cp);
+  (yyval.binding)->value = (yyvsp[0].cp);
+  set_file_and_line(&(yyval.binding)->inst, currentfilename(), linenum);
+  /*   if(want_debug) printf("making binding %s->%s\n", $1, $2); */
+}
+#line 1570 "conventions.c" /* yacc.c:1646  */
+    break;
+
+  case 28:
+#line 222 "conventions.y" /* yacc.c:1646  */
+    {
+  (yyval.binding) = (struct stringpair *)malloc(sizeof(struct stringpair));
+  (yyval.binding)->key=malloc(15);
+  snprintf((yyval.binding)->key, 15, "%d", (yyvsp[-1].in));
+  (yyval.binding)->value = (yyvsp[0].cp);
+  set_file_and_line(&(yyval.binding)->inst, currentfilename(), linenum);
+  /*   if(want_debug) printf("making binding %s->%s\n", $1, $2); */
+}
+#line 1583 "conventions.c" /* yacc.c:1646  */
+    break;
+
+
+#line 1587 "conventions.c" /* yacc.c:1646  */
+      default: break;
+    }
+  /* User semantic actions sometimes alter yychar, and that requires
+     that yytoken be updated with the new translation.  We take the
+     approach of translating immediately before every use of yytoken.
+     One alternative is translating here after every semantic action,
+     but that translation would be missed if the semantic action invokes
+     YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
+     if it invokes YYBACKUP.  In the case of YYABORT or YYACCEPT, an
+     incorrect destructor might then be invoked immediately.  In the
+     case of YYERROR or YYBACKUP, subsequent parser actions might lead
+     to an incorrect destructor call or verbose syntax error message
+     before the lookahead is translated.  */
+  YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
+
+  YYPOPSTACK (yylen);
+  yylen = 0;
+  YY_STACK_PRINT (yyss, yyssp);
+
+  *++yyvsp = yyval;
+
+  /* Now 'shift' the result of the reduction.  Determine what state
+     that goes to, based on the state we popped back to and the rule
+     number reduced by.  */
+
+  yyn = yyr1[yyn];
+
+  yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
+  if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+    yystate = yytable[yystate];
+  else
+    yystate = yydefgoto[yyn - YYNTOKENS];
+
+  goto yynewstate;
+
+
+/*--------------------------------------.
+| yyerrlab -- here on detecting error.  |
+`--------------------------------------*/
+yyerrlab:
+  /* Make sure we have latest lookahead translation.  See comments at
+     user semantic actions for why this is necessary.  */
+  yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar);
+
+  /* If not already recovering from an error, report this error.  */
+  if (!yyerrstatus)
+    {
+      ++yynerrs;
+#if ! YYERROR_VERBOSE
+      yyerror (YY_("syntax error"));
+#else
+# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
+                                        yyssp, yytoken)
+      {
+        char const *yymsgp = YY_("syntax error");
+        int yysyntax_error_status;
+        yysyntax_error_status = YYSYNTAX_ERROR;
+        if (yysyntax_error_status == 0)
+          yymsgp = yymsg;
+        else if (yysyntax_error_status == 1)
+          {
+            if (yymsg != yymsgbuf)
+              YYSTACK_FREE (yymsg);
+            yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc);
+            if (!yymsg)
+              {
+                yymsg = yymsgbuf;
+                yymsg_alloc = sizeof yymsgbuf;
+                yysyntax_error_status = 2;
+              }
+            else
+              {
+                yysyntax_error_status = YYSYNTAX_ERROR;
+                yymsgp = yymsg;
+              }
+          }
+        yyerror (yymsgp);
+        if (yysyntax_error_status == 2)
+          goto yyexhaustedlab;
+      }
+# undef YYSYNTAX_ERROR
+#endif
+    }
+
+
+
+  if (yyerrstatus == 3)
+    {
+      /* If just tried and failed to reuse lookahead token after an
+         error, discard it.  */
+
+      if (yychar <= YYEOF)
+        {
+          /* Return failure if at end of input.  */
+          if (yychar == YYEOF)
+            YYABORT;
+        }
+      else
+        {
+          yydestruct ("Error: discarding",
+                      yytoken, &yylval);
+          yychar = YYEMPTY;
+        }
+    }
+
+  /* Else will try to reuse lookahead token after shifting the error
+     token.  */
+  goto yyerrlab1;
+
+
+/*---------------------------------------------------.
+| yyerrorlab -- error raised explicitly by YYERROR.  |
+`---------------------------------------------------*/
+yyerrorlab:
+
+  /* Pacify compilers like GCC when the user code never invokes
+     YYERROR and the label yyerrorlab therefore never appears in user
+     code.  */
+  if (/*CONSTCOND*/ 0)
+     goto yyerrorlab;
+
+  /* Do not reclaim the symbols of the rule whose action triggered
+     this YYERROR.  */
+  YYPOPSTACK (yylen);
+  yylen = 0;
+  YY_STACK_PRINT (yyss, yyssp);
+  yystate = *yyssp;
+  goto yyerrlab1;
+
+
+/*-------------------------------------------------------------.
+| yyerrlab1 -- common code for both syntax error and YYERROR.  |
+`-------------------------------------------------------------*/
+yyerrlab1:
+  yyerrstatus = 3;      /* Each real token shifted decrements this.  */
+
+  for (;;)
+    {
+      yyn = yypact[yystate];
+      if (!yypact_value_is_default (yyn))
+        {
+          yyn += YYTERROR;
+          if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
+            {
+              yyn = yytable[yyn];
+              if (0 < yyn)
+                break;
+            }
+        }
+
+      /* Pop the current state because it cannot handle the error token.  */
+      if (yyssp == yyss)
+        YYABORT;
+
+
+      yydestruct ("Error: popping",
+                  yystos[yystate], yyvsp);
+      YYPOPSTACK (1);
+      yystate = *yyssp;
+      YY_STACK_PRINT (yyss, yyssp);
+    }
+
+  YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
+  *++yyvsp = yylval;
+  YY_IGNORE_MAYBE_UNINITIALIZED_END
+
+
+  /* Shift the error token.  */
+  YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
+
+  yystate = yyn;
+  goto yynewstate;
+
+
+/*-------------------------------------.
+| yyacceptlab -- YYACCEPT comes here.  |
+`-------------------------------------*/
+yyacceptlab:
+  yyresult = 0;
+  goto yyreturn;
+
+/*-----------------------------------.
+| yyabortlab -- YYABORT comes here.  |
+`-----------------------------------*/
+yyabortlab:
+  yyresult = 1;
+  goto yyreturn;
+
+#if !defined yyoverflow || YYERROR_VERBOSE
+/*-------------------------------------------------.
+| yyexhaustedlab -- memory exhaustion comes here.  |
+`-------------------------------------------------*/
+yyexhaustedlab:
+  yyerror (YY_("memory exhausted"));
+  yyresult = 2;
+  /* Fall through.  */
+#endif
+
+yyreturn:
+  if (yychar != YYEMPTY)
+    {
+      /* Make sure we have latest lookahead translation.  See comments at
+         user semantic actions for why this is necessary.  */
+      yytoken = YYTRANSLATE (yychar);
+      yydestruct ("Cleanup: discarding lookahead",
+                  yytoken, &yylval);
+    }
+  /* Do not reclaim the symbols of the rule whose action triggered
+     this YYABORT or YYACCEPT.  */
+  YYPOPSTACK (yylen);
+  YY_STACK_PRINT (yyss, yyssp);
+  while (yyssp != yyss)
+    {
+      yydestruct ("Cleanup: popping",
+                  yystos[*yyssp], yyvsp);
+      YYPOPSTACK (1);
+    }
+#ifndef yyoverflow
+  if (yyss != yyssa)
+    YYSTACK_FREE (yyss);
+#endif
+#if YYERROR_VERBOSE
+  if (yymsg != yymsgbuf)
+    YYSTACK_FREE (yymsg);
+#endif
+  return yyresult;
+}