dbcompare_sortorder_parser.cc

Go to the documentation of this file.

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

/* Skeleton implementation for Bison LALR(1) parsers in C++

   Copyright (C) 2002, 2003, 2004, 2005, 2006 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., 51 Franklin Street, Fifth Floor,
   Boston, MA 02110-1301, USA.  */

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

// Take the name prefix into account.
#define yylex   coco_api_internallex

#include "dbcompare_sortorder_parser.hh"

/* User implementation prologue.  */
#line 68 "dbcompare_sortorder_parser.y"

#include "dbcompare_sortorder_scanner.hh"
#undef yylex
#define yylex scanner.yylex

namespace coco_api_internal {
  using namespace coco;

  void dbcompare_sortorder_parser::error(const location_type& l, const std::string& m)
  {
    if (errormsg.empty())
      errormsg = m;
  }
}


/* Line 317 of lalr1.cc.  */
#line 60 "dbcompare_sortorder_parser.cc"

#ifndef YY_
# if 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

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

/* A pseudo ostream that takes yydebug_ into account.  */
# define YYCDEBUG                                                       \
  for (bool yydebugcond_ = yydebug_; yydebugcond_; yydebugcond_ = false)        \
    (*yycdebug_)

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

# 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 YY_SYMBOL_PRINT(Title, Type, Value, Location)
# define YY_REDUCE_PRINT(Rule)
# define YY_STACK_PRINT()

#endif /* !YYDEBUG */

#define YYACCEPT        goto yyacceptlab
#define YYABORT         goto yyabortlab
#define YYERROR         goto yyerrorlab

namespace coco_api_internal
{
#if YYERROR_VERBOSE

  /* 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
  dbcompare_sortorder_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;
  }

#endif

  dbcompare_sortorder_parser::dbcompare_sortorder_parser (coco_api_internal::dbcompare_sortorder_scanner &scanner_yyarg, std::map<int,std::triple<std::string, coco::dbc_method, coco::basic_alltype> > &cols_yyarg, std::vector<int> &order_yyarg, int &map_index_yyarg, std::string &errormsg_yyarg)
    : yydebug_ (false),
      yycdebug_ (&std::cerr),
      scanner (scanner_yyarg),
      cols (cols_yyarg),
      order (order_yyarg),
      map_index (map_index_yyarg),
      errormsg (errormsg_yyarg)
  {
  }

  dbcompare_sortorder_parser::~dbcompare_sortorder_parser ()
  {
  }

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

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


  void
  dbcompare_sortorder_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 /* ! YYDEBUG */

  void
  dbcompare_sortorder_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)
      {
        case 10: /* "VARNAME" */
#line 64 "dbcompare_sortorder_parser.y"
        { delete (yyvaluep->varname); };
#line 224 "dbcompare_sortorder_parser.cc"
        break;

        default:
          break;
      }
  }

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

  std::ostream&
  dbcompare_sortorder_parser::debug_stream () const
  {
    return *yycdebug_;
  }

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


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

  void
  dbcompare_sortorder_parser::set_debug_level (debug_level_type l)
  {
    yydebug_ = l;
  }


  int
  dbcompare_sortorder_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 yyerror_range[2];

    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;
    goto yybackup;

    /* Backup.  */
  yybackup:

    /* Try to take a decision without look-ahead.  */
    yyn = yypact_[yystate];
    if (yyn == yypact_ninf_)
      goto yydefault;

    /* Read a look-ahead token.  */
    if (yychar == yyempty_)
      {
        YYCDEBUG << "Reading a token: ";
        yychar = yylex (&yylval);
      }


    /* 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 (yyn == 0 || yyn == yytable_ninf_)
        goto yyerrlab;
        yyn = -yyn;
        goto yyreduce;
      }

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

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

    /* Discard the token being shifted unless it is eof.  */
    if (yychar != yyeof_)
      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 86 "dbcompare_sortorder_parser.y"
    {
               order.push_back((yysemantic_stack_[(3) - (3)].sort_expr));
             ;}
    break;

  case 3:
#line 89 "dbcompare_sortorder_parser.y"
    {
               order.push_back((yysemantic_stack_[(1) - (1)].sort_expr));
             ;}
    break;

  case 4:
#line 94 "dbcompare_sortorder_parser.y"
    {
              (yyval.sort_expr) = map_index;
              cols[map_index++] = std::triple<std::string, dbc_method, basic_alltype>(*(yysemantic_stack_[(2) - (1)].varname), dbc_sort_max, basic_alltype());
            ;}
    break;

  case 5:
#line 98 "dbcompare_sortorder_parser.y"
    {
              (yyval.sort_expr) = map_index;
              cols[map_index++] = std::triple<std::string, dbc_method, basic_alltype>(*(yysemantic_stack_[(2) - (1)].varname), dbc_sort_min, basic_alltype());
            ;}
    break;

  case 6:
#line 102 "dbcompare_sortorder_parser.y"
    {
              (yyval.sort_expr) = map_index;
              cols[map_index++] = std::triple<std::string, dbc_method, basic_alltype>(*(yysemantic_stack_[(2) - (1)].varname), dbc_sort_true, basic_alltype());
            ;}
    break;

  case 7:
#line 106 "dbcompare_sortorder_parser.y"
    {
              (yyval.sort_expr) = map_index;
              cols[map_index++] = std::triple<std::string, dbc_method, basic_alltype>(*(yysemantic_stack_[(2) - (1)].varname), dbc_sort_false, basic_alltype());
            ;}
    break;

  case 8:
#line 110 "dbcompare_sortorder_parser.y"
    {
              (yyval.sort_expr) = map_index;
              cols[map_index++] = std::triple<std::string, dbc_method, basic_alltype>(*(yysemantic_stack_[(1) - (1)].varname), dbc_sort_max, basic_alltype());
            ;}
    break;

  case 9:
#line 114 "dbcompare_sortorder_parser.y"
    {
              (yyval.sort_expr) = map_index;
              cols[map_index++] = std::triple<std::string, dbc_method, basic_alltype>(*(yysemantic_stack_[(4) - (2)].varname), dbc_sort_absmax, basic_alltype());
            ;}
    break;

  case 10:
#line 118 "dbcompare_sortorder_parser.y"
    {
              (yyval.sort_expr) = map_index;
              cols[map_index++] = std::triple<std::string, dbc_method, basic_alltype>(*(yysemantic_stack_[(4) - (2)].varname), dbc_sort_absmin, basic_alltype());
            ;}
    break;

  case 11:
#line 122 "dbcompare_sortorder_parser.y"
    {
              (yyval.sort_expr) = map_index;
              cols[map_index++] = std::triple<std::string, dbc_method, basic_alltype>(*(yysemantic_stack_[(3) - (2)].varname), dbc_sort_absmax, basic_alltype());
            ;}
    break;


    /* Line 675 of lalr1.cc.  */
#line 493 "dbcompare_sortorder_parser.cc"
        default: break;
      }
    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:
    /* If not already recovering from an error, report this error.  */
    if (!yyerrstatus_)
      {
        ++yynerrs_;
        error (yylloc, yysyntax_error_ (yystate));
      }

    yyerror_range[0] = yylloc;
    if (yyerrstatus_ == 3)
      {
        /* If just tried and failed to reuse look-ahead 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 look-ahead 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[0] = 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 (yyn != yypact_ninf_)
        {
          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[0] = yylocation_stack_[0];
        yydestruct_ ("Error: popping",
                     yystos_[yystate],
                     &yysemantic_stack_[0], &yylocation_stack_[0]);
        yypop_ ();
        yystate = yystate_stack_[0];
        YY_STACK_PRINT ();
      }

    if (yyn == yyfinal_)
      goto yyacceptlab;

    yyerror_range[1] = yylloc;
    // Using YYLLOC is tempting, but would change the location of
    // the look-ahead.  YYLOC is available though.
    YYLLOC_DEFAULT (yyloc, (yyerror_range - 1), 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 != yyeof_ && yychar != yyempty_)
      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
  dbcompare_sortorder_parser::yysyntax_error_ (int yystate)
  {
    std::string res;
    YYUSE (yystate);
#if YYERROR_VERBOSE
    int yyn = yypact_[yystate];
    if (yypact_ninf_ < yyn && yyn <= yylast_)
      {
        /* Start YYX at -YYN if negative to avoid negative indexes in
           YYCHECK.  */
        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_;
        int count = 0;
        for (int x = yyxbegin; x < yyxend; ++x)
          if (yycheck_[x + yyn] == x && x != yyterror_)
            ++count;

        // FIXME: This method of building the message is not compatible
        // with internationalization.  It should work like yacc.c does it.
        // That is, first build a string that looks like this:
        // "syntax error, unexpected %s or %s or %s"
        // Then, invoke YY_ on this string.
        // Finally, use the string as a format to output
        // yytname_[tok], etc.
        // Until this gets fixed, this message appears in English only.
        res = "syntax error, unexpected ";
        res += yytnamerr_ (yytname_[tok]);
        if (count < 5)
          {
            count = 0;
            for (int x = yyxbegin; x < yyxend; ++x)
              if (yycheck_[x + yyn] == x && x != yyterror_)
                {
                  res += (!count++) ? ", expecting " : " or ";
                  res += yytnamerr_ (yytname_[x]);
                }
          }
      }
    else
