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

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

#define yyparse importparse
#define yylex importlex
#define yyerror importerror
#define yylval importlval
#define yychar importchar
#define yydebug importdebug
#define yynerrs importnerrs
#define	OP_OR	257
#define	OP_AND	258
#define	OP_NOT	259
#define	OP_MS	260
#define	OP_EQUAL	261
#define	OP_APPEND	262
#define	OP_COMPARE	263
#define	KEYW_ANY	264
#define	KEYW_PEERAS	265
#define	ASPATH_POSTFIX	266
#define	TKN_FLTRNAME	267
#define	TKN_ASNO	268
#define	TKN_RSNAME	269
#define	TKN_ASNAME	270
#define	TKN_PRFXV4	271
#define	TKN_PRFXV4RNG	272
#define	TKN_IPV4	273
#define	TKN_DNS	274
#define	TKN_RTRSNAME	275
#define	TKN_PRNGNAME	276
#define	KEYW_ACTION	277
#define	KEYW_EXCEPT	278
#define	TKN_PREF	279
#define	TKN_MED	280
#define	TKN_DPA	281
#define	TKN_ASPATH	282
#define	TKN_COMMUNITY	283
#define	TKN_NEXT_HOP	284
#define	TKN_COST	285
#define	TKN_COMM_NO	286
#define	KEYW_IGP_COST	287
#define	KEYW_SELF	288
#define	KEYW_PREPEND	289
#define	KEYW_APPEND	290
#define	KEYW_DELETE	291
#define	KEYW_CONTAINS	292
#define	KEYW_AT	293
#define	KEYW_INTERNET	294
#define	KEYW_NO_EXPORT	295
#define	KEYW_NO_ADVERTISE	296
#define	KEYW_PROTOCOL	297
#define	TKN_PROTOCOL	298
#define	KEYW_INTO	299
#define	KEYW_REFINE	300
#define	KEYW_ACCEPT	301
#define	KEYW_FROM	302
#define	TKN_INT	303

#line 1 "import.y"

/*
  filename: import.y

  description:
    Defines the grammar for an RPSL import attribute.  It was mostly
    stolen from the IRRToolSet, simplified by removing ability to parse
    things defined by a dictionary (we use XML for extensibility rather
    than a dictionary).

  notes:
    Defines tokens for the associated lexer, import.l.
*/

#line 16 "import.y"
typedef union {
    char *sval;
} YYSTYPE;
#line 36 "import.y"

#include <stdio.h>
#include <stdarg.h>
#include <stdlib.h>

int yyerror(const char *s);
void syntax_error(char *fmt, ...);

#include <stdio.h>

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



#define	YYFINAL		213
#define	YYFLAG		-32768
#define	YYNTBASE	68

#define YYTRANSLATE(x) ((unsigned)(x) <= 303 ? yytranslate[x] : 117)

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,    64,     2,     2,     2,    53,
    54,    60,    62,    56,    67,    55,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,    50,    57,
     2,    58,    61,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
    65,     2,    66,    63,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,    51,    59,    52,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     1,     3,     4,     5,     6,
     7,     8,     9,    10,    11,    12,    13,    14,    15,    16,
    17,    18,    19,    20,    21,    22,    23,    24,    25,    26,
    27,    28,    29,    30,    31,    32,    33,    34,    35,    36,
    37,    38,    39,    40,    41,    42,    43,    44,    45,    46,
    47,    48,    49
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     4,     8,     9,    12,    13,    16,    18,    22,    26,
    29,    33,    36,    40,    44,    48,    53,    57,    59,    60,
    63,    67,    69,    73,    77,    79,    83,    85,    87,    89,
    90,    92,    93,    96,   100,   102,   106,   110,   112,   116,
   118,   120,   122,   124,   126,   130,   133,   137,   139,   141,
   143,   145,   147,   149,   151,   155,   159,   163,   167,   174,
   176,   180,   184,   188,   195,   202,   209,   214,   218,   222,
   224,   228,   230,   232,   234,   236,   238,   242,   246,   250,
   254,   257,   259,   263,   265,   268,   272,   274,   276,   280,
   282,   284,   286,   289,   291,   293,   295,   297,   299,   303,
   304,   306,   308,   312,   314,   316,   320,   322,   325,   327,
   330,   333,   336,   339,   341,   343,   345,   349,   351,   353,
   355,   357,   359,   363,   368,   369,   372,   375,   378,   383
};

