OOPSE-1.0/libBASS/BASSyacc.c


/*  A Bison parser, made from BASSyacc.y
 by  GNU Bison version 1.25
  */

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

#define MOLECULE        258
#define ATOM    259
#define BOND    260
#define BEND    261
#define TORSION 262
#define POSITION        263
#define MEMBERS 264
#define CONSTRAINT      265
#define COMPONENT       266
#define START_INDEX     267
#define DEFINED 268
#define ORIENTATION     269
#define ZCONSTRAINT     270
#define RIGIDBODY       271
#define CUTOFFGROUP     272
#define INTEGER 273
#define ARRAY_INDEX     274
#define DOUBLE  275
#define IDENTIFIER      276
#define QUOTED_STRING   277
#define LIST_STRING     278


#line 10 "BASSyacc.y"
typedef union {
  int i_val;                 /* integer value */
  double d_val;              /* double value  */
  char * s_ptr;              /* string pointer */
  struct node_tag* node_ptr; /* pointer to the statement node tree */
} YYSTYPE;
#line 45 "BASSyacc.y"

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

#include "node_list.h"
#include "make_nodes.h"
#include "parse_tree.h"
#include "simError.h"
#ifdef IS_MPI
#define __is_lex__
#include "mpiBASS.h"
#endif

extern int yylineno;

struct filename_list{
  char my_name[300];
  struct filename_list* next;
};
extern struct filename_list* yyfile_name;

extern void change_in_file( FILE* in_file );
extern void yacc_model( char* file_name );
extern void kill_lists(void);

/* top of the node list */

struct node_tag* head_node;
struct node_tag* current_node;

#include <stdio.h>

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


#define YYFINAL         87
#define YYFLAG          -32768
#define YYNTBASE        28

#define YYTRANSLATE(x) ((unsigned)(x) <= 278 ? yytranslate[x] : 47)

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,    25,     2,
    24,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,    26,     2,    27,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     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,     7,     8,     9,    10,    11,    12,    13,    14,    15,
    16,    17,    18,    19,    20,    21,    22,    23
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     2,     3,     6,     8,    10,    12,    14,    16,    18,
    23,    28,    33,    38,    42,    46,    50,    54,    56,    58,
    60,    62,    64,    66,    68,    70,    72,    77,    83,    89,
    95,   101,   107,   113,   119,   124,   126
};

static const short yyrhs[] = {    29,
     0,     0,    29,    30,     0,    31,     0,    32,     0,    33,
     0,    34,     0,    35,     0,    36,     0,    21,    24,    18,
    25,     0,    21,    24,    20,    25,     0,    21,    24,    21,
    25,     0,    21,    24,    22,    25,     0,     9,    23,    25,
     0,    10,    23,    25,     0,    14,    23,    25,     0,     8,
    23,    25,     0,    37,     0,    38,     0,    39,     0,    40,
     0,    41,     0,    42,     0,    43,     0,    44,     0,    45,
     0,     3,    26,    46,    27,     0,     4,    19,    26,    46,
    27,     0,     5,    19,    26,    46,    27,     0,     6,    19,
    26,    46,    27,     0,     7,    19,    26,    46,    27,     0,
    15,    19,    26,    46,    27,     0,    16,    19,    26,    46,
    27,     0,    17,    19,    26,    46,    27,     0,    11,    26,
    46,    27,     0,    30,     0,    46,    30,     0
};

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
    80,    84,    85,    92,    94,    95,    96,    97,    98,   101,
   104,   106,   108,   112,   117,   122,   127,   132,   134,   135,
   136,   137,   138,   139,   140,   141,   144,   149,   154,   159,
   164,   169,   174,   179,   184,   189,   191
};
#endif


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

static const char * const yytname[] = {   "$","error","$undefined.","MOLECULE",
"ATOM","BOND","BEND","TORSION","POSITION","MEMBERS","CONSTRAINT","COMPONENT",
"START_INDEX","DEFINED","ORIENTATION","ZCONSTRAINT","RIGIDBODY","CUTOFFGROUP",
"INTEGER","ARRAY_INDEX","DOUBLE","IDENTIFIER","QUOTED_STRING","LIST_STRING",
"'='","';'","'{'","'}'","program","commands","stmt","assignment","members","constraint",
"orientation","position","block","molecule_block","atom_block","bond_block",
"bend_block","torsion_block","zconstraint_block","rigidbody_block","cutoffgroup_block",
"component_block","stmt_list", NULL
};
#endif

static const short yyr1[] = {     0,
    28,    29,    29,    30,    30,    30,    30,    30,    30,    31,
    31,    31,    31,    32,    33,    34,    35,    36,    36,    36,
    36,    36,    36,    36,    36,    36,    37,    38,    39,    40,
    41,    42,    43,    44,    45,    46,    46
};

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

