/Users/deen/code/yugabyte-db/build/debugcov-clang-dynamic-arm64-ninja/src/yb/yql/cql/ql/parser/scanner_lex.l.cc

Source (jump to first uncovered line)
#line 1 "/Users/deen/code/yugabyte-db/build/debugcov-clang-dynamic-arm64-ninja/src/yb/yql/cql/ql/parser/scanner_lex.l.cc"

#line 3 "/Users/deen/code/yugabyte-db/build/debugcov-clang-dynamic-arm64-ninja/src/yb/yql/cql/ql/parser/scanner_lex.l.cc"

#define  YY_INT_ALIGNED short int

/* A lexical scanner generated by flex */

#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 6
#define YY_FLEX_SUBMINOR_VERSION 3
#if YY_FLEX_SUBMINOR_VERSION > 0
#define FLEX_BETA
#endif

    /* The c++ scanner is a mess. The FlexLexer.h header file relies on the
     * following macro. This is required in order to pass the c++-multiple-scanners
     * test in the regression suite. We get reports that it breaks inheritance.
     * We will address this in a future release of flex, or omit the C++ scanner
     * altogether.
     */
    #define yyFlexLexer yyFlexLexer

    #define yyalloc yyalloc

    #define yyrealloc yyrealloc

    #define yyfree yyfree

/* First, we deal with  platform-specific or compiler-specific issues. */

/* begin standard C headers. */

/* end standard C headers. */

/* flex integer type definitions */

#ifndef FLEXINT_H
#define FLEXINT_H

/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */

#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L

/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
 * if you want the limit (max/min) macros for int types. 
 */
#ifndef __STDC_LIMIT_MACROS
#define __STDC_LIMIT_MACROS 1
#endif

#include <inttypes.h>
typedef int8_t flex_int8_t;
typedef uint8_t flex_uint8_t;
typedef int16_t flex_int16_t;
typedef uint16_t flex_uint16_t;
typedef int32_t flex_int32_t;
typedef uint32_t flex_uint32_t;
#else
typedef signed char flex_int8_t;
typedef short int flex_int16_t;
typedef int flex_int32_t;
typedef unsigned char flex_uint8_t; 
typedef unsigned short int flex_uint16_t;
typedef unsigned int flex_uint32_t;

/* Limits of integral types. */
#ifndef INT8_MIN
#define INT8_MIN               (-128)
#endif
#ifndef INT16_MIN
#define INT16_MIN              (-32767-1)
#endif
#ifndef INT32_MIN
#define INT32_MIN              (-2147483647-1)
#endif
#ifndef INT8_MAX
#define INT8_MAX               (127)
#endif
#ifndef INT16_MAX
#define INT16_MAX              (32767)
#endif
#ifndef INT32_MAX
#define INT32_MAX              (2147483647)
#endif
#ifndef UINT8_MAX
#define UINT8_MAX              (255U)
#endif
#ifndef UINT16_MAX
#define UINT16_MAX             (65535U)
#endif
#ifndef UINT32_MAX
#define UINT32_MAX             (4294967295U)
#endif

#endif /* ! C99 */

#endif /* ! FLEXINT_H */

/* begin standard C++ headers. */
#include <iostream>
#include <errno.h>
#include <cstdlib>
#include <cstdio>
#include <cstring>
/* end standard C++ headers. */

/* TODO: this is always defined, so inline it */
#define yyconst const

#if defined(__GNUC__) && __GNUC__ >= 3
#define yynoreturn __attribute__((__noreturn__))
#else
#define yynoreturn
#endif

/* Returned upon end-of-file. */
#define YY_NULL 0

/* Promotes a possibly negative, possibly signed char to an
 *   integer in range [0..255] for use as an array index.
 */
#define YY_SC_TO_UI(c) ((YY_CHAR) (c))

/* Enter a start condition.  This macro really ought to take a parameter,
 * but we do it the disgusting crufty way forced on us by the ()-less
 * definition of BEGIN.
 */
#define BEGIN (yy_start) = 1 + 2 *
/* Translate the current start state into a value that can be later handed
 * to BEGIN to return to the state.  The YYSTATE alias is for lex
 * compatibility.
 */
#define YY_START (((yy_start) - 1) / 2)
#define YYSTATE YY_START
/* Action number for EOF rule of a given start state. */
#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
/* Special action meaning "start processing a new file". */
#define YY_NEW_FILE yyrestart( yyin  )
#define YY_END_OF_BUFFER_CHAR 0

/* Size of default input buffer. */
#ifndef YY_BUF_SIZE
#ifdef __ia64__
/* On IA-64, the buffer size is 16k, not 8k.
 * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
 * Ditto for the __ia64__ case accordingly.
 */
#define YY_BUF_SIZE 32768
#else
#define YY_BUF_SIZE 16384
#endif /* __ia64__ */
#endif

/* The state buf must be large enough to hold one state per character in the main buffer.
 */
#define YY_STATE_BUF_SIZE   ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))

#ifndef YY_TYPEDEF_YY_BUFFER_STATE
#define YY_TYPEDEF_YY_BUFFER_STATE
typedef struct yy_buffer_state *YY_BUFFER_STATE;
#endif

#ifndef YY_TYPEDEF_YY_SIZE_T
#define YY_TYPEDEF_YY_SIZE_T
typedef size_t yy_size_t;
#endif

extern int yyleng;

#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2
    
    #define YY_LESS_LINENO(n)
    #define YY_LINENO_REWIND_TO(ptr)
    
/* Return all but the first "n" matched characters back to the input stream. */
#define yyless(n) \
  do \
    { \
    /* Undo effects of setting up yytext. */ \
        int yyless_macro_arg = (n); \
        YY_LESS_LINENO(yyless_macro_arg);\
    *yy_cp = (yy_hold_char); \
    YY_RESTORE_YY_MORE_OFFSET \
    (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
    YY_DO_BEFORE_ACTION; /* set up yytext again */ \
    } \
  while ( 0 )
#define unput(c) yyunput( c, (yytext_ptr)  )

#ifndef YY_STRUCT_YY_BUFFER_STATE
#define YY_STRUCT_YY_BUFFER_STATE
struct yy_buffer_state
  {

  std::streambuf* yy_input_file;

  char *yy_ch_buf;    /* input buffer */
  char *yy_buf_pos;   /* current position in input buffer */

  /* Size of input buffer in bytes, not including room for EOB
   * characters.
   */
  int yy_buf_size;

  /* Number of characters read into yy_ch_buf, not including EOB
   * characters.
   */
  int yy_n_chars;

  /* Whether we "own" the buffer - i.e., we know we created it,
   * and can realloc() it to grow it, and should free() it to
   * delete it.
   */
  int yy_is_our_buffer;

  /* Whether this is an "interactive" input source; if so, and
   * if we're using stdio for input, then we want to use getc()
   * instead of fread(), to make sure we stop fetching input after
   * each newline.
   */
  int yy_is_interactive;

  /* Whether we're considered to be at the beginning of a line.
   * If so, '^' rules will be active on the next match, otherwise
   * not.
   */
  int yy_at_bol;

    int yy_bs_lineno; /**< The line count. */
    int yy_bs_column; /**< The column count. */

  /* Whether to try to fill the input buffer when we reach the
   * end of it.
   */
  int yy_fill_buffer;

  int yy_buffer_status;

#define YY_BUFFER_NEW 0
#define YY_BUFFER_NORMAL 1
  /* When an EOF's been seen but there's still some text to process
   * then we mark the buffer as YY_EOF_PENDING, to indicate that we
   * shouldn't try reading from the input source any more.  We might
   * still have a bunch of tokens to match, though, because of
   * possible backing-up.
   *
   * When we actually see the EOF, we change the status to "new"
   * (via yyrestart()), so that the user can continue scanning by
   * just pointing yyin at a new input file.
   */
#define YY_BUFFER_EOF_PENDING 2

  };
#endif /* !YY_STRUCT_YY_BUFFER_STATE */

/* We provide macros for accessing buffer states in case in the
 * future we want to put the buffer states in a more general
 * "scanner state".
 *
 * Returns the top of the stack, or NULL.
 */
#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \
                          ? (yy_buffer_stack)[(yy_buffer_stack_top)]2.76M \
                          : NULL)
/* Same as previous macro, but useful when we know that the buffer stack is not
 * NULL or when we need an lvalue. For internal use only.
 */
#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]

void *yyalloc ( yy_size_t  );
void *yyrealloc ( void *, yy_size_t  );
void yyfree ( void *  );

#define yy_new_buffer yy_create_buffer
#define yy_set_interactive(is_interactive) \
  { \
  if ( ! YY_CURRENT_BUFFER ){ \
        yyensure_buffer_stack (); \
    YY_CURRENT_BUFFER_LVALUE =    \
            yy_create_buffer( yyin, YY_BUF_SIZE ); \
  } \
  YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
  }
#define yy_set_bol(at_bol) \
  { \
  if ( ! YY_CURRENT_BUFFER ){\
        yyensure_buffer_stack (); \
    YY_CURRENT_BUFFER_LVALUE =    \
            yy_create_buffer( yyin, YY_BUF_SIZE ); \
  } \
  YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
  }
#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)

/* Begin user sect3 */
#define YY_SKIP_YYWRAP
typedef flex_uint8_t YY_CHAR;

#define yytext_ptr yytext

#include <FlexLexer.h>

int yyFlexLexer::yywrap() { return 1; }
int yyFlexLexer::yylex()
  {
  LexerError( "yyFlexLexer::yylex invoked but %option yyclass used" );
  return 0;
  }

#define YY_DECL int yb::ql::LexProcessor::yylex()

/* Done after the current pattern has been matched and before the
 * corresponding action - sets up yytext.
 */
#define YY_DO_BEFORE_ACTION \
  (yytext_ptr) = yy_bp; \
  yyleng = (int) (yy_cp - yy_bp); \
  (yy_hold_char) = *yy_cp; \
  *yy_cp = '\0'; \
  (yy_c_buf_p) = yy_cp;
#define YY_NUM_RULES 84
#define YY_END_OF_BUFFER 85
/* This struct is not used in this scanner,
   but its presence is necessary. */
struct yy_trans_info
  {
  flex_int32_t yy_verify;
  flex_int32_t yy_nxt;
  };
static const flex_int16_t yy_accept[364] =
    {   0,
        0,    0,   13,   13,    0,    0,    0,    0,   12,   12,
        0,    0,    0,    0,    0,    0,    0,    0,   56,   56,
        0,    0,   29,   29,    0,    0,   85,   83,    2,    1,
        1,   72,   50,   72,   83,   71,   20,   71,   71,   71,
       71,   74,   74,   71,   71,   71,   71,   82,   82,   82,
       82,   82,   82,   82,   13,   10,    6,    6,    7,    7,
       59,   52,   12,   17,   33,   33,   23,   43,   32,   23,
       47,   47,   49,   53,   55,   54,   54,   55,   55,   25,
       28,   27,   27,   28,   28,   36,   37,   36,    2,   72,
       70,   44,   73,   45,    2,   64,   62,   75,    3,   75,

       74,    0,   79,   77,   61,   63,   67,   69,   66,   68,
       82,   82,    9,   21,   19,   60,   16,   13,   10,   10,
       11,    6,    8,    5,    4,   59,   58,   12,   17,   17,
       18,   33,   23,   23,   31,   24,   39,   40,   38,   38,
       39,   32,   47,   46,   48,   54,   54,   56,   25,   25,
       26,   27,   27,   29,   38,   38,   45,    2,    2,   65,
       79,    3,   76,   75,   74,    0,   79,   80,   78,   77,
       82,   51,   22,   10,   15,   11,   10,    4,   17,   14,
       18,   17,   23,   42,   24,   23,   40,   38,   38,   41,
       48,   54,   56,   25,   26,   25,   27,   29,   38,   38,

       78,   74,    0,   79,   78,   82,   10,   10,   10,   10,
       17,   17,   17,   17,   23,   23,   23,   23,   40,   38,
       38,   41,   56,   25,   25,   25,   25,   29,   38,   38,
       74,    0,   79,   78,   82,   10,   10,   10,   10,   10,
       17,   17,   17,   17,   17,   23,   23,   23,   23,   23,
       38,   38,   56,   25,   25,   25,   25,   25,   29,   38,
       38,   74,    0,   79,   78,   82,   10,   17,   23,   38,
       34,   56,   25,   29,   38,   35,   74,    0,   79,   78,
       82,   38,   56,   29,   38,   74,    0,   79,   78,   82,
       38,   56,   56,   56,   29,   29,   29,   38,    0,   74,

       80,   38,   56,   56,   29,   29,   38,    0,   78,   57,
       56,   56,   56,   56,   30,   29,   29,   29,   29,    0,
       78,   56,   56,   56,   56,   56,   29,   29,   29,   29,
       29,    0,   78,   56,   56,   29,   29,    0,   78,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,   81,    0
    } ;

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

       29,   28,   30,   30,   30,   30,   30,   30,   30,   31,
       30,   32,   30,   30,   33,   30,   37,   30,   30,   38,
       30,   30,    1,    7,    1,    7,    1,   30,   30,   30,
       30,   30,   30,   30,   30,   30,   30,   30,   30,   30,
       30,   30,   30,   30,   30,   30,   30,   30,   30,   30,
       30,   30,   30,   30,   30,   30,   30,   30,   30,   30,
       30,   30,   30,   30,   30,   30,   30,   30,   30,   30,
       30,   30,   30,   30,   30,   30,   30,   30,   30,   30,
       30,   30,   30,   30,   30,   30,   30,   30,   30,   30,
       30,   30,   30,   30,   30,   30,   30,   30,   30,   30,

       30,   30,   30,   30,   30,   30,   30,   30,   30,   30,
       30,   30,   30,   30,   30,   30,   30,   30,   30,   30,
       30,   30,   30,   30,   30,   30,   30,   30,   30,   30,
       30,   30,   30,   30,   30,   30,   30,   30,   30,   30,
       30,   30,   30,   30,   30,   30,   30,   30,   30,   30,
       30,   30,   30,   30,   30
    } ;

static const YY_CHAR yy_meta[39] =
    {   0,
        1,    1,    2,    2,    3,    4,    3,    5,    3,    3,
        6,    1,    7,    3,    3,    1,    7,    8,    8,    8,
        1,    1,    3,    1,    9,    9,    9,    9,    9,   10,
       10,   10,   10,   10,   10,   11,   10,   10
    } ;