static const short yyrhs[] = {    69,
    70,    71,     0,    69,    70,    74,     0,     0,    43,    44,
     0,     0,    45,    44,     0,    72,     0,    72,    46,    71,
     0,    72,    24,    71,     0,    74,    50,     0,    51,    73,
    52,     0,    74,    50,     0,    73,    74,    50,     0,    75,
    47,   102,     0,    48,    76,    77,     0,    75,    48,    76,
    77,     0,    78,    82,    83,     0,    22,     0,     0,    23,
    89,     0,    78,     3,    79,     0,    79,     0,    79,     4,
    80,     0,    79,    24,    80,     0,    80,     0,    53,    78,
    54,     0,    81,     0,    14,     0,    16,     0,     0,    84,
     0,     0,    39,    84,     0,    84,     3,    85,     0,    85,
     0,    85,     4,    86,     0,    85,    24,    86,     0,    86,
     0,    53,    84,    54,     0,    87,     0,    19,     0,    88,
     0,    21,     0,    20,     0,    88,    55,    20,     0,    90,
    50,     0,    89,    90,    50,     0,    91,     0,    92,     0,
    93,     0,    94,     0,    96,     0,   100,     0,   101,     0,
    25,     7,    49,     0,    26,     7,    49,     0,    26,     7,
    33,     0,    27,     7,    49,     0,    28,    55,    35,    53,
    95,    54,     0,    14,     0,    95,    56,    14,     0,    29,
     7,    97,     0,    29,     8,    97,     0,    29,    55,    36,
    53,    98,    54,     0,    29,    55,    37,    53,    98,    54,
     0,    29,    55,    38,    53,    98,    54,     0,    29,    53,
    98,    54,     0,    29,     9,    97,     0,    51,    98,    52,
     0,    99,     0,    98,    56,    99,     0,    40,     0,    41,
     0,    42,     0,    49,     0,    32,     0,    30,     7,    19,
     0,    30,     7,    34,     0,    31,     7,    49,     0,   102,
     3,   103,     0,   102,   103,     0,   103,     0,   103,     4,
   104,     0,   104,     0,     5,   104,     0,    53,   102,    54,
     0,   105,     0,    10,     0,    57,   111,    58,     0,    90,
     0,    13,     0,   106,     0,   107,     6,     0,   107,     0,
    14,     0,    11,     0,    16,     0,    15,     0,    51,   108,
    52,     0,     0,   109,     0,   110,     0,   109,    56,   110,
     0,    17,     0,    18,     0,   111,    59,   112,     0,   112,
     0,   112,   113,     0,   113,     0,   113,    60,     0,   113,
    61,     0,   113,    62,     0,   113,    12,     0,   114,     0,
    63,     0,    64,     0,    53,   111,    54,     0,   115,     0,
    14,     0,    11,     0,    16,     0,    55,     0,    65,   116,
    66,     0,    65,    63,   116,    66,     0,     0,   116,    14,
     0,   116,    11,     0,   116,    55,     0,   116,    14,    67,
    14,     0,   116,    16,     0
};

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
    48,    49,    52,    53,    56,    57,    60,    61,    62,    65,
    66,    69,    70,    73,    76,    77,    80,    81,    84,    85,
    88,    89,    92,    93,    94,    97,    98,   101,   102,   105,
   106,   109,   110,   113,   114,   117,   118,   119,   122,   123,
   126,   127,   132,   135,   136,   139,   140,   143,   144,   145,
   146,   147,   148,   149,   152,   163,   172,   175,   186,   189,
   190,   193,   194,   195,   196,   197,   198,   199,   202,   205,
   206,   209,   210,   211,   212,   222,   225,   226,   229,   240,
   241,   242,   245,   246,   249,   250,   251,   254,   255,   256,
   257,   258,   261,   262,   265,   266,   267,   268,   269,   272,
   273,   276,   277,   280,   281,   284,   285,   288,   289,   292,
   293,   294,   295,   296,   299,   300,   301,   302,   305,   306,
   307,   308,   309,   310,   313,   314,   315,   316,   317,   318
};
#endif


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