static const short yydefact[] = {     2,
     1,     0,     0,     0,     0,     0,     0,     0,     0,     0,
     0,     0,     0,     0,     0,     3,     4,     5,     6,     7,
     8,     9,    18,    19,    20,    21,    22,    23,    24,    25,
    26,     0,     0,     0,     0,     0,     0,     0,     0,     0,
     0,     0,     0,     0,     0,    36,     0,     0,     0,     0,
     0,    17,    14,    15,     0,    16,     0,     0,     0,     0,
     0,     0,     0,    27,    37,     0,     0,     0,     0,    35,
     0,     0,     0,    10,    11,    12,    13,    28,    29,    30,
    31,    32,    33,    34,     0,     0,     0
};

static const short yydefgoto[] = {    85,
     1,    46,    17,    18,    19,    20,    21,    22,    23,    24,
    25,    26,    27,    28,    29,    30,    31,    47
};

static const short yypact[] = {-32768,
   257,   -16,    -8,    -3,     4,     5,    -6,    12,    13,    15,
    19,    24,    26,    28,    25,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,   257,    22,    27,    29,    30,    32,    33,    34,   257,
    35,    36,    37,    38,     0,-32768,    -2,   257,   257,   257,
   257,-32768,-32768,-32768,    23,-32768,   257,   257,   257,    44,
    57,    58,    63,-32768,-32768,    70,    95,   120,   145,-32768,
   170,   195,   220,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,    51,    52,-32768
};

static const short yypgoto[] = {-32768,
-32768,    -1,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,   200
};


#define YYLAST          278


static const short yytable[] = {    16,
     2,     3,     4,     5,     6,     7,     8,     9,    10,    32,
    33,    11,    12,    13,    14,    34,    37,    60,    15,    61,
    62,    63,    35,    36,    64,     2,     3,     4,     5,     6,
     7,     8,     9,    10,    38,    39,    11,    12,    13,    14,
    40,    41,    42,    15,    43,    65,    44,    48,    45,    70,
    86,    87,    49,    65,    50,    51,    52,    53,    54,    56,
     0,    57,    58,    59,    65,    65,    65,    65,    74,    65,
    65,    65,     2,     3,     4,     5,     6,     7,     8,     9,
    10,    75,    76,    11,    12,    13,    14,    77,     0,     0,
    15,     0,     0,     0,     0,     0,    78,     2,     3,     4,
     5,     6,     7,     8,     9,    10,     0,     0,    11,    12,
    13,    14,     0,     0,     0,    15,     0,     0,     0,     0,
     0,    79,     2,     3,     4,     5,     6,     7,     8,     9,
    10,     0,     0,    11,    12,    13,    14,     0,     0,     0,
    15,     0,     0,     0,     0,     0,    80,     2,     3,     4,
     5,     6,     7,     8,     9,    10,     0,     0,    11,    12,
    13,    14,     0,     0,     0,    15,     0,     0,     0,     0,
     0,    81,     2,     3,     4,     5,     6,     7,     8,     9,
    10,     0,     0,    11,    12,    13,    14,     0,     0,     0,
    15,     0,     0,     0,     0,     0,    82,     2,     3,     4,
     5,     6,     7,     8,     9,    10,     0,     0,    11,    12,
    13,    14,     0,     0,     0,    15,     0,     0,     0,     0,
     0,    83,     2,     3,     4,     5,     6,     7,     8,     9,
    10,     0,     0,    11,    12,    13,    14,     0,     0,    55,
    15,     0,     0,     0,     0,     0,    84,    66,    67,    68,
    69,     0,     0,     0,     0,     0,    71,    72,    73,     2,
     3,     4,     5,     6,     7,     8,     9,    10,     0,     0,
    11,    12,    13,    14,     0,     0,     0,    15
};