static const flex_int16_t yy_base[461] =
    {   0,
        0,    0,  476,  458,   34,   53,  462,  460,  446,  439,
       39,   42,  436,  435,   51,   53,  425,  419,   77,  113,
      413,  411,  149,  185,   37,   49,  421, 1523,   80,   84,
       87,  391, 1523,    0,   85,    0, 1523, 1523,   31,   78,
      400,  207,   34,   78,   41,  382,  372,  238,  374,  373,
      259,  365,  359,  355,    0,  104,    0,    0,   96,  352,
        0,  354,    0,  118,    0,    0,  121,  108,    0,  152,
        0,    0,  348,  349, 1523,  127,  135,  337,  321,  155,
     1523,  158,  169,  328,  311, 1523, 1523,   37,  172,    0,
        0, 1523,  159,  331,  284,  304, 1523,  162,    0,  174,

      292,    0,  187,    0, 1523, 1523, 1523, 1523, 1523, 1523,
        0,  304, 1523, 1523, 1523,   89, 1523,    0,  193,  209,
      301,    0,  127, 1523,    0,    0, 1523,    0,  213,  236,
      299,    0,  246,  323, 1523,  298, 1523,  116,    0,    0,
        0,    0,    0, 1523,  301,  227,    0,  273,  300,  333,
      290,  250,    0,  267,    0,    0,  288,    0,  344, 1523,
      327,    0, 1523,  263,  352,    0,  368,  344,  134,    0,
      371, 1523, 1523,  390, 1523,  280,  400,    0,  405, 1523,
      275,  408,  415, 1523,  265,  425,  150,    0,    0,    0,
      266,    0,  235,  430,  245,  433,    0,  232,    0,    0,

      355,  433,    0,  424,  170,  445,  452,  473,  476,  479,
      482,  496,  499,  502,  505,  519,  522,  525, 1523,    0,
        0, 1523,  230,  528,  542,  545,  548,  216,    0,    0,
      548,    0,  564,  184,  567,  586,  595,  600,  603,  610,
      617,  620,  625,  635,  639,  642,  645,  659,  649,  663,
        0,    0,  205,  669,  673,  678,  683,  688,  189,    0,
        0,  688,    0,  681,  195,  700,  707,  728,  731,    0,
     1523,  189,  734,  185,    0, 1523,  734,    0,  750,  229,
      753,    0,  772,  782,    0,  783,  189,  776,  789,  150,
        0,  811,    0,  128,  814,    0,  126,    0,    0,  812,

      535,    0,  107,  831,  101,  834,    0,    0,  551, 1523,
      848,  851,  854,  868, 1523,  871,  874,  888,  891,    0,
      721,  894,  908,  911,  914,  928,  931,  934,  948,  951,
      954,    0,  737,  968,    0,  971,    0,   95,  969,    0,
        0,    0,    0,   87,    0,    0,    0,    0,   62,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0, 1523, 1523,  989, 1000, 1011, 1022, 1033, 1044, 1055,
     1066, 1077, 1088, 1097, 1100, 1110, 1121, 1132, 1143, 1154,
     1164, 1175, 1186, 1193, 1199, 1209, 1218, 1218, 1220, 1227,
     1227, 1229, 1231, 1236, 1246, 1257, 1261, 1263, 1265, 1274,

     1285, 1296, 1300, 1302, 1304, 1313, 1317, 1319, 1321, 1330,
     1341, 1352, 1356, 1358, 1367, 1371, 1373, 1375, 1377, 1379,
     1381, 1383, 1385, 1387, 1389, 1391, 1393, 1395, 1397, 1406,
     1417, 1421, 1423, 1432, 1443, 1447, 1456, 1467, 1471, 1473,
     1475, 1477, 1479, 1481, 1483, 1485, 1487, 1489, 1491, 1493,
     1495, 1497, 1499, 1501, 1503, 1505, 1507, 1509, 1511, 1513
    } ;

static const flex_int16_t yy_def[461] =
    {   0,
      363,    1,  364,  364,  365,  365,  366,  366,  367,  367,
      368,  368,  369,  369,  370,  370,  366,  366,  371,  371,
      369,  369,  372,  372,  373,  373,  363,  363,  363,  363,
      363,  374,  363,  374,  375,  374,  363,  363,  374,  363,
      374,  363,   42,  363,  363,  374,  363,  363,   48,   48,
       48,   51,   51,   51,  376,  363,  377,  377,  363,  363,
      378,  363,  379,  363,  380,  380,  363,  381,  382,  363,
      383,  383,  384,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  374,
      374,  363,  363,  385,  386,  363,  363,  363,  387,  363,

      363,  388,  388,  389,  363,  363,  363,  363,  363,  363,
       51,   51,  363,  363,  363,  363,  363,  376,  363,  363,
      363,  377,  363,  363,  390,  378,  363,  379,  363,  363,
      363,  380,  363,  363,  363,  363,  363,  363,  391,  392,
      393,  382,  383,  363,  394,  363,  395,  363,  363,  363,
      363,  363,  396,  363,  397,  398,  385,  386,  386,  363,
      363,  387,  363,  363,  363,  399,  399,  363,  167,  389,
       51,  363,  363,  363,  363,  363,  400,  390,  363,  363,
      363,  401,  363,  363,  363,  402,  363,  403,  404,  405,
      394,  395,  363,  363,  363,  406,  396,  363,  407,  408,

      363,  363,  409,  409,  204,   51,  410,  400,  400,  400,
      411,  401,  401,  401,  412,  402,  402,  402,  363,  413,
      414,  363,  363,  415,  406,  406,  406,  363,  416,  417,
      363,  418,  418,  233,   51,  410,  410,  363,  410,  400,
      411,  411,  363,  411,  401,  412,  412,  363,  412,  402,
      419,  420,  363,  415,  415,  363,  415,  406,  363,  421,
      422,  363,  423,  423,  264,   51,  410,  411,  412,  424,
      363,  363,  415,  363,  425,  363,  363,  426,  426,  279,
       51,  427,  363,  363,  428,  363,  363,  363,  363,   51,
      429,  363,  430,  363,  363,  431,  363,  432,  433,  363,

      433,  420,  363,  434,  363,  435,  422,  436,  436,  363,
      434,  434,  437,  434,  363,  435,  435,  438,  435,  439,
      439,  434,  434,  363,  434,  434,  435,  435,  363,  435,
      435,  440,  440,  437,  430,  438,  431,  363,  363,  441,
      442,  443,  444,  363,  445,  446,  447,  448,  363,  449,
      450,  451,  452,  453,  454,  455,  456,  457,  458,  459,
      460,  363,    0,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  363,

      363,  363,  363,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  363
    } ;

static const flex_int16_t yy_nxt[1562] =
    {   0,
       28,   29,   30,   31,   32,   33,   34,   35,   36,   34,
       37,   38,   36,   36,   39,   40,   41,   42,   43,   43,
       44,   45,   46,   47,   48,   49,   48,   48,   50,   51,
       52,   51,   51,   53,   54,   28,   53,   54,   58,   87,
       58,   66,   58,   58,   66,   95,   59,   58,   58,   67,
       60,   87,   67,   72,   96,   72,   58,   58,   73,   58,
       73,   58,   58,  107,  108,   59,   58,   58,  363,   60,
      155,  363,   88,  156,   68,   58,  350,   68,   76,   77,
       76,   89,   89,   89,   88,   89,   89,   89,   89,   89,
       89,   78,   92,   97,  172,   98,   98,   98,  105,  173,

      106,  345,   93,   93,   93,  119,  120,  120,  123,  340,
       79,  315,  124,   79,   76,   77,   76,  310,  121,  129,
      130,  130,  133,  134,  134,  138,  138,   78,  146,  146,
      146,  135,  131,  187,  187,  136,  146,  146,  146,  123,
      306,  139,  304,  124,  140,  141,   79,  363,  363,   79,
       82,   83,   82,  133,  134,  134,  149,  150,  150,  152,
      152,  152,  135,   84,  299,  135,  136,  219,  219,  151,
      152,  152,  152,   89,   89,   89,   93,   93,   93,   98,
       98,   98,   85,  363,  363,   85,   82,   83,   82,  163,
      161,  164,  164,  164,  119,  120,  120,  363,  363,   84,

      168,  168,  161,  299,  169,  169,  169,  121,  363,  363,
      174,  174,  174,  284,  129,  130,  130,  283,   85,  175,
      274,   85,  100,  176,  101,  101,  101,  131,  146,  146,
      146,  102,  102,  102,  102,  103,  272,  179,  179,  179,
      259,  104,  363,  363,  104,  111,  180,  133,  134,  134,
      181,  152,  152,  152,  253,  112,  112,  112,  228,  224,
      136,  223,  112,  112,  112,  112,  112,  111,  111,  111,
      111,  111,  111,  144,  111,  111,  111,  111,  111,  215,
      164,  164,  164,  111,  111,  111,  111,  111,  159,  211,
      159,  161,  159,  159,  207,   92,  159,  159,  159,  198,

      159,  149,  150,  150,  196,  193,  159,  100,  144,  165,
      165,  165,  186,  182,  151,  177,  166,  166,  166,  166,
      167,  171,  171,  171,  183,  183,  183,  160,  171,  171,
      171,  171,  171,  184,  194,  194,  194,  185,   92,  154,
      168,  168,  153,  184,  201,  201,  201,  195,  159,  148,
      159,  147,  159,  159,  127,  144,  159,  159,  159,  127,
      159,  201,  201,  201,  125,  117,  159,  100,  116,  202,
      202,  202,  201,  201,  201,  115,  203,  203,  203,  203,
      204,  168,  168,  114,  113,  205,  205,  205,  206,  206,
      206,  174,  174,  174,  110,  206,  206,  206,  206,  206,

      175,  209,  120,  120,  176,  109,  179,  179,  179,  213,
      130,  130,   99,   91,  210,  180,  183,  183,  183,  181,
      363,   80,  214,   80,   74,  184,  217,  134,  134,  185,
       74,  194,  194,  194,  226,  150,  150,  168,  168,  218,
      184,  234,  234,  234,  195,   70,   70,  227,  100,   64,
      231,  231,  231,  237,  238,  238,   64,  232,  232,  232,
      232,  233,  235,  235,  235,   62,  239,   62,   56,  235,
      235,  235,  235,  235,  209,  120,  120,  209,  120,  120,
      209,  120,  120,  242,  243,  243,   56,  210,  363,  363,
      210,  363,  363,  240,  363,  363,  244,  213,  130,  130,

      213,  130,  130,  213,  130,  130,  247,  248,  248,  363,
      214,  363,  363,  214,  363,  363,  245,  363,  363,  249,
      217,  134,  134,  217,  134,  134,  217,  134,  134,  255,
      256,  256,  363,  218,  363,  363,  218,  363,  363,  250,
      363,  363,  257,  226,  150,  150,  226,  150,  150,  226,
      150,  150,  309,  309,  309,  363,  227,  363,  363,  227,
      363,  363,  258,  100,  363,  262,  262,  262,  321,  321,
      321,  363,  263,  263,  263,  263,  264,  168,  168,  363,
      363,  265,  265,  265,  266,  266,  266,  237,  238,  238,
      363,  266,  266,  266,  266,  266,  237,  238,  238,  363,

      239,  174,  174,  174,  237,  238,  238,  363,  363,  239,
      175,  209,  120,  120,  176,  363,  363,  267,  242,  243,
      243,  242,  243,  243,  240,  363,  179,  179,  179,  363,
      363,  244,  363,  363,  244,  180,  242,  243,  243,  181,
      213,  130,  130,  247,  248,  248,  247,  248,  248,  268,
      247,  248,  248,  245,  363,  363,  249,  363,  363,  249,
      183,  183,  183,  269,  217,  134,  134,  363,  363,  184,
      255,  256,  256,  185,  255,  256,  256,  250,  363,  194,
      194,  194,  363,  257,  255,  256,  256,  257,  184,  226,
      150,  150,  195,  363,  168,  168,  363,  273,  280,  280,

      280,  363,  258,  100,  363,  277,  277,  277,  237,  238,
      238,  363,  278,  278,  278,  278,  279,  281,  281,  281,
      363,  267,  363,  363,  281,  281,  281,  281,  281,  242,
      243,  243,  247,  248,  248,  255,  256,  256,  333,  333,
      333,  363,  268,  363,  363,  269,  363,  363,  273,  100,
      363,  286,  286,  286,  339,  339,  339,  363,  287,  287,
      287,  287,  288,  168,  168,  363,  363,  289,  289,  289,
      290,  290,  290,  292,  292,  292,  363,  290,  290,  290,
      290,  290,  293,  295,  295,  295,  294,  363,  363,  168,
      301,  363,  296,  201,  201,  201,  297,  299,  100,  363,

      300,  300,  300,  299,  363,  363,  201,  201,  201,  363,
      363,  161,  292,  292,  292,  295,  295,  295,  363,  363,
      363,  293,  363,  363,  296,  294,  363,  100,  297,  300,
      300,  300,  312,  292,  292,  317,  295,  295,  363,  363,
      161,  313,  363,  363,  318,  314,  363,  363,  319,  312,
      292,  292,  312,  292,  292,  323,  324,  324,  313,  363,
      363,  313,  314,  363,  313,  314,  363,  363,  325,  312,
      292,  292,  317,  295,  295,  317,  295,  295,  313,  363,
      363,  318,  326,  363,  318,  319,  363,  363,  319,  328,
      329,  329,  317,  295,  295,  312,  292,  292,  318,  363,

      363,  318,  330,  363,  334,  331,  363,  363,  314,  312,
      292,  292,  292,  292,  292,  312,  292,  292,  334,  363,
      363,  335,  314,  363,  334,  294,  363,  363,  326,  312,
      292,  292,  317,  295,  295,  317,  295,  295,  313,  363,
      363,  336,  326,  363,  336,  319,  363,  363,  319,  295,
      295,  295,  317,  295,  295,  317,  295,  295,  337,  363,
      363,  336,  297,  363,  318,  331,  363,  363,  331,  323,
      324,  324,  328,  329,  329,  363,  363,  363,  313,  363,
      363,  318,  325,  340,  363,  330,  201,  201,  201,   55,
       55,   55,   55,   55,   55,   55,   55,   55,   55,   55,

       57,   57,   57,   57,   57,   57,   57,   57,   57,   57,
       57,   61,   61,   61,   61,   61,   61,   61,   61,   61,
       61,   61,   63,   63,   63,   63,   63,   63,   63,   63,
       63,   63,   63,   65,   65,   65,   65,   65,   65,   65,
       65,   65,   65,   65,   69,   69,   69,   69,   69,   69,
       69,   69,   69,   69,   69,   71,   71,   71,   71,   71,
       71,   71,   71,   71,   71,   71,   75,   75,   75,   75,
       75,   75,   75,   75,   75,   75,   75,   81,   81,   81,
       81,   81,   81,   81,   81,   81,   81,   81,   86,   86,
       86,   86,   86,   86,   86,   86,   86,   86,   86,   90,

      363,  363,  363,   90,   94,  363,  363,   94,   94,   94,
      118,  118,  118,  118,  118,  363,  118,  118,  118,  118,
      118,  122,  122,  122,  122,  122,  122,  363,  122,  122,
      122,  122,  126,  126,  126,  363,  126,  126,  126,  126,
      126,  126,  126,  128,  128,  128,  128,  128,  363,  128,
      128,  128,  128,  128,  132,  132,  132,  132,  132,  363,
      132,  132,  132,  132,  137,  137,  137,  137,  137,  137,
      137,  137,  137,  137,  137,  142,  142,  142,  142,  142,
      363,  142,  142,  142,  142,  142,  143,  143,  143,  143,
      363,  143,  143,  143,  143,  143,  143,  145,  363,  363,

      363,  145,  145,  157,  363,  363,  157,  157,  157,  158,
      363,  158,  158,  158,  158,  158,  158,  158,  158,  158,
      162,  363,  363,  363,  162,  166,  166,  170,  170,  178,
      363,  363,  363,  178,  188,  188,  189,  189,  190,  190,
      191,  363,  363,  191,  191,  191,  192,  363,  192,  192,
      192,  192,  192,  192,  192,  192,  192,  197,  363,  197,
      197,  197,  197,  197,  197,  197,  197,  197,  199,  199,
      200,  200,  203,  203,  208,  208,  208,  208,  208,  208,
      208,  208,  208,  208,  208,  212,  212,  212,  212,  212,
      212,  212,  212,  212,  212,  212,  216,  216,  216,  216,

      216,  216,  216,  216,  216,  216,  216,  220,  220,  221,
      221,  222,  222,  225,  225,  225,  225,  225,  225,  225,
      225,  225,  225,  225,  229,  229,  230,  230,  232,  232,
      236,  236,  236,  236,  236,  236,  236,  236,  236,  236,
      236,  241,  241,  241,  241,  241,  241,  241,  241,  241,
      241,  241,  246,  246,  246,  246,  246,  246,  246,  246,
      246,  246,  246,  251,  251,  252,  252,  254,  254,  254,
      254,  254,  254,  254,  254,  254,  254,  254,  260,  260,
      261,  261,  263,  263,  270,  270,  271,  271,  275,  275,
      276,  276,  278,  278,  282,  282,  285,  285,  287,  287,

      291,  291,  298,  298,  302,  302,  303,  303,  303,  303,
      303,  363,  303,  303,  303,  303,  303,  305,  305,  305,
      305,  305,  363,  305,  305,  305,  305,  305,  307,  307,
      308,  308,  311,  311,  311,  311,  311,  311,  311,  311,
      311,  311,  311,  316,  316,  316,  316,  316,  316,  316,
      316,  316,  316,  316,  320,  320,  322,  322,  322,  322,
      322,  322,  322,  322,  322,  322,  322,  327,  327,  327,
      327,  327,  327,  327,  327,  327,  327,  327,  332,  332,
      338,  338,  341,  341,  342,  342,  343,  343,  344,  344,
      346,  346,  347,  347,  348,  348,  349,  349,  351,  351,

      352,  352,  353,  353,  354,  354,  355,  355,  356,  356,
      357,  357,  358,  358,  359,  359,  360,  360,  361,  361,
      362,  362,   27,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  363,
      363
    } ;

