Skip to content

GitLab

Commit 0b611765 authored by Ben Campbell's avatar Ben Campbell
Browse files

Initial commit

parents
Hide whitespace changes
Inline Side-by-side
Showing with 6072 additions and 0 deletions
src/main/resources/SMOR/src/default-scanner.C 0 → 100755
View file @ 0b611765
#line 2 "default-scanner.C"
#line 4 "default-scanner.C"
#define YY_INT_ALIGNED short int
/* A lexical scanner generated by flex */
#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 5
#define YY_FLEX_SUBMINOR_VERSION 35
#if YY_FLEX_SUBMINOR_VERSION > 0
#define FLEX_BETA
#endif
/* First, we deal with platform-specific or compiler-specific issues. */
/* begin standard C headers. */
#include <stdio.h>
#include <string.h>
#include <errno.h>
#include <stdlib.h>
/* end standard C headers. */
/* flex integer type definitions */
#ifndef FLEXINT_H
#define FLEXINT_H
/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
* if you want the limit (max/min) macros for int types.
*/
#ifndef __STDC_LIMIT_MACROS
#define __STDC_LIMIT_MACROS 1
#endif
#include <inttypes.h>
typedef int8_t flex_int8_t;
typedef uint8_t flex_uint8_t;
typedef int16_t flex_int16_t;
typedef uint16_t flex_uint16_t;
typedef int32_t flex_int32_t;
typedef uint32_t flex_uint32_t;
#else
typedef signed char flex_int8_t;
typedef short int flex_int16_t;
typedef int flex_int32_t;
typedef unsigned char flex_uint8_t;
typedef unsigned short int flex_uint16_t;
typedef unsigned int flex_uint32_t;
#endif /* ! C99 */
/* Limits of integral types. */
#ifndef INT8_MIN
#define INT8_MIN (-128)
#endif
#ifndef INT16_MIN
#define INT16_MIN (-32767-1)
#endif
#ifndef INT32_MIN
#define INT32_MIN (-2147483647-1)
#endif
#ifndef INT8_MAX
#define INT8_MAX (127)
#endif
#ifndef INT16_MAX
#define INT16_MAX (32767)
#endif
#ifndef INT32_MAX
#define INT32_MAX (2147483647)
#endif
#ifndef UINT8_MAX
#define UINT8_MAX (255U)
#endif
#ifndef UINT16_MAX
#define UINT16_MAX (65535U)
#endif
#ifndef UINT32_MAX
#define UINT32_MAX (4294967295U)
#endif
#endif /* ! FLEXINT_H */
#ifdef __cplusplus
/* The "const" storage-class-modifier is valid. */
#define YY_USE_CONST
#else /* ! __cplusplus */
/* C99 requires __STDC__ to be defined as 1. */
#if defined (__STDC__)
#define YY_USE_CONST
#endif /* defined (__STDC__) */
#endif /* ! __cplusplus */
#ifdef YY_USE_CONST
#define yyconst const
#else
#define yyconst
#endif
/* Returned upon end-of-file. */
#define YY_NULL 0
/* Promotes a possibly negative, possibly signed char to an unsigned
* integer for use as an array index. If the signed char is negative,
* we want to instead treat it as an 8-bit unsigned char, hence the
* double cast.
*/
#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
/* Enter a start condition. This macro really ought to take a parameter,
* but we do it the disgusting crufty way forced on us by the ()-less
* definition of BEGIN.
*/
#define BEGIN (yy_start) = 1 + 2 *
/* Translate the current start state into a value that can be later handed
* to BEGIN to return to the state. The YYSTATE alias is for lex
* compatibility.
*/
#define YY_START (((yy_start) - 1) / 2)
#define YYSTATE YY_START
/* Action number for EOF rule of a given start state. */
#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
/* Special action meaning "start processing a new file". */
#define YY_NEW_FILE yyrestart(yyin )
#define YY_END_OF_BUFFER_CHAR 0
/* Size of default input buffer. */
#ifndef YY_BUF_SIZE
#define YY_BUF_SIZE 16384
#endif
/* The state buf must be large enough to hold one state per character in the main buffer.
*/
#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
#ifndef YY_TYPEDEF_YY_BUFFER_STATE
#define YY_TYPEDEF_YY_BUFFER_STATE
typedef struct yy_buffer_state *YY_BUFFER_STATE;
#endif
extern int yyleng;
extern FILE *yyin, *yyout;
#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2
/* Note: We specifically omit the test for yy_rule_can_match_eol because it requires
* access to the local variable yy_act. Since yyless() is a macro, it would break
* existing scanners that call yyless() from OUTSIDE yylex.
* One obvious solution it to make yy_act a global. I tried that, and saw
* a 5% performance hit in a non-yylineno scanner, because yy_act is
* normally declared as a register variable-- so it is not worth it.
*/
#define YY_LESS_LINENO(n) \
do { \
int yyl;\
for ( yyl = n; yyl < yyleng; ++yyl )\
if ( yytext[yyl] == '\n' )\
--yylineno;\
}while(0)
/* Return all but the first "n" matched characters back to the input stream. */
#define yyless(n) \
do \
{ \
/* Undo effects of setting up yytext. */ \
int yyless_macro_arg = (n); \
YY_LESS_LINENO(yyless_macro_arg);\
*yy_cp = (yy_hold_char); \
YY_RESTORE_YY_MORE_OFFSET \
(yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
YY_DO_BEFORE_ACTION; /* set up yytext again */ \
} \
while ( 0 )
#define unput(c) yyunput( c, (yytext_ptr) )
#ifndef YY_TYPEDEF_YY_SIZE_T
#define YY_TYPEDEF_YY_SIZE_T
typedef size_t yy_size_t;
#endif
#ifndef YY_STRUCT_YY_BUFFER_STATE
#define YY_STRUCT_YY_BUFFER_STATE
struct yy_buffer_state
{
FILE *yy_input_file;
char *yy_ch_buf; /* input buffer */
char *yy_buf_pos; /* current position in input buffer */
/* Size of input buffer in bytes, not including room for EOB
* characters.
*/
yy_size_t yy_buf_size;
/* Number of characters read into yy_ch_buf, not including EOB
* characters.
*/
int yy_n_chars;
/* Whether we "own" the buffer - i.e., we know we created it,
* and can realloc() it to grow it, and should free() it to
* delete it.
*/
int yy_is_our_buffer;
/* Whether this is an "interactive" input source; if so, and
* if we're using stdio for input, then we want to use getc()
* instead of fread(), to make sure we stop fetching input after
* each newline.
*/
int yy_is_interactive;
/* Whether we're considered to be at the beginning of a line.
* If so, '^' rules will be active on the next match, otherwise
* not.
*/
int yy_at_bol;
int yy_bs_lineno; /**< The line count. */
int yy_bs_column; /**< The column count. */
/* Whether to try to fill the input buffer when we reach the
* end of it.
*/
int yy_fill_buffer;
int yy_buffer_status;
#define YY_BUFFER_NEW 0
#define YY_BUFFER_NORMAL 1
/* When an EOF's been seen but there's still some text to process
* then we mark the buffer as YY_EOF_PENDING, to indicate that we
* shouldn't try reading from the input source any more. We might
* still have a bunch of tokens to match, though, because of
* possible backing-up.
*
* When we actually see the EOF, we change the status to "new"
* (via yyrestart()), so that the user can continue scanning by
* just pointing yyin at a new input file.
*/
#define YY_BUFFER_EOF_PENDING 2
};
#endif /* !YY_STRUCT_YY_BUFFER_STATE */
/* Stack of input buffers. */
static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */
/* We provide macros for accessing buffer states in case in the
* future we want to put the buffer states in a more general
* "scanner state".
*
* Returns the top of the stack, or NULL.
*/
#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \
? (yy_buffer_stack)[(yy_buffer_stack_top)] \
: NULL)
/* Same as previous macro, but useful when we know that the buffer stack is not
* NULL or when we need an lvalue. For internal use only.
*/
#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]
/* yy_hold_char holds the character lost when yytext is formed. */
static char yy_hold_char;
static int yy_n_chars; /* number of characters read into yy_ch_buf */
int yyleng;
/* Points to current character in buffer. */
static char *yy_c_buf_p = (char *) 0;
static int yy_init = 0; /* whether we need to initialize */
static int yy_start = 0; /* start state number */
/* Flag which is used to allow yywrap()'s to do buffer switches
* instead of setting up a fresh yyin. A bit of a hack ...
*/
static int yy_did_buffer_switch_on_eof;
void yyrestart (FILE *input_file );
void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer );
YY_BUFFER_STATE yy_create_buffer (FILE *file,int size );
void yy_delete_buffer (YY_BUFFER_STATE b );
void yy_flush_buffer (YY_BUFFER_STATE b );
void yypush_buffer_state (YY_BUFFER_STATE new_buffer );
void yypop_buffer_state (void );
static void yyensure_buffer_stack (void );
static void yy_load_buffer_state (void );
static void yy_init_buffer (YY_BUFFER_STATE b,FILE *file );
#define YY_FLUSH_BUFFER yy_flush_buffer(YY_CURRENT_BUFFER )
YY_BUFFER_STATE yy_scan_buffer (char *base,yy_size_t size );
YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str );
YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,int len );
void *yyalloc (yy_size_t );
void *yyrealloc (void *,yy_size_t );
void yyfree (void * );
#define yy_new_buffer yy_create_buffer
#define yy_set_interactive(is_interactive) \
{ \
if ( ! YY_CURRENT_BUFFER ){ \
yyensure_buffer_stack (); \
YY_CURRENT_BUFFER_LVALUE = \
yy_create_buffer(yyin,YY_BUF_SIZE ); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
}
#define yy_set_bol(at_bol) \
{ \
if ( ! YY_CURRENT_BUFFER ){\
yyensure_buffer_stack (); \
YY_CURRENT_BUFFER_LVALUE = \
yy_create_buffer(yyin,YY_BUF_SIZE ); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
}
#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
/* Begin user sect3 */
#define yywrap(n) 1
#define YY_SKIP_YYWRAP
typedef unsigned char YY_CHAR;
FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
typedef int yy_state_type;
extern int yylineno;
int yylineno = 1;
extern char *yytext;
#define yytext_ptr yytext
static yy_state_type yy_get_previous_state (void );
static yy_state_type yy_try_NUL_trans (yy_state_type current_state );
static int yy_get_next_buffer (void );
static void yy_fatal_error (yyconst char msg[] );
/* Done after the current pattern has been matched and before the
* corresponding action - sets up yytext.
*/
#define YY_DO_BEFORE_ACTION \
(yytext_ptr) = yy_bp; \
yyleng = (size_t) (yy_cp - yy_bp); \
(yy_hold_char) = *yy_cp; \
*yy_cp = '\0'; \
(yy_c_buf_p) = yy_cp;
#define YY_NUM_RULES 37
#define YY_END_OF_BUFFER 38
/* This struct is not used in this scanner,
but its presence is necessary. */
struct yy_trans_info
{
flex_int32_t yy_verify;
flex_int32_t yy_nxt;
};
static yyconst flex_int16_t yy_accept[160] =
{ 0,
0, 0, 4, 4, 38, 36, 31, 33, 36, 23,
36, 36, 36, 9, 36, 36, 23, 36, 36, 23,
23, 23, 31, 36, 9, 36, 37, 4, 37, 5,
33, 0, 0, 0, 0, 0, 0, 0, 0, 0,
9, 9, 0, 0, 20, 14, 28, 0, 13, 19,
35, 35, 32, 35, 35, 34, 0, 22, 0, 21,
11, 0, 0, 0, 0, 0, 9, 7, 9, 9,
0, 4, 0, 5, 30, 0, 27, 0, 0, 0,
25, 0, 0, 9, 8, 9, 17, 12, 0, 0,
0, 18, 34, 15, 16, 0, 0, 0, 0, 9,
7, 9, 0, 6, 0, 26, 0, 24, 0, 0,
0, 0, 0, 29, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 3, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 10, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 2, 0, 1, 0
} ;
static yyconst flex_int32_t yy_ec[256] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
1, 1, 4, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 2, 5, 6, 7, 8, 9, 10, 11, 10,
10, 12, 13, 10, 14, 13, 15, 16, 16, 17,
16, 16, 16, 16, 16, 16, 16, 5, 11, 18,
19, 20, 10, 11, 21, 22, 23, 23, 24, 23,
23, 25, 23, 23, 23, 26, 23, 23, 23, 27,
23, 23, 23, 28, 23, 23, 23, 23, 23, 23,
5, 29, 5, 30, 31, 11, 32, 23, 33, 34,
35, 36, 23, 23, 37, 23, 23, 38, 23, 39,
23, 23, 23, 40, 41, 42, 43, 44, 23, 23,
23, 23, 5, 45, 5, 46, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1
} ;
static yyconst flex_int32_t yy_meta[47] =
{ 0,
1, 1, 2, 1, 3, 3, 4, 5, 3, 6,
3, 7, 8, 8, 8, 8, 8, 9, 6, 6,
8, 8, 8, 8, 8, 8, 8, 8, 6, 6,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 6, 6
} ;
static yyconst flex_int16_t yy_base[175] =
{ 0,
0, 45, 66, 112, 451, 452, 452, 452, 447, 452,
411, 60, 29, 394, 367, 31, 357, 355, 88, 47,
49, 326, 126, 64, 52, 329, 452, 352, 0, 0,
452, 47, 0, 80, 81, 158, 117, 74, 98, 170,
324, 96, 332, 116, 452, 119, 452, 148, 452, 452,
452, 181, 452, 348, 330, 127, 329, 452, 328, 452,
452, 159, 304, 150, 319, 148, 183, 452, 188, 191,
315, 339, 321, 0, 452, 305, 452, 122, 220, 181,
452, 189, 232, 198, 452, 170, 452, 452, 202, 320,
204, 452, 199, 452, 452, 272, 236, 242, 221, 245,
452, 248, 254, 452, 269, 452, 228, 452, 250, 255,
238, 253, 250, 452, 235, 228, 261, 254, 262, 243,
265, 188, 184, 269, 263, 185, 273, 167, 154, 274,
281, 112, 283, 106, 92, 289, 293, 194, 65, 59,
297, 302, 265, 452, 26, 20, 304, 307, 17, 40,
314, 327, 283, 317, 335, 452, 337, 452, 452, 356,
359, 364, 370, 379, 386, 395, 404, 407, 409, 411,
416, 422, 431, 440
} ;
static yyconst flex_int16_t yy_def[175] =
{ 0,
159, 1, 160, 160, 159, 159, 159, 159, 159, 159,
161, 162, 163, 164, 159, 165, 159, 159, 166, 159,
159, 159, 159, 162, 167, 159, 159, 159, 168, 169,
159, 161, 170, 162, 171, 162, 162, 163, 172, 163,
164, 164, 159, 165, 159, 165, 159, 165, 159, 159,
159, 159, 159, 159, 159, 159, 159, 159, 159, 159,
159, 159, 159, 173, 159, 162, 167, 159, 167, 167,
159, 159, 168, 169, 159, 170, 159, 171, 171, 162,
159, 172, 172, 164, 159, 164, 159, 159, 159, 159,
174, 159, 159, 159, 159, 159, 173, 173, 162, 167,
159, 167, 159, 159, 159, 159, 162, 159, 174, 174,
159, 162, 159, 159, 162, 159, 159, 162, 162, 159,
162, 159, 159, 162, 162, 159, 162, 159, 159, 162,
162, 159, 162, 159, 159, 162, 162, 159, 159, 159,
162, 162, 159, 159, 159, 159, 162, 162, 159, 159,
162, 162, 159, 159, 159, 159, 159, 159, 0, 159,
159, 159, 159, 159, 159, 159, 159, 159, 159, 159,
159, 159, 159, 159
} ;
static yyconst flex_int16_t yy_nxt[499] =
{ 0,
6, 7, 8, 9, 10, 11, 12, 13, 14, 10,
6, 10, 10, 10, 15, 6, 6, 16, 17, 18,
6, 6, 6, 6, 6, 6, 6, 6, 19, 20,
21, 6, 6, 6, 6, 6, 6, 6, 6, 6,
6, 6, 6, 6, 22, 6, 23, 39, 45, 46,
47, 24, 75, 25, 68, 69, 154, 40, 153, 48,
57, 150, 59, 149, 159, 26, 27, 28, 27, 27,
27, 29, 27, 27, 27, 27, 27, 58, 35, 60,
70, 81, 35, 27, 27, 27, 77, 77, 36, 52,
53, 54, 36, 146, 27, 27, 37, 84, 85, 86,
37, 55, 40, 56, 56, 81, 66, 145, 36, 79,
27, 27, 27, 28, 27, 27, 27, 29, 27, 27,
27, 27, 27, 77, 42, 140, 83, 62, 106, 27,
27, 27, 63, 159, 64, 47, 159, 139, 88, 138,
27, 27, 93, 93, 48, 36, 65, 48, 44, 44,
79, 44, 68, 98, 77, 80, 27, 27, 34, 34,
62, 34, 34, 34, 34, 63, 34, 64, 34, 34,
38, 38, 85, 38, 38, 38, 36, 38, 38, 65,
38, 38, 89, 53, 90, 68, 69, 77, 99, 91,
68, 69, 100, 101, 102, 143, 108, 135, 42, 84,
85, 86, 134, 89, 53, 90, 53, 110, 132, 36,
91, 70, 144, 107, 93, 93, 70, 83, 129, 70,
78, 78, 128, 78, 78, 78, 42, 77, 78, 117,
78, 78, 82, 82, 77, 82, 82, 82, 68, 98,
82, 77, 82, 82, 68, 98, 100, 101, 102, 36,
101, 69, 53, 110, 117, 112, 36, 53, 110, 77,
77, 122, 117, 36, 126, 115, 143, 123, 77, 77,
120, 77, 116, 70, 114, 77, 70, 121, 113, 77,
77, 36, 36, 144, 155, 156, 118, 77, 124, 77,
36, 36, 119, 36, 122, 77, 125, 36, 127, 77,
123, 36, 36, 77, 130, 136, 131, 133, 77, 36,
77, 36, 111, 77, 137, 155, 156, 36, 157, 158,
77, 36, 53, 152, 105, 36, 104, 142, 157, 158,
36, 141, 36, 77, 147, 36, 155, 156, 157, 158,
72, 103, 36, 148, 71, 151, 96, 95, 94, 92,
53, 87, 42, 72, 71, 36, 30, 30, 30, 30,
30, 30, 30, 30, 30, 32, 32, 32, 34, 34,
61, 34, 34, 38, 50, 38, 49, 38, 38, 41,
43, 41, 41, 41, 41, 41, 41, 41, 44, 44,
44, 44, 44, 44, 44, 51, 51, 51, 51, 51,
51, 51, 51, 51, 67, 67, 67, 67, 67, 67,
67, 67, 67, 73, 73, 74, 74, 76, 76, 78,
78, 78, 42, 78, 78, 82, 82, 82, 33, 82,
82, 97, 97, 97, 97, 97, 97, 97, 97, 97,
109, 109, 109, 109, 109, 109, 109, 109, 109, 31,
159, 5, 159, 159, 159, 159, 159, 159, 159, 159,
159, 159, 159, 159, 159, 159, 159, 159, 159, 159,
159, 159, 159, 159, 159, 159, 159, 159, 159, 159,
159, 159, 159, 159, 159, 159, 159, 159, 159, 159,
159, 159, 159, 159, 159, 159, 159, 159
} ;
static yyconst flex_int16_t yy_chk[499] =
{ 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, 2, 13, 16, 16,
16, 2, 32, 2, 25, 25, 150, 13, 149, 16,
20, 146, 21, 145, 32, 2, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 20, 12, 21,
25, 38, 24, 3, 3, 3, 34, 35, 12, 19,
19, 19, 24, 140, 3, 3, 12, 42, 42, 42,
24, 19, 38, 19, 19, 39, 24, 139, 34, 35,
3, 3, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 37, 42, 135, 39, 23, 78, 4,
4, 4, 23, 44, 23, 44, 46, 134, 46, 132,
4, 4, 56, 56, 44, 37, 23, 46, 48, 48,
78, 48, 64, 64, 66, 37, 4, 4, 36, 36,
62, 36, 36, 36, 36, 62, 36, 62, 36, 36,
40, 40, 86, 40, 40, 40, 66, 40, 40, 62,
40, 40, 52, 52, 52, 67, 67, 80, 66, 52,
69, 69, 70, 70, 70, 138, 82, 129, 86, 84,
84, 84, 128, 89, 89, 89, 91, 91, 126, 80,
89, 67, 138, 80, 93, 93, 69, 82, 123, 70,
79, 79, 122, 79, 79, 79, 84, 99, 79, 116,
79, 79, 83, 83, 107, 83, 83, 83, 97, 97,
83, 115, 83, 83, 98, 98, 100, 100, 100, 99,
102, 102, 109, 109, 112, 99, 107, 110, 110, 112,
118, 116, 117, 115, 120, 107, 143, 116, 119, 125,
113, 121, 111, 100, 105, 124, 102, 115, 103, 127,
130, 112, 118, 143, 153, 153, 112, 131, 118, 133,
119, 125, 112, 121, 117, 136, 119, 124, 121, 137,
117, 127, 130, 141, 124, 130, 125, 127, 142, 131,
147, 133, 96, 148, 131, 151, 151, 136, 154, 154,
151, 137, 90, 148, 76, 141, 73, 137, 152, 152,
142, 136, 147, 152, 141, 148, 155, 155, 157, 157,
72, 71, 151, 142, 65, 147, 63, 59, 57, 55,
54, 43, 41, 28, 26, 152, 160, 160, 160, 160,
160, 160, 160, 160, 160, 161, 161, 161, 162, 162,
22, 162, 162, 163, 18, 163, 17, 163, 163, 164,
15, 164, 164, 164, 164, 164, 164, 164, 165, 165,
165, 165, 165, 165, 165, 166, 166, 166, 166, 166,
166, 166, 166, 166, 167, 167, 167, 167, 167, 167,
167, 167, 167, 168, 168, 169, 169, 170, 170, 171,
171, 171, 14, 171, 171, 172, 172, 172, 11, 172,
172, 173, 173, 173, 173, 173, 173, 173, 173, 173,
174, 174, 174, 174, 174, 174, 174, 174, 174, 9,
5, 159, 159, 159, 159, 159, 159, 159, 159, 159,
159, 159, 159, 159, 159, 159, 159, 159, 159, 159,
159, 159, 159, 159, 159, 159, 159, 159, 159, 159,
159, 159, 159, 159, 159, 159, 159, 159, 159, 159,
159, 159, 159, 159, 159, 159, 159, 159
} ;
/* Table of booleans, true if rule could match eol. */
static yyconst flex_int32_t yy_rule_can_match_eol[38] =
{ 0,
1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, };
static yy_state_type yy_last_accepting_state;
static char *yy_last_accepting_cpos;
extern int yy_flex_debug;
int yy_flex_debug = 0;
/* The intent behind this definition is that it'll catch
* any uses of REJECT which flex missed.
*/
#define REJECT reject_used_but_not_detected
#define yymore() yymore_used_but_not_detected
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET
char *yytext;
#line 1 "default-scanner.ll"
/* the "incl" state is used to pick up the name of an include file */
#line 7 "default-scanner.ll"
/*******************************************************************/
/* */
/* FILE scanner.ll */
/* MODULE scanner */
/* PROGRAM SFST */
/* AUTHOR Helmut Schmid, IMS, University of Stuttgart */
/* */
/*******************************************************************/
#include <string.h>
#include "interface.h"
#include "fst-compiler.h"
#include "scanner.h"
using namespace SFST;
#define MAX_INCLUDE_DEPTH 10
int Include_Stack_Ptr = 0;
YY_BUFFER_STATE Include_Stack[MAX_INCLUDE_DEPTH];
char *Name_Stack[MAX_INCLUDE_DEPTH];
int Lineno_Stack[MAX_INCLUDE_DEPTH];
bool Verbose=true;
char *FileName=NULL;
bool UTF8=false;
static char *unquote(char *string, bool del_quote=true) {
char *s=string, *result=string;
if (del_quote)
string++;
while (*string) {
if (*string == '\\')
string++;
*(s++) = *(string++);
}
if (del_quote)
s--;
*s = '\0';
return fst_strdup(result);
}
static void print_lineno() {
if (!Verbose)
return;
fputc('\r',stderr);
for( int i=0; i<Include_Stack_Ptr; i++ )
fputs(" ", stderr);
fprintf(stderr,"%s: %d", FileName, yylineno);
}
extern void yyerror( const char *text );
#line 697 "default-scanner.C"
#define INITIAL 0
#define incl 1
#ifndef YY_NO_UNISTD_H
/* Special case for "unistd.h", since it is non-ANSI. We include it way
* down here because we want the user's section 1 to have been scanned first.
* The user has a chance to override it with an option.
*/
#include <unistd.h>
#endif
#ifndef YY_EXTRA_TYPE
#define YY_EXTRA_TYPE void *
#endif
static int yy_init_globals (void );
/* Accessor methods to globals.
These are made visible to non-reentrant scanners for convenience. */
int yylex_destroy (void );
int yyget_debug (void );
void yyset_debug (int debug_flag );
YY_EXTRA_TYPE yyget_extra (void );
void yyset_extra (YY_EXTRA_TYPE user_defined );
FILE *yyget_in (void );
void yyset_in (FILE * in_str );
FILE *yyget_out (void );
void yyset_out (FILE * out_str );
int yyget_leng (void );
char *yyget_text (void );
int yyget_lineno (void );
void yyset_lineno (int line_number );
/* Macros after this point can all be overridden by user definitions in
* section 1.
*/
#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int yywrap (void );
#else
extern int yywrap (void );
#endif
#endif
static void yyunput (int c,char *buf_ptr );
#ifndef yytext_ptr
static void yy_flex_strncpy (char *,yyconst char *,int );
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst char * );
#endif
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput (void );
#else
static int input (void );
#endif
#endif
/* Amount of stuff to slurp up with each read. */
#ifndef YY_READ_BUF_SIZE
#define YY_READ_BUF_SIZE 8192
#endif
/* Copy whatever the last rule matched to the standard output. */
#ifndef ECHO
/* This used to be an fputs(), but since the string might contain NUL's,
* we now use fwrite().
*/
#define ECHO do { if (fwrite( yytext, yyleng, 1, yyout )) {} } while (0)
#endif
/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
* is returned in "result".
*/
#ifndef YY_INPUT
#define YY_INPUT(buf,result,max_size) \
if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
{ \
int c = '*'; \
unsigned n; \
for ( n = 0; n < max_size && \
(c = getc( yyin )) != EOF && c != '\n'; ++n ) \
buf[n] = (char) c; \
if ( c == '\n' ) \
buf[n++] = (char) c; \
if ( c == EOF && ferror( yyin ) ) \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
result = n; \
} \
else \
{ \
errno=0; \
while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \
{ \
if( errno != EINTR) \
{ \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
break; \
} \
errno=0; \
clearerr(yyin); \
} \
}\
\
#endif
/* No semi-colon after return; correct usage is to write "yyterminate();" -
* we don't want an extra ';' after the "return" because that will cause
* some compilers to complain about unreachable statements.
*/
#ifndef yyterminate
#define yyterminate() return YY_NULL
#endif
/* Number of entries by which start-condition stack grows. */
#ifndef YY_START_STACK_INCR
#define YY_START_STACK_INCR 25
#endif
/* Report a fatal error. */
#ifndef YY_FATAL_ERROR
#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
#endif
/* end tables serialization structures and prototypes */
/* Default declaration of generated scanner - a define so the user can
* easily add parameters.
*/
#ifndef YY_DECL
#define YY_DECL_IS_OURS 1
extern int yylex (void);
#define YY_DECL int yylex (void)
#endif /* !YY_DECL */
/* Code executed at the beginning of each rule, after yytext and yyleng
* have been set up.
*/
#ifndef YY_USER_ACTION
#define YY_USER_ACTION
#endif
/* Code executed at the end of each rule. */
#ifndef YY_BREAK
#define YY_BREAK break;
#endif
#define YY_RULE_SETUP \
if ( yyleng > 0 ) \
YY_CURRENT_BUFFER_LVALUE->yy_at_bol = \
(yytext[yyleng - 1] == '\n'); \
YY_USER_ACTION
/** The main scanner function which does all the work.
*/
YY_DECL
{
register yy_state_type yy_current_state;
register char *yy_cp, *yy_bp;
register int yy_act;
#line 75 "default-scanner.ll"
#line 886 "default-scanner.C"
if ( !(yy_init) )
{
(yy_init) = 1;
#ifdef YY_USER_INIT
YY_USER_INIT;
#endif
if ( ! (yy_start) )
(yy_start) = 1; /* first start state */
if ( ! yyin )
yyin = stdin;
if ( ! yyout )
yyout = stdout;
if ( ! YY_CURRENT_BUFFER ) {
yyensure_buffer_stack ();
YY_CURRENT_BUFFER_LVALUE =
yy_create_buffer(yyin,YY_BUF_SIZE );
}
yy_load_buffer_state( );
}
while ( 1 ) /* loops until end-of-file is reached */
{
yy_cp = (yy_c_buf_p);
/* Support of yytext. */
*yy_cp = (yy_hold_char);
/* yy_bp points to the position in yy_ch_buf of the start of
* the current run.
*/
yy_bp = yy_cp;
yy_current_state = (yy_start);
yy_current_state += YY_AT_BOL();
yy_match:
do
{
register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 160 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
++yy_cp;
}
while ( yy_current_state != 159 );
yy_cp = (yy_last_accepting_cpos);
yy_current_state = (yy_last_accepting_state);
yy_find_action:
yy_act = yy_accept[yy_current_state];
YY_DO_BEFORE_ACTION;
if ( yy_act != YY_END_OF_BUFFER && yy_rule_can_match_eol[yy_act] )
{
int yyl;
for ( yyl = 0; yyl < yyleng; ++yyl )
if ( yytext[yyl] == '\n' )
yylineno++;
;
}
do_action: /* This label is used only to access EOF actions. */
switch ( yy_act )
{ /* beginning of action switch */
case 0: /* must back up */
/* undo the effects of YY_DO_BEFORE_ACTION */
*yy_cp = (yy_hold_char);
yy_cp = (yy_last_accepting_cpos);
yy_current_state = (yy_last_accepting_state);
goto yy_find_action;
case 1:
/* rule 1 can match eol */
YY_RULE_SETUP
#line 77 "default-scanner.ll"
{ Transducer::hopcroft_minimisation = false;};
YY_BREAK
case 2:
/* rule 2 can match eol */
YY_RULE_SETUP
#line 78 "default-scanner.ll"
{ Transducer::hopcroft_minimisation = true;};
YY_BREAK
case 3:
YY_RULE_SETUP
#line 80 "default-scanner.ll"
BEGIN(incl);
YY_BREAK
case 4:
YY_RULE_SETUP
#line 81 "default-scanner.ll"
/* eat the whitespace */
YY_BREAK
case 5:
YY_RULE_SETUP
#line 82 "default-scanner.ll"
{ error2("Missing quotes",yytext); }
YY_BREAK
case 6:
YY_RULE_SETUP
#line 83 "default-scanner.ll"
{ /* got the include file name */
FILE *file;
char *name=fst_strdup(yytext+1);
name[strlen(name)-1] = 0;
if ( Include_Stack_Ptr >= MAX_INCLUDE_DEPTH ) {
fprintf( stderr, "Includes nested too deeply" );
exit( 1 );
}
if (Verbose) fputc('\n', stderr);
file = fopen( name, "rt" );
if (!file)
error2("Can't open include file", name);
else {
Name_Stack[Include_Stack_Ptr] = FileName;
FileName = name;
Lineno_Stack[Include_Stack_Ptr] = yylineno;
yylineno = 1;
Include_Stack[Include_Stack_Ptr++]=YY_CURRENT_BUFFER;
yy_switch_to_buffer(yy_create_buffer(yyin,YY_BUF_SIZE));
yyin = file;
print_lineno();
BEGIN(INITIAL);
}
}
YY_BREAK
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(incl):
#line 107 "default-scanner.ll"
{
if (Verbose)
fputc('\n', stderr);
if ( --Include_Stack_Ptr < 0 )
yyterminate();
else {
free(FileName);
FileName = Name_Stack[Include_Stack_Ptr];
yylineno = Lineno_Stack[Include_Stack_Ptr];
yy_delete_buffer(YY_CURRENT_BUFFER );
yy_switch_to_buffer(Include_Stack[Include_Stack_Ptr]);
}
}
YY_BREAK
case 7:
/* rule 7 can match eol */
YY_RULE_SETUP
#line 122 "default-scanner.ll"
{ print_lineno(); /* ignore comments */ }
YY_BREAK
case 8:
/* rule 8 can match eol */
YY_RULE_SETUP
#line 124 "default-scanner.ll"
{ print_lineno(); /* ignore comments */ }
YY_BREAK
case 9:
YY_RULE_SETUP
#line 126 "default-scanner.ll"
{ /* ignore comments */ }
YY_BREAK
case 10:
YY_RULE_SETUP
#line 129 "default-scanner.ll"
{ return ALPHA; }
YY_BREAK
case 11:
YY_RULE_SETUP
#line 131 "default-scanner.ll"
{ return COMPOSE; }
YY_BREAK
case 12:
YY_RULE_SETUP
#line 132 "default-scanner.ll"
{ yylval.type = twol_both; return ARROW; }
YY_BREAK
case 13:
YY_RULE_SETUP
#line 133 "default-scanner.ll"
{ yylval.type = twol_right;return ARROW; }
YY_BREAK
case 14:
YY_RULE_SETUP
#line 134 "default-scanner.ll"
{ yylval.type = twol_left; return ARROW; }
YY_BREAK
case 15:
YY_RULE_SETUP
#line 135 "default-scanner.ll"
{ yylval.rtype = repl_up; return REPLACE; }
YY_BREAK
case 16:
YY_RULE_SETUP
#line 136 "default-scanner.ll"
{ yylval.rtype = repl_down; return REPLACE; }
YY_BREAK
case 17:
YY_RULE_SETUP
#line 137 "default-scanner.ll"
{ yylval.rtype = repl_right;return REPLACE; }
YY_BREAK
case 18:
YY_RULE_SETUP
#line 138 "default-scanner.ll"
{ yylval.rtype = repl_left; return REPLACE; }
YY_BREAK
case 19:
YY_RULE_SETUP
#line 139 "default-scanner.ll"
{ return PRINT; }
YY_BREAK
case 20:
YY_RULE_SETUP
#line 140 "default-scanner.ll"
{ return INSERT; }
YY_BREAK
case 21:
YY_RULE_SETUP
#line 141 "default-scanner.ll"
{ return POS; }
YY_BREAK
case 22:
YY_RULE_SETUP
#line 142 "default-scanner.ll"
{ return SWITCH; }
YY_BREAK
case 23:
YY_RULE_SETUP
#line 144 "default-scanner.ll"
{ return yytext[0]; }
YY_BREAK
case 24:
YY_RULE_SETUP
#line 146 "default-scanner.ll"
{ yylval.name = fst_strdup(yytext); return RVAR; }
YY_BREAK
case 25:
YY_RULE_SETUP
#line 148 "default-scanner.ll"
{ yylval.name = fst_strdup(yytext); return VAR; }
YY_BREAK
case 26:
YY_RULE_SETUP
#line 150 "default-scanner.ll"
{ yylval.name = fst_strdup(yytext); return RSVAR; }
YY_BREAK
case 27:
YY_RULE_SETUP
#line 152 "default-scanner.ll"
{ yylval.name = fst_strdup(yytext); return SVAR; }
YY_BREAK
case 28:
YY_RULE_SETUP
#line 154 "default-scanner.ll"
{ yylval.name = unquote(yytext,false); return SYMBOL; }
YY_BREAK
case 29:
YY_RULE_SETUP
#line 156 "default-scanner.ll"
{
yylval.value = fst_strdup(yytext+2);
yylval.value[strlen(yylval.value)-2] = 0;
return STRING2;
}
YY_BREAK
case 30:
YY_RULE_SETUP
#line 162 "default-scanner.ll"
{
yylval.value = fst_strdup(yytext+1);
yylval.value[strlen(yylval.value)-1] = 0;
return STRING;
}
YY_BREAK
case 31:
YY_RULE_SETUP
#line 168 "default-scanner.ll"
{ /* ignored */ }
YY_BREAK
case 32:
/* rule 32 can match eol */
YY_RULE_SETUP
#line 169 "default-scanner.ll"
{ print_lineno(); /* ignored */ }
YY_BREAK
case 33:
/* rule 33 can match eol */
YY_RULE_SETUP
#line 170 "default-scanner.ll"
{ print_lineno(); return NEWLINE; }
YY_BREAK
case 34:
YY_RULE_SETUP
#line 172 "default-scanner.ll"
{ long l=atol(yytext+1);
if (l <= 255) { yylval.uchar=(unsigned char)l; return CHARACTER; }
yyerror("invalid expression");
}
YY_BREAK
case 35:
YY_RULE_SETUP
#line 177 "default-scanner.ll"
{ yylval.uchar = yytext[1]; return CHARACTER; }
YY_BREAK
case 36:
YY_RULE_SETUP
#line 178 "default-scanner.ll"
{ yylval.uchar = yytext[0]; return CHARACTER; }
YY_BREAK
case 37:
YY_RULE_SETUP
#line 181 "default-scanner.ll"
ECHO;
YY_BREAK
#line 1218 "default-scanner.C"
case YY_END_OF_BUFFER:
{
/* Amount of text matched not including the EOB char. */
int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1;
/* Undo the effects of YY_DO_BEFORE_ACTION. */
*yy_cp = (yy_hold_char);
YY_RESTORE_YY_MORE_OFFSET
if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
{
/* We're scanning a new file or input source. It's
* possible that this happened because the user
* just pointed yyin at a new source and called
* yylex(). If so, then we have to assure
* consistency between YY_CURRENT_BUFFER and our
* globals. Here is the right place to do so, because
* this is the first action (other than possibly a
* back-up) that will match for the new input source.
*/
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;
YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
}
/* Note that here we test for yy_c_buf_p "<=" to the position
* of the first EOB in the buffer, since yy_c_buf_p will
* already have been incremented past the NUL character
* (since all states make transitions on EOB to the
* end-of-buffer state). Contrast this with the test
* in input().
*/
if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
{ /* This was really a NUL. */
yy_state_type yy_next_state;
(yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state( );
/* Okay, we're now positioned to make the NUL
* transition. We couldn't have
* yy_get_previous_state() go ahead and do it
* for us because it doesn't know how to deal
* with the possibility of jamming (and we don't
* want to build jamming into it because then it
* will run more slowly).
*/
yy_next_state = yy_try_NUL_trans( yy_current_state );
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
if ( yy_next_state )
{
/* Consume the NUL. */
yy_cp = ++(yy_c_buf_p);
yy_current_state = yy_next_state;
goto yy_match;
}
else
{
yy_cp = (yy_last_accepting_cpos);
yy_current_state = (yy_last_accepting_state);
goto yy_find_action;
}
}
else switch ( yy_get_next_buffer( ) )
{
case EOB_ACT_END_OF_FILE:
{
(yy_did_buffer_switch_on_eof) = 0;
if ( yywrap( ) )
{
/* Note: because we've taken care in
* yy_get_next_buffer() to have set up
* yytext, we can now set up
* yy_c_buf_p so that if some total
* hoser (like flex itself) wants to
* call the scanner after we return the
* YY_NULL, it'll still work - another
* YY_NULL will get returned.
*/
(yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ;
yy_act = YY_STATE_EOF(YY_START);
goto do_action;
}
else
{
if ( ! (yy_did_buffer_switch_on_eof) )
YY_NEW_FILE;
}
break;
}
case EOB_ACT_CONTINUE_SCAN:
(yy_c_buf_p) =
(yytext_ptr) + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state( );
yy_cp = (yy_c_buf_p);
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
goto yy_match;
case EOB_ACT_LAST_MATCH:
(yy_c_buf_p) =
&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)];
yy_current_state = yy_get_previous_state( );
yy_cp = (yy_c_buf_p);
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
goto yy_find_action;
}
break;
}
default:
YY_FATAL_ERROR(
"fatal flex scanner internal error--no action found" );
} /* end of action switch */
} /* end of scanning one token */
} /* end of yylex */
/* yy_get_next_buffer - try to read in a new buffer
*
* Returns a code representing an action:
* EOB_ACT_LAST_MATCH -
* EOB_ACT_CONTINUE_SCAN - continue scanning from current position
* EOB_ACT_END_OF_FILE - end of file
*/
static int yy_get_next_buffer (void)
{
register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
register char *source = (yytext_ptr);
register int number_to_move, i;
int ret_val;
if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
YY_FATAL_ERROR(
"fatal flex scanner internal error--end of buffer missed" );
if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
{ /* Don't try to fill the buffer, so this is an EOF. */
if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 )
{
/* We matched a single character, the EOB, so
* treat this as a final EOF.
*/
return EOB_ACT_END_OF_FILE;
}
else
{
/* We matched some text prior to the EOB, first
* process it.
*/
return EOB_ACT_LAST_MATCH;
}
}
/* Try to read more data. */
/* First move last chars to start of buffer. */
number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr)) - 1;
for ( i = 0; i < number_to_move; ++i )
*(dest++) = *(source++);
if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
/* don't do the read, it's not guaranteed to return an EOF,
* just force an EOF
*/
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0;
else
{
int num_to_read =
YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
while ( num_to_read <= 0 )
{ /* Not enough room in the buffer - grow it. */
/* just a shorter name for the current buffer */
YY_BUFFER_STATE b = YY_CURRENT_BUFFER;
int yy_c_buf_p_offset =
(int) ((yy_c_buf_p) - b->yy_ch_buf);
if ( b->yy_is_our_buffer )
{
int new_size = b->yy_buf_size * 2;
if ( new_size <= 0 )
b->yy_buf_size += b->yy_buf_size / 8;
else
b->yy_buf_size *= 2;
b->yy_ch_buf = (char *)
/* Include room in for 2 EOB chars. */
yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 );
}
else
/* Can't grow it, we don't own it. */
b->yy_ch_buf = 0;
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR(
"fatal error - scanner input buffer overflow" );
(yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset];
num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
number_to_move - 1;
}
if ( num_to_read > YY_READ_BUF_SIZE )
num_to_read = YY_READ_BUF_SIZE;
/* Read in more data. */
YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
(yy_n_chars), (size_t) num_to_read );
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
if ( (yy_n_chars) == 0 )
{
if ( number_to_move == YY_MORE_ADJ )
{
ret_val = EOB_ACT_END_OF_FILE;
yyrestart(yyin );
}
else
{
ret_val = EOB_ACT_LAST_MATCH;
YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
YY_BUFFER_EOF_PENDING;
}
}
else
ret_val = EOB_ACT_CONTINUE_SCAN;
if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
/* Extend the array by 50%, plus the number we really need. */
yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1);
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size );
if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
}
(yy_n_chars) += number_to_move;
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR;
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR;
(yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
return ret_val;
}
/* yy_get_previous_state - get the state just before the EOB char was reached */
static yy_state_type yy_get_previous_state (void)
{
register yy_state_type yy_current_state;
register char *yy_cp;
yy_current_state = (yy_start);
yy_current_state += YY_AT_BOL();
for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
{
register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 160 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
}
return yy_current_state;
}
/* yy_try_NUL_trans - try to make a transition on the NUL character
*
* synopsis
* next_state = yy_try_NUL_trans( current_state );
*/
static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state )
{
register int yy_is_jam;
register char *yy_cp = (yy_c_buf_p);
register YY_CHAR yy_c = 1;
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 160 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
yy_is_jam = (yy_current_state == 159);
return yy_is_jam ? 0 : yy_current_state;
}
static void yyunput (int c, register char * yy_bp )
{
register char *yy_cp;
yy_cp = (yy_c_buf_p);
/* undo effects of setting up yytext */
*yy_cp = (yy_hold_char);
if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
{ /* need to shift things up to make room */
/* +2 for EOB chars. */
register int number_to_move = (yy_n_chars) + 2;
register char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[
YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2];
register char *source =
&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move];
while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
*--dest = *--source;
yy_cp += (int) (dest - source);
yy_bp += (int) (dest - source);
YY_CURRENT_BUFFER_LVALUE->yy_n_chars =
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_buf_size;
if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
YY_FATAL_ERROR( "flex scanner push-back overflow" );
}
*--yy_cp = (char) c;
if ( c == '\n' ){
--yylineno;
}
(yytext_ptr) = yy_bp;
(yy_hold_char) = *yy_cp;
(yy_c_buf_p) = yy_cp;
}
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput (void)
#else
static int input (void)
#endif
{
int c;
*(yy_c_buf_p) = (yy_hold_char);
if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR )
{
/* yy_c_buf_p now points to the character we want to return.
* If this occurs *before* the EOB characters, then it's a
* valid NUL; if not, then we've hit the end of the buffer.
*/
if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
/* This was really a NUL. */
*(yy_c_buf_p) = '\0';
else
{ /* need more input */
int offset = (yy_c_buf_p) - (yytext_ptr);
++(yy_c_buf_p);
switch ( yy_get_next_buffer( ) )
{
case EOB_ACT_LAST_MATCH:
/* This happens because yy_g_n_b()
* sees that we've accumulated a
* token and flags that we need to
* try matching the token before
* proceeding. But for input(),
* there's no matching to consider.
* So convert the EOB_ACT_LAST_MATCH
* to EOB_ACT_END_OF_FILE.
*/
/* Reset buffer status. */
yyrestart(yyin );
/*FALLTHROUGH*/
case EOB_ACT_END_OF_FILE:
{
if ( yywrap( ) )
return EOF;
if ( ! (yy_did_buffer_switch_on_eof) )
YY_NEW_FILE;
#ifdef __cplusplus
return yyinput();
#else
return input();
#endif
}
case EOB_ACT_CONTINUE_SCAN:
(yy_c_buf_p) = (yytext_ptr) + offset;
break;
}
}
}
c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */
*(yy_c_buf_p) = '\0'; /* preserve yytext */
(yy_hold_char) = *++(yy_c_buf_p);
YY_CURRENT_BUFFER_LVALUE->yy_at_bol = (c == '\n');
if ( YY_CURRENT_BUFFER_LVALUE->yy_at_bol )
yylineno++;
;
return c;
}
#endif /* ifndef YY_NO_INPUT */
/** Immediately switch to a different input stream.
* @param input_file A readable stream.
*
* @note This function does not reset the start condition to @c INITIAL .
*/
void yyrestart (FILE * input_file )
{
if ( ! YY_CURRENT_BUFFER ){
yyensure_buffer_stack ();
YY_CURRENT_BUFFER_LVALUE =
yy_create_buffer(yyin,YY_BUF_SIZE );
}
yy_init_buffer(YY_CURRENT_BUFFER,input_file );
yy_load_buffer_state( );
}
/** Switch to a different input buffer.
* @param new_buffer The new input buffer.
*
*/
void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer )
{
/* TODO. We should be able to replace this entire function body
* with
* yypop_buffer_state();
* yypush_buffer_state(new_buffer);
*/
yyensure_buffer_stack ();
if ( YY_CURRENT_BUFFER == new_buffer )
return;
if ( YY_CURRENT_BUFFER )
{
/* Flush out information for old buffer. */
*(yy_c_buf_p) = (yy_hold_char);
YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
YY_CURRENT_BUFFER_LVALUE = new_buffer;
yy_load_buffer_state( );
/* We don't actually know whether we did this switch during
* EOF (yywrap()) processing, but the only time this flag
* is looked at is after yywrap() is called, so it's safe
* to go ahead and always set it.
*/
(yy_did_buffer_switch_on_eof) = 1;
}
static void yy_load_buffer_state (void)
{
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
(yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
(yy_hold_char) = *(yy_c_buf_p);
}
/** Allocate and initialize an input buffer state.
* @param file A readable stream.
* @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
*
* @return the allocated buffer state.
*/
YY_BUFFER_STATE yy_create_buffer (FILE * file, int size )
{
YY_BUFFER_STATE b;
b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
b->yy_buf_size = size;
/* yy_ch_buf has to be 2 characters longer than the size given because
* we need to put in 2 end-of-buffer characters.
*/
b->yy_ch_buf = (char *) yyalloc(b->yy_buf_size + 2 );
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
b->yy_is_our_buffer = 1;
yy_init_buffer(b,file );
return b;
}
/** Destroy the buffer.
* @param b a buffer created with yy_create_buffer()
*
*/
void yy_delete_buffer (YY_BUFFER_STATE b )
{
if ( ! b )
return;
if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
if ( b->yy_is_our_buffer )
yyfree((void *) b->yy_ch_buf );
yyfree((void *) b );
}
#ifndef __cplusplus
extern int isatty (int );
#endif /* __cplusplus */
/* Initializes or reinitializes a buffer.
* This function is sometimes called more than once on the same buffer,
* such as during a yyrestart() or at EOF.
*/
static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file )
{
int oerrno = errno;
yy_flush_buffer(b );
b->yy_input_file = file;
b->yy_fill_buffer = 1;
/* If b is the current buffer, then yy_init_buffer was _probably_
* called from yyrestart() or through yy_get_next_buffer.
* In that case, we don't want to reset the lineno or column.
*/
if (b != YY_CURRENT_BUFFER){
b->yy_bs_lineno = 1;
b->yy_bs_column = 0;
}
b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
errno = oerrno;
}
/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
* @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
*
*/
void yy_flush_buffer (YY_BUFFER_STATE b )
{
if ( ! b )
return;
b->yy_n_chars = 0;
/* We always need two end-of-buffer characters. The first causes
* a transition to the end-of-buffer state. The second causes
* a jam in that state.
*/
b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
b->yy_buf_pos = &b->yy_ch_buf[0];
b->yy_at_bol = 1;
b->yy_buffer_status = YY_BUFFER_NEW;
if ( b == YY_CURRENT_BUFFER )
yy_load_buffer_state( );
}
/** Pushes the new state onto the stack. The new state becomes
* the current state. This function will allocate the stack
* if necessary.
* @param new_buffer The new state.
*
*/
void yypush_buffer_state (YY_BUFFER_STATE new_buffer )
{
if (new_buffer == NULL)
return;
yyensure_buffer_stack();
/* This block is copied from yy_switch_to_buffer. */
if ( YY_CURRENT_BUFFER )
{
/* Flush out information for old buffer. */
*(yy_c_buf_p) = (yy_hold_char);
YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
/* Only push if top exists. Otherwise, replace top. */
if (YY_CURRENT_BUFFER)
(yy_buffer_stack_top)++;
YY_CURRENT_BUFFER_LVALUE = new_buffer;
/* copied from yy_switch_to_buffer. */
yy_load_buffer_state( );
(yy_did_buffer_switch_on_eof) = 1;
}
/** Removes and deletes the top of the stack, if present.
* The next element becomes the new top.
*
*/
void yypop_buffer_state (void)
{
if (!YY_CURRENT_BUFFER)
return;
yy_delete_buffer(YY_CURRENT_BUFFER );
YY_CURRENT_BUFFER_LVALUE = NULL;
if ((yy_buffer_stack_top) > 0)
--(yy_buffer_stack_top);
if (YY_CURRENT_BUFFER) {
yy_load_buffer_state( );
(yy_did_buffer_switch_on_eof) = 1;
}
}
/* Allocates the stack if it does not exist.
* Guarantees space for at least one push.
*/
static void yyensure_buffer_stack (void)
{
int num_to_alloc;
if (!(yy_buffer_stack)) {
/* First allocation is just for 2 elements, since we don't know if this
* scanner will even need a stack. We use 2 instead of 1 to avoid an
* immediate realloc on the next call.
*/
num_to_alloc = 1;
(yy_buffer_stack) = (struct yy_buffer_state**)yyalloc
(num_to_alloc * sizeof(struct yy_buffer_state*)
);
if ( ! (yy_buffer_stack) )
YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*));
(yy_buffer_stack_max) = num_to_alloc;
(yy_buffer_stack_top) = 0;
return;
}
if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){
/* Increase the buffer to prepare for a possible push. */
int grow_size = 8 /* arbitrary grow size */;
num_to_alloc = (yy_buffer_stack_max) + grow_size;
(yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc
((yy_buffer_stack),
num_to_alloc * sizeof(struct yy_buffer_state*)
);
if ( ! (yy_buffer_stack) )
YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
/* zero only the new slots.*/
memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*));
(yy_buffer_stack_max) = num_to_alloc;
}
}
/** Setup the input buffer state to scan directly from a user-specified character buffer.
* @param base the character buffer
* @param size the size in bytes of the character buffer
*
* @return the newly allocated buffer state object.
*/
YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size )
{
YY_BUFFER_STATE b;
if ( size < 2 ||
base[size-2] != YY_END_OF_BUFFER_CHAR ||
base[size-1] != YY_END_OF_BUFFER_CHAR )
/* They forgot to leave room for the EOB's. */
return 0;
b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) );
if ( ! b )
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_pos = b->yy_ch_buf = base;
b->yy_is_our_buffer = 0;
b->yy_input_file = 0;
b->yy_n_chars = b->yy_buf_size;
b->yy_is_interactive = 0;
b->yy_at_bol = 1;
b->yy_fill_buffer = 0;
b->yy_buffer_status = YY_BUFFER_NEW;
yy_switch_to_buffer(b );
return b;
}
/** Setup the input buffer state to scan a string. The next call to yylex() will
* scan from a @e copy of @a str.
* @param yystr a NUL-terminated string to scan
*
* @return the newly allocated buffer state object.
* @note If you want to scan bytes that may contain NUL values, then use
* yy_scan_bytes() instead.
*/
YY_BUFFER_STATE yy_scan_string (yyconst char * yystr )
{
return yy_scan_bytes(yystr,strlen(yystr) );
}
/** Setup the input buffer state to scan the given bytes. The next call to yylex() will
* scan from a @e copy of @a bytes.
* @param bytes the byte buffer to scan
* @param len the number of bytes in the buffer pointed to by @a bytes.
*
* @return the newly allocated buffer state object.
*/
YY_BUFFER_STATE yy_scan_bytes (yyconst char * yybytes, int _yybytes_len )
{
YY_BUFFER_STATE b;
char *buf;
yy_size_t n;
int i;
/* Get memory for full buffer, including space for trailing EOB's. */
n = _yybytes_len + 2;
buf = (char *) yyalloc(n );
if ( ! buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
for ( i = 0; i < _yybytes_len; ++i )
buf[i] = yybytes[i];
buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
b = yy_scan_buffer(buf,n );
if ( ! b )
YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
/* It's okay to grow etc. this buffer, and we should throw it
* away when we're done.
*/
b->yy_is_our_buffer = 1;
return b;
}
#ifndef YY_EXIT_FAILURE
#define YY_EXIT_FAILURE 2
#endif
static void yy_fatal_error (yyconst char* msg )
{
(void) fprintf( stderr, "%s\n", msg );
exit( YY_EXIT_FAILURE );
}
/* Redefine yyless() so it works in section 3 code. */
#undef yyless
#define yyless(n) \
do \
{ \
/* Undo effects of setting up yytext. */ \
int yyless_macro_arg = (n); \
YY_LESS_LINENO(yyless_macro_arg);\
yytext[yyleng] = (yy_hold_char); \
(yy_c_buf_p) = yytext + yyless_macro_arg; \
(yy_hold_char) = *(yy_c_buf_p); \
*(yy_c_buf_p) = '\0'; \
yyleng = yyless_macro_arg; \
} \
while ( 0 )
/* Accessor methods (get/set functions) to struct members. */
/** Get the current line number.
*
*/
int yyget_lineno (void)
{
return yylineno;
}
/** Get the input stream.
*
*/
FILE *yyget_in (void)
{
return yyin;
}
/** Get the output stream.
*
*/
FILE *yyget_out (void)
{
return yyout;
}
/** Get the length of the current token.
*
*/
int yyget_leng (void)
{
return yyleng;
}
/** Get the current token.
*
*/
char *yyget_text (void)
{
return yytext;
}
/** Set the current line number.
* @param line_number
*
*/
void yyset_lineno (int line_number )
{
yylineno = line_number;
}
/** Set the input stream. This does not discard the current
* input buffer.
* @param in_str A readable stream.
*
* @see yy_switch_to_buffer
*/
void yyset_in (FILE * in_str )
{
yyin = in_str ;
}
void yyset_out (FILE * out_str )
{
yyout = out_str ;
}
int yyget_debug (void)
{
return yy_flex_debug;
}
void yyset_debug (int bdebug )
{
yy_flex_debug = bdebug ;
}
static int yy_init_globals (void)
{
/* Initialization is the same as for the non-reentrant scanner.
* This function is called from yylex_destroy(), so don't allocate here.
*/
/* We do not touch yylineno unless the option is enabled. */
yylineno = 1;
(yy_buffer_stack) = 0;
(yy_buffer_stack_top) = 0;
(yy_buffer_stack_max) = 0;
(yy_c_buf_p) = (char *) 0;
(yy_init) = 0;
(yy_start) = 0;
/* Defined in main.c */
#ifdef YY_STDINIT
yyin = stdin;
yyout = stdout;
#else
yyin = (FILE *) 0;
yyout = (FILE *) 0;
#endif
/* For future reference: Set errno on error, since we are called by
* yylex_init()
*/
return 0;
}
/* yylex_destroy is for both reentrant and non-reentrant scanners. */
int yylex_destroy (void)
{
/* Pop the buffer stack, destroying each element. */
while(YY_CURRENT_BUFFER){
yy_delete_buffer(YY_CURRENT_BUFFER );
YY_CURRENT_BUFFER_LVALUE = NULL;
yypop_buffer_state();
}
/* Destroy the stack itself. */
yyfree((yy_buffer_stack) );
(yy_buffer_stack) = NULL;
/* Reset the globals. This is important in a non-reentrant scanner so the next time
* yylex() is called, initialization will occur. */
yy_init_globals( );
return 0;
}
/*
* Internal utility routines.
*/
#ifndef yytext_ptr
static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
{
register int i;
for ( i = 0; i < n; ++i )
s1[i] = s2[i];
}
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst char * s )
{
register int n;
for ( n = 0; s[n]; ++n )
;
return n;
}
#endif
void *yyalloc (yy_size_t size )
{
return (void *) malloc( size );
}
void *yyrealloc (void * ptr, yy_size_t size )
{
/* The cast to (char *) in the following accommodates both
* implementations that use char* generic pointers, and those
* that use void* generic pointers. It works with the latter
* because both ANSI C and C++ allow castless assignment from
* any pointer type to void*, and deal with argument conversions
* as though doing an assignment.
*/
return (void *) realloc( (char *) ptr, size );
}
void yyfree (void * ptr )
{
free( (char *) ptr ); /* see yyrealloc() for (char *) cast */
}
#define YYTABLES_NAME "yytables"
#line 181 "default-scanner.ll"
src/main/resources/SMOR/src/default-scanner.ll 0 → 100755
View file @ 0b611765
%option 8Bit batch yylineno noyywrap
/* the "incl" state is used to pick up the name of an include file */
%x incl
%{
/*******************************************************************/
/* */
/* FILE scanner.ll */
/* MODULE scanner */
/* PROGRAM SFST */
/* AUTHOR Helmut Schmid, IMS, University of Stuttgart */
/* */
/*******************************************************************/
#include <string.h>
#include "interface.h"
#include "fst-compiler.h"
#include "scanner.h"
using namespace SFST;
#define MAX_INCLUDE_DEPTH 10
int Include_Stack_Ptr = 0;
YY_BUFFER_STATE Include_Stack[MAX_INCLUDE_DEPTH];
char *Name_Stack[MAX_INCLUDE_DEPTH];
int Lineno_Stack[MAX_INCLUDE_DEPTH];
bool Verbose=true;
char *FileName=NULL;
bool UTF8=false;
static char *unquote(char *string, bool del_quote=true) {
char *s=string, *result=string;
if (del_quote)
string++;
while (*string) {
if (*string == '\\')
string++;
*(s++) = *(string++);
}
if (del_quote)
s--;
*s = '\0';
return fst_strdup(result);
}
static void print_lineno() {
if (!Verbose)
return;
fputc('\r',stderr);
for( int i=0; i<Include_Stack_Ptr; i++ )
fputs(" ", stderr);
fprintf(stderr,"%s: %d", FileName, yylineno);
}
extern void yyerror( const char *text );
%}
CC [\x80-\xbf]
C1 [A-Za-z0-9._/\-]
C2 [A-Za-z0-9._/\-&()+,=?\^|~]
C3 [A-Za-z0-9._/\-&()+,=?\^|~#<>]
C4 [A-Za-z0-9._/\-&()+,=?\^|~$<>]
C5 [\!-;\?-\[\]-\~=]
FN [A-Za-z0-9._/\-*+]
%%
^[ \t]*\#use[ \t]*revdet2[ \t]*\n { Transducer::hopcroft_minimisation = false;};
^[ \t]*\#use[ \t]*default[ \t]*\n { Transducer::hopcroft_minimisation = true;};
#include BEGIN(incl);
<incl>[ \t]* /* eat the whitespace */
<incl>{FN}+ { error2("Missing quotes",yytext); }
<incl>\"{FN}+\" { /* got the include file name */
FILE *file;
char *name=fst_strdup(yytext+1);
name[strlen(name)-1] = 0;
if ( Include_Stack_Ptr >= MAX_INCLUDE_DEPTH ) {
fprintf( stderr, "Includes nested too deeply" );
exit( 1 );
}
if (Verbose) fputc('\n', stderr);
file = fopen( name, "rt" );
if (!file)
error2("Can't open include file", name);
else {
Name_Stack[Include_Stack_Ptr] = FileName;
FileName = name;
Lineno_Stack[Include_Stack_Ptr] = yylineno;
yylineno = 1;
Include_Stack[Include_Stack_Ptr++]=YY_CURRENT_BUFFER;
yy_switch_to_buffer(yy_create_buffer(yyin, YY_BUF_SIZE));
yyin = file;
print_lineno();
BEGIN(INITIAL);
}
}
<<EOF>> {
if (Verbose)
fputc('\n', stderr);
if ( --Include_Stack_Ptr < 0 )
yyterminate();
else {
free(FileName);
FileName = Name_Stack[Include_Stack_Ptr];
yylineno = Lineno_Stack[Include_Stack_Ptr];
yy_delete_buffer( YY_CURRENT_BUFFER );
yy_switch_to_buffer(Include_Stack[Include_Stack_Ptr]);
}
}
^[ \t]*\%.*\r?\n { print_lineno(); /* ignore comments */ }
\%.*\\[ \t]*\r?\n { print_lineno(); /* ignore comments */ }
\%.* { /* ignore comments */ }
^[ \t]*ALPHABET[ \t]*= { return ALPHA; }
\|\| { return COMPOSE; }
"<=>" { yylval.type = twol_both; return ARROW; }
"=>" { yylval.type = twol_right;return ARROW; }
"<=" { yylval.type = twol_left; return ARROW; }
"^->" { yylval.rtype = repl_up; return REPLACE; }
"_->" { yylval.rtype = repl_down; return REPLACE; }
"/->" { yylval.rtype = repl_right;return REPLACE; }
"\\->" { yylval.rtype = repl_left; return REPLACE; }
">>" { return PRINT; }
"<<" { return INSERT; }
"__" { return POS; }
"^_" { return SWITCH; }
[.,{}\[\]()&!?|*+:=_\^\-] { return yytext[0]; }
\$=({C3}|(\\.))+\$ { yylval.name = fst_strdup(yytext); return RVAR; }
\$({C3}|(\\.))+\$ { yylval.name = fst_strdup(yytext); return VAR; }
#=({C4}|(\\.))+# { yylval.name = fst_strdup(yytext); return RSVAR; }
#({C4}|(\\.))+# { yylval.name = fst_strdup(yytext); return SVAR; }
\<({C5}|\\.)*\> { yylval.name = unquote(yytext,false); return SYMBOL; }
\"<{FN}+>\" {
yylval.value = fst_strdup(yytext+2);
yylval.value[strlen(yylval.value)-2] = 0;
return STRING2;
}
\"{FN}+\" {
yylval.value = fst_strdup(yytext+1);
yylval.value[strlen(yylval.value)-1] = 0;
return STRING;
}
[ \t] { /* ignored */ }
\\[ \t]*([ \t]\%.*)?\r?\n { print_lineno(); /* ignored */ }
\r?\n { print_lineno(); return NEWLINE; }
\\[0-9]+ { long l=atol(yytext+1);
if (l <= 255) { yylval.uchar=(unsigned char)l; return CHARACTER; }
yyerror("invalid expression");
}
\\. { yylval.uchar = yytext[1]; return CHARACTER; }
. { yylval.uchar = yytext[0]; return CHARACTER; }
%%
src/main/resources/SMOR/src/determinise.C 0 → 100755
View file @ 0b611765
/*******************************************************************/
/* */
/* FILE determinise.C */
/* MODULE determinise */
/* PROGRAM SFST */
/* AUTHOR Helmut Schmid, IMS, University of Stuttgart */
/* */
/*******************************************************************/
#include "fst.h"
using std::vector;
using std::pair;
using std::set;
namespace SFST {
/***************** class NodeSet *********************************/
class NodeSet {
// This class is used to store a set of nodes.
// Whenever a new node is added, all nodes accessible
// through epsilon transitions are added as well.
private:
set<Node*> ht;
public:
typedef set<Node*>::iterator iterator;
NodeSet() {};
void add( Node* );
bool insert(Node *node) {
pair<iterator, bool> result = ht.insert(node);
return result.second;
};
iterator begin() const { return ht.begin(); }
iterator end() const { return ht.end(); }
size_t size() const { return ht.size(); }
void clear() { ht.clear(); }
};
/***************** class NodeArray *******************************/
class NodeArray {
private:
size_t sizev;
bool final;
Node **node;
public:
NodeArray( NodeSet& );
~NodeArray() { delete[] node; };
size_t size() const { return sizev; }
bool is_final() const { return final; };
Node* &operator[]( size_t i ) const { return node[i]; }
};
/***************** class DTransition ***O**************************/
class DTransition {
public:
Label label;
NodeArray *nodes;
DTransition(Label l, NodeArray *na) { label = l; nodes = na; };
};
/***************** class NodeMapping ****************************/
class NodeMapping {
// This class is used to map a node set from one transducer
// to a single node in another transducer
private:
struct hashf {
size_t operator()(const NodeArray *na) const {
size_t key=na->size() ^ na->is_final();
for( size_t i=0; i<na->size(); i++)
key = (key<<1) ^ (size_t)(*na)[i];
return key;
}
};
struct equalf {
int operator()(const NodeArray *na1, const NodeArray *na2) const {
if (na1->size() != na2->size() || na1->is_final() != na2->is_final())
return 0;
for( size_t i=0; i<na1->size(); i++)
if ((*na1)[i] != (*na2)[i])
return 0;
return 1;
}
};
typedef hash_map<NodeArray*, Node*, hashf, equalf> NodeMap;
NodeMap hm;
public:
typedef NodeMap::iterator iterator;
~NodeMapping();
iterator begin() { return hm.begin(); };
iterator end() { return hm.end(); };
iterator find( NodeArray *na) { return hm.find( na ); };
Node* &operator[]( NodeArray *na ) { return hm.operator[](na); };
};
/***************** class LabelMapping ****************************/
class LabelMapping {
// This class is used to map a label to a node set
private:
struct hashf {
size_t operator()(const Label l) const {
return l.lower_char() | (l.upper_char() << 16);
}
};
struct equalf {
int operator()(const Label l1, const Label l2) const {
return l1==l2;
}
};
typedef hash_map<const Label, NodeSet, hashf, equalf> LabelMap;
LabelMap lm;
public:
LabelMapping(): lm(8) {};
typedef LabelMap::iterator iterator;
iterator begin() { return lm.begin(); };
iterator end() { return lm.end(); };
size_t size() { return lm.size(); };
iterator find( Label l) { return lm.find( l ); };
NodeSet &operator[]( const Label l ) { return lm.operator[]( l ); };
};
static void determinise_node( NodeArray&, Node*, Transducer*, NodeMapping&, long );
/*******************************************************************/
/* */
/* NodeSet::add */
/* */
/*******************************************************************/
void NodeSet::add( Node *node )
{
pair<iterator, bool> result = ht.insert(node);
if (result.second) {
// new node, add nodes reachable with epsilon transitions
for( ArcsIter p(node->arcs(),ArcsIter::eps); p; p++ ) {
Arc *arc=p;
if (!arc->label().is_epsilon())
break;
add(arc->target_node());
}
}
}
/*******************************************************************/
/* */
/* NodeArray::NodeArray */
/* */
/*******************************************************************/
NodeArray::NodeArray( NodeSet &ns )
{
sizev = 0;
NodeSet::iterator it;
final = false;
node = new Node*[ns.size()];
for( it=ns.begin(); it!=ns.end(); it++ ) {
Node *nn = *it;
if (nn->arcs()->non_epsilon_transition_exists())
node[sizev++] = nn;
final |= nn->is_final();
}
std::sort(node, node+sizev);
}
/*******************************************************************/
/* */
/* NodeMapping::~NodeMapping */
/* */
/*******************************************************************/
NodeMapping::~NodeMapping()
{
// if we delete NodeArrays without removing them from NodeMapping,
// the system will crash when NodeMapping is deleted.
for( iterator it=hm.begin(); it!=hm.end(); ) {
NodeArray *na=it->first;
iterator old = it++;
hm.erase(old);
delete na;
}
}
/*******************************************************************/
/* */
/* compute_transitions */
/* */
/*******************************************************************/
static void compute_transitions( NodeArray &na, vector<DTransition> &t )
{
LabelMapping lmap;
// for all nodes in the current set
for( size_t i=0; i<na.size(); i++) {
Node *n = na[i]; // old node
// For each non-epsilon transition, add the target node
// to the respective node set.
for( ArcsIter p(n->arcs(),ArcsIter::non_eps); p; p++ ) {
Arc *arc=p;
lmap[arc->label()].add(arc->target_node());
}
}
t.reserve(lmap.size());
for( LabelMapping::iterator it=lmap.begin(); it!=lmap.end(); it++ )
t.push_back(DTransition(it->first, new NodeArray( it->second )));
}
/*******************************************************************/
/* */
/* determinise_node */
/* */
/*******************************************************************/
static void determinise_node( NodeArray &na, Node *node, Transducer *a,
NodeMapping &map, long depth )
{
if (depth > 10000)
fprintf(stderr,"\r%ld",depth);
node->set_final(na.is_final());
vector<DTransition> t;
compute_transitions( na, t );
for( size_t i=0; i<t.size(); i++ ) {
NodeMapping::iterator it=map.find(t[i].nodes);
if (it == map.end()) {
// new node set
Node *target_node = a->new_node();
map[t[i].nodes] = target_node;
node->add_arc( t[i].label, target_node, a );
determinise_node( *t[i].nodes, target_node, a, map, depth+1 );
}
else {
delete t[i].nodes;
node->add_arc( t[i].label, it->second, a );
}
}
}
/*******************************************************************/
/* */
/* Transducer::determinise */
/* */
/*******************************************************************/
Transducer &Transducer::determinise()
{
if (deterministic)
return copy();
// initialisations
NodeMapping map;
Transducer *a = new Transducer();
a->alphabet.copy(alphabet);
// creation of the initial node set consisting of all nodes
// reachable from the start node via epsilon transitions.
NodeArray *na;
{
NodeSet ns;
ns.add(root_node());
na = new NodeArray(ns);
}
// map the node set to the new root node
map[na] = a->root_node();
// determinise the transducer recursively
determinise_node( *na, a->root_node(), a, map, 0);
a->deterministic = 1;
return *a;
}
}
src/main/resources/SMOR/src/fst-compact.C 0 → 100755
View file @ 0b611765
/*******************************************************************/
/* */
/* FILE fst-compact.C */
/* MODULE fst-compact */
/* PROGRAM SFST */
/* AUTHOR Helmut Schmid, IMS, University of Stuttgart */
/* */
/*******************************************************************/
#include "make-compact.h"
using std::cerr;
bool Switch=false;
using namespace SFST;
/*******************************************************************/
/* */
/* main */
/* */
/*******************************************************************/
int main( int argc, char **argv )
{
FILE *file, *outfile;
if (argc == 2 && (strcmp(argv[1],"-h") == 0 ||
strcmp(argv[1],"-help") == 0 ||
strcmp(argv[1],"-?") == 0))
{
fprintf(stderr,"\nUsage: fst-compact [file [file]]\n\n");
fprintf(stderr,"Options:\n\t-s create transducer for generation\n\n");
exit(1);
}
int n = 1;
if (argc > 1 && strcmp(argv[1],"-s") == 0) {
Switch = true;
n++;
}
if (argc <= n)
file = stdin;
else {
if ((file = fopen(argv[n],"rb")) == NULL) {
fprintf(stderr,"Error: Cannot open input file %s\n\n", argv[n]);
exit(1);
}
n++;
}
if (argc <= n)
outfile = stdout;
else {
if ((outfile = fopen(argv[n],"wb")) == NULL) {
fprintf(stderr,"Error: Cannot open output file %s\n\n", argv[n]);
exit(1);
}
}
try {
Transducer a(file);
if (Switch)
MakeCompactTransducer(a.switch_levels()).store(outfile);
else
MakeCompactTransducer(a).store(outfile);
}
catch (const char *p) {
cerr << p << "\n";
return 1;
}
return 0;
}
src/main/resources/SMOR/src/fst-compare.C 0 → 100755
View file @ 0b611765
/*******************************************************************/
/* */
/* FILE fst-compare.C */
/* MODULE fst-compare */
/* PROGRAM SFST */
/* AUTHOR Helmut Schmid, IMS, University of Stuttgart */
/* */
/*******************************************************************/
#include "fst.h"
using std::cout;
using std::cerr;
using namespace SFST;
/*******************************************************************/
/* */
/* main */
/* */
/*******************************************************************/
int main( int argc, char **argv )
{
FILE *file1, *file2;
if (argc < 3) {
fprintf(stderr,"\nUsage: %s file file\n\n", argv[0]);
exit(1);
}
if ((file1 = fopen(argv[1],"rb")) == NULL) {
fprintf(stderr,"\nError: Cannot open transducer file %s\n\n", argv[1]);
exit(1);
}
if ((file2 = fopen(argv[2],"rb")) == NULL) {
fprintf(stderr,"\nError: Cannot open transducer file %s\n\n", argv[2]);
exit(1);
}
try {
Transducer a1(file1);
fclose(file1);
Transducer a2(file2);
fclose(file2);
Transducer *p = &a2.copy(false, &a1.alphabet);
if (a1 == *p)
cout << "Transducers are equivalent\n";
else
cout << "Transducers are different\n";
}
catch (const char *p) {
cerr << p << "\n";
return 1;
}
return 0;
}
src/main/resources/SMOR/src/fst-compiler.C 0 → 100755
View file @ 0b611765
/* A Bison parser, made by GNU Bison 2.4.1. */
/* Skeleton implementation for Bison's Yacc-like parsers in C
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
/* C LALR(1) parser skeleton written by Richard Stallman, by
simplifying the original so-called "semantic" parser. */
/* All symbols defined below should begin with yy or YY, to avoid
infringing on user name space. This should be done even for local
variables, as they might otherwise be expanded by user macros.
There are some unavoidable exceptions within include files to
define necessary library symbols; they are noted "INFRINGES ON
USER NAME SPACE" below. */
/* Identify Bison output. */
#define YYBISON 1
/* Bison version. */
#define YYBISON_VERSION "2.4.1"
/* Skeleton name. */
#define YYSKELETON_NAME "yacc.c"
/* Pure parsers. */
#define YYPURE 0
/* Push parsers. */
#define YYPUSH 0
/* Pull parsers. */
#define YYPULL 1
/* Using locations. */
#define YYLSP_NEEDED 0
/* Copy the first part of user declarations. */
/* Line 189 of yacc.c */
#line 1 "fst-compiler.yy"
/*******************************************************************/
/* */
/* FILE fst-compiler.yy */
/* MODULE fst-compiler */
/* PROGRAM SFST */
/* AUTHOR Helmut Schmid, IMS, University of Stuttgart */
/* */
/*******************************************************************/
#include <stdio.h>
#include "make-compact.h"
#include "scanner.h"
#include "interface.h"
using std::cerr;
using namespace SFST;
extern int yylineno;
extern char *yytext;
void yyerror( const char *text );
void warn( const char *text );
void warn2( const char *text, const char *text2);
int yylex( void );
int yyparse( void );
static int Switch=0;
Interface interface;
Transducer *Result;
/* Line 189 of yacc.c */
#line 107 "fst-compiler.C"
/* Enabling traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif
/* Enabling the token table. */
#ifndef YYTOKEN_TABLE
# define YYTOKEN_TABLE 0
#endif
/* Tokens. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
/* Put the tokens into the symbol table, so that GDB and other debuggers
know about them. */
enum yytokentype {
NEWLINE = 258,
ALPHA = 259,
COMPOSE = 260,
PRINT = 261,
POS = 262,
INSERT = 263,
SWITCH = 264,
ARROW = 265,
REPLACE = 266,
SYMBOL = 267,
VAR = 268,
SVAR = 269,
RVAR = 270,
RSVAR = 271,
STRING = 272,
STRING2 = 273,
UTF8CHAR = 274,
CHARACTER = 275,
SEQ = 276
};
#endif
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
typedef union YYSTYPE
{
/* Line 214 of yacc.c */
#line 34 "fst-compiler.yy"
int number;
SFST::Twol_Type type;
SFST::Repl_Type rtype;
char *name;
char *value;
unsigned char uchar;
unsigned int longchar;
SFST::Character character;
SFST::Transducer *expression;
SFST::Range *range;
SFST::Ranges *ranges;
SFST::Contexts *contexts;
/* Line 214 of yacc.c */
#line 181 "fst-compiler.C"
} YYSTYPE;
# define YYSTYPE_IS_TRIVIAL 1
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
# define YYSTYPE_IS_DECLARED 1
#endif
/* Copy the second part of user declarations. */
/* Line 264 of yacc.c */
#line 193 "fst-compiler.C"
#ifdef short
# undef short
#endif
#ifdef YYTYPE_UINT8
typedef YYTYPE_UINT8 yytype_uint8;
#else
typedef unsigned char yytype_uint8;
#endif
#ifdef YYTYPE_INT8
typedef YYTYPE_INT8 yytype_int8;
#elif (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
typedef signed char yytype_int8;
#else
typedef short int yytype_int8;
#endif
#ifdef YYTYPE_UINT16
typedef YYTYPE_UINT16 yytype_uint16;
#else
typedef unsigned short int yytype_uint16;
#endif
#ifdef YYTYPE_INT16
typedef YYTYPE_INT16 yytype_int16;
#else
typedef short int yytype_int16;
#endif
#ifndef YYSIZE_T
# ifdef __SIZE_TYPE__
# define YYSIZE_T __SIZE_TYPE__
# elif defined size_t
# define YYSIZE_T size_t
# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# else
# define YYSIZE_T unsigned int
# endif
#endif
#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
#ifndef YY_
# if YYENABLE_NLS
# if ENABLE_NLS
# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
# define YY_(msgid) dgettext ("bison-runtime", msgid)
# endif
# endif
# ifndef YY_
# define YY_(msgid) msgid
# endif
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define YYUSE(e) ((void) (e))
#else
# define YYUSE(e) /* empty */
#endif
/* Identity function, used to suppress warnings about constant conditions. */
#ifndef lint
# define YYID(n) (n)
#else
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static int
YYID (int yyi)
#else
static int
YYID (yyi)
int yyi;
#endif
{
return yyi;
}
#endif
#if ! defined yyoverflow || YYERROR_VERBOSE
/* The parser invokes alloca or malloc; define the necessary symbols. */
# ifdef YYSTACK_USE_ALLOCA
# if YYSTACK_USE_ALLOCA
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# elif defined __BUILTIN_VA_ARG_INCR
# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
# elif defined _AIX
# define YYSTACK_ALLOC __alloca
# elif defined _MSC_VER
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
# define alloca _alloca
# else
# define YYSTACK_ALLOC alloca
# if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# ifndef _STDLIB_H
# define _STDLIB_H 1
# endif
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
/* Pacify GCC's `empty if-body' warning. */
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
# ifndef YYSTACK_ALLOC_MAXIMUM
/* The OS might guarantee only one guard page at the bottom of the stack,
and a page size can be as small as 4096 bytes. So we cannot safely
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
to allow for a few compiler-allocated temporary stack slots. */
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
# endif
# else
# define YYSTACK_ALLOC YYMALLOC
# define YYSTACK_FREE YYFREE
# ifndef YYSTACK_ALLOC_MAXIMUM
# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
# endif
# if (defined __cplusplus && ! defined _STDLIB_H \
&& ! ((defined YYMALLOC || defined malloc) \
&& (defined YYFREE || defined free)))
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# ifndef _STDLIB_H
# define _STDLIB_H 1
# endif
# endif
# ifndef YYMALLOC
# define YYMALLOC malloc
# if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# ifndef YYFREE
# define YYFREE free
# if ! defined free && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
void free (void *); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# endif
#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
#if (! defined yyoverflow \
&& (! defined __cplusplus \
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
yytype_int16 yyss_alloc;
YYSTYPE yyvs_alloc;
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define YYSTACK_BYTES(N) \
((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \
+ YYSTACK_GAP_MAXIMUM)
/* Copy COUNT objects from FROM to TO. The source and destination do
not overlap. */
# ifndef YYCOPY
# if defined __GNUC__ && 1 < __GNUC__
# define YYCOPY(To, From, Count) \
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
# else
# define YYCOPY(To, From, Count) \
do \
{ \
YYSIZE_T yyi; \
for (yyi = 0; yyi < (Count); yyi++) \
(To)[yyi] = (From)[yyi]; \
} \
while (YYID (0))
# endif
# endif
/* Relocate STACK from its old location to the new one. The
local variables YYSIZE and YYSTACKSIZE give the old and new number of
elements in the stack, and YYPTR gives the new location of the
stack. Advance YYPTR to a properly aligned location for the next
stack. */
# define YYSTACK_RELOCATE(Stack_alloc, Stack) \
do \
{ \
YYSIZE_T yynewbytes; \
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
Stack = &yyptr->Stack_alloc; \
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
yyptr += yynewbytes / sizeof (*yyptr); \
} \
while (YYID (0))
#endif
/* YYFINAL -- State number of the termination state. */
#define YYFINAL 3
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 900
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 41
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 16
/* YYNRULES -- Number of rules. */
#define YYNRULES 92
/* YYNRULES -- Number of states. */
#define YYNSTATES 153
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 276
#define YYTRANSLATE(YYX) \
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
static const yytype_uint8 yytranslate[] =
{
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 25, 2, 2, 2, 2, 23, 2,
32, 33, 28, 29, 40, 22, 39, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 36, 2,
2, 30, 2, 31, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 37, 2, 38, 26, 27, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 34, 21, 35, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 1, 2, 3, 4,
5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
15, 16, 17, 18, 19, 20, 24
};
#if YYDEBUG
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
YYRHS. */
static const yytype_uint16 yyprhs[] =
{
0, 0, 3, 7, 10, 13, 14, 18, 22, 26,
30, 34, 37, 41, 46, 51, 55, 60, 65, 71,
77, 82, 87, 91, 95, 103, 109, 115, 121, 125,
129, 131, 133, 135, 138, 141, 144, 147, 150, 153,
156, 159, 163, 167, 171, 175, 177, 179, 182, 183,
187, 192, 196, 198, 200, 202, 206, 210, 212, 214,
218, 222, 225, 228, 231, 233, 237, 239, 241, 243,
245, 247, 249, 251, 253, 255, 257, 259, 261, 263,
265, 267, 269, 271, 273, 275, 277, 279, 281, 283,
285, 287, 290
};
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
static const yytype_int8 yyrhs[] =
{
42, 0, -1, 43, 45, 56, -1, 43, 44, -1,
43, 3, -1, -1, 13, 30, 45, -1, 15, 30,
45, -1, 14, 30, 52, -1, 16, 30, 52, -1,
45, 6, 17, -1, 4, 45, -1, 45, 10, 48,
-1, 45, 26, 10, 48, -1, 45, 27, 10, 48,
-1, 45, 11, 50, -1, 45, 11, 31, 50, -1,
45, 11, 32, 33, -1, 45, 11, 31, 32, 33,
-1, 45, 47, 10, 47, 45, -1, 45, 47, 10,
47, -1, 47, 10, 47, 45, -1, 47, 10, 47,
-1, 45, 5, 45, -1, 34, 46, 35, 36, 34,
46, 35, -1, 47, 36, 34, 46, 35, -1, 34,
46, 35, 36, 47, -1, 45, 8, 55, 36, 55,
-1, 45, 8, 55, -1, 47, 36, 47, -1, 47,
-1, 13, -1, 15, -1, 45, 28, -1, 45, 29,
-1, 45, 31, -1, 45, 45, -1, 25, 45, -1,
9, 45, -1, 26, 45, -1, 27, 45, -1, 45,
23, 45, -1, 45, 22, 45, -1, 45, 21, 45,
-1, 32, 45, 33, -1, 17, -1, 18, -1, 47,
46, -1, -1, 37, 52, 38, -1, 37, 26, 52,
38, -1, 37, 16, 38, -1, 39, -1, 55, -1,
49, -1, 32, 49, 33, -1, 51, 40, 49, -1,
51, -1, 51, -1, 32, 51, 33, -1, 45, 7,
45, -1, 7, 45, -1, 45, 7, -1, 53, 52,
-1, 53, -1, 54, 22, 54, -1, 14, -1, 54,
-1, 55, -1, 20, -1, 19, -1, 39, -1, 25,
-1, 31, -1, 34, -1, 35, -1, 33, -1, 32,
-1, 23, -1, 21, -1, 28, -1, 29, -1, 36,
-1, 40, -1, 30, -1, 27, -1, 26, -1, 22,
-1, 20, -1, 19, -1, 12, -1, 3, 56, -1,
-1
};
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
static const yytype_uint8 yyrline[] =
{
0, 74, 74, 77, 78, 79, 82, 83, 84, 85,
86, 87, 90, 91, 92, 93, 94, 95, 96, 97,
98, 99, 100, 101, 102, 103, 104, 105, 106, 107,
108, 109, 110, 111, 112, 113, 114, 115, 116, 117,
118, 119, 120, 121, 122, 123, 124, 127, 128, 131,
132, 133, 134, 135, 138, 139, 142, 143, 146, 147,
150, 151, 152, 155, 156, 159, 160, 161, 162, 165,
166, 167, 168, 169, 170, 171, 172, 173, 174, 175,
176, 177, 178, 179, 180, 181, 182, 183, 186, 187,
188, 192, 193
};
#endif
#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
"$end", "error", "$undefined", "NEWLINE", "ALPHA", "COMPOSE", "PRINT",
"POS", "INSERT", "SWITCH", "ARROW", "REPLACE", "SYMBOL", "VAR", "SVAR",
"RVAR", "RSVAR", "STRING", "STRING2", "UTF8CHAR", "CHARACTER", "'|'",
"'-'", "'&'", "SEQ", "'!'", "'^'", "'_'", "'*'", "'+'", "'='", "'?'",
"'('", "')'", "'{'", "'}'", "':'", "'['", "']'", "'.'", "','", "$accept",
"ALL", "ASSIGNMENTS", "ASSIGNMENT", "RE", "RANGES", "RANGE", "CONTEXTS2",
"CONTEXTS", "CONTEXT2", "CONTEXT", "VALUES", "VALUE", "LCHAR", "CODE",
"NEWLINES", 0
};
#endif
# ifdef YYPRINT
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
token YYLEX-NUM. */
static const yytype_uint16 yytoknum[] =
{
0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
275, 124, 45, 38, 276, 33, 94, 95, 42, 43,
61, 63, 40, 41, 123, 125, 58, 91, 93, 46,
44
};
# endif
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_uint8 yyr1[] =
{
0, 41, 42, 43, 43, 43, 44, 44, 44, 44,
44, 44, 45, 45, 45, 45, 45, 45, 45, 45,
45, 45, 45, 45, 45, 45, 45, 45, 45, 45,
45, 45, 45, 45, 45, 45, 45, 45, 45, 45,
45, 45, 45, 45, 45, 45, 45, 46, 46, 47,
47, 47, 47, 47, 48, 48, 49, 49, 50, 50,
51, 51, 51, 52, 52, 53, 53, 53, 53, 54,
54, 54, 54, 54, 54, 54, 54, 54, 54, 54,
54, 54, 54, 54, 54, 54, 54, 54, 55, 55,
55, 56, 56
};
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
static const yytype_uint8 yyr2[] =
{
0, 2, 3, 2, 2, 0, 3, 3, 3, 3,
3, 2, 3, 4, 4, 3, 4, 4, 5, 5,
4, 4, 3, 3, 7, 5, 5, 5, 3, 3,
1, 1, 1, 2, 2, 2, 2, 2, 2, 2,
2, 3, 3, 3, 3, 1, 1, 2, 0, 3,
4, 3, 1, 1, 1, 3, 3, 1, 1, 3,
3, 2, 2, 2, 1, 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, 2, 0
};
/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
STATE-NUM when YYTABLE doesn't specify something else to do. Zero
means the default is an error. */
static const yytype_uint8 yydefact[] =
{
5, 0, 0, 1, 4, 0, 0, 90, 31, 0,
32, 0, 45, 46, 89, 88, 0, 0, 0, 0,
48, 0, 52, 3, 92, 30, 53, 31, 32, 11,
38, 0, 0, 0, 0, 37, 39, 40, 0, 0,
48, 66, 0, 70, 69, 79, 87, 78, 72, 86,
85, 80, 81, 84, 73, 77, 76, 74, 75, 82,
71, 83, 0, 64, 67, 68, 92, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 33, 34, 35,
36, 30, 2, 0, 0, 6, 86, 8, 7, 9,
44, 0, 47, 51, 0, 49, 63, 0, 91, 23,
10, 28, 0, 0, 0, 12, 54, 57, 0, 0,
15, 58, 43, 42, 41, 0, 0, 0, 22, 48,
29, 0, 50, 70, 69, 65, 0, 61, 0, 0,
62, 0, 0, 16, 17, 0, 13, 14, 20, 21,
0, 48, 26, 27, 55, 60, 56, 18, 59, 19,
25, 0, 24
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int8 yydefgoto[] =
{
-1, 1, 2, 23, 80, 39, 25, 105, 106, 110,
107, 62, 63, 64, 26, 82
};
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
#define YYPACT_NINF -109
static const yytype_int16 yypact[] =
{
-109, 11, 183, -109, -109, 727, 727, -109, -21, -18,
-17, -6, -109, -109, -109, -109, 727, 727, 727, 727,
193, 780, -109, -109, 151, -4, -109, -109, -109, 315,
315, 727, 809, 727, 809, 756, 756, 756, 249, -10,
193, -109, -20, -109, -109, -109, -109, -109, -109, 838,
-109, -109, -109, -109, -109, -109, -109, -109, -109, -109,
-109, -109, 12, 809, 5, -109, 25, 727, 17, 36,
462, 375, 727, 727, 727, 667, 698, -109, -109, -109,
636, 9, -109, 193, 42, 315, -109, -109, 315, -109,
-109, 13, -109, -109, 15, -109, -109, 860, -109, 549,
-109, 21, 727, 491, 282, -109, -109, 7, 520, 404,
-109, -109, 578, 607, 636, 462, 462, 193, 727, 193,
-109, 743, -109, -109, -109, -109, 36, 315, 216, 26,
727, 491, 433, -109, -109, 27, -109, -109, 727, 346,
29, 193, -109, -109, -109, 315, -109, -109, -109, 346,
-109, 31, -109
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int8 yypgoto[] =
{
-109, -109, -109, -109, -2, -39, 6, -108, -98, -41,
-69, -12, -109, -22, -11, 16
};
/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
positive, shift that token. If negative, reduce the rule which
number is the opposite. If zero, do what YYDEFACT says.
If YYTABLE_NINF, syntax error. */
#define YYTABLE_NINF -1
static const yytype_uint8 yytable[] =
{
24, 92, 111, 29, 30, 129, 83, 136, 137, 31,
65, 3, 32, 33, 35, 36, 37, 38, 93, 117,
87, 65, 89, 65, 34, 91, 40, 97, 66, 85,
81, 88, 84, 146, 100, 81, 81, 94, 65, 111,
135, 81, 81, 81, 81, 84, 40, 131, 7, 121,
95, 96, 65, 122, 7, 14, 15, 126, 101, 144,
148, 14, 15, 135, 150, 99, 152, 133, 104, 104,
112, 113, 114, 36, 37, 125, 119, 0, 0, 21,
140, 22, 98, 0, 0, 0, 81, 0, 0, 118,
120, 81, 0, 0, 81, 0, 0, 0, 0, 0,
127, 128, 151, 0, 0, 81, 104, 128, 0, 0,
81, 0, 0, 104, 104, 143, 139, 0, 81, 81,
81, 0, 0, 138, 0, 40, 0, 142, 145, 104,
128, 0, 0, 81, 81, 0, 149, 0, 0, 0,
0, 0, 0, 0, 0, 81, 0, 40, 0, 0,
0, 81, 0, 0, 66, 81, 67, 68, 0, 69,
6, 70, 71, 7, 27, 0, 28, 0, 12, 13,
14, 15, 72, 73, 74, 0, 16, 75, 76, 77,
78, 0, 79, 19, 0, 20, 4, 5, 21, 0,
22, 0, 6, 0, 0, 7, 8, 9, 10, 11,
12, 13, 14, 15, 0, 7, 0, 0, 16, 17,
18, 0, 14, 15, 0, 19, 0, 20, 0, 0,
21, 67, 22, 130, 69, 6, 70, 71, 7, 27,
21, 28, 22, 12, 13, 14, 15, 72, 73, 74,
0, 16, 75, 76, 77, 78, 0, 79, 19, 90,
20, 0, 0, 21, 67, 22, 0, 69, 6, 70,
71, 7, 27, 0, 28, 0, 12, 13, 14, 15,
72, 73, 74, 0, 16, 75, 76, 77, 78, 0,
79, 19, 90, 20, 0, 0, 21, 67, 22, 130,
69, 6, 70, 71, 7, 27, 0, 28, 0, 12,
13, 14, 15, 72, 73, 74, 0, 16, 75, 76,
77, 78, 0, 79, 19, 0, 20, 0, 0, 21,
67, 22, 0, 69, 6, 70, 71, 7, 27, 0,
28, 0, 12, 13, 14, 15, 72, 73, 74, 0,
16, 75, 76, 77, 78, 0, 79, 19, 0, 20,
0, 67, 21, 0, 22, 6, 0, 0, 7, 27,
0, 28, 0, 12, 13, 14, 15, 72, 73, 74,
0, 16, 75, 76, 77, 78, 0, 79, 19, 0,
20, 0, 102, 21, 6, 22, 0, 7, 27, 0,
28, 0, 12, 13, 14, 15, 0, 0, 0, 0,
16, 17, 18, 0, 0, 0, 108, 109, 0, 20,
0, 102, 21, 6, 22, 0, 7, 27, 0, 28,
0, 12, 13, 14, 15, 0, 0, 0, 0, 16,
17, 18, 0, 0, 0, 0, 19, 134, 20, 0,
102, 21, 6, 22, 0, 7, 27, 0, 28, 0,
12, 13, 14, 15, 0, 0, 0, 0, 16, 17,
18, 0, 0, 0, 0, 19, 147, 20, 0, 102,
21, 6, 22, 0, 7, 27, 0, 28, 0, 12,
13, 14, 15, 0, 0, 0, 0, 16, 17, 18,
0, 0, 0, 0, 103, 0, 20, 0, 102, 21,
6, 22, 0, 7, 27, 0, 28, 0, 12, 13,
14, 15, 0, 0, 0, 0, 16, 17, 18, 0,
0, 0, 0, 19, 0, 20, 0, 102, 21, 6,
22, 0, 7, 27, 0, 28, 0, 12, 13, 14,
15, 0, 0, 0, 0, 16, 17, 18, 0, 0,
0, 0, 132, 0, 20, 0, 0, 21, 6, 22,
0, 7, 27, 0, 28, 0, 12, 13, 14, 15,
72, 73, 74, 0, 16, 75, 76, 77, 78, 0,
79, 19, 0, 20, 0, 0, 21, 6, 22, 0,
7, 27, 0, 28, 0, 12, 13, 14, 15, 0,
73, 74, 0, 16, 75, 76, 77, 78, 0, 79,
19, 0, 20, 0, 0, 21, 6, 22, 0, 7,
27, 0, 28, 0, 12, 13, 14, 15, 0, 0,
74, 0, 16, 75, 76, 77, 78, 0, 79, 19,
0, 20, 0, 0, 21, 6, 22, 0, 7, 27,
0, 28, 0, 12, 13, 14, 15, 0, 0, 0,
0, 16, 75, 76, 77, 78, 0, 79, 19, 0,
20, 0, 0, 21, 0, 22, 6, 115, 0, 7,
27, 0, 28, 0, 12, 13, 14, 15, 0, 0,
0, 0, 16, 17, 18, 0, 0, 0, 0, 19,
0, 20, 0, 0, 21, 0, 22, 6, 116, 0,
7, 27, 0, 28, 0, 12, 13, 14, 15, 0,
0, 0, 0, 16, 17, 18, 0, 0, 0, 0,
19, 0, 20, 0, 0, 21, 6, 22, 0, 7,
27, 0, 28, 0, 12, 13, 14, 15, 0, 0,
0, 0, 16, 17, 18, 7, 0, 0, 0, 19,
0, 20, 14, 15, 21, 6, 22, 0, 7, 27,
0, 28, 0, 12, 13, 14, 15, 141, 0, 0,
21, 0, 22, 0, 77, 78, 0, 79, 19, 0,
20, 0, 7, 21, 41, 22, 42, 0, 0, 43,
44, 45, 46, 47, 0, 48, 49, 50, 51, 52,
53, 54, 55, 56, 57, 58, 59, 0, 0, 60,
61, 7, 0, 41, 0, 0, 0, 0, 43, 44,
45, 46, 47, 0, 48, 86, 50, 51, 52, 53,
54, 55, 56, 57, 58, 59, 0, 0, 60, 61,
7, 0, 41, 0, 0, 0, 0, 43, 44, 0,
0, 0, 0, 0, 0, 0, 51, 52, 53, 54,
55, 56, 57, 58, 59, 0, 0, 60, 61, 123,
124, 45, 46, 47, 0, 48, 86, 50, 51, 52,
53, 54, 55, 56, 57, 58, 59, 0, 0, 60,
61
};
static const yytype_int16 yycheck[] =
{
2, 40, 71, 5, 6, 103, 10, 115, 116, 30,
21, 0, 30, 30, 16, 17, 18, 19, 38, 10,
32, 32, 34, 34, 30, 35, 20, 22, 3, 31,
24, 33, 36, 131, 17, 29, 30, 49, 49, 108,
109, 35, 36, 37, 38, 36, 40, 40, 12, 36,
38, 63, 63, 38, 12, 19, 20, 36, 69, 33,
33, 19, 20, 132, 35, 67, 35, 108, 70, 71,
72, 73, 74, 75, 76, 97, 34, -1, -1, 37,
119, 39, 66, -1, -1, -1, 80, -1, -1, 83,
84, 85, -1, -1, 88, -1, -1, -1, -1, -1,
102, 103, 141, -1, -1, 99, 108, 109, -1, -1,
104, -1, -1, 115, 116, 126, 118, -1, 112, 113,
114, -1, -1, 117, -1, 119, -1, 121, 130, 131,
132, -1, -1, 127, 128, -1, 138, -1, -1, -1,
-1, -1, -1, -1, -1, 139, -1, 141, -1, -1,
-1, 145, -1, -1, 3, 149, 5, 6, -1, 8,
9, 10, 11, 12, 13, -1, 15, -1, 17, 18,
19, 20, 21, 22, 23, -1, 25, 26, 27, 28,
29, -1, 31, 32, -1, 34, 3, 4, 37, -1,
39, -1, 9, -1, -1, 12, 13, 14, 15, 16,
17, 18, 19, 20, -1, 12, -1, -1, 25, 26,
27, -1, 19, 20, -1, 32, -1, 34, -1, -1,
37, 5, 39, 7, 8, 9, 10, 11, 12, 13,
37, 15, 39, 17, 18, 19, 20, 21, 22, 23,
-1, 25, 26, 27, 28, 29, -1, 31, 32, 33,
34, -1, -1, 37, 5, 39, -1, 8, 9, 10,
11, 12, 13, -1, 15, -1, 17, 18, 19, 20,
21, 22, 23, -1, 25, 26, 27, 28, 29, -1,
31, 32, 33, 34, -1, -1, 37, 5, 39, 7,
8, 9, 10, 11, 12, 13, -1, 15, -1, 17,
18, 19, 20, 21, 22, 23, -1, 25, 26, 27,
28, 29, -1, 31, 32, -1, 34, -1, -1, 37,
5, 39, -1, 8, 9, 10, 11, 12, 13, -1,
15, -1, 17, 18, 19, 20, 21, 22, 23, -1,
25, 26, 27, 28, 29, -1, 31, 32, -1, 34,
-1, 5, 37, -1, 39, 9, -1, -1, 12, 13,
-1, 15, -1, 17, 18, 19, 20, 21, 22, 23,
-1, 25, 26, 27, 28, 29, -1, 31, 32, -1,
34, -1, 7, 37, 9, 39, -1, 12, 13, -1,
15, -1, 17, 18, 19, 20, -1, -1, -1, -1,
25, 26, 27, -1, -1, -1, 31, 32, -1, 34,
-1, 7, 37, 9, 39, -1, 12, 13, -1, 15,
-1, 17, 18, 19, 20, -1, -1, -1, -1, 25,
26, 27, -1, -1, -1, -1, 32, 33, 34, -1,
7, 37, 9, 39, -1, 12, 13, -1, 15, -1,
17, 18, 19, 20, -1, -1, -1, -1, 25, 26,
27, -1, -1, -1, -1, 32, 33, 34, -1, 7,
37, 9, 39, -1, 12, 13, -1, 15, -1, 17,
18, 19, 20, -1, -1, -1, -1, 25, 26, 27,
-1, -1, -1, -1, 32, -1, 34, -1, 7, 37,
9, 39, -1, 12, 13, -1, 15, -1, 17, 18,
19, 20, -1, -1, -1, -1, 25, 26, 27, -1,
-1, -1, -1, 32, -1, 34, -1, 7, 37, 9,
39, -1, 12, 13, -1, 15, -1, 17, 18, 19,
20, -1, -1, -1, -1, 25, 26, 27, -1, -1,
-1, -1, 32, -1, 34, -1, -1, 37, 9, 39,
-1, 12, 13, -1, 15, -1, 17, 18, 19, 20,
21, 22, 23, -1, 25, 26, 27, 28, 29, -1,
31, 32, -1, 34, -1, -1, 37, 9, 39, -1,
12, 13, -1, 15, -1, 17, 18, 19, 20, -1,
22, 23, -1, 25, 26, 27, 28, 29, -1, 31,
32, -1, 34, -1, -1, 37, 9, 39, -1, 12,
13, -1, 15, -1, 17, 18, 19, 20, -1, -1,
23, -1, 25, 26, 27, 28, 29, -1, 31, 32,
-1, 34, -1, -1, 37, 9, 39, -1, 12, 13,
-1, 15, -1, 17, 18, 19, 20, -1, -1, -1,
-1, 25, 26, 27, 28, 29, -1, 31, 32, -1,
34, -1, -1, 37, -1, 39, 9, 10, -1, 12,
13, -1, 15, -1, 17, 18, 19, 20, -1, -1,
-1, -1, 25, 26, 27, -1, -1, -1, -1, 32,
-1, 34, -1, -1, 37, -1, 39, 9, 10, -1,
12, 13, -1, 15, -1, 17, 18, 19, 20, -1,
-1, -1, -1, 25, 26, 27, -1, -1, -1, -1,
32, -1, 34, -1, -1, 37, 9, 39, -1, 12,
13, -1, 15, -1, 17, 18, 19, 20, -1, -1,
-1, -1, 25, 26, 27, 12, -1, -1, -1, 32,
-1, 34, 19, 20, 37, 9, 39, -1, 12, 13,
-1, 15, -1, 17, 18, 19, 20, 34, -1, -1,
37, -1, 39, -1, 28, 29, -1, 31, 32, -1,
34, -1, 12, 37, 14, 39, 16, -1, -1, 19,
20, 21, 22, 23, -1, 25, 26, 27, 28, 29,
30, 31, 32, 33, 34, 35, 36, -1, -1, 39,
40, 12, -1, 14, -1, -1, -1, -1, 19, 20,
21, 22, 23, -1, 25, 26, 27, 28, 29, 30,
31, 32, 33, 34, 35, 36, -1, -1, 39, 40,
12, -1, 14, -1, -1, -1, -1, 19, 20, -1,
-1, -1, -1, -1, -1, -1, 28, 29, 30, 31,
32, 33, 34, 35, 36, -1, -1, 39, 40, 19,
20, 21, 22, 23, -1, 25, 26, 27, 28, 29,
30, 31, 32, 33, 34, 35, 36, -1, -1, 39,
40
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 42, 43, 0, 3, 4, 9, 12, 13, 14,
15, 16, 17, 18, 19, 20, 25, 26, 27, 32,
34, 37, 39, 44, 45, 47, 55, 13, 15, 45,
45, 30, 30, 30, 30, 45, 45, 45, 45, 46,
47, 14, 16, 19, 20, 21, 22, 23, 25, 26,
27, 28, 29, 30, 31, 32, 33, 34, 35, 36,
39, 40, 52, 53, 54, 55, 3, 5, 6, 8,
10, 11, 21, 22, 23, 26, 27, 28, 29, 31,
45, 47, 56, 10, 36, 45, 26, 52, 45, 52,
33, 35, 46, 38, 52, 38, 52, 22, 56, 45,
17, 55, 7, 32, 45, 48, 49, 51, 31, 32,
50, 51, 45, 45, 45, 10, 10, 10, 47, 34,
47, 36, 38, 19, 20, 54, 36, 45, 45, 49,
7, 40, 32, 50, 33, 51, 48, 48, 47, 45,
46, 34, 47, 55, 33, 45, 49, 33, 33, 45,
35, 46, 35
};
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY (-2)
#define YYEOF 0
#define YYACCEPT goto yyacceptlab
#define YYABORT goto yyabortlab
#define YYERROR goto yyerrorlab
/* Like YYERROR except do call yyerror. This remains here temporarily
to ease the transition to the new meaning of YYERROR, for GCC.
Once GCC version 2 has supplanted version 1, this can go. */
#define YYFAIL goto yyerrlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(Token, Value) \
do \
if (yychar == YYEMPTY && yylen == 1) \
{ \
yychar = (Token); \
yylval = (Value); \
yytoken = YYTRANSLATE (yychar); \
YYPOPSTACK (1); \
goto yybackup; \
} \
else \
{ \
yyerror (YY_("syntax error: cannot back up")); \
YYERROR; \
} \
while (YYID (0))
#define YYTERROR 1
#define YYERRCODE 256
/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
If N is 0, then set CURRENT to the empty location which ends
the previous symbol: RHS[0] (always defined). */
#define YYRHSLOC(Rhs, K) ((Rhs)[K])
#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N) \
do \
if (YYID (N)) \
{ \
(Current).first_line = YYRHSLOC (Rhs, 1).first_line; \
(Current).first_column = YYRHSLOC (Rhs, 1).first_column; \
(Current).last_line = YYRHSLOC (Rhs, N).last_line; \
(Current).last_column = YYRHSLOC (Rhs, N).last_column; \
} \
else \
{ \
(Current).first_line = (Current).last_line = \
YYRHSLOC (Rhs, 0).last_line; \
(Current).first_column = (Current).last_column = \
YYRHSLOC (Rhs, 0).last_column; \
} \
while (YYID (0))
#endif
/* YY_LOCATION_PRINT -- Print the location on the stream.
This macro was not mandated originally: define only if we know
we won't break user code: when these are the locations we know. */
#ifndef YY_LOCATION_PRINT
# if YYLTYPE_IS_TRIVIAL
# define YY_LOCATION_PRINT(File, Loc) \
fprintf (File, "%d.%d-%d.%d", \
(Loc).first_line, (Loc).first_column, \
(Loc).last_line, (Loc).last_column)
# else
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
# endif
#endif
/* YYLEX -- calling `yylex' with the right arguments. */
#ifdef YYLEX_PARAM
# define YYLEX yylex (YYLEX_PARAM)
#else
# define YYLEX yylex ()
#endif
/* Enable debugging if requested. */
#if YYDEBUG
# ifndef YYFPRINTF
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
# define YYFPRINTF fprintf
# endif
# define YYDPRINTF(Args) \
do { \
if (yydebug) \
YYFPRINTF Args; \
} while (YYID (0))
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, \
Type, Value); \
YYFPRINTF (stderr, "\n"); \
} \
} while (YYID (0))
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
/*ARGSUSED*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
#else
static void
yy_symbol_value_print (yyoutput, yytype, yyvaluep)
FILE *yyoutput;
int yytype;
YYSTYPE const * const yyvaluep;
#endif
{
if (!yyvaluep)
return;
# ifdef YYPRINT
if (yytype < YYNTOKENS)
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# else
YYUSE (yyoutput);
# endif
switch (yytype)
{
default:
break;
}
}
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
#else
static void
yy_symbol_print (yyoutput, yytype, yyvaluep)
FILE *yyoutput;
int yytype;
YYSTYPE const * const yyvaluep;
#endif
{
if (yytype < YYNTOKENS)
YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
else
YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
yy_symbol_value_print (yyoutput, yytype, yyvaluep);
YYFPRINTF (yyoutput, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
#else
static void
yy_stack_print (yybottom, yytop)
yytype_int16 *yybottom;
yytype_int16 *yytop;
#endif
{
YYFPRINTF (stderr, "Stack now");
for (; yybottom <= yytop; yybottom++)
{
int yybot = *yybottom;
YYFPRINTF (stderr, " %d", yybot);
}
YYFPRINTF (stderr, "\n");
}
# define YY_STACK_PRINT(Bottom, Top) \
do { \
if (yydebug) \
yy_stack_print ((Bottom), (Top)); \
} while (YYID (0))
/*------------------------------------------------.
| Report that the YYRULE is going to be reduced. |
`------------------------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_reduce_print (YYSTYPE *yyvsp, int yyrule)
#else
static void
yy_reduce_print (yyvsp, yyrule)
YYSTYPE *yyvsp;
int yyrule;
#endif
{
int yynrhs = yyr2[yyrule];
int yyi;
unsigned long int yylno = yyrline[yyrule];
YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
yyrule - 1, yylno);
/* The symbols being reduced. */
for (yyi = 0; yyi < yynrhs; yyi++)
{
YYFPRINTF (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
&(yyvsp[(yyi + 1) - (yynrhs)])
);
YYFPRINTF (stderr, "\n");
}
}
# define YY_REDUCE_PRINT(Rule) \
do { \
if (yydebug) \
yy_reduce_print (yyvsp, Rule); \
} while (YYID (0))
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !YYDEBUG */
/* YYINITDEPTH -- initial size of the parser's stacks. */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
#endif
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
if the built-in stack extension method is used).
Do not make this value too large; the results are undefined if
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
#if YYERROR_VERBOSE
# ifndef yystrlen
# if defined __GLIBC__ && defined _STRING_H
# define yystrlen strlen
# else
/* Return the length of YYSTR. */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static YYSIZE_T
yystrlen (const char *yystr)
#else
static YYSIZE_T
yystrlen (yystr)
const char *yystr;
#endif
{
YYSIZE_T yylen;
for (yylen = 0; yystr[yylen]; yylen++)
continue;
return yylen;
}
# endif
# endif
# ifndef yystpcpy
# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
# define yystpcpy stpcpy
# else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
YYDEST. */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static char *
yystpcpy (char *yydest, const char *yysrc)
#else
static char *
yystpcpy (yydest, yysrc)
char *yydest;
const char *yysrc;
#endif
{
char *yyd = yydest;
const char *yys = yysrc;
while ((*yyd++ = *yys++) != '\0')
continue;
return yyd - 1;
}
# endif
# endif
# ifndef yytnamerr
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
quotes and backslashes, so that it's suitable for yyerror. The
heuristic is that double-quoting is unnecessary unless the string
contains an apostrophe, a comma, or backslash (other than
backslash-backslash). YYSTR is taken from yytname. If YYRES is
null, do not copy; instead, return the length of what the result
would have been. */
static YYSIZE_T
yytnamerr (char *yyres, const char *yystr)
{
if (*yystr == '"')
{
YYSIZE_T yyn = 0;
char const *yyp = yystr;
for (;;)
switch (*++yyp)
{
case '\'':
case ',':
goto do_not_strip_quotes;
case '\\':
if (*++yyp != '\\')
goto do_not_strip_quotes;
/* Fall through. */
default:
if (yyres)
yyres[yyn] = *yyp;
yyn++;
break;
case '"':
if (yyres)
yyres[yyn] = '\0';
return yyn;
}
do_not_strip_quotes: ;
}
if (! yyres)
return yystrlen (yystr);
return yystpcpy (yyres, yystr) - yyres;
}
# endif
/* Copy into YYRESULT an error message about the unexpected token
YYCHAR while in state YYSTATE. Return the number of bytes copied,
including the terminating null byte. If YYRESULT is null, do not
copy anything; just return the number of bytes that would be
copied. As a special case, return 0 if an ordinary "syntax error"
message will do. Return YYSIZE_MAXIMUM if overflow occurs during
size calculation. */
static YYSIZE_T
yysyntax_error (char *yyresult, int yystate, int yychar)
{
int yyn = yypact[yystate];
if (! (YYPACT_NINF < yyn && yyn <= YYLAST))
return 0;
else
{
int yytype = YYTRANSLATE (yychar);
YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]);
YYSIZE_T yysize = yysize0;
YYSIZE_T yysize1;
int yysize_overflow = 0;
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
int yyx;
# if 0
/* This is so xgettext sees the translatable formats that are
constructed on the fly. */
YY_("syntax error, unexpected %s");
YY_("syntax error, unexpected %s, expecting %s");
YY_("syntax error, unexpected %s, expecting %s or %s");
YY_("syntax error, unexpected %s, expecting %s or %s or %s");
YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s");
# endif
char *yyfmt;
char const *yyf;
static char const yyunexpected[] = "syntax error, unexpected %s";
static char const yyexpecting[] = ", expecting %s";
static char const yyor[] = " or %s";
char yyformat[sizeof yyunexpected
+ sizeof yyexpecting - 1
+ ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2)
* (sizeof yyor - 1))];
char const *yyprefix = yyexpecting;
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. */
int yyxbegin = yyn < 0 ? -yyn : 0;
/* Stay within bounds of both yycheck and yytname. */
int yychecklim = YYLAST - yyn + 1;
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
int yycount = 1;
yyarg[0] = yytname[yytype];
yyfmt = yystpcpy (yyformat, yyunexpected);
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
{
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
{
yycount = 1;
yysize = yysize0;
yyformat[sizeof yyunexpected - 1] = '\0';
break;
}
yyarg[yycount++] = yytname[yyx];
yysize1 = yysize + yytnamerr (0, yytname[yyx]);
yysize_overflow |= (yysize1 < yysize);
yysize = yysize1;
yyfmt = yystpcpy (yyfmt, yyprefix);
yyprefix = yyor;
}
yyf = YY_(yyformat);
yysize1 = yysize + yystrlen (yyf);
yysize_overflow |= (yysize1 < yysize);
yysize = yysize1;
if (yysize_overflow)
return YYSIZE_MAXIMUM;
if (yyresult)
{
/* Avoid sprintf, as that infringes on the user's name space.
Don't have undefined behavior even if the translation
produced a string with the wrong number of "%s"s. */
char *yyp = yyresult;
int yyi = 0;
while ((*yyp = *yyf) != '\0')
{
if (*yyp == '%' && yyf[1] == 's' && yyi < yycount)
{
yyp += yytnamerr (yyp, yyarg[yyi++]);
yyf += 2;
}
else
{
yyp++;
yyf++;
}
}
}
return yysize;
}
}
#endif /* YYERROR_VERBOSE */
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
/*ARGSUSED*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
#else
static void
yydestruct (yymsg, yytype, yyvaluep)
const char *yymsg;
int yytype;
YYSTYPE *yyvaluep;
#endif
{
YYUSE (yyvaluep);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
switch (yytype)
{
default:
break;
}
}
/* Prevent warnings from -Wmissing-prototypes. */
#ifdef YYPARSE_PARAM
#if defined __STDC__ || defined __cplusplus
int yyparse (void *YYPARSE_PARAM);
#else
int yyparse ();
#endif
#else /* ! YYPARSE_PARAM */
#if defined __STDC__ || defined __cplusplus
int yyparse (void);
#else
int yyparse ();
#endif
#endif /* ! YYPARSE_PARAM */
/* The lookahead symbol. */
int yychar;
/* The semantic value of the lookahead symbol. */
YYSTYPE yylval;
/* Number of syntax errors so far. */
int yynerrs;
/*-------------------------.
| yyparse or yypush_parse. |
`-------------------------*/
#ifdef YYPARSE_PARAM
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
int
yyparse (void *YYPARSE_PARAM)
#else
int
yyparse (YYPARSE_PARAM)
void *YYPARSE_PARAM;
#endif
#else /* ! YYPARSE_PARAM */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
int
yyparse (void)
#else
int
yyparse ()
#endif
#endif
{
int yystate;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* The stacks and their tools:
`yyss': related to states.
`yyvs': related to semantic values.
Refer to the stacks thru separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* The state stack. */
yytype_int16 yyssa[YYINITDEPTH];
yytype_int16 *yyss;
yytype_int16 *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs;
YYSTYPE *yyvsp;
YYSIZE_T yystacksize;
int yyn;
int yyresult;
/* Lookahead token as an internal (translated) token number. */
int yytoken;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
#if YYERROR_VERBOSE
/* Buffer for error messages, and its allocated size. */
char yymsgbuf[128];
char *yymsg = yymsgbuf;
YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
#endif
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
/* The number of symbols on the RHS of the reduced rule.
Keep to zero when no symbol should be popped. */
int yylen = 0;
yytoken = 0;
yyss = yyssa;
yyvs = yyvsa;
yystacksize = YYINITDEPTH;
YYDPRINTF ((stderr, "Starting parse\n"));
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
/* Initialize stack pointers.
Waste one element of value and location stack
so that they stay on the same level as the state stack.
The wasted elements are never initialized. */
yyssp = yyss;
yyvsp = yyvs;
goto yysetstate;
/*------------------------------------------------------------.
| yynewstate -- Push a new state, which is found in yystate. |
`------------------------------------------------------------*/
yynewstate:
/* In all cases, when you get here, the value and location stacks
have just been pushed. So pushing a state here evens the stacks. */
yyssp++;
yysetstate:
*yyssp = yystate;
if (yyss + yystacksize - 1 <= yyssp)
{
/* Get the current used size of the three stacks, in elements. */
YYSIZE_T yysize = yyssp - yyss + 1;
#ifdef yyoverflow
{
/* Give user a chance to reallocate the stack. Use copies of
these so that the &'s don't force the real ones into
memory. */
YYSTYPE *yyvs1 = yyvs;
yytype_int16 *yyss1 = yyss;
/* Each stack pointer address is followed by the size of the
data in use in that stack, in bytes. This used to be a
conditional around just the two extra args, but that might
be undefined if yyoverflow is a macro. */
yyoverflow (YY_("memory exhausted"),
&yyss1, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yystacksize);
yyss = yyss1;
yyvs = yyvs1;
}
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
goto yyexhaustedlab;
# else
/* Extend the stack our own way. */
if (YYMAXDEPTH <= yystacksize)
goto yyexhaustedlab;
yystacksize *= 2;
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
{
yytype_int16 *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyexhaustedlab;
YYSTACK_RELOCATE (yyss_alloc, yyss);
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
#endif /* no yyoverflow */
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long int) yystacksize));
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
if (yystate == YYFINAL)
YYACCEPT;
goto yybackup;
/*-----------.
| yybackup. |
`-----------*/
yybackup:
/* Do appropriate processing given the current state. Read a
lookahead token if we need one and don't already have one. */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yyn == YYPACT_NINF)
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
yychar = YYLEX;
}
if (yychar <= YYEOF)
{
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
}
/* If the proper action on seeing token YYTOKEN is to reduce or to
detect an error, take that action. */
yyn += yytoken;
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
goto yydefault;
yyn = yytable[yyn];
if (yyn <= 0)
{
if (yyn == 0 || yyn == YYTABLE_NINF)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
/* Shift the lookahead token. */
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
/* Discard the shifted token. */
yychar = YYEMPTY;
yystate = yyn;
*++yyvsp = yylval;
goto yynewstate;
/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state. |
`-----------------------------------------------------------*/
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
goto yyreduce;
/*-----------------------------.
| yyreduce -- Do a reduction. |
`-----------------------------*/
yyreduce:
/* yyn is the number of a rule to reduce with. */
yylen = yyr2[yyn];
/* If YYLEN is nonzero, implement the default value of the action:
`$$ = $1'.
Otherwise, the following line sets YYVAL to garbage.
This behavior is undocumented and Bison
users should not rely upon it. Assigning to YYVAL
unconditionally makes the parser a bit smaller, and it avoids a
GCC warning that YYVAL may be used uninitialized. */
yyval = yyvsp[1-yylen];
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 2:
/* Line 1455 of yacc.c */
#line 74 "fst-compiler.yy"
{ Result=interface.result((yyvsp[(2) - (3)].expression), Switch); ;}
break;
case 3:
/* Line 1455 of yacc.c */
#line 77 "fst-compiler.yy"
{;}
break;
case 4:
/* Line 1455 of yacc.c */
#line 78 "fst-compiler.yy"
{;}
break;
case 5:
/* Line 1455 of yacc.c */
#line 79 "fst-compiler.yy"
{;}
break;
case 6:
/* Line 1455 of yacc.c */
#line 82 "fst-compiler.yy"
{ if (interface.def_var((yyvsp[(1) - (3)].name),(yyvsp[(3) - (3)].expression))) warn2("assignment of empty transducer to",(yyvsp[(1) - (3)].name)); ;}
break;
case 7:
/* Line 1455 of yacc.c */
#line 83 "fst-compiler.yy"
{ if (interface.def_rvar((yyvsp[(1) - (3)].name),(yyvsp[(3) - (3)].expression))) warn2("assignment of empty transducer to",(yyvsp[(1) - (3)].name)); ;}
break;
case 8:
/* Line 1455 of yacc.c */
#line 84 "fst-compiler.yy"
{ if (interface.def_svar((yyvsp[(1) - (3)].name),(yyvsp[(3) - (3)].range))) warn2("assignment of empty symbol range to",(yyvsp[(1) - (3)].name)); ;}
break;
case 9:
/* Line 1455 of yacc.c */
#line 85 "fst-compiler.yy"
{ if (interface.def_svar((yyvsp[(1) - (3)].name),(yyvsp[(3) - (3)].range))) warn2("assignment of empty symbol range to",(yyvsp[(1) - (3)].name)); ;}
break;
case 10:
/* Line 1455 of yacc.c */
#line 86 "fst-compiler.yy"
{ interface.write_to_file((yyvsp[(1) - (3)].expression), (yyvsp[(3) - (3)].value)); ;}
break;
case 11:
/* Line 1455 of yacc.c */
#line 87 "fst-compiler.yy"
{ interface.def_alphabet((yyvsp[(2) - (2)].expression)); ;}
break;
case 12:
/* Line 1455 of yacc.c */
#line 90 "fst-compiler.yy"
{ (yyval.expression) = interface.restriction((yyvsp[(1) - (3)].expression),(yyvsp[(2) - (3)].type),(yyvsp[(3) - (3)].contexts),0); ;}
break;
case 13:
/* Line 1455 of yacc.c */
#line 91 "fst-compiler.yy"
{ (yyval.expression) = interface.restriction((yyvsp[(1) - (4)].expression),(yyvsp[(3) - (4)].type),(yyvsp[(4) - (4)].contexts),1); ;}
break;
case 14:
/* Line 1455 of yacc.c */
#line 92 "fst-compiler.yy"
{ (yyval.expression) = interface.restriction((yyvsp[(1) - (4)].expression),(yyvsp[(3) - (4)].type),(yyvsp[(4) - (4)].contexts),-1); ;}
break;
case 15:
/* Line 1455 of yacc.c */
#line 93 "fst-compiler.yy"
{ (yyval.expression) = interface.replace_in_context(interface.minimise(interface.explode((yyvsp[(1) - (3)].expression))),(yyvsp[(2) - (3)].rtype),(yyvsp[(3) - (3)].contexts),false); ;}
break;
case 16:
/* Line 1455 of yacc.c */
#line 94 "fst-compiler.yy"
{ (yyval.expression) = interface.replace_in_context(interface.minimise(interface.explode((yyvsp[(1) - (4)].expression))),(yyvsp[(2) - (4)].rtype),(yyvsp[(4) - (4)].contexts),true);;}
break;
case 17:
/* Line 1455 of yacc.c */
#line 95 "fst-compiler.yy"
{ (yyval.expression) = interface.replace(interface.minimise(interface.explode((yyvsp[(1) - (4)].expression))), (yyvsp[(2) - (4)].rtype), false); ;}
break;
case 18:
/* Line 1455 of yacc.c */
#line 96 "fst-compiler.yy"
{ (yyval.expression) = interface.replace(interface.minimise(interface.explode((yyvsp[(1) - (5)].expression))), (yyvsp[(2) - (5)].rtype), true); ;}
break;
case 19:
/* Line 1455 of yacc.c */
#line 97 "fst-compiler.yy"
{ (yyval.expression) = interface.make_rule((yyvsp[(1) - (5)].expression),(yyvsp[(2) - (5)].range),(yyvsp[(3) - (5)].type),(yyvsp[(4) - (5)].range),(yyvsp[(5) - (5)].expression)); ;}
break;
case 20:
/* Line 1455 of yacc.c */
#line 98 "fst-compiler.yy"
{ (yyval.expression) = interface.make_rule((yyvsp[(1) - (4)].expression),(yyvsp[(2) - (4)].range),(yyvsp[(3) - (4)].type),(yyvsp[(4) - (4)].range),NULL); ;}
break;
case 21:
/* Line 1455 of yacc.c */
#line 99 "fst-compiler.yy"
{ (yyval.expression) = interface.make_rule(NULL,(yyvsp[(1) - (4)].range),(yyvsp[(2) - (4)].type),(yyvsp[(3) - (4)].range),(yyvsp[(4) - (4)].expression)); ;}
break;
case 22:
/* Line 1455 of yacc.c */
#line 100 "fst-compiler.yy"
{ (yyval.expression) = interface.make_rule(NULL,(yyvsp[(1) - (3)].range),(yyvsp[(2) - (3)].type),(yyvsp[(3) - (3)].range),NULL); ;}
break;
case 23:
/* Line 1455 of yacc.c */
#line 101 "fst-compiler.yy"
{ (yyval.expression) = interface.composition((yyvsp[(1) - (3)].expression), (yyvsp[(3) - (3)].expression)); ;}
break;
case 24:
/* Line 1455 of yacc.c */
#line 102 "fst-compiler.yy"
{ (yyval.expression) = interface.make_mapping((yyvsp[(2) - (7)].ranges),(yyvsp[(6) - (7)].ranges)); ;}
break;
case 25:
/* Line 1455 of yacc.c */
#line 103 "fst-compiler.yy"
{ (yyval.expression) = interface.make_mapping(interface.add_range((yyvsp[(1) - (5)].range),NULL),(yyvsp[(4) - (5)].ranges)); ;}
break;
case 26:
/* Line 1455 of yacc.c */
#line 104 "fst-compiler.yy"
{ (yyval.expression) = interface.make_mapping((yyvsp[(2) - (5)].ranges),interface.add_range((yyvsp[(5) - (5)].range),NULL)); ;}
break;
case 27:
/* Line 1455 of yacc.c */
#line 105 "fst-compiler.yy"
{ (yyval.expression) = interface.freely_insert((yyvsp[(1) - (5)].expression), (yyvsp[(3) - (5)].character), (yyvsp[(5) - (5)].character)); ;}
break;
case 28:
/* Line 1455 of yacc.c */
#line 106 "fst-compiler.yy"
{ (yyval.expression) = interface.freely_insert((yyvsp[(1) - (3)].expression), (yyvsp[(3) - (3)].character), (yyvsp[(3) - (3)].character)); ;}
break;
case 29:
/* Line 1455 of yacc.c */
#line 107 "fst-compiler.yy"
{ (yyval.expression) = interface.new_transducer((yyvsp[(1) - (3)].range),(yyvsp[(3) - (3)].range)); ;}
break;
case 30:
/* Line 1455 of yacc.c */
#line 108 "fst-compiler.yy"
{ (yyval.expression) = interface.new_transducer((yyvsp[(1) - (1)].range),(yyvsp[(1) - (1)].range)); ;}
break;
case 31:
/* Line 1455 of yacc.c */
#line 109 "fst-compiler.yy"
{ (yyval.expression) = interface.var_value((yyvsp[(1) - (1)].name)); ;}
break;
case 32:
/* Line 1455 of yacc.c */
#line 110 "fst-compiler.yy"
{ (yyval.expression) = interface.rvar_value((yyvsp[(1) - (1)].name)); ;}
break;
case 33:
/* Line 1455 of yacc.c */
#line 111 "fst-compiler.yy"
{ (yyval.expression) = interface.repetition((yyvsp[(1) - (2)].expression)); ;}
break;
case 34:
/* Line 1455 of yacc.c */
#line 112 "fst-compiler.yy"
{ (yyval.expression) = interface.repetition2((yyvsp[(1) - (2)].expression)); ;}
break;
case 35:
/* Line 1455 of yacc.c */
#line 113 "fst-compiler.yy"
{ (yyval.expression) = interface.optional((yyvsp[(1) - (2)].expression)); ;}
break;
case 36:
/* Line 1455 of yacc.c */
#line 114 "fst-compiler.yy"
{ (yyval.expression) = interface.catenate((yyvsp[(1) - (2)].expression), (yyvsp[(2) - (2)].expression)); ;}
break;
case 37:
/* Line 1455 of yacc.c */
#line 115 "fst-compiler.yy"
{ (yyval.expression) = interface.negation((yyvsp[(2) - (2)].expression)); ;}
break;
case 38:
/* Line 1455 of yacc.c */
#line 116 "fst-compiler.yy"
{ (yyval.expression) = interface.switch_levels((yyvsp[(2) - (2)].expression)); ;}
break;
case 39:
/* Line 1455 of yacc.c */
#line 117 "fst-compiler.yy"
{ (yyval.expression) = interface.upper_level((yyvsp[(2) - (2)].expression)); ;}
break;
case 40:
/* Line 1455 of yacc.c */
#line 118 "fst-compiler.yy"
{ (yyval.expression) = interface.lower_level((yyvsp[(2) - (2)].expression)); ;}
break;
case 41:
/* Line 1455 of yacc.c */
#line 119 "fst-compiler.yy"
{ (yyval.expression) = interface.conjunction((yyvsp[(1) - (3)].expression), (yyvsp[(3) - (3)].expression)); ;}
break;
case 42:
/* Line 1455 of yacc.c */
#line 120 "fst-compiler.yy"
{ (yyval.expression) = interface.subtraction((yyvsp[(1) - (3)].expression), (yyvsp[(3) - (3)].expression)); ;}
break;
case 43:
/* Line 1455 of yacc.c */
#line 121 "fst-compiler.yy"
{ (yyval.expression) = interface.disjunction((yyvsp[(1) - (3)].expression), (yyvsp[(3) - (3)].expression)); ;}
break;
case 44:
/* Line 1455 of yacc.c */
#line 122 "fst-compiler.yy"
{ (yyval.expression) = (yyvsp[(2) - (3)].expression); ;}
break;
case 45:
/* Line 1455 of yacc.c */
#line 123 "fst-compiler.yy"
{ (yyval.expression) = interface.read_words((yyvsp[(1) - (1)].value)); ;}
break;
case 46:
/* Line 1455 of yacc.c */
#line 124 "fst-compiler.yy"
{ (yyval.expression) = interface.read_transducer((yyvsp[(1) - (1)].value)); ;}
break;
case 47:
/* Line 1455 of yacc.c */
#line 127 "fst-compiler.yy"
{ (yyval.ranges) = interface.add_range((yyvsp[(1) - (2)].range),(yyvsp[(2) - (2)].ranges)); ;}
break;
case 48:
/* Line 1455 of yacc.c */
#line 128 "fst-compiler.yy"
{ (yyval.ranges) = NULL; ;}
break;
case 49:
/* Line 1455 of yacc.c */
#line 131 "fst-compiler.yy"
{ (yyval.range)=(yyvsp[(2) - (3)].range); ;}
break;
case 50:
/* Line 1455 of yacc.c */
#line 132 "fst-compiler.yy"
{ (yyval.range)=interface.complement_range((yyvsp[(3) - (4)].range)); ;}
break;
case 51:
/* Line 1455 of yacc.c */
#line 133 "fst-compiler.yy"
{ (yyval.range)=interface.rsvar_value((yyvsp[(2) - (3)].name)); ;}
break;
case 52:
/* Line 1455 of yacc.c */
#line 134 "fst-compiler.yy"
{ (yyval.range)=NULL; ;}
break;
case 53:
/* Line 1455 of yacc.c */
#line 135 "fst-compiler.yy"
{ (yyval.range)=interface.add_value((yyvsp[(1) - (1)].character),NULL); ;}
break;
case 54:
/* Line 1455 of yacc.c */
#line 138 "fst-compiler.yy"
{ (yyval.contexts) = (yyvsp[(1) - (1)].contexts); ;}
break;
case 55:
/* Line 1455 of yacc.c */
#line 139 "fst-compiler.yy"
{ (yyval.contexts) = (yyvsp[(2) - (3)].contexts); ;}
break;
case 56:
/* Line 1455 of yacc.c */
#line 142 "fst-compiler.yy"
{ (yyval.contexts) = interface.add_context((yyvsp[(1) - (3)].contexts),(yyvsp[(3) - (3)].contexts)); ;}
break;
case 57:
/* Line 1455 of yacc.c */
#line 143 "fst-compiler.yy"
{ (yyval.contexts) = (yyvsp[(1) - (1)].contexts); ;}
break;
case 58:
/* Line 1455 of yacc.c */
#line 146 "fst-compiler.yy"
{ (yyval.contexts) = (yyvsp[(1) - (1)].contexts); ;}
break;
case 59:
/* Line 1455 of yacc.c */
#line 147 "fst-compiler.yy"
{ (yyval.contexts) = (yyvsp[(2) - (3)].contexts); ;}
break;
case 60:
/* Line 1455 of yacc.c */
#line 150 "fst-compiler.yy"
{ (yyval.contexts) = interface.make_context((yyvsp[(1) - (3)].expression), (yyvsp[(3) - (3)].expression)); ;}
break;
case 61:
/* Line 1455 of yacc.c */
#line 151 "fst-compiler.yy"
{ (yyval.contexts) = interface.make_context(NULL, (yyvsp[(2) - (2)].expression)); ;}
break;
case 62:
/* Line 1455 of yacc.c */
#line 152 "fst-compiler.yy"
{ (yyval.contexts) = interface.make_context((yyvsp[(1) - (2)].expression), NULL); ;}
break;
case 63:
/* Line 1455 of yacc.c */
#line 155 "fst-compiler.yy"
{ (yyval.range)=interface.append_values((yyvsp[(1) - (2)].range),(yyvsp[(2) - (2)].range)); ;}
break;
case 64:
/* Line 1455 of yacc.c */
#line 156 "fst-compiler.yy"
{ (yyval.range) = (yyvsp[(1) - (1)].range); ;}
break;
case 65:
/* Line 1455 of yacc.c */
#line 159 "fst-compiler.yy"
{ (yyval.range)=interface.add_values((yyvsp[(1) - (3)].longchar),(yyvsp[(3) - (3)].longchar),NULL); ;}
break;
case 66:
/* Line 1455 of yacc.c */
#line 160 "fst-compiler.yy"
{ (yyval.range)=interface.svar_value((yyvsp[(1) - (1)].name)); ;}
break;
case 67:
/* Line 1455 of yacc.c */
#line 161 "fst-compiler.yy"
{ (yyval.range)=interface.add_value(interface.character_code((yyvsp[(1) - (1)].longchar)),NULL); ;}
break;
case 68:
/* Line 1455 of yacc.c */
#line 162 "fst-compiler.yy"
{ (yyval.range)=interface.add_value((yyvsp[(1) - (1)].character),NULL); ;}
break;
case 69:
/* Line 1455 of yacc.c */
#line 165 "fst-compiler.yy"
{ (yyval.longchar)=(yyvsp[(1) - (1)].uchar); ;}
break;
case 70:
/* Line 1455 of yacc.c */
#line 166 "fst-compiler.yy"
{ (yyval.longchar)=utf8toint((yyvsp[(1) - (1)].value)); free((yyvsp[(1) - (1)].value)); ;}
break;
case 71:
/* Line 1455 of yacc.c */
#line 167 "fst-compiler.yy"
{ (yyval.longchar)='.'; ;}
break;
case 72:
/* Line 1455 of yacc.c */
#line 168 "fst-compiler.yy"
{ (yyval.longchar)='!'; ;}
break;
case 73:
/* Line 1455 of yacc.c */
#line 169 "fst-compiler.yy"
{ (yyval.longchar)='?'; ;}
break;
case 74:
/* Line 1455 of yacc.c */
#line 170 "fst-compiler.yy"
{ (yyval.longchar)='{'; ;}
break;
case 75:
/* Line 1455 of yacc.c */
#line 171 "fst-compiler.yy"
{ (yyval.longchar)='}'; ;}
break;
case 76:
/* Line 1455 of yacc.c */
#line 172 "fst-compiler.yy"
{ (yyval.longchar)=')'; ;}
break;
case 77:
/* Line 1455 of yacc.c */
#line 173 "fst-compiler.yy"
{ (yyval.longchar)='('; ;}
break;
case 78:
/* Line 1455 of yacc.c */
#line 174 "fst-compiler.yy"
{ (yyval.longchar)='&'; ;}
break;
case 79:
/* Line 1455 of yacc.c */
#line 175 "fst-compiler.yy"
{ (yyval.longchar)='|'; ;}
break;
case 80:
/* Line 1455 of yacc.c */
#line 176 "fst-compiler.yy"
{ (yyval.longchar)='*'; ;}
break;
case 81:
/* Line 1455 of yacc.c */
#line 177 "fst-compiler.yy"
{ (yyval.longchar)='+'; ;}
break;
case 82:
/* Line 1455 of yacc.c */
#line 178 "fst-compiler.yy"
{ (yyval.longchar)=':'; ;}
break;
case 83:
/* Line 1455 of yacc.c */
#line 179 "fst-compiler.yy"
{ (yyval.longchar)=','; ;}
break;
case 84:
/* Line 1455 of yacc.c */
#line 180 "fst-compiler.yy"
{ (yyval.longchar)='='; ;}
break;
case 85:
/* Line 1455 of yacc.c */
#line 181 "fst-compiler.yy"
{ (yyval.longchar)='_'; ;}
break;
case 86:
/* Line 1455 of yacc.c */
#line 182 "fst-compiler.yy"
{ (yyval.longchar)='^'; ;}
break;
case 87:
/* Line 1455 of yacc.c */
#line 183 "fst-compiler.yy"
{ (yyval.longchar)='-'; ;}
break;
case 88:
/* Line 1455 of yacc.c */
#line 186 "fst-compiler.yy"
{ (yyval.character)=interface.character_code((yyvsp[(1) - (1)].uchar)); ;}
break;
case 89:
/* Line 1455 of yacc.c */
#line 187 "fst-compiler.yy"
{ (yyval.character)=interface.symbol_code((yyvsp[(1) - (1)].value)); ;}
break;
case 90:
/* Line 1455 of yacc.c */
#line 188 "fst-compiler.yy"
{ (yyval.character)=interface.symbol_code((yyvsp[(1) - (1)].name)); ;}
break;
case 91:
/* Line 1455 of yacc.c */
#line 192 "fst-compiler.yy"
{;}
break;
case 92:
/* Line 1455 of yacc.c */
#line 193 "fst-compiler.yy"
{;}
break;
/* Line 1455 of yacc.c */
#line 2311 "fst-compiler.C"
default: break;
}
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
*++yyvsp = yyval;
/* Now `shift' the result of the reduction. Determine what state
that goes to, based on the state we popped back to and the rule
number reduced by. */
yyn = yyr1[yyn];
yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTOKENS];
goto yynewstate;
/*------------------------------------.
| yyerrlab -- here on detecting error |
`------------------------------------*/
yyerrlab:
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
#if ! YYERROR_VERBOSE
yyerror (YY_("syntax error"));
#else
{
YYSIZE_T yysize = yysyntax_error (0, yystate, yychar);
if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM)
{
YYSIZE_T yyalloc = 2 * yysize;
if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM))
yyalloc = YYSTACK_ALLOC_MAXIMUM;
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
yymsg = (char *) YYSTACK_ALLOC (yyalloc);
if (yymsg)
yymsg_alloc = yyalloc;
else
{
yymsg = yymsgbuf;
yymsg_alloc = sizeof yymsgbuf;
}
}
if (0 < yysize && yysize <= yymsg_alloc)
{
(void) yysyntax_error (yymsg, yystate, yychar);
yyerror (yymsg);
}
else
{
yyerror (YY_("syntax error"));
if (yysize != 0)
goto yyexhaustedlab;
}
}
#endif
}
if (yyerrstatus == 3)
{
/* If just tried and failed to reuse lookahead token after an
error, discard it. */
if (yychar <= YYEOF)
{
/* Return failure if at end of input. */
if (yychar == YYEOF)
YYABORT;
}
else
{
yydestruct ("Error: discarding",
yytoken, &yylval);
yychar = YYEMPTY;
}
}
/* Else will try to reuse lookahead token after shifting the error
token. */
goto yyerrlab1;
/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR. |
`---------------------------------------------------*/
yyerrorlab:
/* Pacify compilers like GCC when the user code never invokes
YYERROR and the label yyerrorlab therefore never appears in user
code. */
if (/*CONSTCOND*/ 0)
goto yyerrorlab;
/* Do not reclaim the symbols of the rule which action triggered
this YYERROR. */
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
yystate = *yyssp;
goto yyerrlab1;
/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR. |
`-------------------------------------------------------------*/
yyerrlab1:
yyerrstatus = 3; /* Each real token shifted decrements this. */
for (;;)
{
yyn = yypact[yystate];
if (yyn != YYPACT_NINF)
{
yyn += YYTERROR;
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
{
yyn = yytable[yyn];
if (0 < yyn)
break;
}
}
/* Pop the current state because it cannot handle the error token. */
if (yyssp == yyss)
YYABORT;
yydestruct ("Error: popping",
yystos[yystate], yyvsp);
YYPOPSTACK (1);
yystate = *yyssp;
YY_STACK_PRINT (yyss, yyssp);
}
*++yyvsp = yylval;
/* Shift the error token. */
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturn;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturn;
#if !defined(yyoverflow) || YYERROR_VERBOSE
/*-------------------------------------------------.
| yyexhaustedlab -- memory exhaustion comes here. |
`-------------------------------------------------*/
yyexhaustedlab:
yyerror (YY_("memory exhausted"));
yyresult = 2;
/* Fall through. */
#endif
yyreturn:
if (yychar != YYEMPTY)
yydestruct ("Cleanup: discarding lookahead",
yytoken, &yylval);
/* Do not reclaim the symbols of the rule which action triggered
this YYABORT or YYACCEPT. */
YYPOPSTACK (yylen);
YY_STACK_PRINT (yyss, yyssp);
while (yyssp != yyss)
{
yydestruct ("Cleanup: popping",
yystos[*yyssp], yyvsp);
YYPOPSTACK (1);
}
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
#if YYERROR_VERBOSE
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
#endif
/* Make sure YYID is used. */
return YYID (yyresult);
}
/* Line 1675 of yacc.c */
#line 196 "fst-compiler.yy"
extern FILE *yyin;
static int Compact=0;
static int LowMem=0;
/*******************************************************************/
/* */
/* yyerror */
/* */
/*******************************************************************/
void yyerror( const char *text )
{
cerr << "\n" << FileName << ":" << yylineno << ": " << text << " at: ";
cerr << yytext << "\naborted.\n";
exit(1);
}
/*******************************************************************/
/* */
/* warn */
/* */
/*******************************************************************/
void warn( const char *text )
{
if (Verbose)
cerr << "\n";
cerr << FileName << ":" << yylineno << ": warning: " << text << "!\n";
}
/*******************************************************************/
/* */
/* warn2 */
/* */
/*******************************************************************/
void warn2( const char *text, const char *text2)
{
if (Verbose)
cerr << "\n";
cerr << FileName << ":" << yylineno << ": warning: " << text << ": ";
cerr << text2 << "\n";
}
/*******************************************************************/
/* */
/* get_flags */
/* */
/*******************************************************************/
void get_flags( int *argc, char **argv )
{
for( int i=1; i<*argc; i++ ) {
if (strcmp(argv[i],"-c") == 0) {
Compact = 1;
argv[i] = NULL;
}
else if (strcmp(argv[i],"-l") == 0) {
LowMem = 1;
argv[i] = NULL;
}
else if (strcmp(argv[i],"-q") == 0) {
Verbose = 0;
argv[i] = NULL;
}
else if (strcmp(argv[i],"-s") == 0) {
Switch = 1;
argv[i] = NULL;
}
}
// remove flags from the argument list
int k;
for( int i=k=1; i<*argc; i++)
if (argv[i] != NULL)
argv[k++] = argv[i];
*argc = k;
}
/*******************************************************************/
/* */
/* main */
/* */
/*******************************************************************/
int main( int argc, char *argv[] )
{
FILE *file;
get_flags(&argc, argv);
if (argc < 3) {
fprintf(stderr,"\nUsage: %s [options] infile outfile\n", argv[0]);
fprintf(stderr,"\nOPTIONS:\n");
fprintf(stderr,"-c\tStore the transducer in fst-infl2 format.\n");
fprintf(stderr,"-l\tStore the transducer in fst-infl3 format.\n");
fprintf(stderr,"-s\tSwitch the upper and lower levels producing a transducer for generation rather than recognition.\n");
fprintf(stderr,"-q\tquiet mode\n\n");
exit(1);
}
if ((file = fopen(argv[1],"rt")) == NULL) {
fprintf(stderr,"\nError: Cannot open source file \"%s\"\n\n", argv[1]);
exit(1);
}
FileName = argv[1];
Result = NULL;
interface.TheAlphabet.utf8 = UTF8;
interface.Verbose = Verbose;
yyin = file;
try {
yyparse();
Result->alphabet.utf8 = UTF8;
if (Verbose)
cerr << "\n";
if (Result->is_empty())
warn("result transducer is empty");
if ((file = fopen(argv[2],"wb")) == NULL) {
fprintf(stderr,"\nError: Cannot open output file %s\n\n", argv[2]);
exit(1);
}
if (Compact) {
MakeCompactTransducer ca(*Result);
delete Result;
ca.store(file);
}
else if (LowMem)
Result->store_lowmem(file);
else
Result->store(file);
fclose(file);
}
catch(const char* p) {
cerr << "\n" << p << "\n\n";
exit(1);
}
}
src/main/resources/SMOR/src/fst-compiler.h 0 → 100755
View file @ 0b611765
/* A Bison parser, made by GNU Bison 2.4.1. */
/* Skeleton interface for Bison's Yacc-like parsers in C
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
/* Tokens. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
/* Put the tokens into the symbol table, so that GDB and other debuggers
know about them. */
enum yytokentype {
NEWLINE = 258,
ALPHA = 259,
COMPOSE = 260,
PRINT = 261,
POS = 262,
INSERT = 263,
SWITCH = 264,
ARROW = 265,
REPLACE = 266,
SYMBOL = 267,
VAR = 268,
SVAR = 269,
RVAR = 270,
RSVAR = 271,
STRING = 272,
STRING2 = 273,
UTF8CHAR = 274,
CHARACTER = 275,
SEQ = 276
};
#endif
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
typedef union YYSTYPE
{
/* Line 1676 of yacc.c */
#line 34 "fst-compiler.yy"
int number;
SFST::Twol_Type type;
SFST::Repl_Type rtype;
char *name;
char *value;
unsigned char uchar;
unsigned int longchar;
SFST::Character character;
SFST::Transducer *expression;
SFST::Range *range;
SFST::Ranges *ranges;
SFST::Contexts *contexts;
/* Line 1676 of yacc.c */
#line 90 "fst-compiler.H"
} YYSTYPE;
# define YYSTYPE_IS_TRIVIAL 1
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
# define YYSTYPE_IS_DECLARED 1
#endif
extern YYSTYPE yylval;
src/main/resources/SMOR/src/fst-compiler.yy 0 → 100755
View file @ 0b611765
%{
/*******************************************************************/
/* */
/* FILE fst-compiler.yy */
/* MODULE fst-compiler */
/* PROGRAM SFST */
/* AUTHOR Helmut Schmid, IMS, University of Stuttgart */
/* */
/*******************************************************************/
#include <stdio.h>
#include "make-compact.h"
#include "scanner.h"
#include "interface.h"
using std::cerr;
using namespace SFST;
extern int yylineno;
extern char *yytext;
void yyerror( const char *text );
void warn( const char *text );
void warn2( const char *text, const char *text2);
int yylex( void );
int yyparse( void );
static int Switch=0;
Interface interface;
Transducer *Result;
%}
%union {
int number;
SFST::Twol_Type type;
SFST::Repl_Type rtype;
char *name;
char *value;
unsigned char uchar;
unsigned int longchar;
SFST::Character character;
SFST::Transducer *expression;
SFST::Range *range;
SFST::Ranges *ranges;
SFST::Contexts *contexts;
}
%token <number> NEWLINE ALPHA COMPOSE PRINT POS INSERT SWITCH
%token <type> ARROW
%token <rtype> REPLACE
%token <name> SYMBOL VAR SVAR RVAR RSVAR
%token <value> STRING STRING2 UTF8CHAR
%token <uchar> CHARACTER
%type <longchar> LCHAR
%type <character> CODE
%type <expression> RE
%type <range> RANGE VALUE VALUES
%type <ranges> RANGES
%type <contexts> CONTEXT CONTEXT2 CONTEXTS CONTEXTS2
%left PRINT INSERT
%left ARROW REPLACE
%left COMPOSE
%left '|'
%left '-'
%left '&'
%left SEQ
%left '!' '^' '_'
%left '*' '+'
%%
ALL: ASSIGNMENTS RE NEWLINES { Result=interface.result($2, Switch); }
;
ASSIGNMENTS: ASSIGNMENTS ASSIGNMENT {}
| ASSIGNMENTS NEWLINE {}
| /* nothing */ {}
;
ASSIGNMENT: VAR '=' RE { if (interface.def_var($1,$3)) warn2("assignment of empty transducer to",$1); }
| RVAR '=' RE { if (interface.def_rvar($1,$3)) warn2("assignment of empty transducer to",$1); }
| SVAR '=' VALUES { if (interface.def_svar($1,$3)) warn2("assignment of empty symbol range to",$1); }
| RSVAR '=' VALUES { if (interface.def_svar($1,$3)) warn2("assignment of empty symbol range to",$1); }
| RE PRINT STRING { interface.write_to_file($1, $3); }
| ALPHA RE { interface.def_alphabet($2); }
;
RE: RE ARROW CONTEXTS2 { $$ = interface.restriction($1,$2,$3,0); }
| RE '^' ARROW CONTEXTS2 { $$ = interface.restriction($1,$3,$4,1); }
| RE '_' ARROW CONTEXTS2 { $$ = interface.restriction($1,$3,$4,-1); }
| RE REPLACE CONTEXT2 { $$ = interface.replace_in_context(interface.minimise(interface.explode($1)),$2,$3,false); }
| RE REPLACE '?' CONTEXT2 { $$ = interface.replace_in_context(interface.minimise(interface.explode($1)),$2,$4,true);}
| RE REPLACE '(' ')' { $$ = interface.replace(interface.minimise(interface.explode($1)), $2, false); }
| RE REPLACE '?' '(' ')' { $$ = interface.replace(interface.minimise(interface.explode($1)), $2, true); }
| RE RANGE ARROW RANGE RE { $$ = interface.make_rule($1,$2,$3,$4,$5); }
| RE RANGE ARROW RANGE { $$ = interface.make_rule($1,$2,$3,$4,NULL); }
| RANGE ARROW RANGE RE { $$ = interface.make_rule(NULL,$1,$2,$3,$4); }
| RANGE ARROW RANGE { $$ = interface.make_rule(NULL,$1,$2,$3,NULL); }
| RE COMPOSE RE { $$ = interface.composition($1, $3); }
| '{' RANGES '}' ':' '{' RANGES '}' { $$ = interface.make_mapping($2,$6); }
| RANGE ':' '{' RANGES '}' { $$ = interface.make_mapping(interface.add_range($1,NULL),$4); }
| '{' RANGES '}' ':' RANGE { $$ = interface.make_mapping($2,interface.add_range($5,NULL)); }
| RE INSERT CODE ':' CODE { $$ = interface.freely_insert($1, $3, $5); }
| RE INSERT CODE { $$ = interface.freely_insert($1, $3, $3); }
| RANGE ':' RANGE { $$ = interface.new_transducer($1,$3); }
| RANGE { $$ = interface.new_transducer($1,$1); }
| VAR { $$ = interface.var_value($1); }
| RVAR { $$ = interface.rvar_value($1); }
| RE '*' { $$ = interface.repetition($1); }
| RE '+' { $$ = interface.repetition2($1); }
| RE '?' { $$ = interface.optional($1); }
| RE RE %prec SEQ { $$ = interface.catenate($1, $2); }
| '!' RE { $$ = interface.negation($2); }
| SWITCH RE { $$ = interface.switch_levels($2); }
| '^' RE { $$ = interface.upper_level($2); }
| '_' RE { $$ = interface.lower_level($2); }
| RE '&' RE { $$ = interface.conjunction($1, $3); }
| RE '-' RE { $$ = interface.subtraction($1, $3); }
| RE '|' RE { $$ = interface.disjunction($1, $3); }
| '(' RE ')' { $$ = $2; }
| STRING { $$ = interface.read_words($1); }
| STRING2 { $$ = interface.read_transducer($1); }
;
RANGES: RANGE RANGES { $$ = interface.add_range($1,$2); }
| { $$ = NULL; }
;
RANGE: '[' VALUES ']' { $$=$2; }
| '[' '^' VALUES ']' { $$=interface.complement_range($3); }
| '[' RSVAR ']' { $$=interface.rsvar_value($2); }
| '.' { $$=NULL; }
| CODE { $$=interface.add_value($1,NULL); }
;
CONTEXTS2: CONTEXTS { $$ = $1; }
| '(' CONTEXTS ')' { $$ = $2; }
;
CONTEXTS: CONTEXT ',' CONTEXTS { $$ = interface.add_context($1,$3); }
| CONTEXT { $$ = $1; }
;
CONTEXT2: CONTEXT { $$ = $1; }
| '(' CONTEXT ')' { $$ = $2; }
;
CONTEXT : RE POS RE { $$ = interface.make_context($1, $3); }
| POS RE { $$ = interface.make_context(NULL, $2); }
| RE POS { $$ = interface.make_context($1, NULL); }
;
VALUES: VALUE VALUES { $$=interface.append_values($1,$2); }
| VALUE { $$ = $1; }
;
VALUE: LCHAR '-' LCHAR { $$=interface.add_values($1,$3,NULL); }
| SVAR { $$=interface.svar_value($1); }
| LCHAR { $$=interface.add_value(interface.character_code($1),NULL); }
| CODE { $$=interface.add_value($1,NULL); }
;
LCHAR: CHARACTER { $$=$1; }
| UTF8CHAR { $$=utf8toint($1); free($1); }
| '.' { $$='.'; }
| '!' { $$='!'; }
| '?' { $$='?'; }
| '{' { $$='{'; }
| '}' { $$='}'; }
| ')' { $$=')'; }
| '(' { $$='('; }
| '&' { $$='&'; }
| '|' { $$='|'; }
| '*' { $$='*'; }
| '+' { $$='+'; }
| ':' { $$=':'; }
| ',' { $$=','; }
| '=' { $$='='; }
| '_' { $$='_'; }
| '^' { $$='^'; }
| '-' { $$='-'; }
;
CODE: CHARACTER { $$=interface.character_code($1); }
| UTF8CHAR { $$=interface.symbol_code($1); }
| SYMBOL { $$=interface.symbol_code($1); }
;
NEWLINES: NEWLINE NEWLINES {}
| /* nothing */ {}
;
%%
extern FILE *yyin;
static int Compact=0;
static int LowMem=0;
/*******************************************************************/
/* */
/* yyerror */
/* */
/*******************************************************************/
void yyerror( const char *text )
{
cerr << "\n" << FileName << ":" << yylineno << ": " << text << " at: ";
cerr << yytext << "\naborted.\n";
exit(1);
}
/*******************************************************************/
/* */
/* warn */
/* */
/*******************************************************************/
void warn( const char *text )
{
if (Verbose)
cerr << "\n";
cerr << FileName << ":" << yylineno << ": warning: " << text << "!\n";
}
/*******************************************************************/
/* */
/* warn2 */
/* */
/*******************************************************************/
void warn2( const char *text, const char *text2)
{
if (Verbose)
cerr << "\n";
cerr << FileName << ":" << yylineno << ": warning: " << text << ": ";
cerr << text2 << "\n";
}
/*******************************************************************/
/* */
/* get_flags */
/* */
/*******************************************************************/
void get_flags( int *argc, char **argv )
{
for( int i=1; i<*argc; i++ ) {
if (strcmp(argv[i],"-c") == 0) {
Compact = 1;
argv[i] = NULL;
}
else if (strcmp(argv[i],"-l") == 0) {
LowMem = 1;
argv[i] = NULL;
}
else if (strcmp(argv[i],"-q") == 0) {
Verbose = 0;
argv[i] = NULL;
}
else if (strcmp(argv[i],"-s") == 0) {
Switch = 1;
argv[i] = NULL;
}
}
// remove flags from the argument list
int k;
for( int i=k=1; i<*argc; i++)
if (argv[i] != NULL)
argv[k++] = argv[i];
*argc = k;
}
/*******************************************************************/
/* */
/* main */
/* */
/*******************************************************************/
int main( int argc, char *argv[] )
{
FILE *file;
get_flags(&argc, argv);
if (argc < 3) {
fprintf(stderr,"\nUsage: %s [options] infile outfile\n", argv[0]);
fprintf(stderr,"\nOPTIONS:\n");
fprintf(stderr,"-c\tStore the transducer in fst-infl2 format.\n");
fprintf(stderr,"-l\tStore the transducer in fst-infl3 format.\n");
fprintf(stderr,"-s\tSwitch the upper and lower levels producing a transducer for generation rather than recognition.\n");
fprintf(stderr,"-q\tquiet mode\n\n");
exit(1);
}
if ((file = fopen(argv[1],"rt")) == NULL) {
fprintf(stderr,"\nError: Cannot open source file \"%s\"\n\n", argv[1]);
exit(1);
}
FileName = argv[1];
Result = NULL;
interface.TheAlphabet.utf8 = UTF8;
interface.Verbose = Verbose;
yyin = file;
try {
yyparse();
Result->alphabet.utf8 = UTF8;
if (Verbose)
cerr << "\n";
if (Result->is_empty())
warn("result transducer is empty");
if ((file = fopen(argv[2],"wb")) == NULL) {
fprintf(stderr,"\nError: Cannot open output file %s\n\n", argv[2]);
exit(1);
}
if (Compact) {
MakeCompactTransducer ca(*Result);
delete Result;
ca.store(file);
}
else if (LowMem)
Result->store_lowmem(file);
else
Result->store(file);
fclose(file);
}
catch(const char* p) {
cerr << "\n" << p << "\n\n";
exit(1);
}
}
src/main/resources/SMOR/src/fst-generate.C 0 → 100755
View file @ 0b611765
/*******************************************************************/
/* */
/* FILE fst-generate.C */
/* MODULE fst-generate */
/* PROGRAM SFST */
/* AUTHOR Helmut Schmid, IMS, University of Stuttgart */
/* */
/*******************************************************************/
#include "fst.h"
using std::cerr;
using namespace SFST;
bool Upper=false;
bool Lower=false;
/*******************************************************************/
/* */
/* usage */
/* */
/*******************************************************************/
void usage()
{
fprintf(stderr,"Usage: fst-generate [Options] file\n");
fprintf(stderr,"\nOptions:\n");
fprintf(stderr,"\t-s: print the surface characters only\n");
fprintf(stderr,"\t-a: print the analysis characters only\n");
fprintf(stderr,"\t-h: print usage information\n\n");
}
/*******************************************************************/
/* */
/* get_flags */
/* */
/*******************************************************************/
void get_flags( int *argc, char **argv )
{
for( int i=1; i<*argc; i++ ) {
if (strcmp(argv[i],"-s") == 0) {
Upper = true;
argv[i] = NULL;
}
else if (strcmp(argv[i],"-a") == 0) {
Lower = true;
argv[i] = NULL;
}
else if (strcmp(argv[i],"-h") == 0 ||
strcmp(argv[i],"-help") == 0 ||
strcmp(argv[i],"-?") == 0)
{
usage();
exit(0);
}
}
// remove flags from the argument list
int k;
for( int i=k=1; i<*argc; i++)
if (argv[i] != NULL)
argv[k++] = argv[i];
*argc = k;
}
/*******************************************************************/
/* */
/* main */
/* */
/*******************************************************************/
int main( int argc, char **argv )
{
FILE *file;
get_flags(&argc, argv);
if (argc == 1)
file = stdin;
else if ((file = fopen(argv[1],"rb")) == NULL) {
fprintf(stderr,"\nError: Cannot open transducer file %s\n\n", argv[1]);
exit(1);
}
try {
Transducer *a2, a(file);
fclose(file);
if (Upper)
a2 = &a.upper_level().minimise();
else if (Lower)
a2 = &a.lower_level().minimise();
else
a2 = &a;
a2->generate(stdout);
}
catch (const char *p) {
cerr << p << "\n";
return 1;
}
return 0;
}
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment