#line 2 "ada-lex.c"
|
#line 2 "ada-lex.c"
|
/* A lexical scanner generated by flex */
|
/* A lexical scanner generated by flex */
|
|
|
/* Scanner skeleton version:
|
/* Scanner skeleton version:
|
* $Header: /home/daffy/u0/vern/flex/RCS/flex.skl,v 2.91 96/09/10 16:58:48 vern Exp $
|
* $Header: /home/daffy/u0/vern/flex/RCS/flex.skl,v 2.91 96/09/10 16:58:48 vern Exp $
|
*/
|
*/
|
|
|
#define FLEX_SCANNER
|
#define FLEX_SCANNER
|
#define YY_FLEX_MAJOR_VERSION 2
|
#define YY_FLEX_MAJOR_VERSION 2
|
#define YY_FLEX_MINOR_VERSION 5
|
#define YY_FLEX_MINOR_VERSION 5
|
|
|
#include <stdio.h>
|
#include <stdio.h>
|
#include <unistd.h>
|
#include <unistd.h>
|
|
|
|
|
/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */
|
/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */
|
#ifdef c_plusplus
|
#ifdef c_plusplus
|
#ifndef __cplusplus
|
#ifndef __cplusplus
|
#define __cplusplus
|
#define __cplusplus
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
|
|
#ifdef __cplusplus
|
#ifdef __cplusplus
|
|
|
#include <stdlib.h>
|
#include <stdlib.h>
|
|
|
/* Use prototypes in function declarations. */
|
/* Use prototypes in function declarations. */
|
#define YY_USE_PROTOS
|
#define YY_USE_PROTOS
|
|
|
/* The "const" storage-class-modifier is valid. */
|
/* The "const" storage-class-modifier is valid. */
|
#define YY_USE_CONST
|
#define YY_USE_CONST
|
|
|
#else /* ! __cplusplus */
|
#else /* ! __cplusplus */
|
|
|
#if __STDC__
|
#if __STDC__
|
|
|
#define YY_USE_PROTOS
|
#define YY_USE_PROTOS
|
#define YY_USE_CONST
|
#define YY_USE_CONST
|
|
|
#endif /* __STDC__ */
|
#endif /* __STDC__ */
|
#endif /* ! __cplusplus */
|
#endif /* ! __cplusplus */
|
|
|
#ifdef __TURBOC__
|
#ifdef __TURBOC__
|
#pragma warn -rch
|
#pragma warn -rch
|
#pragma warn -use
|
#pragma warn -use
|
#include <io.h>
|
#include <io.h>
|
#include <stdlib.h>
|
#include <stdlib.h>
|
#define YY_USE_CONST
|
#define YY_USE_CONST
|
#define YY_USE_PROTOS
|
#define YY_USE_PROTOS
|
#endif
|
#endif
|
|
|
#ifdef YY_USE_CONST
|
#ifdef YY_USE_CONST
|
#define yyconst const
|
#define yyconst const
|
#else
|
#else
|
#define yyconst
|
#define yyconst
|
#endif
|
#endif
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
#define YY_PROTO(proto) proto
|
#define YY_PROTO(proto) proto
|
#else
|
#else
|
#define YY_PROTO(proto) ()
|
#define YY_PROTO(proto) ()
|
#endif
|
#endif
|
|
|
/* Returned upon end-of-file. */
|
/* Returned upon end-of-file. */
|
#define YY_NULL 0
|
#define YY_NULL 0
|
|
|
/* Promotes a possibly negative, possibly signed char to an unsigned
|
/* Promotes a possibly negative, possibly signed char to an unsigned
|
* integer for use as an array index. If the signed char is negative,
|
* 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
|
* we want to instead treat it as an 8-bit unsigned char, hence the
|
* double cast.
|
* double cast.
|
*/
|
*/
|
#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
|
#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
|
|
|
/* Enter a start condition. This macro really ought to take a parameter,
|
/* 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
|
* but we do it the disgusting crufty way forced on us by the ()-less
|
* definition of BEGIN.
|
* definition of BEGIN.
|
*/
|
*/
|
#define BEGIN yy_start = 1 + 2 *
|
#define BEGIN yy_start = 1 + 2 *
|
|
|
/* Translate the current start state into a value that can be later handed
|
/* 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
|
* to BEGIN to return to the state. The YYSTATE alias is for lex
|
* compatibility.
|
* compatibility.
|
*/
|
*/
|
#define YY_START ((yy_start - 1) / 2)
|
#define YY_START ((yy_start - 1) / 2)
|
#define YYSTATE YY_START
|
#define YYSTATE YY_START
|
|
|
/* Action number for EOF rule of a given start state. */
|
/* Action number for EOF rule of a given start state. */
|
#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
|
#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
|
|
|
/* Special action meaning "start processing a new file". */
|
/* Special action meaning "start processing a new file". */
|
#define YY_NEW_FILE yyrestart( yyin )
|
#define YY_NEW_FILE yyrestart( yyin )
|
|
|
#define YY_END_OF_BUFFER_CHAR 0
|
#define YY_END_OF_BUFFER_CHAR 0
|
|
|
/* Size of default input buffer. */
|
/* Size of default input buffer. */
|
#define YY_BUF_SIZE 16384
|
#define YY_BUF_SIZE 16384
|
|
|
typedef struct yy_buffer_state *YY_BUFFER_STATE;
|
typedef struct yy_buffer_state *YY_BUFFER_STATE;
|
|
|
extern int yyleng;
|
extern int yyleng;
|
extern FILE *yyin, *yyout;
|
extern FILE *yyin, *yyout;
|
|
|
#define EOB_ACT_CONTINUE_SCAN 0
|
#define EOB_ACT_CONTINUE_SCAN 0
|
#define EOB_ACT_END_OF_FILE 1
|
#define EOB_ACT_END_OF_FILE 1
|
#define EOB_ACT_LAST_MATCH 2
|
#define EOB_ACT_LAST_MATCH 2
|
|
|
/* The funky do-while in the following #define is used to turn the definition
|
/* The funky do-while in the following #define is used to turn the definition
|
* int a single C statement (which needs a semi-colon terminator). This
|
* int a single C statement (which needs a semi-colon terminator). This
|
* avoids problems with code like:
|
* avoids problems with code like:
|
*
|
*
|
* if ( condition_holds )
|
* if ( condition_holds )
|
* yyless( 5 );
|
* yyless( 5 );
|
* else
|
* else
|
* do_something_else();
|
* do_something_else();
|
*
|
*
|
* Prior to using the do-while the compiler would get upset at the
|
* Prior to using the do-while the compiler would get upset at the
|
* "else" because it interpreted the "if" statement as being all
|
* "else" because it interpreted the "if" statement as being all
|
* done when it reached the ';' after the yyless() call.
|
* done when it reached the ';' after the yyless() call.
|
*/
|
*/
|
|
|
/* Return all but the first 'n' matched characters back to the input stream. */
|
/* Return all but the first 'n' matched characters back to the input stream. */
|
|
|
#define yyless(n) \
|
#define yyless(n) \
|
do \
|
do \
|
{ \
|
{ \
|
/* Undo effects of setting up yytext. */ \
|
/* Undo effects of setting up yytext. */ \
|
*yy_cp = yy_hold_char; \
|
*yy_cp = yy_hold_char; \
|
YY_RESTORE_YY_MORE_OFFSET \
|
YY_RESTORE_YY_MORE_OFFSET \
|
yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \
|
yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \
|
YY_DO_BEFORE_ACTION; /* set up yytext again */ \
|
YY_DO_BEFORE_ACTION; /* set up yytext again */ \
|
} \
|
} \
|
while ( 0 )
|
while ( 0 )
|
|
|
#define unput(c) yyunput( c, yytext_ptr )
|
#define unput(c) yyunput( c, yytext_ptr )
|
|
|
/* The following is because we cannot portably get our hands on size_t
|
/* The following is because we cannot portably get our hands on size_t
|
* (without autoconf's help, which isn't available because we want
|
* (without autoconf's help, which isn't available because we want
|
* flex-generated scanners to compile on their own).
|
* flex-generated scanners to compile on their own).
|
*/
|
*/
|
typedef unsigned int yy_size_t;
|
typedef unsigned int yy_size_t;
|
|
|
|
|
struct yy_buffer_state
|
struct yy_buffer_state
|
{
|
{
|
FILE *yy_input_file;
|
FILE *yy_input_file;
|
|
|
char *yy_ch_buf; /* input buffer */
|
char *yy_ch_buf; /* input buffer */
|
char *yy_buf_pos; /* current position in input buffer */
|
char *yy_buf_pos; /* current position in input buffer */
|
|
|
/* Size of input buffer in bytes, not including room for EOB
|
/* Size of input buffer in bytes, not including room for EOB
|
* characters.
|
* characters.
|
*/
|
*/
|
yy_size_t yy_buf_size;
|
yy_size_t yy_buf_size;
|
|
|
/* Number of characters read into yy_ch_buf, not including EOB
|
/* Number of characters read into yy_ch_buf, not including EOB
|
* characters.
|
* characters.
|
*/
|
*/
|
int yy_n_chars;
|
int yy_n_chars;
|
|
|
/* Whether we "own" the buffer - i.e., we know we created it,
|
/* Whether we "own" the buffer - i.e., we know we created it,
|
* and can xrealloc() it to grow it, and should xfree() it to
|
* and can xrealloc() it to grow it, and should xfree() it to
|
* delete it.
|
* delete it.
|
*/
|
*/
|
int yy_is_our_buffer;
|
int yy_is_our_buffer;
|
|
|
/* Whether this is an "interactive" input source; if so, and
|
/* Whether this is an "interactive" input source; if so, and
|
* if we're using stdio for input, then we want to use getc()
|
* if we're using stdio for input, then we want to use getc()
|
* instead of fread(), to make sure we stop fetching input after
|
* instead of fread(), to make sure we stop fetching input after
|
* each newline.
|
* each newline.
|
*/
|
*/
|
int yy_is_interactive;
|
int yy_is_interactive;
|
|
|
/* Whether we're considered to be at the beginning of a line.
|
/* Whether we're considered to be at the beginning of a line.
|
* If so, '^' rules will be active on the next match, otherwise
|
* If so, '^' rules will be active on the next match, otherwise
|
* not.
|
* not.
|
*/
|
*/
|
int yy_at_bol;
|
int yy_at_bol;
|
|
|
/* Whether to try to fill the input buffer when we reach the
|
/* Whether to try to fill the input buffer when we reach the
|
* end of it.
|
* end of it.
|
*/
|
*/
|
int yy_fill_buffer;
|
int yy_fill_buffer;
|
|
|
int yy_buffer_status;
|
int yy_buffer_status;
|
#define YY_BUFFER_NEW 0
|
#define YY_BUFFER_NEW 0
|
#define YY_BUFFER_NORMAL 1
|
#define YY_BUFFER_NORMAL 1
|
/* When an EOF's been seen but there's still some text to process
|
/* 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
|
* 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
|
* shouldn't try reading from the input source any more. We might
|
* still have a bunch of tokens to match, though, because of
|
* still have a bunch of tokens to match, though, because of
|
* possible backing-up.
|
* possible backing-up.
|
*
|
*
|
* When we actually see the EOF, we change the status to "new"
|
* When we actually see the EOF, we change the status to "new"
|
* (via yyrestart()), so that the user can continue scanning by
|
* (via yyrestart()), so that the user can continue scanning by
|
* just pointing yyin at a new input file.
|
* just pointing yyin at a new input file.
|
*/
|
*/
|
#define YY_BUFFER_EOF_PENDING 2
|
#define YY_BUFFER_EOF_PENDING 2
|
};
|
};
|
|
|
static YY_BUFFER_STATE yy_current_buffer = 0;
|
static YY_BUFFER_STATE yy_current_buffer = 0;
|
|
|
/* We provide macros for accessing buffer states in case in the
|
/* We provide macros for accessing buffer states in case in the
|
* future we want to put the buffer states in a more general
|
* future we want to put the buffer states in a more general
|
* "scanner state".
|
* "scanner state".
|
*/
|
*/
|
#define YY_CURRENT_BUFFER yy_current_buffer
|
#define YY_CURRENT_BUFFER yy_current_buffer
|
|
|
|
|
/* yy_hold_char holds the character lost when yytext is formed. */
|
/* yy_hold_char holds the character lost when yytext is formed. */
|
static char yy_hold_char;
|
static char yy_hold_char;
|
|
|
static int yy_n_chars; /* number of characters read into yy_ch_buf */
|
static int yy_n_chars; /* number of characters read into yy_ch_buf */
|
|
|
|
|
int yyleng;
|
int yyleng;
|
|
|
/* Points to current character in buffer. */
|
/* Points to current character in buffer. */
|
static char *yy_c_buf_p = (char *) 0;
|
static char *yy_c_buf_p = (char *) 0;
|
static int yy_init = 1; /* whether we need to initialize */
|
static int yy_init = 1; /* whether we need to initialize */
|
static int yy_start = 0; /* start state number */
|
static int yy_start = 0; /* start state number */
|
|
|
/* Flag which is used to allow yywrap()'s to do buffer switches
|
/* Flag which is used to allow yywrap()'s to do buffer switches
|
* instead of setting up a fresh yyin. A bit of a hack ...
|
* instead of setting up a fresh yyin. A bit of a hack ...
|
*/
|
*/
|
static int yy_did_buffer_switch_on_eof;
|
static int yy_did_buffer_switch_on_eof;
|
|
|
void yyrestart YY_PROTO(( FILE *input_file ));
|
void yyrestart YY_PROTO(( FILE *input_file ));
|
|
|
void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer ));
|
void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer ));
|
void yy_load_buffer_state YY_PROTO(( void ));
|
void yy_load_buffer_state YY_PROTO(( void ));
|
YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size ));
|
YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size ));
|
void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b ));
|
void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b ));
|
void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file ));
|
void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file ));
|
void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b ));
|
void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b ));
|
#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer )
|
#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer )
|
|
|
YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size ));
|
YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size ));
|
YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str ));
|
YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str ));
|
YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len ));
|
YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len ));
|
|
|
static void *yy_flex_alloc YY_PROTO(( yy_size_t ));
|
static void *yy_flex_alloc YY_PROTO(( yy_size_t ));
|
static void *yyxrealloc YY_PROTO(( void *, yy_size_t ));
|
static void *yyxrealloc YY_PROTO(( void *, yy_size_t ));
|
static void yy_flex_free YY_PROTO(( void * ));
|
static void yy_flex_free YY_PROTO(( void * ));
|
|
|
#define yy_new_buffer yy_create_buffer
|
#define yy_new_buffer yy_create_buffer
|
|
|
#define yy_set_interactive(is_interactive) \
|
#define yy_set_interactive(is_interactive) \
|
{ \
|
{ \
|
if ( ! yy_current_buffer ) \
|
if ( ! yy_current_buffer ) \
|
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
|
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
|
yy_current_buffer->yy_is_interactive = is_interactive; \
|
yy_current_buffer->yy_is_interactive = is_interactive; \
|
}
|
}
|
|
|
#define yy_set_bol(at_bol) \
|
#define yy_set_bol(at_bol) \
|
{ \
|
{ \
|
if ( ! yy_current_buffer ) \
|
if ( ! yy_current_buffer ) \
|
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
|
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
|
yy_current_buffer->yy_at_bol = at_bol; \
|
yy_current_buffer->yy_at_bol = at_bol; \
|
}
|
}
|
|
|
#define YY_AT_BOL() (yy_current_buffer->yy_at_bol)
|
#define YY_AT_BOL() (yy_current_buffer->yy_at_bol)
|
|
|
typedef unsigned char YY_CHAR;
|
typedef unsigned char YY_CHAR;
|
FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
|
FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
|
typedef int yy_state_type;
|
typedef int yy_state_type;
|
extern char *yytext;
|
extern char *yytext;
|
#define yytext_ptr yytext
|
#define yytext_ptr yytext
|
|
|
static yy_state_type yy_get_previous_state YY_PROTO(( void ));
|
static yy_state_type yy_get_previous_state YY_PROTO(( void ));
|
static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state ));
|
static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state ));
|
static int yy_get_next_buffer YY_PROTO(( void ));
|
static int yy_get_next_buffer YY_PROTO(( void ));
|
static void yy_fatal_error YY_PROTO(( yyconst char msg[] ));
|
static void yy_fatal_error YY_PROTO(( yyconst char msg[] ));
|
|
|
/* Done after the current pattern has been matched and before the
|
/* Done after the current pattern has been matched and before the
|
* corresponding action - sets up yytext.
|
* corresponding action - sets up yytext.
|
*/
|
*/
|
#define YY_DO_BEFORE_ACTION \
|
#define YY_DO_BEFORE_ACTION \
|
yytext_ptr = yy_bp; \
|
yytext_ptr = yy_bp; \
|
yyleng = (int) (yy_cp - yy_bp); \
|
yyleng = (int) (yy_cp - yy_bp); \
|
yy_hold_char = *yy_cp; \
|
yy_hold_char = *yy_cp; \
|
*yy_cp = '\0'; \
|
*yy_cp = '\0'; \
|
yy_c_buf_p = yy_cp;
|
yy_c_buf_p = yy_cp;
|
|
|
#define YY_NUM_RULES 54
|
#define YY_NUM_RULES 54
|
#define YY_END_OF_BUFFER 55
|
#define YY_END_OF_BUFFER 55
|
static yyconst short int yy_accept[196] =
|
static yyconst short int yy_accept[196] =
|
{ 0,
|
{ 0,
|
0, 0, 0, 0, 55, 53, 1, 1, 15, 52,
|
0, 0, 0, 0, 55, 53, 1, 1, 15, 52,
|
42, 53, 44, 45, 42, 43, 42, 42, 42, 4,
|
42, 53, 44, 45, 42, 43, 42, 42, 42, 4,
|
4, 42, 42, 42, 42, 51, 48, 48, 48, 48,
|
4, 42, 42, 42, 42, 51, 48, 48, 48, 48,
|
48, 48, 48, 48, 48, 48, 48, 41, 0, 14,
|
48, 48, 48, 48, 48, 48, 48, 41, 0, 14,
|
0, 52, 0, 0, 0, 0, 0, 0, 0, 36,
|
0, 52, 0, 0, 0, 0, 0, 0, 0, 36,
|
2, 0, 35, 0, 47, 47, 38, 0, 0, 4,
|
2, 0, 35, 0, 47, 47, 38, 0, 0, 4,
|
0, 0, 50, 37, 39, 0, 34, 40, 0, 0,
|
0, 0, 50, 37, 39, 0, 34, 40, 0, 0,
|
48, 0, 48, 48, 48, 48, 48, 16, 21, 48,
|
48, 0, 48, 48, 48, 48, 48, 16, 21, 48,
|
48, 48, 48, 26, 48, 48, 48, 48, 48, 48,
|
48, 48, 48, 26, 48, 48, 48, 48, 48, 48,
|
0, 14, 0, 12, 12, 0, 33, 2, 0, 47,
|
0, 14, 0, 12, 12, 0, 33, 2, 0, 47,
|
|
|
47, 0, 9, 0, 3, 7, 0, 48, 0, 0,
|
47, 0, 9, 0, 3, 7, 0, 48, 0, 0,
|
0, 48, 18, 19, 48, 48, 22, 23, 24, 48,
|
0, 48, 18, 19, 48, 48, 22, 23, 24, 48,
|
48, 28, 48, 48, 48, 48, 30, 0, 0, 0,
|
48, 28, 48, 48, 48, 48, 30, 0, 0, 0,
|
0, 0, 0, 47, 46, 6, 0, 0, 9, 0,
|
0, 0, 0, 47, 46, 6, 0, 0, 9, 0,
|
3, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
3, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
0, 0, 0, 48, 20, 48, 25, 48, 17, 29,
|
0, 0, 0, 48, 20, 48, 25, 48, 17, 29,
|
48, 31, 0, 49, 0, 0, 0, 0, 48, 0,
|
48, 31, 0, 49, 0, 0, 0, 0, 48, 0,
|
0, 0, 0, 0, 0, 0, 32, 48, 48, 0,
|
0, 0, 0, 0, 0, 0, 32, 48, 48, 0,
|
0, 5, 11, 0, 8, 27, 0, 5, 0, 8,
|
0, 5, 11, 0, 8, 27, 0, 5, 0, 8,
|
13, 0, 10, 10, 0
|
13, 0, 10, 10, 0
|
|
|
} ;
|
} ;
|
|
|
static yyconst int yy_ec[256] =
|
static yyconst int yy_ec[256] =
|
{ 0,
|
{ 0,
|
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
|
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, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
1, 4, 5, 6, 7, 8, 5, 9, 10, 11,
|
1, 4, 5, 6, 7, 8, 5, 9, 10, 11,
|
12, 13, 14, 15, 16, 17, 18, 19, 20, 20,
|
12, 13, 14, 15, 16, 17, 18, 19, 20, 20,
|
20, 20, 20, 20, 20, 20, 20, 21, 22, 23,
|
20, 20, 20, 20, 20, 20, 20, 21, 22, 23,
|
24, 25, 5, 26, 30, 31, 32, 33, 34, 35,
|
24, 25, 5, 26, 30, 31, 32, 33, 34, 35,
|
36, 37, 38, 36, 39, 40, 41, 42, 43, 36,
|
36, 37, 38, 36, 39, 40, 41, 42, 43, 36,
|
36, 44, 45, 46, 47, 36, 48, 49, 36, 36,
|
36, 44, 45, 46, 47, 36, 48, 49, 36, 36,
|
27, 5, 28, 5, 29, 5, 30, 31, 32, 33,
|
27, 5, 28, 5, 29, 5, 30, 31, 32, 33,
|
|
|
34, 35, 36, 37, 38, 36, 39, 40, 41, 42,
|
34, 35, 36, 37, 38, 36, 39, 40, 41, 42,
|
43, 36, 36, 44, 45, 46, 47, 36, 48, 49,
|
43, 36, 36, 44, 45, 46, 47, 36, 48, 49,
|
36, 36, 26, 22, 26, 5, 1, 1, 1, 1,
|
36, 36, 26, 22, 26, 5, 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, 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 int yy_meta[50] =
|
static yyconst int yy_meta[50] =
|
{ 0,
|
{ 0,
|
1, 2, 3, 4, 5, 6, 7, 8, 5, 9,
|
1, 2, 3, 4, 5, 6, 7, 8, 5, 9,
|
5, 5, 5, 5, 5, 5, 10, 5, 11, 11,
|
5, 5, 5, 5, 5, 5, 10, 5, 11, 11,
|
5, 5, 12, 13, 14, 5, 5, 5, 15, 16,
|
5, 5, 12, 13, 14, 5, 5, 5, 15, 16,
|
16, 16, 16, 16, 16, 17, 17, 17, 17, 17,
|
16, 16, 16, 16, 16, 17, 17, 17, 17, 17,
|
17, 17, 17, 17, 17, 17, 17, 17, 17
|
17, 17, 17, 17, 17, 17, 17, 17, 17
|
} ;
|
} ;
|
|
|
static yyconst short int yy_base[217] =
|
static yyconst short int yy_base[217] =
|
{ 0,
|
{ 0,
|
0, 0, 622, 615, 620, 759, 759, 759, 44, 0,
|
0, 0, 622, 615, 620, 759, 759, 759, 44, 0,
|
759, 71, 759, 759, 606, 759, 601, 119, 591, 118,
|
759, 71, 759, 759, 606, 759, 601, 119, 591, 118,
|
124, 30, 590, 588, 588, 759, 53, 152, 22, 97,
|
124, 30, 590, 588, 588, 759, 53, 152, 22, 97,
|
98, 103, 117, 119, 27, 140, 137, 194, 151, 759,
|
98, 103, 117, 119, 27, 140, 137, 194, 151, 759,
|
160, 0, 242, 601, 594, 593, 592, 120, 282, 759,
|
160, 0, 242, 601, 594, 593, 592, 120, 282, 759,
|
0, 330, 759, 0, 0, 560, 759, 0, 40, 329,
|
0, 330, 759, 0, 0, 560, 759, 0, 40, 329,
|
171, 0, 759, 759, 759, 574, 759, 759, 171, 245,
|
171, 0, 759, 759, 759, 574, 759, 759, 171, 245,
|
759, 336, 150, 219, 223, 226, 227, 162, 228, 262,
|
759, 336, 150, 219, 223, 226, 227, 162, 228, 262,
|
263, 310, 266, 265, 313, 268, 312, 330, 320, 334,
|
263, 310, 266, 265, 313, 268, 312, 330, 320, 334,
|
572, 569, 366, 377, 759, 380, 547, 0, 530, 0,
|
572, 569, 366, 377, 759, 380, 547, 0, 530, 0,
|
|
|
501, 169, 363, 46, 365, 0, 503, 386, 402, 417,
|
501, 169, 363, 46, 365, 0, 503, 386, 402, 417,
|
0, 417, 335, 344, 412, 387, 360, 386, 406, 413,
|
0, 417, 335, 344, 412, 387, 360, 386, 406, 413,
|
431, 407, 425, 408, 437, 438, 421, 518, 0, 472,
|
431, 407, 425, 408, 437, 438, 421, 518, 0, 472,
|
497, 475, 474, 759, 0, 456, 0, 246, 458, 284,
|
497, 475, 474, 759, 0, 456, 0, 246, 458, 284,
|
462, 451, 403, 464, 477, 478, 454, 408, 402, 392,
|
462, 451, 403, 464, 477, 478, 454, 408, 402, 392,
|
390, 364, 376, 509, 455, 483, 458, 485, 473, 489,
|
390, 364, 376, 509, 455, 483, 458, 485, 473, 489,
|
491, 492, 367, 759, 387, 516, 366, 48, 535, 326,
|
491, 492, 367, 759, 387, 516, 366, 48, 535, 326,
|
312, 270, 220, 219, 207, 164, 501, 509, 511, 144,
|
312, 270, 220, 219, 207, 164, 501, 509, 511, 144,
|
282, 527, 98, 117, 529, 519, 42, 540, 321, 543,
|
282, 527, 98, 117, 529, 519, 42, 540, 321, 543,
|
562, 403, 548, 551, 759, 580, 590, 606, 611, 627,
|
562, 403, 548, 551, 759, 580, 590, 606, 611, 627,
|
|
|
644, 647, 654, 487, 562, 661, 677, 689, 695, 706,
|
644, 647, 654, 487, 562, 661, 677, 689, 695, 706,
|
708, 724, 563, 565, 731, 742
|
708, 724, 563, 565, 731, 742
|
} ;
|
} ;
|
|
|
static yyconst short int yy_def[217] =
|
static yyconst short int yy_def[217] =
|
{ 0,
|
{ 0,
|
195, 1, 1, 1, 195, 195, 195, 195, 196, 197,
|
195, 1, 1, 1, 195, 195, 195, 195, 196, 197,
|
195, 195, 195, 195, 195, 195, 195, 198, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 198, 195, 195,
|
195, 195, 199, 195, 195, 195, 200, 200, 28, 28,
|
195, 195, 199, 195, 195, 195, 200, 200, 28, 28,
|
28, 28, 28, 28, 28, 28, 28, 195, 196, 195,
|
28, 28, 28, 28, 28, 28, 28, 195, 196, 195,
|
196, 197, 38, 38, 38, 43, 195, 43, 43, 195,
|
196, 197, 38, 38, 38, 43, 195, 43, 43, 195,
|
201, 198, 195, 202, 203, 203, 195, 204, 195, 195,
|
201, 198, 195, 202, 203, 203, 195, 204, 195, 195,
|
195, 205, 195, 195, 195, 206, 195, 195, 195, 195,
|
195, 205, 195, 195, 195, 206, 195, 195, 195, 195,
|
195, 207, 28, 28, 28, 28, 28, 28, 28, 28,
|
195, 207, 28, 28, 28, 28, 28, 28, 28, 28,
|
28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
|
28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
|
49, 208, 195, 195, 195, 43, 49, 201, 209, 203,
|
49, 208, 195, 195, 195, 43, 49, 201, 209, 203,
|
|
|
203, 210, 195, 195, 195, 205, 206, 195, 207, 195,
|
203, 210, 195, 195, 195, 205, 206, 195, 207, 195,
|
211, 212, 28, 28, 28, 28, 28, 28, 28, 28,
|
211, 212, 28, 28, 28, 28, 28, 28, 28, 28,
|
28, 28, 28, 28, 28, 28, 28, 195, 213, 195,
|
28, 28, 28, 28, 28, 28, 28, 195, 213, 195,
|
195, 43, 209, 195, 203, 195, 214, 210, 195, 195,
|
195, 43, 209, 195, 203, 195, 214, 210, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 215, 212, 28, 28, 28, 28, 28, 28,
|
195, 195, 215, 212, 28, 28, 28, 28, 28, 28,
|
28, 28, 195, 195, 43, 195, 216, 195, 195, 195,
|
28, 28, 195, 195, 43, 195, 216, 195, 195, 195,
|
195, 195, 195, 195, 195, 215, 28, 28, 28, 43,
|
195, 195, 195, 195, 195, 215, 28, 28, 28, 43,
|
195, 195, 195, 216, 195, 28, 43, 195, 195, 195,
|
195, 195, 195, 216, 195, 28, 43, 195, 195, 195,
|
195, 195, 195, 195, 0, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 0, 195, 195, 195, 195, 195,
|
|
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195
|
195, 195, 195, 195, 195, 195
|
} ;
|
} ;
|
|
|
static yyconst short int yy_nxt[809] =
|
static yyconst short int yy_nxt[809] =
|
{ 0,
|
{ 0,
|
6, 7, 8, 7, 6, 9, 6, 10, 11, 12,
|
6, 7, 8, 7, 6, 9, 6, 10, 11, 12,
|
13, 14, 15, 11, 16, 17, 18, 19, 20, 21,
|
13, 14, 15, 11, 16, 17, 18, 19, 20, 21,
|
22, 11, 23, 24, 25, 26, 11, 11, 27, 28,
|
22, 11, 23, 24, 25, 26, 11, 11, 27, 28,
|
27, 27, 27, 29, 30, 27, 27, 31, 27, 27,
|
27, 27, 27, 29, 30, 27, 27, 31, 27, 27,
|
32, 33, 34, 35, 27, 36, 27, 27, 37, 40,
|
32, 33, 34, 35, 27, 36, 27, 27, 37, 40,
|
63, 191, 73, 64, 69, 69, 70, 73, 103, 103,
|
63, 191, 73, 64, 69, 69, 70, 73, 103, 103,
|
86, 76, 71, 73, 105, 105, 185, 185, 73, 72,
|
86, 76, 71, 73, 105, 105, 185, 185, 73, 72,
|
41, 43, 44, 44, 45, 46, 46, 46, 46, 46,
|
41, 43, 44, 44, 45, 46, 46, 46, 46, 46,
|
47, 46, 46, 46, 46, 46, 46, 46, 46, 46,
|
47, 46, 46, 46, 46, 46, 46, 46, 46, 46,
|
46, 46, 46, 46, 46, 46, 46, 48, 46, 46,
|
46, 46, 46, 46, 46, 46, 46, 48, 46, 46,
|
|
|
49, 49, 49, 49, 49, 49, 49, 49, 49, 49,
|
49, 49, 49, 49, 49, 49, 49, 49, 49, 49,
|
49, 49, 49, 49, 49, 49, 49, 49, 49, 49,
|
49, 49, 49, 49, 49, 49, 49, 49, 49, 49,
|
52, 52, 52, 183, 58, 96, 77, 73, 73, 94,
|
52, 52, 52, 183, 58, 96, 77, 73, 73, 94,
|
58, 189, 78, 73, 59, 53, 60, 60, 73, 79,
|
58, 189, 78, 73, 59, 53, 60, 60, 73, 79,
|
59, 54, 60, 60, 73, 80, 60, 73, 56, 73,
|
59, 54, 60, 60, 73, 80, 60, 73, 56, 73,
|
81, 61, 60, 69, 69, 70, 40, 61, 73, 82,
|
81, 61, 60, 69, 69, 70, 40, 61, 73, 82,
|
73, 71, 84, 83, 85, 92, 62, 73, 72, 87,
|
73, 71, 84, 83, 85, 92, 62, 73, 72, 87,
|
73, 187, 69, 69, 69, 136, 88, 41, 73, 90,
|
73, 187, 69, 69, 69, 136, 88, 41, 73, 90,
|
73, 73, 74, 89, 104, 137, 41, 72, 169, 105,
|
73, 73, 74, 89, 104, 137, 41, 72, 169, 105,
|
105, 73, 73, 75, 43, 44, 44, 44, 43, 43,
|
105, 73, 73, 75, 43, 44, 44, 44, 43, 43,
|
|
|
43, 43, 43, 73, 43, 43, 43, 43, 43, 43,
|
43, 43, 43, 73, 43, 43, 43, 43, 43, 43,
|
43, 43, 43, 43, 43, 43, 43, 43, 43, 43,
|
43, 43, 43, 43, 43, 43, 43, 43, 43, 43,
|
43, 43, 43, 91, 91, 91, 91, 91, 91, 91,
|
43, 43, 43, 91, 91, 91, 91, 91, 91, 91,
|
91, 91, 91, 91, 91, 91, 91, 91, 91, 91,
|
91, 91, 91, 91, 91, 91, 91, 91, 91, 91,
|
91, 91, 91, 43, 43, 43, 69, 69, 70, 73,
|
91, 91, 91, 43, 43, 43, 69, 69, 70, 73,
|
142, 93, 136, 73, 71, 114, 73, 73, 73, 142,
|
142, 93, 136, 73, 71, 114, 73, 73, 73, 142,
|
73, 72, 137, 113, 73, 142, 116, 73, 73, 73,
|
73, 72, 137, 113, 73, 142, 116, 73, 73, 73,
|
115, 43, 43, 43, 43, 43, 43, 43, 43, 43,
|
115, 43, 43, 43, 43, 43, 43, 43, 43, 43,
|
43, 43, 43, 43, 43, 43, 43, 43, 43, 43,
|
43, 43, 43, 43, 43, 43, 43, 43, 43, 43,
|
43, 94, 73, 73, 117, 73, 73, 168, 73, 168,
|
43, 94, 73, 73, 117, 73, 73, 168, 73, 168,
|
|
|
182, 182, 142, 73, 73, 120, 73, 73, 122, 73,
|
182, 182, 142, 73, 73, 120, 73, 73, 122, 73,
|
118, 97, 97, 97, 97, 97, 97, 97, 97, 97,
|
118, 97, 97, 97, 97, 97, 97, 97, 97, 97,
|
97, 97, 97, 97, 97, 97, 97, 97, 97, 97,
|
97, 97, 97, 97, 97, 97, 97, 97, 97, 97,
|
97, 52, 52, 52, 192, 58, 192, 109, 109, 109,
|
97, 52, 52, 52, 192, 58, 192, 109, 109, 109,
|
73, 110, 73, 73, 142, 59, 195, 60, 60, 121,
|
73, 110, 73, 73, 142, 59, 195, 60, 60, 121,
|
73, 73, 54, 73, 73, 119, 123, 60, 111, 56,
|
73, 73, 54, 73, 73, 119, 123, 60, 111, 56,
|
73, 73, 61, 124, 73, 73, 126, 130, 130, 130,
|
73, 73, 61, 124, 73, 73, 126, 130, 130, 130,
|
142, 73, 183, 125, 73, 73, 73, 127, 130, 130,
|
142, 73, 183, 125, 73, 73, 73, 127, 130, 130,
|
130, 139, 139, 141, 141, 73, 131, 69, 69, 70,
|
130, 139, 139, 141, 141, 73, 131, 69, 69, 70,
|
73, 139, 180, 141, 39, 71, 140, 131, 132, 132,
|
73, 139, 180, 141, 39, 71, 140, 131, 132, 132,
|
|
|
169, 73, 72, 109, 109, 109, 175, 110, 169, 132,
|
169, 73, 72, 109, 109, 109, 175, 110, 169, 132,
|
132, 132, 132, 132, 132, 142, 73, 73, 69, 69,
|
132, 132, 132, 132, 132, 142, 73, 73, 69, 69,
|
70, 193, 193, 174, 111, 142, 71, 73, 73, 143,
|
70, 193, 193, 174, 111, 142, 71, 73, 73, 143,
|
142, 156, 142, 72, 144, 142, 73, 73, 73, 145,
|
142, 156, 142, 72, 144, 142, 73, 73, 73, 145,
|
142, 146, 73, 73, 173, 155, 147, 73, 73, 160,
|
142, 146, 73, 73, 173, 155, 147, 73, 73, 160,
|
172, 73, 157, 73, 73, 73, 169, 148, 149, 150,
|
172, 73, 157, 73, 73, 73, 169, 148, 149, 150,
|
151, 73, 73, 159, 158, 152, 73, 73, 73, 169,
|
151, 73, 73, 159, 158, 152, 73, 73, 73, 169,
|
161, 162, 73, 130, 130, 130, 139, 139, 73, 73,
|
161, 162, 73, 130, 130, 130, 139, 139, 73, 73,
|
141, 141, 169, 169, 170, 73, 139, 142, 73, 166,
|
141, 141, 169, 169, 170, 73, 139, 142, 73, 166,
|
141, 140, 131, 165, 165, 171, 73, 102, 134, 73,
|
141, 140, 131, 165, 165, 171, 73, 102, 134, 73,
|
|
|
142, 142, 102, 73, 165, 165, 165, 165, 165, 165,
|
142, 142, 102, 73, 165, 165, 165, 165, 165, 165,
|
69, 69, 70, 73, 73, 73, 177, 164, 71, 73,
|
69, 69, 70, 73, 73, 73, 177, 164, 71, 73,
|
179, 73, 73, 163, 73, 72, 73, 108, 178, 181,
|
179, 73, 73, 163, 73, 72, 73, 108, 178, 181,
|
73, 73, 73, 73, 182, 182, 69, 69, 70, 73,
|
73, 73, 73, 73, 182, 182, 69, 69, 70, 73,
|
135, 73, 73, 159, 71, 188, 188, 190, 190, 73,
|
135, 73, 73, 159, 71, 188, 188, 190, 190, 73,
|
73, 72, 73, 186, 134, 188, 93, 190, 188, 188,
|
73, 72, 73, 186, 134, 188, 93, 190, 188, 188,
|
73, 190, 190, 130, 130, 130, 194, 194, 188, 194,
|
73, 190, 190, 130, 130, 130, 194, 194, 188, 194,
|
194, 190, 106, 128, 128, 167, 194, 106, 128, 194,
|
194, 190, 106, 128, 128, 167, 194, 106, 128, 194,
|
167, 93, 131, 39, 39, 39, 39, 39, 39, 39,
|
167, 93, 131, 39, 39, 39, 39, 39, 39, 39,
|
39, 39, 39, 39, 39, 39, 39, 42, 108, 101,
|
39, 39, 39, 39, 39, 39, 39, 42, 108, 101,
|
|
|
42, 95, 94, 94, 42, 42, 42, 55, 55, 55,
|
42, 95, 94, 94, 42, 42, 42, 55, 55, 55,
|
93, 68, 67, 65, 57, 55, 51, 55, 50, 195,
|
93, 68, 67, 65, 57, 55, 51, 55, 50, 195,
|
55, 55, 55, 66, 38, 66, 66, 66, 73, 73,
|
55, 55, 55, 66, 38, 66, 66, 66, 73, 73,
|
73, 38, 195, 195, 195, 73, 73, 73, 195, 195,
|
73, 38, 195, 195, 195, 73, 73, 73, 195, 195,
|
195, 73, 73, 73, 98, 98, 195, 98, 98, 98,
|
195, 73, 73, 73, 98, 98, 195, 98, 98, 98,
|
98, 98, 98, 98, 98, 98, 98, 98, 98, 98,
|
98, 98, 98, 98, 98, 98, 98, 98, 98, 98,
|
98, 99, 99, 99, 100, 195, 195, 195, 100, 100,
|
98, 99, 99, 99, 100, 195, 195, 195, 100, 100,
|
100, 107, 195, 195, 107, 107, 107, 107, 112, 112,
|
100, 107, 195, 195, 107, 107, 107, 107, 112, 112,
|
112, 195, 112, 195, 195, 195, 195, 195, 112, 195,
|
112, 195, 112, 195, 195, 195, 195, 195, 112, 195,
|
195, 112, 112, 112, 129, 195, 195, 195, 195, 129,
|
195, 112, 112, 112, 129, 195, 195, 195, 195, 129,
|
|
|
195, 195, 195, 195, 129, 133, 195, 195, 133, 133,
|
195, 195, 195, 195, 129, 133, 195, 195, 133, 133,
|
133, 133, 138, 195, 195, 138, 138, 195, 195, 195,
|
133, 133, 138, 195, 195, 138, 138, 195, 195, 195,
|
138, 138, 153, 153, 153, 154, 154, 154, 195, 195,
|
138, 138, 153, 153, 153, 154, 154, 154, 195, 195,
|
195, 195, 154, 154, 154, 195, 195, 195, 154, 154,
|
195, 195, 154, 154, 154, 195, 195, 195, 154, 154,
|
154, 176, 195, 195, 176, 176, 176, 176, 184, 195,
|
154, 176, 195, 195, 176, 176, 176, 176, 184, 195,
|
195, 195, 184, 195, 195, 195, 184, 184, 5, 195,
|
195, 195, 184, 195, 195, 195, 184, 184, 5, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
|
|
195, 195, 195, 195, 195, 195, 195, 195
|
195, 195, 195, 195, 195, 195, 195, 195
|
} ;
|
} ;
|
|
|
static yyconst short int yy_chk[809] =
|
static yyconst short int yy_chk[809] =
|
{ 0,
|
{ 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, 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, 9,
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 9,
|
22, 187, 29, 22, 27, 27, 27, 35, 59, 59,
|
22, 187, 29, 22, 27, 27, 27, 35, 59, 59,
|
35, 29, 27, 29, 104, 104, 168, 168, 35, 27,
|
35, 29, 27, 29, 104, 104, 168, 168, 35, 27,
|
9, 12, 12, 12, 12, 12, 12, 12, 12, 12,
|
9, 12, 12, 12, 12, 12, 12, 12, 12, 12,
|
12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
|
12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
|
12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
|
12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
|
|
|
12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
|
12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
|
12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
|
12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
|
18, 18, 18, 184, 20, 48, 30, 30, 31, 48,
|
18, 18, 18, 184, 20, 48, 30, 30, 31, 48,
|
21, 183, 31, 32, 20, 18, 20, 20, 30, 31,
|
21, 183, 31, 32, 20, 18, 20, 20, 30, 31,
|
21, 18, 21, 21, 32, 32, 20, 33, 18, 34,
|
21, 18, 21, 21, 32, 32, 20, 33, 18, 34,
|
33, 20, 21, 28, 28, 28, 39, 21, 33, 33,
|
33, 20, 21, 28, 28, 28, 39, 21, 33, 33,
|
34, 28, 34, 33, 34, 41, 20, 37, 28, 36,
|
34, 28, 34, 33, 34, 41, 20, 37, 28, 36,
|
36, 180, 69, 69, 69, 102, 36, 39, 37, 37,
|
36, 180, 69, 69, 69, 102, 36, 39, 37, 37,
|
73, 36, 28, 36, 61, 102, 41, 69, 176, 61,
|
73, 36, 28, 36, 61, 102, 41, 69, 176, 61,
|
61, 73, 78, 28, 38, 38, 38, 38, 38, 38,
|
61, 73, 78, 28, 38, 38, 38, 38, 38, 38,
|
|
|
38, 38, 38, 78, 38, 38, 38, 38, 38, 38,
|
38, 38, 38, 78, 38, 38, 38, 38, 38, 38,
|
38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
|
38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
|
38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
|
38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
|
38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
|
38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
|
38, 38, 38, 43, 43, 43, 70, 70, 70, 74,
|
38, 38, 38, 43, 43, 43, 70, 70, 70, 74,
|
175, 43, 138, 75, 70, 75, 76, 77, 79, 174,
|
175, 43, 138, 75, 70, 75, 76, 77, 79, 174,
|
74, 70, 138, 74, 75, 173, 77, 76, 77, 79,
|
74, 70, 138, 74, 75, 173, 77, 76, 77, 79,
|
76, 43, 43, 43, 43, 43, 43, 43, 43, 43,
|
76, 43, 43, 43, 43, 43, 43, 43, 43, 43,
|
43, 43, 43, 43, 43, 43, 43, 43, 43, 43,
|
43, 43, 43, 43, 43, 43, 43, 43, 43, 43,
|
43, 49, 80, 81, 80, 84, 83, 140, 86, 140,
|
43, 49, 80, 81, 80, 84, 83, 140, 86, 140,
|
|
|
181, 181, 172, 80, 81, 83, 84, 83, 86, 86,
|
181, 181, 172, 80, 81, 83, 84, 83, 86, 86,
|
81, 49, 49, 49, 49, 49, 49, 49, 49, 49,
|
81, 49, 49, 49, 49, 49, 49, 49, 49, 49,
|
49, 49, 49, 49, 49, 49, 49, 49, 49, 49,
|
49, 49, 49, 49, 49, 49, 49, 49, 49, 49,
|
49, 52, 52, 52, 189, 60, 189, 72, 72, 72,
|
49, 52, 52, 52, 189, 60, 189, 72, 72, 72,
|
82, 72, 87, 85, 171, 60, 52, 60, 60, 85,
|
82, 72, 87, 85, 171, 60, 52, 60, 60, 85,
|
89, 82, 52, 87, 85, 82, 87, 60, 72, 52,
|
89, 82, 52, 87, 85, 82, 87, 60, 72, 52,
|
88, 89, 60, 88, 90, 113, 89, 93, 93, 93,
|
88, 89, 60, 88, 90, 113, 89, 93, 93, 93,
|
170, 88, 167, 88, 114, 90, 113, 90, 94, 94,
|
170, 88, 167, 88, 114, 90, 113, 90, 94, 94,
|
94, 103, 103, 105, 105, 114, 93, 108, 108, 108,
|
94, 103, 103, 105, 105, 114, 93, 108, 108, 108,
|
117, 103, 165, 105, 163, 108, 103, 94, 96, 96,
|
117, 103, 165, 105, 163, 108, 103, 94, 96, 96,
|
|
|
153, 117, 108, 109, 109, 109, 152, 109, 143, 96,
|
153, 117, 108, 109, 109, 109, 152, 109, 143, 96,
|
96, 96, 96, 96, 96, 143, 118, 116, 112, 112,
|
96, 96, 96, 96, 96, 143, 118, 116, 112, 112,
|
112, 192, 192, 151, 109, 110, 112, 118, 116, 110,
|
112, 192, 192, 151, 109, 110, 112, 118, 116, 110,
|
110, 116, 110, 112, 110, 150, 119, 122, 124, 110,
|
110, 116, 110, 112, 110, 150, 119, 122, 124, 110,
|
110, 110, 115, 120, 149, 115, 110, 119, 122, 124,
|
110, 110, 115, 120, 149, 115, 110, 119, 122, 124,
|
148, 127, 120, 115, 120, 123, 142, 110, 110, 110,
|
148, 127, 120, 115, 120, 123, 142, 110, 110, 110,
|
110, 121, 127, 123, 121, 110, 123, 125, 126, 144,
|
110, 121, 127, 123, 121, 110, 123, 125, 126, 144,
|
125, 126, 121, 130, 130, 130, 139, 139, 125, 126,
|
125, 126, 121, 130, 130, 130, 139, 139, 125, 126,
|
141, 141, 145, 146, 147, 155, 139, 144, 157, 136,
|
141, 141, 145, 146, 147, 155, 139, 144, 157, 136,
|
141, 139, 130, 132, 132, 147, 155, 204, 133, 157,
|
141, 139, 130, 132, 132, 147, 155, 204, 133, 157,
|
|
|
145, 146, 204, 159, 132, 132, 132, 132, 132, 132,
|
145, 146, 204, 159, 132, 132, 132, 132, 132, 132,
|
154, 154, 154, 156, 159, 158, 156, 131, 154, 160,
|
154, 154, 154, 156, 159, 158, 156, 131, 154, 160,
|
161, 161, 162, 128, 156, 154, 158, 107, 158, 166,
|
161, 161, 162, 128, 156, 154, 158, 107, 158, 166,
|
160, 177, 161, 162, 166, 166, 169, 169, 169, 178,
|
160, 177, 161, 162, 166, 166, 169, 169, 169, 178,
|
101, 179, 177, 179, 169, 182, 182, 185, 185, 186,
|
101, 179, 177, 179, 169, 182, 182, 185, 185, 186,
|
178, 169, 179, 178, 99, 182, 97, 185, 188, 188,
|
178, 169, 179, 178, 99, 182, 97, 185, 188, 188,
|
186, 190, 190, 191, 191, 191, 193, 193, 188, 194,
|
186, 190, 190, 191, 191, 191, 193, 193, 188, 194,
|
194, 190, 205, 213, 92, 214, 193, 205, 213, 194,
|
194, 190, 205, 213, 92, 214, 193, 205, 213, 194,
|
214, 91, 191, 196, 196, 196, 196, 196, 196, 196,
|
214, 91, 191, 196, 196, 196, 196, 196, 196, 196,
|
196, 196, 196, 196, 196, 196, 196, 197, 66, 56,
|
196, 196, 196, 196, 196, 196, 196, 197, 66, 56,
|
|
|
197, 47, 46, 45, 197, 197, 197, 198, 198, 198,
|
197, 47, 46, 45, 197, 197, 197, 198, 198, 198,
|
44, 25, 24, 23, 19, 198, 17, 198, 15, 5,
|
44, 25, 24, 23, 19, 198, 17, 198, 15, 5,
|
198, 198, 198, 199, 4, 199, 199, 199, 200, 200,
|
198, 198, 198, 199, 4, 199, 199, 199, 200, 200,
|
200, 3, 0, 0, 0, 200, 200, 200, 0, 0,
|
200, 3, 0, 0, 0, 200, 200, 200, 0, 0,
|
0, 200, 200, 200, 201, 201, 0, 201, 201, 201,
|
0, 200, 200, 200, 201, 201, 0, 201, 201, 201,
|
201, 201, 201, 201, 201, 201, 201, 201, 201, 201,
|
201, 201, 201, 201, 201, 201, 201, 201, 201, 201,
|
201, 202, 202, 202, 203, 0, 0, 0, 203, 203,
|
201, 202, 202, 202, 203, 0, 0, 0, 203, 203,
|
203, 206, 0, 0, 206, 206, 206, 206, 207, 207,
|
203, 206, 0, 0, 206, 206, 206, 206, 207, 207,
|
207, 0, 207, 0, 0, 0, 0, 0, 207, 0,
|
207, 0, 207, 0, 0, 0, 0, 0, 207, 0,
|
0, 207, 207, 207, 208, 0, 0, 0, 0, 208,
|
0, 207, 207, 207, 208, 0, 0, 0, 0, 208,
|
|
|
0, 0, 0, 0, 208, 209, 0, 0, 209, 209,
|
0, 0, 0, 0, 208, 209, 0, 0, 209, 209,
|
209, 209, 210, 0, 0, 210, 210, 0, 0, 0,
|
209, 209, 210, 0, 0, 210, 210, 0, 0, 0,
|
210, 210, 211, 211, 211, 212, 212, 212, 0, 0,
|
210, 210, 211, 211, 211, 212, 212, 212, 0, 0,
|
0, 0, 212, 212, 212, 0, 0, 0, 212, 212,
|
0, 0, 212, 212, 212, 0, 0, 0, 212, 212,
|
212, 215, 0, 0, 215, 215, 215, 215, 216, 0,
|
212, 215, 0, 0, 215, 215, 215, 215, 216, 0,
|
0, 0, 216, 0, 0, 0, 216, 216, 195, 195,
|
0, 0, 216, 0, 0, 0, 216, 216, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
195, 195, 195, 195, 195, 195, 195, 195, 195, 195,
|
|
|
195, 195, 195, 195, 195, 195, 195, 195
|
195, 195, 195, 195, 195, 195, 195, 195
|
} ;
|
} ;
|
|
|
static yy_state_type yy_last_accepting_state;
|
static yy_state_type yy_last_accepting_state;
|
static char *yy_last_accepting_cpos;
|
static char *yy_last_accepting_cpos;
|
|
|
/* The intent behind this definition is that it'll catch
|
/* The intent behind this definition is that it'll catch
|
* any uses of REJECT which flex missed.
|
* any uses of REJECT which flex missed.
|
*/
|
*/
|
#define REJECT reject_used_but_not_detected
|
#define REJECT reject_used_but_not_detected
|
#define yymore() yymore_used_but_not_detected
|
#define yymore() yymore_used_but_not_detected
|
#define YY_MORE_ADJ 0
|
#define YY_MORE_ADJ 0
|
#define YY_RESTORE_YY_MORE_OFFSET
|
#define YY_RESTORE_YY_MORE_OFFSET
|
char *yytext;
|
char *yytext;
|
#line 1 "ada-lex.l"
|
#line 1 "ada-lex.l"
|
#define INITIAL 0
|
#define INITIAL 0
|
/* FLEX lexer for Ada expressions, for GDB.
|
/* FLEX lexer for Ada expressions, for GDB.
|
Copyright (C) 1994, 1997, 1998, 2000, 2001, 2002, 2003, 2007, 2008, 2009,
|
Copyright (C) 1994, 1997, 1998, 2000, 2001, 2002, 2003, 2007, 2008, 2009,
|
2010 Free Software Foundation, Inc.
|
2010 Free Software Foundation, Inc.
|
|
|
This file is part of GDB.
|
This file is part of GDB.
|
|
|
This program is free software; you can redistribute it and/or modify
|
This program is free software; you can redistribute it and/or modify
|
it under the terms of the GNU General Public License as published by
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 3 of the License, or
|
the Free Software Foundation; either version 3 of the License, or
|
(at your option) any later version.
|
(at your option) any later version.
|
|
|
This program is distributed in the hope that it will be useful,
|
This program is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with this program. If not, see <http://www.gnu.org/licenses/>. */
|
along with this program. If not, see <http://www.gnu.org/licenses/>. */
|
/*----------------------------------------------------------------------*/
|
/*----------------------------------------------------------------------*/
|
/* The converted version of this file is to be included in ada-exp.y, */
|
/* The converted version of this file is to be included in ada-exp.y, */
|
/* the Ada parser for gdb. The function yylex obtains characters from */
|
/* the Ada parser for gdb. The function yylex obtains characters from */
|
/* the global pointer lexptr. It returns a syntactic category for */
|
/* the global pointer lexptr. It returns a syntactic category for */
|
/* each successive token and places a semantic value into yylval */
|
/* each successive token and places a semantic value into yylval */
|
/* (ada-lval), defined by the parser. */
|
/* (ada-lval), defined by the parser. */
|
#line 44 "ada-lex.l"
|
#line 44 "ada-lex.l"
|
|
|
#define NUMERAL_WIDTH 256
|
#define NUMERAL_WIDTH 256
|
#define LONGEST_SIGN ((ULONGEST) 1 << (sizeof(LONGEST) * HOST_CHAR_BIT - 1))
|
#define LONGEST_SIGN ((ULONGEST) 1 << (sizeof(LONGEST) * HOST_CHAR_BIT - 1))
|
|
|
/* Temporary staging for numeric literals. */
|
/* Temporary staging for numeric literals. */
|
static char numbuf[NUMERAL_WIDTH];
|
static char numbuf[NUMERAL_WIDTH];
|
static void canonicalizeNumeral (char *s1, const char *);
|
static void canonicalizeNumeral (char *s1, const char *);
|
static struct stoken processString (const char*, int);
|
static struct stoken processString (const char*, int);
|
static int processInt (const char *, const char *, const char *);
|
static int processInt (const char *, const char *, const char *);
|
static int processReal (const char *);
|
static int processReal (const char *);
|
static struct stoken processId (const char *, int);
|
static struct stoken processId (const char *, int);
|
static int processAttribute (const char *);
|
static int processAttribute (const char *);
|
static int find_dot_all (const char *);
|
static int find_dot_all (const char *);
|
|
|
#undef YY_DECL
|
#undef YY_DECL
|
#define YY_DECL static int yylex ( void )
|
#define YY_DECL static int yylex ( void )
|
|
|
/* Flex generates a static function "input" which is not used.
|
/* Flex generates a static function "input" which is not used.
|
Defining YY_NO_INPUT comments it out. */
|
Defining YY_NO_INPUT comments it out. */
|
#define YY_NO_INPUT
|
#define YY_NO_INPUT
|
|
|
#undef YY_INPUT
|
#undef YY_INPUT
|
#define YY_INPUT(BUF, RESULT, MAX_SIZE) \
|
#define YY_INPUT(BUF, RESULT, MAX_SIZE) \
|
if ( *lexptr == '\000' ) \
|
if ( *lexptr == '\000' ) \
|
(RESULT) = YY_NULL; \
|
(RESULT) = YY_NULL; \
|
else \
|
else \
|
{ \
|
{ \
|
*(BUF) = *lexptr; \
|
*(BUF) = *lexptr; \
|
(RESULT) = 1; \
|
(RESULT) = 1; \
|
lexptr += 1; \
|
lexptr += 1; \
|
}
|
}
|
|
|
static int find_dot_all (const char *);
|
static int find_dot_all (const char *);
|
|
|
#define BEFORE_QUAL_QUOTE 1
|
#define BEFORE_QUAL_QUOTE 1
|
|
|
#line 672 "ada-lex.c"
|
#line 672 "ada-lex.c"
|
|
|
/* Macros after this point can all be overridden by user definitions in
|
/* Macros after this point can all be overridden by user definitions in
|
* section 1.
|
* section 1.
|
*/
|
*/
|
|
|
#ifndef YY_SKIP_YYWRAP
|
#ifndef YY_SKIP_YYWRAP
|
#ifdef __cplusplus
|
#ifdef __cplusplus
|
extern "C" int yywrap YY_PROTO(( void ));
|
extern "C" int yywrap YY_PROTO(( void ));
|
#else
|
#else
|
extern int yywrap YY_PROTO(( void ));
|
extern int yywrap YY_PROTO(( void ));
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
#ifndef YY_NO_UNPUT
|
#ifndef YY_NO_UNPUT
|
static void yyunput YY_PROTO(( int c, char *buf_ptr ));
|
static void yyunput YY_PROTO(( int c, char *buf_ptr ));
|
#endif
|
#endif
|
|
|
#ifndef yytext_ptr
|
#ifndef yytext_ptr
|
static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int ));
|
static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int ));
|
#endif
|
#endif
|
|
|
#ifdef YY_NEED_STRLEN
|
#ifdef YY_NEED_STRLEN
|
static int yy_flex_strlen YY_PROTO(( yyconst char * ));
|
static int yy_flex_strlen YY_PROTO(( yyconst char * ));
|
#endif
|
#endif
|
|
|
#ifndef YY_NO_INPUT
|
#ifndef YY_NO_INPUT
|
#ifdef __cplusplus
|
#ifdef __cplusplus
|
static int yyinput YY_PROTO(( void ));
|
static int yyinput YY_PROTO(( void ));
|
#else
|
#else
|
static int input YY_PROTO(( void ));
|
static int input YY_PROTO(( void ));
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
#if YY_STACK_USED
|
#if YY_STACK_USED
|
static int yy_start_stack_ptr = 0;
|
static int yy_start_stack_ptr = 0;
|
static int yy_start_stack_depth = 0;
|
static int yy_start_stack_depth = 0;
|
static int *yy_start_stack = 0;
|
static int *yy_start_stack = 0;
|
#ifndef YY_NO_PUSH_STATE
|
#ifndef YY_NO_PUSH_STATE
|
static void yy_push_state YY_PROTO(( int new_state ));
|
static void yy_push_state YY_PROTO(( int new_state ));
|
#endif
|
#endif
|
#ifndef YY_NO_POP_STATE
|
#ifndef YY_NO_POP_STATE
|
static void yy_pop_state YY_PROTO(( void ));
|
static void yy_pop_state YY_PROTO(( void ));
|
#endif
|
#endif
|
#ifndef YY_NO_TOP_STATE
|
#ifndef YY_NO_TOP_STATE
|
static int yy_top_state YY_PROTO(( void ));
|
static int yy_top_state YY_PROTO(( void ));
|
#endif
|
#endif
|
|
|
#else
|
#else
|
#define YY_NO_PUSH_STATE 1
|
#define YY_NO_PUSH_STATE 1
|
#define YY_NO_POP_STATE 1
|
#define YY_NO_POP_STATE 1
|
#define YY_NO_TOP_STATE 1
|
#define YY_NO_TOP_STATE 1
|
#endif
|
#endif
|
|
|
#ifdef YY_MALLOC_DECL
|
#ifdef YY_MALLOC_DECL
|
YY_MALLOC_DECL
|
YY_MALLOC_DECL
|
#else
|
#else
|
#if __STDC__
|
#if __STDC__
|
#ifndef __cplusplus
|
#ifndef __cplusplus
|
#include <stdlib.h>
|
#include <stdlib.h>
|
#endif
|
#endif
|
#else
|
#else
|
/* Just try to get by without declaring the routines. This will fail
|
/* Just try to get by without declaring the routines. This will fail
|
* miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
|
* miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
|
* or sizeof(void*) != sizeof(int).
|
* or sizeof(void*) != sizeof(int).
|
*/
|
*/
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
/* Amount of stuff to slurp up with each read. */
|
/* Amount of stuff to slurp up with each read. */
|
#ifndef YY_READ_BUF_SIZE
|
#ifndef YY_READ_BUF_SIZE
|
#define YY_READ_BUF_SIZE 8192
|
#define YY_READ_BUF_SIZE 8192
|
#endif
|
#endif
|
|
|
/* Copy whatever the last rule matched to the standard output. */
|
/* Copy whatever the last rule matched to the standard output. */
|
|
|
#ifndef ECHO
|
#ifndef ECHO
|
/* This used to be an fputs(), but since the string might contain NUL's,
|
/* This used to be an fputs(), but since the string might contain NUL's,
|
* we now use fwrite().
|
* we now use fwrite().
|
*/
|
*/
|
#define ECHO (void) fwrite( yytext, yyleng, 1, yyout )
|
#define ECHO (void) fwrite( yytext, yyleng, 1, yyout )
|
#endif
|
#endif
|
|
|
/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
|
/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
|
* is returned in "result".
|
* is returned in "result".
|
*/
|
*/
|
#ifndef YY_INPUT
|
#ifndef YY_INPUT
|
#define YY_INPUT(buf,result,max_size) \
|
#define YY_INPUT(buf,result,max_size) \
|
if ( yy_current_buffer->yy_is_interactive ) \
|
if ( yy_current_buffer->yy_is_interactive ) \
|
{ \
|
{ \
|
int c = '*', n; \
|
int c = '*', n; \
|
for ( n = 0; n < max_size && \
|
for ( n = 0; n < max_size && \
|
(c = getc( yyin )) != EOF && c != '\n'; ++n ) \
|
(c = getc( yyin )) != EOF && c != '\n'; ++n ) \
|
buf[n] = (char) c; \
|
buf[n] = (char) c; \
|
if ( c == '\n' ) \
|
if ( c == '\n' ) \
|
buf[n++] = (char) c; \
|
buf[n++] = (char) c; \
|
if ( c == EOF && ferror( yyin ) ) \
|
if ( c == EOF && ferror( yyin ) ) \
|
YY_FATAL_ERROR( "input in flex scanner failed" ); \
|
YY_FATAL_ERROR( "input in flex scanner failed" ); \
|
result = n; \
|
result = n; \
|
} \
|
} \
|
else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \
|
else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \
|
&& ferror( yyin ) ) \
|
&& ferror( yyin ) ) \
|
YY_FATAL_ERROR( "input in flex scanner failed" );
|
YY_FATAL_ERROR( "input in flex scanner failed" );
|
#endif
|
#endif
|
|
|
/* No semi-colon after return; correct usage is to write "yyterminate();" -
|
/* No semi-colon after return; correct usage is to write "yyterminate();" -
|
* we don't want an extra ';' after the "return" because that will cause
|
* we don't want an extra ';' after the "return" because that will cause
|
* some compilers to complain about unreachable statements.
|
* some compilers to complain about unreachable statements.
|
*/
|
*/
|
#ifndef yyterminate
|
#ifndef yyterminate
|
#define yyterminate() return YY_NULL
|
#define yyterminate() return YY_NULL
|
#endif
|
#endif
|
|
|
/* Number of entries by which start-condition stack grows. */
|
/* Number of entries by which start-condition stack grows. */
|
#ifndef YY_START_STACK_INCR
|
#ifndef YY_START_STACK_INCR
|
#define YY_START_STACK_INCR 25
|
#define YY_START_STACK_INCR 25
|
#endif
|
#endif
|
|
|
/* Report a fatal error. */
|
/* Report a fatal error. */
|
#ifndef YY_FATAL_ERROR
|
#ifndef YY_FATAL_ERROR
|
#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
|
#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
|
#endif
|
#endif
|
|
|
/* Default declaration of generated scanner - a define so the user can
|
/* Default declaration of generated scanner - a define so the user can
|
* easily add parameters.
|
* easily add parameters.
|
*/
|
*/
|
#ifndef YY_DECL
|
#ifndef YY_DECL
|
#define YY_DECL int yylex YY_PROTO(( void ))
|
#define YY_DECL int yylex YY_PROTO(( void ))
|
#endif
|
#endif
|
|
|
/* Code executed at the beginning of each rule, after yytext and yyleng
|
/* Code executed at the beginning of each rule, after yytext and yyleng
|
* have been set up.
|
* have been set up.
|
*/
|
*/
|
#ifndef YY_USER_ACTION
|
#ifndef YY_USER_ACTION
|
#define YY_USER_ACTION
|
#define YY_USER_ACTION
|
#endif
|
#endif
|
|
|
/* Code executed at the end of each rule. */
|
/* Code executed at the end of each rule. */
|
#ifndef YY_BREAK
|
#ifndef YY_BREAK
|
#define YY_BREAK break;
|
#define YY_BREAK break;
|
#endif
|
#endif
|
|
|
#define YY_RULE_SETUP \
|
#define YY_RULE_SETUP \
|
YY_USER_ACTION
|
YY_USER_ACTION
|
|
|
YY_DECL
|
YY_DECL
|
{
|
{
|
register yy_state_type yy_current_state;
|
register yy_state_type yy_current_state;
|
register char *yy_cp = NULL, *yy_bp = NULL;
|
register char *yy_cp = NULL, *yy_bp = NULL;
|
register int yy_act;
|
register int yy_act;
|
|
|
#line 84 "ada-lex.l"
|
#line 84 "ada-lex.l"
|
|
|
|
|
#line 826 "ada-lex.c"
|
#line 826 "ada-lex.c"
|
|
|
if ( yy_init )
|
if ( yy_init )
|
{
|
{
|
yy_init = 0;
|
yy_init = 0;
|
|
|
#ifdef YY_USER_INIT
|
#ifdef YY_USER_INIT
|
YY_USER_INIT;
|
YY_USER_INIT;
|
#endif
|
#endif
|
|
|
if ( ! yy_start )
|
if ( ! yy_start )
|
yy_start = 1; /* first start state */
|
yy_start = 1; /* first start state */
|
|
|
if ( ! yyin )
|
if ( ! yyin )
|
yyin = stdin;
|
yyin = stdin;
|
|
|
if ( ! yyout )
|
if ( ! yyout )
|
yyout = stdout;
|
yyout = stdout;
|
|
|
if ( ! yy_current_buffer )
|
if ( ! yy_current_buffer )
|
yy_current_buffer =
|
yy_current_buffer =
|
yy_create_buffer( yyin, YY_BUF_SIZE );
|
yy_create_buffer( yyin, YY_BUF_SIZE );
|
|
|
yy_load_buffer_state();
|
yy_load_buffer_state();
|
}
|
}
|
|
|
while ( 1 ) /* loops until end-of-file is reached */
|
while ( 1 ) /* loops until end-of-file is reached */
|
{
|
{
|
yy_cp = yy_c_buf_p;
|
yy_cp = yy_c_buf_p;
|
|
|
/* Support of yytext. */
|
/* Support of yytext. */
|
*yy_cp = yy_hold_char;
|
*yy_cp = yy_hold_char;
|
|
|
/* yy_bp points to the position in yy_ch_buf of the start of
|
/* yy_bp points to the position in yy_ch_buf of the start of
|
* the current run.
|
* the current run.
|
*/
|
*/
|
yy_bp = yy_cp;
|
yy_bp = yy_cp;
|
|
|
yy_current_state = yy_start;
|
yy_current_state = yy_start;
|
yy_match:
|
yy_match:
|
do
|
do
|
{
|
{
|
register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
|
register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
|
if ( yy_accept[yy_current_state] )
|
if ( yy_accept[yy_current_state] )
|
{
|
{
|
yy_last_accepting_state = yy_current_state;
|
yy_last_accepting_state = yy_current_state;
|
yy_last_accepting_cpos = yy_cp;
|
yy_last_accepting_cpos = yy_cp;
|
}
|
}
|
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
|
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
|
{
|
{
|
yy_current_state = (int) yy_def[yy_current_state];
|
yy_current_state = (int) yy_def[yy_current_state];
|
if ( yy_current_state >= 196 )
|
if ( yy_current_state >= 196 )
|
yy_c = yy_meta[(unsigned int) yy_c];
|
yy_c = yy_meta[(unsigned int) yy_c];
|
}
|
}
|
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
|
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
|
++yy_cp;
|
++yy_cp;
|
}
|
}
|
while ( yy_base[yy_current_state] != 759 );
|
while ( yy_base[yy_current_state] != 759 );
|
|
|
yy_find_action:
|
yy_find_action:
|
yy_act = yy_accept[yy_current_state];
|
yy_act = yy_accept[yy_current_state];
|
if ( yy_act == 0 )
|
if ( yy_act == 0 )
|
{ /* have to back up */
|
{ /* have to back up */
|
yy_cp = yy_last_accepting_cpos;
|
yy_cp = yy_last_accepting_cpos;
|
yy_current_state = yy_last_accepting_state;
|
yy_current_state = yy_last_accepting_state;
|
yy_act = yy_accept[yy_current_state];
|
yy_act = yy_accept[yy_current_state];
|
}
|
}
|
|
|
YY_DO_BEFORE_ACTION;
|
YY_DO_BEFORE_ACTION;
|
|
|
|
|
do_action: /* This label is used only to access EOF actions. */
|
do_action: /* This label is used only to access EOF actions. */
|
|
|
|
|
switch ( yy_act )
|
switch ( yy_act )
|
{ /* beginning of action switch */
|
{ /* beginning of action switch */
|
case 0: /* must back up */
|
case 0: /* must back up */
|
/* undo the effects of YY_DO_BEFORE_ACTION */
|
/* undo the effects of YY_DO_BEFORE_ACTION */
|
*yy_cp = yy_hold_char;
|
*yy_cp = yy_hold_char;
|
yy_cp = yy_last_accepting_cpos;
|
yy_cp = yy_last_accepting_cpos;
|
yy_current_state = yy_last_accepting_state;
|
yy_current_state = yy_last_accepting_state;
|
goto yy_find_action;
|
goto yy_find_action;
|
|
|
case 1:
|
case 1:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 86 "ada-lex.l"
|
#line 86 "ada-lex.l"
|
{ }
|
{ }
|
YY_BREAK
|
YY_BREAK
|
case 2:
|
case 2:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 88 "ada-lex.l"
|
#line 88 "ada-lex.l"
|
{ yyterminate(); }
|
{ yyterminate(); }
|
YY_BREAK
|
YY_BREAK
|
case 3:
|
case 3:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 90 "ada-lex.l"
|
#line 90 "ada-lex.l"
|
{
|
{
|
canonicalizeNumeral (numbuf, yytext);
|
canonicalizeNumeral (numbuf, yytext);
|
return processInt (NULL, numbuf, strrchr(numbuf, 'e')+1);
|
return processInt (NULL, numbuf, strrchr(numbuf, 'e')+1);
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 4:
|
case 4:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 95 "ada-lex.l"
|
#line 95 "ada-lex.l"
|
{
|
{
|
canonicalizeNumeral (numbuf, yytext);
|
canonicalizeNumeral (numbuf, yytext);
|
return processInt (NULL, numbuf, NULL);
|
return processInt (NULL, numbuf, NULL);
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 5:
|
case 5:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 100 "ada-lex.l"
|
#line 100 "ada-lex.l"
|
{
|
{
|
canonicalizeNumeral (numbuf, yytext);
|
canonicalizeNumeral (numbuf, yytext);
|
return processInt (numbuf,
|
return processInt (numbuf,
|
strchr (numbuf, '#') + 1,
|
strchr (numbuf, '#') + 1,
|
strrchr(numbuf, '#') + 1);
|
strrchr(numbuf, '#') + 1);
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 6:
|
case 6:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 107 "ada-lex.l"
|
#line 107 "ada-lex.l"
|
{
|
{
|
canonicalizeNumeral (numbuf, yytext);
|
canonicalizeNumeral (numbuf, yytext);
|
return processInt (numbuf, strchr (numbuf, '#') + 1, NULL);
|
return processInt (numbuf, strchr (numbuf, '#') + 1, NULL);
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 7:
|
case 7:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 112 "ada-lex.l"
|
#line 112 "ada-lex.l"
|
{
|
{
|
canonicalizeNumeral (numbuf, yytext+2);
|
canonicalizeNumeral (numbuf, yytext+2);
|
return processInt ("16#", numbuf, NULL);
|
return processInt ("16#", numbuf, NULL);
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 8:
|
case 8:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 118 "ada-lex.l"
|
#line 118 "ada-lex.l"
|
{
|
{
|
canonicalizeNumeral (numbuf, yytext);
|
canonicalizeNumeral (numbuf, yytext);
|
return processReal (numbuf);
|
return processReal (numbuf);
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 9:
|
case 9:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 123 "ada-lex.l"
|
#line 123 "ada-lex.l"
|
{
|
{
|
canonicalizeNumeral (numbuf, yytext);
|
canonicalizeNumeral (numbuf, yytext);
|
return processReal (numbuf);
|
return processReal (numbuf);
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 10:
|
case 10:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 128 "ada-lex.l"
|
#line 128 "ada-lex.l"
|
{
|
{
|
error (_("Based real literals not implemented yet."));
|
error (_("Based real literals not implemented yet."));
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 11:
|
case 11:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 132 "ada-lex.l"
|
#line 132 "ada-lex.l"
|
{
|
{
|
error (_("Based real literals not implemented yet."));
|
error (_("Based real literals not implemented yet."));
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 12:
|
case 12:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 136 "ada-lex.l"
|
#line 136 "ada-lex.l"
|
{
|
{
|
yylval.typed_val.type = type_char ();
|
yylval.typed_val.type = type_char ();
|
yylval.typed_val.val = yytext[1];
|
yylval.typed_val.val = yytext[1];
|
return CHARLIT;
|
return CHARLIT;
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 13:
|
case 13:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 142 "ada-lex.l"
|
#line 142 "ada-lex.l"
|
{
|
{
|
int v;
|
int v;
|
yylval.typed_val.type = type_char ();
|
yylval.typed_val.type = type_char ();
|
sscanf (yytext+3, "%2x", &v);
|
sscanf (yytext+3, "%2x", &v);
|
yylval.typed_val.val = v;
|
yylval.typed_val.val = v;
|
return CHARLIT;
|
return CHARLIT;
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 14:
|
case 14:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 150 "ada-lex.l"
|
#line 150 "ada-lex.l"
|
{
|
{
|
yylval.sval = processString (yytext+1, yyleng-2);
|
yylval.sval = processString (yytext+1, yyleng-2);
|
return STRING;
|
return STRING;
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 15:
|
case 15:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 155 "ada-lex.l"
|
#line 155 "ada-lex.l"
|
{
|
{
|
error (_("ill-formed or non-terminated string literal"));
|
error (_("ill-formed or non-terminated string literal"));
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 16:
|
case 16:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 160 "ada-lex.l"
|
#line 160 "ada-lex.l"
|
{
|
{
|
while (*lexptr != 'i' && *lexptr != 'I')
|
while (*lexptr != 'i' && *lexptr != 'I')
|
lexptr -= 1;
|
lexptr -= 1;
|
yyrestart(NULL);
|
yyrestart(NULL);
|
return 0;
|
return 0;
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 17:
|
case 17:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 167 "ada-lex.l"
|
#line 167 "ada-lex.l"
|
{
|
{
|
/* This keyword signals the end of the expression and
|
/* This keyword signals the end of the expression and
|
will be processed separately. */
|
will be processed separately. */
|
while (*lexptr != 't' && *lexptr != 'T')
|
while (*lexptr != 't' && *lexptr != 'T')
|
lexptr--;
|
lexptr--;
|
yyrestart(NULL);
|
yyrestart(NULL);
|
return 0;
|
return 0;
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
/* ADA KEYWORDS */
|
/* ADA KEYWORDS */
|
case 18:
|
case 18:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 178 "ada-lex.l"
|
#line 178 "ada-lex.l"
|
{ return ABS; }
|
{ return ABS; }
|
YY_BREAK
|
YY_BREAK
|
case 19:
|
case 19:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 179 "ada-lex.l"
|
#line 179 "ada-lex.l"
|
{ return _AND_; }
|
{ return _AND_; }
|
YY_BREAK
|
YY_BREAK
|
case 20:
|
case 20:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 180 "ada-lex.l"
|
#line 180 "ada-lex.l"
|
{ return ELSE; }
|
{ return ELSE; }
|
YY_BREAK
|
YY_BREAK
|
case 21:
|
case 21:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 181 "ada-lex.l"
|
#line 181 "ada-lex.l"
|
{ return IN; }
|
{ return IN; }
|
YY_BREAK
|
YY_BREAK
|
case 22:
|
case 22:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 182 "ada-lex.l"
|
#line 182 "ada-lex.l"
|
{ return MOD; }
|
{ return MOD; }
|
YY_BREAK
|
YY_BREAK
|
case 23:
|
case 23:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 183 "ada-lex.l"
|
#line 183 "ada-lex.l"
|
{ return NEW; }
|
{ return NEW; }
|
YY_BREAK
|
YY_BREAK
|
case 24:
|
case 24:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 184 "ada-lex.l"
|
#line 184 "ada-lex.l"
|
{ return NOT; }
|
{ return NOT; }
|
YY_BREAK
|
YY_BREAK
|
case 25:
|
case 25:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 185 "ada-lex.l"
|
#line 185 "ada-lex.l"
|
{ return NULL_PTR; }
|
{ return NULL_PTR; }
|
YY_BREAK
|
YY_BREAK
|
case 26:
|
case 26:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 186 "ada-lex.l"
|
#line 186 "ada-lex.l"
|
{ return OR; }
|
{ return OR; }
|
YY_BREAK
|
YY_BREAK
|
case 27:
|
case 27:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 187 "ada-lex.l"
|
#line 187 "ada-lex.l"
|
{ return OTHERS; }
|
{ return OTHERS; }
|
YY_BREAK
|
YY_BREAK
|
case 28:
|
case 28:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 188 "ada-lex.l"
|
#line 188 "ada-lex.l"
|
{ return REM; }
|
{ return REM; }
|
YY_BREAK
|
YY_BREAK
|
case 29:
|
case 29:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 189 "ada-lex.l"
|
#line 189 "ada-lex.l"
|
{ return THEN; }
|
{ return THEN; }
|
YY_BREAK
|
YY_BREAK
|
case 30:
|
case 30:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 190 "ada-lex.l"
|
#line 190 "ada-lex.l"
|
{ return XOR; }
|
{ return XOR; }
|
YY_BREAK
|
YY_BREAK
|
/* BOOLEAN "KEYWORDS" */
|
/* BOOLEAN "KEYWORDS" */
|
/* True and False are not keywords in Ada, but rather enumeration constants.
|
/* True and False are not keywords in Ada, but rather enumeration constants.
|
However, the boolean type is no longer represented as an enum, so True
|
However, the boolean type is no longer represented as an enum, so True
|
and False are no longer defined in symbol tables. We compromise by
|
and False are no longer defined in symbol tables. We compromise by
|
making them keywords (when bare). */
|
making them keywords (when bare). */
|
case 31:
|
case 31:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 199 "ada-lex.l"
|
#line 199 "ada-lex.l"
|
{ return TRUEKEYWORD; }
|
{ return TRUEKEYWORD; }
|
YY_BREAK
|
YY_BREAK
|
case 32:
|
case 32:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 200 "ada-lex.l"
|
#line 200 "ada-lex.l"
|
{ return FALSEKEYWORD; }
|
{ return FALSEKEYWORD; }
|
YY_BREAK
|
YY_BREAK
|
/* ATTRIBUTES */
|
/* ATTRIBUTES */
|
case 33:
|
case 33:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 204 "ada-lex.l"
|
#line 204 "ada-lex.l"
|
{ return processAttribute (yytext+1); }
|
{ return processAttribute (yytext+1); }
|
YY_BREAK
|
YY_BREAK
|
/* PUNCTUATION */
|
/* PUNCTUATION */
|
case 34:
|
case 34:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 208 "ada-lex.l"
|
#line 208 "ada-lex.l"
|
{ return ARROW; }
|
{ return ARROW; }
|
YY_BREAK
|
YY_BREAK
|
case 35:
|
case 35:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 209 "ada-lex.l"
|
#line 209 "ada-lex.l"
|
{ return DOTDOT; }
|
{ return DOTDOT; }
|
YY_BREAK
|
YY_BREAK
|
case 36:
|
case 36:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 210 "ada-lex.l"
|
#line 210 "ada-lex.l"
|
{ return STARSTAR; }
|
{ return STARSTAR; }
|
YY_BREAK
|
YY_BREAK
|
case 37:
|
case 37:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 211 "ada-lex.l"
|
#line 211 "ada-lex.l"
|
{ return ASSIGN; }
|
{ return ASSIGN; }
|
YY_BREAK
|
YY_BREAK
|
case 38:
|
case 38:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 212 "ada-lex.l"
|
#line 212 "ada-lex.l"
|
{ return NOTEQUAL; }
|
{ return NOTEQUAL; }
|
YY_BREAK
|
YY_BREAK
|
case 39:
|
case 39:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 213 "ada-lex.l"
|
#line 213 "ada-lex.l"
|
{ return LEQ; }
|
{ return LEQ; }
|
YY_BREAK
|
YY_BREAK
|
case 40:
|
case 40:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 214 "ada-lex.l"
|
#line 214 "ada-lex.l"
|
{ return GEQ; }
|
{ return GEQ; }
|
YY_BREAK
|
YY_BREAK
|
case 41:
|
case 41:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 216 "ada-lex.l"
|
#line 216 "ada-lex.l"
|
{ BEGIN INITIAL; return '\''; }
|
{ BEGIN INITIAL; return '\''; }
|
YY_BREAK
|
YY_BREAK
|
case 42:
|
case 42:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 218 "ada-lex.l"
|
#line 218 "ada-lex.l"
|
{ return yytext[0]; }
|
{ return yytext[0]; }
|
YY_BREAK
|
YY_BREAK
|
case 43:
|
case 43:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 220 "ada-lex.l"
|
#line 220 "ada-lex.l"
|
{ if (paren_depth == 0 && comma_terminates)
|
{ if (paren_depth == 0 && comma_terminates)
|
{
|
{
|
lexptr -= 1;
|
lexptr -= 1;
|
yyrestart(NULL);
|
yyrestart(NULL);
|
return 0;
|
return 0;
|
}
|
}
|
else
|
else
|
return ',';
|
return ',';
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 44:
|
case 44:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 230 "ada-lex.l"
|
#line 230 "ada-lex.l"
|
{ paren_depth += 1; return '('; }
|
{ paren_depth += 1; return '('; }
|
YY_BREAK
|
YY_BREAK
|
case 45:
|
case 45:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 231 "ada-lex.l"
|
#line 231 "ada-lex.l"
|
{ if (paren_depth == 0)
|
{ if (paren_depth == 0)
|
{
|
{
|
lexptr -= 1;
|
lexptr -= 1;
|
yyrestart(NULL);
|
yyrestart(NULL);
|
return 0;
|
return 0;
|
}
|
}
|
else
|
else
|
{
|
{
|
paren_depth -= 1;
|
paren_depth -= 1;
|
return ')';
|
return ')';
|
}
|
}
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 46:
|
case 46:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 244 "ada-lex.l"
|
#line 244 "ada-lex.l"
|
{ return DOT_ALL; }
|
{ return DOT_ALL; }
|
YY_BREAK
|
YY_BREAK
|
case 47:
|
case 47:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 246 "ada-lex.l"
|
#line 246 "ada-lex.l"
|
{
|
{
|
yylval.sval = processId (yytext+1, yyleng-1);
|
yylval.sval = processId (yytext+1, yyleng-1);
|
return DOT_ID;
|
return DOT_ID;
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 48:
|
case 48:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 251 "ada-lex.l"
|
#line 251 "ada-lex.l"
|
{
|
{
|
int all_posn = find_dot_all (yytext);
|
int all_posn = find_dot_all (yytext);
|
|
|
if (all_posn == -1 && yytext[yyleng-1] == '\'')
|
if (all_posn == -1 && yytext[yyleng-1] == '\'')
|
{
|
{
|
BEGIN BEFORE_QUAL_QUOTE;
|
BEGIN BEFORE_QUAL_QUOTE;
|
yyless (yyleng-1);
|
yyless (yyleng-1);
|
}
|
}
|
else if (all_posn >= 0)
|
else if (all_posn >= 0)
|
yyless (all_posn);
|
yyless (all_posn);
|
yylval.sval = processId (yytext, yyleng);
|
yylval.sval = processId (yytext, yyleng);
|
return NAME;
|
return NAME;
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
/* GDB EXPRESSION CONSTRUCTS */
|
/* GDB EXPRESSION CONSTRUCTS */
|
case 49:
|
case 49:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 268 "ada-lex.l"
|
#line 268 "ada-lex.l"
|
{
|
{
|
yyless (yyleng - 2);
|
yyless (yyleng - 2);
|
yylval.sval = processId (yytext, yyleng);
|
yylval.sval = processId (yytext, yyleng);
|
return NAME;
|
return NAME;
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
case 50:
|
case 50:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 274 "ada-lex.l"
|
#line 274 "ada-lex.l"
|
{ return COLONCOLON; }
|
{ return COLONCOLON; }
|
YY_BREAK
|
YY_BREAK
|
case 51:
|
case 51:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 276 "ada-lex.l"
|
#line 276 "ada-lex.l"
|
{ return yytext[0]; }
|
{ return yytext[0]; }
|
YY_BREAK
|
YY_BREAK
|
/* REGISTERS AND GDB CONVENIENCE VARIABLES */
|
/* REGISTERS AND GDB CONVENIENCE VARIABLES */
|
case 52:
|
case 52:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 280 "ada-lex.l"
|
#line 280 "ada-lex.l"
|
{
|
{
|
yylval.sval.ptr = yytext;
|
yylval.sval.ptr = yytext;
|
yylval.sval.length = yyleng;
|
yylval.sval.length = yyleng;
|
return SPECIAL_VARIABLE;
|
return SPECIAL_VARIABLE;
|
}
|
}
|
YY_BREAK
|
YY_BREAK
|
/* CATCH-ALL ERROR CASE */
|
/* CATCH-ALL ERROR CASE */
|
case 53:
|
case 53:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 288 "ada-lex.l"
|
#line 288 "ada-lex.l"
|
{ error (_("Invalid character '%s' in expression."), yytext); }
|
{ error (_("Invalid character '%s' in expression."), yytext); }
|
YY_BREAK
|
YY_BREAK
|
case 54:
|
case 54:
|
YY_RULE_SETUP
|
YY_RULE_SETUP
|
#line 289 "ada-lex.l"
|
#line 289 "ada-lex.l"
|
YY_FATAL_ERROR( "flex scanner jammed" );
|
YY_FATAL_ERROR( "flex scanner jammed" );
|
YY_BREAK
|
YY_BREAK
|
#line 1286 "ada-lex.c"
|
#line 1286 "ada-lex.c"
|
case YY_STATE_EOF(INITIAL):
|
case YY_STATE_EOF(INITIAL):
|
case YY_STATE_EOF(BEFORE_QUAL_QUOTE):
|
case YY_STATE_EOF(BEFORE_QUAL_QUOTE):
|
yyterminate();
|
yyterminate();
|
|
|
case YY_END_OF_BUFFER:
|
case YY_END_OF_BUFFER:
|
{
|
{
|
/* Amount of text matched not including the EOB char. */
|
/* Amount of text matched not including the EOB char. */
|
int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1;
|
int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1;
|
|
|
/* Undo the effects of YY_DO_BEFORE_ACTION. */
|
/* Undo the effects of YY_DO_BEFORE_ACTION. */
|
*yy_cp = yy_hold_char;
|
*yy_cp = yy_hold_char;
|
YY_RESTORE_YY_MORE_OFFSET
|
YY_RESTORE_YY_MORE_OFFSET
|
|
|
if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW )
|
if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW )
|
{
|
{
|
/* We're scanning a new file or input source. It's
|
/* We're scanning a new file or input source. It's
|
* possible that this happened because the user
|
* possible that this happened because the user
|
* just pointed yyin at a new source and called
|
* just pointed yyin at a new source and called
|
* yylex(). If so, then we have to assure
|
* yylex(). If so, then we have to assure
|
* consistency between yy_current_buffer and our
|
* consistency between yy_current_buffer and our
|
* globals. Here is the right place to do so, because
|
* globals. Here is the right place to do so, because
|
* this is the first action (other than possibly a
|
* this is the first action (other than possibly a
|
* back-up) that will match for the new input source.
|
* back-up) that will match for the new input source.
|
*/
|
*/
|
yy_n_chars = yy_current_buffer->yy_n_chars;
|
yy_n_chars = yy_current_buffer->yy_n_chars;
|
yy_current_buffer->yy_input_file = yyin;
|
yy_current_buffer->yy_input_file = yyin;
|
yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL;
|
yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL;
|
}
|
}
|
|
|
/* Note that here we test for yy_c_buf_p "<=" to the position
|
/* 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
|
* of the first EOB in the buffer, since yy_c_buf_p will
|
* already have been incremented past the NUL character
|
* already have been incremented past the NUL character
|
* (since all states make transitions on EOB to the
|
* (since all states make transitions on EOB to the
|
* end-of-buffer state). Contrast this with the test
|
* end-of-buffer state). Contrast this with the test
|
* in input().
|
* in input().
|
*/
|
*/
|
if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] )
|
if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] )
|
{ /* This was really a NUL. */
|
{ /* This was really a NUL. */
|
yy_state_type yy_next_state;
|
yy_state_type yy_next_state;
|
|
|
yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text;
|
yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text;
|
|
|
yy_current_state = yy_get_previous_state();
|
yy_current_state = yy_get_previous_state();
|
|
|
/* Okay, we're now positioned to make the NUL
|
/* Okay, we're now positioned to make the NUL
|
* transition. We couldn't have
|
* transition. We couldn't have
|
* yy_get_previous_state() go ahead and do it
|
* yy_get_previous_state() go ahead and do it
|
* for us because it doesn't know how to deal
|
* for us because it doesn't know how to deal
|
* with the possibility of jamming (and we don't
|
* with the possibility of jamming (and we don't
|
* want to build jamming into it because then it
|
* want to build jamming into it because then it
|
* will run more slowly).
|
* will run more slowly).
|
*/
|
*/
|
|
|
yy_next_state = yy_try_NUL_trans( yy_current_state );
|
yy_next_state = yy_try_NUL_trans( yy_current_state );
|
|
|
yy_bp = yytext_ptr + YY_MORE_ADJ;
|
yy_bp = yytext_ptr + YY_MORE_ADJ;
|
|
|
if ( yy_next_state )
|
if ( yy_next_state )
|
{
|
{
|
/* Consume the NUL. */
|
/* Consume the NUL. */
|
yy_cp = ++yy_c_buf_p;
|
yy_cp = ++yy_c_buf_p;
|
yy_current_state = yy_next_state;
|
yy_current_state = yy_next_state;
|
goto yy_match;
|
goto yy_match;
|
}
|
}
|
|
|
else
|
else
|
{
|
{
|
yy_cp = yy_c_buf_p;
|
yy_cp = yy_c_buf_p;
|
goto yy_find_action;
|
goto yy_find_action;
|
}
|
}
|
}
|
}
|
|
|
else switch ( yy_get_next_buffer() )
|
else switch ( yy_get_next_buffer() )
|
{
|
{
|
case EOB_ACT_END_OF_FILE:
|
case EOB_ACT_END_OF_FILE:
|
{
|
{
|
yy_did_buffer_switch_on_eof = 0;
|
yy_did_buffer_switch_on_eof = 0;
|
|
|
if ( yywrap() )
|
if ( yywrap() )
|
{
|
{
|
/* Note: because we've taken care in
|
/* Note: because we've taken care in
|
* yy_get_next_buffer() to have set up
|
* yy_get_next_buffer() to have set up
|
* yytext, we can now set up
|
* yytext, we can now set up
|
* yy_c_buf_p so that if some total
|
* yy_c_buf_p so that if some total
|
* hoser (like flex itself) wants to
|
* hoser (like flex itself) wants to
|
* call the scanner after we return the
|
* call the scanner after we return the
|
* YY_NULL, it'll still work - another
|
* YY_NULL, it'll still work - another
|
* YY_NULL will get returned.
|
* YY_NULL will get returned.
|
*/
|
*/
|
yy_c_buf_p = yytext_ptr + YY_MORE_ADJ;
|
yy_c_buf_p = yytext_ptr + YY_MORE_ADJ;
|
|
|
yy_act = YY_STATE_EOF(YY_START);
|
yy_act = YY_STATE_EOF(YY_START);
|
goto do_action;
|
goto do_action;
|
}
|
}
|
|
|
else
|
else
|
{
|
{
|
if ( ! yy_did_buffer_switch_on_eof )
|
if ( ! yy_did_buffer_switch_on_eof )
|
YY_NEW_FILE;
|
YY_NEW_FILE;
|
}
|
}
|
break;
|
break;
|
}
|
}
|
|
|
case EOB_ACT_CONTINUE_SCAN:
|
case EOB_ACT_CONTINUE_SCAN:
|
yy_c_buf_p =
|
yy_c_buf_p =
|
yytext_ptr + yy_amount_of_matched_text;
|
yytext_ptr + yy_amount_of_matched_text;
|
|
|
yy_current_state = yy_get_previous_state();
|
yy_current_state = yy_get_previous_state();
|
|
|
yy_cp = yy_c_buf_p;
|
yy_cp = yy_c_buf_p;
|
yy_bp = yytext_ptr + YY_MORE_ADJ;
|
yy_bp = yytext_ptr + YY_MORE_ADJ;
|
goto yy_match;
|
goto yy_match;
|
|
|
case EOB_ACT_LAST_MATCH:
|
case EOB_ACT_LAST_MATCH:
|
yy_c_buf_p =
|
yy_c_buf_p =
|
&yy_current_buffer->yy_ch_buf[yy_n_chars];
|
&yy_current_buffer->yy_ch_buf[yy_n_chars];
|
|
|
yy_current_state = yy_get_previous_state();
|
yy_current_state = yy_get_previous_state();
|
|
|
yy_cp = yy_c_buf_p;
|
yy_cp = yy_c_buf_p;
|
yy_bp = yytext_ptr + YY_MORE_ADJ;
|
yy_bp = yytext_ptr + YY_MORE_ADJ;
|
goto yy_find_action;
|
goto yy_find_action;
|
}
|
}
|
break;
|
break;
|
}
|
}
|
|
|
default:
|
default:
|
YY_FATAL_ERROR(
|
YY_FATAL_ERROR(
|
"fatal flex scanner internal error--no action found" );
|
"fatal flex scanner internal error--no action found" );
|
} /* end of action switch */
|
} /* end of action switch */
|
} /* end of scanning one token */
|
} /* end of scanning one token */
|
} /* end of yylex */
|
} /* end of yylex */
|
|
|
|
|
/* yy_get_next_buffer - try to read in a new buffer
|
/* yy_get_next_buffer - try to read in a new buffer
|
*
|
*
|
* Returns a code representing an action:
|
* Returns a code representing an action:
|
* EOB_ACT_LAST_MATCH -
|
* EOB_ACT_LAST_MATCH -
|
* EOB_ACT_CONTINUE_SCAN - continue scanning from current position
|
* EOB_ACT_CONTINUE_SCAN - continue scanning from current position
|
* EOB_ACT_END_OF_FILE - end of file
|
* EOB_ACT_END_OF_FILE - end of file
|
*/
|
*/
|
|
|
static int yy_get_next_buffer()
|
static int yy_get_next_buffer()
|
{
|
{
|
register char *dest = yy_current_buffer->yy_ch_buf;
|
register char *dest = yy_current_buffer->yy_ch_buf;
|
register char *source = yytext_ptr;
|
register char *source = yytext_ptr;
|
register int number_to_move, i;
|
register int number_to_move, i;
|
int ret_val;
|
int ret_val;
|
|
|
if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] )
|
if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] )
|
YY_FATAL_ERROR(
|
YY_FATAL_ERROR(
|
"fatal flex scanner internal error--end of buffer missed" );
|
"fatal flex scanner internal error--end of buffer missed" );
|
|
|
if ( yy_current_buffer->yy_fill_buffer == 0 )
|
if ( yy_current_buffer->yy_fill_buffer == 0 )
|
{ /* Don't try to fill the buffer, so this is an EOF. */
|
{ /* Don't try to fill the buffer, so this is an EOF. */
|
if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 )
|
if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 )
|
{
|
{
|
/* We matched a single character, the EOB, so
|
/* We matched a single character, the EOB, so
|
* treat this as a final EOF.
|
* treat this as a final EOF.
|
*/
|
*/
|
return EOB_ACT_END_OF_FILE;
|
return EOB_ACT_END_OF_FILE;
|
}
|
}
|
|
|
else
|
else
|
{
|
{
|
/* We matched some text prior to the EOB, first
|
/* We matched some text prior to the EOB, first
|
* process it.
|
* process it.
|
*/
|
*/
|
return EOB_ACT_LAST_MATCH;
|
return EOB_ACT_LAST_MATCH;
|
}
|
}
|
}
|
}
|
|
|
/* Try to read more data. */
|
/* Try to read more data. */
|
|
|
/* First move last chars to start of buffer. */
|
/* First move last chars to start of buffer. */
|
number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1;
|
number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1;
|
|
|
for ( i = 0; i < number_to_move; ++i )
|
for ( i = 0; i < number_to_move; ++i )
|
*(dest++) = *(source++);
|
*(dest++) = *(source++);
|
|
|
if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING )
|
if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING )
|
/* don't do the read, it's not guaranteed to return an EOF,
|
/* don't do the read, it's not guaranteed to return an EOF,
|
* just force an EOF
|
* just force an EOF
|
*/
|
*/
|
yy_current_buffer->yy_n_chars = yy_n_chars = 0;
|
yy_current_buffer->yy_n_chars = yy_n_chars = 0;
|
|
|
else
|
else
|
{
|
{
|
int num_to_read =
|
int num_to_read =
|
yy_current_buffer->yy_buf_size - number_to_move - 1;
|
yy_current_buffer->yy_buf_size - number_to_move - 1;
|
|
|
while ( num_to_read <= 0 )
|
while ( num_to_read <= 0 )
|
{ /* Not enough room in the buffer - grow it. */
|
{ /* Not enough room in the buffer - grow it. */
|
#ifdef YY_USES_REJECT
|
#ifdef YY_USES_REJECT
|
YY_FATAL_ERROR(
|
YY_FATAL_ERROR(
|
"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
|
"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
|
#else
|
#else
|
|
|
/* just a shorter name for the current buffer */
|
/* just a shorter name for the current buffer */
|
YY_BUFFER_STATE b = yy_current_buffer;
|
YY_BUFFER_STATE b = yy_current_buffer;
|
|
|
int yy_c_buf_p_offset =
|
int yy_c_buf_p_offset =
|
(int) (yy_c_buf_p - b->yy_ch_buf);
|
(int) (yy_c_buf_p - b->yy_ch_buf);
|
|
|
if ( b->yy_is_our_buffer )
|
if ( b->yy_is_our_buffer )
|
{
|
{
|
int new_size = b->yy_buf_size * 2;
|
int new_size = b->yy_buf_size * 2;
|
|
|
if ( new_size <= 0 )
|
if ( new_size <= 0 )
|
b->yy_buf_size += b->yy_buf_size / 8;
|
b->yy_buf_size += b->yy_buf_size / 8;
|
else
|
else
|
b->yy_buf_size *= 2;
|
b->yy_buf_size *= 2;
|
|
|
b->yy_ch_buf = (char *)
|
b->yy_ch_buf = (char *)
|
/* Include room in for 2 EOB chars. */
|
/* Include room in for 2 EOB chars. */
|
yyxrealloc( (void *) b->yy_ch_buf,
|
yyxrealloc( (void *) b->yy_ch_buf,
|
b->yy_buf_size + 2 );
|
b->yy_buf_size + 2 );
|
}
|
}
|
else
|
else
|
/* Can't grow it, we don't own it. */
|
/* Can't grow it, we don't own it. */
|
b->yy_ch_buf = 0;
|
b->yy_ch_buf = 0;
|
|
|
if ( ! b->yy_ch_buf )
|
if ( ! b->yy_ch_buf )
|
YY_FATAL_ERROR(
|
YY_FATAL_ERROR(
|
"fatal error - scanner input buffer overflow" );
|
"fatal error - scanner input buffer overflow" );
|
|
|
yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
|
yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
|
|
|
num_to_read = yy_current_buffer->yy_buf_size -
|
num_to_read = yy_current_buffer->yy_buf_size -
|
number_to_move - 1;
|
number_to_move - 1;
|
#endif
|
#endif
|
}
|
}
|
|
|
if ( num_to_read > YY_READ_BUF_SIZE )
|
if ( num_to_read > YY_READ_BUF_SIZE )
|
num_to_read = YY_READ_BUF_SIZE;
|
num_to_read = YY_READ_BUF_SIZE;
|
|
|
/* Read in more data. */
|
/* Read in more data. */
|
YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]),
|
YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]),
|
yy_n_chars, num_to_read );
|
yy_n_chars, num_to_read );
|
|
|
yy_current_buffer->yy_n_chars = yy_n_chars;
|
yy_current_buffer->yy_n_chars = yy_n_chars;
|
}
|
}
|
|
|
if ( yy_n_chars == 0 )
|
if ( yy_n_chars == 0 )
|
{
|
{
|
if ( number_to_move == YY_MORE_ADJ )
|
if ( number_to_move == YY_MORE_ADJ )
|
{
|
{
|
ret_val = EOB_ACT_END_OF_FILE;
|
ret_val = EOB_ACT_END_OF_FILE;
|
yyrestart( yyin );
|
yyrestart( yyin );
|
}
|
}
|
|
|
else
|
else
|
{
|
{
|
ret_val = EOB_ACT_LAST_MATCH;
|
ret_val = EOB_ACT_LAST_MATCH;
|
yy_current_buffer->yy_buffer_status =
|
yy_current_buffer->yy_buffer_status =
|
YY_BUFFER_EOF_PENDING;
|
YY_BUFFER_EOF_PENDING;
|
}
|
}
|
}
|
}
|
|
|
else
|
else
|
ret_val = EOB_ACT_CONTINUE_SCAN;
|
ret_val = EOB_ACT_CONTINUE_SCAN;
|
|
|
yy_n_chars += number_to_move;
|
yy_n_chars += number_to_move;
|
yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR;
|
yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR;
|
yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
|
yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
|
|
|
yytext_ptr = &yy_current_buffer->yy_ch_buf[0];
|
yytext_ptr = &yy_current_buffer->yy_ch_buf[0];
|
|
|
return ret_val;
|
return ret_val;
|
}
|
}
|
|
|
|
|
/* yy_get_previous_state - get the state just before the EOB char was reached */
|
/* yy_get_previous_state - get the state just before the EOB char was reached */
|
|
|
static yy_state_type yy_get_previous_state()
|
static yy_state_type yy_get_previous_state()
|
{
|
{
|
register yy_state_type yy_current_state;
|
register yy_state_type yy_current_state;
|
register char *yy_cp;
|
register char *yy_cp;
|
|
|
yy_current_state = yy_start;
|
yy_current_state = yy_start;
|
|
|
for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp )
|
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);
|
register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
|
if ( yy_accept[yy_current_state] )
|
if ( yy_accept[yy_current_state] )
|
{
|
{
|
yy_last_accepting_state = yy_current_state;
|
yy_last_accepting_state = yy_current_state;
|
yy_last_accepting_cpos = yy_cp;
|
yy_last_accepting_cpos = yy_cp;
|
}
|
}
|
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
|
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
|
{
|
{
|
yy_current_state = (int) yy_def[yy_current_state];
|
yy_current_state = (int) yy_def[yy_current_state];
|
if ( yy_current_state >= 196 )
|
if ( yy_current_state >= 196 )
|
yy_c = yy_meta[(unsigned int) yy_c];
|
yy_c = yy_meta[(unsigned int) yy_c];
|
}
|
}
|
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
|
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
|
}
|
}
|
|
|
return yy_current_state;
|
return yy_current_state;
|
}
|
}
|
|
|
|
|
/* yy_try_NUL_trans - try to make a transition on the NUL character
|
/* yy_try_NUL_trans - try to make a transition on the NUL character
|
*
|
*
|
* synopsis
|
* synopsis
|
* next_state = yy_try_NUL_trans( current_state );
|
* next_state = yy_try_NUL_trans( current_state );
|
*/
|
*/
|
|
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state )
|
static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state )
|
#else
|
#else
|
static yy_state_type yy_try_NUL_trans( yy_current_state )
|
static yy_state_type yy_try_NUL_trans( yy_current_state )
|
yy_state_type yy_current_state;
|
yy_state_type yy_current_state;
|
#endif
|
#endif
|
{
|
{
|
register int yy_is_jam;
|
register int yy_is_jam;
|
register char *yy_cp = yy_c_buf_p;
|
register char *yy_cp = yy_c_buf_p;
|
|
|
register YY_CHAR yy_c = 1;
|
register YY_CHAR yy_c = 1;
|
if ( yy_accept[yy_current_state] )
|
if ( yy_accept[yy_current_state] )
|
{
|
{
|
yy_last_accepting_state = yy_current_state;
|
yy_last_accepting_state = yy_current_state;
|
yy_last_accepting_cpos = yy_cp;
|
yy_last_accepting_cpos = yy_cp;
|
}
|
}
|
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
|
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
|
{
|
{
|
yy_current_state = (int) yy_def[yy_current_state];
|
yy_current_state = (int) yy_def[yy_current_state];
|
if ( yy_current_state >= 196 )
|
if ( yy_current_state >= 196 )
|
yy_c = yy_meta[(unsigned int) yy_c];
|
yy_c = yy_meta[(unsigned int) yy_c];
|
}
|
}
|
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
|
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
|
yy_is_jam = (yy_current_state == 195);
|
yy_is_jam = (yy_current_state == 195);
|
|
|
return yy_is_jam ? 0 : yy_current_state;
|
return yy_is_jam ? 0 : yy_current_state;
|
}
|
}
|
|
|
|
|
#ifndef YY_NO_UNPUT
|
#ifndef YY_NO_UNPUT
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
static void yyunput( int c, register char *yy_bp )
|
static void yyunput( int c, register char *yy_bp )
|
#else
|
#else
|
static void yyunput( c, yy_bp )
|
static void yyunput( c, yy_bp )
|
int c;
|
int c;
|
register char *yy_bp;
|
register char *yy_bp;
|
#endif
|
#endif
|
{
|
{
|
register char *yy_cp = yy_c_buf_p;
|
register char *yy_cp = yy_c_buf_p;
|
|
|
/* undo effects of setting up yytext */
|
/* undo effects of setting up yytext */
|
*yy_cp = yy_hold_char;
|
*yy_cp = yy_hold_char;
|
|
|
if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
|
if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
|
{ /* need to shift things up to make room */
|
{ /* need to shift things up to make room */
|
/* +2 for EOB chars. */
|
/* +2 for EOB chars. */
|
register int number_to_move = yy_n_chars + 2;
|
register int number_to_move = yy_n_chars + 2;
|
register char *dest = &yy_current_buffer->yy_ch_buf[
|
register char *dest = &yy_current_buffer->yy_ch_buf[
|
yy_current_buffer->yy_buf_size + 2];
|
yy_current_buffer->yy_buf_size + 2];
|
register char *source =
|
register char *source =
|
&yy_current_buffer->yy_ch_buf[number_to_move];
|
&yy_current_buffer->yy_ch_buf[number_to_move];
|
|
|
while ( source > yy_current_buffer->yy_ch_buf )
|
while ( source > yy_current_buffer->yy_ch_buf )
|
*--dest = *--source;
|
*--dest = *--source;
|
|
|
yy_cp += (int) (dest - source);
|
yy_cp += (int) (dest - source);
|
yy_bp += (int) (dest - source);
|
yy_bp += (int) (dest - source);
|
yy_current_buffer->yy_n_chars =
|
yy_current_buffer->yy_n_chars =
|
yy_n_chars = yy_current_buffer->yy_buf_size;
|
yy_n_chars = yy_current_buffer->yy_buf_size;
|
|
|
if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
|
if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
|
YY_FATAL_ERROR( "flex scanner push-back overflow" );
|
YY_FATAL_ERROR( "flex scanner push-back overflow" );
|
}
|
}
|
|
|
*--yy_cp = (char) c;
|
*--yy_cp = (char) c;
|
|
|
|
|
yytext_ptr = yy_bp;
|
yytext_ptr = yy_bp;
|
yy_hold_char = *yy_cp;
|
yy_hold_char = *yy_cp;
|
yy_c_buf_p = yy_cp;
|
yy_c_buf_p = yy_cp;
|
}
|
}
|
#endif /* ifndef YY_NO_UNPUT */
|
#endif /* ifndef YY_NO_UNPUT */
|
|
|
|
|
#ifndef YY_NO_INPUT
|
#ifndef YY_NO_INPUT
|
#ifdef __cplusplus
|
#ifdef __cplusplus
|
static int yyinput()
|
static int yyinput()
|
#else
|
#else
|
static int input()
|
static int input()
|
#endif
|
#endif
|
{
|
{
|
int c;
|
int c;
|
|
|
*yy_c_buf_p = yy_hold_char;
|
*yy_c_buf_p = yy_hold_char;
|
|
|
if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
|
if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
|
{
|
{
|
/* yy_c_buf_p now points to the character we want to return.
|
/* yy_c_buf_p now points to the character we want to return.
|
* If this occurs *before* the EOB characters, then it's a
|
* If this occurs *before* the EOB characters, then it's a
|
* valid NUL; if not, then we've hit the end of the buffer.
|
* valid NUL; if not, then we've hit the end of the buffer.
|
*/
|
*/
|
if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] )
|
if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] )
|
/* This was really a NUL. */
|
/* This was really a NUL. */
|
*yy_c_buf_p = '\0';
|
*yy_c_buf_p = '\0';
|
|
|
else
|
else
|
{ /* need more input */
|
{ /* need more input */
|
int offset = yy_c_buf_p - yytext_ptr;
|
int offset = yy_c_buf_p - yytext_ptr;
|
++yy_c_buf_p;
|
++yy_c_buf_p;
|
|
|
switch ( yy_get_next_buffer() )
|
switch ( yy_get_next_buffer() )
|
{
|
{
|
case EOB_ACT_LAST_MATCH:
|
case EOB_ACT_LAST_MATCH:
|
/* This happens because yy_g_n_b()
|
/* This happens because yy_g_n_b()
|
* sees that we've accumulated a
|
* sees that we've accumulated a
|
* token and flags that we need to
|
* token and flags that we need to
|
* try matching the token before
|
* try matching the token before
|
* proceeding. But for input(),
|
* proceeding. But for input(),
|
* there's no matching to consider.
|
* there's no matching to consider.
|
* So convert the EOB_ACT_LAST_MATCH
|
* So convert the EOB_ACT_LAST_MATCH
|
* to EOB_ACT_END_OF_FILE.
|
* to EOB_ACT_END_OF_FILE.
|
*/
|
*/
|
|
|
/* Reset buffer status. */
|
/* Reset buffer status. */
|
yyrestart( yyin );
|
yyrestart( yyin );
|
|
|
/* fall through */
|
/* fall through */
|
|
|
case EOB_ACT_END_OF_FILE:
|
case EOB_ACT_END_OF_FILE:
|
{
|
{
|
if ( yywrap() )
|
if ( yywrap() )
|
return EOF;
|
return EOF;
|
|
|
if ( ! yy_did_buffer_switch_on_eof )
|
if ( ! yy_did_buffer_switch_on_eof )
|
YY_NEW_FILE;
|
YY_NEW_FILE;
|
#ifdef __cplusplus
|
#ifdef __cplusplus
|
return yyinput();
|
return yyinput();
|
#else
|
#else
|
return input();
|
return input();
|
#endif
|
#endif
|
}
|
}
|
|
|
case EOB_ACT_CONTINUE_SCAN:
|
case EOB_ACT_CONTINUE_SCAN:
|
yy_c_buf_p = yytext_ptr + offset;
|
yy_c_buf_p = yytext_ptr + offset;
|
break;
|
break;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */
|
c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */
|
*yy_c_buf_p = '\0'; /* preserve yytext */
|
*yy_c_buf_p = '\0'; /* preserve yytext */
|
yy_hold_char = *++yy_c_buf_p;
|
yy_hold_char = *++yy_c_buf_p;
|
|
|
|
|
return c;
|
return c;
|
}
|
}
|
#endif /* YY_NO_INPUT */
|
#endif /* YY_NO_INPUT */
|
|
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
void yyrestart( FILE *input_file )
|
void yyrestart( FILE *input_file )
|
#else
|
#else
|
void yyrestart( input_file )
|
void yyrestart( input_file )
|
FILE *input_file;
|
FILE *input_file;
|
#endif
|
#endif
|
{
|
{
|
if ( ! yy_current_buffer )
|
if ( ! yy_current_buffer )
|
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE );
|
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE );
|
|
|
yy_init_buffer( yy_current_buffer, input_file );
|
yy_init_buffer( yy_current_buffer, input_file );
|
yy_load_buffer_state();
|
yy_load_buffer_state();
|
}
|
}
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
|
void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
|
#else
|
#else
|
void yy_switch_to_buffer( new_buffer )
|
void yy_switch_to_buffer( new_buffer )
|
YY_BUFFER_STATE new_buffer;
|
YY_BUFFER_STATE new_buffer;
|
#endif
|
#endif
|
{
|
{
|
if ( yy_current_buffer == new_buffer )
|
if ( yy_current_buffer == new_buffer )
|
return;
|
return;
|
|
|
if ( yy_current_buffer )
|
if ( yy_current_buffer )
|
{
|
{
|
/* Flush out information for old buffer. */
|
/* Flush out information for old buffer. */
|
*yy_c_buf_p = yy_hold_char;
|
*yy_c_buf_p = yy_hold_char;
|
yy_current_buffer->yy_buf_pos = yy_c_buf_p;
|
yy_current_buffer->yy_buf_pos = yy_c_buf_p;
|
yy_current_buffer->yy_n_chars = yy_n_chars;
|
yy_current_buffer->yy_n_chars = yy_n_chars;
|
}
|
}
|
|
|
yy_current_buffer = new_buffer;
|
yy_current_buffer = new_buffer;
|
yy_load_buffer_state();
|
yy_load_buffer_state();
|
|
|
/* We don't actually know whether we did this switch during
|
/* We don't actually know whether we did this switch during
|
* EOF (yywrap()) processing, but the only time this flag
|
* EOF (yywrap()) processing, but the only time this flag
|
* is looked at is after yywrap() is called, so it's safe
|
* is looked at is after yywrap() is called, so it's safe
|
* to go ahead and always set it.
|
* to go ahead and always set it.
|
*/
|
*/
|
yy_did_buffer_switch_on_eof = 1;
|
yy_did_buffer_switch_on_eof = 1;
|
}
|
}
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
void yy_load_buffer_state( void )
|
void yy_load_buffer_state( void )
|
#else
|
#else
|
void yy_load_buffer_state()
|
void yy_load_buffer_state()
|
#endif
|
#endif
|
{
|
{
|
yy_n_chars = yy_current_buffer->yy_n_chars;
|
yy_n_chars = yy_current_buffer->yy_n_chars;
|
yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos;
|
yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos;
|
yyin = yy_current_buffer->yy_input_file;
|
yyin = yy_current_buffer->yy_input_file;
|
yy_hold_char = *yy_c_buf_p;
|
yy_hold_char = *yy_c_buf_p;
|
}
|
}
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
|
YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
|
#else
|
#else
|
YY_BUFFER_STATE yy_create_buffer( file, size )
|
YY_BUFFER_STATE yy_create_buffer( file, size )
|
FILE *file;
|
FILE *file;
|
int size;
|
int size;
|
#endif
|
#endif
|
{
|
{
|
YY_BUFFER_STATE b;
|
YY_BUFFER_STATE b;
|
|
|
b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
|
b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
|
if ( ! b )
|
if ( ! b )
|
YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
|
YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
|
|
|
b->yy_buf_size = size;
|
b->yy_buf_size = size;
|
|
|
/* yy_ch_buf has to be 2 characters longer than the size given because
|
/* yy_ch_buf has to be 2 characters longer than the size given because
|
* we need to put in 2 end-of-buffer characters.
|
* we need to put in 2 end-of-buffer characters.
|
*/
|
*/
|
b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 );
|
b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 );
|
if ( ! b->yy_ch_buf )
|
if ( ! b->yy_ch_buf )
|
YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
|
YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
|
|
|
b->yy_is_our_buffer = 1;
|
b->yy_is_our_buffer = 1;
|
|
|
yy_init_buffer( b, file );
|
yy_init_buffer( b, file );
|
|
|
return b;
|
return b;
|
}
|
}
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
void yy_delete_buffer( YY_BUFFER_STATE b )
|
void yy_delete_buffer( YY_BUFFER_STATE b )
|
#else
|
#else
|
void yy_delete_buffer( b )
|
void yy_delete_buffer( b )
|
YY_BUFFER_STATE b;
|
YY_BUFFER_STATE b;
|
#endif
|
#endif
|
{
|
{
|
if ( ! b )
|
if ( ! b )
|
return;
|
return;
|
|
|
if ( b == yy_current_buffer )
|
if ( b == yy_current_buffer )
|
yy_current_buffer = (YY_BUFFER_STATE) 0;
|
yy_current_buffer = (YY_BUFFER_STATE) 0;
|
|
|
if ( b->yy_is_our_buffer )
|
if ( b->yy_is_our_buffer )
|
yy_flex_free( (void *) b->yy_ch_buf );
|
yy_flex_free( (void *) b->yy_ch_buf );
|
|
|
yy_flex_free( (void *) b );
|
yy_flex_free( (void *) b );
|
}
|
}
|
|
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
void yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
|
void yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
|
#else
|
#else
|
void yy_init_buffer( b, file )
|
void yy_init_buffer( b, file )
|
YY_BUFFER_STATE b;
|
YY_BUFFER_STATE b;
|
FILE *file;
|
FILE *file;
|
#endif
|
#endif
|
|
|
|
|
{
|
{
|
yy_flush_buffer( b );
|
yy_flush_buffer( b );
|
|
|
b->yy_input_file = file;
|
b->yy_input_file = file;
|
b->yy_fill_buffer = 1;
|
b->yy_fill_buffer = 1;
|
|
|
#if YY_ALWAYS_INTERACTIVE
|
#if YY_ALWAYS_INTERACTIVE
|
b->yy_is_interactive = 1;
|
b->yy_is_interactive = 1;
|
#else
|
#else
|
#if YY_NEVER_INTERACTIVE
|
#if YY_NEVER_INTERACTIVE
|
b->yy_is_interactive = 0;
|
b->yy_is_interactive = 0;
|
#else
|
#else
|
b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
|
b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
|
#endif
|
#endif
|
#endif
|
#endif
|
}
|
}
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
void yy_flush_buffer( YY_BUFFER_STATE b )
|
void yy_flush_buffer( YY_BUFFER_STATE b )
|
#else
|
#else
|
void yy_flush_buffer( b )
|
void yy_flush_buffer( b )
|
YY_BUFFER_STATE b;
|
YY_BUFFER_STATE b;
|
#endif
|
#endif
|
|
|
{
|
{
|
if ( ! b )
|
if ( ! b )
|
return;
|
return;
|
|
|
b->yy_n_chars = 0;
|
b->yy_n_chars = 0;
|
|
|
/* We always need two end-of-buffer characters. The first causes
|
/* We always need two end-of-buffer characters. The first causes
|
* a transition to the end-of-buffer state. The second causes
|
* a transition to the end-of-buffer state. The second causes
|
* a jam in that state.
|
* a jam in that state.
|
*/
|
*/
|
b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
|
b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
|
b->yy_ch_buf[1] = 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_buf_pos = &b->yy_ch_buf[0];
|
|
|
b->yy_at_bol = 1;
|
b->yy_at_bol = 1;
|
b->yy_buffer_status = YY_BUFFER_NEW;
|
b->yy_buffer_status = YY_BUFFER_NEW;
|
|
|
if ( b == yy_current_buffer )
|
if ( b == yy_current_buffer )
|
yy_load_buffer_state();
|
yy_load_buffer_state();
|
}
|
}
|
|
|
|
|
#ifndef YY_NO_SCAN_BUFFER
|
#ifndef YY_NO_SCAN_BUFFER
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size )
|
YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size )
|
#else
|
#else
|
YY_BUFFER_STATE yy_scan_buffer( base, size )
|
YY_BUFFER_STATE yy_scan_buffer( base, size )
|
char *base;
|
char *base;
|
yy_size_t size;
|
yy_size_t size;
|
#endif
|
#endif
|
{
|
{
|
YY_BUFFER_STATE b;
|
YY_BUFFER_STATE b;
|
|
|
if ( size < 2 ||
|
if ( size < 2 ||
|
base[size-2] != YY_END_OF_BUFFER_CHAR ||
|
base[size-2] != YY_END_OF_BUFFER_CHAR ||
|
base[size-1] != YY_END_OF_BUFFER_CHAR )
|
base[size-1] != YY_END_OF_BUFFER_CHAR )
|
/* They forgot to leave room for the EOB's. */
|
/* They forgot to leave room for the EOB's. */
|
return 0;
|
return 0;
|
|
|
b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
|
b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
|
if ( ! b )
|
if ( ! b )
|
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
|
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
|
|
|
b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
|
b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
|
b->yy_buf_pos = b->yy_ch_buf = base;
|
b->yy_buf_pos = b->yy_ch_buf = base;
|
b->yy_is_our_buffer = 0;
|
b->yy_is_our_buffer = 0;
|
b->yy_input_file = 0;
|
b->yy_input_file = 0;
|
b->yy_n_chars = b->yy_buf_size;
|
b->yy_n_chars = b->yy_buf_size;
|
b->yy_is_interactive = 0;
|
b->yy_is_interactive = 0;
|
b->yy_at_bol = 1;
|
b->yy_at_bol = 1;
|
b->yy_fill_buffer = 0;
|
b->yy_fill_buffer = 0;
|
b->yy_buffer_status = YY_BUFFER_NEW;
|
b->yy_buffer_status = YY_BUFFER_NEW;
|
|
|
yy_switch_to_buffer( b );
|
yy_switch_to_buffer( b );
|
|
|
return b;
|
return b;
|
}
|
}
|
#endif
|
#endif
|
|
|
|
|
#ifndef YY_NO_SCAN_STRING
|
#ifndef YY_NO_SCAN_STRING
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str )
|
YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str )
|
#else
|
#else
|
YY_BUFFER_STATE yy_scan_string( yy_str )
|
YY_BUFFER_STATE yy_scan_string( yy_str )
|
yyconst char *yy_str;
|
yyconst char *yy_str;
|
#endif
|
#endif
|
{
|
{
|
int len;
|
int len;
|
for ( len = 0; yy_str[len]; ++len )
|
for ( len = 0; yy_str[len]; ++len )
|
;
|
;
|
|
|
return yy_scan_bytes( yy_str, len );
|
return yy_scan_bytes( yy_str, len );
|
}
|
}
|
#endif
|
#endif
|
|
|
|
|
#ifndef YY_NO_SCAN_BYTES
|
#ifndef YY_NO_SCAN_BYTES
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len )
|
YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len )
|
#else
|
#else
|
YY_BUFFER_STATE yy_scan_bytes( bytes, len )
|
YY_BUFFER_STATE yy_scan_bytes( bytes, len )
|
yyconst char *bytes;
|
yyconst char *bytes;
|
int len;
|
int len;
|
#endif
|
#endif
|
{
|
{
|
YY_BUFFER_STATE b;
|
YY_BUFFER_STATE b;
|
char *buf;
|
char *buf;
|
yy_size_t n;
|
yy_size_t n;
|
int i;
|
int i;
|
|
|
/* Get memory for full buffer, including space for trailing EOB's. */
|
/* Get memory for full buffer, including space for trailing EOB's. */
|
n = len + 2;
|
n = len + 2;
|
buf = (char *) yy_flex_alloc( n );
|
buf = (char *) yy_flex_alloc( n );
|
if ( ! buf )
|
if ( ! buf )
|
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
|
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
|
|
|
for ( i = 0; i < len; ++i )
|
for ( i = 0; i < len; ++i )
|
buf[i] = bytes[i];
|
buf[i] = bytes[i];
|
|
|
buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR;
|
buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR;
|
|
|
b = yy_scan_buffer( buf, n );
|
b = yy_scan_buffer( buf, n );
|
if ( ! b )
|
if ( ! b )
|
YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
|
YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
|
|
|
/* It's okay to grow etc. this buffer, and we should throw it
|
/* It's okay to grow etc. this buffer, and we should throw it
|
* away when we're done.
|
* away when we're done.
|
*/
|
*/
|
b->yy_is_our_buffer = 1;
|
b->yy_is_our_buffer = 1;
|
|
|
return b;
|
return b;
|
}
|
}
|
#endif
|
#endif
|
|
|
|
|
#ifndef YY_NO_PUSH_STATE
|
#ifndef YY_NO_PUSH_STATE
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
static void yy_push_state( int new_state )
|
static void yy_push_state( int new_state )
|
#else
|
#else
|
static void yy_push_state( new_state )
|
static void yy_push_state( new_state )
|
int new_state;
|
int new_state;
|
#endif
|
#endif
|
{
|
{
|
if ( yy_start_stack_ptr >= yy_start_stack_depth )
|
if ( yy_start_stack_ptr >= yy_start_stack_depth )
|
{
|
{
|
yy_size_t new_size;
|
yy_size_t new_size;
|
|
|
yy_start_stack_depth += YY_START_STACK_INCR;
|
yy_start_stack_depth += YY_START_STACK_INCR;
|
new_size = yy_start_stack_depth * sizeof( int );
|
new_size = yy_start_stack_depth * sizeof( int );
|
|
|
if ( ! yy_start_stack )
|
if ( ! yy_start_stack )
|
yy_start_stack = (int *) yy_flex_alloc( new_size );
|
yy_start_stack = (int *) yy_flex_alloc( new_size );
|
|
|
else
|
else
|
yy_start_stack = (int *) yyxrealloc(
|
yy_start_stack = (int *) yyxrealloc(
|
(void *) yy_start_stack, new_size );
|
(void *) yy_start_stack, new_size );
|
|
|
if ( ! yy_start_stack )
|
if ( ! yy_start_stack )
|
YY_FATAL_ERROR(
|
YY_FATAL_ERROR(
|
"out of memory expanding start-condition stack" );
|
"out of memory expanding start-condition stack" );
|
}
|
}
|
|
|
yy_start_stack[yy_start_stack_ptr++] = YY_START;
|
yy_start_stack[yy_start_stack_ptr++] = YY_START;
|
|
|
BEGIN(new_state);
|
BEGIN(new_state);
|
}
|
}
|
#endif
|
#endif
|
|
|
|
|
#ifndef YY_NO_POP_STATE
|
#ifndef YY_NO_POP_STATE
|
static void yy_pop_state()
|
static void yy_pop_state()
|
{
|
{
|
if ( --yy_start_stack_ptr < 0 )
|
if ( --yy_start_stack_ptr < 0 )
|
YY_FATAL_ERROR( "start-condition stack underflow" );
|
YY_FATAL_ERROR( "start-condition stack underflow" );
|
|
|
BEGIN(yy_start_stack[yy_start_stack_ptr]);
|
BEGIN(yy_start_stack[yy_start_stack_ptr]);
|
}
|
}
|
#endif
|
#endif
|
|
|
|
|
#ifndef YY_NO_TOP_STATE
|
#ifndef YY_NO_TOP_STATE
|
static int yy_top_state()
|
static int yy_top_state()
|
{
|
{
|
return yy_start_stack[yy_start_stack_ptr - 1];
|
return yy_start_stack[yy_start_stack_ptr - 1];
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifndef YY_EXIT_FAILURE
|
#ifndef YY_EXIT_FAILURE
|
#define YY_EXIT_FAILURE 2
|
#define YY_EXIT_FAILURE 2
|
#endif
|
#endif
|
|
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
static void yy_fatal_error( yyconst char msg[] )
|
static void yy_fatal_error( yyconst char msg[] )
|
#else
|
#else
|
static void yy_fatal_error( msg )
|
static void yy_fatal_error( msg )
|
char msg[];
|
char msg[];
|
#endif
|
#endif
|
{
|
{
|
(void) fprintf( stderr, "%s\n", msg );
|
(void) fprintf( stderr, "%s\n", msg );
|
exit( YY_EXIT_FAILURE );
|
exit( YY_EXIT_FAILURE );
|
}
|
}
|
|
|
|
|
|
|
/* Redefine yyless() so it works in section 3 code. */
|
/* Redefine yyless() so it works in section 3 code. */
|
|
|
#undef yyless
|
#undef yyless
|
#define yyless(n) \
|
#define yyless(n) \
|
do \
|
do \
|
{ \
|
{ \
|
/* Undo effects of setting up yytext. */ \
|
/* Undo effects of setting up yytext. */ \
|
yytext[yyleng] = yy_hold_char; \
|
yytext[yyleng] = yy_hold_char; \
|
yy_c_buf_p = yytext + n; \
|
yy_c_buf_p = yytext + n; \
|
yy_hold_char = *yy_c_buf_p; \
|
yy_hold_char = *yy_c_buf_p; \
|
*yy_c_buf_p = '\0'; \
|
*yy_c_buf_p = '\0'; \
|
yyleng = n; \
|
yyleng = n; \
|
} \
|
} \
|
while ( 0 )
|
while ( 0 )
|
|
|
|
|
/* Internal utility routines. */
|
/* Internal utility routines. */
|
|
|
#ifndef yytext_ptr
|
#ifndef yytext_ptr
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
static void yy_flex_strncpy( char *s1, yyconst char *s2, int n )
|
static void yy_flex_strncpy( char *s1, yyconst char *s2, int n )
|
#else
|
#else
|
static void yy_flex_strncpy( s1, s2, n )
|
static void yy_flex_strncpy( s1, s2, n )
|
char *s1;
|
char *s1;
|
yyconst char *s2;
|
yyconst char *s2;
|
int n;
|
int n;
|
#endif
|
#endif
|
{
|
{
|
register int i;
|
register int i;
|
for ( i = 0; i < n; ++i )
|
for ( i = 0; i < n; ++i )
|
s1[i] = s2[i];
|
s1[i] = s2[i];
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef YY_NEED_STRLEN
|
#ifdef YY_NEED_STRLEN
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
static int yy_flex_strlen( yyconst char *s )
|
static int yy_flex_strlen( yyconst char *s )
|
#else
|
#else
|
static int yy_flex_strlen( s )
|
static int yy_flex_strlen( s )
|
yyconst char *s;
|
yyconst char *s;
|
#endif
|
#endif
|
{
|
{
|
register int n;
|
register int n;
|
for ( n = 0; s[n]; ++n )
|
for ( n = 0; s[n]; ++n )
|
;
|
;
|
|
|
return n;
|
return n;
|
}
|
}
|
#endif
|
#endif
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
static void *yy_flex_alloc( yy_size_t size )
|
static void *yy_flex_alloc( yy_size_t size )
|
#else
|
#else
|
static void *yy_flex_alloc( size )
|
static void *yy_flex_alloc( size )
|
yy_size_t size;
|
yy_size_t size;
|
#endif
|
#endif
|
{
|
{
|
return (void *) xmalloc( size );
|
return (void *) xmalloc( size );
|
}
|
}
|
|
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
static void *yyxrealloc( void *ptr, yy_size_t size )
|
static void *yyxrealloc( void *ptr, yy_size_t size )
|
#else
|
#else
|
static void *yyxrealloc( ptr, size )
|
static void *yyxrealloc( ptr, size )
|
void *ptr;
|
void *ptr;
|
yy_size_t size;
|
yy_size_t size;
|
#endif
|
#endif
|
{
|
{
|
/* The cast to (char *) in the following accommodates both
|
/* The cast to (char *) in the following accommodates both
|
* implementations that use char* generic pointers, and those
|
* implementations that use char* generic pointers, and those
|
* that use void* generic pointers. It works with the latter
|
* that use void* generic pointers. It works with the latter
|
* because both ANSI C and C++ allow castless assignment from
|
* because both ANSI C and C++ allow castless assignment from
|
* any pointer type to void*, and deal with argument conversions
|
* any pointer type to void*, and deal with argument conversions
|
* as though doing an assignment.
|
* as though doing an assignment.
|
*/
|
*/
|
return (void *) xrealloc( (char *) ptr, size );
|
return (void *) xrealloc( (char *) ptr, size );
|
}
|
}
|
|
|
#ifdef YY_USE_PROTOS
|
#ifdef YY_USE_PROTOS
|
static void yy_flex_free( void *ptr )
|
static void yy_flex_free( void *ptr )
|
#else
|
#else
|
static void yy_flex_free( ptr )
|
static void yy_flex_free( ptr )
|
void *ptr;
|
void *ptr;
|
#endif
|
#endif
|
{
|
{
|
xfree( ptr );
|
xfree( ptr );
|
}
|
}
|
|
|
#if YY_MAIN
|
#if YY_MAIN
|
int main()
|
int main()
|
{
|
{
|
yylex();
|
yylex();
|
return 0;
|
return 0;
|
}
|
}
|
#endif
|
#endif
|
#line 289 "ada-lex.l"
|
#line 289 "ada-lex.l"
|
|
|
|
|
#include <ctype.h>
|
#include <ctype.h>
|
#include "gdb_string.h"
|
#include "gdb_string.h"
|
|
|
/* Initialize the lexer for processing new expression. */
|
/* Initialize the lexer for processing new expression. */
|
|
|
void
|
void
|
lexer_init (FILE *inp)
|
lexer_init (FILE *inp)
|
{
|
{
|
BEGIN INITIAL;
|
BEGIN INITIAL;
|
yyrestart (inp);
|
yyrestart (inp);
|
}
|
}
|
|
|
|
|
/* Copy S2 to S1, removing all underscores, and downcasing all letters. */
|
/* Copy S2 to S1, removing all underscores, and downcasing all letters. */
|
|
|
static void
|
static void
|
canonicalizeNumeral (char *s1, const char *s2)
|
canonicalizeNumeral (char *s1, const char *s2)
|
{
|
{
|
for (; *s2 != '\000'; s2 += 1)
|
for (; *s2 != '\000'; s2 += 1)
|
{
|
{
|
if (*s2 != '_')
|
if (*s2 != '_')
|
{
|
{
|
*s1 = tolower(*s2);
|
*s1 = tolower(*s2);
|
s1 += 1;
|
s1 += 1;
|
}
|
}
|
}
|
}
|
s1[0] = '\000';
|
s1[0] = '\000';
|
}
|
}
|
|
|
/* Interprets the prefix of NUM that consists of digits of the given BASE
|
/* Interprets the prefix of NUM that consists of digits of the given BASE
|
as an integer of that BASE, with the string EXP as an exponent.
|
as an integer of that BASE, with the string EXP as an exponent.
|
Puts value in yylval, and returns INT, if the string is valid. Causes
|
Puts value in yylval, and returns INT, if the string is valid. Causes
|
an error if the number is improperly formated. BASE, if NULL, defaults
|
an error if the number is improperly formated. BASE, if NULL, defaults
|
to "10", and EXP to "1". The EXP does not contain a leading 'e' or 'E'.
|
to "10", and EXP to "1". The EXP does not contain a leading 'e' or 'E'.
|
*/
|
*/
|
|
|
static int
|
static int
|
processInt (const char *base0, const char *num0, const char *exp0)
|
processInt (const char *base0, const char *num0, const char *exp0)
|
{
|
{
|
ULONGEST result;
|
ULONGEST result;
|
long exp;
|
long exp;
|
int base;
|
int base;
|
|
|
char *trailer;
|
char *trailer;
|
|
|
if (base0 == NULL)
|
if (base0 == NULL)
|
base = 10;
|
base = 10;
|
else
|
else
|
{
|
{
|
base = strtol (base0, (char **) NULL, 10);
|
base = strtol (base0, (char **) NULL, 10);
|
if (base < 2 || base > 16)
|
if (base < 2 || base > 16)
|
error (_("Invalid base: %d."), base);
|
error (_("Invalid base: %d."), base);
|
}
|
}
|
|
|
if (exp0 == NULL)
|
if (exp0 == NULL)
|
exp = 0;
|
exp = 0;
|
else
|
else
|
exp = strtol(exp0, (char **) NULL, 10);
|
exp = strtol(exp0, (char **) NULL, 10);
|
|
|
errno = 0;
|
errno = 0;
|
result = strtoulst (num0, (const char **) &trailer, base);
|
result = strtoulst (num0, (const char **) &trailer, base);
|
if (errno == ERANGE)
|
if (errno == ERANGE)
|
error (_("Integer literal out of range"));
|
error (_("Integer literal out of range"));
|
if (isxdigit(*trailer))
|
if (isxdigit(*trailer))
|
error (_("Invalid digit `%c' in based literal"), *trailer);
|
error (_("Invalid digit `%c' in based literal"), *trailer);
|
|
|
while (exp > 0)
|
while (exp > 0)
|
{
|
{
|
if (result > (ULONG_MAX / base))
|
if (result > (ULONG_MAX / base))
|
error (_("Integer literal out of range"));
|
error (_("Integer literal out of range"));
|
result *= base;
|
result *= base;
|
exp -= 1;
|
exp -= 1;
|
}
|
}
|
|
|
if ((result >> (gdbarch_int_bit (parse_gdbarch)-1)) == 0)
|
if ((result >> (gdbarch_int_bit (parse_gdbarch)-1)) == 0)
|
yylval.typed_val.type = type_int ();
|
yylval.typed_val.type = type_int ();
|
else if ((result >> (gdbarch_long_bit (parse_gdbarch)-1)) == 0)
|
else if ((result >> (gdbarch_long_bit (parse_gdbarch)-1)) == 0)
|
yylval.typed_val.type = type_long ();
|
yylval.typed_val.type = type_long ();
|
else if (((result >> (gdbarch_long_bit (parse_gdbarch)-1)) >> 1) == 0)
|
else if (((result >> (gdbarch_long_bit (parse_gdbarch)-1)) >> 1) == 0)
|
{
|
{
|
/* We have a number representable as an unsigned integer quantity.
|
/* We have a number representable as an unsigned integer quantity.
|
For consistency with the C treatment, we will treat it as an
|
For consistency with the C treatment, we will treat it as an
|
anonymous modular (unsigned) quantity. Alas, the types are such
|
anonymous modular (unsigned) quantity. Alas, the types are such
|
that we need to store .val as a signed quantity. Sorry
|
that we need to store .val as a signed quantity. Sorry
|
for the mess, but C doesn't officially guarantee that a simple
|
for the mess, but C doesn't officially guarantee that a simple
|
assignment does the trick (no, it doesn't; read the reference manual).
|
assignment does the trick (no, it doesn't; read the reference manual).
|
*/
|
*/
|
yylval.typed_val.type
|
yylval.typed_val.type
|
= builtin_type (parse_gdbarch)->builtin_unsigned_long;
|
= builtin_type (parse_gdbarch)->builtin_unsigned_long;
|
if (result & LONGEST_SIGN)
|
if (result & LONGEST_SIGN)
|
yylval.typed_val.val =
|
yylval.typed_val.val =
|
(LONGEST) (result & ~LONGEST_SIGN)
|
(LONGEST) (result & ~LONGEST_SIGN)
|
- (LONGEST_SIGN>>1) - (LONGEST_SIGN>>1);
|
- (LONGEST_SIGN>>1) - (LONGEST_SIGN>>1);
|
else
|
else
|
yylval.typed_val.val = (LONGEST) result;
|
yylval.typed_val.val = (LONGEST) result;
|
return INT;
|
return INT;
|
}
|
}
|
else
|
else
|
yylval.typed_val.type = type_long_long ();
|
yylval.typed_val.type = type_long_long ();
|
|
|
yylval.typed_val.val = (LONGEST) result;
|
yylval.typed_val.val = (LONGEST) result;
|
return INT;
|
return INT;
|
}
|
}
|
|
|
static int
|
static int
|
processReal (const char *num0)
|
processReal (const char *num0)
|
{
|
{
|
sscanf (num0, "%" DOUBLEST_SCAN_FORMAT, &yylval.typed_val_float.dval);
|
sscanf (num0, "%" DOUBLEST_SCAN_FORMAT, &yylval.typed_val_float.dval);
|
|
|
yylval.typed_val_float.type = type_float ();
|
yylval.typed_val_float.type = type_float ();
|
if (sizeof(DOUBLEST) >= gdbarch_double_bit (parse_gdbarch)
|
if (sizeof(DOUBLEST) >= gdbarch_double_bit (parse_gdbarch)
|
/ TARGET_CHAR_BIT)
|
/ TARGET_CHAR_BIT)
|
yylval.typed_val_float.type = type_double ();
|
yylval.typed_val_float.type = type_double ();
|
if (sizeof(DOUBLEST) >= gdbarch_long_double_bit (parse_gdbarch)
|
if (sizeof(DOUBLEST) >= gdbarch_long_double_bit (parse_gdbarch)
|
/ TARGET_CHAR_BIT)
|
/ TARGET_CHAR_BIT)
|
yylval.typed_val_float.type = type_long_double ();
|
yylval.typed_val_float.type = type_long_double ();
|
|
|
return FLOAT;
|
return FLOAT;
|
}
|
}
|
|
|
|
|
/* Store a canonicalized version of NAME0[0..LEN-1] in yylval.ssym. The
|
/* Store a canonicalized version of NAME0[0..LEN-1] in yylval.ssym. The
|
resulting string is valid until the next call to ada_parse. It differs
|
resulting string is valid until the next call to ada_parse. It differs
|
from NAME0 in that:
|
from NAME0 in that:
|
+ Characters between '...' or <...> are transfered verbatim to
|
+ Characters between '...' or <...> are transfered verbatim to
|
yylval.ssym.
|
yylval.ssym.
|
+ <, >, and trailing "'" characters in quoted sequences are removed
|
+ <, >, and trailing "'" characters in quoted sequences are removed
|
(a leading quote is preserved to indicate that the name is not to be
|
(a leading quote is preserved to indicate that the name is not to be
|
GNAT-encoded).
|
GNAT-encoded).
|
+ Unquoted whitespace is removed.
|
+ Unquoted whitespace is removed.
|
+ Unquoted alphabetic characters are mapped to lower case.
|
+ Unquoted alphabetic characters are mapped to lower case.
|
Result is returned as a struct stoken, but for convenience, the string
|
Result is returned as a struct stoken, but for convenience, the string
|
is also null-terminated. Result string valid until the next call of
|
is also null-terminated. Result string valid until the next call of
|
ada_parse.
|
ada_parse.
|
*/
|
*/
|
static struct stoken
|
static struct stoken
|
processId (const char *name0, int len)
|
processId (const char *name0, int len)
|
{
|
{
|
char *name = obstack_alloc (&temp_parse_space, len + 11);
|
char *name = obstack_alloc (&temp_parse_space, len + 11);
|
int i0, i;
|
int i0, i;
|
struct stoken result;
|
struct stoken result;
|
|
|
while (len > 0 && isspace (name0[len-1]))
|
while (len > 0 && isspace (name0[len-1]))
|
len -= 1;
|
len -= 1;
|
i = i0 = 0;
|
i = i0 = 0;
|
while (i0 < len)
|
while (i0 < len)
|
{
|
{
|
if (isalnum (name0[i0]))
|
if (isalnum (name0[i0]))
|
{
|
{
|
name[i] = tolower (name0[i0]);
|
name[i] = tolower (name0[i0]);
|
i += 1; i0 += 1;
|
i += 1; i0 += 1;
|
}
|
}
|
else switch (name0[i0])
|
else switch (name0[i0])
|
{
|
{
|
default:
|
default:
|
name[i] = name0[i0];
|
name[i] = name0[i0];
|
i += 1; i0 += 1;
|
i += 1; i0 += 1;
|
break;
|
break;
|
case ' ': case '\t':
|
case ' ': case '\t':
|
i0 += 1;
|
i0 += 1;
|
break;
|
break;
|
case '\'':
|
case '\'':
|
do
|
do
|
{
|
{
|
name[i] = name0[i0];
|
name[i] = name0[i0];
|
i += 1; i0 += 1;
|
i += 1; i0 += 1;
|
}
|
}
|
while (i0 < len && name0[i0] != '\'');
|
while (i0 < len && name0[i0] != '\'');
|
i0 += 1;
|
i0 += 1;
|
break;
|
break;
|
case '<':
|
case '<':
|
i0 += 1;
|
i0 += 1;
|
while (i0 < len && name0[i0] != '>')
|
while (i0 < len && name0[i0] != '>')
|
{
|
{
|
name[i] = name0[i0];
|
name[i] = name0[i0];
|
i += 1; i0 += 1;
|
i += 1; i0 += 1;
|
}
|
}
|
i0 += 1;
|
i0 += 1;
|
break;
|
break;
|
}
|
}
|
}
|
}
|
name[i] = '\000';
|
name[i] = '\000';
|
|
|
result.ptr = name;
|
result.ptr = name;
|
result.length = i;
|
result.length = i;
|
return result;
|
return result;
|
}
|
}
|
|
|
/* Return TEXT[0..LEN-1], a string literal without surrounding quotes,
|
/* Return TEXT[0..LEN-1], a string literal without surrounding quotes,
|
with special hex character notations replaced with characters.
|
with special hex character notations replaced with characters.
|
Result valid until the next call to ada_parse. */
|
Result valid until the next call to ada_parse. */
|
|
|
static struct stoken
|
static struct stoken
|
processString (const char *text, int len)
|
processString (const char *text, int len)
|
{
|
{
|
const char *p;
|
const char *p;
|
char *q;
|
char *q;
|
const char *lim = text + len;
|
const char *lim = text + len;
|
struct stoken result;
|
struct stoken result;
|
|
|
q = result.ptr = obstack_alloc (&temp_parse_space, len);
|
q = result.ptr = obstack_alloc (&temp_parse_space, len);
|
p = text;
|
p = text;
|
while (p < lim)
|
while (p < lim)
|
{
|
{
|
if (p[0] == '[' && p[1] == '"' && p+2 < lim)
|
if (p[0] == '[' && p[1] == '"' && p+2 < lim)
|
{
|
{
|
if (p[2] == '"') /* "...["""]... */
|
if (p[2] == '"') /* "...["""]... */
|
{
|
{
|
*q = '"';
|
*q = '"';
|
p += 4;
|
p += 4;
|
}
|
}
|
else
|
else
|
{
|
{
|
int chr;
|
int chr;
|
sscanf (p+2, "%2x", &chr);
|
sscanf (p+2, "%2x", &chr);
|
*q = (char) chr;
|
*q = (char) chr;
|
p += 5;
|
p += 5;
|
}
|
}
|
}
|
}
|
else
|
else
|
*q = *p;
|
*q = *p;
|
q += 1;
|
q += 1;
|
p += 1;
|
p += 1;
|
}
|
}
|
result.length = q - result.ptr;
|
result.length = q - result.ptr;
|
return result;
|
return result;
|
}
|
}
|
|
|
/* Returns the position within STR of the '.' in a
|
/* Returns the position within STR of the '.' in a
|
'.{WHITE}*all' component of a dotted name, or -1 if there is none.
|
'.{WHITE}*all' component of a dotted name, or -1 if there is none.
|
Note: we actually don't need this routine, since 'all' can never be an
|
Note: we actually don't need this routine, since 'all' can never be an
|
Ada identifier. Thus, looking up foo.all or foo.all.x as a name
|
Ada identifier. Thus, looking up foo.all or foo.all.x as a name
|
must fail, and will eventually be interpreted as (foo).all or
|
must fail, and will eventually be interpreted as (foo).all or
|
(foo).all.x. However, this does avoid an extraneous lookup. */
|
(foo).all.x. However, this does avoid an extraneous lookup. */
|
|
|
static int
|
static int
|
find_dot_all (const char *str)
|
find_dot_all (const char *str)
|
{
|
{
|
int i;
|
int i;
|
for (i = 0; str[i] != '\000'; i += 1)
|
for (i = 0; str[i] != '\000'; i += 1)
|
{
|
{
|
if (str[i] == '.')
|
if (str[i] == '.')
|
{
|
{
|
int i0 = i;
|
int i0 = i;
|
do
|
do
|
i += 1;
|
i += 1;
|
while (isspace (str[i]));
|
while (isspace (str[i]));
|
if (strncmp (str+i, "all", 3) == 0
|
if (strncmp (str+i, "all", 3) == 0
|
&& ! isalnum (str[i+3]) && str[i+3] != '_')
|
&& ! isalnum (str[i+3]) && str[i+3] != '_')
|
return i0;
|
return i0;
|
}
|
}
|
}
|
}
|
return -1;
|
return -1;
|
}
|
}
|
|
|
/* Returns non-zero iff string SUBSEQ matches a subsequence of STR, ignoring
|
/* Returns non-zero iff string SUBSEQ matches a subsequence of STR, ignoring
|
case. */
|
case. */
|
|
|
static int
|
static int
|
subseqMatch (const char *subseq, const char *str)
|
subseqMatch (const char *subseq, const char *str)
|
{
|
{
|
if (subseq[0] == '\0')
|
if (subseq[0] == '\0')
|
return 1;
|
return 1;
|
else if (str[0] == '\0')
|
else if (str[0] == '\0')
|
return 0;
|
return 0;
|
else if (tolower (subseq[0]) == tolower (str[0]))
|
else if (tolower (subseq[0]) == tolower (str[0]))
|
return subseqMatch (subseq+1, str+1) || subseqMatch (subseq, str+1);
|
return subseqMatch (subseq+1, str+1) || subseqMatch (subseq, str+1);
|
else
|
else
|
return subseqMatch (subseq, str+1);
|
return subseqMatch (subseq, str+1);
|
}
|
}
|
|
|
|
|
static struct { const char *name; int code; }
|
static struct { const char *name; int code; }
|
attributes[] = {
|
attributes[] = {
|
{ "address", TICK_ADDRESS },
|
{ "address", TICK_ADDRESS },
|
{ "unchecked_access", TICK_ACCESS },
|
{ "unchecked_access", TICK_ACCESS },
|
{ "unrestricted_access", TICK_ACCESS },
|
{ "unrestricted_access", TICK_ACCESS },
|
{ "access", TICK_ACCESS },
|
{ "access", TICK_ACCESS },
|
{ "first", TICK_FIRST },
|
{ "first", TICK_FIRST },
|
{ "last", TICK_LAST },
|
{ "last", TICK_LAST },
|
{ "length", TICK_LENGTH },
|
{ "length", TICK_LENGTH },
|
{ "max", TICK_MAX },
|
{ "max", TICK_MAX },
|
{ "min", TICK_MIN },
|
{ "min", TICK_MIN },
|
{ "modulus", TICK_MODULUS },
|
{ "modulus", TICK_MODULUS },
|
{ "pos", TICK_POS },
|
{ "pos", TICK_POS },
|
{ "range", TICK_RANGE },
|
{ "range", TICK_RANGE },
|
{ "size", TICK_SIZE },
|
{ "size", TICK_SIZE },
|
{ "tag", TICK_TAG },
|
{ "tag", TICK_TAG },
|
{ "val", TICK_VAL },
|
{ "val", TICK_VAL },
|
{ NULL, -1 }
|
{ NULL, -1 }
|
};
|
};
|
|
|
/* Return the syntactic code corresponding to the attribute name or
|
/* Return the syntactic code corresponding to the attribute name or
|
abbreviation STR. */
|
abbreviation STR. */
|
|
|
static int
|
static int
|
processAttribute (const char *str)
|
processAttribute (const char *str)
|
{
|
{
|
int i, k;
|
int i, k;
|
|
|
for (i = 0; attributes[i].code != -1; i += 1)
|
for (i = 0; attributes[i].code != -1; i += 1)
|
if (strcasecmp (str, attributes[i].name) == 0)
|
if (strcasecmp (str, attributes[i].name) == 0)
|
return attributes[i].code;
|
return attributes[i].code;
|
|
|
for (i = 0, k = -1; attributes[i].code != -1; i += 1)
|
for (i = 0, k = -1; attributes[i].code != -1; i += 1)
|
if (subseqMatch (str, attributes[i].name))
|
if (subseqMatch (str, attributes[i].name))
|
{
|
{
|
if (k == -1)
|
if (k == -1)
|
k = i;
|
k = i;
|
else
|
else
|
error (_("ambiguous attribute name: `%s'"), str);
|
error (_("ambiguous attribute name: `%s'"), str);
|
}
|
}
|
if (k == -1)
|
if (k == -1)
|
error (_("unrecognized attribute: `%s'"), str);
|
error (_("unrecognized attribute: `%s'"), str);
|
|
|
return attributes[k].code;
|
return attributes[k].code;
|
}
|
}
|
|
|
int
|
int
|
yywrap(void)
|
yywrap(void)
|
{
|
{
|
return 1;
|
return 1;
|
}
|
}
|
|
|
/* Dummy definition to suppress warnings about unused static definitions. */
|
/* Dummy definition to suppress warnings about unused static definitions. */
|
typedef void (*dummy_function) ();
|
typedef void (*dummy_function) ();
|
dummy_function ada_flex_use[] =
|
dummy_function ada_flex_use[] =
|
{
|
{
|
(dummy_function) yyunput
|
(dummy_function) yyunput
|
};
|
};
|
|
|