static const flex_int16_t yy_chk[1562] =
    {   0,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    5,   25,
        5,   11,    5,    5,   12,   39,    5,    5,    5,   11,
        5,   26,   12,   15,   39,   16,    5,    6,   15,    6,
       16,    6,    6,   45,   45,    6,    6,    6,   43,    6,
       88,   43,   25,   88,   11,    6,  349,   12,   19,   19,
       19,   29,   29,   29,   26,   30,   30,   30,   31,   31,
       31,   19,   35,   40,  116,   40,   40,   40,   44,  116,

       44,  344,   35,   35,   35,   56,   56,   56,   59,  338,
       19,  305,   59,   19,   20,   20,   20,  303,   56,   64,
       64,   64,   67,   67,   67,   68,   68,   20,   76,   76,
       76,   67,   64,  138,  138,   67,   77,   77,   77,  123,
      297,   68,  294,  123,   68,   68,   20,  169,  169,   20,
       23,   23,   23,   70,   70,   70,   80,   80,   80,   82,
       82,   82,   70,   23,  290,   80,   70,  187,  187,   80,
       83,   83,   83,   89,   89,   89,   93,   93,   93,   98,
       98,   98,   23,  205,  205,   23,   24,   24,   24,  100,
       98,  100,  100,  100,  119,  119,  119,  234,  234,   24,

      103,  103,  100,  287,  103,  103,  103,  119,  265,  265,
      120,  120,  120,  274,  129,  129,  129,  272,   24,  120,
      259,   24,   42,  120,   42,   42,   42,  129,  146,  146,
      146,   42,   42,   42,   42,   42,  253,  130,  130,  130,
      228,   42,  280,  280,   42,   48,  130,  133,  133,  133,
      130,  152,  152,  152,  223,   48,   48,   48,  198,  195,
      133,  193,   48,   48,   48,   48,   48,   48,   48,   48,
       48,   48,   48,  191,   48,   48,   51,   51,   51,  185,
      164,  164,  164,   51,   51,   51,   51,   51,   95,  181,
       95,  164,   95,   95,  176,  157,   95,   95,   95,  154,

       95,  149,  149,  149,  151,  148,   95,  101,  145,  101,
      101,  101,  136,  131,  149,  121,  101,  101,  101,  101,
      101,  112,  112,  112,  134,  134,  134,   96,  112,  112,
      112,  112,  112,  134,  150,  150,  150,  134,   94,   85,
      161,  161,   84,  150,  161,  161,  161,  150,  159,   79,
      159,   78,  159,  159,   74,   73,  159,  159,  159,   62,
      159,  168,  168,  168,   60,   54,  159,  165,   53,  165,
      165,  165,  201,  201,  201,   52,  165,  165,  165,  165,
      165,  167,  167,   50,   49,  167,  167,  167,  171,  171,
      171,  174,  174,  174,   47,  171,  171,  171,  171,  171,

      174,  177,  177,  177,  174,   46,  179,  179,  179,  182,
      182,  182,   41,   32,  177,  179,  183,  183,  183,  179,
       27,   22,  182,   21,   18,  183,  186,  186,  186,  183,
       17,  194,  194,  194,  196,  196,  196,  204,  204,  186,
      194,  204,  204,  204,  194,   14,   13,  196,  202,   10,
      202,  202,  202,  207,  207,  207,    9,  202,  202,  202,
      202,  202,  206,  206,  206,    8,  207,    7,    4,  206,
      206,  206,  206,  206,  208,  208,  208,  209,  209,  209,
      210,  210,  210,  211,  211,  211,    3,  208,    0,    0,
      209,    0,    0,  210,    0,    0,  211,  212,  212,  212,

      213,  213,  213,  214,  214,  214,  215,  215,  215,    0,
      212,    0,    0,  213,    0,    0,  214,    0,    0,  215,
      216,  216,  216,  217,  217,  217,  218,  218,  218,  224,
      224,  224,    0,  216,    0,    0,  217,    0,    0,  218,
        0,    0,  224,  225,  225,  225,  226,  226,  226,  227,
      227,  227,  301,  301,  301,    0,  225,    0,    0,  226,
        0,    0,  227,  231,    0,  231,  231,  231,  309,  309,
      309,    0,  231,  231,  231,  231,  231,  233,  233,    0,
        0,  233,  233,  233,  235,  235,  235,  236,  236,  236,
        0,  235,  235,  235,  235,  235,  237,  237,  237,    0,

      236,  238,  238,  238,  239,  239,  239,    0,    0,  237,
      238,  240,  240,  240,  238,    0,    0,  239,  241,  241,
      241,  242,  242,  242,  240,    0,  243,  243,  243,    0,
        0,  241,    0,    0,  242,  243,  244,  244,  244,  243,
      245,  245,  245,  246,  246,  246,  247,  247,  247,  244,
      249,  249,  249,  245,    0,    0,  246,    0,    0,  247,
      248,  248,  248,  249,  250,  250,  250,    0,    0,  248,
      254,  254,  254,  248,  255,  255,  255,  250,    0,  256,
      256,  256,    0,  254,  257,  257,  257,  255,  256,  258,
      258,  258,  256,    0,  264,  264,    0,  257,  264,  264,

      264,    0,  258,  262,    0,  262,  262,  262,  267,  267,
      267,    0,  262,  262,  262,  262,  262,  266,  266,  266,
        0,  267,    0,    0,  266,  266,  266,  266,  266,  268,
      268,  268,  269,  269,  269,  273,  273,  273,  321,  321,
      321,    0,  268,    0,    0,  269,    0,    0,  273,  277,
        0,  277,  277,  277,  333,  333,  333,    0,  277,  277,
      277,  277,  277,  279,  279,    0,    0,  279,  279,  279,
      281,  281,  281,  283,  283,  283,    0,  281,  281,  281,
      281,  281,  283,  284,  284,  284,  283,    0,    0,  288,
      288,    0,  284,  288,  288,  288,  284,  286,  286,    0,

      286,  286,  286,  289,    0,    0,  289,  289,  289,    0,
        0,  286,  292,  292,  292,  295,  295,  295,    0,    0,
        0,  292,    0,    0,  295,  292,    0,  300,  295,  300,
      300,  300,  304,  304,  304,  306,  306,  306,    0,    0,
      300,  304,    0,    0,  306,  304,    0,    0,  306,  311,
      311,  311,  312,  312,  312,  313,  313,  313,  311,    0,
        0,  312,  311,    0,  313,  312,    0,    0,  313,  314,
      314,  314,  316,  316,  316,  317,  317,  317,  314,    0,
        0,  316,  314,    0,  317,  316,    0,    0,  317,  318,
      318,  318,  319,  319,  319,  322,  322,  322,  318,    0,

        0,  319,  318,    0,  322,  319,    0,    0,  322,  323,
      323,  323,  324,  324,  324,  325,  325,  325,  323,    0,
        0,  324,  323,    0,  325,  324,    0,    0,  325,  326,
      326,  326,  327,  327,  327,  328,  328,  328,  326,    0,
        0,  327,  326,    0,  328,  327,    0,    0,  328,  329,
      329,  329,  330,  330,  330,  331,  331,  331,  329,    0,
        0,  330,  329,    0,  331,  330,    0,    0,  331,  334,
      334,  334,  336,  336,  336,    0,    0,    0,  334,    0,
        0,  336,  334,  339,    0,  336,  339,  339,  339,  364,
      364,  364,  364,  364,  364,  364,  364,  364,  364,  364,

      365,  365,  365,  365,  365,  365,  365,  365,  365,  365,
      365,  366,  366,  366,  366,  366,  366,  366,  366,  366,
      366,  366,  367,  367,  367,  367,  367,  367,  367,  367,
      367,  367,  367,  368,  368,  368,  368,  368,  368,  368,
      368,  368,  368,  368,  369,  369,  369,  369,  369,  369,
      369,  369,  369,  369,  369,  370,  370,  370,  370,  370,
      370,  370,  370,  370,  370,  370,  371,  371,  371,  371,
      371,  371,  371,  371,  371,  371,  371,  372,  372,  372,
      372,  372,  372,  372,  372,  372,  372,  372,  373,  373,
      373,  373,  373,  373,  373,  373,  373,  373,  373,  374,

        0,    0,    0,  374,  375,    0,    0,  375,  375,  375,
      376,  376,  376,  376,  376,    0,  376,  376,  376,  376,
      376,  377,  377,  377,  377,  377,  377,    0,  377,  377,
      377,  377,  378,  378,  378,    0,  378,  378,  378,  378,
      378,  378,  378,  379,  379,  379,  379,  379,    0,  379,
      379,  379,  379,  379,  380,  380,  380,  380,  380,    0,
      380,  380,  380,  380,  381,  381,  381,  381,  381,  381,
      381,  381,  381,  381,  381,  382,  382,  382,  382,  382,
        0,  382,  382,  382,  382,  382,  383,  383,  383,  383,
        0,  383,  383,  383,  383,  383,  383,  384,    0,    0,

        0,  384,  384,  385,    0,    0,  385,  385,  385,  386,
        0,  386,  386,  386,  386,  386,  386,  386,  386,  386,
      387,    0,    0,    0,  387,  388,  388,  389,  389,  390,
        0,    0,    0,  390,  391,  391,  392,  392,  393,  393,
      394,    0,    0,  394,  394,  394,  395,    0,  395,  395,
      395,  395,  395,  395,  395,  395,  395,  396,    0,  396,
      396,  396,  396,  396,  396,  396,  396,  396,  397,  397,
      398,  398,  399,  399,  400,  400,  400,  400,  400,  400,
      400,  400,  400,  400,  400,  401,  401,  401,  401,  401,
      401,  401,  401,  401,  401,  401,  402,  402,  402,  402,

      402,  402,  402,  402,  402,  402,  402,  403,  403,  404,
      404,  405,  405,  406,  406,  406,  406,  406,  406,  406,
      406,  406,  406,  406,  407,  407,  408,  408,  409,  409,
      410,  410,  410,  410,  410,  410,  410,  410,  410,  410,
      410,  411,  411,  411,  411,  411,  411,  411,  411,  411,
      411,  411,  412,  412,  412,  412,  412,  412,  412,  412,
      412,  412,  412,  413,  413,  414,  414,  415,  415,  415,
      415,  415,  415,  415,  415,  415,  415,  415,  416,  416,
      417,  417,  418,  418,  419,  419,  420,  420,  421,  421,
      422,  422,  423,  423,  424,  424,  425,  425,  426,  426,

      427,  427,  428,  428,  429,  429,  430,  430,  430,  430,
      430,    0,  430,  430,  430,  430,  430,  431,  431,  431,
      431,  431,    0,  431,  431,  431,  431,  431,  432,  432,
      433,  433,  434,  434,  434,  434,  434,  434,  434,  434,
      434,  434,  434,  435,  435,  435,  435,  435,  435,  435,
      435,  435,  435,  435,  436,  436,  437,  437,  437,  437,
      437,  437,  437,  437,  437,  437,  437,  438,  438,  438,
      438,  438,  438,  438,  438,  438,  438,  438,  439,  439,
      440,  440,  441,  441,  442,  442,  443,  443,  444,  444,
      445,  445,  446,  446,  447,  447,  448,  448,  449,  449,

      450,  450,  451,  451,  452,  452,  453,  453,  454,  454,
      455,  455,  456,  456,  457,  457,  458,  458,  459,  459,
      460,  460,  363,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  363,
      363,  363,  363,  363,  363,  363,  363,  363,  363,  363,
      363
    } ;

