src/ct_common/file_parse/ct_parser.tab.cpp

Go to the documentation of this file.

/* A Bison parser, made by GNU Bison 2.5.  */

/* Skeleton implementation for Bison LALR(1) parsers in C++
   
      Copyright (C) 2002-2011 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 3 of the License, 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, see <http://www.gnu.org/licenses/>.  */

/* As a special exception, you may create a larger work that contains
   part or all of the Bison parser skeleton and distribute that work
   under terms of your choice, so long as that work isn't itself a
   parser generator using the skeleton or a modified version thereof
   as a parser skeleton.  Alternatively, if you modify or redistribute
   the parser skeleton itself, you may (at your option) remove this
   special exception, which will cause the skeleton and the resulting
   Bison output files to be licensed under the GNU General Public
   License without this special exception.
   
   This special exception was added by the Free Software Foundation in
   version 2.2 of Bison.  */
/* "%code top" blocks.  */

/* Line 286 of lalr1.cc  */
#line 27 "ct_parser.ypp"

#include <string>
#include <sstream>
#include <vector>
#include <cstdlib>
#include <ct_common/file_parse/ct_lexer.hpp>
using namespace ct::common;



/* Line 286 of lalr1.cc  */
#line 48 "ct_parser.tab.cpp"


/* First part of user declarations.  */


/* Line 293 of lalr1.cc  */
#line 55 "ct_parser.tab.cpp"


#include "ct_parser.tab.hpp"

/* User implementation prologue.  */


/* Line 299 of lalr1.cc  */
#line 64 "ct_parser.tab.cpp"
/* Unqualified %code blocks.  */

/* Line 300 of lalr1.cc  */
#line 57 "ct_parser.ypp"

#define TRY_BEGIN try {
#define TRY_END } catch (std::exception &e) { error(yyloc, e.what()); }

static yy::ct_parser::token_type
  yylex(yy::ct_parser::semantic_type* yylval, 
        yy::ct_parser::location_type* yylloc,
        ct::lexer &qlex);

static std::string gen_yylloc_str(const yy::ct_parser::location_type &loc, const std::string &s) {
  std::stringstream ss;
  ss << loc.begin.line << ":" << loc.begin.column << "-" << loc.end.line << ":" << loc.end.column << ": " << s;
  return ss.str();
}



/* Line 300 of lalr1.cc  */
#line 87 "ct_parser.tab.cpp"

#ifndef YY_
# if defined YYENABLE_NLS && YYENABLE_NLS
#  if ENABLE_NLS
#   include <libintl.h> /* FIXME: INFRINGES ON USER NAME SPACE */
#   define YY_(msgid) dgettext ("bison-runtime", msgid)
#  endif
# endif
# ifndef YY_
#  define YY_(msgid) msgid
# endif
#endif

/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
   If N is 0, then set CURRENT to the empty location which ends
   the previous symbol: RHS[0] (always defined).  */

#define YYRHSLOC(Rhs, K) ((Rhs)[K])
#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N)                               \
 do                                                                    \
   if (N)                                                              \
     {                                                                 \
       (Current).begin = YYRHSLOC (Rhs, 1).begin;                      \
       (Current).end   = YYRHSLOC (Rhs, N).end;                        \
     }                                                                 \
   else                                                                \
     {                                                                 \
       (Current).begin = (Current).end = YYRHSLOC (Rhs, 0).end;        \
     }                                                                 \
 while (false)
#endif

/* Suppress unused-variable warnings by "using" E.  */
#define YYUSE(e) ((void) (e))

/* Enable debugging if requested.  */
#if YYDEBUG

/* A pseudo ostream that takes yydebug_ into account.  */
# define YYCDEBUG if (yydebug_) (*yycdebug_)

# define YY_SYMBOL_PRINT(Title, Type, Value, Location)  \
do {                                                    \
  if (yydebug_)                                         \
    {                                                   \
      *yycdebug_ << Title << ' ';                       \
      yy_symbol_print_ ((Type), (Value), (Location));   \
      *yycdebug_ << std::endl;                          \
    }                                                   \
} while (false)

# define YY_REDUCE_PRINT(Rule)          \
do {                                    \
  if (yydebug_)                         \
    yy_reduce_print_ (Rule);            \
} while (false)

# define YY_STACK_PRINT()               \
do {                                    \
  if (yydebug_)                         \
    yystack_print_ ();                  \
} while (false)

#else /* !YYDEBUG */

# define YYCDEBUG if (false) std::cerr
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
# define YY_REDUCE_PRINT(Rule)
# define YY_STACK_PRINT()

#endif /* !YYDEBUG */

#define yyerrok         (yyerrstatus_ = 0)
#define yyclearin       (yychar = yyempty_)

#define YYACCEPT        goto yyacceptlab
#define YYABORT         goto yyabortlab
#define YYERROR         goto yyerrorlab
#define YYRECOVERING()  (!!yyerrstatus_)


namespace yy {

/* Line 382 of lalr1.cc  */
#line 173 "ct_parser.tab.cpp"

  /* Return YYSTR after stripping away unnecessary quotes and
     backslashes, so that it's suitable for yyerror.  The heuristic is
     that double-quoting is unnecessary unless the string contains an
     apostrophe, a comma, or backslash (other than backslash-backslash).
     YYSTR is taken from yytname.  */
  std::string
  ct_parser::yytnamerr_ (const char *yystr)
  {
    if (*yystr == '"')
      {
        std::string yyr = "";
        char const *yyp = yystr;

        for (;;)
          switch (*++yyp)
            {
            case '\'':
            case ',':
              goto do_not_strip_quotes;

            case '\\':
              if (*++yyp != '\\')
                goto do_not_strip_quotes;
              /* Fall through.  */
            default:
              yyr += *yyp;
              break;

            case '"':
              return yyr;
            }
      do_not_strip_quotes: ;
      }

    return yystr;
  }


  ct_parser::ct_parser (ct::lexer  &qlex_yyarg, std::vector<boost::shared_ptr<ct::common::ParamSpec> > &param_specs_yyarg, std::vector<ct::common::Strength> &strengths_yyarg, std::vector<boost::shared_ptr<ct::common::Seed> > &seeds_yyarg, std::vector<boost::shared_ptr<ct::common::Constraint> > &constraints_yyarg, ct::common::Assembler &assembler_yyarg)
    :
#if YYDEBUG
      yydebug_ (false),
      yycdebug_ (&std::cerr),
#endif
      qlex (qlex_yyarg),
      param_specs (param_specs_yyarg),
      strengths (strengths_yyarg),
      seeds (seeds_yyarg),
      constraints (constraints_yyarg),
      assembler (assembler_yyarg)
  {
  }

  ct_parser::~ct_parser ()
  {
  }

#if YYDEBUG
  /*--------------------------------.
  | Print this symbol on YYOUTPUT.  |
  `--------------------------------*/

  inline void
  ct_parser::yy_symbol_value_print_ (int yytype,
                           const semantic_type* yyvaluep, const location_type* yylocationp)
  {
    YYUSE (yylocationp);
    YYUSE (yyvaluep);
    switch (yytype)
      {
         default:
          break;
      }
  }


  void
  ct_parser::yy_symbol_print_ (int yytype,
                           const semantic_type* yyvaluep, const location_type* yylocationp)
  {
    *yycdebug_ << (yytype < yyntokens_ ? "token" : "nterm")
               << ' ' << yytname_[yytype] << " ("
               << *yylocationp << ": ";
    yy_symbol_value_print_ (yytype, yyvaluep, yylocationp);
    *yycdebug_ << ')';
  }
#endif

  void
  ct_parser::yydestruct_ (const char* yymsg,
                           int yytype, semantic_type* yyvaluep, location_type* yylocationp)
  {
    YYUSE (yylocationp);
    YYUSE (yymsg);
    YYUSE (yyvaluep);

    YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);

    switch (yytype)
      {
  
        default:
          break;
      }
  }

  void
  ct_parser::yypop_ (unsigned int n)
  {
    yystate_stack_.pop (n);
    yysemantic_stack_.pop (n);
    yylocation_stack_.pop (n);
  }

#if YYDEBUG
  std::ostream&
  ct_parser::debug_stream () const
  {
    return *yycdebug_;
  }

  void
  ct_parser::set_debug_stream (std::ostream& o)
  {
    yycdebug_ = &o;
  }


  ct_parser::debug_level_type
  ct_parser::debug_level () const
  {
    return yydebug_;
  }

  void
  ct_parser::set_debug_level (debug_level_type l)
  {
    yydebug_ = l;
  }