static const char * const yytname[] = {   "$","error","$undefined.","OP_OR",
"OP_AND","OP_NOT","OP_MS","OP_EQUAL","OP_APPEND","OP_COMPARE","KEYW_ANY","KEYW_PEERAS",
"ASPATH_POSTFIX","TKN_FLTRNAME","TKN_ASNO","TKN_RSNAME","TKN_ASNAME","TKN_PRFXV4",
"TKN_PRFXV4RNG","TKN_IPV4","TKN_DNS","TKN_RTRSNAME","TKN_PRNGNAME","KEYW_ACTION",
"KEYW_EXCEPT","TKN_PREF","TKN_MED","TKN_DPA","TKN_ASPATH","TKN_COMMUNITY","TKN_NEXT_HOP",
"TKN_COST","TKN_COMM_NO","KEYW_IGP_COST","KEYW_SELF","KEYW_PREPEND","KEYW_APPEND",
"KEYW_DELETE","KEYW_CONTAINS","KEYW_AT","KEYW_INTERNET","KEYW_NO_EXPORT","KEYW_NO_ADVERTISE",
"KEYW_PROTOCOL","TKN_PROTOCOL","KEYW_INTO","KEYW_REFINE","KEYW_ACCEPT","KEYW_FROM",
"TKN_INT","';'","'{'","'}'","'('","')'","'.'","','","'<'","'>'","'|'","'*'",
"'?'","'+'","'^'","'$'","'['","']'","'-'","import_attribute","opt_protocol_from",
"opt_protocol_into","import_expr","import_term","import_factor_list","import_factor",
"import_peering_action_list","peering","opt_action","as_expr","as_expr_term",
"as_expr_factor","as_expr_operand","opt_router_expr","opt_router_expr_with_at",
"router_expr","router_expr_term","router_expr_factor","router_expr_operand",
"domain_name","action","rp_attribute","pref","med","dpa","aspath","asno_list",
"community","community_list","community_elm_list","community_elm","next_hop",
"cost","filter","filter_term","filter_factor","filter_operand","filter_prefix",
"filter_prefix_operand","opt_filter_prefix_list","filter_prefix_list","filter_prefix_list_prefix",
"filter_aspath","filter_aspath_term","filter_aspath_closure","filter_aspath_factor",
"filter_aspath_no","filter_aspath_range", NULL
};
#endif

static const short yyr1[] = {     0,
    68,    68,    69,    69,    70,    70,    71,    71,    71,    72,
    72,    73,    73,    74,    75,    75,    76,    76,    77,    77,
    78,    78,    79,    79,    79,    80,    80,    81,    81,    82,
    82,    83,    83,    84,    84,    85,    85,    85,    86,    86,
    87,    87,    87,    88,    88,    89,    89,    90,    90,    90,
    90,    90,    90,    90,    91,    92,    92,    93,    94,    95,
    95,    96,    96,    96,    96,    96,    96,    96,    97,    98,
    98,    99,    99,    99,    99,    99,   100,   100,   101,   102,
   102,   102,   103,   103,   104,   104,   104,   105,   105,   105,
   105,   105,   106,   106,   107,   107,   107,   107,   107,   108,
   108,   109,   109,   110,   110,   111,   111,   112,   112,   113,
   113,   113,   113,   113,   114,   114,   114,   114,   115,   115,
   115,   115,   115,   115,   116,   116,   116,   116,   116,   116
};

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

static const short yydefact[] = {     3,
     0,     5,     4,     0,     0,     6,     0,     0,     1,     7,
     2,     0,    28,    29,    18,     0,    19,    30,    22,    25,
    27,     0,     0,     0,     0,    10,     0,     0,     0,     0,
    15,     0,    41,    44,    43,     0,    32,    31,    35,    38,
    40,    42,     0,     0,    11,     0,    12,     9,     0,     8,
     0,    88,    96,    91,    95,    98,    97,     0,     0,     0,
     0,     0,     0,     0,   100,     0,     0,    90,    48,    49,
    50,    51,    52,    53,    54,    14,    82,    84,    87,    92,
    94,    19,    26,    20,     0,    21,     0,     0,    17,     0,
     0,     0,     0,    23,    24,    13,    85,     0,     0,     0,
     0,     0,     0,     0,     0,     0,     0,     0,   104,   105,
     0,   101,   102,     0,   120,   119,   121,     0,   122,   115,
   116,   125,     0,   107,   109,   114,   118,     0,    81,     0,
    93,    16,     0,    46,    39,    33,    34,    36,    37,    45,
    55,    57,    56,    58,     0,     0,    62,    63,    68,    76,
    72,    73,    74,    75,     0,    70,     0,     0,     0,    77,
    78,    79,    99,     0,    86,     0,   125,     0,    89,     0,
   108,   113,   110,   111,   112,    80,    83,    47,     0,     0,
    67,     0,     0,     0,     0,   103,   117,     0,   127,   126,
   130,   128,   123,   106,    60,     0,    69,    71,     0,     0,
     0,   124,     0,    59,     0,    64,    65,    66,   129,    61,
     0,     0,     0
};

static const short yydefgoto[] = {   211,
     2,     5,     9,    10,    22,    49,    12,    17,    31,    18,
    19,    20,    21,    37,    89,    38,    39,    40,    41,    42,
    84,    68,    69,    70,    71,    72,   196,    73,   147,   155,
   156,    74,    75,    76,    77,    78,    79,    80,    81,   111,
   112,   113,   123,   124,   125,   126,   127,   168
};

static const short yypact[] = {   -26,
    -1,     7,-32768,    30,    86,-32768,    -2,    74,-32768,     2,
    78,   -16,-32768,-32768,-32768,    85,   132,    66,    26,-32768,
-32768,    -7,    89,    86,    86,-32768,   116,    -2,     6,   133,
-32768,    85,-32768,-32768,-32768,    83,   126,   173,    87,-32768,
-32768,   127,    85,    85,-32768,   138,-32768,-32768,    78,-32768,
   116,-32768,-32768,-32768,-32768,-32768,-32768,   180,   182,   183,
   136,    20,   185,   186,    96,   116,    52,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,    67,   190,-32768,-32768,-32768,
   189,   132,-32768,   133,   147,    26,    22,    83,-32768,    83,
    83,    83,   176,-32768,-32768,-32768,-32768,   149,    51,   150,
   165,   151,   151,   151,   108,   115,    91,   152,-32768,-32768,
   153,   148,-32768,     8,-32768,-32768,-32768,    52,-32768,-32768,
-32768,   140,   120,    52,    28,-32768,-32768,   116,   190,   116,
-32768,-32768,   156,-32768,-32768,   173,    87,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,   154,   108,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,    79,-32768,   155,   157,   158,-32768,
-32768,-32768,-32768,    96,-32768,   -10,-32768,    -9,-32768,    52,
    28,-32768,-32768,-32768,-32768,   190,-32768,-32768,   195,    56,
-32768,   108,   108,   108,   108,-32768,-32768,    -8,-32768,   145,
-32768,-32768,-32768,    52,-32768,   100,-32768,-32768,   112,   118,
   121,-32768,   199,-32768,   200,-32768,-32768,-32768,-32768,-32768,
   215,   216,-32768
};

static const short yypgoto[] = {-32768,
-32768,-32768,   146,-32768,-32768,   101,-32768,   191,   135,   202,
   188,   137,-32768,-32768,-32768,   -21,   131,    92,-32768,-32768,
-32768,   -20,-32768,-32768,-32768,-32768,-32768,-32768,    82,  -130,
    40,-32768,-32768,   159,   -72,   -51,-32768,-32768,-32768,-32768,
-32768,    59,   106,    57,  -123,-32768,-32768,    61
};