/* The intent behind this definition is that it'll catch
 * any uses of REJECT which flex missed.
 */
#define REJECT reject_used_but_not_detected
#define yymore() yymore_used_but_not_detected
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET
#line 1 "scanner_lex.l"
#line 2 "scanner_lex.l"
/*--------------------------------------------------------------------------------------------------
 * NOTE:
 * - All entities in this modules are copies of PostgreQL's code. We made some minor changes
 *   to avoid lint errors such as using '{' for if blocks.
 * - Do not use c++ commenting style (//) here because MAC Flex 2.6.2 has problem processing it.
 *   Example: Flex raise error for the following comment
 *            // processing a single quote (') in c++ comment within a rule action.
 * -------------------------------------------------------------------------------------------------
 */

/*--------------------------------------------------------------------------------------------------
 * Portions Copyright (c) YugaByte, Inc.
 * Portions Copyright (c) 1996-2015, PostgreSQL Global Development Group
 * Portions Copyright (c) 1994, Regents of the University of California
 *
 * Lexical scanner for PostgreSQL
 *
 * The rules in this file must be kept in sync with psql's lexer!!!
 *
 * The rules are designed so that the scanner never has to backtrack,
 * in the sense that there is always a rule that can match the input
 * consumed so far (the rule action may internally throw back some input
 * with yyless(), however).  As explained in the flex manual, this makes
 * for a useful speed increase --- about a third faster than a plain -CF
 * lexer, in simple testing.  The extra complexity is mostly in the rules
 * for handling float numbers and continued string literals.  If you change
 * the lexical rules, verify that you haven't broken the no-backtrack
 * property by running flex with the "-b" option and checking that the
 * resulting "lex.backup" file says that no backing up is needed.  (As of
 * Postgres 9.2, this check is made automatically by the Makefile.)
 *--------------------------------------------------------------------------------------------------
 */

#include "yb/yql/cql/ql/parser/parser.h"
#include "yb/yql/cql/ql/parser/parse_context.h"
#include "yb/yql/cql/ql/parser/scanner.h"
#include "yb/yql/cql/ql/parser/scanner_util.h"
#include "yb/gutil/casts.h"
#include "yb/util/logging.h"

/* Not including unistd. */
#define YY_NO_UNISTD_H

using namespace std;
using namespace yb::ql;

/*
 * Flex 2.6.3 generates cc file which raises warning wile compilation by gcc 7.5.x
 * scanner_lex.l.cc:3318:28: error: the compiler can assume that the address of ‘file’ will never be NULL [-Werror=address]
 */
#if defined(__GNUC__)
#pragma GCC diagnostic ignored "-Waddress"
#endif

#undef YY_DECL
#define YY_DECL \
  GramProcessor::symbol_type LexProcessor::yylex(const ScanState& scan_state)

/* yyterminate is called to end yylex. */
#define yyterminate() return GramProcessor::make_END(cursor_)

/* YY_USER_ACTION is called to advance location after each time a pattern is matched. */
#define YY_USER_ACTION cursor_.columns(yyleng);

/* Lexxer "yyerror" is used only when the scanner failed to understand the input string when
 * translating it into tokens. When this serious error occurs, the compilation stops immediately.
 *
 * yyerror stops the scanning process, resets the scan state to INITIAL, ignores the input string
 * entirely, and return SCAN_ERROR. If the input string has more than one statements, all statements
 * are ignored if one of them failes to compile.
 */
#define yyerror(msg) \
do { \
  BEGIN(INITIAL); \
  return ScanError(msg); \
} while (false)

/* Each call to yylex must set yylloc to the location of the found token. When we parse a token
 * that requires multiple lexer rules to process, this should be done in the first such rule, else
 * yylloc will point into the middle of the token.
 */
#define SET_YYLLOC() (token_loc_ = cursor_)

/* Advance yylloc by the given number of bytes. */
#define ADVANCE_YYLLOC(delta) AdvanceCursor(delta)
#line 972 "/Users/deen/code/yugabyte-db/build/debugcov-clang-dynamic-arm64-ninja/src/yb/yql/cql/ql/parser/scanner_lex.l.cc"
/*------------------------------------------------------------------------------------------------*/
/* Flex options. */
#define YY_NO_INPUT 1
/*------------------------------------------------------------------------------------------------*/
/* LEX definitions */
/*
 * OK, here is a short description of lex/flex rules behavior.
 * The longest pattern which matches an input string is always chosen.
 * For equal-length patterns, the first occurring in the rules list is chosen.
 * INITIAL is the starting state, to which all non-conditional rules apply.
 * Exclusive states change parsing rules while the state is active.  When in
 * an exclusive state, only those rules defined for that state apply.
 *
 * We use exclusive states for quoted strings, extended comments,
 * and to eliminate parsing troubles for numeric strings.
 * Exclusive states:
 *  <xb> bit string literal
 *  <xc> extended C-style comments
 *  <xd> delimited identifiers (double-quoted identifiers)
 *  <xh> hexadecimal numeric string
 *  <xq> standard quoted strings
 *  <xe> extended quoted strings (support backslash escape sequences)
 *  <xdolq> $foo$ quoted strings
 *  <xui> quoted identifier with Unicode escapes
 *  <xuiend> end of a quoted identifier with Unicode escapes, UESCAPE can follow
 *  <xus> quoted string with Unicode escapes
 *  <xusend> end of a quoted string with Unicode escapes, UESCAPE can follow
 *  <xeu> Unicode surrogate pair in extended quoted string
 *
 * Remember to add an <<EOF>> case whenever you add a new exclusive state!
 * The default one is probably not the right thing.
 */

/*
 * In order to make the world safe for Windows and Mac clients as well as
 * Unix ones, we accept either \n or \r as a newline.  A DOS-style \r\n
 * sequence will be seen as two successive newlines, but that doesn't cause
 * any problems.  Comments that start with -- and extend to the next
 * newline are treated as equivalent to a single whitespace character.
 *
 * NOTE a fine point: if there is no newline following --, we will absorb
 * everything to the end of the input as a comment.  This is correct.  Older
 * versions of Postgres failed to recognize -- as a comment if the input
 * did not end with a newline.
 *
 * XXX perhaps \f (formfeed) should be treated as a newline as well?
 *
 * XXX if you change the set of whitespace characters, fix scanner_isspace()
 * to agree, and see also the plpgsql lexer.
 */
/*
 * SQL requires at least one newline in the whitespace separating
 * string literals that are to be concatenated.  Silly, but who are we
 * to argue?  Note that {whitespace_with_newline} should not have * after
 * it, whereas {whitespace} should generally have a * after it...
 */
/*
 * To ensure that {quotecontinue} can be scanned without having to back up
 * if the full pattern isn't matched, we include trailing whitespace in
 * {quotestop}.  This matches all cases where {quotecontinue} fails to match,
 * except for {quote} followed by whitespace and just one "-" (not two,
 * which would start a {comment}).  To cover that we have {quotefail}.
 * The actions for {quotestop} and {quotefail} must throw back characters
 * beyond the quote (') proper.
 */
/* Bit string
 * It is tempting to scan the string for only those characters
 * which are allowed. However, this leads to silently swallowed
 * characters if illegal characters are included in the string.
 * For example, if xbinside is [01] then B'ABCD' is interpreted
 * as a zero-length string, and the ABCD' is lost!
 * Better to pass the string forward and let the input routines
 * validate the contents.
 */
/* Hexadecimal number */
/* National character */
/* Quoted string that allows backslash escapes */
/* Extended quote
 * xqdouble implements embedded quote, ''''
 */
/* $foo$ style quotes ("dollar quoting")
 * The quoted string starts with $foo$ where "foo" is an optional string
 * in the form of an identifier, except that it may not contain "$",
 * and extends to the first occurrence of an identical string.
 * There is *no* processing of the quoted text.
 *
 * {dolqfailed} is an error rule to avoid scanner backup when {dolqdelim}
 * fails to match its trailing "$".
 */
/* Double quote
 * Allows embedded spaces and other special characters into identifiers.
 */
/* Unicode escapes */
/* error rule to avoid backup */
/* Quoted identifier with Unicode escapes */
/* Quoted string with Unicode escapes */
/* Optional UESCAPE after a quoted string or identifier with Unicode escapes. */
/* error rule to avoid backup */
/* C-style comments
 *
 * The "extended comment" syntax closely resembles allowable operator syntax.
 * The tricky part here is to get lex to recognize a string starting with
 * slash-star as a comment, when interpreting it as an operator would produce
 * a longer match --- remember lex will prefer a longer match!  Also, if we
 * have something like plus-slash-star, lex will think this is a 3-character
 * operator whereas we want to see it as a + operator and a comment start.
 * The solution is two-fold:
 * 1. append {op_chars}* to xcstart so that it matches as much text as
 *    {operator} would. Then the tie-breaker (first matching rule of same
 *    length) ensures xcstart wins.  We put back the extra stuff with yyless()
 *    in case it contains a star-slash that should terminate the comment.
 * 2. In the operator rule, check for slash-star within the operator, and
 *    if found throw it back with yyless().  This handles the plus-slash-star
 *    problem.
 * Dash-dash comments have similar interactions with the operator rule.
 *
 * Add " to negate quote.
 */
/* Assorted special-case operators and operator-like tokens */
/*
 * "self" is the set of chars that should be returned as single-character
 * tokens.  "op_chars" is the set of chars that can make up "Op" tokens,
 * which can be one or more characters long (but if a single-char token
 * appears in the "self" set, it is not to be returned as an Op).  Note
 * that the sets overlap, but each has some chars that are not in the other.
 *
 * If you change either set, adjust the character lists appearing in the
 * rule for "operator"!
 */
/* we no longer allow unary minus in numbers.
 * instead we pass it separately to parser. there it gets
 * coerced via doNegate() -- Leon aug 20 1999
 *
 * {decimalfail} is used because we would like "1..10" to lex as 1, dot_dot, 10.
 *
 * {realfail1} and {realfail2} are added to prevent the need for scanner
 * backup when the {real} rule fails to match completely.
 */
/*
 * Dollar quoted strings are totally opaque, and no escaping is done on them.
 * Other quoted strings must allow some special characters such as single-quote
 *  and newline.
 * Embedded single-quotes are implemented both in the SQL standard
 *  style of two adjacent single quotes "''" and in the Postgres/Java style
 *  of escaped-quote "\'".
 * Other embedded escaped characters are matched explicitly and the leading
 *  backslash is dropped from the string.
 * Note that xcstart must appear before operator, as explained above!
 *  Also whitespace (comment) must appear before operator.
 */
/*------------------------------------------------------------------------------------------------*/
/* FLEX rules. */
#line 1125 "/Users/deen/code/yugabyte-db/build/debugcov-clang-dynamic-arm64-ninja/src/yb/yql/cql/ql/parser/scanner_lex.l.cc"

#define INITIAL 0
#define xb 1
#define xc 2
#define xd 3
#define xh 4
#define xe 5
#define xq 6
#define xdolq 7
#define xui 8
#define xuiend 9
#define xus 10
#define xusend 11
#define xeu 12

#ifndef YY_NO_UNISTD_H
/* Special case for "unistd.h", since it is non-ANSI. We include it way
 * down here because we want the user's section 1 to have been scanned first.
 * The user has a chance to override it with an option.
 */
#include <unistd.h>
#endif

#ifndef YY_EXTRA_TYPE
#define YY_EXTRA_TYPE void *
#endif

#ifndef yytext_ptr
static void yy_flex_strncpy ( char *, const char *, int );
#endif

#ifdef YY_NEED_STRLEN
static int yy_flex_strlen ( const char * );
#endif

#ifndef YY_NO_INPUT

#endif

/* Amount of stuff to slurp up with each read. */
#ifndef YY_READ_BUF_SIZE
#ifdef __ia64__
/* On IA-64, the buffer size is 16k, not 8k */
#define YY_READ_BUF_SIZE 16384
#else
#define YY_READ_BUF_SIZE 8192
#endif /* __ia64__ */
#endif

/* Copy whatever the last rule matched to the standard output. */
#ifndef ECHO
#define ECHO LexerOutput( yytext, yyleng )
#endif

/* Gets input and stuffs it into "buf".  number of characters read, or YY_NULL,
 * is returned in "result".
 */
#ifndef YY_INPUT
#define YY_INPUT(buf,result,max_size) \
\
  if ( (int)(result = LexerInput( (char *) buf, max_size )) < 0 ) \
    YY_FATAL_ERROR0( "input in flex scanner failed" );

#endif

/* No semi-colon after return; correct usage is to write "yyterminate();" -
 * we don't want an extra ';' after the "return" because that will cause
 * some compilers to complain about unreachable statements.
 */
#ifndef yyterminate
#define yyterminate() return YY_NULL
#endif

/* Number of entries by which start-condition stack grows. */
#ifndef YY_START_STACK_INCR
#define YY_START_STACK_INCR 25
#endif

/* Report a fatal error. */
#ifndef YY_FATAL_ERROR
#define YY_FATAL_ERROR(msg) LexerError( msg )
#endif

/* end tables serialization structures and prototypes */

/* Default declaration of generated scanner - a define so the user can
 * easily add parameters.
 */
#ifndef YY_DECL
#define YY_DECL_IS_OURS 1
#define YY_DECL int yyFlexLexer::yylex()
#endif /* !YY_DECL */