static const short yycheck[] = {     1,
     3,     4,     5,     6,     7,     8,     9,    10,    11,    26,
    19,    14,    15,    16,    17,    19,    23,    18,    21,    20,
    21,    22,    19,    19,    27,     3,     4,     5,     6,     7,
     8,     9,    10,    11,    23,    23,    14,    15,    16,    17,
    26,    23,    19,    21,    19,    47,    19,    26,    24,    27,
     0,     0,    26,    55,    26,    26,    25,    25,    25,    25,
    -1,    26,    26,    26,    66,    67,    68,    69,    25,    71,
    72,    73,     3,     4,     5,     6,     7,     8,     9,    10,
    11,    25,    25,    14,    15,    16,    17,    25,    -1,    -1,
    21,    -1,    -1,    -1,    -1,    -1,    27,     3,     4,     5,
     6,     7,     8,     9,    10,    11,    -1,    -1,    14,    15,
    16,    17,    -1,    -1,    -1,    21,    -1,    -1,    -1,    -1,
    -1,    27,     3,     4,     5,     6,     7,     8,     9,    10,
    11,    -1,    -1,    14,    15,    16,    17,    -1,    -1,    -1,
    21,    -1,    -1,    -1,    -1,    -1,    27,     3,     4,     5,
     6,     7,     8,     9,    10,    11,    -1,    -1,    14,    15,
    16,    17,    -1,    -1,    -1,    21,    -1,    -1,    -1,    -1,
    -1,    27,     3,     4,     5,     6,     7,     8,     9,    10,
    11,    -1,    -1,    14,    15,    16,    17,    -1,    -1,    -1,
    21,    -1,    -1,    -1,    -1,    -1,    27,     3,     4,     5,
     6,     7,     8,     9,    10,    11,    -1,    -1,    14,    15,
    16,    17,    -1,    -1,    -1,    21,    -1,    -1,    -1,    -1,
    -1,    27,     3,     4,     5,     6,     7,     8,     9,    10,
    11,    -1,    -1,    14,    15,    16,    17,    -1,    -1,    40,
    21,    -1,    -1,    -1,    -1,    -1,    27,    48,    49,    50,
    51,    -1,    -1,    -1,    -1,    -1,    57,    58,    59,     3,
     4,     5,     6,     7,     8,     9,    10,    11,    -1,    -1,
    14,    15,    16,    17,    -1,    -1,    -1,    21
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "bison.simple"

/* 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., 675 Mass Ave, Cambridge, MA 02139, 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.  */

#ifndef alloca
#ifdef __GNUC__
#define alloca __builtin_alloca
#else /* not GNU C.  */
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi)
#include <alloca.h>
#else /* not sparc */
#if defined (MSDOS) && !defined (__TURBOC__)
#include <malloc.h>
#else /* not MSDOS, or __TURBOC__ */
#if defined(_AIX)
#include <malloc.h>
 #pragma alloca
#else /* not MSDOS, __TURBOC__, or _AIX */
#ifdef __hpux
#ifdef __cplusplus
extern "C" {
void *alloca (unsigned int);
};
#else /* not __cplusplus */
void *alloca ();
#endif /* not __cplusplus */
#endif /* __hpux */
#endif /* not _AIX */
#endif /* not MSDOS, or __TURBOC__ */
#endif /* not sparc.  */
#endif /* not GNU C.  */
#endif /* alloca not defined.  */

/* 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.  */

/* 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        return(0)
#define YYABORT         return(1)
#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

/* Prevent warning if -Wstrict-prototypes.  */
#ifdef __GNUC__
int yyparse (void);
#endif

#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;
     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, int count)
{
  register char *f = from;
  register char *t = to;
  register int i = count;

  while (i-- > 0)
    *t++ = *f++;
}

#endif
#endif

#line 196 "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 */

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;