#define	YYLAST		228


static const short yytable[] = {    97,
   171,   189,   189,   129,   190,   190,   191,   191,    32,    85,
   128,    13,    51,    14,    87,   180,     1,    52,    53,    15,
    54,    55,    56,    57,    90,    24,   102,   103,   104,    43,
    27,    28,    58,    59,    60,    61,    62,    63,    64,   172,
     7,   129,     3,   187,    45,   192,   192,    25,   170,    44,
    16,     4,   199,   200,   201,   176,   193,   202,    65,    83,
    66,   165,   115,   133,    67,   116,   136,   117,    32,   128,
   171,    51,   105,     6,   106,   135,    52,    53,   177,    54,
    55,    56,    57,   142,    33,    34,    35,   173,   174,   175,
    91,    58,    59,    60,    61,    62,    63,    64,    13,   143,
    14,    33,    34,    35,   118,    11,   119,   197,    23,   160,
    92,   182,   109,   110,   120,   121,   122,    65,    36,    66,
    51,     7,    46,    67,   161,    52,    53,    26,    54,    55,
    56,    57,   181,     7,   182,    36,     8,    16,    47,   150,
    58,    59,    60,    61,    62,    63,    64,   151,   152,   153,
   157,   158,   159,   204,    30,   205,   154,    58,    59,    60,
    61,    62,    63,    64,    88,   206,    65,   182,    66,    48,
    50,   207,    67,   182,   208,    90,   182,   169,   170,    94,
    95,    93,   138,   139,   148,   149,    98,    96,    99,   100,
   101,   107,   108,   130,   131,   140,   134,   141,   144,   145,
   162,   146,   167,   164,   163,   178,   179,   183,   195,   184,
   185,   203,   209,   210,   212,   213,   132,    29,    82,    86,
   137,   198,   186,   166,   114,     0,   194,   188
};