#endif

  inline bool
  ct_parser::yy_pact_value_is_default_ (int yyvalue)
  {
    return yyvalue == yypact_ninf_;
  }

  inline bool
  ct_parser::yy_table_value_is_error_ (int yyvalue)
  {
    return yyvalue == yytable_ninf_;
  }

  int
  ct_parser::parse ()
  {
    int yychar = yyempty_;
    int yytoken = 0;

    /* State.  */
    int yyn;
    int yylen = 0;
    int yystate = 0;

    /* Error handling.  */
    int yynerrs_ = 0;
    int yyerrstatus_ = 0;

    semantic_type yylval;
    location_type yylloc;
    location_type yyerror_range[3];

    semantic_type yyval;
    location_type yyloc;

    int yyresult;

    YYCDEBUG << "Starting parse" << std::endl;


    /* Initialize the stacks.  The initial state will be pushed in
       yynewstate, since the latter expects the semantical and the
       location values to have been already stored, initialize these
       stacks with a primary value.  */
    yystate_stack_ = state_stack_type (0);
    yysemantic_stack_ = semantic_stack_type (0);
    yylocation_stack_ = location_stack_type (0);
    yysemantic_stack_.push (yylval);
    yylocation_stack_.push (yylloc);

    /* New state.  */
  yynewstate:
    yystate_stack_.push (yystate);
    YYCDEBUG << "Entering state " << yystate << std::endl;

    /* Accept?  */
    if (yystate == yyfinal_)
      goto yyacceptlab;

    goto yybackup;

    /* Backup.  */
  yybackup:

    /* Try to take a decision without lookahead.  */
    yyn = yypact_[yystate];
    if (yy_pact_value_is_default_ (yyn))
      goto yydefault;

    /* Read a lookahead token.  */
    if (yychar == yyempty_)
      {
        YYCDEBUG << "Reading a token: ";
        yychar = yylex (&yylval, &yylloc, qlex);
      }


    /* Convert token to internal form.  */
    if (yychar <= yyeof_)
      {
        yychar = yytoken = yyeof_;
        YYCDEBUG << "Now at end of input." << std::endl;
      }
    else
      {
        yytoken = yytranslate_ (yychar);
        YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
      }

    /* If the proper action on seeing token YYTOKEN is to reduce or to
       detect an error, take that action.  */
    yyn += yytoken;
    if (yyn < 0 || yylast_ < yyn || yycheck_[yyn] != yytoken)
      goto yydefault;

    /* Reduce or error.  */
    yyn = yytable_[yyn];
    if (yyn <= 0)
      {
        if (yy_table_value_is_error_ (yyn))
          goto yyerrlab;
        yyn = -yyn;
        goto yyreduce;
      }

    /* Shift the lookahead token.  */
    YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);

    /* Discard the token being shifted.  */
    yychar = yyempty_;

    yysemantic_stack_.push (yylval);
    yylocation_stack_.push (yylloc);

    /* Count tokens shifted since error; after three, turn off error
       status.  */
    if (yyerrstatus_)
      --yyerrstatus_;

    yystate = yyn;
    goto yynewstate;

  /*-----------------------------------------------------------.
  | yydefault -- do the default action for the current state.  |
  `-----------------------------------------------------------*/
  yydefault:
    yyn = yydefact_[yystate];
    if (yyn == 0)
      goto yyerrlab;
    goto yyreduce;

  /*-----------------------------.
  | yyreduce -- Do a reduction.  |
  `-----------------------------*/
  yyreduce:
    yylen = yyr2_[yyn];
    /* If YYLEN is nonzero, implement the default value of the action:
       `$$ = $1'.  Otherwise, use the top of the stack.

       Otherwise, the following line sets YYVAL to garbage.
       This behavior is undocumented and Bison
       users should not rely upon it.  */
    if (yylen)
      yyval = yysemantic_stack_[yylen - 1];
    else
      yyval = yysemantic_stack_[0];

    {
      slice<location_type, location_stack_type> slice (yylocation_stack_, yylen);
      YYLLOC_DEFAULT (yyloc, slice, yylen);
    }
    YY_REDUCE_PRINT (yyn);
    switch (yyn)
      {
          case 2:

/* Line 690 of lalr1.cc  */
#line 141 "ct_parser.ypp"
    {
  std::vector<boost::shared_ptr<Constraint> > ivld_constrs = assembler.dump_invalidations(param_specs);
  constraints.insert(constraints.end(), ivld_constrs.begin(), ivld_constrs.end());
}
    break;

  case 11:

/* Line 690 of lalr1.cc  */
#line 156 "ct_parser.ypp"
    {
    param_specs.insert(param_specs.end(), (yysemantic_stack_[(2) - (2)].vec_param_spec)->begin(), (yysemantic_stack_[(2) - (2)].vec_param_spec)->end());
    delete (yysemantic_stack_[(2) - (2)].vec_param_spec);
  }
    break;

  case 12:

/* Line 690 of lalr1.cc  */
#line 164 "ct_parser.ypp"
    {
    (yyval.vec_param_spec) = new std::vector<boost::shared_ptr<ParamSpec> >();
    for (std::size_t i = 0; i < (yysemantic_stack_[(3) - (2)].vec_str)->size(); ++i) {
      TRY_BEGIN
      if (find_param_id(param_specs, (*(yysemantic_stack_[(3) - (2)].vec_str))[i]) != PID_BOUND) {
        assembler.reportWarning(gen_yylloc_str(yylloc, (std::string("parameter redefinition of ") + (*(yysemantic_stack_[(3) - (2)].vec_str))[i]).c_str()));
        continue;
      }
      ParamSpec *param_spec = assembler.asm_paramspec(*(yysemantic_stack_[(3) - (1)].str), (*(yysemantic_stack_[(3) - (2)].vec_str))[i], std::vector<boost::shared_ptr<TreeNode> >());
      if (param_spec == 0) {
        assembler.reportWarning(gen_yylloc_str(yylloc, (std::string("cannot assemble parameter ") + (*(yysemantic_stack_[(3) - (2)].vec_str))[i]).c_str()));
        continue;
      }
      (yyval.vec_param_spec)->push_back(boost::shared_ptr<ParamSpec>(param_spec));
      TRY_END
    }
    delete (yysemantic_stack_[(3) - (1)].str); delete (yysemantic_stack_[(3) - (2)].vec_str);
  }
    break;

  case 13:

/* Line 690 of lalr1.cc  */
#line 183 "ct_parser.ypp"
    {
    (yyval.vec_param_spec) = new std::vector<boost::shared_ptr<ParamSpec> >();
    for (std::size_t i = 0; i < (yysemantic_stack_[(5) - (2)].vec_str)->size(); ++i) {
      TRY_BEGIN
      if (find_param_id(param_specs, (*(yysemantic_stack_[(5) - (2)].vec_str))[i]) != PID_BOUND) {
        assembler.reportWarning(gen_yylloc_str(yylloc, (std::string("parameter redefinition of ") + (*(yysemantic_stack_[(5) - (2)].vec_str))[i]).c_str()));
        continue;
      }
      ParamSpec *param_spec = assembler.asm_paramspec(*(yysemantic_stack_[(5) - (1)].str), (*(yysemantic_stack_[(5) - (2)].vec_str))[i], *(yysemantic_stack_[(5) - (4)].vec_exp));
      if (param_spec == 0) {
        assembler.reportWarning(gen_yylloc_str(yylloc, (std::string("cannot assemble parameter ") + (*(yysemantic_stack_[(5) - (2)].vec_str))[i]).c_str()));
        continue;
      }
      (yyval.vec_param_spec)->push_back(boost::shared_ptr<ParamSpec>(param_spec));
      TRY_END
    }
    delete (yysemantic_stack_[(5) - (1)].str); delete (yysemantic_stack_[(5) - (2)].vec_str); delete (yysemantic_stack_[(5) - (4)].vec_exp);
  }
    break;

  case 14:

/* Line 690 of lalr1.cc  */
#line 202 "ct_parser.ypp"
    {
    (yyval.vec_param_spec) = new std::vector<boost::shared_ptr<ParamSpec> >();
    for (std::size_t i = 0; i < (yysemantic_stack_[(6) - (3)].vec_str)->size(); ++i) {
      TRY_BEGIN
      if (find_param_id(param_specs, (*(yysemantic_stack_[(6) - (3)].vec_str))[i]) != PID_BOUND) {
        assembler.reportWarning(gen_yylloc_str(yylloc, (std::string("parameter redefinition of ") + (*(yysemantic_stack_[(6) - (3)].vec_str))[i]).c_str()));
        continue;
      }
      ParamSpec *param_spec = assembler.asm_paramspec(*(yysemantic_stack_[(6) - (2)].str), (*(yysemantic_stack_[(6) - (3)].vec_str))[i], *(yysemantic_stack_[(6) - (5)].vec_exp));
      if (param_spec == 0) {
        assembler.reportWarning(gen_yylloc_str(yylloc, (std::string("cannot assemble parameter ") + (*(yysemantic_stack_[(6) - (3)].vec_str))[i]).c_str()));
        continue;
      }
      param_spec->set_aux(true);
      (yyval.vec_param_spec)->push_back(boost::shared_ptr<ParamSpec>(param_spec));
      TRY_END
    }
    delete (yysemantic_stack_[(6) - (2)].str); delete (yysemantic_stack_[(6) - (3)].vec_str); delete (yysemantic_stack_[(6) - (5)].vec_exp);
  }
    break;

  case 15:

/* Line 690 of lalr1.cc  */
#line 222 "ct_parser.ypp"
    {
    (yyval.vec_param_spec) = new std::vector<boost::shared_ptr<ParamSpec> >();
    TRY_BEGIN
    std::vector<std::pair<boost::shared_ptr<TreeNode>, boost::shared_ptr<TreeNode> > > auto_value_cases;
    Constraint_L_CBool *ctrue = new Constraint_L_CBool();
    ctrue->set_value(true);
    auto_value_cases.push_back(std::pair<boost::shared_ptr<TreeNode>, boost::shared_ptr<TreeNode> >(boost::shared_ptr<TreeNode>(ctrue), boost::shared_ptr<TreeNode>((yysemantic_stack_[(6) - (5)].tree_node))));
    for (std::size_t i = 0; i < (yysemantic_stack_[(6) - (3)].vec_str)->size(); ++i) {
      TRY_BEGIN
      if (find_param_id(param_specs, (*(yysemantic_stack_[(6) - (3)].vec_str))[i]) != PID_BOUND) {
        CT_EXCEPTION((std::string("parameter redefinition of ") + (*(yysemantic_stack_[(6) - (3)].vec_str))[i]).c_str());
      }
      ParamSpec *param_spec = assembler.asm_paramspec(*(yysemantic_stack_[(6) - (2)].str), (*(yysemantic_stack_[(6) - (3)].vec_str))[i], auto_value_cases);
      (yyval.vec_param_spec)->push_back(boost::shared_ptr<ParamSpec>(param_spec));
      TRY_END
    }
    TRY_END
    delete (yysemantic_stack_[(6) - (2)].str); delete (yysemantic_stack_[(6) - (3)].vec_str);
  }
    break;

  case 16:

/* Line 690 of lalr1.cc  */
#line 242 "ct_parser.ypp"
    {
    (yyval.vec_param_spec) = new std::vector<boost::shared_ptr<ParamSpec> >();
    TRY_BEGIN
    for (std::size_t i = 0; i < (yysemantic_stack_[(8) - (3)].vec_str)->size(); ++i) {
      TRY_BEGIN
      if (find_param_id(param_specs, (*(yysemantic_stack_[(8) - (3)].vec_str))[i]) != PID_BOUND) {
        CT_EXCEPTION((std::string("parameter redefinition of ") + (*(yysemantic_stack_[(8) - (3)].vec_str))[i]).c_str());
      }
      ParamSpec *param_spec = assembler.asm_paramspec(*(yysemantic_stack_[(8) - (2)].str), (*(yysemantic_stack_[(8) - (3)].vec_str))[i], *(yysemantic_stack_[(8) - (6)].vec_auto_value_cases));
      (yyval.vec_param_spec)->push_back(boost::shared_ptr<ParamSpec>(param_spec));
      TRY_END
    }
    TRY_END
    delete (yysemantic_stack_[(8) - (2)].str); delete (yysemantic_stack_[(8) - (3)].vec_str); delete (yysemantic_stack_[(8) - (6)].vec_auto_value_cases);
  }
    break;

  case 17:

/* Line 690 of lalr1.cc  */
#line 259 "ct_parser.ypp"
    {
    (yyval.vec_auto_value_cases) = new std::vector<std::pair<boost::shared_ptr<TreeNode>, boost::shared_ptr<TreeNode> > >();
    if ((yysemantic_stack_[(1) - (1)].auto_value_case)) {
      (yyval.vec_auto_value_cases)->push_back(*(yysemantic_stack_[(1) - (1)].auto_value_case));
    }
    delete (yysemantic_stack_[(1) - (1)].auto_value_case);
  }
    break;

  case 18:

/* Line 690 of lalr1.cc  */
#line 267 "ct_parser.ypp"
    {
    (yyval.vec_auto_value_cases) = (yysemantic_stack_[(3) - (1)].vec_auto_value_cases);
    if ((yysemantic_stack_[(3) - (1)].vec_auto_value_cases)) {
      (yyval.vec_auto_value_cases)->push_back(*(yysemantic_stack_[(3) - (3)].auto_value_case));
    }
    delete (yysemantic_stack_[(3) - (3)].auto_value_case);
  }
    break;

  case 19:

/* Line 690 of lalr1.cc  */
#line 275 "ct_parser.ypp"
    {
    (yyval.auto_value_case) = 0;
    TRY_BEGIN
    // no type check, the second tree_obj can be Exp or Constraint
    (yyval.auto_value_case) = new std::pair<boost::shared_ptr<TreeNode>, boost::shared_ptr<TreeNode> >(boost::shared_ptr<TreeNode>((yysemantic_stack_[(3) - (1)].tree_node)), boost::shared_ptr<TreeNode>((yysemantic_stack_[(3) - (3)].tree_node)));
    TRY_END
  }
    break;

  case 20:

/* Line 690 of lalr1.cc  */
#line 282 "ct_parser.ypp"
    {
    TRY_BEGIN
    boost::shared_ptr<Constraint_L_CBool> c_true(new Constraint_L_CBool());
    c_true->set_value(true);
    (yyval.auto_value_case) = new std::pair<boost::shared_ptr<TreeNode>, boost::shared_ptr<TreeNode> >(c_true, boost::shared_ptr<TreeNode>((yysemantic_stack_[(3) - (3)].tree_node)));
    TRY_END
  }
    break;

  case 21:

/* Line 690 of lalr1.cc  */
#line 292 "ct_parser.ypp"
    { (yyval.vec_exp) = (yysemantic_stack_[(1) - (1)].vec_exp); }
    break;

  case 22:

/* Line 690 of lalr1.cc  */
#line 293 "ct_parser.ypp"
    { (yyval.vec_exp) = (yysemantic_stack_[(3) - (1)].vec_exp); if ((yysemantic_stack_[(3) - (3)].vec_exp)) { (yyval.vec_exp)->insert((yyval.vec_exp)->end(), (yysemantic_stack_[(3) - (3)].vec_exp)->begin(), (yysemantic_stack_[(3) - (3)].vec_exp)->end()); delete (yysemantic_stack_[(3) - (3)].vec_exp); } }
    break;

  case 23:

/* Line 690 of lalr1.cc  */
#line 295 "ct_parser.ypp"
    { (yyval.vec_exp) = (yysemantic_stack_[(1) - (1)].vec_exp); }
    break;

  case 24:

/* Line 690 of lalr1.cc  */
#line 296 "ct_parser.ypp"
    { (yyval.vec_exp) = new std::vector<boost::shared_ptr<TreeNode> >(); if ((yysemantic_stack_[(1) - (1)].tree_node)) { (yyval.vec_exp)->push_back(boost::shared_ptr<TreeNode>((yysemantic_stack_[(1) - (1)].tree_node))); } }
    break;

  case 25:

/* Line 690 of lalr1.cc  */
#line 298 "ct_parser.ypp"
    { (yyval.tree_node) = (yysemantic_stack_[(1) - (1)].tree_node); }
    break;

  case 26:

/* Line 690 of lalr1.cc  */
#line 299 "ct_parser.ypp"
    { (yyval.tree_node) = (yysemantic_stack_[(1) - (1)].tree_node); }
    break;

  case 27:

/* Line 690 of lalr1.cc  */
#line 300 "ct_parser.ypp"
    { (yyval.tree_node) = (yysemantic_stack_[(1) - (1)].tree_node); }
    break;

  case 28:

/* Line 690 of lalr1.cc  */
#line 301 "ct_parser.ypp"
    { (yyval.tree_node) = (yysemantic_stack_[(1) - (1)].tree_node); }
    break;

  case 29:

/* Line 690 of lalr1.cc  */
#line 302 "ct_parser.ypp"
    { (yyval.tree_node) = (yysemantic_stack_[(1) - (1)].tree_node); }
    break;

  case 30:

/* Line 690 of lalr1.cc  */
#line 303 "ct_parser.ypp"
    { (yyval.tree_node) = (yysemantic_stack_[(1) - (1)].tree_node); }
    break;

  case 31:

/* Line 690 of lalr1.cc  */
#line 305 "ct_parser.ypp"
    {
    TYPE_ASSERT((yysemantic_stack_[(2) - (2)].tree_node), Exp_A_CInt*);
    Exp_A_CInt *exp = dynamic_cast<Exp_A_CInt *>((yysemantic_stack_[(2) - (2)].tree_node));
    exp->set_value(-exp->get_value());
    exp->set_str_value(std::string("-")+exp->get_str_value());
    (yyval.tree_node) = exp;
  }
    break;

  case 32:

/* Line 690 of lalr1.cc  */
#line 313 "ct_parser.ypp"
    {
      TYPE_ASSERT((yysemantic_stack_[(2) - (2)].tree_node), Exp_A_CDouble*);
    Exp_A_CDouble *exp = dynamic_cast<Exp_A_CDouble *>((yysemantic_stack_[(2) - (2)].tree_node));
    exp->set_value(-exp->get_value());
    exp->set_str_value(std::string("-")+exp->get_str_value());
    (yyval.tree_node) = exp;
  }
    break;

  case 33:

/* Line 690 of lalr1.cc  */
#line 322 "ct_parser.ypp"
    {
    TRY_BEGIN
    TYPE_ASSERT((yysemantic_stack_[(5) - (2)].tree_node), Exp_A_CInt*);
    TYPE_ASSERT((yysemantic_stack_[(5) - (4)].tree_node), Exp_A_CInt*);
    int val_begin = dynamic_cast<Exp_A_CInt*>((yysemantic_stack_[(5) - (2)].tree_node))->get_value();
    int val_end = dynamic_cast<Exp_A_CInt*>((yysemantic_stack_[(5) - (4)].tree_node))->get_value();
    int step = (val_begin <= val_end) ? 1 : -1;
    (yyval.vec_exp) = new std::vector<boost::shared_ptr<TreeNode> >();
    for (int val = val_begin; val <= val_end; val += step) {
      Exp_A_CInt *exp = new Exp_A_CInt();
      exp->set_value(val);
      std::stringstream ss;
      ss << val;
      exp->set_str_value(ss.str());
      exp->set_type(EAT_INT);
      (yyval.vec_exp)->push_back(boost::shared_ptr<TreeNode>(exp));
    }
    TRY_END
    delete (yysemantic_stack_[(5) - (2)].tree_node);
    delete (yysemantic_stack_[(5) - (4)].tree_node);
  }
    break;

  case 34:

/* Line 690 of lalr1.cc  */
#line 344 "ct_parser.ypp"
    {
    TRY_BEGIN
    TYPE_ASSERT((yysemantic_stack_[(7) - (2)].tree_node), Exp_A_CInt*);
    TYPE_ASSERT((yysemantic_stack_[(7) - (4)].tree_node), Exp_A_CInt*);
    TYPE_ASSERT((yysemantic_stack_[(7) - (6)].tree_node), Exp_A_CInt*);
    int val_begin = dynamic_cast<Exp_A_CInt*>((yysemantic_stack_[(7) - (2)].tree_node))->get_value();
    int val_end = dynamic_cast<Exp_A_CInt*>((yysemantic_stack_[(7) - (4)].tree_node))->get_value();
    int step = dynamic_cast<Exp_A_CInt*>((yysemantic_stack_[(7) - (6)].tree_node))->get_value();
    (yyval.vec_exp) = new std::vector<boost::shared_ptr<TreeNode> >();
    int sign = (step > 0) ? 1 : -1;
    for (int val = val_begin; sign * (val - val_end) <= 0; val += step) {
      Exp_A_CInt *exp = new Exp_A_CInt();
      exp->set_value(val);
      std::stringstream ss;
      ss << val;
      exp->set_str_value(ss.str());
      exp->set_type(EAT_INT);
      (yyval.vec_exp)->push_back(boost::shared_ptr<TreeNode>(exp));
    }
    TRY_END
    delete (yysemantic_stack_[(7) - (2)].tree_node);
    delete (yysemantic_stack_[(7) - (4)].tree_node);
    delete (yysemantic_stack_[(7) - (6)].tree_node);
  }
    break;

  case 35:

/* Line 690 of lalr1.cc  */
#line 368 "ct_parser.ypp"
    { (yyval.tree_node) = (yysemantic_stack_[(1) - (1)].tree_node); }
    break;

  case 36:

/* Line 690 of lalr1.cc  */
#line 369 "ct_parser.ypp"
    { (yyval.tree_node) = (yysemantic_stack_[(1) - (1)].tree_node); }
    break;

  case 37:

/* Line 690 of lalr1.cc  */
#line 371 "ct_parser.ypp"
    { (yyval.tree_node) = (yysemantic_stack_[(1) - (1)].tree_node); }
    break;

  case 38:

/* Line 690 of lalr1.cc  */
#line 372 "ct_parser.ypp"
    { (yyval.tree_node) = (yysemantic_stack_[(1) - (1)].tree_node); }
    break;

  case 39:

/* Line 690 of lalr1.cc  */
#line 373 "ct_parser.ypp"
    { (yyval.tree_node) = (yysemantic_stack_[(1) - (1)].tree_node); }
    break;

  case 40:

/* Line 690 of lalr1.cc  */
#line 374 "ct_parser.ypp"
    { (yyval.tree_node) = (yysemantic_stack_[(1) - (1)].tree_node); }
    break;

  case 41:

/* Line 690 of lalr1.cc  */
#line 377 "ct_parser.ypp"
    {
    Exp_S_CString *exp = new Exp_S_CString();
    exp->set_value(*(yysemantic_stack_[(1) - (1)].str));
    (yyval.tree_node) = exp;
    delete (yysemantic_stack_[(1) - (1)].str);
  }
    break;

  case 42:

/* Line 690 of lalr1.cc  */
#line 385 "ct_parser.ypp"
    {
    Exp_A_CDouble *tmp = new Exp_A_CDouble();
    tmp->set_value(atof((yysemantic_stack_[(1) - (1)].str)->c_str()));
    tmp->set_str_value(*(yysemantic_stack_[(1) - (1)].str));
    tmp->set_type(EAT_DOUBLE);
    (yyval.tree_node) = tmp;
    delete (yysemantic_stack_[(1) - (1)].str);
  }
    break;

  case 43:

/* Line 690 of lalr1.cc  */
#line 395 "ct_parser.ypp"
    {
    Exp_A_CInt *tmp = new Exp_A_CInt();
    tmp->set_value(atoi((yysemantic_stack_[(1) - (1)].str)->c_str()));
    tmp->set_str_value(*(yysemantic_stack_[(1) - (1)].str));
    tmp->set_type(EAT_INT);
    (yyval.tree_node) = tmp;
    delete (yysemantic_stack_[(1) - (1)].str);
  }
    break;

  case 44:

/* Line 690 of lalr1.cc  */
#line 404 "ct_parser.ypp"
    {
    TRY_BEGIN
    (yyval.tree_node) = assembler.asm_constraint_l_cbool(*(yysemantic_stack_[(1) - (1)].str));
    TRY_END
    delete (yysemantic_stack_[(1) - (1)].str);
}
    break;

  case 47:

/* Line 690 of lalr1.cc  */
#line 416 "ct_parser.ypp"
    {
    TRY_BEGIN assembler.attach_strengths(param_specs, *(yysemantic_stack_[(4) - (1)].vec_str), strengths, atoi((yysemantic_stack_[(4) - (3)].str)->c_str())); TRY_END
    delete (yysemantic_stack_[(4) - (1)].vec_str); delete (yysemantic_stack_[(4) - (3)].str);
  }
    break;

  case 48:

/* Line 690 of lalr1.cc  */
#line 420 "ct_parser.ypp"
    {
    TRY_BEGIN assembler.attach_default_strengths(param_specs, strengths, atoi((yysemantic_stack_[(4) - (3)].str)->c_str())); TRY_END
    delete (yysemantic_stack_[(4) - (3)].str);
  }
    break;

  case 49:

/* Line 690 of lalr1.cc  */
#line 426 "ct_parser.ypp"
    { (yyval.vec_str) = (yysemantic_stack_[(1) - (1)].vec_str); }
    break;

  case 50:

/* Line 690 of lalr1.cc  */
#line 427 "ct_parser.ypp"
    { (yyval.vec_str) = (yysemantic_stack_[(3) - (1)].vec_str); (yyval.vec_str)->insert((yyval.vec_str)->end(), (yysemantic_stack_[(3) - (3)].vec_str)->begin(), (yysemantic_stack_[(3) - (3)].vec_str)->end()); delete (yysemantic_stack_[(3) - (3)].vec_str); }
    break;

  case 51:

/* Line 690 of lalr1.cc  */
#line 430 "ct_parser.ypp"
    { (yyval.vec_str) = new std::vector<std::string>(); (yyval.vec_str)->push_back(*(yysemantic_stack_[(1) - (1)].str)); delete (yysemantic_stack_[(1) - (1)].str); }
    break;

  case 52:

/* Line 690 of lalr1.cc  */
#line 431 "ct_parser.ypp"
    {
    // only positive integers are allowed in the subscript
    (yyval.vec_str) = new std::vector<std::string>();
    for (int i = atoi((yysemantic_stack_[(6) - (3)].str)->c_str()); i <= atoi((yysemantic_stack_[(6) - (5)].str)->c_str()); ++i) {
      std::ostringstream ss;
      ss << *(yysemantic_stack_[(6) - (1)].str) << i;
      (yyval.vec_str)->push_back(ss.str());
    }
  }
    break;

  case 55:

/* Line 690 of lalr1.cc  */
#line 445 "ct_parser.ypp"
    {
    Seed *seed = assembler.asm_seed(seeds.size(), *(yysemantic_stack_[(2) - (1)].tuple));
    seeds.push_back(boost::shared_ptr<Seed>(seed));
    delete (yysemantic_stack_[(2) - (1)].tuple); }
    break;

  case 56:

/* Line 690 of lalr1.cc  */
#line 449 "ct_parser.ypp"
    {
    Seed *seed = assembler.asm_seed(seeds.size(), *(yysemantic_stack_[(3) - (2)].tuple));
    seed->set_is_starter(true);
    seeds.push_back(boost::shared_ptr<Seed>(seed));
    delete (yysemantic_stack_[(3) - (2)].tuple); }
    break;

  case 57:

/* Line 690 of lalr1.cc  */
#line 454 "ct_parser.ypp"
    {
    TRY_BEGIN
    TYPE_ASSERT((yysemantic_stack_[(2) - (1)].tree_node), Constraint*);
    Seed *seed = assembler.asm_seed(seeds.size(), (Constraint*)(yysemantic_stack_[(2) - (1)].tree_node));  // $1 is stored in the seed, don't delete!!
    seeds.push_back(boost::shared_ptr<Seed>(seed));
    TRY_END }
    break;

  case 58:

/* Line 690 of lalr1.cc  */
#line 460 "ct_parser.ypp"
    {
    TRY_BEGIN
    TYPE_ASSERT((yysemantic_stack_[(3) - (2)].tree_node), Constraint*);
    Seed *seed = assembler.asm_seed(seeds.size(), (Constraint*)(yysemantic_stack_[(3) - (2)].tree_node));  // $2 is stored in the seed, don't delete!!
    seed->set_is_starter(true);
    seeds.push_back(boost::shared_ptr<Seed>(seed));
    TRY_END }
    break;

  case 59:

/* Line 690 of lalr1.cc  */
#line 468 "ct_parser.ypp"
    {
    (yyval.tuple) = new Tuple();
    if ((yysemantic_stack_[(1) - (1)].pvpair)) {
      (yyval.tuple)->push_back(*(yysemantic_stack_[(1) - (1)].pvpair));
      delete (yysemantic_stack_[(1) - (1)].pvpair);
    } else {
      assembler.reportWarning(gen_yylloc_str(yylloc, "neglected bad pvpair"));
    }
  }
    break;

  case 60:

/* Line 690 of lalr1.cc  */
#line 477 "ct_parser.ypp"
    {
    (yyval.tuple) = (yysemantic_stack_[(3) - (1)].tuple);
    if ((yysemantic_stack_[(3) - (3)].pvpair)) {
      (yyval.tuple)->push_back(*(yysemantic_stack_[(3) - (3)].pvpair));
      delete (yysemantic_stack_[(3) - (3)].pvpair);
    } else {
      assembler.reportWarning(gen_yylloc_str(yylloc, "neglected null pvpair"));
    }
  }
    break;

  case 61:

/* Line 690 of lalr1.cc  */
#line 487 "ct_parser.ypp"
    { (yyval.pvpair) = 0; TRY_BEGIN (yyval.pvpair) = assembler.asm_pvpair(param_specs, *(yysemantic_stack_[(3) - (1)].str), (yysemantic_stack_[(3) - (3)].tree_node)); TRY_END delete (yysemantic_stack_[(3) - (1)].str); delete (yysemantic_stack_[(3) - (3)].tree_node); }
    break;

  case 64:

/* Line 690 of lalr1.cc  */
#line 492 "ct_parser.ypp"
    { TRY_BEGIN TYPE_ASSERT((yysemantic_stack_[(2) - (1)].tree_node), Constraint*); Constraint *tmp = dynamic_cast<Constraint *>((yysemantic_stack_[(2) - (1)].tree_node)); constraints.push_back(boost::shared_ptr<Constraint>(tmp)); TRY_END }
    break;

  case 65:

/* Line 690 of lalr1.cc  */
#line 493 "ct_parser.ypp"
    { TRY_BEGIN assembler.store_invalidation(param_specs, *(yysemantic_stack_[(6) - (4)].vec_str), boost::shared_ptr<TreeNode>((yysemantic_stack_[(6) - (1)].tree_node))); TRY_END }
    break;

  case 66:

/* Line 690 of lalr1.cc  */
#line 497 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_constraint_asb((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_EQ, *(yysemantic_stack_[(3) - (2)].str)); TRY_END delete (yysemantic_stack_[(3) - (2)].str); }
    break;

  case 67:

/* Line 690 of lalr1.cc  */
#line 498 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_constraint_asb((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_NE, *(yysemantic_stack_[(3) - (2)].str)); TRY_END delete (yysemantic_stack_[(3) - (2)].str); }
    break;

  case 68:

/* Line 690 of lalr1.cc  */
#line 499 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_constraint_asb((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_GT, *(yysemantic_stack_[(3) - (2)].str)); TRY_END delete (yysemantic_stack_[(3) - (2)].str); }
    break;

  case 69:

/* Line 690 of lalr1.cc  */
#line 500 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_constraint_asb((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_GE, *(yysemantic_stack_[(3) - (2)].str)); TRY_END delete (yysemantic_stack_[(3) - (2)].str); }
    break;

  case 70:

/* Line 690 of lalr1.cc  */
#line 501 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_constraint_asb((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_LT, *(yysemantic_stack_[(3) - (2)].str)); TRY_END delete (yysemantic_stack_[(3) - (2)].str); }
    break;

  case 71:

/* Line 690 of lalr1.cc  */
#line 502 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_constraint_asb((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_LE, *(yysemantic_stack_[(3) - (2)].str)); TRY_END delete (yysemantic_stack_[(3) - (2)].str); }
    break;

  case 72:

/* Line 690 of lalr1.cc  */
#line 504 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_constraint_l((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_AND); TRY_END }
    break;

  case 73:

/* Line 690 of lalr1.cc  */
#line 505 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_constraint_l((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_OR); TRY_END }
    break;

  case 74:

/* Line 690 of lalr1.cc  */
#line 506 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_constraint_l((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_IMPLY); TRY_END }
    break;

  case 75:

/* Line 690 of lalr1.cc  */
#line 507 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_constraint_l((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_IFF); TRY_END }
    break;

  case 76:

/* Line 690 of lalr1.cc  */
#line 508 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_constraint_l((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_XOR); TRY_END }
    break;

  case 77:

/* Line 690 of lalr1.cc  */
#line 509 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_constraint_l((yysemantic_stack_[(2) - (2)].tree_node), OP_NOT); TRY_END }
    break;

  case 78:

/* Line 690 of lalr1.cc  */
#line 511 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_exp_a((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_ADD); TRY_END }
    break;

  case 79:

/* Line 690 of lalr1.cc  */
#line 512 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_exp_a((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_SUB); TRY_END }
    break;

  case 80:

/* Line 690 of lalr1.cc  */
#line 513 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_exp_a((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_MULT); TRY_END }
    break;

  case 81:

/* Line 690 of lalr1.cc  */
#line 514 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_exp_a((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_DIV); TRY_END }
    break;

  case 82:

/* Line 690 of lalr1.cc  */
#line 515 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_exp_a((yysemantic_stack_[(3) - (1)].tree_node), (yysemantic_stack_[(3) - (3)].tree_node), OP_MOD); TRY_END }
    break;

  case 83:

/* Line 690 of lalr1.cc  */
#line 516 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_exp_a((yysemantic_stack_[(2) - (2)].tree_node), OP_NEG); TRY_END }
    break;

  case 84:

/* Line 690 of lalr1.cc  */
#line 517 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_exp_a((yysemantic_stack_[(2) - (2)].tree_node), OP_UPLUS); TRY_END }
    break;

  case 85:

/* Line 690 of lalr1.cc  */
#line 519 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_param(param_specs, *(yysemantic_stack_[(1) - (1)].str)); delete (yysemantic_stack_[(1) - (1)].str); TRY_END }
    break;

  case 86:

/* Line 690 of lalr1.cc  */
#line 520 "ct_parser.ypp"
    { (yyval.tree_node) = (yysemantic_stack_[(1) - (1)].tree_node); }
    break;

  case 87:

/* Line 690 of lalr1.cc  */
#line 521 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_exp_a_cast((yysemantic_stack_[(4) - (3)].tree_node), *(yysemantic_stack_[(4) - (1)].str)); TRY_END delete (yysemantic_stack_[(4) - (1)].str); }
    break;

  case 88:

/* Line 690 of lalr1.cc  */
#line 522 "ct_parser.ypp"
    { (yyval.tree_node) = (yysemantic_stack_[(3) - (2)].tree_node); }
    break;

  case 89:

/* Line 690 of lalr1.cc  */
#line 523 "ct_parser.ypp"
    { (yyval.tree_node) = 0; TRY_BEGIN (yyval.tree_node) = assembler.asm_constraint_invalid(param_specs, *(yysemantic_stack_[(4) - (3)].str)); TRY_END }
    break;

  case 92:

/* Line 690 of lalr1.cc  */
#line 528 "ct_parser.ypp"
    { TRY_BEGIN assembler.set_option(*(yysemantic_stack_[(4) - (1)].str),(yysemantic_stack_[(4) - (3)].tree_node)); TRY_END delete (yysemantic_stack_[(4) - (1)].str); delete (yysemantic_stack_[(4) - (3)].tree_node); }
    break;



/* Line 690 of lalr1.cc  */
#line 1245 "ct_parser.tab.cpp"
        default:
          break;
      }
    /* User semantic actions sometimes alter yychar, and that requires
       that yytoken be updated with the new translation.  We take the
       approach of translating immediately before every use of yytoken.
       One alternative is translating here after every semantic action,
       but that translation would be missed if the semantic action
       invokes YYABORT, YYACCEPT, or YYERROR immediately after altering
       yychar.  In the case of YYABORT or YYACCEPT, an incorrect
       destructor might then be invoked immediately.  In the case of
       YYERROR, subsequent parser actions might lead to an incorrect
       destructor call or verbose syntax error message before the
       lookahead is translated.  */
    YY_SYMBOL_PRINT ("-> $$ =", yyr1_[yyn], &yyval, &yyloc);

    yypop_ (yylen);
    yylen = 0;
    YY_STACK_PRINT ();

    yysemantic_stack_.push (yyval);
    yylocation_stack_.push (yyloc);

    /* Shift the result of the reduction.  */
    yyn = yyr1_[yyn];
    yystate = yypgoto_[yyn - yyntokens_] + yystate_stack_[0];
    if (0 <= yystate && yystate <= yylast_
        && yycheck_[yystate] == yystate_stack_[0])
      yystate = yytable_[yystate];
    else
      yystate = yydefgoto_[yyn - yyntokens_];
    goto yynewstate;

  /*------------------------------------.
  | yyerrlab -- here on detecting error |
  `------------------------------------*/
  yyerrlab:
    /* Make sure we have latest lookahead translation.  See comments at
       user semantic actions for why this is necessary.  */
    yytoken = yytranslate_ (yychar);

    /* If not already recovering from an error, report this error.  */
    if (!yyerrstatus_)
      {
        ++yynerrs_;
        if (yychar == yyempty_)
          yytoken = yyempty_;
        error (yylloc, yysyntax_error_ (yystate, yytoken));
      }

    yyerror_range[1] = yylloc;
    if (yyerrstatus_ == 3)
      {
        /* If just tried and failed to reuse lookahead token after an
         error, discard it.  */

        if (yychar <= yyeof_)
          {
          /* Return failure if at end of input.  */
          if (yychar == yyeof_)
            YYABORT;
          }
        else
          {
            yydestruct_ ("Error: discarding", yytoken, &yylval, &yylloc);
            yychar = yyempty_;
          }
      }

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


  /*---------------------------------------------------.
  | yyerrorlab -- error raised explicitly by YYERROR.  |
  `---------------------------------------------------*/
  yyerrorlab:

    /* Pacify compilers like GCC when the user code never invokes
       YYERROR and the label yyerrorlab therefore never appears in user
       code.  */
    if (false)
      goto yyerrorlab;

    yyerror_range[1] = yylocation_stack_[yylen - 1];
    /* Do not reclaim the symbols of the rule which action triggered
       this YYERROR.  */
    yypop_ (yylen);
    yylen = 0;
    yystate = yystate_stack_[0];
    goto yyerrlab1;

  /*-------------------------------------------------------------.
  | yyerrlab1 -- common code for both syntax error and YYERROR.  |
  `-------------------------------------------------------------*/
  yyerrlab1:
    yyerrstatus_ = 3;   /* Each real token shifted decrements this.  */

    for (;;)
      {
        yyn = yypact_[yystate];
        if (!yy_pact_value_is_default_ (yyn))
        {
          yyn += yyterror_;
          if (0 <= yyn && yyn <= yylast_ && yycheck_[yyn] == yyterror_)
            {
              yyn = yytable_[yyn];
              if (0 < yyn)
                break;
            }
        }

        /* Pop the current state because it cannot handle the error token.  */
        if (yystate_stack_.height () == 1)
        YYABORT;

        yyerror_range[1] = yylocation_stack_[0];
        yydestruct_ ("Error: popping",
                     yystos_[yystate],
                     &yysemantic_stack_[0], &yylocation_stack_[0]);
        yypop_ ();
        yystate = yystate_stack_[0];
        YY_STACK_PRINT ();
      }

    yyerror_range[2] = yylloc;
    // Using YYLLOC is tempting, but would change the location of
    // the lookahead.  YYLOC is available though.
    YYLLOC_DEFAULT (yyloc, yyerror_range, 2);
    yysemantic_stack_.push (yylval);
    yylocation_stack_.push (yyloc);

    /* Shift the error token.  */
    YY_SYMBOL_PRINT ("Shifting", yystos_[yyn],
                     &yysemantic_stack_[0], &yylocation_stack_[0]);

    yystate = yyn;
    goto yynewstate;

    /* Accept.  */
  yyacceptlab:
    yyresult = 0;
    goto yyreturn;

    /* Abort.  */
  yyabortlab:
    yyresult = 1;
    goto yyreturn;

  yyreturn:
    if (yychar != yyempty_)
      {
        /* Make sure we have latest lookahead translation.  See comments
           at user semantic actions for why this is necessary.  */
        yytoken = yytranslate_ (yychar);
        yydestruct_ ("Cleanup: discarding lookahead", yytoken, &yylval,
                     &yylloc);
      }

    /* Do not reclaim the symbols of the rule which action triggered
       this YYABORT or YYACCEPT.  */
    yypop_ (yylen);
    while (yystate_stack_.height () != 1)
      {
        yydestruct_ ("Cleanup: popping",
                   yystos_[yystate_stack_[0]],
                   &yysemantic_stack_[0],
                   &yylocation_stack_[0]);
        yypop_ ();
      }

    return yyresult;
  }

  // Generate an error message.
  std::string
  ct_parser::yysyntax_error_ (int yystate, int yytoken)
  {
    std::string yyres;
    // Number of reported tokens (one for the "unexpected", one per
    // "expected").
    size_t yycount = 0;
    // Its maximum.
    enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
    // Arguments of yyformat.
    char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];

    /* There are many possibilities here to consider:
       - If this state is a consistent state with a default action, then
         the only way this function was invoked is if the default action
         is an error action.  In that case, don't check for expected
         tokens because there are none.
       - The only way there can be no lookahead present (in yytoken) is
         if this state is a consistent state with a default action.
         Thus, detecting the absence of a lookahead is sufficient to
         determine that there is no unexpected or expected token to
         report.  In that case, just report a simple "syntax error".
       - Don't assume there isn't a lookahead just because this state is
         a consistent state with a default action.  There might have
         been a previous inconsistent state, consistent state with a
         non-default action, or user semantic action that manipulated
         yychar.
       - Of course, the expected token list depends on states to have
         correct lookahead information, and it depends on the parser not
         to perform extra reductions after fetching a lookahead from the
         scanner and before detecting a syntax error.  Thus, state
         merging (from LALR or IELR) and default reductions corrupt the
         expected token list.  However, the list is correct for
         canonical LR with one exception: it will still contain any
         token that will not be accepted due to an error action in a
         later state.
    */
    if (yytoken != yyempty_)
      {
        yyarg[yycount++] = yytname_[yytoken];
        int yyn = yypact_[yystate];
        if (!yy_pact_value_is_default_ (yyn))
          {
            /* Start YYX at -YYN if negative to avoid negative indexes in
               YYCHECK.  In other words, skip the first -YYN actions for
               this state because they are default actions.  */
            int yyxbegin = yyn < 0 ? -yyn : 0;
            /* Stay within bounds of both yycheck and yytname.  */
            int yychecklim = yylast_ - yyn + 1;
            int yyxend = yychecklim < yyntokens_ ? yychecklim : yyntokens_;
            for (int yyx = yyxbegin; yyx < yyxend; ++yyx)
              if (yycheck_[yyx + yyn] == yyx && yyx != yyterror_
                  && !yy_table_value_is_error_ (yytable_[yyx + yyn]))
                {
                  if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
                    {
                      yycount = 1;
                      break;
                    }
                  else
                    yyarg[yycount++] = yytname_[yyx];
                }
          }
      }

    char const* yyformat = 0;
    switch (yycount)
      {
#define YYCASE_(N, S)                         \
        case N:                               \
          yyformat = S;                       \
        break
        YYCASE_(0, YY_("syntax error"));
        YYCASE_(1, YY_("syntax error, unexpected %s"));
        YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
        YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
        YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
        YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
#undef YYCASE_
      }

    // Argument number.
    size_t yyi = 0;
    for (char const* yyp = yyformat; *yyp; ++yyp)
      if (yyp[0] == '%' && yyp[1] == 's' && yyi < yycount)
        {
          yyres += yytnamerr_ (yyarg[yyi++]);
          ++yyp;
        }
      else
        yyres += *yyp;
    return yyres;
  }


  /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
     STATE-NUM.  */
  const short int ct_parser::yypact_ninf_ = -143;
  const short int
  ct_parser::yypact_[] =
  {
       195,  -143,  -143,  -143,  -143,  -143,    18,   195,  -143,   136,
      -1,   119,   160,    22,  -143,  -143,    31,    46,    49,  -143,
     -10,    40,  -143,    96,  -143,    73,    74,  -143,  -143,  -143,
    -143,   171,    88,   160,   160,   160,   160,  -143,  -143,  -143,
    -143,  -143,  -143,   -32,  -143,   215,  -143,  -143,   190,    87,
    -143,    58,    31,    31,   134,   141,   149,    31,   160,    16,
      41,   240,   157,  -143,  -143,  -143,   316,  -143,   168,   160,
     160,   160,   160,   160,   160,   160,   160,   160,   160,   160,
     160,   160,   160,   160,   160,  -143,   142,  -143,    65,     0,
    -143,   106,   109,   151,   139,   140,  -143,   340,   174,  -143,
    -143,  -143,  -143,  -143,  -143,  -143,  -143,  -143,   145,  -143,
      74,  -143,    78,    78,     9,     9,     9,     9,   388,   388,
     388,   412,   412,    83,    83,  -143,  -143,  -143,    31,   143,
      -5,    53,  -143,  -143,  -143,     0,    75,   184,  -143,  -143,
    -143,  -143,  -143,  -143,    -2,  -143,   191,  -143,   154,  -143,
    -143,     0,   123,   130,   265,   152,   172,    -5,  -143,  -143,
     175,   -44,  -143,   290,  -143,  -143,  -143,    42,   160,   130,
     177,   160,    -5,  -143,   364,  -143,  -143,   364,   169,  -143
  };

  /* YYDEFACT[S] -- default reduction number in state S.  Performed when
     YYTABLE doesn't specify something else to do.  Zero means the
     default is an error.  */
  const unsigned char
  ct_parser::yydefact_[] =
  {
         0,    10,    45,    53,    62,    90,     0,     2,     3,     5,
       6,     7,     8,     9,     1,     4,     0,     0,     0,    11,
      51,     0,    46,     0,    49,     0,    85,    41,    42,    43,
      44,     0,     0,     0,     0,     0,     0,    86,    37,    39,
      38,    40,    54,     0,    59,     0,    85,    63,     0,     0,
      91,     0,     0,     0,     0,     0,     0,     0,     0,     0,
       0,     0,     0,    77,    84,    83,     0,    55,     0,     0,
       0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
       0,     0,     0,     0,     0,    57,     0,    64,     0,     0,
      12,     0,     0,     0,     0,     0,    50,     0,     0,    61,
      29,    30,    25,    27,    26,    28,    56,    58,     0,    88,
       0,    60,    66,    67,    68,    69,    70,    71,    72,    73,
      76,    74,    75,    78,    79,    80,    81,    82,     0,     0,
       0,     0,    21,    24,    23,     0,     0,     0,    48,    47,
      87,    32,    31,    89,     0,    92,     0,    36,     0,    35,
      13,     0,     0,     0,     0,     0,     0,     0,    22,    14,
       0,     0,    17,     0,    15,    52,    65,     0,     0,     0,
       0,     0,     0,    33,    20,    18,    16,    19,     0,    34
  };

  /* YYPGOTO[NTERM-NUM].  */
  const short int
  ct_parser::yypgoto_[] =
  {
      -143,  -143,  -143,   223,  -143,  -143,  -143,    63,    99,    97,
     179,  -116,  -143,  -143,  -142,   161,   -54,   -55,   -56,   -53,
    -143,  -143,   -14,   194,  -143,  -143,   222,   187,  -143,  -143,
     -11,  -143,  -143
  };

  /* YYDEFGOTO[NTERM-NUM].  */
  const short int
  ct_parser::yydefgoto_[] =
  {
        -1,     6,     7,     8,     9,    19,   161,   162,   131,   132,
     133,   100,   101,   134,   148,    37,    38,    39,    40,    41,
      10,    22,    23,    24,    11,    42,    43,    44,    12,    47,
     163,    13,    50
  };

  /* YYTABLE[YYPACT[STATE-NUM]].  What to do in state STATE-NUM.  If
     positive, shift that token.  If negative, reduce the rule which
     number is the opposite.  If YYTABLE_NINF_, syntax error.  */
  const signed char ct_parser::yytable_ninf_ = -1;
  const unsigned char
  ct_parser::yytable_[] =
  {
        45,    48,    51,   104,   103,   102,   105,    29,    20,   169,
      27,    28,    29,    30,   147,   167,    21,   170,    14,    67,
      61,    68,    63,    64,    65,    66,    27,    28,    29,    30,
     178,    49,   146,   104,   103,   102,   105,    98,    91,    92,
      20,   147,   142,   141,    80,   156,    81,    97,    82,    54,
      83,    57,    84,    98,    52,   130,   147,    53,   112,   113,
     114,   115,   116,   117,   118,   119,   120,   121,   122,   123,
     124,   125,   126,   127,   149,    27,    28,    29,    30,   104,
     103,   102,   105,    25,    46,    27,    28,    29,    30,    55,
     142,   172,   106,    32,    68,   104,   103,   102,   105,   173,
      71,   149,    72,    73,   150,    74,   151,    89,    33,    90,
      34,    57,    35,    80,   144,    81,   149,    82,    58,    83,
      36,    84,    82,    59,    83,   154,    84,    25,    26,    27,
      28,    29,    30,    62,   153,    31,    88,    32,    25,    46,
      27,    28,    29,    30,    16,    56,    93,   160,    32,    57,
      17,    18,    33,    94,    34,   135,    35,   174,   136,    57,
     177,    95,    57,    33,    36,    34,   108,    35,    25,    46,
      27,    28,    29,    30,   159,    36,   151,   110,    32,    25,
      26,    27,    28,    29,    30,    28,    29,   128,   137,    32,
     138,   139,   143,    33,   145,    34,   155,    35,     1,     2,
       3,     4,     5,    29,    33,    36,    34,   157,    35,    86,
      69,    70,    71,   165,    72,    73,    36,    74,    75,    76,
      77,    78,    79,   166,   168,    80,   179,    81,   176,    82,
      15,    83,   175,    84,   152,    69,    70,    71,    99,    72,
      73,    87,    74,    75,    76,    77,    78,    79,   158,   129,
      80,    96,    81,    60,    82,   111,    83,     0,    84,     0,
      69,    70,    71,     0,    72,    73,    85,    74,    75,    76,
      77,    78,    79,     0,     0,    80,     0,    81,     0,    82,
       0,    83,     0,    84,     0,    69,    70,    71,     0,    72,
      73,   107,    74,    75,    76,    77,    78,    79,     0,     0,
      80,     0,    81,     0,    82,     0,    83,     0,    84,     0,
      69,    70,    71,     0,    72,    73,   164,    74,    75,    76,
      77,    78,    79,     0,     0,    80,     0,    81,     0,    82,
       0,    83,     0,    84,     0,     0,    69,    70,    71,   171,
      72,    73,     0,    74,    75,    76,    77,    78,    79,     0,
       0,    80,     0,    81,     0,    82,     0,    83,     0,    84,
      69,    70,    71,   109,    72,    73,     0,    74,    75,    76,
      77,    78,    79,     0,     0,    80,     0,    81,     0,    82,
       0,    83,     0,    84,    69,    70,    71,   140,    72,    73,
       0,    74,    75,    76,    77,    78,    79,     0,     0,    80,
       0,    81,     0,    82,     0,    83,     0,    84,    69,    70,
      71,     0,    72,    73,     0,    74,     0,     0,     0,    78,
      79,     0,     0,    80,     0,    81,     0,    82,     0,    83,
       0,    84,    69,    70,    71,     0,    72,    73,     0,    74,
       0,     0,     0,     0,     0,     0,     0,    80,     0,    81,
       0,    82,     0,    83,     0,    84
  };

  /* YYCHECK.  */
  const short int
  ct_parser::yycheck_[] =
  {
        11,    12,    16,    59,    59,    59,    59,    12,     9,    53,
      10,    11,    12,    13,   130,   157,    17,    61,     0,    51,
      31,    53,    33,    34,    35,    36,    10,    11,    12,    13,
     172,     9,    37,    89,    89,    89,    89,    37,    52,    53,
       9,   157,    98,    98,    35,    47,    37,    58,    39,    59,
      41,    53,    43,    37,     8,    55,   172,     8,    69,    70,
      71,    72,    73,    74,    75,    76,    77,    78,    79,    80,
      81,    82,    83,    84,   130,    10,    11,    12,    13,   135,
     135,   135,   135,     8,     9,    10,    11,    12,    13,    49,
     146,    49,    51,    18,    53,   151,   151,   151,   151,    57,
      22,   157,    24,    25,    51,    27,    53,    49,    33,    51,
      35,    53,    37,    35,   128,    37,   172,    39,    45,    41,
      45,    43,    39,    49,    41,   136,    43,     8,     9,    10,
      11,    12,    13,    45,    59,    16,    49,    18,     8,     9,
      10,    11,    12,    13,     8,    49,    12,    17,    18,    53,
      14,    15,    33,    12,    35,    49,    37,   168,    49,    53,
     171,    12,    53,    33,    45,    35,     9,    37,     8,     9,
      10,    11,    12,    13,    51,    45,    53,     9,    18,     8,
       9,    10,    11,    12,    13,    11,    12,    45,    37,    18,
      51,    51,    47,    33,    51,    35,    12,    37,     3,     4,
       5,     6,     7,    12,    33,    45,    35,    53,    37,    19,
      20,    21,    22,    61,    24,    25,    45,    27,    28,    29,
      30,    31,    32,    51,    49,    35,    57,    37,    51,    39,
       7,    41,   169,    43,   135,    20,    21,    22,    59,    24,
      25,    51,    27,    28,    29,    30,    31,    32,   151,    88,
      35,    57,    37,    31,    39,    68,    41,    -1,    43,    -1,
      20,    21,    22,    -1,    24,    25,    51,    27,    28,    29,
      30,    31,    32,    -1,    -1,    35,    -1,    37,    -1,    39,
      -1,    41,    -1,    43,    -1,    20,    21,    22,    -1,    24,
      25,    51,    27,    28,    29,    30,    31,    32,    -1,    -1,
      35,    -1,    37,    -1,    39,    -1,    41,    -1,    43,    -1,
      20,    21,    22,    -1,    24,    25,    51,    27,    28,    29,
      30,    31,    32,    -1,    -1,    35,    -1,    37,    -1,    39,
      -1,    41,    -1,    43,    -1,    -1,    20,    21,    22,    49,
      24,    25,    -1,    27,    28,    29,    30,    31,    32,    -1,
      -1,    35,    -1,    37,    -1,    39,    -1,    41,    -1,    43,
      20,    21,    22,    47,    24,    25,    -1,    27,    28,    29,
      30,    31,    32,    -1,    -1,    35,    -1,    37,    -1,    39,
      -1,    41,    -1,    43,    20,    21,    22,    47,    24,    25,
      -1,    27,    28,    29,    30,    31,    32,    -1,    -1,    35,
      -1,    37,    -1,    39,    -1,    41,    -1,    43,    20,    21,
      22,    -1,    24,    25,    -1,    27,    -1,    -1,    -1,    31,
      32,    -1,    -1,    35,    -1,    37,    -1,    39,    -1,    41,
      -1,    43,    20,    21,    22,    -1,    24,    25,    -1,    27,
      -1,    -1,    -1,    -1,    -1,    -1,    -1,    35,    -1,    37,
      -1,    39,    -1,    41,    -1,    43
  };

  /* STOS_[STATE-NUM] -- The (internal number of the) accessing
     symbol of state STATE-NUM.  */
  const unsigned char
  ct_parser::yystos_[] =
  {
         0,     3,     4,     5,     6,     7,    66,    67,    68,    69,
      85,    89,    93,    96,     0,    68,     8,    14,    15,    70,
       9,    17,    86,    87,    88,     8,     9,    10,    11,    12,
      13,    16,    18,    33,    35,    37,    45,    80,    81,    82,
      83,    84,    90,    91,    92,    95,     9,    94,    95,     9,
      97,    87,     8,     8,    59,    49,    49,    53,    45,    49,
      91,    95,    45,    95,    95,    95,    95,    51,    53,    20,
      21,    22,    24,    25,    27,    28,    29,    30,    31,    32,
      35,    37,    39,    41,    43,    51,    19,    51,    49,    49,
      51,    87,    87,    12,    12,    12,    88,    95,    37,    75,
      76,    77,    81,    82,    83,    84,    51,    51,     9,    47,
       9,    92,    95,    95,    95,    95,    95,    95,    95,    95,
      95,    95,    95,    95,    95,    95,    95,    95,    45,    80,
      55,    73,    74,    75,    78,    49,    49,    37,    51,    51,
      47,    82,    83,    47,    87,    51,    37,    76,    79,    83,
      51,    53,    73,    59,    95,    12,    47,    53,    74,    51,
      17,    71,    72,    95,    51,    61,    51,    79,    49,    53,
      61,    49,    49,    57,    95,    72,    51,    95,    79,    57
  };

#if YYDEBUG
  /* TOKEN_NUMBER_[YYLEX-NUM] -- Internal symbol number corresponding
     to YYLEX-NUM.  */
  const unsigned short int
  ct_parser::yytoken_number_[] =
  {
         0,   256,   257,   258,   259,   260,   261,   262,   263,   264,
     265,   266,   267,   268,   269,   270,   271,   272,   273,   274,
     275,   276,   277,    62,   278,   279,    60,   280,   281,   282,
     283,   284,   285,   286,    33,   287,    43,   288,    45,   289,
      42,   290,    47,   291,    37,   292,    40,   293,    41,   294,
      58,   295,    59,   296,    44,   297,    91,   298,    93,   299,
     123,   300,   125,   301,   302
  };
#endif

  /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives.  */
  const unsigned char
  ct_parser::yyr1_[] =
  {
         0,    65,    66,    67,    67,    68,    68,    68,    68,    68,
      69,    69,    70,    70,    70,    70,    70,    71,    71,    72,
      72,    73,    73,    74,    74,    75,    75,    75,    75,    75,
      75,    76,    77,    78,    78,    79,    79,    80,    80,    80,
      80,    81,    82,    83,    84,    85,    85,    86,    86,    87,
      87,    88,    88,    89,    89,    90,    90,    90,    90,    91,
      91,    92,    93,    93,    94,    94,    95,    95,    95,    95,
      95,    95,    95,    95,    95,    95,    95,    95,    95,    95,
      95,    95,    95,    95,    95,    95,    95,    95,    95,    95,
      96,    96,    97
  };

  /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN.  */
  const unsigned char
  ct_parser::yyr2_[] =
  {
         0,     2,     1,     1,     2,     1,     1,     1,     1,     1,
       1,     2,     3,     5,     6,     6,     8,     1,     3,     3,
       3,     1,     3,     1,     1,     1,     1,     1,     1,     1,
       1,     2,     2,     5,     7,     1,     1,     1,     1,     1,
       1,     1,     1,     1,     1,     1,     2,     4,     4,     1,
       3,     1,     6,     1,     2,     2,     3,     2,     3,     1,
       3,     3,     1,     2,     2,     6,     3,     3,     3,     3,
       3,     3,     3,     3,     3,     3,     3,     2,     3,     3,
       3,     3,     3,     2,     2,     1,     1,     4,     3,     4,
       1,     2,     4
  };