#endif
      res = YY_("syntax error");
    return res;
  }


  /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
     STATE-NUM.  */
  const signed char dbcompare_sortorder_parser::yypact_ninf_ = -4;
  const signed char
  dbcompare_sortorder_parser::yypact_[] =
  {
         1,     3,    -2,     0,    -4,     4,    -4,    -4,    -4,    -4,
      -4,     1,     2,    -4,    -4,    -4
  };

  /* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE
     doesn't specify something else to do.  Zero means the default is an
     error.  */
  const unsigned char
  dbcompare_sortorder_parser::yydefact_[] =
  {
         0,     0,     8,     0,     3,     0,     4,     5,     6,     7,
       1,     0,    11,     2,     9,    10
  };

  /* YYPGOTO[NTERM-NUM].  */
  const signed char
  dbcompare_sortorder_parser::yypgoto_[] =
  {
        -4,    -4,    -3
  };

  /* YYDEFGOTO[NTERM-NUM].  */
  const signed char
  dbcompare_sortorder_parser::yydefgoto_[] =
  {
        -1,     3,     4
  };

  /* 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 zero, do what YYDEFACT says.  */
  const signed char dbcompare_sortorder_parser::yytable_ninf_ = -1;
  const unsigned char
  dbcompare_sortorder_parser::yytable_[] =
  {
        10,     6,     7,     8,     9,    14,    15,    11,    13,     1,
       0,     2,    12,     5
  };

  /* YYCHECK.  */
  const signed char
  dbcompare_sortorder_parser::yycheck_[] =
  {
         0,     3,     4,     5,     6,     3,     4,     7,    11,     8,
      -1,    10,     8,    10
  };

  /* STOS_[STATE-NUM] -- The (internal number of the) accessing
     symbol of state STATE-NUM.  */
  const unsigned char
  dbcompare_sortorder_parser::yystos_[] =
  {
         0,     8,    10,    12,    13,    10,     3,     4,     5,     6,
       0,     7,     8,    13,     3,     4
  };

#if YYDEBUG
  /* TOKEN_NUMBER_[YYLEX-NUM] -- Internal symbol number corresponding
     to YYLEX-NUM.  */
  const unsigned short int
  dbcompare_sortorder_parser::yytoken_number_[] =
  {
         0,   256,   257,   258,   259,   260,   261,   262,   263,   264,
     265
  };
#endif

  /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives.  */
  const unsigned char
  dbcompare_sortorder_parser::yyr1_[] =
  {
         0,    11,    12,    12,    13,    13,    13,    13,    13,    13,
      13,    13
  };

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

#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 dbcompare_sortorder_parser::yytname_[] =
  {
    "$end", "error", "$undefined", "SORT_MAX", "SORT_MIN", "SORT_TRUE",
  "SORT_FALSE", "COMMA", "OP_ABS", "SCAN_ERROR", "VARNAME", "$accept",
  "sortorder", "sort_expr", 0
  };
#endif

#if YYDEBUG
  /* YYRHS -- A `-1'-separated list of the rules' RHS.  */
  const dbcompare_sortorder_parser::rhs_number_type
  dbcompare_sortorder_parser::yyrhs_[] =
  {
        12,     0,    -1,    12,     7,    13,    -1,    13,    -1,    10,
       3,    -1,    10,     4,    -1,    10,     5,    -1,    10,     6,
      -1,    10,    -1,     8,    10,     8,     3,    -1,     8,    10,
       8,     4,    -1,     8,    10,     8,    -1
  };

  /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
     YYRHS.  */
  const unsigned char
  dbcompare_sortorder_parser::yyprhs_[] =
  {
         0,     0,     3,     7,     9,    12,    15,    18,    21,    23,
      28,    33
  };

  /* YYRLINE[YYN] -- Source line where rule number YYN was defined.  */
  const unsigned char
  dbcompare_sortorder_parser::yyrline_[] =
  {
         0,    86,    86,    89,    94,    98,   102,   106,   110,   114,
     118,   122
  };

  // Print the state stack on the debug stream.
  void
  dbcompare_sortorder_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
  dbcompare_sortorder_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 << "), ";
    /* 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.  */
  dbcompare_sortorder_parser::token_number_type
  dbcompare_sortorder_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,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     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
    };
    if ((unsigned int) t <= yyuser_token_number_max_)
      return translate_table[t];
    else
      return yyundef_token_;
  }

  const int dbcompare_sortorder_parser::yyeof_ = 0;
  const int dbcompare_sortorder_parser::yylast_ = 13;
  const int dbcompare_sortorder_parser::yynnts_ = 3;
  const int dbcompare_sortorder_parser::yyempty_ = -2;
  const int dbcompare_sortorder_parser::yyfinal_ = 10;
  const int dbcompare_sortorder_parser::yyterror_ = 1;
  const int dbcompare_sortorder_parser::yyerrcode_ = 256;
  const int dbcompare_sortorder_parser::yyntokens_ = 11;

  const unsigned int dbcompare_sortorder_parser::yyuser_token_number_max_ = 265;
  const dbcompare_sortorder_parser::token_number_type dbcompare_sortorder_parser::yyundef_token_ = 2;

} // namespace coco_api_internal

---