static const short yycheck[] = {    51,
   124,    11,    11,    76,    14,    14,    16,    16,     3,    30,
     3,    14,     5,    16,    36,   146,    43,    10,    11,    22,
    13,    14,    15,    16,     3,    24,     7,     8,     9,     4,
    47,    48,    25,    26,    27,    28,    29,    30,    31,    12,
    48,   114,    44,    54,    52,    55,    55,    46,    59,    24,
    53,    45,   183,   184,   185,   128,    66,    66,    51,    54,
    53,    54,    11,    84,    57,    14,    88,    16,     3,     3,
   194,     5,    53,    44,    55,    54,    10,    11,   130,    13,
    14,    15,    16,    33,    19,    20,    21,    60,    61,    62,
     4,    25,    26,    27,    28,    29,    30,    31,    14,    49,
    16,    19,    20,    21,    53,     5,    55,    52,     8,    19,
    24,    56,    17,    18,    63,    64,    65,    51,    53,    53,
     5,    48,    22,    57,    34,    10,    11,    50,    13,    14,
    15,    16,    54,    48,    56,    53,    51,    53,    50,    32,
    25,    26,    27,    28,    29,    30,    31,    40,    41,    42,
    36,    37,    38,    54,    23,    56,    49,    25,    26,    27,
    28,    29,    30,    31,    39,    54,    51,    56,    53,    24,
    25,    54,    57,    56,    54,     3,    56,    58,    59,    43,
    44,    55,    91,    92,   103,   104,     7,    50,     7,     7,
    55,     7,     7,     4,     6,    20,    50,    49,    49,    35,
    49,    51,    63,    56,    52,    50,    53,    53,    14,    53,
    53,    67,    14,    14,     0,     0,    82,    16,    28,    32,
    90,   182,   164,   118,    66,    -1,   170,   167
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/local/share/bison.simple"
/* This file comes from bison-1.28.  */

/* Skeleton output parser for bison,
   Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.

   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2, or (at your option)
   any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place - Suite 330,
   Boston, MA 02111-1307, USA.  */

/* As a special exception, when this file is copied by Bison into a
   Bison output file, you may use that output file without restriction.
   This special exception was added by the Free Software Foundation
   in version 1.24 of Bison.  */

/* This is the parser code that is written into each bison parser
  when the %semantic_parser declaration is not specified in the grammar.
  It was written by Richard Stallman by simplifying the hairy parser
  used when %semantic_parser is specified.  */

#ifndef 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/local/share/bison.simple"

/* The user can define YYPARSE_PARAM as the name of an argument to be passed
   into yyparse.  The argument should have type void *.
   It should actually point to an object.
   Grammar actions can access the variable by casting it
   to the proper pointer type.  */

#ifdef YYPARSE_PARAM
#ifdef __cplusplus
#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
#define YYPARSE_PARAM_DECL
#else /* not __cplusplus */
#define YYPARSE_PARAM_ARG YYPARSE_PARAM
#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
#endif /* not __cplusplus */
#else /* not YYPARSE_PARAM */
#define YYPARSE_PARAM_ARG
#define YYPARSE_PARAM_DECL
#endif /* not YYPARSE_PARAM */

/* Prevent warning if -Wstrict-prototypes.  */
#ifdef __GNUC__
#ifdef YYPARSE_PARAM
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 42:
#line 127 "import.y"
{
    if (strlen(yyvsp[0].sval) > 255) {
        syntax_error("Domain name \"%s\" is longer than 255 characters", yyvsp[0].sval);
    }
;
    break;}
case 55:
#line 152 "import.y"
{
      long int val;
      char *s, *p;
      p = yyvsp[0].sval;
      val = strtol(p, &s, 10);
      if ((val < 0) || (val > 65535)) {
          syntax_error("pref value \"%s\" is not between 0 and 65535", p);
      }
;
    break;}
case 56:
#line 163 "import.y"
{
      long int val;
      char *s, *p;
      p = yyvsp[0].sval;
      val = strtol(p, &s, 10);
      if ((val < 0) || (val > 65535)) {
          syntax_error("med value \"%s\" is not between 0 and 65535", p);
      }
;
    break;}
case 58:
#line 175 "import.y"
{
      long int val;
      char *s, *p;
      p = yyvsp[0].sval;
      val = strtol(p, &s, 10);
      if ((val < 0) || (val > 65535)) {
          syntax_error("dpa value \"%s\" is not between 0 and 65535", p);
      }
;
    break;}
case 75:
#line 212 "import.y"
{
      unsigned long int val;
      char *s, *p;
      p = yyvsp[0].sval;
      val = strtoul(p, &s, 10);
      if ((val < 1) || (val > 4294967295UL) || (*s != '\0')) {
          syntax_error("community element \"%s\" is not between 1 and 4294967295", 
                       p);
      }
;
    break;}
case 79:
#line 229 "import.y"
{
      long int val;
      char *s, *p;
      p = yyvsp[0].sval;
      val = strtol(p, &s, 10);
      if ((val < 0) || (val > 65535)) {
          syntax_error("cost value \"%s\" is not between 0 and 65535", p);
      }
;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 543 "/usr/local/share/bison.simple"

  yyvsp -= yylen;
  yyssp -= yylen;
#ifdef YYLSP_NEEDED
  yylsp -= yylen;
#endif

#if YYDEBUG != 0
  if (yydebug)
    {
      short *ssp1 = yyss - 1;
      fprintf (stderr, "state stack now");
      while (ssp1 != yyssp)
	fprintf (stderr, " %d", *++ssp1);
      fprintf (stderr, "\n");
    }
#endif

  *++yyvsp = yyval;

#ifdef YYLSP_NEEDED
  yylsp++;
  if (yylen == 0)
    {
      yylsp->first_line = yylloc.first_line;
      yylsp->first_column = yylloc.first_column;
      yylsp->last_line = (yylsp-1)->last_line;
      yylsp->last_column = (yylsp-1)->last_column;
      yylsp->text = 0;
    }
  else
    {
      yylsp->last_line = (yylsp+yylen-1)->last_line;
      yylsp->last_column = (yylsp+yylen-1)->last_column;
    }
#endif

  /* Now "shift" the result of the reduction.
     Determine what state that goes to,
     based on the state we popped back to
     and the rule number reduced by.  */

  yyn = yyr1[yyn];

  yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
  if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
    yystate = yytable[yystate];
  else
    yystate = yydefgoto[yyn - YYNTBASE];

  goto yynewstate;

yyerrlab:   /* here on detecting error */

  if (! yyerrstatus)
    /* If not already recovering from an error, report this error.  */
    {
      ++yynerrs;

#ifdef YYERROR_VERBOSE
      yyn = yypact[yystate];

      if (yyn > YYFLAG && yyn < YYLAST)
	{
	  int size = 0;
	  char *msg;
	  int x, count;

	  count = 0;
	  /* Start X at -yyn if nec to avoid negative indexes in yycheck.  */
	  for (x = (yyn < 0 ? -yyn : 0);
	       x < (sizeof(yytname) / sizeof(char *)); x++)
	    if (yycheck[x + yyn] == x)
	      size += strlen(yytname[x]) + 15, count++;
	  msg = (char *) malloc(size + 15);
	  if (msg != 0)
	    {
	      strcpy(msg, "parse error");

	      if (count < 5)
		{
		  count = 0;
		  for (x = (yyn < 0 ? -yyn : 0);
		       x < (sizeof(yytname) / sizeof(char *)); x++)
		    if (yycheck[x + yyn] == x)
		      {
			strcat(msg, count == 0 ? ", expecting `" : " or `");
			strcat(msg, yytname[x]);
			strcat(msg, "'");
			count++;
		      }
		}
	      yyerror(msg);
	      free(msg);
	    }
	  else
	    yyerror ("parse error; also virtual memory exceeded");
	}
      else
#endif /* YYERROR_VERBOSE */
	yyerror("parse error");
    }

  goto yyerrlab1;
yyerrlab1:   /* here on error raised explicitly by an action */

  if (yyerrstatus == 3)
    {
      /* if just tried and failed to reuse lookahead token after an error, discard it.  */

      /* return failure if at end of input */
      if (yychar == YYEOF)
	YYABORT;

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif

      yychar = YYEMPTY;
    }

  /* Else will try to reuse lookahead token
     after shifting the error token.  */

  yyerrstatus = 3;		/* Each real token shifted decrements this */

  goto yyerrhandle;

yyerrdefault:  /* current state does not do anything special for the error token. */

#if 0
  /* This is wrong; only states that explicitly want error tokens
     should shift them.  */
  yyn = yydefact[yystate];  /* If its default is to accept any token, ok.  Otherwise pop it.*/
  if (yyn) goto yydefault;
#endif

yyerrpop:   /* pop the current state because it cannot handle the error token */

  if (yyssp == yyss) YYABORT;
  yyvsp--;
  yystate = *--yyssp;
#ifdef YYLSP_NEEDED
  yylsp--;
#endif

#if YYDEBUG != 0
  if (yydebug)
    {
      short *ssp1 = yyss - 1;
      fprintf (stderr, "Error: state stack now");
      while (ssp1 != yyssp)
	fprintf (stderr, " %d", *++ssp1);
      fprintf (stderr, "\n");
    }
#endif

yyerrhandle:

  yyn = yypact[yystate];
  if (yyn == YYFLAG)
    goto yyerrdefault;

  yyn += YYTERROR;
  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
    goto yyerrdefault;

  yyn = yytable[yyn];
  if (yyn < 0)
    {
      if (yyn == YYFLAG)
	goto yyerrpop;
      yyn = -yyn;
      goto yyreduce;
    }
  else if (yyn == 0)
    goto yyerrpop;

  if (yyn == YYFINAL)
    YYACCEPT;

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Shifting error token, ");
#endif

  *++yyvsp = yylval;
#ifdef YYLSP_NEEDED
  *++yylsp = yylloc;
#endif

  yystate = yyn;
  goto yynewstate;

 yyacceptlab:
  /* YYACCEPT comes here.  */
  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 321 "import.y"


#undef importerror
#undef yyerror

int
importerror (const char *s)
{
    yyerror(s);
    return 0;
}