#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
  /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
     First, the terminals, then, starting at \a yyntokens_, nonterminals.  */
  const char*
  const ct_parser::yytname_[] =
  {
    "\"end of file\"", "error", "$undefined", "\"[PARAMETERS]\"",
  "\"[STRENGTHS]\"", "\"[SEEDS]\"", "\"[CONSTRAINTS]\"", "\"[OPTIONS]\"",
  "\"type specifier\"", "\"parameter name\"", "\"string value\"",
  "\"double value\"", "\"integer value\"", "\"bool value\"", "\"__aux__\"",
  "\"__auto__\"", "\"__starter__\"", "\"default\"", "\"#\"", "\"##\"",
  "\"==\"", "\"!=\"", "TKN_GT", "'>'", "\">=\"", "TKN_LT", "'<'", "\"<=\"",
  "\"&&\"", "\"||\"", "\"^^\"", "\"->\"", "\"<->\"", "TKN_NOT", "'!'",
  "TKN_ADD", "'+'", "TKN_SUB", "'-'", "TKN_MULT", "'*'", "TKN_DIV", "'/'",
  "TKN_MOD", "'%'", "TKN_BRACKET_O", "'('", "TKN_BRACKET_C", "')'",
  "TKN_COLON", "':'", "TKN_SEMICOLON", "';'", "TKN_COMMA", "','",
  "TKN_CORNER_BRACKET_O", "'['", "TKN_CORNER_BRACKET_C", "']'",
  "TKN_CURLY_BRACKET_O", "'{'", "TKN_CURLY_BRACKET_C", "'}'", "TKN_UPLUS",
  "TKN_NEG", "$accept", "input", "sections", "section",
  "parameters_section", "parameters_line", "auto_value_cases",
  "auto_value_case", "ps_set", "ps_values", "ps_value", "neg_value_i",
  "neg_value_d", "range", "range_int_val", "value", "value_s", "value_d",
  "value_i", "value_b", "strengths_section", "strengths_line",
  "param_list", "param_list_item", "seeds_section", "seeds_line", "tuple",
  "tuple_item", "constraints_section", "constraints_line", "tree_obj",
  "options_section", "options_line", 0
  };
