/* A Bison parser, made from net.yacc by GNU Bison version 1.27 */ #define YYBISON 1 /* Identify Bison output. */ #define L_OR 257 #define L_AND 258 #define L_NOT 259 #define L_EQ 260 #define L_NEQ 261 #define L_LT 262 #define L_GT 263 #define L_LEQ 264 #define L_GEQ 265 #define A_PLUS 266 #define A_MINUS 267 #define A_TIMES 268 #define A_DIV 269 #define A_IDIV 270 #define A_MOD 271 #define A_EXP 272 #define U_MINUS 273 #define V_TRUE 274 #define V_FALSE 275 #define T_BAR 276 #define T_LPAR 277 #define T_RPAR 278 #define T_LBRA 279 #define T_RBRA 280 #define T_LSQB 281 #define T_RSQB 282 #define T_ASSIGN 283 #define T_COMMA 284 #define T_COLON 285 #define T_SEMI 286 #define T_PP 287 #define T_MM 288 #define T_RA 289 #define T_DOTDOT 290 #define T_COMMENT 291 #define T_ID 292 #define T_EXID 293 #define T_INT 294 #define T_STRING 295 #define T_FLOAT 296 #define K_BACKWARD 297 #define K_CANCEL 298 #define K_ELSE 299 #define K_FOR 300 #define K_FORWARD 301 #define K_IF 302 #define K_INCLUDE 303 #define K_LOOP 304 #define K_MACRO 305 #define K_MODULE 306 #define K_NULL 307 #define K_OFF 308 #define K_ON 309 #define K_PALINDROME 310 #define K_PAUSE 311 #define K_PLAY 312 #define K_QUIT 313 #define K_REPEAT 314 #define K_RESUME 315 #define K_SEQUENCE 316 #define K_STEP 317 #define K_STOP 318 #define K_SUSPEND 319 #define K_THEN 320 #define K_UNTIL 321 #define K_WHILE 322 #define P_INTERRUPT 323 #define P_SYSTEM 324 #define P_ACK 325 #define P_MACRO 326 #define P_FOREGROUND 327 #define P_BACKGROUND 328 #define P_ERROR 329 #define P_MESSAGE 330 #define P_INFO 331 #define P_LINQ 332 #define P_SINQ 333 #define P_VINQ 334 #define P_LRESP 335 #define P_SRESP 336 #define P_VRESP 337 #define P_DATA 338 #line 1 "net.yacc" /***********************************************************************/ /* Open Visualization Data Explorer */ /* (C) Copyright IBM Corp. 1989,1999 */ /* ALL RIGHTS RESERVED */ /* This code licensed under the */ /* "IBM PUBLIC LICENSE - Open Visualization Data Explorer" */ /***********************************************************************/ /*****************************************************************************/ /* uin.yacc - */ /* */ /* Contains SVS script language grammar for yacc. */ /* */ /*****************************************************************************/ /* * $Header: /home/gda/dxcvs/dx/src/ui++/dxuilib/net.yacc,v 1.3 1999/05/10 15:46:23 gda Exp $ */ #include "Parse.h" #line 26 "net.yacc" typedef union { union { char c; int i; float f; char s[4096]; /* 4096 == YYLMAX in net.lex */ } ast; } YYSTYPE; #include #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 172 #define YYFLAG -32768 #define YYNTBASE 85 #define YYTRANSLATE(x) ((unsigned)(x) <= 338 ? yytranslate[x] : 131) static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84 }; #if YYDEBUG != 0 static const short yyprhs[] = { 0, 0, 3, 4, 6, 8, 10, 22, 30, 32, 34, 37, 42, 44, 48, 52, 58, 62, 64, 66, 68, 71, 73, 77, 81, 83, 85, 88, 90, 92, 96, 100, 103, 106, 108, 110, 114, 116, 118, 120, 124, 128, 132, 133, 139, 141, 143, 145, 149, 151, 155, 157, 159, 161, 163, 167, 169, 171, 175, 177, 179, 181, 183, 185, 189, 193, 197, 203, 211, 213, 216, 220, 224, 228, 230, 233, 237, 239, 241, 243, 245, 247, 253, 259, 269, 279, 281, 283, 285, 288, 292, 294, 297, 302, 304, 306 }; static const short yyrhs[] = { 87, 86, 0, 0, 95, 0, 88, 0, 130, 0, 51, 38, 23, 89, 24, 35, 23, 89, 24, 100, 92, 0, 51, 38, 23, 89, 24, 100, 92, 0, 130, 0, 90, 0, 91, 100, 0, 90, 30, 91, 100, 0, 38, 0, 38, 29, 38, 0, 38, 29, 114, 0, 38, 29, 38, 29, 114, 0, 25, 93, 26, 0, 130, 0, 94, 0, 95, 0, 94, 95, 0, 92, 0, 97, 100, 32, 0, 105, 100, 32, 0, 96, 0, 111, 0, 49, 126, 0, 98, 0, 99, 0, 127, 29, 105, 0, 127, 29, 112, 0, 38, 33, 0, 38, 34, 0, 130, 0, 101, 0, 27, 102, 28, 0, 130, 0, 103, 0, 104, 0, 103, 30, 104, 0, 38, 31, 126, 0, 38, 31, 123, 0, 0, 38, 106, 23, 107, 24, 0, 130, 0, 108, 0, 109, 0, 108, 30, 109, 0, 110, 0, 38, 29, 110, 0, 114, 0, 38, 0, 37, 0, 113, 0, 112, 30, 113, 0, 114, 0, 129, 0, 23, 113, 24, 0, 119, 0, 117, 0, 115, 0, 126, 0, 53, 0, 25, 118, 26, 0, 25, 116, 26, 0, 25, 125, 26, 0, 25, 120, 36, 120, 26, 0, 25, 120, 36, 120, 31, 120, 26, 0, 117, 0, 116, 117, 0, 116, 30, 117, 0, 27, 118, 28, 0, 27, 116, 28, 0, 119, 0, 118, 119, 0, 118, 30, 119, 0, 120, 0, 121, 0, 122, 0, 123, 0, 124, 0, 23, 123, 30, 123, 24, 0, 23, 124, 30, 124, 24, 0, 23, 123, 30, 123, 30, 123, 30, 123, 24, 0, 23, 124, 30, 124, 30, 124, 30, 124, 24, 0, 40, 0, 42, 0, 126, 0, 125, 126, 0, 125, 30, 126, 0, 41, 0, 128, 100, 0, 127, 30, 128, 100, 0, 38, 0, 38, 0, 0 }; #endif #if YYDEBUG != 0 static const short yyrline[] = { 0, 198, 202, 204, 205, 206, 213, 220, 228, 229, 232, 233, 236, 237, 238, 239, 246, 253, 254, 257, 258, 265, 266, 267, 268, 269, 275, 283, 284, 287, 290, 291, 292, 299, 300, 303, 306, 307, 310, 311, 316, 322, 332, 336, 343, 344, 347, 348, 351, 352, 355, 359, 369, 379, 380, 383, 384, 385, 392, 393, 394, 395, 396, 399, 400, 401, 402, 403, 406, 407, 408, 411, 412, 415, 416, 417, 420, 421, 422, 425, 426, 429, 430, 433, 434, 437, 440, 443, 444, 445, 448, 451, 452, 455, 461, 467 }; #endif #if YYDEBUG != 0 || defined (YYERROR_VERBOSE) static const char * const yytname[] = { "$","error","$undefined.","L_OR","L_AND", "L_NOT","L_EQ","L_NEQ","L_LT","L_GT","L_LEQ","L_GEQ","A_PLUS","A_MINUS","A_TIMES", "A_DIV","A_IDIV","A_MOD","A_EXP","U_MINUS","V_TRUE","V_FALSE","T_BAR","T_LPAR", "T_RPAR","T_LBRA","T_RBRA","T_LSQB","T_RSQB","T_ASSIGN","T_COMMA","T_COLON", "T_SEMI","T_PP","T_MM","T_RA","T_DOTDOT","T_COMMENT","T_ID","T_EXID","T_INT", "T_STRING","T_FLOAT","K_BACKWARD","K_CANCEL","K_ELSE","K_FOR","K_FORWARD","K_IF", "K_INCLUDE","K_LOOP","K_MACRO","K_MODULE","K_NULL","K_OFF","K_ON","K_PALINDROME", "K_PAUSE","K_PLAY","K_QUIT","K_REPEAT","K_RESUME","K_SEQUENCE","K_STEP","K_STOP", "K_SUSPEND","K_THEN","K_UNTIL","K_WHILE","P_INTERRUPT","P_SYSTEM","P_ACK","P_MACRO", "P_FOREGROUND","P_BACKGROUND","P_ERROR","P_MESSAGE","P_INFO","P_LINQ","P_SINQ", "P_VINQ","P_LRESP","P_SRESP","P_VRESP","P_DATA","start","c_0","top","macro", "formal_s0","formal_s","formal","block","statement_s0","statement_s","statement", "include","assignment","f_assignment","s_assignment","attributes_0","attributes", "attribute_s0","attribute_s","attribute","function_call","@1","argument_s0", "argument_s","argument","value","comment","expression_s","expression","constant", "list","tensor_s","tensor","scalar_s","scalar","real","complex","quaternion", "int","float","string_s","string","l_value_s","l_value","r_value","empty", NULL }; #endif static const short yyr1[] = { 0, 85, 86, 87, 87, 87, 88, 88, 89, 89, 90, 90, 91, 91, 91, 91, 92, 93, 93, 94, 94, 95, 95, 95, 95, 95, 96, 97, 97, 98, 99, 99, 99, 100, 100, 101, 102, 102, 103, 103, 104, 104, 106, 105, 107, 107, 108, 108, 109, 109, 110, 110, 111, 112, 112, 113, 113, 113, 114, 114, 114, 114, 114, 115, 115, 115, 115, 115, 116, 116, 116, 117, 117, 118, 118, 118, 119, 119, 119, 120, 120, 121, 121, 122, 122, 123, 124, 125, 125, 125, 126, 127, 127, 128, 129, 130 }; static const short yyr2[] = { 0, 2, 0, 1, 1, 1, 11, 7, 1, 1, 2, 4, 1, 3, 3, 5, 3, 1, 1, 1, 2, 1, 3, 3, 1, 1, 2, 1, 1, 3, 3, 2, 2, 1, 1, 3, 1, 1, 1, 3, 3, 3, 0, 5, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 3, 3, 3, 5, 7, 1, 2, 3, 3, 3, 1, 2, 3, 1, 1, 1, 1, 1, 5, 5, 9, 9, 1, 1, 1, 2, 3, 1, 2, 4, 1, 1, 0 }; static const short yydefact[] = { 95, 95, 52, 93, 0, 0, 2, 4, 21, 3, 24, 95, 27, 28, 95, 25, 0, 95, 5, 0, 18, 19, 17, 31, 32, 0, 90, 26, 0, 1, 95, 0, 34, 33, 0, 0, 0, 91, 16, 20, 95, 95, 0, 0, 37, 38, 36, 22, 23, 0, 0, 0, 94, 85, 86, 62, 29, 30, 53, 55, 60, 59, 58, 76, 77, 78, 79, 80, 61, 56, 93, 95, 0, 51, 0, 45, 46, 48, 50, 44, 12, 0, 9, 95, 8, 0, 35, 0, 94, 0, 79, 80, 0, 68, 0, 73, 76, 0, 87, 0, 0, 0, 92, 0, 0, 0, 43, 0, 0, 95, 0, 10, 41, 40, 39, 57, 0, 0, 64, 0, 69, 63, 0, 74, 0, 65, 0, 88, 72, 71, 54, 51, 49, 47, 13, 14, 0, 0, 95, 0, 0, 70, 75, 0, 89, 0, 95, 7, 11, 81, 0, 82, 0, 66, 0, 15, 0, 0, 0, 0, 95, 0, 0, 67, 0, 0, 0, 6, 83, 84, 0, 0, 0 }; static const short yydefgoto[] = { 170, 29, 6, 7, 81, 82, 83, 8, 19, 20, 9, 10, 11, 12, 13, 31, 32, 43, 44, 45, 14, 25, 74, 75, 76, 77, 15, 57, 58, 59, 60, 92, 61, 94, 62, 63, 64, 65, 66, 67, 97, 68, 16, 17, 69, 33 }; static const short yypact[] = { 52, 55,-32768, 37, -15, -30,-32768,-32768,-32768,-32768,-32768, 20,-32768,-32768, 20,-32768, 139, 20,-32768, 14, 55, -32768,-32768,-32768,-32768, 29,-32768,-32768, 33,-32768, 23, 31,-32768,-32768, 51, -5, 53,-32768,-32768,-32768, 26, 61, 65, 74, 77,-32768,-32768,-32768,-32768, 90, 134, 122, 88,-32768,-32768,-32768,-32768, 84,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 20, -19, 105, 112, 99,-32768,-32768,-32768,-32768, 115, 135, 109, 20,-32768, 140,-32768, 23,-32768, 142, 125, 148, 79,-32768, 4,-32768, 146, 13,-32768, 92, 137, 90,-32768, 125, 148, 100,-32768, 26, 110, -10, 61, -32768,-32768,-32768,-32768,-32768, 130, 141,-32768, 158,-32768, -32768, 58,-32768, -19,-32768, -15,-32768,-32768,-32768,-32768, -32768,-32768,-32768, 157,-32768, 164, 163, 20, 54, 64, -32768,-32768, -7,-32768, 131, 61,-32768,-32768,-32768, 130, -32768, 141,-32768, -19,-32768, 165, 160, 161, 166, 20, 130, 141,-32768, 163, 169, 170,-32768,-32768,-32768, 195, 196,-32768 }; static const short yypgoto[] = {-32768, -32768,-32768,-32768, 56,-32768, 87, -126,-32768,-32768, 9, -32768,-32768,-32768,-32768, -14,-32768,-32768,-32768, 111, 168, -32768,-32768,-32768, 93, 94,-32768,-32768, -43, -33,-32768, 150, -37, 153, -35, -38,-32768,-32768, -40, -44,-32768, 0,-32768, 171,-32768, 1 }; #define YYLAST 207 static const short yytable[] = { 34, 18, 22, 37, 27, 91, 89, 78, 28, 90, 21, 147, 96, 93, 93, 95, 95, 30, 49, 153, 50, 53, 51, 54, 154, 136, 26, 72, 104, 39, 121, 46, 103, 52, 122, 53, 26, 54, 167, 125, 38, 79, 84, 126, 53, 112, 54, 30, 55, 72, 98, 50, 40, 51, 26, 120, 41, 102, 130, 123, -42, 42, 120, 47, 73, 123, 53, 26, 54, 111, 23, 24, 78, 140, 78, 135, 139, 1, 149, 55, 1, 72, 141, 48, 150, 113, 143, 142, 151, 2, 3, 70, 2, 3, 152, 137, 85, 127, 53, 80, 54, 4, 86, 5, 4, 118, 51, 87, 158, 119, 157, -42, 155, 49, 101, 50, 159, 51, 166, 51, 128, 165, 119, 72, 148, 50, 144, 51, 88, 107, 53, 26, 54, 72, 105, 50, 106, 51, 131, 110, 53, 26, 54, 55, 108, 72, 164, 84, 134, 51, 53, 26, 54, 55, 72, 116, 50, 72, 51, 109, 72, 51, 53, 55, 54, 129, 115, 122, 35, 36, 53, 53, 26, 54, 53, 26, 54, 53, 117, 54, 53, 26, 124, 54, 55, 51, 145, 146, 1, 160, 161, 162, 163, 168, 169, 171, 172, 138, 114, 132, 133, 99, 156, 56, 100, 0, 0, 71 }; static const short yycheck[] = { 14, 0, 1, 17, 4, 49, 49, 40, 38, 49, 1, 137, 50, 50, 51, 50, 51, 27, 23, 26, 25, 40, 27, 42, 31, 35, 41, 23, 72, 20, 26, 30, 72, 38, 30, 40, 41, 42, 164, 26, 26, 40, 41, 30, 40, 85, 42, 27, 53, 23, 50, 25, 23, 27, 41, 92, 23, 71, 101, 94, 23, 38, 99, 32, 38, 100, 40, 41, 42, 83, 33, 34, 105, 117, 107, 108, 116, 25, 24, 53, 25, 23, 119, 32, 30, 85, 124, 122, 24, 37, 38, 38, 37, 38, 30, 109, 31, 97, 40, 38, 42, 49, 28, 51, 49, 26, 27, 30, 152, 30, 150, 23, 145, 23, 30, 25, 154, 27, 162, 27, 28, 161, 30, 23, 138, 25, 126, 27, 38, 30, 40, 41, 42, 23, 29, 25, 24, 27, 38, 30, 40, 41, 42, 53, 29, 23, 160, 146, 38, 27, 40, 41, 42, 53, 23, 30, 25, 23, 27, 24, 23, 27, 40, 53, 42, 28, 24, 30, 29, 30, 40, 40, 41, 42, 40, 41, 42, 40, 30, 42, 40, 41, 36, 42, 53, 27, 29, 23, 25, 24, 30, 30, 26, 24, 24, 0, 0, 110, 87, 105, 107, 51, 146, 35, 51, -1, -1, 36 }; /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ #line 3 "/usr/local/share/bison.simple" /* This file comes from bison-1.27. */ /* 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 #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 #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 */ #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 216 "/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 2: #line 202 "net.yacc" { return (0); ; break;} case 6: #line 217 "net.yacc" { ParseEndOfMacroDefinition(); ; break;} case 7: #line 223 "net.yacc" { ParseEndOfMacroDefinition(); ; break;} case 40: #line 317 "net.yacc" { ParseStringAttribute(yyvsp[-2].ast.s, yyvsp[0].ast.s); ; break;} case 41: #line 323 "net.yacc" { ParseIntAttribute(yyvsp[-2].ast.s, yyvsp[0].ast.i); ; break;} case 42: #line 333 "net.yacc" { ParseFunctionID(yyvsp[0].ast.s); ; break;} case 50: #line 356 "net.yacc" { ParseArgument(yyvsp[0].ast.s,0); ; break;} case 51: #line 360 "net.yacc" { ParseArgument(yyvsp[0].ast.s,1); ; break;} case 52: #line 370 "net.yacc" { ParseComment(yyvsp[0].ast.s); ; break;} case 93: #line 456 "net.yacc" { ParseLValue(yyvsp[0].ast.s); ; break;} case 94: #line 462 "net.yacc" { ParseRValue(yyvsp[0].ast.s); ; break;} case 95: #line 468 "net.yacc" { ; break;} } /* the action file gets copied in in place of this dollarsign */ #line 542 "/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 472 "net.yacc" #include "netlex.c"