Return to
FQLLEX.cpp
CVS log
Up to [Pegasus] / pegasus / src / Pegasus / FQL
|
Return to
FQLLEX.cpp
CVS log
|
Up to [Pegasus] / pegasus / src / Pegasus / FQL
|
|
File: [Pegasus] / pegasus / src / Pegasus / FQL / FQLLEX.cpp
(download)
Revision: 1.3, Fri Feb 13 22:16:08 2015 UTC (9 years, 4 months ago) by karl Branch: MAIN CVS Tags: RELEASE_2_14_1, RELEASE_2_14_0-RC2, RELEASE_2_14_0-RC1, RELEASE_2_14_0, RELEASE_2_14-root, RELEASE_2_14-branch, HEAD Changes since 1.2: +43 -40 lines BUG#: 10027 TITLE: Problem building FQL in windows DESCRIPTION: Corrected 3 issues 1). regex.h not used. 2) missing return value (not a run issue since that function not used), 3) FQLLEX.cpp call unistd.h. Fixed by setting define in FQL.l. Note that this required building the grammar. |
/* To be inserted in other files to bypass the chksrc tests */
/* NOCHKSRC */
#line 2 "FQLLEX.cpp"
#line 4 "FQLLEX.cpp"
#define YY_INT_ALIGNED short int
/* A lexical scanner generated by flex */
#define yy_create_buffer FQL__create_buffer
#define yy_delete_buffer FQL__delete_buffer
#define yy_flex_debug FQL__flex_debug
#define yy_init_buffer FQL__init_buffer
#define yy_flush_buffer FQL__flush_buffer
#define yy_load_buffer_state FQL__load_buffer_state
#define yy_switch_to_buffer FQL__switch_to_buffer
#define yyin FQL_in
#define yyleng FQL_leng
#define yylex FQL_lex
#define yylineno FQL_lineno
#define yyout FQL_out
#define yyrestart FQL_restart
#define yytext FQL_text
#define yywrap FQL_wrap
#define yyalloc FQL_alloc
#define yyrealloc FQL_realloc
#define yyfree FQL_free
#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 5
#define YY_FLEX_SUBMINOR_VERSION 35
#if YY_FLEX_SUBMINOR_VERSION > 0
#define FLEX_BETA
#endif
/* First, we deal with platform-specific or compiler-specific issues. */
/* begin standard C headers. */
#include <stdio.h>
#include <string.h>
#include <errno.h>
#include <stdlib.h>
/* 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 */
#ifdef __cplusplus
/* The "const" storage-class-modifier is valid. */
#define YY_USE_CONST
#else /* ! __cplusplus */
/* C99 requires __STDC__ to be defined as 1. */
#if defined (__STDC__)
#define YY_USE_CONST
#endif /* defined (__STDC__) */
#endif /* ! __cplusplus */
#ifdef YY_USE_CONST
#define yyconst const
#else
#define yyconst
#endif
/* Returned upon end-of-file. */
#define YY_NULL 0
/* Promotes a possibly negative, possibly signed char to an unsigned
* integer for use as an array index. If the signed char is negative,
* we want to instead treat it as an 8-bit unsigned char, hence the
* double cast.
*/
#define YY_SC_TO_UI(c) ((unsigned int) (unsigned 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 FQL_restart(FQL_in )
#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
extern int FQL_leng;
extern FILE *FQL_in, *FQL_out;
#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2
#define YY_LESS_LINENO(n)
/* Return all but the first "n" matched characters back to the input stream. */
#define yyless(n) \
do \
{ \
/* Undo effects of setting up FQL_text. */ \
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 FQL_text again */ \
} \
while ( 0 )
#define unput(c) yyunput( c, (yytext_ptr) )
#ifndef YY_TYPEDEF_YY_SIZE_T
#define YY_TYPEDEF_YY_SIZE_T
typedef size_t yy_size_t;
#endif
#ifndef YY_STRUCT_YY_BUFFER_STATE
#define YY_STRUCT_YY_BUFFER_STATE
struct yy_buffer_state
{
FILE *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.
*/
yy_size_t 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 FQL_restart()), so that the user can continue scanning by
* just pointing FQL_in at a new input file.
*/
#define YY_BUFFER_EOF_PENDING 2
};
#endif /* !YY_STRUCT_YY_BUFFER_STATE */
/* Stack of input buffers. */
static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */
/* 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)] \
: 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)]
/* yy_hold_char holds the character lost when FQL_text is formed. */
static char yy_hold_char;
static int yy_n_chars; /* number of characters read into yy_ch_buf */
int FQL_leng;
/* Points to current character in buffer. */
static char *yy_c_buf_p = (char *) 0;
static int yy_init = 0; /* whether we need to initialize */
static int yy_start = 0; /* start state number */
/* Flag which is used to allow FQL_wrap()'s to do buffer switches
* instead of setting up a fresh FQL_in. A bit of a hack ...
*/
static int yy_did_buffer_switch_on_eof;
void FQL_restart (FILE *input_file );
void FQL__switch_to_buffer (YY_BUFFER_STATE new_buffer );
YY_BUFFER_STATE FQL__create_buffer (FILE *file,int size );
void FQL__delete_buffer (YY_BUFFER_STATE b );
void FQL__flush_buffer (YY_BUFFER_STATE b );
void FQL_push_buffer_state (YY_BUFFER_STATE new_buffer );
void FQL_pop_buffer_state (void );
static void FQL_ensure_buffer_stack (void );
static void FQL__load_buffer_state (void );
static void FQL__init_buffer (YY_BUFFER_STATE b,FILE *file );
#define YY_FLUSH_BUFFER FQL__flush_buffer(YY_CURRENT_BUFFER )
YY_BUFFER_STATE FQL__scan_buffer (char *base,yy_size_t size );
YY_BUFFER_STATE FQL__scan_string (yyconst char *yy_str );
YY_BUFFER_STATE FQL__scan_bytes (yyconst char *bytes,int len );
void *FQL_alloc (yy_size_t );
void *FQL_realloc (void *,yy_size_t );
void FQL_free (void * );
#define yy_new_buffer FQL__create_buffer
#define yy_set_interactive(is_interactive) \
{ \
if ( ! YY_CURRENT_BUFFER ){ \
FQL_ensure_buffer_stack (); \
YY_CURRENT_BUFFER_LVALUE = \
FQL__create_buffer(FQL_in,YY_BUF_SIZE ); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
}
#define yy_set_bol(at_bol) \
{ \
if ( ! YY_CURRENT_BUFFER ){\
FQL_ensure_buffer_stack (); \
YY_CURRENT_BUFFER_LVALUE = \
FQL__create_buffer(FQL_in,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 */
typedef unsigned char YY_CHAR;
FILE *FQL_in = (FILE *) 0, *FQL_out = (FILE *) 0;
typedef int yy_state_type;
extern int FQL_lineno;
int FQL_lineno = 1;
extern char *FQL_text;
#define yytext_ptr FQL_text
static yy_state_type yy_get_previous_state (void );
static yy_state_type yy_try_NUL_trans (yy_state_type current_state );
static int yy_get_next_buffer (void );
static void yy_fatal_error (yyconst char msg[] );
/* Done after the current pattern has been matched and before the
* corresponding action - sets up FQL_text.
*/
#define YY_DO_BEFORE_ACTION \
(yytext_ptr) = yy_bp; \
FQL_leng = (size_t) (yy_cp - yy_bp); \
(yy_hold_char) = *yy_cp; \
*yy_cp = '\0'; \
(yy_c_buf_p) = yy_cp;
#define YY_NUM_RULES 35
#define YY_END_OF_BUFFER 36
/* 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 yyconst flex_int16_t yy_accept[84] =
{ 0,
0, 0, 36, 34, 33, 33, 34, 29, 30, 34,
31, 1, 15, 14, 14, 21, 19, 24, 32, 32,
32, 32, 32, 32, 32, 32, 32, 25, 26, 27,
28, 33, 0, 18, 0, 17, 0, 15, 14, 14,
16, 0, 0, 13, 0, 14, 14, 20, 23, 22,
32, 32, 32, 32, 8, 32, 32, 32, 7, 32,
17, 0, 0, 12, 6, 9, 32, 32, 32, 5,
32, 32, 0, 16, 12, 32, 32, 11, 4, 2,
10, 3, 0
} ;
static yyconst flex_int32_t yy_ec[256] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 2, 1, 4, 1, 1, 1, 1, 5, 6,
7, 1, 8, 9, 8, 10, 1, 11, 12, 13,
13, 13, 13, 13, 13, 13, 13, 1, 1, 14,
15, 16, 1, 1, 17, 18, 19, 20, 21, 22,
23, 23, 24, 23, 25, 26, 23, 27, 28, 23,
23, 29, 30, 31, 32, 33, 23, 34, 35, 23,
36, 1, 37, 1, 23, 1, 17, 18, 19, 20,
21, 22, 23, 23, 24, 23, 25, 26, 23, 27,
28, 23, 23, 29, 30, 31, 32, 33, 23, 34,
35, 23, 38, 1, 39, 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, 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, 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, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1
} ;
static yyconst flex_int32_t yy_meta[40] =
{ 0,
1, 1, 2, 3, 1, 1, 1, 1, 1, 1,
4, 4, 4, 1, 1, 1, 4, 4, 4, 4,
4, 4, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 1, 1, 1, 1
} ;
static yyconst flex_int16_t yy_base[90] =
{ 0,
0, 0, 165, 166, 38, 40, 41, 166, 166, 37,
166, 40, 44, 48, 57, 48, 166, 149, 136, 0,
129, 144, 130, 135, 43, 129, 128, 166, 166, 166,
166, 70, 76, 166, 151, 152, 71, 0, 75, 79,
83, 87, 96, 166, 0, 100, 104, 166, 166, 166,
0, 99, 133, 127, 0, 127, 118, 117, 0, 101,
166, 129, 112, 0, 0, 0, 102, 100, 108, 0,
96, 100, 90, 115, 0, 42, 55, 0, 0, 0,
0, 0, 166, 134, 136, 141, 146, 70, 61
} ;
static yyconst flex_int16_t yy_def[90] =
{ 0,
83, 1, 83, 83, 83, 83, 84, 83, 83, 83,
83, 83, 83, 83, 83, 83, 83, 83, 85, 85,
85, 85, 85, 85, 85, 85, 85, 83, 83, 83,
83, 83, 84, 83, 86, 87, 83, 13, 83, 83,
83, 83, 83, 83, 88, 83, 83, 83, 83, 83,
85, 85, 85, 85, 85, 85, 85, 85, 85, 85,
83, 87, 83, 89, 85, 85, 85, 85, 85, 85,
85, 85, 83, 83, 89, 85, 85, 85, 85, 85,
85, 85, 0, 83, 83, 83, 83, 83, 83
} ;
static yyconst flex_int16_t yy_nxt[206] =
{ 0,
4, 5, 6, 4, 7, 8, 9, 10, 11, 12,
13, 14, 15, 16, 17, 18, 19, 20, 20, 20,
21, 22, 20, 23, 20, 24, 25, 26, 20, 20,
27, 20, 20, 20, 20, 28, 29, 30, 31, 32,
32, 32, 32, 34, 35, 36, 37, 38, 39, 40,
41, 41, 41, 37, 42, 42, 43, 37, 46, 46,
47, 44, 48, 49, 75, 44, 37, 47, 47, 47,
57, 32, 32, 64, 58, 82, 81, 45, 34, 35,
36, 41, 41, 41, 37, 46, 46, 47, 37, 47,
47, 47, 44, 41, 41, 41, 37, 42, 42, 43,
74, 74, 74, 63, 44, 37, 43, 43, 43, 37,
46, 46, 47, 37, 47, 47, 47, 44, 65, 73,
80, 79, 74, 74, 74, 74, 74, 74, 78, 77,
76, 34, 72, 66, 33, 33, 33, 33, 33, 51,
51, 35, 71, 35, 35, 35, 62, 62, 70, 62,
62, 69, 68, 67, 34, 61, 60, 59, 56, 55,
54, 53, 52, 50, 83, 3, 83, 83, 83, 83,
83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
83, 83, 83, 83, 83
} ;
static yyconst flex_int16_t yy_chk[206] =
{ 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, 1, 5,
5, 6, 6, 7, 7, 7, 10, 10, 10, 10,
12, 12, 12, 13, 13, 13, 13, 14, 14, 14,
14, 13, 16, 16, 89, 14, 15, 15, 15, 15,
25, 32, 32, 88, 25, 77, 76, 13, 33, 33,
33, 37, 37, 37, 39, 39, 39, 39, 40, 40,
40, 40, 39, 41, 41, 41, 42, 42, 42, 42,
73, 73, 73, 41, 42, 43, 43, 43, 43, 46,
46, 46, 46, 47, 47, 47, 47, 46, 52, 63,
72, 71, 63, 63, 63, 74, 74, 74, 69, 68,
67, 62, 60, 52, 84, 84, 84, 84, 84, 85,
85, 86, 58, 86, 86, 86, 87, 87, 57, 87,
87, 56, 54, 53, 36, 35, 27, 26, 24, 23,
22, 21, 19, 18, 3, 83, 83, 83, 83, 83,
83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
83, 83, 83, 83, 83
} ;
static yy_state_type yy_last_accepting_state;
static char *yy_last_accepting_cpos;
extern int FQL__flex_debug;
int FQL__flex_debug = 0;
/* 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
char *FQL_text;
#line 1 "FQL.l"
/*
//%LICENSE////////////////////////////////////////////////////////////////
//
// Licensed to The Open Group (TOG) under one or more contributor license
// agreements. Refer to the OpenPegasusNOTICE.txt file distributed with
// this work for additional information regarding copyright ownership.
// Each contributor licenses this file to you under the OpenPegasus Open
// Source License; you may not use this file except in compliance with the
// License.
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files (the "Software"),
// to deal in the Software without restriction, including without limitation
// the rights to use, copy, modify, merge, publish, distribute, sublicense,
// and/or sell copies of the Software, and to permit persons to whom the
// Software is furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included
// in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
// IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
// CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
// TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
// SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
/////////////////////////////////////////////////////////////////////////
*/
#define YY_NO_INPUT 1
#line 37 "FQL.l"
extern int FQLInput(char* buffer, int& numRead, int numRequested);
extern int FQL_error(const char*);
#define YY_INPUT(BUF, NREAD, NREQUESTED) FQLInput(BUF, NREAD, NREQUESTED)
// set no unistd.h flag
#define YY_NO_UNISTD_H
#include <Pegasus/Common/Config.h>
#include <Pegasus/FQL/FQLParserState.h>
#include <cstring>
#include <cassert>
#include "FQLYACC.h"
#ifdef FQL_DOTRACE
# define FQL_TRACE(X) printf X
#else
# define FQL_TRACE(X)
#endif
// Define the globalParserState update for each new token as a single
// macro so that we can use this or not.
// KS_TODO need to tie this to existence of the parameters, displays, etc.
// so we could consider a simplified version without the extras.
# define FQL_STATE_UPDATE globalParserState->currentTokenPos+=FQL_leng; \
globalParserState->tokenCount++
PEGASUS_NAMESPACE_BEGIN
extern FQLParserState* globalParserState;
PEGASUS_NAMESPACE_END
PEGASUS_USING_PEGASUS;
/* TODO issues with unsignedInt, etc and the 0 one.*/
/* TODO sort out what this one is.*/
/*IDENT_CHAR [0-9A-Za-z_\x80-\xFF]
IDENT_CHAR_1 [0-9A-Za-z_\x80-\xFF]
IDENT_CHAR_NO_NUM [A-Za-z_\x80-\xFF]*/
#line 622 "FQLLEX.cpp"
#define INITIAL 0
#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
static int yy_init_globals (void );
/* Accessor methods to globals.
These are made visible to non-reentrant scanners for convenience. */
int FQL_lex_destroy (void );
int FQL_get_debug (void );
void FQL_set_debug (int debug_flag );
YY_EXTRA_TYPE FQL_get_extra (void );
void FQL_set_extra (YY_EXTRA_TYPE user_defined );
FILE *FQL_get_in (void );
void FQL_set_in (FILE * in_str );
FILE *FQL_get_out (void );
void FQL_set_out (FILE * out_str );
int FQL_get_leng (void );
char *FQL_get_text (void );
int FQL_get_lineno (void );
void FQL_set_lineno (int line_number );
/* Macros after this point can all be overridden by user definitions in
* section 1.
*/
#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int FQL_wrap (void );
#else
extern int FQL_wrap (void );
#endif
#endif
#ifndef yytext_ptr
static void yy_flex_strncpy (char *,yyconst char *,int );
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst char * );
#endif
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput (void );
#else
static int input (void );
#endif
#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
/* This used to be an fputs(), but since the string might contain NUL's,
* we now use fwrite().
*/
#define ECHO do { if (fwrite( FQL_text, FQL_leng, 1, FQL_out )) {} } while (0)
#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 ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
{ \
int c = '*'; \
size_t n; \
for ( n = 0; n < max_size && \
(c = getc( FQL_in )) != EOF && c != '\n'; ++n ) \
buf[n] = (char) c; \
if ( c == '\n' ) \
buf[n++] = (char) c; \
if ( c == EOF && ferror( FQL_in ) ) \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
result = n; \
} \
else \
{ \
errno=0; \
while ( (result = fread(buf, 1, max_size, FQL_in))==0 && ferror(FQL_in)) \
{ \
if( errno != EINTR) \
{ \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
break; \
} \
errno=0; \
clearerr(FQL_in); \
} \
}\
\
#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) yy_fatal_error( 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
extern int FQL_lex (void);
#define YY_DECL int FQL_lex (void)
#endif /* !YY_DECL */
/* Code executed at the beginning of each rule, after FQL_text and FQL_leng
* 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 break;
#endif
#define YY_RULE_SETUP \
YY_USER_ACTION
/** The main scanner function which does all the work.
*/
YY_DECL
{
register yy_state_type yy_current_state;
register char *yy_cp, *yy_bp;
register int yy_act;
#line 118 "FQL.l"
#line 810 "FQLLEX.cpp"
if ( !(yy_init) )
{
(yy_init) = 1;
#ifdef YY_USER_INIT
YY_USER_INIT;
#endif
if ( ! (yy_start) )
(yy_start) = 1; /* first start state */
if ( ! FQL_in )
FQL_in = stdin;
if ( ! FQL_out )
FQL_out = stdout;
if ( ! YY_CURRENT_BUFFER ) {
FQL_ensure_buffer_stack ();
YY_CURRENT_BUFFER_LVALUE =
FQL__create_buffer(FQL_in,YY_BUF_SIZE );
}
FQL__load_buffer_state( );
}
while ( 1 ) /* loops until end-of-file is reached */
{
yy_cp = (yy_c_buf_p);
/* Support of FQL_text. */
*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
{
register 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 >= 84 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
++yy_cp;
}
while ( yy_current_state != 83 );
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:
YY_RULE_SETUP
#line 120 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_DOT]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_DOT;
}
YY_BREAK
case 2:
YY_RULE_SETUP
#line 126 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_TRUE]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_TRUE;
}
YY_BREAK
case 3:
YY_RULE_SETUP
#line 132 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_FALSE]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_FALSE;
}
YY_BREAK
case 4:
YY_RULE_SETUP
#line 138 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_NULL]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_NULL;
}
YY_BREAK
case 5:
YY_RULE_SETUP
#line 144 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_NOT]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_NOT;
}
YY_BREAK
case 6:
YY_RULE_SETUP
#line 150 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_AND]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_AND;
}
YY_BREAK
case 7:
YY_RULE_SETUP
#line 156 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_OR]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_OR;
}
YY_BREAK
case 8:
YY_RULE_SETUP
#line 163 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_IS]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_IS;
}
YY_BREAK
case 9:
YY_RULE_SETUP
#line 170 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_ANY]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_ANY;
}
YY_BREAK
case 10:
YY_RULE_SETUP
#line 177 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_EVERY]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_EVERY;
}
YY_BREAK
case 11:
YY_RULE_SETUP
#line 184 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_LIKE]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_LIKE;
}
YY_BREAK
case 12:
YY_RULE_SETUP
#line 191 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_HEXADECIMAL]\n", FQL_text));
FQL_STATE_UPDATE;
FQL_lval.intValue = strtol(FQL_text, (char**)0, 16);
return TOK_HEXADECIMAL;
}
YY_BREAK
case 13:
YY_RULE_SETUP
#line 198 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_BINARY]\n", FQL_text));
FQL_STATE_UPDATE;
FQL_lval.intValue = strtol(FQL_text, (char**)0, 2);
return TOK_BINARY;
}
YY_BREAK
case 14:
YY_RULE_SETUP
#line 206 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_INTEGER]\n", FQL_text));
FQL_STATE_UPDATE;
FQL_lval.intValue = strtol(FQL_text, (char**)0, 10);
FQL_TRACE(("LEX: return TOK_UNSIGNED_INTEGER %d\n", FQL_lval.intValue));
return TOK_INTEGER;
}
YY_BREAK
case 15:
YY_RULE_SETUP
#line 215 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_INTEGER]\n", FQL_text));
FQL_STATE_UPDATE;
FQL_lval.intValue = 0;
return TOK_INTEGER;
}
YY_BREAK
case 16:
YY_RULE_SETUP
#line 223 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_DOUBLE]\n", FQL_text));
FQL_STATE_UPDATE;
FQL_lval.doubleValue = strtod((char*)FQL_text, (char**)0);
return TOK_DOUBLE;
}
YY_BREAK
case 17:
YY_RULE_SETUP
#line 231 "FQL.l"
{
/* ATTN-B: handle long literals by using yyinput(). */
/* ATTN-B: Handle expansion of special characters */
FQL_TRACE(("LEX: %s [TOK_STRING]\n", FQL_text));
FQL_STATE_UPDATE;
/* Copy the string (but remove the surrounding quotes */
{
size_t n = strlen(FQL_text) - 2;
char* strValue = new char[n + 1];
memcpy(strValue, FQL_text + 1, n);
strValue[n] = '\0';
FQL_lval.strValue = strValue;
globalParserState->outstandingStrings.append(strValue);
}
return TOK_STRING;
}
YY_BREAK
case 18:
*yy_cp = (yy_hold_char); /* undo effects of setting up FQL_text */
(yy_c_buf_p) = yy_cp -= 1;
YY_DO_BEFORE_ACTION; /* set up FQL_text again */
YY_RULE_SETUP
#line 253 "FQL.l"
{
FQL_error("Unterminated string");
FQL_STATE_UPDATE;
}
YY_BREAK
case 19:
YY_RULE_SETUP
#line 260 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_EQ]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_EQ;
}
YY_BREAK
case 20:
YY_RULE_SETUP
#line 266 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_LE]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_LE;
}
YY_BREAK
case 21:
YY_RULE_SETUP
#line 272 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_LT]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_LT;
}
YY_BREAK
case 22:
YY_RULE_SETUP
#line 278 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_GE]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_GE;
}
YY_BREAK
case 23:
YY_RULE_SETUP
#line 284 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_NE]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_NE;
}
YY_BREAK
case 24:
YY_RULE_SETUP
#line 290 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_GT]\n", FQL_text));
FQL_STATE_UPDATE;
return TOK_GT;
}
YY_BREAK
case 25:
YY_RULE_SETUP
#line 296 "FQL.l"
{
FQL_TRACE(("LEX: [TOK_LBRKT]\n "));
FQL_STATE_UPDATE;
return TOK_LBRKT;
}
YY_BREAK
case 26:
YY_RULE_SETUP
#line 302 "FQL.l"
{
FQL_TRACE(("LEX: [TOK_RBRKT]\n "));
FQL_STATE_UPDATE;
return TOK_RBRKT;
}
YY_BREAK
case 27:
YY_RULE_SETUP
#line 308 "FQL.l"
{
FQL_TRACE(("LEX: [TOK_LBRACE] \n"));
FQL_STATE_UPDATE;
return TOK_LBRACE;
}
YY_BREAK
case 28:
YY_RULE_SETUP
#line 314 "FQL.l"
{
FQL_TRACE(("LEX: [TOK_RBRACE]\n "));
FQL_STATE_UPDATE;
return TOK_RBRACE;
}
YY_BREAK
case 29:
YY_RULE_SETUP
#line 320 "FQL.l"
{
FQL_TRACE(("LEX: [TOK_LPAREN] \n"));
FQL_STATE_UPDATE;
return TOK_LPAREN;
}
YY_BREAK
case 30:
YY_RULE_SETUP
#line 326 "FQL.l"
{
FQL_TRACE(("LEX: [TOK_RPAREN]\n "));
FQL_STATE_UPDATE;
return TOK_RPAREN;
}
YY_BREAK
case 31:
YY_RULE_SETUP
#line 332 "FQL.l"
{
FQL_TRACE(("LEX: [TOK_COMMA]\n "));
FQL_STATE_UPDATE;
return TOK_COMMA;
}
YY_BREAK
case 32:
YY_RULE_SETUP
#line 338 "FQL.l"
{
FQL_TRACE(("LEX: %s [TOK_IDENTIFIER]\n", FQL_text));
FQL_STATE_UPDATE;
{
size_t n = strlen(FQL_text);
char* strValue = new char[n + 1];
memcpy(strValue, FQL_text, n);
strValue[n] = '\0';
FQL_lval.strValue = strValue;
globalParserState->outstandingStrings.append(strValue);
}
return TOK_IDENTIFIER;
}
YY_BREAK
case 33:
/* rule 33 can match eol */
YY_RULE_SETUP
#line 356 "FQL.l"
{
/* Ignore blanks */
}
YY_BREAK
case 34:
YY_RULE_SETUP
#line 361 "FQL.l"
{
FQL_lval.intValue = 0;
return TOK_UNEXPECTED_CHAR;
}
YY_BREAK
case 35:
YY_RULE_SETUP
#line 366 "FQL.l"
ECHO;
YY_BREAK
#line 1242 "FQLLEX.cpp"
case YY_STATE_EOF(INITIAL):
yyterminate();
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 FQL_in at a new source and called
* FQL_lex(). 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 = FQL_in;
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 ( FQL_wrap( ) )
{
/* Note: because we've taken care in
* yy_get_next_buffer() to have set up
* FQL_text, 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 FQL_lex */
/* 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
*/
static int yy_get_next_buffer (void)
{
register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
register char *source = (yytext_ptr);
register 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; ++i )
*(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;
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. */
FQL_realloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 );
}
else
/* Can't grow it, we don't own it. */
b->yy_ch_buf = 0;
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), (size_t) 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;
FQL_restart(FQL_in );
}
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_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
/* Extend the array by 50%, plus the number we really need. */
yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1);
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) FQL_realloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,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 */
static yy_state_type yy_get_previous_state (void)
{
register yy_state_type yy_current_state;
register char *yy_cp;
yy_current_state = (yy_start);
for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
{
register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*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 >= 84 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) 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 );
*/
static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state )
{
register int yy_is_jam;
register char *yy_cp = (yy_c_buf_p);
register 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 >= 84 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
yy_is_jam = (yy_current_state == 83);
return yy_is_jam ? 0 : yy_current_state;
}
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput (void)
#else
static int input (void)
#endif
{
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 = (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. */
FQL_restart(FQL_in );
/*FALLTHROUGH*/
case EOB_ACT_END_OF_FILE:
{
if ( FQL_wrap( ) )
return EOF;
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 FQL_text */
(yy_hold_char) = *++(yy_c_buf_p);
return c;
}
#endif /* ifndef YY_NO_INPUT */
/** 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 FQL_restart (FILE * input_file )
{
if ( ! YY_CURRENT_BUFFER ){
FQL_ensure_buffer_stack ();
YY_CURRENT_BUFFER_LVALUE =
FQL__create_buffer(FQL_in,YY_BUF_SIZE );
}
FQL__init_buffer(YY_CURRENT_BUFFER,input_file );
FQL__load_buffer_state( );
}
/** Switch to a different input buffer.
* @param new_buffer The new input buffer.
*
*/
void FQL__switch_to_buffer (YY_BUFFER_STATE new_buffer )
{
/* TODO. We should be able to replace this entire function body
* with
* FQL_pop_buffer_state();
* FQL_push_buffer_state(new_buffer);
*/
FQL_ensure_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;
FQL__load_buffer_state( );
/* We don't actually know whether we did this switch during
* EOF (FQL_wrap()) processing, but the only time this flag
* is looked at is after FQL_wrap() is called, so it's safe
* to go ahead and always set it.
*/
(yy_did_buffer_switch_on_eof) = 1;
}
static void FQL__load_buffer_state (void)
{
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
(yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
FQL_in = 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 FQL__create_buffer (FILE * file, int size )
{
YY_BUFFER_STATE b;
b = (YY_BUFFER_STATE) FQL_alloc(sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in FQL__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 *) FQL_alloc(b->yy_buf_size + 2 );
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in FQL__create_buffer()" );
b->yy_is_our_buffer = 1;
FQL__init_buffer(b,file );
return b;
}
/** Destroy the buffer.
* @param b a buffer created with FQL__create_buffer()
*
*/
void FQL__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 )
FQL_free((void *) b->yy_ch_buf );
FQL_free((void *) b );
}
/* Initializes or reinitializes a buffer.
* This function is sometimes called more than once on the same buffer,
* such as during a FQL_restart() or at EOF.
*/
static void FQL__init_buffer (YY_BUFFER_STATE b, FILE * file )
{
int oerrno = errno;
FQL__flush_buffer(b );
b->yy_input_file = file;
b->yy_fill_buffer = 1;
/* If b is the current buffer, then FQL__init_buffer was _probably_
* called from FQL_restart() 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 FQL__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 )
FQL__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 FQL_push_buffer_state (YY_BUFFER_STATE new_buffer )
{
if (new_buffer == NULL)
return;
FQL_ensure_buffer_stack();
/* This block is copied from FQL__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 FQL__switch_to_buffer. */
FQL__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 FQL_pop_buffer_state (void)
{
if (!YY_CURRENT_BUFFER)
return;
FQL__delete_buffer(YY_CURRENT_BUFFER );
YY_CURRENT_BUFFER_LVALUE = NULL;
if ((yy_buffer_stack_top) > 0)
--(yy_buffer_stack_top);
if (YY_CURRENT_BUFFER) {
FQL__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.
*/
static void FQL_ensure_buffer_stack (void)
{
int num_to_alloc;
if (!(yy_buffer_stack)) {
/* 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;
(yy_buffer_stack) = (struct yy_buffer_state**)FQL_alloc
(num_to_alloc * sizeof(struct yy_buffer_state*)
);
if ( ! (yy_buffer_stack) )
YY_FATAL_ERROR( "out of dynamic memory in FQL_ensure_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. */
int grow_size = 8 /* arbitrary grow size */;
num_to_alloc = (yy_buffer_stack_max) + grow_size;
(yy_buffer_stack) = (struct yy_buffer_state**)FQL_realloc
((yy_buffer_stack),
num_to_alloc * sizeof(struct yy_buffer_state*)
);
if ( ! (yy_buffer_stack) )
YY_FATAL_ERROR( "out of dynamic memory in FQL_ensure_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;
}
}
/** Setup the input buffer state to scan directly from a user-specified character buffer.
* @param base the character buffer
* @param size the size in bytes of the character buffer
*
* @return the newly allocated buffer state object.
*/
YY_BUFFER_STATE FQL__scan_buffer (char * base, yy_size_t size )
{
YY_BUFFER_STATE b;
if ( size < 2 ||
base[size-2] != YY_END_OF_BUFFER_CHAR ||
base[size-1] != YY_END_OF_BUFFER_CHAR )
/* They forgot to leave room for the EOB's. */
return 0;
b = (YY_BUFFER_STATE) FQL_alloc(sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in FQL__scan_buffer()" );
b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
b->yy_buf_pos = b->yy_ch_buf = base;
b->yy_is_our_buffer = 0;
b->yy_input_file = 0;
b->yy_n_chars = b->yy_buf_size;
b->yy_is_interactive = 0;
b->yy_at_bol = 1;
b->yy_fill_buffer = 0;
b->yy_buffer_status = YY_BUFFER_NEW;
FQL__switch_to_buffer(b );
return b;
}
/** Setup the input buffer state to scan a string. The next call to FQL_lex() will
* scan from a @e copy of @a str.
* @param yystr a NUL-terminated string to scan
*
* @return the newly allocated buffer state object.
* @note If you want to scan bytes that may contain NUL values, then use
* FQL__scan_bytes() instead.
*/
YY_BUFFER_STATE FQL__scan_string (yyconst char * yystr )
{
return FQL__scan_bytes(yystr,strlen(yystr) );
}
/** Setup the input buffer state to scan the given bytes. The next call to FQL_lex() will
* scan from a @e copy of @a bytes.
* @param yybytes the byte buffer to scan
* @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
*
* @return the newly allocated buffer state object.
*/
YY_BUFFER_STATE FQL__scan_bytes (yyconst char * yybytes, int _yybytes_len )
{
YY_BUFFER_STATE b;
char *buf;
yy_size_t n;
int i;
/* Get memory for full buffer, including space for trailing EOB's. */
n = _yybytes_len + 2;
buf = (char *) FQL_alloc(n );
if ( ! buf )
YY_FATAL_ERROR( "out of dynamic memory in FQL__scan_bytes()" );
for ( i = 0; i < _yybytes_len; ++i )
buf[i] = yybytes[i];
buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
b = FQL__scan_buffer(buf,n );
if ( ! b )
YY_FATAL_ERROR( "bad buffer in FQL__scan_bytes()" );
/* It's okay to grow etc. this buffer, and we should throw it
* away when we're done.
*/
b->yy_is_our_buffer = 1;
return b;
}
#ifndef YY_EXIT_FAILURE
#define YY_EXIT_FAILURE 2
#endif
static void yy_fatal_error (yyconst char* msg )
{
(void) fprintf( stderr, "%s\n", msg );
exit( YY_EXIT_FAILURE );
}
/* Redefine yyless() so it works in section 3 code. */
#undef yyless
#define yyless(n) \
do \
{ \
/* Undo effects of setting up FQL_text. */ \
int yyless_macro_arg = (n); \
YY_LESS_LINENO(yyless_macro_arg);\
FQL_text[FQL_leng] = (yy_hold_char); \
(yy_c_buf_p) = FQL_text + yyless_macro_arg; \
(yy_hold_char) = *(yy_c_buf_p); \
*(yy_c_buf_p) = '\0'; \
FQL_leng = yyless_macro_arg; \
} \
while ( 0 )
/* Accessor methods (get/set functions) to struct members. */
/** Get the current line number.
*
*/
int FQL_get_lineno (void)
{
return FQL_lineno;
}
/** Get the input stream.
*
*/
FILE *FQL_get_in (void)
{
return FQL_in;
}
/** Get the output stream.
*
*/
FILE *FQL_get_out (void)
{
return FQL_out;
}
/** Get the length of the current token.
*
*/
int FQL_get_leng (void)
{
return FQL_leng;
}
/** Get the current token.
*
*/
char *FQL_get_text (void)
{
return FQL_text;
}
/** Set the current line number.
* @param line_number
*
*/
void FQL_set_lineno (int line_number )
{
FQL_lineno = line_number;
}
/** Set the input stream. This does not discard the current
* input buffer.
* @param in_str A readable stream.
*
* @see FQL__switch_to_buffer
*/
void FQL_set_in (FILE * in_str )
{
FQL_in = in_str ;
}
void FQL_set_out (FILE * out_str )
{
FQL_out = out_str ;
}
int FQL_get_debug (void)
{
return FQL__flex_debug;
}
void FQL_set_debug (int bdebug )
{
FQL__flex_debug = bdebug ;
}
static int yy_init_globals (void)
{
/* Initialization is the same as for the non-reentrant scanner.
* This function is called from FQL_lex_destroy(), so don't allocate here.
*/
(yy_buffer_stack) = 0;
(yy_buffer_stack_top) = 0;
(yy_buffer_stack_max) = 0;
(yy_c_buf_p) = (char *) 0;
(yy_init) = 0;
(yy_start) = 0;
/* Defined in main.c */
#ifdef YY_STDINIT
FQL_in = stdin;
FQL_out = stdout;
#else
FQL_in = (FILE *) 0;
FQL_out = (FILE *) 0;
#endif
/* For future reference: Set errno on error, since we are called by
* FQL_lex_init()
*/
return 0;
}
/* FQL_lex_destroy is for both reentrant and non-reentrant scanners. */
int FQL_lex_destroy (void)
{
/* Pop the buffer stack, destroying each element. */
while(YY_CURRENT_BUFFER){
FQL__delete_buffer(YY_CURRENT_BUFFER );
YY_CURRENT_BUFFER_LVALUE = NULL;
FQL_pop_buffer_state();
}
/* Destroy the stack itself. */
FQL_free((yy_buffer_stack) );
(yy_buffer_stack) = NULL;
/* Reset the globals. This is important in a non-reentrant scanner so the next time
* FQL_lex() is called, initialization will occur. */
yy_init_globals( );
return 0;
}
/*
* Internal utility routines.
*/
#ifndef yytext_ptr
static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
{
register int i;
for ( i = 0; i < n; ++i )
s1[i] = s2[i];
}
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst char * s )
{
register int n;
for ( n = 0; s[n]; ++n )
;
return n;
}
#endif
void *FQL_alloc (yy_size_t size )
{
return (void *) malloc( size );
}
void *FQL_realloc (void * ptr, yy_size_t size )
{
/* The cast to (char *) in the following accommodates both
* implementations that use char* generic pointers, and those
* that use void* generic pointers. It works with the latter
* because both ANSI C and C++ allow castless assignment from
* any pointer type to void*, and deal with argument conversions
* as though doing an assignment.
*/
return (void *) realloc( (char *) ptr, size );
}
void FQL_free (void * ptr )
{
free( (char *) ptr ); /* see FQL_realloc() for (char *) cast */
}
#define YYTABLES_NAME "yytables"
#line 366 "FQL.l"
extern "C" int FQL_wrap()
{
return 1;
}
/*
{POSITIVE_DECIMAL_DIGIT}{DECIMAL_DIGIT}* {
FQL_TRACE(("LEX: %s [TOK_INTEGER]\n", FQL_text));
printf("LEX: found POSITIVEDECIMAL %s\n", FQL_text);
FQL_lval.intValue = strtol(FQL_text, (char**)0, 10);
// TODO returns in, not long
FQL_TRACE("LEX: return TOK_UNSIGNED_INTEGER %d\n", FQL_lval.intValue);
return TOK_UNSIGNED_INTEGER;
}
// removed comma from this one
[\*(),] {
FQL_TRACE(("LEX: %c\n", FQL_text[0]));
return FQL_text[0];
}
*/
| No CVS admin address has been configured |
Powered by ViewCVS 0.9.2 |