/* Code executed at the beginning of each rule, after yytext and yyleng
 * have been set up.
 */
#ifndef YY_USER_ACTION
#define YY_USER_ACTION
#endif

/* Code executed at the end of each rule. */
#ifndef YY_BREAK
#define YY_BREAK /*LINTED*/break;
#endif

#define YY_RULE_SETUP \
  YY_USER_ACTION

/** The main scanner function which does all the work.
 */
YY_DECL
{
  yy_state_type yy_current_state;
  char *yy_cp, *yy_bp;
  int yy_act;
    
  if ( !(yy_init) )
    {
    (yy_init) = 1;

#ifdef YY_USER_INIT
    YY_USER_INIT;
#endif

    if ( ! (yy_start) )
      (yy_start) = 1; /* first start state */

    if ( ! yyin )
      yyin.rdbuf(std::cin.rdbuf());

    if ( ! yyout )
      yyout.rdbuf(std::cout.rdbuf());

    if ( ! YY_CURRENT_BUFFER ) {
      yyensure_buffer_stack ();
      YY_CURRENT_BUFFER_LVALUE =
        yy_create_buffer( yyin, YY_BUF_SIZE );
    }

    yy_load_buffer_state(  );
    }

  {
#line 361 "scanner_lex.l"



#line 365 "scanner_lex.l"
  /* FLEX initial code: The following code block is executed every time yylex is called.
   * Reset the current scanning locations each time yylex is called to match new pattern.
   */
  cursor_.step();


#line 1280 "/Users/deen/code/yugabyte-db/build/debugcov-clang-dynamic-arm64-ninja/src/yb/yql/cql/ql/parser/scanner_lex.l.cc"

  while ( /*CONSTCOND*/1 )    /* loops until end-of-file is reached */
    {
    yy_cp = (yy_c_buf_p);

    /* Support of yytext. */
    *yy_cp = (yy_hold_char);

    /* yy_bp points to the position in yy_ch_buf of the start of
     * the current run.
     */
    yy_bp = yy_cp;

    yy_current_state = (yy_start);
yy_match:
    do
      {
      YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)] ;
      if ( yy_accept[yy_current_state] )
        {
        (yy_last_accepting_state) = yy_current_state;
        (yy_last_accepting_cpos) = yy_cp;
        }
      while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
        {
        yy_current_state = (int) yy_def[yy_current_state];
        if ( yy_current_state >= 364 )
          yy_c = yy_meta[yy_c];
        }
      yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
      ++yy_cp;
      }
    while ( yy_current_state != 363 );
    yy_cp = (yy_last_accepting_cpos);
    yy_current_state = (yy_last_accepting_state);

yy_find_action:
    yy_act = yy_accept[yy_current_state];

    YY_DO_BEFORE_ACTION;

do_action:  /* This label is used only to access EOF actions. */

    switch ( yy_act )
  { /* beginning of action switch */
      case 0: /* must back up */
      /* undo the effects of YY_DO_BEFORE_ACTION */
      *yy_cp = (yy_hold_char);
      yy_cp = (yy_last_accepting_cpos);
      yy_current_state = (yy_last_accepting_state);
      goto yy_find_action;

case 1:
/* rule 1 can match eol */
YY_RULE_SETUP
#line 371 "scanner_lex.l"
{
  cursor_.lines();
}
  YY_BREAK
case 2:
/* rule 2 can match eol */
YY_RULE_SETUP
#line 375 "scanner_lex.l"
{
  /* Increase line number and ignore this token. */
  CountNewlineInToken(yytext);
}
  YY_BREAK
case 3:
YY_RULE_SETUP
#line 380 "scanner_lex.l"
{
  /* Save the location where token starts. */
  SET_YYLLOC();
  xcdepth_ = 0;
  BEGIN(xc);
  /* Put back any characters past slash-star; see above. */
  yyless(2);
}
  YY_BREAK
case 4:
YY_RULE_SETUP
#line 389 "scanner_lex.l"
{
  xcdepth_++;
  /* Put back any characters past slash-star; see above. */
  yyless(2);
}
  YY_BREAK
case 5:
YY_RULE_SETUP
#line 395 "scanner_lex.l"
{
  if (xcdepth_ <= 0) {
    BEGIN(INITIAL);
  } else {
    xcdepth_--;
  }
}
  YY_BREAK
case 6:
/* rule 6 can match eol */
YY_RULE_SETUP
#line 403 "scanner_lex.l"
{
  /* Ignore. */
}
  YY_BREAK
case 7:
YY_RULE_SETUP
#line 407 "scanner_lex.l"
{
  /* Ignore. */
}
  YY_BREAK
case 8:
YY_RULE_SETUP
#line 411 "scanner_lex.l"
{
  /* Ignore. */
}
  YY_BREAK
case YY_STATE_EOF(xc):
#line 415 "scanner_lex.l"
{
  yyerror("unterminated /* comment");
}
  YY_BREAK
case 9:
YY_RULE_SETUP
#line 419 "scanner_lex.l"
{
  /* Binary bit type.
   * At some point we should simply pass the string
   * forward to the parser and label it there.
   * In the meantime, place a leading "b" on the string
   * to mark it for the input routine as a binary string.
   */
  SET_YYLLOC();
  BEGIN(xb);
  startlit();
  addlitchar('b');
}
  YY_BREAK
case 10:
/* rule 10 can match eol */
#line 433 "scanner_lex.l"
case 11:
/* rule 11 can match eol */
YY_RULE_SETUP
#line 433 "scanner_lex.l"
{
  yyless(1);
  BEGIN(INITIAL);
  return GramProcessor::make_BCONST(ScanLiteral(), cursor_);
}
  YY_BREAK
case 12:
/* rule 12 can match eol */
#line 440 "scanner_lex.l"
case 13:
/* rule 13 can match eol */
YY_RULE_SETUP
#line 440 "scanner_lex.l"
{
  addlit(yytext, yyleng);
}
  YY_BREAK
case 14:
/* rule 14 can match eol */
#line 445 "scanner_lex.l"
case 15:
/* rule 15 can match eol */
YY_RULE_SETUP
#line 445 "scanner_lex.l"
{
  /* Increase line number and ignore this token. */
  CountNewlineInToken(yytext);
}
  YY_BREAK
case YY_STATE_EOF(xb):
#line 450 "scanner_lex.l"
{
  yyerror("unterminated bit string literal");
}
  YY_BREAK
case 16:
YY_RULE_SETUP
#line 454 "scanner_lex.l"
{
  /* Hexadecimal bit type.
   * At some point we should simply pass the string
   * forward to the parser and label it there.
   * In the meantime, place a leading "x" on the string
   * to mark it for the input routine as a hex string.
   */
  SET_YYLLOC();
  BEGIN(xh);
  startlit();
  addlitchar('x');
}
  YY_BREAK
case 17:
/* rule 17 can match eol */
#line 468 "scanner_lex.l"
case 18:
/* rule 18 can match eol */
YY_RULE_SETUP
#line 468 "scanner_lex.l"
{
  yyless(1);
  BEGIN(INITIAL);
  return GramProcessor::make_XCONST(ScanLiteral(), cursor_);
}
  YY_BREAK
case YY_STATE_EOF(xh):
#line 474 "scanner_lex.l"
{
  yyerror("unterminated hexadecimal string literal");
}
  YY_BREAK
case 19:
YY_RULE_SETUP
#line 478 "scanner_lex.l"
{
  /* National character.
   * We will pass this along as a normal character string,
   * but preceded with an internally-generated "NCHAR".
   */
  SET_YYLLOC();
  yyless(1);        /* eat only 'n' this time */

  const ScanKeyword &keyword = ScanKeywordLookup("nchar");
  if (keyword.is_valid()) {
    return GramProcessor::make_NCHAR(keyword.name(), cursor_);
  } else {
    /* If NCHAR isn't a keyword, just return "n" */
    return GramProcessor::make_IDENT(MakeString("n"), cursor_);
  }
}
  YY_BREAK
case 20:
YY_RULE_SETUP
#line 495 "scanner_lex.l"
{
  warn_on_first_escape_ = true;
  saw_non_ascii_ = false;
  SET_YYLLOC();
  if (standard_conforming_strings_)
    BEGIN(xq);
  else
    BEGIN(xe);
  startlit();
}
  YY_BREAK
case 21:
YY_RULE_SETUP
#line 506 "scanner_lex.l"
{
  warn_on_first_escape_ = false;
  saw_non_ascii_ = false;
  SET_YYLLOC();
  BEGIN(xe);
  startlit();
}
  YY_BREAK
case 22:
YY_RULE_SETUP
#line 514 "scanner_lex.l"
{
  SET_YYLLOC();
  if (!standard_conforming_strings_) {
    ScanError("Unsafe use of string constant with Unicode escapes. String constants "
              "with Unicode escapes cannot be used when standard_conforming_strings_ "
              "is off",
              ErrorCode::FEATURE_NOT_SUPPORTED);
  }
  BEGIN(xus);
  startlit();
}
  YY_BREAK
case 23:
/* rule 23 can match eol */
#line 527 "scanner_lex.l"
case 24:
/* rule 24 can match eol */
YY_RULE_SETUP
#line 527 "scanner_lex.l"
{
  yyless(1);
  BEGIN(INITIAL);

  /* Check that data remains valid if it might have been made invalid by unescaping any chars. */
  if (saw_non_ascii_)
    pg_verify_mbstr_len(literalbuf_, literallen_, false);
  return GramProcessor::make_SCONST(ScanLiteral(), cursor_);
}
  YY_BREAK
case 25:
/* rule 25 can match eol */
#line 538 "scanner_lex.l"
case 26:
/* rule 26 can match eol */
YY_RULE_SETUP
#line 538 "scanner_lex.l"
{
  /* throw back all but the quote */
  yyless(1);
  /* xusend state looks for possible UESCAPE */
  BEGIN(xusend);
}
  YY_BREAK
case 27:
/* rule 27 can match eol */
YY_RULE_SETUP
#line 545 "scanner_lex.l"
{
  /* Stay in xusend state over whitespace.
   * Increase line number and ignore this token.
   */
  CountNewlineInToken(yytext);
}
  YY_BREAK
case 28:
#line 553 "scanner_lex.l"
case 29:
/* rule 29 can match eol */
#line 554 "scanner_lex.l"
YY_RULE_SETUP
case YY_STATE_EOF(xusend):
#line 554 "scanner_lex.l"
{
  /* Increase line number. */
  CountNewlineInToken(yytext);

  /* no UESCAPE after the quote, throw back everything */
  yyless(0);
  BEGIN(INITIAL);
  char *str = litbuf_udeescape('\\');
  return GramProcessor::make_SCONST(MakeString(str), cursor_);
}
  YY_BREAK
case 30:
/* rule 30 can match eol */
YY_RULE_SETUP
#line 565 "scanner_lex.l"
{
  /* Increase line number. */
  CountNewlineInToken(yytext);

  /* found UESCAPE after the end quote */
  BEGIN(INITIAL);
  if (!check_uescapechar(yytext[yyleng-2])) {
    SET_YYLLOC();
    ADVANCE_YYLLOC(yyleng-2);
    yyerror("invalid Unicode escape character");
  }
  char *str = litbuf_udeescape(yytext[yyleng-2]);
  return GramProcessor::make_SCONST(MakeString(str), cursor_);
}
  YY_BREAK
case 31:
YY_RULE_SETUP
#line 580 "scanner_lex.l"
{
  addlitchar('\'');
}
  YY_BREAK
case 32:
/* rule 32 can match eol */
YY_RULE_SETUP
#line 584 "scanner_lex.l"
{
  addlit(yytext, yyleng);
}
  YY_BREAK
case 33:
/* rule 33 can match eol */
YY_RULE_SETUP
#line 588 "scanner_lex.l"
{
  addlit(yytext, yyleng);
}
  YY_BREAK
case 34:
YY_RULE_SETUP
#line 592 "scanner_lex.l"
{
  pg_wchar c = narrow_cast<pg_wchar>(strtoul(yytext+2, NULL, 16));

  check_escape_warning();

  if (is_utf16_surrogate_first(c)) {
    utf16_first_part_ = c;
    BEGIN(xeu);
  } else if (is_utf16_surrogate_second(c)) {
    yyerror("invalid Unicode surrogate pair");
  } else {
    addunicode(c);
  }
}
  YY_BREAK
case 35:
YY_RULE_SETUP
#line 607 "scanner_lex.l"
{
  pg_wchar c = narrow_cast<pg_wchar>(strtoul(yytext+2, NULL, 16));

  if (!is_utf16_surrogate_second(c)) {
    yyerror("invalid Unicode surrogate pair");
  }

  c = surrogate_pair_to_codepoint(utf16_first_part_, c);
  addunicode(c);
  BEGIN(xe);
}
  YY_BREAK
case 36:
YY_RULE_SETUP
#line 619 "scanner_lex.l"
{ yyerror("invalid Unicode surrogate pair"); }
  YY_BREAK
case 37:
/* rule 37 can match eol */
YY_RULE_SETUP
#line 620 "scanner_lex.l"
{ yyerror("invalid Unicode surrogate pair"); }
  YY_BREAK
case YY_STATE_EOF(xeu):
#line 621 "scanner_lex.l"
{ yyerror("invalid Unicode surrogate pair"); }
  YY_BREAK
case 38:
YY_RULE_SETUP
#line 623 "scanner_lex.l"
{
  ScanError("Invalid Unicode escape. Unicode escapes must be \\uXXXX or \\UXXXXXXXX",
             ErrorCode::INVALID_ESCAPE_SEQUENCE);
}
  YY_BREAK
case 39:
/* rule 39 can match eol */
YY_RULE_SETUP
#line 628 "scanner_lex.l"
{
  if (yytext[1] == '\'') {
    if (backslash_quote_ == BackslashQuoteType::OFF ||
        (backslash_quote_ == BackslashQuoteType::SAFE_ENCODING)) {
      ScanError("Unsafe use of \\' in a string literal. Use '' to write quotes in "
                 "strings. \\' is insecure in client-only encodings",
                 ErrorCode::NONSTANDARD_USE_OF_ESCAPE_CHARACTER);
    }
  }
  check_string_escape_warning(yytext[1]);
  addlitchar(unescape_single_char(yytext[1]));
}
  YY_BREAK
case 40:
YY_RULE_SETUP
#line 641 "scanner_lex.l"
{
  unsigned char c = strtoul(yytext+1, NULL, 8);

  check_escape_warning();
  addlitchar(c);
  if (c == '\0' || is_utf_highbit_set(c)) {
    saw_non_ascii_ = true;
  }
}
  YY_BREAK
case 41:
YY_RULE_SETUP
#line 651 "scanner_lex.l"
{
  unsigned char c = strtoul(yytext+2, NULL, 16);

  check_escape_warning();
  addlitchar(c);
  if (c == '\0' || is_utf_highbit_set(c)) {
    saw_non_ascii_ = true;
  }
}
  YY_BREAK
case 42:
/* rule 42 can match eol */
YY_RULE_SETUP
#line 660 "scanner_lex.l"
{
  /* Increase line number and ignore this token. */
  CountNewlineInToken(yytext);
}
  YY_BREAK
case 43:
YY_RULE_SETUP
#line 665 "scanner_lex.l"
{
  /* This is only needed for \ just before EOF */
  addlitchar(yytext[0]);
}
  YY_BREAK
case YY_STATE_EOF(xq):
case YY_STATE_EOF(xe):
case YY_STATE_EOF(xus):
#line 670 "scanner_lex.l"
{ yyerror("unterminated quoted string"); }
  YY_BREAK
case 44:
YY_RULE_SETUP
#line 672 "scanner_lex.l"
{
  SET_YYLLOC();
  dolqstart_ = MCStrdup(PTempMem(), yytext);
  BEGIN(xdolq);
  startlit();
}
  YY_BREAK
case 45:
YY_RULE_SETUP
#line 679 "scanner_lex.l"
{
  SET_YYLLOC();
  /* throw back all but the initial "$" */
  yyless(1);
  /* and treat it as {other} */
  return make_symbol(yytext[0], cursor_);
}
  YY_BREAK
case 46:
YY_RULE_SETUP
#line 687 "scanner_lex.l"
{
  if (strcmp(yytext, dolqstart_) == 0) {
    dolqstart_ = NULL;
    BEGIN(INITIAL);
    return GramProcessor::make_SCONST(ScanLiteral(), cursor_);
  } else {
    /* When we fail to match $...$ to dolqstart_, transfer
     * the $... part to the output, but put back the final
     * $ for rescanning.  Consider $delim$...$junk$delim$
     */
    addlit(yytext, yyleng-1);
    yyless(yyleng-1);
  }
}
  YY_BREAK
case 47:
/* rule 47 can match eol */
YY_RULE_SETUP
#line 702 "scanner_lex.l"
{
  addlit(yytext, yyleng);
}
  YY_BREAK
case 48:
YY_RULE_SETUP
#line 706 "scanner_lex.l"
{
  addlit(yytext, yyleng);
}
  YY_BREAK
case 49:
YY_RULE_SETUP
#line 710 "scanner_lex.l"
{
  /* This is only needed for $ inside the quoted text */
  addlitchar(yytext[0]);
}
  YY_BREAK
case YY_STATE_EOF(xdolq):
#line 715 "scanner_lex.l"
{ yyerror("unterminated dollar-quoted string"); }
  YY_BREAK
case 50:
YY_RULE_SETUP
#line 717 "scanner_lex.l"
{
  SET_YYLLOC();
  BEGIN(xd);
  startlit();
}
  YY_BREAK
case 51:
YY_RULE_SETUP
#line 723 "scanner_lex.l"
{
  SET_YYLLOC();
  BEGIN(xui);
  startlit();
}
  YY_BREAK
case 52:
YY_RULE_SETUP
#line 729 "scanner_lex.l"
{
  BEGIN(INITIAL);
  if (literallen_ == 0) {
    yyerror("zero-length delimited identifier");
  }
  const MCSharedPtr<MCString> ident = ScanLiteral();
  if (literallen_ >= NAMEDATALEN) {
    TruncateIdentifier(ident, true);
  }
  return GramProcessor::make_IDENT(ident, cursor_);
}
  YY_BREAK
case 53:
YY_RULE_SETUP
#line 741 "scanner_lex.l"
{
  yyless(1);
  /* xuiend state looks for possible UESCAPE */
  BEGIN(xuiend);
}
  YY_BREAK
case 54:
/* rule 54 can match eol */
YY_RULE_SETUP
#line 747 "scanner_lex.l"
{
  /* stay in xuiend state over whitespace.
   * Increase line number and ignore this token.
   */
  CountNewlineInToken(yytext);
}
  YY_BREAK
case 55:
#line 755 "scanner_lex.l"
case 56:
/* rule 56 can match eol */
#line 756 "scanner_lex.l"
YY_RULE_SETUP
case YY_STATE_EOF(xuiend):
#line 756 "scanner_lex.l"
{
  /* Increase line number. */
  CountNewlineInToken(yytext);

  /* no UESCAPE after the quote, throw back everything */
  yyless(0);

  BEGIN(INITIAL);
  if (literallen_ == 0) {
    yyerror("zero-length delimited identifier");
  }

  const MCSharedPtr<MCString> ident = MakeString(litbuf_udeescape('\\'));
  TruncateIdentifier(ident, true);
  return GramProcessor::make_IDENT(ident, cursor_);
}
  YY_BREAK
case 57:
/* rule 57 can match eol */
YY_RULE_SETUP
#line 773 "scanner_lex.l"
{
  /* Increase line number. */
  CountNewlineInToken(yytext);

  /* found UESCAPE after the end quote */
  BEGIN(INITIAL);
  if (literallen_ == 0) {
    yyerror("zero-length delimited identifier");
  }
  if (!check_uescapechar(yytext[yyleng-2])) {
    SET_YYLLOC();
    ADVANCE_YYLLOC(yyleng-2);
    yyerror("invalid Unicode escape character");
  }

  const MCSharedPtr<MCString> ident = MakeString(litbuf_udeescape(yytext[yyleng - 2]));
  TruncateIdentifier(ident, true);
  return GramProcessor::make_IDENT(ident, cursor_);
}
  YY_BREAK
case 58:
YY_RULE_SETUP
#line 793 "scanner_lex.l"
{
  addlitchar('"');
}
  YY_BREAK
case 59:
/* rule 59 can match eol */
YY_RULE_SETUP
#line 797 "scanner_lex.l"
{
  addlit(yytext, yyleng);
}
  YY_BREAK
case YY_STATE_EOF(xd):
case YY_STATE_EOF(xui):
#line 801 "scanner_lex.l"
{ yyerror("unterminated quoted identifier"); }
  YY_BREAK
case 60:
YY_RULE_SETUP
#line 803 "scanner_lex.l"
{
  SET_YYLLOC();

  /* Throw back all but the initial u/U. */
  yyless(1);

  /* Treat it as {identifier}. Convert to lower-case and create IDENT token. */
  const MCSharedPtr<MCString> ident = MakeIdentifier(yytext, yyleng, true);
  return GramProcessor::make_IDENT(ident, cursor_);
}
  YY_BREAK
case 61:
YY_RULE_SETUP
#line 814 "scanner_lex.l"
{
  SET_YYLLOC();
  return GramProcessor::make_TYPECAST(cursor_);
}
  YY_BREAK
case 62:
YY_RULE_SETUP
#line 819 "scanner_lex.l"
{
  SET_YYLLOC();
  return GramProcessor::make_DOT_DOT(cursor_);
}
  YY_BREAK
case 63:
YY_RULE_SETUP
#line 824 "scanner_lex.l"
{
  SET_YYLLOC();
  return GramProcessor::make_COLON_EQUALS(cursor_);
}
  YY_BREAK
case 64:
YY_RULE_SETUP
#line 829 "scanner_lex.l"
{
  SET_YYLLOC();
  return GramProcessor::make_SINGLE_ARROW(cursor_);
}
  YY_BREAK
case 65:
YY_RULE_SETUP
#line 834 "scanner_lex.l"
{
  SET_YYLLOC();
  return GramProcessor::make_DOUBLE_ARROW(cursor_);
}
  YY_BREAK
case 66:
YY_RULE_SETUP
#line 839 "scanner_lex.l"
{
  SET_YYLLOC();
  return GramProcessor::make_EQUALS_GREATER(cursor_);
}
  YY_BREAK
case 67:
YY_RULE_SETUP
#line 844 "scanner_lex.l"
{
  SET_YYLLOC();
  return GramProcessor::make_LESS_EQUALS(cursor_);
}
  YY_BREAK
case 68:
YY_RULE_SETUP
#line 849 "scanner_lex.l"
{
  SET_YYLLOC();
  return GramProcessor::make_GREATER_EQUALS(cursor_);
}
  YY_BREAK
case 69:
YY_RULE_SETUP
#line 854 "scanner_lex.l"
{
  /* We accept both "<>" and "!=" as meaning NOT_EQUALS */
  SET_YYLLOC();
  return GramProcessor::make_NOT_EQUALS(cursor_);
}
  YY_BREAK
case 70:
YY_RULE_SETUP
#line 860 "scanner_lex.l"
{
  /* We accept both "<>" and "!=" as meaning NOT_EQUALS */
  SET_YYLLOC();
  return GramProcessor::make_NOT_EQUALS(cursor_);
}
  YY_BREAK
case 71:
YY_RULE_SETUP
#line 866 "scanner_lex.l"
{
  SET_YYLLOC();
  return make_symbol(yytext[0], cursor_);
}
  YY_BREAK
case 72:
YY_RULE_SETUP
#line 871 "scanner_lex.l"
{
  /* Check for embedded slash-star or dash-dash; those
   * are comment starts, so operator must stop there.
   * Note that slash-star or dash-dash at the first
   * character will match a prior rule, not this one.
   */
  int   nchars = yyleng;
  char *slashstar = strstr(yytext, "/*");
  char *dashdash = strstr(yytext, "--");

  if (slashstar && dashdash0) {
    /* if both appear, take the first one */
    if (slashstar > dashdash)
      slashstar = dashdash;
  } else if (!slashstar) {
    slashstar = dashdash;
  }
  if (slashstar) {
    nchars = narrow_cast<int>(slashstar - yytext);
  }

  /* For SQL compatibility, '+' and '-' cannot be the
   * last char of a multi-char operator unless the operator
   * contains chars that are not in SQL operators.
   * The idea is to lex '=-' as two operators, but not
   * to forbid operator names like '?-' that could not be
   * sequences of SQL operators. Similarly for '?' to allow
   * "... where c=?".
   */
  while (nchars > 1 && (33yytext[nchars-1] == '+'33 ||
                        yytext[nchars-1] == '-' ||
                        yytext[nchars-1] == '?'32)) {
    int   ic;

    /* "!" is removed from the list below because
     * "... WHERE col!=?" should be returned as two separate
     * tokens ("!=" and "?").
     */
    for (ic = nchars-2; ic >= 0; ic--33) {
      if (strchr("~@#^&|`?%", yytext[ic]))
        break;
    }
    if (ic >= 0)
      break; /* found a char that makes it OK */
    nchars--; /* else remove the +/-, and check again */
  }

  SET_YYLLOC();

  if (nchars < yyleng) {
    /* Strip the unwanted chars from the token */
    yyless(nchars);
    /* If what we have left is only one char, and it's
     * one of the characters matching "self", then
     * return it as a character token the same way
     * that the "self" rule would have.
     */
    if (nchars == 1 && strchr(",()[].;:+-*/%^<>=", yytext[0])) {
      return make_symbol(yytext[0], cursor_);
    }

    /* If what we have left are two chars, see if
     * it is one of the two-character operators.
     */
    if (nchars == 2) {
      if (strncmp(yytext, "::", 2) == 0) {
        return GramProcessor::make_TYPECAST(cursor_);
      } else if (strncmp(yytext, "..", 2) == 0) {
        return GramProcessor::make_DOT_DOT(cursor_);
      } else if (strncmp(yytext, ":=", 2) == 0) {
        return GramProcessor::make_COLON_EQUALS(cursor_);
      } else if (strncmp(yytext, "=>", 2) == 0) {
        return GramProcessor::make_EQUALS_GREATER(cursor_);
      } else if (strncmp(yytext, "<=", 2) == 0) {
        return GramProcessor::make_LESS_EQUALS(cursor_);
      } else if (strncmp(yytext, ">=", 2) == 0) {
        return GramProcessor::make_GREATER_EQUALS(cursor_);
      } else if (strncmp(yytext, "<>", 2) == 0 ||
                 strncmp(yytext, "!=", 2) == 0) {
        return GramProcessor::make_NOT_EQUALS(cursor_);
      }
    }
  }

  /* Complain if operator is too long.  Unlike the case
   * for identifiers, we make this an error not a notice-
   * and-truncate, because the odds are we are looking at
   * a syntactic mistake anyway.
   */
  if (nchars >= NAMEDATALEN)
    yyerror("operator too long");

  return GramProcessor::make_Op(MakeString(yytext), cursor_);
}
  YY_BREAK
case 73:
YY_RULE_SETUP
#line 966 "scanner_lex.l"
{
  SET_YYLLOC();
  int64_t ival = atol(yytext + 1);
  return GramProcessor::make_PARAM(ival, cursor_);
}
  YY_BREAK
case 74:
YY_RULE_SETUP
#line 972 "scanner_lex.l"
{
  SET_YYLLOC();
  return GramProcessor::make_ICONST(MakeString(yytext), cursor_);
}
  YY_BREAK
case 75:
YY_RULE_SETUP
#line 977 "scanner_lex.l"
{
  SET_YYLLOC();
  return GramProcessor::make_FCONST(MakeString(yytext), cursor_);
}
  YY_BREAK
case 76:
YY_RULE_SETUP
#line 982 "scanner_lex.l"
{
  /* throw back the .., and treat as integer */
  yyless(yyleng-2);
  SET_YYLLOC();
  return GramProcessor::make_ICONST(MakeString(yytext), cursor_);
}
  YY_BREAK
case 77:
YY_RULE_SETUP
#line 989 "scanner_lex.l"
{
  SET_YYLLOC();
  // skipping the first two chars (i.e. the '0x')
  return GramProcessor::make_BCONST(MakeString(yytext + 2), cursor_);
}
  YY_BREAK
case 78:
YY_RULE_SETUP
#line 995 "scanner_lex.l"
{
  SET_YYLLOC();
  return GramProcessor::make_FCONST(MakeString(yytext), cursor_);
}
  YY_BREAK
case 79:
YY_RULE_SETUP
#line 1000 "scanner_lex.l"
{
  /* throw back the [Ee], and treat as {decimal}.  Note
   * that it is possible the input is actually {integer},
   * but since this case will almost certainly lead to a
   * syntax error anyway, we don't bother to distinguish.
   */
  yyless(yyleng-1);
  SET_YYLLOC();
  return GramProcessor::make_FCONST(MakeString(yytext), cursor_);
}
  YY_BREAK
case 80:
YY_RULE_SETUP
#line 1011 "scanner_lex.l"
{
  /* throw back the [Ee][+-], and proceed as above */
  yyless(yyleng-2);
  SET_YYLLOC();
  return GramProcessor::make_FCONST(MakeString(yytext), cursor_);
}
  YY_BREAK
case 81:
YY_RULE_SETUP
#line 1018 "scanner_lex.l"
{
  SET_YYLLOC();
  /* Trim the dashes from the UUID string. */
  return GramProcessor::make_UCONST(MakeString(yytext), cursor_);
}
  YY_BREAK
case 82:
YY_RULE_SETUP
#line 1024 "scanner_lex.l"
{
  SET_YYLLOC();

  /* Check against the keyword list. */
  const ScanKeyword &keyword = ScanKeywordLookup(yytext);
  if (keyword.is_valid()) {
    return make_symbol(keyword, cursor_);
  }

  /* Not a keyword.  Convert the identifier to lower case, and truncate if necessary. */
  const MCSharedPtr<MCString> ident = MakeIdentifier(yytext, yyleng, true);
  return GramProcessor::make_IDENT(ident, cursor_);
}
  YY_BREAK
case 83:
YY_RULE_SETUP
#line 1038 "scanner_lex.l"
{
  SET_YYLLOC();
  return make_symbol(yytext[0], cursor_);
}
  YY_BREAK
case YY_STATE_EOF(INITIAL):
#line 1043 "scanner_lex.l"
{
  SET_YYLLOC();
  yyterminate();
}
  YY_BREAK
case 84:
YY_RULE_SETUP
#line 1048 "scanner_lex.l"
YY_FATAL_ERROR( "flex scanner jammed" );
  YY_BREAK
#line 2300 "/Users/deen/code/yugabyte-db/build/debugcov-clang-dynamic-arm64-ninja/src/yb/yql/cql/ql/parser/scanner_lex.l.cc"

  case YY_END_OF_BUFFER:
    {
    /* Amount of text matched not including the EOB char. */
    int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1;

    /* Undo the effects of YY_DO_BEFORE_ACTION. */
    *yy_cp = (yy_hold_char);
    YY_RESTORE_YY_MORE_OFFSET

    if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
      {
      /* We're scanning a new file or input source.  It's
       * possible that this happened because the user
       * just pointed yyin at a new source and called
       * yylex().  If so, then we have to assure
       * consistency between YY_CURRENT_BUFFER and our
       * globals.  Here is the right place to do so, because
       * this is the first action (other than possibly a
       * back-up) that will match for the new input source.
       */
      (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
      YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin.rdbuf();
      YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
      }

    /* Note that here we test for yy_c_buf_p "<=" to the position
     * of the first EOB in the buffer, since yy_c_buf_p will
     * already have been incremented past the NUL character
     * (since all states make transitions on EOB to the
     * end-of-buffer state).  Contrast this with the test
     * in input().
     */
    if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
      { /* This was really a NUL. */
      yy_state_type yy_next_state;

      (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text;

      yy_current_state = yy_get_previous_state(  );

      /* Okay, we're now positioned to make the NUL
       * transition.  We couldn't have
       * yy_get_previous_state() go ahead and do it
       * for us because it doesn't know how to deal
       * with the possibility of jamming (and we don't
       * want to build jamming into it because then it
       * will run more slowly).
       */

      yy_next_state = yy_try_NUL_trans( yy_current_state );

      yy_bp = (yytext_ptr) + YY_MORE_ADJ;

      if ( yy_next_state )
        {
        /* Consume the NUL. */
        yy_cp = ++(yy_c_buf_p);
        yy_current_state = yy_next_state;
        goto yy_match;
        }

      else
        {
        yy_cp = (yy_last_accepting_cpos);
        yy_current_state = (yy_last_accepting_state);
        goto yy_find_action;
        }
      }

    else switch ( yy_get_next_buffer(  ) )
      {
      case EOB_ACT_END_OF_FILE:
        {
        (yy_did_buffer_switch_on_eof) = 0;

        if ( yywrap(  ) )
          {
          /* Note: because we've taken care in
           * yy_get_next_buffer() to have set up
           * yytext, we can now set up
           * yy_c_buf_p so that if some total
           * hoser (like flex itself) wants to
           * call the scanner after we return the
           * YY_NULL, it'll still work - another
           * YY_NULL will get returned.
           */
          (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ;

          yy_act = YY_STATE_EOF(YY_START);
          goto do_action;
          }

        else
          {
          if ( ! (yy_did_buffer_switch_on_eof) )
            YY_NEW_FILE;
          }
        break;
        }

      case EOB_ACT_CONTINUE_SCAN:
        (yy_c_buf_p) =
          (yytext_ptr) + yy_amount_of_matched_text;

        yy_current_state = yy_get_previous_state(  );

        yy_cp = (yy_c_buf_p);
        yy_bp = (yytext_ptr) + YY_MORE_ADJ;
        goto yy_match;

      case EOB_ACT_LAST_MATCH:
        (yy_c_buf_p) =
        &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)];

        yy_current_state = yy_get_previous_state(  );

        yy_cp = (yy_c_buf_p);
        yy_bp = (yytext_ptr) + YY_MORE_ADJ;
        goto yy_find_action;
      }
    break;
    }

  default:
    YY_FATAL_ERROR(
      "fatal flex scanner internal error--no action found" );
  } /* end of action switch */
    } /* end of scanning one token */
  } /* end of user's declarations */
} /* end of yylex */