#endif

#if YYDEBUG
  /* YYRHS -- A `-1'-separated list of the rules' RHS.  */
  const ct_parser::rhs_number_type
  ct_parser::yyrhs_[] =
  {
        66,     0,    -1,    67,    -1,    68,    -1,    67,    68,    -1,
      69,    -1,    85,    -1,    89,    -1,    93,    -1,    96,    -1,
       3,    -1,    69,    70,    -1,     8,    87,    51,    -1,     8,
      87,    49,    73,    51,    -1,    14,     8,    87,    49,    73,
      51,    -1,    15,     8,    87,    49,    95,    51,    -1,    15,
       8,    87,    49,    59,    71,    61,    51,    -1,    72,    -1,
      71,    53,    72,    -1,    95,    49,    95,    -1,    17,    49,
      95,    -1,    74,    -1,    73,    53,    74,    -1,    78,    -1,
      75,    -1,    81,    -1,    83,    -1,    82,    -1,    84,    -1,
      76,    -1,    77,    -1,    37,    83,    -1,    37,    82,    -1,
      55,    79,    53,    79,    57,    -1,    55,    79,    53,    79,
      49,    79,    57,    -1,    83,    -1,    76,    -1,    81,    -1,
      83,    -1,    82,    -1,    84,    -1,    10,    -1,    11,    -1,
      12,    -1,    13,    -1,     4,    -1,    85,    86,    -1,    87,
      49,    12,    51,    -1,    17,    49,    12,    51,    -1,    88,
      -1,    87,    53,    88,    -1,     9,    -1,     9,    59,    12,
      37,    12,    61,    -1,     5,    -1,    89,    90,    -1,    91,
      51,    -1,    16,    91,    51,    -1,    95,    51,    -1,    16,
      95,    51,    -1,    92,    -1,    91,    53,    92,    -1,     9,
      49,    75,    -1,     6,    -1,    93,    94,    -1,    95,    51,
      -1,    95,    19,    45,    87,    47,    51,    -1,    95,    20,
      95,    -1,    95,    21,    95,    -1,    95,    22,    95,    -1,
      95,    24,    95,    -1,    95,    25,    95,    -1,    95,    27,
      95,    -1,    95,    28,    95,    -1,    95,    29,    95,    -1,
      95,    31,    95,    -1,    95,    32,    95,    -1,    95,    30,
      95,    -1,    33,    95,    -1,    95,    35,    95,    -1,    95,
      37,    95,    -1,    95,    39,    95,    -1,    95,    41,    95,
      -1,    95,    43,    95,    -1,    37,    95,    -1,    35,    95,
      -1,     9,    -1,    80,    -1,     8,    45,    95,    47,    -1,
      45,    95,    47,    -1,    18,    45,     9,    47,    -1,     7,
      -1,    96,    97,    -1,     9,    49,    80,    51,    -1
  };

  /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
     YYRHS.  */
  const unsigned short int
  ct_parser::yyprhs_[] =
  {
         0,     0,     3,     5,     7,    10,    12,    14,    16,    18,
      20,    22,    25,    29,    35,    42,    49,    58,    60,    64,
      68,    72,    74,    78,    80,    82,    84,    86,    88,    90,
      92,    94,    97,   100,   106,   114,   116,   118,   120,   122,
     124,   126,   128,   130,   132,   134,   136,   139,   144,   149,
     151,   155,   157,   164,   166,   169,   172,   176,   179,   183,
     185,   189,   193,   195,   198,   201,   208,   212,   216,   220,
     224,   228,   232,   236,   240,   244,   248,   252,   255,   259,
     263,   267,   271,   275,   278,   281,   283,   285,   290,   294,
     299,   301,   304
  };

  /* YYRLINE[YYN] -- Source line where rule number YYN was defined.  */
  const unsigned short int
  ct_parser::yyrline_[] =
  {
         0,   141,   141,   146,   147,   149,   150,   151,   152,   153,
     155,   156,   163,   182,   201,   221,   241,   258,   266,   275,
     282,   292,   293,   295,   296,   298,   299,   300,   301,   302,
     303,   305,   313,   321,   343,   368,   369,   371,   372,   373,
     374,   377,   385,   395,   404,   411,   412,   415,   420,   426,
     427,   430,   431,   441,   442,   445,   449,   454,   460,   468,
     477,   487,   489,   490,   492,   493,   497,   498,   499,   500,
     501,   502,   504,   505,   506,   507,   508,   509,   511,   512,
     513,   514,   515,   516,   517,   519,   520,   521,   522,   523,
     525,   526,   528
  };

  // Print the state stack on the debug stream.
  void
  ct_parser::yystack_print_ ()
  {
    *yycdebug_ << "Stack now";
    for (state_stack_type::const_iterator i = yystate_stack_.begin ();
         i != yystate_stack_.end (); ++i)
      *yycdebug_ << ' ' << *i;
    *yycdebug_ << std::endl;
  }

  // Report on the debug stream that the rule \a yyrule is going to be reduced.
  void
  ct_parser::yy_reduce_print_ (int yyrule)
  {
    unsigned int yylno = yyrline_[yyrule];
    int yynrhs = yyr2_[yyrule];
    /* Print the symbols being reduced, and their result.  */
    *yycdebug_ << "Reducing stack by rule " << yyrule - 1
               << " (line " << yylno << "):" << std::endl;
    /* The symbols being reduced.  */
    for (int yyi = 0; yyi < yynrhs; yyi++)
      YY_SYMBOL_PRINT ("   $" << yyi + 1 << " =",
                       yyrhs_[yyprhs_[yyrule] + yyi],
                       &(yysemantic_stack_[(yynrhs) - (yyi + 1)]),
                       &(yylocation_stack_[(yynrhs) - (yyi + 1)]));
  }
