/*************************************************************************** * RasMol 2.7.1 * * * * RasMol * * Molecular Graphics Visualisation Tool * * 22 June 1999 * * * * Based on RasMol 2.6 by Roger Sayle * * Biomolecular Structures Group, Glaxo Wellcome Research & Development, * * Stevenage, Hertfordshire, UK * * Version 2.6, August 1995, Version 2.6.4, December 1998 * * Copyright (C) Roger Sayle 1992-1999 * * * * and Based on Mods by Arne Mueller * * Version 2.6x1, May 1998 * * Copyright (C) Arne Mueller 1998 * * * * Version 2.7.0, 2.7.1 Mods by Herbert J. Bernstein * * Bernstein + Sons, P.O. Box 177, Bellport, NY, USA * * yaya@bernstein-plus-sons.com * * 2.7.0 March 1999, 2.7.1 June 1999 * * Copyright (C) Herbert J. Bernstein 1998-1999 * * * * Please read the file NOTICE for important notices which apply to this * * package. If you are not going to make changes to RasMol, you are not * * only permitted to freely make copies and distribute them, you are * * encouraged to do so, provided you do the following: * * * 1. Either include the complete documentation, especially the file * * NOTICE, with what you distribute or provide a clear indication * * where people can get a copy of the documentation; and * * * 2. Please give credit where credit is due citing the version and * * original authors properly; and * * * 3. Please do not give anyone the impression that the original * * authors are providing a warranty of any kind. * * * * If you would like to use major pieces of RasMol in some other program, * * make modifications to RasMol, or in some other way make what a lawyer * * would call a "derived work", you are not only permitted to do so, you * * are encouraged to do so. In addition to the things we discussed above, * * please do the following: * * * 4. Please explain in your documentation how what you did differs * * from this version of RasMol; and * * * 5. Please make your modified source code available. * * * * This version of RasMol is not in the public domain, but it is given * * freely to the community in the hopes of advancing science. If you make * * changes, please make them in a responsible manner, and please offer us * * the opportunity to include those changes in future versions of RasMol. * ***************************************************************************/ /********************************************************************** * A Bison parser, made from cbf.stx.y * * by GNU Bison version 1.25 * * * * Hand modified for RasMol coding conventions, and to avoid alloca * * calls. * * * * Original grammar for CBFlib 0.1 by Paul Ellis, Apr 98 * * Mods for CBFlib 0.2 by H. J. Bernstein, Aug 98 * * Mods for RasMol, H. J. Bernstein, * * yaya@bernstein-plus-sons.com, 2 Sep 98 * * * **********************************************************************/ /********************************************************************** * NOTICE * * Creative endeavors depend on the lively exchange of ideas. There * * are laws and customs which establish rights and responsibilities * * for authors and the users of what authors create. This notice * * is not intended to prevent you from using the software and * * documents in this package, but to ensure that there are no * * misunderstandings about terms and conditions of such use. * * * * Please read the following notice carefully. If you do not * * understand any portion of this notice, please seek appropriate * * professional legal advice before making use of the software and * * documents included in this software package. In addition to * * whatever other steps you may be obliged to take to respect the * * intellectual property rights of the various parties involved, if * * you do make use of the software and documents in this package, * * please give credit where credit is due by citing this package, * * its authors and the URL or other source from which you obtained * * it, or equivalent primary references in the literature with the * * same authors. * * * * Some of the software and documents included within this software * * package are the intellectual property of various parties, and * * placement in this package does not in any way imply that any * * such rights have in any way been waived or diminished. * * * * With respect to any software or documents for which a copyright * * exists, ALL RIGHTS ARE RESERVED TO THE OWNERS OF SUCH COPYRIGHT. * * * * Even though the authors of the various documents and software * * found here have made a good faith effort to ensure that the * * documents are correct and that the software performs according * * to its documentation, and we would greatly appreciate hearing of * * any problems you may encounter, the programs and documents any * * files created by the programs are provided **AS IS** without any * * warranty as to correctness, merchantability or fitness for any * * particular or general use. * * * * THE RESPONSIBILITY FOR ANY ADVERSE CONSEQUENCES FROM THE USE OF * * PROGRAMS OR DOCUMENTS OR ANY FILE OR FILES CREATED BY USE OF THE * * PROGRAMS OR DOCUMENTS LIES SOLELY WITH THE USERS OF THE PROGRAMS * * OR DOCUMENTS OR FILE OR FILES AND NOT WITH AUTHORS OF THE * * PROGRAMS OR DOCUMENTS. * **********************************************************************/ /********************************************************************** * The IUCr Policy * * on * * the Use of the Crystallographic Information File (CIF) * * * * The Crystallographic Information File (Hall, Allen & Brown, * * 1991) is, as of January 1992, the recommended method for * * submitting publications to Acta Crystallographica Section C. The * * International Union of Crystallography holds the Copyright on * * the CIF, and has applied for Patents on the STAR File syntax * * which is the basis for the CIF format. * * * * It is a principal objective of the IUCr to promote the use of * * CIF for the exchange and storage of scientific data. The IUCr's * * sponsorship of the CIF development was motivated by its * * responsibility to its scientific journals, which set the * * standards in crystallographic publishing. The IUCr intends that * * CIFs will be used increasingly for electronic submission of * * manuscripts to these journals in future. The IUCr recognises * * that, if the CIF and the STAR File are to be adopted as a means * * for universal data exchange, the syntax of these files must be * * strictly and uniformly adhered to. Even small deviations from * * the syntax would ultimately cause the demise of the universal * * file concept. Through its Copyrights and Patents the IUCr has * * taken the steps needed to ensure strict conformance with this * * syntax. * * * * The IUCr policy on the use of the CIF and STAR File processes is * * as follows: * * _________________________________________________________________ * * * * * 1 CIFs and STAR Files may be generated, stored or transmitted, * * without permission or charge, provided their purpose is not * * specifically for profit or commercial gain, and provided that * * the published syntax is strictly adhered to. * * * 2 Computer software may be developed for use with CIFs or STAR * * files, without permission or charge, provided it is distributed * * in the public domain. This condition also applies to software * * for which a charge is made, provided that its primary function * * is for use with files that satisfy condition 1 and that it is * * distributed as a minor component of a larger package of * * software. * * * 3 Permission will be granted for the use of CIFs and STAR Files * * for specific commercial purposes (such as databases or network * * exchange processes), and for the distribution of commercial * * CIF/STAR software, on written application to the IUCr Executive * * Secretary, 2 Abbey Square, Chester CH1 2HU, England. The * * nature, terms and duration of the licences granted will be * * determined by the IUCr Executive and Finance Committees. * * * * _________________________________________________________________ * * * * In summary, the IUCr wishes to promote the use of the STAR File * * concepts as a standard universal data file. It will insist on * * strict compliance with the published syntax for all * * applications. To assist with this compliance, the IUCr provides * * public domain software for checking the logical integrity of a * * CIF, and for validating the data name definitions contained * * within a CIF. Detailed information on this software, and the * * associated dictionaries, may be obtained from the IUCr Office at * * 5 Abbey Square, Chester CH1 2HU, England. * **********************************************************************/ #define YYBISON 1 /* Identify Bison output. */ #define DATA 258 #define LOOP 259 #define ITEM 260 #define CATEGORY 261 #define COLUMN 262 #define STRING 263 #define WORD 264 #define BINARY 265 #define UNKNOWN 266 #define COMMENT 267 #ifdef ERROR #undef ERROR #endif #define ERROR 268 #ifdef __cplusplus extern "C" { #endif #include #include #include #include "cif.h" #ifdef __GNUC__ #ifdef USEMALLOCH #include #endif #endif #ifdef IBMPC #include #include #endif #ifdef APPLEMAC #include #endif #ifndef sun386 #include #endif #define yyparse cif_parse #define yylex cif_lex_wrapper #define yyerror cif_syntax_error #define yyoverflow(msg,u,v,w,x,y) RasMolFatalExit(msg) #define YYLEX_PARAM context #define YYPARSE_PARAM context int cif_lex (void __far *, void __far *); int cif_lex_wrapper (void __far *val, void __far *context) { int token; do token = cif_lex (val, ((void __far * __far *) context) [0]); while (token == COMMENT); return token; } int cif_syntax_error ( char __far *message) { WriteString (message); WriteChar ('\n'); return 0; } #include #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 34 #define YYFLAG -32768 #define YYNTBASE 14 #define YYTRANSLATE(x) ((unsigned)(x) <= 268 ? yytranslate[x] : 31) static const char __far 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, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 }; #if YYDEBUG != 0 static const short __far yyprhs[] = { 0, 0, 2, 3, 5, 8, 10, 12, 14, 17, 20, 23, 26, 29, 32, 35, 38, 41, 44, 47, 50, 52, 54, 56, 58, 60, 62, 64 }; static const short __far yyrhs[] = { 17, 0, 0, 15, 0, 14, 26, 0, 16, 0, 20, 0, 24, 0, 17, 27, 0, 18, 28, 0, 17, 29, 0, 19, 30, 0, 17, 25, 0, 21, 27, 0, 23, 27, 0, 21, 29, 0, 23, 29, 0, 22, 28, 0, 23, 30, 0, 24, 30, 0, 4, 0, 3, 0, 6, 0, 7, 0, 5, 0, 8, 0, 9, 0, 10, 0 }; #endif #if YYDEBUG != 0 static const short __far yyrline[] = { 0, 92, 97, 102, 105, 110, 113, 116, 121, 126, 129, 136, 143, 150, 157, 168, 179, 192, 203, 210, 219, 222, 227, 232, 237, 242, 245, 248 }; #endif #if YYDEBUG != 0 || defined (YYERROR_VERBOSE) static const char __far * const yytname[] = { "$","error","$undefined.","DATA","LOOP", "ITEM","CATEGORY","COLUMN","STRING","WORD","BINARY","UNKNOWN","COMMENT","ERROR", "cbf","cbfstart","datablockstart","datablock","category","column","assignment", "loopstart","loopcategory","loopcolumn","loopassignment","loop","datablockname", "categoryname","columnname","itemname","value", NULL }; #endif static const short __far yyr1[] = { 0, 14, 15, 16, 16, 17, 17, 17, 18, 19, 19, 20, 21, 22, 22, 23, 23, 23, 24, 24, 25, 26, 27, 28, 29, 30, 30, 30 }; static const short __far yyr2[] = { 0, 1, 0, 1, 2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1 }; static const short __far yydefact[] = { 2, 0, 3, 5, 1, 0, 0, 6, 0, 0, 0, 7, 21, 4, 20, 24, 22, 12, 8, 10, 23, 9, 25, 26, 27, 11, 13, 15, 17, 14, 16, 18, 19, 0, 0 }; static const short __far yydefgoto[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 17, 13, 18, 21, 19, 25 }; static const short __far yypact[] = {-32768, 6,-32768,-32768, 7, 13, 8,-32768, 9, 13, -5, 8,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768, 2,-32768 }; static const short __far yypgoto[] = {-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768, 0, -2, 11, 12 }; #define YYLAST 23 static const short __far yytable[] = { 15, 16, 34, 22, 23, 24, 33, 28, 26, 12, 29, 14, 15, 16, 15, 16, 22, 23, 24, 27, 20, 30, 31, 32 }; static const short __far yycheck[] = { 5, 6, 0, 8, 9, 10, 0, 9, 8, 3, 10, 4, 5, 6, 5, 6, 8, 9, 10, 8, 7, 10, 10, 11 }; #define YYPURE 1 /*********************************************************************** * cif_PARSER.simple * * made from the _output_ of a bsion run against a grammar by * * Herbert J. Bernstein, yaya@bernstein-plus-sons.com, 10 August 1998 * * * * This file is used as a replacement for /usr/lib/bison.simple * * if it is necessary to rebuild cbf.stx.tab.c * * * * Under the terms of the "special exception", below, we may use * * the file from which this file was made "without restriction". * * We have made only one signficant change to the original file * * changing the __GNUC__ declaration of yyparse to be * * * * #ifdef YYPARSE_PARAM * * int yyparse (void *YYPARSE_PARAM); * * #else * * int yyparse (void); * * #endif * * * * and suppressed the "#line" declarations * * * * Please treat this file as being subject to the same conditions * * as the original bison.simple. However, inclusion of this file * * with other software purely for the purpose of providing a * * replacement for bison.simple does not bring that other software * * within the reach of the GNU General Public License. * ***********************************************************************/ /* 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 #else /* not sparc */ #if defined (MSDOS) && !defined (__TURBOC__) #include #else /* not MSDOS, or __TURBOC__ */ #if defined(_AIX) #include #pragma alloca #else /* not MSDOS, __TURBOC__, or _AIX */ #ifdef __hpux #ifdef __cplusplus extern "C" { void __far *alloca (unsigned int); }; #else /* not __cplusplus */ void __far *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__ #ifdef YYPARSE_PARAM int yyparse (void __far *YYPARSE_PARAM); #else int yyparse (void); #endif #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 __far *to; char __far *from; int count; { register char __far *f = from; register char __far *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 __far *to, char __far *from, int count) { register char __far *f = from; register char __far *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #endif #endif /* 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 __far yyssa[YYINITDEPTH]; /* the state stack */ YYSTYPE __far yyvsa[YYINITDEPTH]; /* the semantic value stack */ short __far *yyss = yyssa; /* refer to the stacks thru separate pointers */ YYSTYPE __far *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ #ifdef YYLSP_NEEDED YYLTYPE __far yylsa[YYINITDEPTH]; /* the location stack */ YYLTYPE __far *yyls = yylsa; YYLTYPE __far *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 __far *yyvs1 = yyvs; short __far *yyss1 = yyss; #ifdef YYLSP_NEEDED YYLTYPE __far *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 __far *) alloca (yystacksize * sizeof (*yyssp)); __yy_memcpy ((char __far *)yyss, (char *)yyss1, size * sizeof (*yyssp)); yyvs = (YYSTYPE __far *) alloca (yystacksize * sizeof (*yyvsp)); __yy_memcpy ((char __far *)yyvs, (char *)yyvs1, size * sizeof (*yyvsp)); #ifdef YYLSP_NEEDED yyls = (YYLTYPE __far *) alloca (yystacksize * sizeof (*yylsp)); __yy_memcpy ((char __far *)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 1: { cif_failnez (cif_find_parent (&(yyval.node), yyvsp[0].node, CIF_ROOT)) ; break;} case 2: { yyval.node = ((void **) context) [1]; ; break;} case 3: { cif_failnez (cif_make_child (&(yyval.node), yyvsp[0].node, CIF_DATABLOCK, NULL)) ; break;} case 4: { cif_failnez (cif_make_child (&(yyval.node), yyvsp[-1].node, CIF_DATABLOCK, yyvsp[0].text)) ; break;} case 5: { yyval.node = yyvsp[0].node; ; break;} case 6: { cif_failnez (cif_find_parent (&(yyval.node), yyvsp[0].node, CIF_DATABLOCK)) ; break;} case 7: { cif_failnez (cif_find_parent (&(yyval.node), yyvsp[0].node, CIF_DATABLOCK)) ; break;} case 8: { cif_failnez (cif_make_child (&(yyval.node), yyvsp[-1].node, CIF_CATEGORY, yyvsp[0].text)) ; break;} case 9: { cif_failnez (cif_make_child (&(yyval.node), yyvsp[-1].node, CIF_COLUMN, yyvsp[0].text)) ; break;} case 10: { cif_failnez (cif_make_new_child (&(yyval.node), yyvsp[-1].node, CIF_CATEGORY, NULL)) cif_failnez (cif_make_child (&(yyval.node), yyval.node, CIF_COLUMN, yyvsp[0].text)) ; break;} case 11: { yyval.node = yyvsp[-1].node; cif_failnez (cif_set_columnrow (yyval.node, 0, yyvsp[0].text)) ; break;} case 12: { cif_failnez (cif_make_node (&(yyval.node), CIF_LINK, NULL)) cif_failnez (cif_set_link (yyval.node, yyvsp[-1].node)) ; break;} case 13: { cif_failnez (cif_make_child (&(yyval.node), yyvsp[-1].node, CIF_CATEGORY, yyvsp[0].text)) cif_failnez (cif_set_link (yyvsp[-1].node, yyval.node)) yyval.node = yyvsp[-1].node; ; break;} case 14: { cif_failnez (cif_find_parent (&(yyval.node), yyvsp[-1].node, CIF_DATABLOCK)) cif_failnez (cif_make_child (&(yyval.node), yyval.node, CIF_CATEGORY, yyvsp[0].text)) cif_failnez (cif_set_link (yyvsp[-1].node, yyval.node)) yyval.node = yyvsp[-1].node; ; break;} case 15: { cif_failnez (cif_make_new_child (&(yyval.node), yyvsp[-1].node, CIF_CATEGORY, NULL)) cif_failnez (cif_make_child (&(yyval.node), yyval.node, CIF_COLUMN, yyvsp[0].text)) cif_failnez (cif_set_link (yyvsp[-1].node, yyval.node)) cif_failnez (cif_add_link (yyvsp[-1].node, yyval.node)) yyval.node = yyvsp[-1].node; ; break;} case 16: { cif_failnez (cif_find_parent (&(yyval.node), yyvsp[-1].node, CIF_DATABLOCK)) cif_failnez (cif_make_child (&(yyval.node), yyval.node, CIF_CATEGORY, NULL)) cif_failnez (cif_make_child (&(yyval.node), yyval.node, CIF_COLUMN, yyvsp[0].text)) cif_failnez (cif_set_link (yyvsp[-1].node, yyval.node)) cif_failnez (cif_add_link (yyvsp[-1].node, yyval.node)) yyval.node = yyvsp[-1].node; ; break;} case 17: { cif_failnez (cif_make_child (&(yyval.node), yyvsp[-1].node, CIF_COLUMN, yyvsp[0].text)) cif_failnez (cif_set_link (yyvsp[-1].node, yyval.node)) cif_failnez (cif_add_link (yyvsp[-1].node, yyval.node)) yyval.node = yyvsp[-1].node; ; break;} case 18: { yyval.node = yyvsp[-1].node; cif_failnez (cif_shift_link (yyval.node)) cif_failnez (cif_add_columnrow (yyval.node, yyvsp[0].text)) ; break;} case 19: { yyval.node = yyvsp[-1].node; cif_failnez (cif_shift_link (yyval.node)) cif_failnez (cif_add_columnrow (yyval.node, yyvsp[0].text)) ; break;} case 21: { yyval.text = yyvsp[0].text; ; break;} case 22: { yyval.text = yyvsp[0].text; ; break;} case 23: { yyval.text = yyvsp[0].text; ; break;} case 24: { yyval.text = yyvsp[0].text; ; break;} case 25: { yyval.text = yyvsp[0].text; ; break;} case 26: { yyval.text = yyvsp[0].text; ; break;} case 27: { yyval.text = yyvsp[0].text; ; break;} } /* the action file gets copied in in place of this dollarsign */ yyvsp -= yylen; yyssp -= yylen; #ifdef YYLSP_NEEDED yylsp -= yylen; #endif #if YYDEBUG != 0 if (yydebug) { short __far *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 __far *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 *) _fmalloc(size + 15); if (msg != 0) { RegisterAlloc( msg ); 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); FreeAlloc(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 __far *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; } #ifdef __cplusplus } #endif