Logo Search packages:      
Sourcecode: wims version File versions  Download package

chemparser.cc

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

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

#define     Atome 257
#define     SpcPlus     258
#define     Plus  259
#define     Moins 260
#define     Fleche      261
#define     Int   262
#define     Charge      263
#define     Frac  264
#define     Real  265
#define     SpcLpar     266
#define     Lpar  267
#define     Rpar  268
#define     Lsq   269
#define     Rsq   270
#define     Haut  271
#define     Spc   272
#define     Sol   273
#define     Gas   274
#define     Aqueous     275
#define     Egal  276

#line 1 "chemeq.y"

/* inclusions, définition */
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <unistd.h>
#include <math.h>
#include "chemeq.h"

  int yylex();
  int yyerror(char * msg);

00041 typedef struct{
  int i, d; /* integer numerator, denominator */
  double r;
  AtomeListe * al;
  Molec * m;
  Chemeq * cq;
  Membre * mb;
  char symb[4];
  moltype t;
  string s;
} yystype;

#define YYSTYPE yystype 

/* variables globales */

 yystype result;
 extern char * yytext;
 extern int position;
 int isequation;

#ifndef YYSTYPE
#define YYSTYPE int
#endif
#include <stdio.h>

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



#define     YYFINAL           76
#define     YYFLAG            -32768
#define     YYNTBASE    23

#define YYTRANSLATE(x) ((unsigned)(x) <= 276 ? yytranslate[x] : 41)

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
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     3,     5,     6,    10,    14,    22,    24,    26,    30,
    34,    38,    42,    43,    46,    48,    54,    59,    61,    65,
    69,    71,    72,    74,    77,    81,    83,    89,    90,    92,
    94,    96,    98,   101,   104,   106,   109,   113,   115,   117,
   121,   124,   125
};

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

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
    60,    66,    72,    73,    76,    77,    80,    81,    82,    83,
    84,    85,    88,    89,    92,    95,   100,   103,   109,   113,
   117,   122,   123,   126,   129,   135,   136,   139,   140,   141,
   142,   145,   146,   147,   148,   149,   152,   157,   160,   170,
   175,   181,   184
};
#endif


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

static const char * const yytname[] = {   "$","error","$undefined.","Atome",
"SpcPlus","Plus","Moins","Fleche","Int","Charge","Frac","Real","SpcLpar","Lpar",
"Rpar","Lsq","Rsq","Haut","Spc","Sol","Gas","Aqueous","Egal","but","cste","cste1",
"nombre","volt","id","chemeq","membre","molecs","spc01","molec","composition0",
"typage","charge","groupe","atome_general","composition","molecularite", NULL
};
#endif

static const short yyr1[] = {     0,
    23,    23,    24,    24,    25,    25,    26,    26,    26,    26,
    26,    26,    27,    27,    28,    29,    30,    30,    31,    31,
    31,    32,    32,    33,    33,    34,    34,    35,    35,    35,
    35,    36,    36,    36,    36,    36,    37,    38,    38,    39,
    39,    40,    40
};

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

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

static const short yydefgoto[] = {    74,
    20,    37,    53,    61,    54,     6,     7,     8,    62,    56,
    10,    29,    30,    11,    12,    13,    32
};

static const short yypact[] = {    27,
-32768,   -12,   -12,    33,   -12,    -5,    11,-32768,    14,     3,
-32768,    20,-32768,-32768,    18,    18,    -3,    33,   -12,-32768,
   -12,    32,-32768,-32768,    56,-32768,-32768,-32768,-32768,    24,
-32768,    33,-32768,-32768,-32768,   -12,    35,    48,    27,   -12,
-32768,-32768,-32768,-32768,-32768,    25,-32768,-32768,   -12,   -12,
-32768,-32768,     9,   -12,-32768,-32768,    27,-32768,    -6,     5,
-32768,    47,    42,    51,-32768,-32768,-32768,-32768,-32768,   -12,
    52,     9,-32768,    66,    67,-32768
};

static const short yypgoto[] = {-32768,
-32768,-32768,    -1,     1,-32768,-32768,    12,    36,    -2,    10,
-32768,    41,-32768,-32768,-32768,     0,-32768
};


#define     YYLAST            75


static const short yytable[] = {    15,
    16,    65,    18,    17,    66,    14,    19,    23,    24,     9,
    35,   -22,    67,    -2,    21,    68,    38,    36,    39,    25,
     1,    26,    27,    28,    33,    34,    14,    31,    22,     1,
     4,    45,     5,    46,     2,     1,     3,    57,    40,     4,
    58,     5,    26,    27,    28,     4,    59,    60,    47,    69,
    48,    63,    49,    50,    21,    51,    49,    50,    52,    51,
    41,    42,    52,    70,    43,    75,    76,    71,    64,    72,
    44,     0,    73,     0,    55
};