#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");
          return 2;
        }
      yystacksize *= 2;
      if (yystacksize > YYMAXDEPTH)
        yystacksize = YYMAXDEPTH;
      yyss = (short *) alloca (yystacksize * sizeof (*yyssp));
      __yy_memcpy ((char *)yyss, (char *)yyss1, size * sizeof (*yyssp));
      yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
      __yy_memcpy ((char *)yyvs, (char *)yyvs1, size * sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
      yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
      __yy_memcpy ((char *)yyls, (char *)yyls1, size * 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 3:
#line 85 "BASSyacc.y"
{ 
                                  current_node->next_stmt = yyvsp[0].node_ptr;
                                  yyvsp[0].node_ptr->prev_stmt = current_node;
                                  current_node = yyvsp[0].node_ptr;
                                ;
    break;}
case 4:
#line 93 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 5:
#line 94 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 6:
#line 95 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 7:
#line 96 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 8:
#line 97 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 9:
#line 98 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 10:
#line 103 "BASSyacc.y"
{ yyval.node_ptr = assign_i( yyvsp[-3].s_ptr, yyvsp[-1].i_val ); ;
    break;}
case 11:
#line 105 "BASSyacc.y"
{ yyval.node_ptr = assign_d( yyvsp[-3].s_ptr, yyvsp[-1].d_val ); ;
    break;}
case 12:
#line 107 "BASSyacc.y"
{ yyval.node_ptr = assign_s( yyvsp[-3].s_ptr, yyvsp[-1].s_ptr ); ;
    break;}
case 13:
#line 109 "BASSyacc.y"
{ yyval.node_ptr = assign_s( yyvsp[-3].s_ptr, yyvsp[-1].s_ptr ); ;
    break;}
case 14:
#line 114 "BASSyacc.y"
{ yyval.node_ptr = members( yyvsp[-1].s_ptr ); ;
    break;}
case 15:
#line 119 "BASSyacc.y"
{ yyval.node_ptr = constraint( yyvsp[-1].s_ptr ); ;
    break;}
case 16:
#line 124 "BASSyacc.y"
{ yyval.node_ptr = orientation( yyvsp[-1].s_ptr ); ;
    break;}
case 17:
#line 129 "BASSyacc.y"
{ yyval.node_ptr = position( yyvsp[-1].s_ptr ); ;
    break;}
case 18:
#line 133 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 19:
#line 134 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 20:
#line 135 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 21:
#line 136 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 22:
#line 137 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 23:
#line 138 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 24:
#line 139 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 25:
#line 140 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 26:
#line 141 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 27:
#line 146 "BASSyacc.y"
{ yyval.node_ptr = molecule_blk( yyvsp[-1].node_ptr ); ;
    break;}
case 28:
#line 151 "BASSyacc.y"
{ yyval.node_ptr = atom_blk( yyvsp[-3].i_val, yyvsp[-1].node_ptr ); ;
    break;}
case 29:
#line 156 "BASSyacc.y"
{ yyval.node_ptr = bond_blk( yyvsp[-3].i_val, yyvsp[-1].node_ptr ); ;
    break;}
case 30:
#line 161 "BASSyacc.y"
{ yyval.node_ptr = bend_blk( yyvsp[-3].i_val, yyvsp[-1].node_ptr ); ;
    break;}
case 31:
#line 166 "BASSyacc.y"
{ yyval.node_ptr = torsion_blk( yyvsp[-3].i_val, yyvsp[-1].node_ptr ); ;
    break;}
case 32:
#line 171 "BASSyacc.y"
{ yyval.node_ptr = zconstraint_blk( yyvsp[-3].i_val, yyvsp[-1].node_ptr ); ;
    break;}
case 33:
#line 176 "BASSyacc.y"
{ yyval.node_ptr = rigidbody_blk( yyvsp[-3].i_val, yyvsp[-1].node_ptr ); ;
    break;}
case 34:
#line 181 "BASSyacc.y"
{ yyval.node_ptr = cutoffgroup_blk( yyvsp[-3].i_val, yyvsp[-1].node_ptr ); ;
    break;}
case 35:
#line 186 "BASSyacc.y"
{ yyval.node_ptr = component_blk( yyvsp[-1].node_ptr ); ;
    break;}
case 36:
#line 190 "BASSyacc.y"
{ yyval.node_ptr = yyvsp[0].node_ptr; ;
    break;}
case 37:
#line 191 "BASSyacc.y"
{ 
                                  yyvsp[-1].node_ptr->next_stmt = yyvsp[0].node_ptr;
                                  yyvsp[0].node_ptr->prev_stmt = yyvsp[-1].node_ptr;
                                  yyval.node_ptr = yyvsp[0].node_ptr;
                                ;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 498 "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;
}
#line 198 "BASSyacc.y"


extern int yyerror( char *err_msg ){

  sprintf( painCave.errMsg, "OOPSE parse error in %s at line %d: %s\n", 
           yyfile_name->my_name, yylineno + 1, err_msg );
  painCave.isFatal = 1;
  simError();
  return 0;
}

void yacc_BASS( char* file_name ){

  FILE* in_file;

  head_node = (struct node_tag* )malloc( sizeof( node ) );

  head_node->type = GLOBAL_HEAD;
  head_node->index =0;
  head_node->next_stmt = NULL;
  head_node->prev_stmt = NULL;
  head_node->stmt_list = NULL;

  current_node = head_node;

  in_file = fopen( file_name, "r" );
  if( in_file == NULL ){
    sprintf( painCave.errMsg, "yacc error: couldn't open file =>%s\n", 
             file_name );
    painCave.isFatal = 1;
    simError();
  }

  yyfile_name = 
    (struct filename_list*)malloc( sizeof( struct filename_list ) );
  yyfile_name->next = NULL;
  strcpy( yyfile_name->my_name, file_name );
  change_in_file( in_file );
  
  yyparse();
  
#ifdef IS_MPI
  strcpy( checkPointMsg, "yyParse successful." );
  MPIcheckPoint();
  painCave.isEventLoop = 1;
#endif // is_mpi
  
  fclose( in_file );
  kill_lists();
  
  pt_me( head_node );

#ifdef IS_MPI
  painCave.isEventLoop = 0;
#endif // is_mpi
  
  kill_tree( head_node );
  head_node = NULL;
}
Revision:	1348
Committed:	Mon Jul 19 16:47:57 2004 UTC (20 years ago) by gezelter
Content type:	text/plain
File size:	34450 byte(s)
Log Message:	* empty log message *