You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
2240 lines
57 KiB
2240 lines
57 KiB
#line 2 "qmake_lex.cpp"
|
|
|
|
#line 4 "qmake_lex.cpp"
|
|
|
|
#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 5
|
|
#define YY_FLEX_SUBMINOR_VERSION 33
|
|
#if YY_FLEX_SUBMINOR_VERSION > 0
|
|
#define FLEX_BETA
|
|
#endif
|
|
|
|
/* %if-c++-only */
|
|
/* 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
|
|
/* %endif */
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
|
|
/* First, we deal with platform-specific or compiler-specific issues. */
|
|
|
|
/* begin standard C headers. */
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
|
|
/* %if-tables-serialization */
|
|
/* %endif */
|
|
/* end standard C headers. */
|
|
|
|
/* %if-c-or-c++ */
|
|
/* flex integer type definitions */
|
|
|
|
#ifndef FLEXINT_H
|
|
#define FLEXINT_H
|
|
|
|
/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
|
|
|
|
#if __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;
|
|
#endif /* ! C99 */
|
|
|
|
/* 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 /* ! FLEXINT_H */
|
|
|
|
/* %endif */
|
|
|
|
/* %if-c++-only */
|
|
/* begin standard C++ headers. */
|
|
#include <iostream>
|
|
#include <errno.h>
|
|
#include <cstdlib>
|
|
#include <cstring>
|
|
/* end standard C++ headers. */
|
|
/* %endif */
|
|
|
|
#ifdef __cplusplus
|
|
|
|
/* The "const" storage-class-modifier is valid. */
|
|
#define YY_USE_CONST
|
|
|
|
#else /* ! __cplusplus */
|
|
|
|
#if __STDC__
|
|
|
|
#define YY_USE_CONST
|
|
|
|
#endif /* __STDC__ */
|
|
#endif /* ! __cplusplus */
|
|
|
|
#ifdef YY_USE_CONST
|
|
#define yyconst const
|
|
#else
|
|
#define yyconst
|
|
#endif
|
|
|
|
/* %not-for-header */
|
|
|
|
/* Returned upon end-of-file. */
|
|
#define YY_NULL 0
|
|
/* %ok-for-header */
|
|
|
|
/* %not-for-header */
|
|
|
|
/* 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)
|
|
/* %ok-for-header */
|
|
|
|
/* %if-reentrant */
|
|
/* %endif */
|
|
|
|
/* %if-not-reentrant */
|
|
|
|
/* %endif */
|
|
|
|
/* 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
|
|
#define YY_BUF_SIZE 16384
|
|
#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
|
|
|
|
/* %if-not-reentrant */
|
|
extern int yyleng;
|
|
/* %endif */
|
|
|
|
/* %if-c-only */
|
|
/* %if-not-reentrant */
|
|
/* %endif */
|
|
/* %endif */
|
|
|
|
#define EOB_ACT_CONTINUE_SCAN 0
|
|
#define EOB_ACT_END_OF_FILE 1
|
|
#define EOB_ACT_LAST_MATCH 2
|
|
|
|
/* Note: We specifically omit the test for yy_rule_can_match_eol because it requires
|
|
* access to the local variable yy_act. Since yyless() is a macro, it would break
|
|
* existing scanners that call yyless() from OUTSIDE yylex.
|
|
* One obvious solution it to make yy_act a global. I tried that, and saw
|
|
* a 5% performance hit in a non-yylineno scanner, because yy_act is
|
|
* normally declared as a register variable-- so it is not worth it.
|
|
*/
|
|
#define YY_LESS_LINENO(n) \
|
|
do { \
|
|
int yyl;\
|
|
for ( yyl = n; yyl < yyleng; ++yyl )\
|
|
if ( yytext[yyl] == '\n' )\
|
|
--yylineno;\
|
|
}while(0)
|
|
|
|
/* 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) )
|
|
|
|
/* The following is because we cannot portably get our hands on size_t
|
|
* (without autoconf's help, which isn't available because we want
|
|
* flex-generated scanners to compile on their own).
|
|
*/
|
|
|
|
#ifndef YY_TYPEDEF_YY_SIZE_T
|
|
#define YY_TYPEDEF_YY_SIZE_T
|
|
typedef unsigned int yy_size_t;
|
|
#endif
|
|
|
|
#ifndef YY_STRUCT_YY_BUFFER_STATE
|
|
#define YY_STRUCT_YY_BUFFER_STATE
|
|
struct yy_buffer_state
|
|
{
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
|
|
/* %if-c++-only */
|
|
std::istream* yy_input_file;
|
|
/* %endif */
|
|
|
|
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 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 */
|
|
|
|
/* %if-c-only Standard (non-C++) definition */
|
|
/* %not-for-header */
|
|
|
|
/* %if-not-reentrant */
|
|
/* %endif */
|
|
/* %ok-for-header */
|
|
|
|
/* %endif */
|
|
|
|
/* 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)]
|
|
|
|
/* %if-c-only Standard (non-C++) definition */
|
|
/* %if-not-reentrant */
|
|
/* %not-for-header */
|
|
|
|
/* %ok-for-header */
|
|
|
|
/* %endif */
|
|
/* %endif */
|
|
|
|
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)
|
|
|
|
/* %% [1.0] yytext/yyin/yyout/yy_state_type/yylineno etc. def's & init go here */
|
|
/* Begin user sect3 */
|
|
|
|
#define yywrap() 1
|
|
#define YY_SKIP_YYWRAP
|
|
|
|
#define FLEX_DEBUG
|
|
|
|
typedef unsigned char YY_CHAR;
|
|
|
|
#define yytext_ptr yytext
|
|
#define YY_INTERACTIVE
|
|
|
|
#include <FlexLexer.h>
|
|
int yyFlexLexer::yylex()
|
|
{
|
|
LexerError( "yyFlexLexer::yylex invoked but %option yyclass used" );
|
|
return 0;
|
|
}
|
|
|
|
#define YY_DECL int TQMake::Lexer::yylex()
|
|
|
|
/* %if-c-only Standard (non-C++) definition */
|
|
/* %endif */
|
|
|
|
/* 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; \
|
|
/* %% [2.0] code to fiddle yytext and yyleng for yymore() goes here \ */\
|
|
yyleng = (size_t) (yy_cp - yy_bp); \
|
|
(yy_hold_char) = *yy_cp; \
|
|
*yy_cp = '\0'; \
|
|
/* %% [3.0] code to copy yytext_ptr to yytext[] goes here, if %array \ */\
|
|
(yy_c_buf_p) = yy_cp;
|
|
|
|
/* %% [4.0] data tables for the DFA and the user's section 1 definitions go here */
|
|
#define YY_NUM_RULES 23
|
|
#define YY_END_OF_BUFFER 24
|
|
/* 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[76] =
|
|
{ 0,
|
|
0, 0, 0, 0, 0, 0, 24, 23, 1, 21,
|
|
21, 5, 23, 17, 18, 5, 23, 5, 19, 9,
|
|
23, 14, 16, 23, 7, 2, 7, 7, 23, 23,
|
|
6, 1, 21, 5, 0, 22, 22, 0, 12, 10,
|
|
11, 0, 15, 0, 3, 3, 0, 13, 7, 7,
|
|
0, 2, 20, 20, 7, 0, 7, 0, 7, 0,
|
|
6, 4, 4, 0, 4, 4, 7, 0, 7, 7,
|
|
0, 0, 8, 0, 0
|
|
} ;
|
|
|
|
static yyconst flex_int32_t yy_ec[256] =
|
|
{ 0,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
|
|
1, 1, 4, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 2, 5, 6, 7, 8, 1, 1, 1, 9,
|
|
10, 11, 12, 1, 13, 14, 1, 15, 15, 15,
|
|
15, 15, 15, 15, 15, 15, 15, 16, 1, 1,
|
|
17, 1, 1, 1, 18, 18, 18, 18, 18, 18,
|
|
18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
|
|
18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
|
|
1, 19, 1, 1, 20, 1, 18, 18, 18, 18,
|
|
|
|
18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
|
|
18, 18, 18, 18, 18, 18, 18, 18, 18, 18,
|
|
18, 18, 21, 22, 23, 24, 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[25] =
|
|
{ 0,
|
|
1, 2, 3, 3, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1
|
|
} ;
|
|
|
|
static yyconst flex_int16_t yy_base[85] =
|
|
{ 0,
|
|
0, 0, 23, 41, 28, 30, 132, 289, 126, 289,
|
|
123, 56, 32, 289, 289, 106, 105, 104, 35, 289,
|
|
77, 289, 289, 103, 34, 55, 47, 69, 87, 108,
|
|
106, 111, 289, 0, 79, 289, 96, 82, 289, 289,
|
|
289, 44, 289, 0, 289, 90, 59, 289, 68, 289,
|
|
85, 93, 289, 74, 105, 123, 141, 98, 99, 45,
|
|
42, 289, 47, 105, 289, 36, 159, 177, 195, 213,
|
|
108, 231, 249, 112, 289, 268, 271, 274, 27, 277,
|
|
279, 281, 284, 286
|
|
} ;
|
|
|
|
static yyconst flex_int16_t yy_def[85] =
|
|
{ 0,
|
|
75, 1, 76, 76, 77, 77, 75, 75, 75, 75,
|
|
75, 75, 78, 75, 75, 12, 75, 12, 75, 75,
|
|
75, 75, 75, 75, 79, 75, 80, 78, 79, 81,
|
|
81, 75, 75, 12, 78, 75, 75, 78, 75, 75,
|
|
75, 75, 75, 21, 75, 75, 82, 75, 79, 75,
|
|
79, 75, 75, 75, 83, 84, 84, 80, 82, 81,
|
|
81, 75, 75, 82, 75, 75, 83, 84, 83, 84,
|
|
83, 84, 84, 84, 0, 75, 75, 75, 75, 75,
|
|
75, 75, 75, 75
|
|
} ;
|
|
|
|
static yyconst flex_int16_t yy_nxt[314] =
|
|
{ 0,
|
|
8, 9, 10, 11, 12, 8, 13, 12, 14, 15,
|
|
16, 17, 18, 8, 12, 19, 20, 12, 21, 12,
|
|
22, 8, 23, 24, 26, 10, 11, 49, 27, 28,
|
|
8, 8, 8, 8, 36, 37, 42, 31, 65, 31,
|
|
50, 29, 26, 10, 11, 42, 27, 28, 56, 62,
|
|
38, 61, 51, 57, 61, 43, 52, 53, 54, 29,
|
|
34, 65, 66, 34, 43, 58, 34, 34, 34, 34,
|
|
34, 36, 37, 34, 50, 34, 53, 34, 44, 45,
|
|
46, 36, 37, 47, 62, 63, 51, 38, 44, 45,
|
|
46, 50, 45, 59, 52, 53, 54, 38, 36, 75,
|
|
|
|
38, 65, 66, 51, 57, 51, 68, 65, 66, 75,
|
|
69, 70, 32, 75, 70, 61, 58, 61, 68, 48,
|
|
41, 40, 39, 71, 68, 33, 71, 32, 73, 68,
|
|
74, 75, 75, 75, 75, 75, 75, 75, 75, 75,
|
|
75, 74, 68, 75, 75, 75, 73, 68, 75, 75,
|
|
75, 75, 75, 75, 75, 75, 75, 75, 75, 74,
|
|
68, 75, 75, 75, 69, 70, 75, 75, 75, 75,
|
|
75, 75, 75, 75, 75, 75, 75, 71, 68, 75,
|
|
75, 75, 73, 68, 75, 75, 75, 75, 75, 75,
|
|
75, 75, 75, 75, 75, 74, 68, 75, 75, 75,
|
|
|
|
69, 70, 75, 75, 75, 75, 75, 75, 75, 75,
|
|
75, 75, 75, 71, 68, 75, 75, 75, 73, 68,
|
|
75, 75, 75, 75, 75, 75, 75, 75, 75, 75,
|
|
75, 74, 68, 75, 75, 75, 73, 68, 75, 75,
|
|
75, 75, 75, 75, 75, 75, 75, 75, 75, 74,
|
|
68, 75, 75, 75, 73, 68, 75, 75, 75, 75,
|
|
75, 75, 75, 75, 75, 75, 75, 74, 25, 25,
|
|
25, 30, 30, 30, 35, 35, 35, 55, 55, 60,
|
|
60, 64, 64, 64, 67, 67, 72, 72, 7, 75,
|
|
75, 75, 75, 75, 75, 75, 75, 75, 75, 75,
|
|
|
|
75, 75, 75, 75, 75, 75, 75, 75, 75, 75,
|
|
75, 75, 75
|
|
} ;
|
|
|
|
static yyconst flex_int16_t yy_chk[314] =
|
|
{ 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, 3, 3, 3, 79, 3, 3,
|
|
5, 5, 6, 6, 13, 13, 19, 5, 66, 6,
|
|
25, 3, 4, 4, 4, 42, 4, 4, 27, 63,
|
|
13, 61, 25, 27, 60, 19, 26, 26, 26, 4,
|
|
12, 47, 47, 12, 42, 27, 12, 12, 12, 12,
|
|
12, 28, 28, 12, 49, 12, 54, 12, 21, 21,
|
|
21, 35, 35, 21, 38, 38, 49, 28, 29, 29,
|
|
29, 51, 46, 29, 52, 52, 52, 35, 37, 58,
|
|
|
|
38, 59, 59, 51, 58, 29, 55, 64, 64, 71,
|
|
55, 55, 32, 74, 71, 31, 58, 30, 74, 24,
|
|
18, 17, 16, 55, 56, 11, 71, 9, 56, 56,
|
|
74, 7, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
0, 56, 57, 0, 0, 0, 57, 57, 0, 0,
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 57,
|
|
67, 0, 0, 0, 67, 67, 0, 0, 0, 0,
|
|
0, 0, 0, 0, 0, 0, 0, 67, 68, 0,
|
|
0, 0, 68, 68, 0, 0, 0, 0, 0, 0,
|
|
0, 0, 0, 0, 0, 68, 69, 0, 0, 0,
|
|
|
|
69, 69, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
0, 0, 0, 69, 70, 0, 0, 0, 70, 70,
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
0, 70, 72, 0, 0, 0, 72, 72, 0, 0,
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 72,
|
|
73, 0, 0, 0, 73, 73, 0, 0, 0, 0,
|
|
0, 0, 0, 0, 0, 0, 0, 73, 76, 76,
|
|
76, 77, 77, 77, 78, 78, 78, 80, 80, 81,
|
|
81, 82, 82, 82, 83, 83, 84, 84, 75, 75,
|
|
75, 75, 75, 75, 75, 75, 75, 75, 75, 75,
|
|
|
|
75, 75, 75, 75, 75, 75, 75, 75, 75, 75,
|
|
75, 75, 75
|
|
} ;
|
|
|
|
/* Table of booleans, true if rule could match eol. */
|
|
static yyconst flex_int32_t yy_rule_can_match_eol[24] =
|
|
{ 0,
|
|
0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
1, 1, 1, 0, };
|
|
|
|
static yyconst flex_int16_t yy_rule_linenum[23] =
|
|
{ 0,
|
|
81, 83, 88, 94, 100, 105, 113, 119, 125, 131,
|
|
137, 143, 149, 155, 159, 163, 167, 172, 177, 183,
|
|
190, 197
|
|
} ;
|
|
|
|
/* 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 "qmake.ll"
|
|
#line 2 "qmake.ll"
|
|
/***************************************************************************
|
|
* Copyright (C) 2005 by Alexander Dymo *
|
|
* adymo@kdevelop.org *
|
|
* *
|
|
* This program is free software; you can redistribute it and/or modify *
|
|
* it under the terms of the GNU Library General Public License as *
|
|
* published by the Free Software Foundation; either version 2 of the *
|
|
* License, or (at your option) any later version. *
|
|
* *
|
|
* This program is distributed in the hope that it will be useful, *
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
|
|
* GNU General Public License for more details. *
|
|
* *
|
|
* You should have received a copy of the GNU Library General Public *
|
|
* License along with this program; if not, write to the *
|
|
* Free Software Foundation, Inc., *
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
|
|
***************************************************************************/
|
|
|
|
#include <stdlib.h>
|
|
|
|
#define DONT_INCLUDE_FLEXLEXER
|
|
|
|
#include "qmake_lex.h"
|
|
|
|
/**
|
|
@file qmake.ll
|
|
TQMake Lexer
|
|
|
|
There are 3 types of identifiers recognized by this lexer:
|
|
-id_simple: examples of such identifiers are qmake variables and scoped variables
|
|
at the left of the operator in assignments (like "SOURCES" in "SOURCES+=foo.cpp goo.cpp");
|
|
-id_list: those are "value list identifiers" at the right side in assignments
|
|
(like "foo.cpp goo.cpp" in "SOURCES+=foo.cpp goo.cpp");
|
|
-id_args: function arguments recognized as one identifier
|
|
(example: ""${TQMAKE_FILE} is intended only for Windows!""
|
|
in "!win32-*:!wince-*:error("${TQMAKE_FILE} is intended only for Windows!")" statements).
|
|
.
|
|
|
|
To recognize those identifiers two additional start conditions are used: list and funcargs.
|
|
|
|
@note "Not" operator (!) is recognized as a part of an identifier. Linefeeds passed to
|
|
the parser as NEWLINE tokens to preserve file structure but whitespaces are stripped
|
|
so no indentation is preserved by this lexer (and parser).
|
|
|
|
To debug this lexer, put the line below into the next flex file section.
|
|
%option debug
|
|
*/
|
|
|
|
|
|
#line 657 "qmake_lex.cpp"
|
|
|
|
#define INITIAL 0
|
|
#define vallist 1
|
|
#define funcargs 2
|
|
|
|
#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.
|
|
*/
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
#include <unistd.h>
|
|
/* %endif */
|
|
#endif
|
|
|
|
#ifndef YY_EXTRA_TYPE
|
|
#define YY_EXTRA_TYPE void *
|
|
#endif
|
|
|
|
/* %if-c-only Reentrant structure and macros (non-C++). */
|
|
/* %if-reentrant */
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-reentrant */
|
|
/* %endif */
|
|
/* %if-bison-bridge */
|
|
/* %endif */
|
|
/* %endif End reentrant structures and macros. */
|
|
/* %not-for-header */
|
|
|
|
/* %ok-for-header */
|
|
|
|
/* %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
|
|
/* %if-c-only Standard (non-C++) definition */
|
|
/* %not-for-header */
|
|
|
|
/* %ok-for-header */
|
|
|
|
/* %endif */
|
|
#endif
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
|
|
/* Amount of stuff to slurp up with each read. */
|
|
#ifndef YY_READ_BUF_SIZE
|
|
#define YY_READ_BUF_SIZE 8192
|
|
#endif
|
|
|
|
/* Copy whatever the last rule matched to the standard output. */
|
|
#ifndef ECHO
|
|
/* %if-c-only Standard (non-C++) definition */
|
|
/* %endif */
|
|
/* %if-c++-only C++ definition */
|
|
#define ECHO LexerOutput( yytext, yyleng )
|
|
/* %endif */
|
|
#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) \
|
|
/* %% [5.0] fread()/read() definition of YY_INPUT goes here unless we're doing C++ \ */\
|
|
\
|
|
/* %if-c++-only C++ definition \ */\
|
|
if ( (result = LexerInput( (char *) buf, max_size )) < 0 ) \
|
|
YY_FATAL_ERROR( "input in flex scanner failed" );
|
|
/* %endif */
|
|
|
|
#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
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
#define YY_FATAL_ERROR(msg) LexerError( msg )
|
|
/* %endif */
|
|
#endif
|
|
|
|
/* %if-tables-serialization structures and prototypes */
|
|
/* %not-for-header */
|
|
|
|
/* %ok-for-header */
|
|
|
|
/* %not-for-header */
|
|
|
|
/* %tables-yydmap generated elements */
|
|
/* %endif */
|
|
/* end tables serialization structures and prototypes */
|
|
|
|
/* %ok-for-header */
|
|
|
|
/* Default declaration of generated scanner - a define so the user can
|
|
* easily add parameters.
|
|
*/
|
|
#ifndef YY_DECL
|
|
#define YY_DECL_IS_OURS 1
|
|
/* %if-c-only Standard (non-C++) definition */
|
|
/* %endif */
|
|
/* %if-c++-only C++ definition */
|
|
#define YY_DECL int yyFlexLexer::yylex()
|
|
/* %endif */
|
|
#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 break;
|
|
#endif
|
|
|
|
/* %% [6.0] YY_RULE_SETUP definition goes here */
|
|
#define YY_RULE_SETUP \
|
|
YY_USER_ACTION
|
|
|
|
/* %not-for-header */
|
|
|
|
/** 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;
|
|
|
|
/* %% [7.0] user's declarations go here */
|
|
#line 76 "qmake.ll"
|
|
|
|
#line 818 "qmake_lex.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 ( ! yyin )
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
yyin = & std::cin;
|
|
/* %endif */
|
|
|
|
if ( ! yyout )
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
yyout = & std::cout;
|
|
/* %endif */
|
|
|
|
if ( ! YY_CURRENT_BUFFER ) {
|
|
yyensure_buffer_stack ();
|
|
YY_CURRENT_BUFFER_LVALUE =
|
|
yy_create_buffer( yyin, YY_BUF_SIZE );
|
|
}
|
|
|
|
yy_load_buffer_state( );
|
|
}
|
|
|
|
while ( 1 ) /* loops until end-of-file is reached */
|
|
{
|
|
/* %% [8.0] yymore()-related code goes here */
|
|
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;
|
|
|
|
/* %% [9.0] code to set up and find next match goes here */
|
|
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 >= 76 )
|
|
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_base[yy_current_state] != 289 );
|
|
|
|
yy_find_action:
|
|
/* %% [10.0] code to find the action number goes here */
|
|
yy_act = yy_accept[yy_current_state];
|
|
if ( yy_act == 0 )
|
|
{ /* have to back up */
|
|
yy_cp = (yy_last_accepting_cpos);
|
|
yy_current_state = (yy_last_accepting_state);
|
|
yy_act = yy_accept[yy_current_state];
|
|
}
|
|
|
|
YY_DO_BEFORE_ACTION;
|
|
|
|
/* %% [11.0] code for yylineno update goes here */
|
|
|
|
if ( yy_act != YY_END_OF_BUFFER && yy_rule_can_match_eol[yy_act] )
|
|
{
|
|
int yyl;
|
|
for ( yyl = 0; yyl < yyleng; ++yyl )
|
|
if ( yytext[yyl] == '\n' )
|
|
|
|
yylineno++;
|
|
;
|
|
}
|
|
|
|
do_action: /* This label is used only to access EOF actions. */
|
|
|
|
/* %% [12.0] debug code goes here */
|
|
if ( yy_flex_debug )
|
|
{
|
|
if ( yy_act == 0 )
|
|
std::cerr << "--scanner backing up\n";
|
|
else if ( yy_act < 23 )
|
|
std::cerr << "--accepting rule at line " << yy_rule_linenum[yy_act] <<
|
|
"(\"" << yytext << "\")\n";
|
|
else if ( yy_act == 23 )
|
|
std::cerr << "--accepting default rule (\"" << yytext << "\")\n";
|
|
else if ( yy_act == 24 )
|
|
std::cerr << "--(end of buffer or a NUL)\n";
|
|
else
|
|
std::cerr << "--EOF (start condition " << YY_START << ")\n";
|
|
}
|
|
|
|
switch ( yy_act )
|
|
{ /* beginning of action switch */
|
|
/* %% [13.0] actions go here */
|
|
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 YY_STATE_EOF(vallist):
|
|
#line 77 "qmake.ll"
|
|
{
|
|
BEGIN(INITIAL);
|
|
return Parser::token::token::ENDOFFILE;
|
|
}
|
|
YY_BREAK
|
|
case 1:
|
|
YY_RULE_SETUP
|
|
#line 81 "qmake.ll"
|
|
{}
|
|
YY_BREAK
|
|
case 2:
|
|
YY_RULE_SETUP
|
|
#line 83 "qmake.ll"
|
|
{
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
return Parser::token::token::LIST_WS;
|
|
}
|
|
YY_BREAK
|
|
case 3:
|
|
/* rule 3 can match eol */
|
|
YY_RULE_SETUP
|
|
#line 88 "qmake.ll"
|
|
{
|
|
BEGIN(vallist);
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
return Parser::token::token::CONT;
|
|
}
|
|
YY_BREAK
|
|
case 4:
|
|
/* rule 4 can match eol */
|
|
YY_RULE_SETUP
|
|
#line 94 "qmake.ll"
|
|
{
|
|
BEGIN(vallist);
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
return Parser::token::token::COMMENT_CONT;
|
|
}
|
|
YY_BREAK
|
|
case 5:
|
|
YY_RULE_SETUP
|
|
#line 100 "qmake.ll"
|
|
{
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
return (Parser::token::token::ID_SIMPLE);
|
|
}
|
|
YY_BREAK
|
|
case 6:
|
|
YY_RULE_SETUP
|
|
#line 105 "qmake.ll"
|
|
{
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
mylval->value = mylval->value.mid(0, mylval->value.length()-1);
|
|
unput(')');
|
|
BEGIN(INITIAL);
|
|
return (Parser::token::token::ID_ARGS);
|
|
}
|
|
YY_BREAK
|
|
case 7:
|
|
YY_RULE_SETUP
|
|
#line 113 "qmake.ll"
|
|
{
|
|
BEGIN(vallist);
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
return Parser::token::token::VARIABLE_VALUE;
|
|
}
|
|
YY_BREAK
|
|
case 8:
|
|
YY_RULE_SETUP
|
|
#line 119 "qmake.ll"
|
|
{
|
|
BEGIN(vallist);
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
return Parser::token::token::QUOTED_VARIABLE_VALUE;
|
|
}
|
|
YY_BREAK
|
|
case 9:
|
|
YY_RULE_SETUP
|
|
#line 125 "qmake.ll"
|
|
{
|
|
BEGIN(vallist);
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
return Parser::token::token::EQ;
|
|
}
|
|
YY_BREAK
|
|
case 10:
|
|
YY_RULE_SETUP
|
|
#line 131 "qmake.ll"
|
|
{
|
|
BEGIN(vallist);
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
return Parser::token::token::PLUSEQ;
|
|
}
|
|
YY_BREAK
|
|
case 11:
|
|
YY_RULE_SETUP
|
|
#line 137 "qmake.ll"
|
|
{
|
|
BEGIN(vallist);
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
return Parser::token::token::MINUSEQ;
|
|
}
|
|
YY_BREAK
|
|
case 12:
|
|
YY_RULE_SETUP
|
|
#line 143 "qmake.ll"
|
|
{
|
|
BEGIN(vallist);
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
return Parser::token::token::STAREQ;
|
|
}
|
|
YY_BREAK
|
|
case 13:
|
|
YY_RULE_SETUP
|
|
#line 149 "qmake.ll"
|
|
{
|
|
BEGIN(vallist);
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
return Parser::token::token::TILDEEQ;
|
|
}
|
|
YY_BREAK
|
|
case 14:
|
|
YY_RULE_SETUP
|
|
#line 155 "qmake.ll"
|
|
{
|
|
return Parser::token::token::LCURLY;
|
|
}
|
|
YY_BREAK
|
|
case 15:
|
|
YY_RULE_SETUP
|
|
#line 159 "qmake.ll"
|
|
{
|
|
return Parser::token::token::LCURLY;
|
|
}
|
|
YY_BREAK
|
|
case 16:
|
|
YY_RULE_SETUP
|
|
#line 163 "qmake.ll"
|
|
{
|
|
return Parser::token::token::RCURLY;
|
|
}
|
|
YY_BREAK
|
|
case 17:
|
|
YY_RULE_SETUP
|
|
#line 167 "qmake.ll"
|
|
{
|
|
BEGIN(funcargs);
|
|
return Parser::token::token::LBRACE;
|
|
}
|
|
YY_BREAK
|
|
case 18:
|
|
YY_RULE_SETUP
|
|
#line 172 "qmake.ll"
|
|
{
|
|
BEGIN(INITIAL);
|
|
return Parser::token::token::RBRACE;
|
|
}
|
|
YY_BREAK
|
|
case 19:
|
|
YY_RULE_SETUP
|
|
#line 177 "qmake.ll"
|
|
{
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
return Parser::token::token::COLON;
|
|
}
|
|
YY_BREAK
|
|
case 20:
|
|
/* rule 20 can match eol */
|
|
YY_RULE_SETUP
|
|
#line 183 "qmake.ll"
|
|
{
|
|
BEGIN(INITIAL);
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
setLineEndingFromString( mylval->value );
|
|
return Parser::token::token::NEWLINE;
|
|
}
|
|
YY_BREAK
|
|
case 21:
|
|
/* rule 21 can match eol */
|
|
YY_RULE_SETUP
|
|
#line 190 "qmake.ll"
|
|
{
|
|
BEGIN(INITIAL);
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
setLineEndingFromString( mylval->value );
|
|
return Parser::token::token::NEWLINE;
|
|
}
|
|
YY_BREAK
|
|
case 22:
|
|
/* rule 22 can match eol */
|
|
YY_RULE_SETUP
|
|
#line 197 "qmake.ll"
|
|
{
|
|
BEGIN(INITIAL);
|
|
mylval->value = TQString::fromLocal8Bit( YYText(), YYLeng() );
|
|
return (Parser::token::token::COMMENT);
|
|
}
|
|
YY_BREAK
|
|
case 23:
|
|
YY_RULE_SETUP
|
|
#line 203 "qmake.ll"
|
|
ECHO;
|
|
YY_BREAK
|
|
#line 1145 "qmake_lex.cpp"
|
|
case YY_STATE_EOF(INITIAL):
|
|
case YY_STATE_EOF(funcargs):
|
|
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 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;
|
|
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
|
|
{
|
|
/* %% [14.0] code to do back-up for compressed tables and set up yy_cp goes here */
|
|
yy_cp = (yy_c_buf_p);
|
|
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 yylex */
|
|
/* %ok-for-header */
|
|
|
|
/* %if-c++-only */
|
|
/* %not-for-header */
|
|
|
|
yyFlexLexer::yyFlexLexer( std::istream* arg_yyin, std::ostream* arg_yyout )
|
|
{
|
|
yyin = arg_yyin;
|
|
yyout = arg_yyout;
|
|
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) = 0;
|
|
(yy_buffer_stack_top) = 0;
|
|
(yy_buffer_stack_max) = 0;
|
|
|
|
yy_state_buf = 0;
|
|
|
|
}
|
|
|
|
void yyFlexLexer::switch_streams( std::istream* new_in, std::ostream* new_out )
|
|
{
|
|
if ( new_in )
|
|
{
|
|
yy_delete_buffer( YY_CURRENT_BUFFER );
|
|
yy_switch_to_buffer( yy_create_buffer( new_in, YY_BUF_SIZE ) );
|
|
}
|
|
|
|
if ( new_out )
|
|
yyout = 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 );
|
|
}
|
|
/* %ok-for-header */
|
|
|
|
/* %endif */
|
|
|
|
/* 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
|
|
*/
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
int yyFlexLexer::yy_get_next_buffer()
|
|
/* %endif */
|
|
{
|
|
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. */
|
|
yyrealloc((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;
|
|
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;
|
|
|
|
(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 */
|
|
|
|
/* %if-c-only */
|
|
/* %not-for-header */
|
|
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
yy_state_type yyFlexLexer::yy_get_previous_state()
|
|
/* %endif */
|
|
{
|
|
register yy_state_type yy_current_state;
|
|
register char *yy_cp;
|
|
|
|
/* %% [15.0] code to get the start state into yy_current_state goes here */
|
|
yy_current_state = (yy_start);
|
|
|
|
for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
|
|
{
|
|
/* %% [16.0] code to find the next state goes here */
|
|
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 >= 76 )
|
|
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 );
|
|
*/
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
yy_state_type yyFlexLexer::yy_try_NUL_trans( yy_state_type yy_current_state )
|
|
/* %endif */
|
|
{
|
|
register int yy_is_jam;
|
|
/* %% [17.0] code to find the next state, and perhaps do backing up, goes here */
|
|
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 >= 76 )
|
|
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 == 75);
|
|
|
|
return yy_is_jam ? 0 : yy_current_state;
|
|
}
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
void yyFlexLexer::yyunput( int c, register char* yy_bp)
|
|
/* %endif */
|
|
{
|
|
register 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. */
|
|
register int number_to_move = (yy_n_chars) + 2;
|
|
register char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[
|
|
YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2];
|
|
register 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) = 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;
|
|
|
|
/* %% [18.0] update yylineno here */
|
|
|
|
if ( c == '\n' ){
|
|
--yylineno;
|
|
}
|
|
|
|
(yytext_ptr) = yy_bp;
|
|
(yy_hold_char) = *yy_cp;
|
|
(yy_c_buf_p) = yy_cp;
|
|
}
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
int yyFlexLexer::yyinput()
|
|
/* %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. */
|
|
yyrestart( yyin );
|
|
|
|
/*FALLTHROUGH*/
|
|
|
|
case EOB_ACT_END_OF_FILE:
|
|
{
|
|
if ( yywrap( ) )
|
|
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 yytext */
|
|
(yy_hold_char) = *++(yy_c_buf_p);
|
|
|
|
/* %% [19.0] update BOL and yylineno */
|
|
if ( c == '\n' )
|
|
|
|
yylineno++;
|
|
;
|
|
|
|
return c;
|
|
}
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
|
|
/** 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 .
|
|
*/
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
void yyFlexLexer::yyrestart( std::istream* input_file )
|
|
/* %endif */
|
|
{
|
|
|
|
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( );
|
|
}
|
|
|
|
/** Switch to a different input buffer.
|
|
* @param new_buffer The new input buffer.
|
|
*
|
|
*/
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
void yyFlexLexer::yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
|
|
/* %endif */
|
|
{
|
|
|
|
/* 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;
|
|
}
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
void yyFlexLexer::yy_load_buffer_state()
|
|
/* %endif */
|
|
{
|
|
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
|
|
(yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
|
|
yyin = 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.
|
|
*/
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
YY_BUFFER_STATE yyFlexLexer::yy_create_buffer( std::istream* file, int size )
|
|
/* %endif */
|
|
{
|
|
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(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;
|
|
}
|
|
|
|
/** Destroy the buffer.
|
|
* @param b a buffer created with yy_create_buffer()
|
|
*
|
|
*/
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
void yyFlexLexer::yy_delete_buffer( YY_BUFFER_STATE b )
|
|
/* %endif */
|
|
{
|
|
|
|
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 );
|
|
}
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
|
|
/* %if-c++-only */
|
|
|
|
extern "C" int isatty (int );
|
|
|
|
/* %endif */
|
|
|
|
/* 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.
|
|
*/
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
void yyFlexLexer::yy_init_buffer( YY_BUFFER_STATE b, std::istream* file )
|
|
/* %endif */
|
|
|
|
{
|
|
int oerrno = errno;
|
|
|
|
yy_flush_buffer( b );
|
|
|
|
b->yy_input_file = file;
|
|
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;
|
|
}
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
b->yy_is_interactive = 0;
|
|
/* %endif */
|
|
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.
|
|
*
|
|
*/
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
void yyFlexLexer::yy_flush_buffer( YY_BUFFER_STATE b )
|
|
/* %endif */
|
|
{
|
|
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( );
|
|
}
|
|
|
|
/* %if-c-or-c++ */
|
|
/** 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.
|
|
*
|
|
*/
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
void yyFlexLexer::yypush_buffer_state (YY_BUFFER_STATE new_buffer)
|
|
/* %endif */
|
|
{
|
|
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;
|
|
}
|
|
/* %endif */
|
|
|
|
/* %if-c-or-c++ */
|
|
/** Removes and deletes the top of the stack, if present.
|
|
* The next element becomes the new top.
|
|
*
|
|
*/
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
void yyFlexLexer::yypop_buffer_state (void)
|
|
/* %endif */
|
|
{
|
|
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;
|
|
}
|
|
}
|
|
/* %endif */
|
|
|
|
/* %if-c-or-c++ */
|
|
/* Allocates the stack if it does not exist.
|
|
* Guarantees space for at least one push.
|
|
*/
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
void yyFlexLexer::yyensure_buffer_stack(void)
|
|
/* %endif */
|
|
{
|
|
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**)yyalloc
|
|
(num_to_alloc * sizeof(struct yy_buffer_state*)
|
|
);
|
|
|
|
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**)yyrealloc
|
|
((yy_buffer_stack),
|
|
num_to_alloc * sizeof(struct yy_buffer_state*)
|
|
);
|
|
|
|
/* 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;
|
|
}
|
|
}
|
|
/* %endif */
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
void yyFlexLexer::yy_push_state( int new_state )
|
|
/* %endif */
|
|
{
|
|
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_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);
|
|
}
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
void yyFlexLexer::yy_pop_state()
|
|
/* %endif */
|
|
{
|
|
if ( --(yy_start_stack_ptr) < 0 )
|
|
YY_FATAL_ERROR( "start-condition stack underflow" );
|
|
|
|
BEGIN((yy_start_stack)[(yy_start_stack_ptr)]);
|
|
}
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
int yyFlexLexer::yy_top_state()
|
|
/* %endif */
|
|
{
|
|
return (yy_start_stack)[(yy_start_stack_ptr) - 1];
|
|
}
|
|
|
|
#ifndef YY_EXIT_FAILURE
|
|
#define YY_EXIT_FAILURE 2
|
|
#endif
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
void yyFlexLexer::LexerError( yyconst char msg[] )
|
|
{
|
|
std::cerr << msg << std::endl;
|
|
exit( YY_EXIT_FAILURE );
|
|
}
|
|
/* %endif */
|
|
|
|
/* 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. */
|
|
|
|
/* %if-c-only */
|
|
/* %if-reentrant */
|
|
/* %endif */
|
|
/* %if-reentrant */
|
|
/* %endif */
|
|
/* %endif */
|
|
|
|
/* %if-reentrant */
|
|
/* %if-bison-bridge */
|
|
/* %endif */
|
|
/* %endif */
|
|
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
|
|
/* %if-c-or-c++ */
|
|
/* %if-c-only */
|
|
/* %endif */
|
|
/* %if-c++-only */
|
|
yyFlexLexer::~yyFlexLexer()
|
|
/* %endif */
|
|
{
|
|
|
|
/* Pop the buffer stack, destroying each element. */
|
|
while(YY_CURRENT_BUFFER){
|
|
yy_delete_buffer( YY_CURRENT_BUFFER );
|
|
YY_CURRENT_BUFFER_LVALUE = NULL;
|
|
yypop_buffer_state();
|
|
}
|
|
|
|
/* Destroy the stack itself. */
|
|
yyfree((yy_buffer_stack) );
|
|
(yy_buffer_stack) = NULL;
|
|
|
|
/* %if-c++-only */
|
|
delete [] (yy_state_buf);
|
|
yyfree((yy_start_stack) );
|
|
/* %endif */
|
|
|
|
/* %if-c-only */
|
|
/* %if-reentrant */
|
|
/* %endif */
|
|
/* %endif */
|
|
}
|
|
/* %endif */
|
|
|
|
/*
|
|
* 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 *yyalloc (yy_size_t size )
|
|
{
|
|
return (void *) malloc( size );
|
|
}
|
|
|
|
void *yyrealloc (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 yyfree (void * ptr )
|
|
{
|
|
free( (char *) ptr ); /* see yyrealloc() for (char *) cast */
|
|
}
|
|
|
|
/* %if-tables-serialization definitions */
|
|
/* %define-yytables The name for this specific scanner's tables. */
|
|
#define YYTABLES_NAME "yytables"
|
|
/* %endif */
|
|
|
|
/* %ok-for-header */
|
|
|
|
#line 203 "qmake.ll"
|
|
|
|
|
|
namespace TQMake
|
|
{
|
|
Lexer::Lexer( std::istream* argin, std::ostream* argout )
|
|
: yyFlexLexer(argin, argout), mylval(0), m_lineEnding(None)
|
|
{
|
|
}
|
|
|
|
int Lexer::yylex( TQMake::Parser::semantic_type* yylval )
|
|
{
|
|
mylval = yylval;
|
|
return yylex();
|
|
}
|
|
|
|
void Lexer::setLineEndingFromString( const TQString& str )
|
|
{
|
|
if( str.endsWith("\r\n") && m_lineEnding == None )
|
|
m_lineEnding = Windows;
|
|
else if ( str.endsWith("\r") && m_lineEnding == None )
|
|
m_lineEnding = MacOS;
|
|
else if ( m_lineEnding == None )
|
|
m_lineEnding = Unix;
|
|
}
|
|
|
|
Lexer::LineEnding Lexer::lineending()
|
|
{
|
|
return m_lineEnding;
|
|
}
|
|
}
|
|
|
|
int TQMakelex( TQMake::Parser::semantic_type* yylval, TQMake::Lexer* lexer)
|
|
{
|
|
return lexer->yylex( yylval );
|
|
}
|
|
|
|
|