static const short yycheck[] = {     2,
     3,     8,     5,     4,    11,    18,    12,     5,     6,     0,
    14,     3,     8,     0,     4,    11,    19,    18,    21,    17,
     3,    19,    20,    21,    15,    16,    18,     8,    18,     3,
    13,    32,    15,    36,     8,     3,    10,    40,     7,    13,
    16,    15,    19,    20,    21,    13,    49,    50,    14,     3,
     3,    54,     5,     6,     4,     8,     5,     6,    11,     8,
     5,     6,    11,    22,     9,     0,     0,    70,    57,    71,
    30,    -1,    72,    -1,    39
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/lib/bison.simple"
/* This file comes from bison-1.28.  */

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

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

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

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

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

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

#ifndef YYSTACK_USE_ALLOCA
#ifdef alloca
#define YYSTACK_USE_ALLOCA
#else /* alloca not defined */
#ifdef __GNUC__
#define YYSTACK_USE_ALLOCA
#define alloca __builtin_alloca
#else /* not GNU C.  */
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))
#define YYSTACK_USE_ALLOCA
#include <alloca.h>
#else /* not sparc */
/* We think this test detects Watcom and Microsoft C.  */
/* This used to test MSDOS, but that is a bad idea
   since that symbol is in the user namespace.  */
#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
#if 0 /* No need for malloc.h, which pollutes the namespace;
       instead, just don't use alloca.  */
#include <malloc.h>
#endif
#else /* not MSDOS, or __TURBOC__ */
#if defined(_AIX)
/* I don't know what this was needed for, but it pollutes the namespace.
   So I turned it off.   rms, 2 May 1997.  */
/* #include <malloc.h>  */
 #pragma alloca
#define YYSTACK_USE_ALLOCA
#else /* not MSDOS, or __TURBOC__, or _AIX */
#if 0
#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up,
             and on HPUX 10.  Eventually we can turn this on.  */
#define YYSTACK_USE_ALLOCA
#define alloca __builtin_alloca
#endif /* __hpux */
#endif
#endif /* not _AIX */
#endif /* not MSDOS, or __TURBOC__ */
#endif /* not sparc */
#endif /* not GNU C */
#endif /* alloca not defined */
#endif /* YYSTACK_USE_ALLOCA not defined */

#ifdef YYSTACK_USE_ALLOCA
#define YYSTACK_ALLOC alloca
#else
#define YYSTACK_ALLOC malloc
#endif

/* Note: there must be only one dollar sign in this file.
   It is replaced by the list of actions, each action
   as one case of the switch.  */

#define yyerrok         (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY         -2
#define YYEOF           0
#define YYACCEPT  goto yyacceptlab
#define YYABORT   goto yyabortlab
#define YYERROR         goto yyerrlab1
/* Like YYERROR except do call yyerror.
   This remains here temporarily to ease the
   transition to the new meaning of YYERROR, for GCC.
   Once GCC version 2 has supplanted version 1, this can go.  */
#define YYFAIL          goto yyerrlab
#define YYRECOVERING()  (!!yyerrstatus)
#define YYBACKUP(token, value) \
do                                              \
  if (yychar == YYEMPTY && yylen == 1)                      \
    { yychar = (token), yylval = (value);             \
      yychar1 = YYTRANSLATE (yychar);                       \
      YYPOPSTACK;                               \
      goto yybackup;                                  \
    }                                           \
  else                                                \
    { yyerror ("syntax error: cannot back up"); YYERROR; }  \
while (0)

#define YYTERROR  1
#define YYERRCODE 256

#ifndef YYPURE
#define YYLEX           yylex()
#endif

#ifdef YYPURE
#ifdef YYLSP_NEEDED
#ifdef YYLEX_PARAM
#define YYLEX           yylex(&yylval, &yylloc, YYLEX_PARAM)
#else
#define YYLEX           yylex(&yylval, &yylloc)
#endif
#else /* not YYLSP_NEEDED */
#ifdef YYLEX_PARAM
#define YYLEX           yylex(&yylval, YYLEX_PARAM)
#else
#define YYLEX           yylex(&yylval)
#endif
#endif /* not YYLSP_NEEDED */
#endif

/* If nonreentrant, generate the variables here */

#ifndef YYPURE

int   yychar;                 /*  the lookahead symbol            */
YYSTYPE     yylval;                 /*  the semantic value of the       */
                        /*  lookahead symbol                */

#ifdef YYLSP_NEEDED
YYLTYPE yylloc;               /*  location data for the lookahead */
                        /*  symbol                    */
#endif

int yynerrs;                  /*  number of parse errors so far       */
#endif  /* not YYPURE */