/* The contents of this function are C++ specific, so the () macro is not used.
 * This constructor simply maintains backward compatibility.
 * DEPRECATED
 */
yyFlexLexer::yyFlexLexer( std::istream* arg_yyin, std::ostream* arg_yyout ):
  yyin(arg_yyin ? arg_yyin->rdbuf() : std::cin.rdbuf()),
  yyout(arg_yyout ? arg_yyout->rdbuf() : std::cout.rdbuf())
{
  ctor_common();
}

/* The contents of this function are C++ specific, so the () macro is not used.
 */
yyFlexLexer::yyFlexLexer( std::istream& arg_yyin, std::ostream& arg_yyout ):
  yyin(arg_yyin.rdbuf()),
  yyout(arg_yyout.rdbuf())
{
  ctor_common();
}

/* The contents of this function are C++ specific, so the () macro is not used.
 */
void yyFlexLexer::ctor_common()
{
  yy_c_buf_p = 0;
  yy_init = 0;
  yy_start = 0;
  yy_flex_debug = 0;
  yylineno = 1; // this will only get updated if %option yylineno

  yy_did_buffer_switch_on_eof = 0;

  yy_looking_for_trail_begin = 0;
  yy_more_flag = 0;
  yy_more_len = 0;
  yy_more_offset = yy_prev_more_offset = 0;

  yy_start_stack_ptr = yy_start_stack_depth = 0;
  yy_start_stack = NULL;

  yy_buffer_stack = NULL;
  yy_buffer_stack_top = 0;
  yy_buffer_stack_max = 0;

  yy_state_buf = 0;

}