#endif // YYDEBUG

  /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX.  */
  ct_parser::token_number_type
  ct_parser::yytranslate_ (int t)
  {
    static
    const token_number_type
    translate_table[] =
    {
           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,    34,     2,     2,     2,    44,     2,     2,
      46,    48,    40,    36,    54,    38,     2,    42,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,    50,    52,
      26,     2,    23,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,    56,     2,    58,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,    60,     2,    62,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     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,    24,    25,
      27,    28,    29,    30,    31,    32,    33,    35,    37,    39,
      41,    43,    45,    47,    49,    51,    53,    55,    57,    59,
      61,    63,    64
    };
    if ((unsigned int) t <= yyuser_token_number_max_)
      return translate_table[t];
    else
      return yyundef_token_;
  }

  const int ct_parser::yyeof_ = 0;
  const int ct_parser::yylast_ = 455;
  const int ct_parser::yynnts_ = 33;
  const int ct_parser::yyempty_ = -2;
  const int ct_parser::yyfinal_ = 14;
  const int ct_parser::yyterror_ = 1;
  const int ct_parser::yyerrcode_ = 256;
  const int ct_parser::yyntokens_ = 65;

  const unsigned int ct_parser::yyuser_token_number_max_ = 302;
  const ct_parser::token_number_type ct_parser::yyundef_token_ = 2;


} // yy

/* Line 1136 of lalr1.cc  */
#line 1960 "ct_parser.tab.cpp"


/* Line 1138 of lalr1.cc  */
#line 530 "ct_parser.ypp"


#include <iostream>
yy::ct_parser::token_type
yylex(yy::ct_parser::semantic_type *yylval, yy::ct_parser::location_type *yylloc, ct::lexer &qlex) {
  ct::lexer_Token* token;
  qlex.receive(&token);
  if (token->get_text().length()>0)
  {
    yylval->str = new std::string((char *)token->get_text().c_str());
    yylloc->step();
    yylloc->end.line = token->line_number();
    yylloc->end.column = token->column_number()+token->get_text().length();
  }
  return (yy::ct_parser::token_type)token->type_id();
}

void yy::ct_parser::error(const yy::ct_parser::location_type &loc, const std::string &s) {
  std::stringstream ss;
  ss << loc.begin.line << ":" << loc.begin.column << "-" << loc.end.line << ":" << loc.end.column << ": " << s;
  assembler.reportError(ss.str());
}