#if YYDEBUG != 0
int yydebug;                  /*  nonzero means print parse trace */
/* Since this is uninitialized, it does not stop multiple parsers
   from coexisting.  */
#endif

/*  YYINITDEPTH indicates the initial size of the parser's stacks */

#ifndef     YYINITDEPTH
#define YYINITDEPTH 200
#endif

/*  YYMAXDEPTH is the maximum size the stacks can grow to
    (effective only if the built-in stack extension method is used).  */

#if YYMAXDEPTH == 0
#undef YYMAXDEPTH
#endif

#ifndef YYMAXDEPTH
#define YYMAXDEPTH 10000
#endif

/* Define __yy_memcpy.  Note that the size argument
   should be passed with type unsigned int, because that is what the non-GCC
   definitions require.  With GCC, __builtin_memcpy takes an arg
   of type size_t, but it can handle unsigned int.  */

#if __GNUC__ > 1        /* GNU C and GNU C++ define this.  */
#define __yy_memcpy(TO,FROM,COUNT)  __builtin_memcpy(TO,FROM,COUNT)
#else                   /* not GNU C or C++ */
#ifndef __cplusplus

/* This is the most reliable way to avoid incompatibilities
   in available built-in functions on various systems.  */
static void
__yy_memcpy (to, from, count)
     char *to;
     char *from;
     unsigned int count;
{
  register char *f = from;
  register char *t = to;
  register int i = count;

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

#else /* __cplusplus */

/* This is the most reliable way to avoid incompatibilities
   in available built-in functions on various systems.  */
static void
__yy_memcpy (char *to, char *from, unsigned int count)
{
  register char *t = to;
  register char *f = from;
  register int i = count;

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

#endif
#endif

#line 217 "/usr/lib/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 1:
#line 60 "chemeq.y"
{
  result=yyvsp[-1];
  result.cq->constante(yyvsp[0].s);
  result.cq->valeur(yyvsp[0].r);
  isequation=1;
;
    break;}
case 2:
#line 66 "chemeq.y"
{
  result=yyvsp[0];
  isequation=0;
;
    break;}
case 3:
#line 72 "chemeq.y"
{yyval.s = ""; yyval.r = -1.0; /* valeur négative : non défini */;
    break;}
case 4:
#line 73 "chemeq.y"
{yyval = yyvsp[-1];;
    break;}
case 5:
#line 76 "chemeq.y"
{yyval.s = ""; yyval.r = yyvsp[-1].r;;
    break;}
case 6:
#line 77 "chemeq.y"
{yyval.s = yyvsp[-5].s; yyval.r = yyvsp[-1].r;;
    break;}
case 7:
#line 80 "chemeq.y"
{yyval.r=yyvsp[0].r;;
    break;}
case 8:
#line 81 "chemeq.y"
{yyval.r=1.0*yyvsp[0].i;;
    break;}
case 9:
#line 82 "chemeq.y"
{yyval.r=yyvsp[0].r;;
    break;}
case 10:
#line 83 "chemeq.y"
{yyval.r=-yyvsp[0].r;;
    break;}
case 11:
#line 84 "chemeq.y"
{yyval.r=1.0*yyvsp[0].i;;
    break;}
case 12:
#line 85 "chemeq.y"
{yyval.r=-1.0*yyvsp[0].i;;
    break;}
case 14:
#line 89 "chemeq.y"
{if (yyvsp[0].s != string("V")) yyerror ("only 'V' allowed as unit"); ;
    break;}
case 15:
#line 92 "chemeq.y"
{/* $$.s contient le nom */;
    break;}
case 16:
#line 95 "chemeq.y"
{
  yyval.cq = new Chemeq(yyvsp[-4].mb,yyvsp[0].mb);
;
    break;}
case 17:
#line 100 "chemeq.y"
{
  yyval.mb->push_back(yyvsp[0].m);
;
    break;}
case 18:
#line 103 "chemeq.y"
{
  yyval.mb = new Membre;
  yyval.mb->push_back(yyvsp[0].m);
;
    break;}
case 19:
#line 109 "chemeq.y"
{
  yyval = yyvsp[0];
  yyval.m->nombre(yyvsp[-2].i);
;
    break;}
case 20:
#line 113 "chemeq.y"
{
  yyval = yyvsp[0];
  yyval.m->nombre(yyvsp[-2].i,yyvsp[-2].d);
;
    break;}
case 21:
#line 117 "chemeq.y"
{
  yyval = yyvsp[0]; 
;
    break;}
case 24:
#line 126 "chemeq.y"
{
  yyval.m = new Molec(yyvsp[-1].al,0); yyval.m->typage(yyvsp[0].t);
;
    break;}
case 25:
#line 129 "chemeq.y"
{
  yyval.m = new Molec(yyvsp[-2].al,yyvsp[-1].i);yyval.m->typage(yyvsp[0].t);
;
    break;}
case 26:
#line 135 "chemeq.y"
{yyval.al=yyvsp[0].al;;
    break;}
case 27:
#line 136 "chemeq.y"
{yyval.al=yyvsp[-2].al; yyval.al->sq(1);;
    break;}
case 28:
#line 139 "chemeq.y"
{yyval.t = aqueous;;
    break;}
case 29:
#line 140 "chemeq.y"
{yyval.t = aqueous;;
    break;}
case 30:
#line 141 "chemeq.y"
{yyval.t = sol;;
    break;}
case 31:
#line 142 "chemeq.y"
{yyval.t = gas;;
    break;}
case 32:
#line 145 "chemeq.y"
{yyval.i=1;;
    break;}
case 33:
#line 146 "chemeq.y"
{yyval.i=1;;
    break;}
case 34:
#line 147 "chemeq.y"
{yyval.i=yyvsp[0].i;;
    break;}
case 35:
#line 148 "chemeq.y"
{yyval.i=-1;;
    break;}
case 36:
#line 149 "chemeq.y"
{yyval.i=-1;;
    break;}
case 37:
#line 152 "chemeq.y"
{
  yyval=yyvsp[-1]; 
;
    break;}
case 38:
#line 157 "chemeq.y"
{
  yyval.al = new AtomeListe("",0,0,yyvsp[0].al);
;
    break;}
case 39:
#line 160 "chemeq.y"
{
  char buffer[25];
  if (yyvsp[0].i==-2) { /* ce n'est pas un atome recensé */
    sprintf(buffer,"nonexistent atom : %s", yyvsp[0].symb);
    yyerror(buffer);
  }
  yyval.al = new AtomeListe(yyvsp[0].symb,yyvsp[0].i);
;
    break;}
case 40:
#line 170 "chemeq.y"
{
  yyval = yyvsp[-2];
  yyval.al->setmolecularite(yyvsp[-1].i);
  yyval.al->setsuivant(yyvsp[0].al);
;
    break;}
case 41:
#line 175 "chemeq.y"
{
  yyval.al = yyvsp[-1].al;
  yyval.al->setmolecularite(yyvsp[0].i);
;
    break;}
case 42:
#line 181 "chemeq.y"
{
  yyval.i=1;
;
    break;}
case 43:
#line 184 "chemeq.y"
{
  yyval=yyvsp[0]; 
;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 543 "/usr/lib/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 189 "chemeq.y"

#include "chemlex.cc"

yyFlexLexer lexer;

int yylex(){
  return lexer.yylex();
}

/* le programme lui-même */

inline int yyerror(char * msg){
  fprintf(stderr, "ERROR %s at %d\n ", msg, position);
  exit(1);
}

void printHelp(){
  cout << "Usage : chemeq [-m] [-l] [-c] [-w] [-n] [-h]" << endl;
  cout << "        default is equivalent to 'chemeq -mlcwn'" << endl;
  cout << "        chemeq reads its standard input which must be a standard" << endl;
  cout << "        chemical equation. It outputs many strings useful for chemical" << endl;
  cout << "        calculations." << endl;
  cout << "        As an example you can try the following command :" << endl;
  cout << "        echo \"Fes -> Fe^2+ + 2 e- (0.44 V)\" | chemeq" << endl;
}

int main(int argc, char * argv[]){
  char * optstr = "mlcwnh", ch;
  bool nooption=1;

  if (argc>1 && !strcmp(argv[1],"-h")){
    printHelp(); return 0;
  }
  yyparse();
  if (isequation) {
    while (-1 != (ch=getopt(argc,argv,optstr))){
      switch(ch){
      case 'm': nooption=0;
      result.cq->printnorm(cout); cout << endl;
      break;
      case 'l': nooption=0;
      cout << *result.cq << endl;
      break;
      case 'c': nooption=0;
      cout << result.cq->equilibre() << endl;
      break;
      case 'w': nooption=0;
      result.cq->printNernst(cout); cout << endl;
      break;
      case 'n': nooption=0;
      result.cq->normalise();
      result.cq->printnorm(cout); cout << endl;
      break;
      case 'h':
      printHelp();
      break;
      }
    }
    if (nooption){
      result.cq->printnorm(cout); cout << endl;
      cout << *result.cq << endl;
      cout << result.cq->equilibre() << endl;
      result.cq->printNernst(cout); cout << endl;
      result.cq->normalise();
      result.cq->printnorm(cout); cout << endl;
    }
  }
  else { /* ce n'est pas une équation */
    cout << *result.m;
  }
  return 0;
}

Generated by  Doxygen 1.6.0   Back to index