/* The contents of this function are C++ specific, so the () macro is not used.
 */
yyFlexLexer::~yyFlexLexer()
{
  delete [] yy_state_buf;
  yyfree(yy_start_stack  );
  yy_delete_buffer( YY_CURRENT_BUFFER );
  yyfree(yy_buffer_stack  );
}

/* The contents of this function are C++ specific, so the () macro is not used.
 */
void yyFlexLexer::switch_streams( std::istream& new_in, std::ostream& new_out )
{
  // was if( new_in )
  yy_delete_buffer( YY_CURRENT_BUFFER );
  yy_switch_to_buffer( yy_create_buffer( new_in, YY_BUF_SIZE  ) );

  // was if( new_out )
  yyout.rdbuf(new_out.rdbuf());
}

/* The contents of this function are C++ specific, so the () macro is not used.
 */
void yyFlexLexer::switch_streams( std::istream* new_in, std::ostream* new_out )
{
  if( ! new_in ) {
    new_in = &yyin;
  }

  if ( ! new_out ) {
    new_out = &yyout;
  }

  switch_streams(*new_in, *new_out);
}

#ifdef YY_INTERACTIVE
int yyFlexLexer::LexerInput( char* buf, int /* max_size */ )
#else
int yyFlexLexer::LexerInput( char* buf, int max_size )
#endif
{
  if ( yyin.eof() || yyin.fail() )
    return 0;

#ifdef YY_INTERACTIVE
  yyin.get( buf[0] );

  if ( yyin.eof() )
    return 0;

  if ( yyin.bad() )
    return -1;

  return 1;

#else
  (void) yyin.read( buf, max_size );

  if ( yyin.bad() )
    return -1;
  else
    return yyin.gcount();
#endif
}

void yyFlexLexer::LexerOutput( const char* buf, int size )
{
  (void) yyout.write( buf, size );
}

/* yy_get_next_buffer - try to read in a new buffer
 *
 * Returns a code representing an action:
 *  EOB_ACT_LAST_MATCH -
 *  EOB_ACT_CONTINUE_SCAN - continue scanning from current position
 *  EOB_ACT_END_OF_FILE - end of file
 */
int yyFlexLexer::yy_get_next_buffer()
{
      char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
  char *source = (yytext_ptr);
  int number_to_move, i;
  int ret_val;

  if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
    YY_FATAL_ERROR(
    "fatal flex scanner internal error--end of buffer missed" );

  if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
    { /* Don't try to fill the buffer, so this is an EOF. */
    if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 )
      {
      /* We matched a single character, the EOB, so
       * treat this as a final EOF.
       */
      return EOB_ACT_END_OF_FILE;
      }

    else
      {
      /* We matched some text prior to the EOB, first
       * process it.
       */
      return EOB_ACT_LAST_MATCH;
      }
    }

  /* Try to read more data. */

  /* First move last chars to start of buffer. */
  number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr) - 1);

  for ( i = 0; i < number_to_move; ++i1.55M )
    *(dest++) = *(source++);

  if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
    /* don't do the read, it's not guaranteed to return an EOF,
     * just force an EOF
     */
    YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0;

  else
    {
      int num_to_read =
      YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;

    while ( num_to_read <= 0 )
      { /* Not enough room in the buffer - grow it. */

      /* just a shorter name for the current buffer */
      YY_BUFFER_STATE b = YY_CURRENT_BUFFER_LVALUE;

      int yy_c_buf_p_offset =
        (int) ((yy_c_buf_p) - b->yy_ch_buf);

      if ( b->yy_is_our_buffer )
        {
        int new_size = b->yy_buf_size * 2;

        if ( new_size <= 0 )
          b->yy_buf_size += b->yy_buf_size / 8;
        else
          b->yy_buf_size *= 2;

        b->yy_ch_buf = (char *)
          /* Include room in for 2 EOB chars. */
          yyrealloc((void *) b->yy_ch_buf,(yy_size_t) (b->yy_buf_size + 2)  );
        }
      else
        /* Can't grow it, we don't own it. */
        b->yy_ch_buf = NULL;

      if ( ! b->yy_ch_buf )
        YY_FATAL_ERROR(
        "fatal error - scanner input buffer overflow" );

      (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset];

      num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
            number_to_move - 1;

      }

    if ( num_to_read > YY_READ_BUF_SIZE )
      num_to_read = YY_READ_BUF_SIZE;

    /* Read in more data. */
    YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
      (yy_n_chars), num_to_read );

    YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
    }

  if ( (yy_n_chars) == 0 )
    {
    if ( number_to_move == YY_MORE_ADJ )
      {
      ret_val = EOB_ACT_END_OF_FILE;
      yyrestart( yyin  );
      }

    else
      {
      ret_val = EOB_ACT_LAST_MATCH;
      YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
        YY_BUFFER_EOF_PENDING;
      }
    }

  else
    ret_val = EOB_ACT_CONTINUE_SCAN;

  if (((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
    /* Extend the array by 50%, plus the number we really need. */
    int new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1);
    YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,(yy_size_t) new_size  );
    if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
      YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
  }

  (yy_n_chars) += number_to_move;
  YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR;
  YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR;

  (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];

  return ret_val;
}

/* yy_get_previous_state - get the state just before the EOB char was reached */

    yy_state_type yyFlexLexer::yy_get_previous_state()
{
  yy_state_type yy_current_state;
  char *yy_cp;
    
  yy_current_state = (yy_start);

  for ( yy_cp = (yytext_ptr682k) + YY_MORE_ADJ682k; yy_cp < (yy_c_buf_p); ++yy_cp1.54M )
    {
    YY_CHAR yy_c = (*yy_cp1.54M ? yy_ec[1.54MYY_SC_TO_UI1.54M(*yy_cp)] : 1);
    if ( yy_accept[yy_current_state] )
      {
      (yy_last_accepting_state) = yy_current_state;
      (yy_last_accepting_cpos) = yy_cp;
      }
    while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
      {
      yy_current_state = (int) yy_def[yy_current_state];
      if ( yy_current_state >= 364 )
        yy_c = yy_meta[yy_c];
      }
    yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
    }

  return yy_current_state;
}

/* yy_try_NUL_trans - try to make a transition on the NUL character
 *
 * synopsis
 *  next_state = yy_try_NUL_trans( current_state );
 */
    yy_state_type yyFlexLexer::yy_try_NUL_trans( yy_state_type yy_current_state )
{
  int yy_is_jam;
      char *yy_cp = (yy_c_buf_p);

  YY_CHAR yy_c = 1;
  if ( yy_accept[yy_current_state] )
    {
    (yy_last_accepting_state) = yy_current_state;
    (yy_last_accepting_cpos) = yy_cp;
    }
  while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
    {
    yy_current_state = (int) yy_def[yy_current_state];
    if ( yy_current_state >= 364 )
      yy_c = yy_meta[yy_c];
    }
  yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
  yy_is_jam = (yy_current_state == 363);

    return yy_is_jam ? 0 : yy_current_state;
}

#ifndef YY_NO_UNPUT
    void yyFlexLexer::yyunput( int c, char* yy_bp)
{
  char *yy_cp;
    
    yy_cp = (yy_c_buf_p);

  /* undo effects of setting up yytext */
  *yy_cp = (yy_hold_char);

  if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
    { /* need to shift things up to make room */
    /* +2 for EOB chars. */
    int number_to_move = (yy_n_chars) + 2;
    char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[
          YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2];
    char *source =
        &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move];

    while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
      *--dest = *--source;

    yy_cp += (int) (dest - source);
    yy_bp += (int) (dest - source);
    YY_CURRENT_BUFFER_LVALUE->yy_n_chars =
      (yy_n_chars) = (int) YY_CURRENT_BUFFER_LVALUE->yy_buf_size;

    if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
      YY_FATAL_ERROR( "flex scanner push-back overflow" );
    }

  *--yy_cp = (char) c;

  (yytext_ptr) = yy_bp;
  (yy_hold_char) = *yy_cp;
  (yy_c_buf_p) = yy_cp;
}
#endif

    int yyFlexLexer::yyinput()
{
  int c;
    
  *(yy_c_buf_p) = (yy_hold_char);

  if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR )
    {
    /* yy_c_buf_p now points to the character we want to return.
     * If this occurs *before* the EOB characters, then it's a
     * valid NUL; if not, then we've hit the end of the buffer.
     */
    if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
      /* This was really a NUL. */
      *(yy_c_buf_p) = '\0';

    else
      { /* need more input */
      int offset = (int) ((yy_c_buf_p) - (yytext_ptr));
      ++(yy_c_buf_p);

      switch ( yy_get_next_buffer(  ) )
        {
        case EOB_ACT_LAST_MATCH:
          /* This happens because yy_g_n_b()
           * sees that we've accumulated a
           * token and flags that we need to
           * try matching the token before
           * proceeding.  But for input(),
           * there's no matching to consider.
           * So convert the EOB_ACT_LAST_MATCH
           * to EOB_ACT_END_OF_FILE.
           */

          /* Reset buffer status. */
          yyrestart( yyin );

          /*FALLTHROUGH*/

        case EOB_ACT_END_OF_FILE:
          {
          if ( yywrap(  ) )
            return 0;

          if ( ! (yy_did_buffer_switch_on_eof) )
            YY_NEW_FILE;
#ifdef __cplusplus
          return yyinput();
#else
          return input();
#endif
          }

        case EOB_ACT_CONTINUE_SCAN:
          (yy_c_buf_p) = (yytext_ptr) + offset;
          break;
        }
      }
    }

  c = *(unsigned char *) (yy_c_buf_p);  /* cast for 8-bit char's */
  *(yy_c_buf_p) = '\0'; /* preserve yytext */
  (yy_hold_char) = *++(yy_c_buf_p);

  return c;
}

/** Immediately switch to a different input stream.
 * @param input_file A readable stream.
 * 
 * @note This function does not reset the start condition to @c INITIAL .
 */
    void yyFlexLexer::yyrestart( std::istream& input_file )
{
    
  if ( ! YY_CURRENT_BUFFER ){
        yyensure_buffer_stack ();
    YY_CURRENT_BUFFER_LVALUE =
            yy_create_buffer( yyin, YY_BUF_SIZE );
  }

  yy_init_buffer( YY_CURRENT_BUFFER, input_file );
  yy_load_buffer_state(  );
}

/** Delegate to the new version that takes an istream reference.
 * @param input_file A readable stream.
 * 
 * @note This function does not reset the start condition to @c INITIAL .
 */
void yyFlexLexer::yyrestart( std::istream* input_file )
{
  yyrestart( *input_file );
}

/** Switch to a different input buffer.
 * @param new_buffer The new input buffer.
 * 
 */
    void yyFlexLexer::yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
{
    
  /* TODO. We should be able to replace this entire function body
   * with
   *    yypop_buffer_state();
   *    yypush_buffer_state(new_buffer);
     */
  yyensure_buffer_stack ();
  if ( YY_CURRENT_BUFFER == new_buffer )
    return;

  if ( YY_CURRENT_BUFFER )
    {
    /* Flush out information for old buffer. */
    *(yy_c_buf_p) = (yy_hold_char);
    YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
    YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
    }

  YY_CURRENT_BUFFER_LVALUE = new_buffer;
  yy_load_buffer_state(  );

  /* We don't actually know whether we did this switch during
   * EOF (yywrap()) processing, but the only time this flag
   * is looked at is after yywrap() is called, so it's safe
   * to go ahead and always set it.
   */
  (yy_did_buffer_switch_on_eof) = 1;
}

    void yyFlexLexer::yy_load_buffer_state()
{
      (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
  (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
  yyin.rdbuf(YY_CURRENT_BUFFER_LVALUE->yy_input_file);
  (yy_hold_char) = *(yy_c_buf_p);
}

/** Allocate and initialize an input buffer state.
 * @param file A readable stream.
 * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
 * 
 * @return the allocated buffer state.
 */
    YY_BUFFER_STATE yyFlexLexer::yy_create_buffer( std::istream& file, int size )
{
  YY_BUFFER_STATE b;
    
  b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state )  );
  if ( ! b )
    YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );

  b->yy_buf_size = size;

  /* yy_ch_buf has to be 2 characters longer than the size given because
   * we need to put in 2 end-of-buffer characters.
   */
  b->yy_ch_buf = (char *) yyalloc((yy_size_t) (b->yy_buf_size + 2)  );
  if ( ! b->yy_ch_buf )
    YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );

  b->yy_is_our_buffer = 1;

  yy_init_buffer( b, file );

  return b;
}

/** Delegate creation of buffers to the new version that takes an istream reference.
 * @param file A readable stream.
 * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
 * 
 * @return the allocated buffer state.
 */
  YY_BUFFER_STATE yyFlexLexer::yy_create_buffer( std::istream* file, int size )
{
  return yy_create_buffer( *file, size );
}

/** Destroy the buffer.
 * @param b a buffer created with yy_create_buffer()
 * 
 */
    void yyFlexLexer::yy_delete_buffer( YY_BUFFER_STATE b )
{
    
  if ( ! b )
    return;

  if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
    YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;

  if ( b->yy_is_our_buffer )
    yyfree((void *) b->yy_ch_buf  );

  yyfree((void *) b  );
}

/* Initializes or reinitializes a buffer.
 * This function is sometimes called more than once on the same buffer,
 * such as during a yyrestart() or at EOF.
 */
    void yyFlexLexer::yy_init_buffer( YY_BUFFER_STATE b, std::istream& file )

{
  int oerrno = errno;
    
  yy_flush_buffer( b );

  b->yy_input_file = (&file == 0) ? NULL : file.rdbuf();
  b->yy_fill_buffer = 1;

    /* If b is the current buffer, then yy_init_buffer was _probably_
     * called from yyrestart() or through yy_get_next_buffer.
     * In that case, we don't want to reset the lineno or column.
     */
    if (b != YY_CURRENT_BUFFER){
        b->yy_bs_lineno = 1;
        b->yy_bs_column = 0;
    }

  b->yy_is_interactive = 0;
  errno = oerrno;
}

/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
 * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
 * 
 */
    void yyFlexLexer::yy_flush_buffer( YY_BUFFER_STATE b )
{
      if ( ! b )
    return;

  b->yy_n_chars = 0;

  /* We always need two end-of-buffer characters.  The first causes
   * a transition to the end-of-buffer state.  The second causes
   * a jam in that state.
   */
  b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
  b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;

  b->yy_buf_pos = &b->yy_ch_buf[0];

  b->yy_at_bol = 1;
  b->yy_buffer_status = YY_BUFFER_NEW;

  if ( b == YY_CURRENT_BUFFER )
    yy_load_buffer_state(  );
}

/** Pushes the new state onto the stack. The new state becomes
 *  the current state. This function will allocate the stack
 *  if necessary.
 *  @param new_buffer The new state.
 *  
 */
void yyFlexLexer::yypush_buffer_state (YY_BUFFER_STATE new_buffer)
{
      if (new_buffer == NULL)
    return;

  yyensure_buffer_stack();

  /* This block is copied from yy_switch_to_buffer. */
  if ( YY_CURRENT_BUFFER )
    {
    /* Flush out information for old buffer. */
    *(yy_c_buf_p) = (yy_hold_char);
    YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
    YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
    }

  /* Only push if top exists. Otherwise, replace top. */
  if (YY_CURRENT_BUFFER)
    (yy_buffer_stack_top)++;
  YY_CURRENT_BUFFER_LVALUE = new_buffer;

  /* copied from yy_switch_to_buffer. */
  yy_load_buffer_state(  );
  (yy_did_buffer_switch_on_eof) = 1;
}

/** Removes and deletes the top of the stack, if present.
 *  The next element becomes the new top.
 *  
 */
void yyFlexLexer::yypop_buffer_state (void)
{
      if (!YY_CURRENT_BUFFER)
    return;

  yy_delete_buffer(YY_CURRENT_BUFFER );
  YY_CURRENT_BUFFER_LVALUE = NULL;
  if ((yy_buffer_stack_top) > 0)
    --(yy_buffer_stack_top);

  if (YY_CURRENT_BUFFER) {
    yy_load_buffer_state(  );
    (yy_did_buffer_switch_on_eof) = 1;
  }
}

/* Allocates the stack if it does not exist.
 *  Guarantees space for at least one push.
 */
void yyFlexLexer::yyensure_buffer_stack(void)
{
  yy_size_t num_to_alloc;
    
  if (!(yy_buffer_stack)17.9k) {

    /* First allocation is just for 2 elements, since we don't know if this
     * scanner will even need a stack. We use 2 instead of 1 to avoid an
     * immediate realloc on the next call.
         */
      num_to_alloc = 1; /* After all that talk, this was set to 1 anyways... */
    (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc
                (num_to_alloc * sizeof(struct yy_buffer_state*)
                );
    if ( ! (yy_buffer_stack) )
      YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );

    memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*));

    (yy_buffer_stack_max) = num_to_alloc;
    (yy_buffer_stack_top) = 0;
    return;
  }

  if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){

    /* Increase the buffer to prepare for a possible push. */
    yy_size_t grow_size = 8 /* arbitrary grow size */;

    num_to_alloc = (yy_buffer_stack_max) + grow_size;
    (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc
                ((yy_buffer_stack),
                num_to_alloc * sizeof(struct yy_buffer_state*)
                );
    if ( ! (yy_buffer_stack) )
      YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );

    /* zero only the new slots.*/
    memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*));
    (yy_buffer_stack_max) = num_to_alloc;
  }
}

    void yyFlexLexer::yy_push_state( int _new_state )
{
      if ( (yy_start_stack_ptr) >= (yy_start_stack_depth) )
    {
    yy_size_t new_size;

    (yy_start_stack_depth) += YY_START_STACK_INCR;
    new_size = (yy_size_t) (yy_start_stack_depth) * sizeof( int );

    if ( ! (yy_start_stack) )
      (yy_start_stack) = (int *) yyalloc(new_size  );

    else
      (yy_start_stack) = (int *) yyrealloc((void *) (yy_start_stack),new_size  );

    if ( ! (yy_start_stack) )
      YY_FATAL_ERROR( "out of memory expanding start-condition stack" );
    }

  (yy_start_stack)[(yy_start_stack_ptr)++] = YY_START;

  BEGIN(_new_state);
}

    void yyFlexLexer::yy_pop_state()
{
      if ( --(yy_start_stack_ptr) < 0 )
    YY_FATAL_ERROR( "start-condition stack underflow" );

  BEGIN((yy_start_stack)[(yy_start_stack_ptr)]);
}

    int yyFlexLexer::yy_top_state()
{
      return (yy_start_stack)[(yy_start_stack_ptr) - 1];
}

#ifndef YY_EXIT_FAILURE
#define YY_EXIT_FAILURE 2
#endif

void yyFlexLexer::LexerError( const char* msg )
{
      std::cerr << msg << std::endl;
  exit( YY_EXIT_FAILURE );
}

/* Redefine yyless() so it works in section 3 code. */

#undef yyless
#define yyless(n) \
  do \
    { \
    /* Undo effects of setting up yytext. */ \
        int yyless_macro_arg = (n); \
        YY_LESS_LINENO(yyless_macro_arg);\
    yytext[yyleng] = (yy_hold_char); \
    (yy_c_buf_p) = yytext + yyless_macro_arg; \
    (yy_hold_char) = *(yy_c_buf_p); \
    *(yy_c_buf_p) = '\0'; \
    yyleng = yyless_macro_arg; \
    } \
  while ( 0 )

/* Accessor  methods (get/set functions) to struct members. */

/*
 * Internal utility routines.
 */

#ifndef yytext_ptr
static void yy_flex_strncpy (char* s1, const char * s2, int n )
{
    
  int i;
  for ( i = 0; i < n; ++i )
    s1[i] = s2[i];
}
#endif

#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (const char * s )
{
  int n;
  for ( n = 0; s[n]; ++n )
    ;

  return n;
}
#endif

#define YYTABLES_NAME "yytables"

#line 1048 "scanner_lex.l"


/* FLEX C++ version doesn't allow us to change the specification of allocation routines, so we
 * cannot insert our own memory context here. As a result, to avoid memory fragmentation, we just
 * make sure that FLEX allocate its buffers by multiple of 4k.
 */
constexpr int kFlexBufferBlockSize = 4*1024;
static yy_size_t YYRoundUpFlexBuffer(yy_size_t size) {
  yy_size_t remainder = size % kFlexBufferBlockSize;
  if (remainder == 0) {
    return size;
  } else {
    return size + (kFlexBufferBlockSize - remainder);
  }
}

void *yyalloc(yy_size_t size) {
  /* Round up size to multiple of kMinFlexBufferSize. */
  size = YYRoundUpFlexBuffer(size);
  return malloc(size);
}

void *yyrealloc(void *ptr, yy_size_t size) {
  /* Round up size to multiple of kMinFlexBufferSize. */
  size = YYRoundUpFlexBuffer(size);
  return realloc(static_cast<char *>(ptr), size);
}

void yyfree(void *ptr) {
  free(static_cast<char *>(ptr));
}


YugabyteDB (2.13.1.0-b60, 21121d69985fbf76aa6958d8f04a9bfa936293b5)

Coverage Report

Created: 2022-03-22 16:43