Skip to content

GitLab

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

Initial commit

parents
Show whitespace changes
Inline Side-by-side
Showing with 2708 additions and 0 deletions
src/main/resources/SMOR/src/utf8-scanner.C 0 → 100755
View file @ 0b611765
#line 2 "utf8-scanner.C"
#line 4 "utf8-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 40
#define YY_END_OF_BUFFER 41
/* 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[169] =
{ 0,
0, 0, 4, 4, 41, 36, 31, 33, 36, 23,
36, 36, 36, 9, 36, 36, 23, 36, 36, 23,
23, 23, 40, 40, 40, 40, 31, 36, 9, 36,
4, 40, 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, 37, 0, 0, 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, 38, 0, 0, 0, 0, 0, 9, 7, 9,
0, 6, 0, 26, 0, 24, 0, 0, 39, 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, 47, 47, 47,
47, 47, 47, 47, 47, 47, 47, 47, 47, 47,
47, 47, 47, 47, 47, 47, 47, 47, 47, 47,
47, 47, 47, 47, 47, 47, 47, 47, 47, 47,
47, 47, 47, 47, 47, 47, 47, 47, 47, 47,
47, 47, 47, 47, 47, 47, 47, 47, 47, 47,
47, 47, 47, 47, 47, 47, 47, 47, 47, 47,
47, 48, 48, 48, 48, 48, 48, 48, 48, 48,
48, 48, 48, 48, 48, 48, 48, 48, 48, 48,
48, 48, 48, 48, 48, 48, 48, 48, 48, 48,
48, 48, 48, 49, 49, 49, 49, 49, 49, 49,
49, 49, 49, 49, 49, 49, 49, 49, 49, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50
} ;
static yyconst flex_int32_t yy_meta[51] =
{ 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, 1, 1, 1, 1
} ;
static yyconst flex_int16_t yy_base[183] =
{ 0,
0, 49, 70, 0, 486, 487, 487, 487, 482, 487,
466, 102, 33, 454, 468, 35, 461, 440, 120, 111,
112, 409, 487, 365, 361, 359, 126, 111, 141, 376,
393, 0, 0, 487, 51, 0, 120, 122, 170, 134,
124, 130, 220, 365, 154, 373, 132, 487, 149, 487,
164, 487, 487, 487, 57, 487, 389, 371, 51, 370,
487, 369, 487, 487, 487, 341, 340, 178, 343, 185,
357, 155, 187, 487, 194, 198, 355, 379, 374, 0,
487, 357, 487, 157, 270, 201, 487, 186, 320, 233,
487, 204, 487, 487, 201, 358, 189, 487, 222, 487,
487, 487, 313, 318, 237, 239, 248, 244, 487, 249,
333, 487, 351, 487, 251, 487, 241, 246, 487, 312,
257, 295, 487, 256, 254, 258, 258, 277, 282, 294,
265, 231, 298, 301, 237, 304, 221, 210, 306, 307,
223, 308, 177, 172, 333, 336, 288, 152, 125, 335,
337, 344, 487, 117, 104, 343, 367, 23, 46, 346,
349, 293, 300, 307, 487, 352, 487, 487, 390, 395,
401, 410, 417, 426, 435, 438, 440, 442, 447, 453,
462, 471
} ;
static yyconst flex_int16_t yy_def[183] =
{ 0,
168, 1, 168, 3, 168, 168, 168, 168, 168, 168,
169, 170, 171, 172, 168, 173, 168, 168, 174, 168,
168, 168, 168, 168, 168, 168, 168, 170, 175, 168,
168, 176, 177, 168, 169, 178, 170, 179, 170, 170,
171, 180, 171, 172, 172, 168, 173, 168, 173, 168,
173, 168, 168, 168, 168, 168, 168, 168, 168, 168,
168, 168, 168, 168, 168, 168, 168, 168, 168, 181,
168, 170, 175, 168, 175, 175, 168, 168, 176, 177,
168, 178, 168, 179, 179, 170, 168, 180, 180, 172,
168, 172, 168, 168, 168, 168, 182, 168, 168, 168,
168, 168, 168, 168, 181, 181, 170, 175, 168, 175,
168, 168, 168, 168, 170, 168, 182, 182, 168, 168,
170, 168, 168, 170, 168, 168, 170, 170, 168, 170,
168, 168, 170, 170, 168, 170, 168, 168, 170, 170,
168, 170, 168, 168, 170, 170, 168, 168, 168, 170,
170, 168, 168, 168, 168, 170, 170, 168, 168, 170,
170, 168, 168, 168, 168, 168, 168, 0, 168, 168,
168, 168, 168, 168, 168, 168, 168, 168, 168, 168,
168, 168
} ;
static yyconst flex_int16_t yy_nxt[538] =
{ 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, 24, 25, 26,
27, 42, 48, 49, 50, 28, 81, 29, 95, 56,
96, 43, 163, 51, 162, 97, 99, 99, 168, 30,
23, 31, 23, 23, 23, 32, 23, 23, 23, 23,
23, 33, 33, 33, 33, 33, 33, 23, 23, 23,
33, 33, 33, 33, 33, 33, 33, 33, 23, 23,
33, 33, 33, 33, 33, 33, 33, 33, 33, 33,
33, 33, 33, 33, 23, 23, 23, 23, 23, 23,
38, 55, 56, 57, 60, 62, 83, 68, 83, 38,
39, 87, 69, 58, 70, 59, 59, 87, 40, 39,
83, 61, 63, 74, 75, 159, 71, 40, 39, 168,
85, 50, 43, 72, 158, 90, 91, 92, 89, 155,
51, 83, 39, 114, 47, 47, 168, 47, 94, 76,
37, 37, 86, 37, 37, 37, 37, 51, 37, 68,
37, 37, 45, 39, 69, 85, 70, 74, 106, 74,
75, 56, 118, 116, 154, 107, 74, 75, 71, 108,
109, 110, 95, 56, 96, 149, 91, 83, 148, 97,
47, 47, 47, 47, 89, 76, 37, 37, 37, 37,
41, 41, 76, 41, 41, 41, 76, 41, 41, 39,
41, 41, 45, 115, 90, 91, 92, 99, 99, 74,
106, 74, 106, 56, 118, 108, 109, 110, 56, 118,
147, 109, 75, 144, 83, 126, 143, 83, 126, 126,
141, 45, 83, 83, 83, 138, 41, 41, 41, 41,
84, 84, 76, 84, 84, 84, 39, 76, 84, 39,
84, 84, 121, 83, 39, 39, 39, 131, 124, 152,
127, 131, 133, 132, 164, 165, 128, 132, 130, 137,
83, 166, 167, 135, 83, 39, 153, 83, 164, 165,
83, 134, 83, 83, 83, 129, 84, 84, 84, 84,
88, 88, 39, 88, 88, 88, 39, 136, 88, 39,
88, 88, 39, 139, 39, 39, 39, 145, 142, 83,
146, 83, 83, 83, 140, 152, 125, 164, 165, 83,
166, 167, 83, 166, 167, 83, 123, 122, 120, 119,
56, 39, 153, 39, 39, 39, 88, 88, 88, 88,
151, 39, 156, 83, 39, 150, 113, 39, 157, 112,
78, 111, 77, 161, 160, 104, 103, 102, 101, 100,
98, 56, 93, 45, 78, 39, 35, 35, 35, 37,
37, 77, 37, 37, 41, 67, 41, 66, 41, 41,
44, 65, 44, 44, 44, 44, 44, 44, 44, 47,
47, 47, 47, 47, 47, 47, 54, 54, 54, 54,
54, 54, 54, 54, 54, 73, 73, 73, 73, 73,
73, 73, 73, 73, 79, 79, 80, 80, 82, 82,
84, 84, 84, 64, 84, 84, 88, 88, 88, 53,
88, 88, 105, 105, 105, 105, 105, 105, 105, 105,
105, 117, 117, 117, 117, 117, 117, 117, 117, 117,
52, 46, 45, 36, 34, 168, 5, 168, 168, 168,
168, 168, 168, 168, 168, 168, 168, 168, 168, 168,
168, 168, 168, 168, 168, 168, 168, 168, 168, 168,
168, 168, 168, 168, 168, 168, 168, 168, 168, 168,
168, 168, 168, 168, 168, 168, 168, 168, 168, 168,
168, 168, 168, 168, 168, 168, 168
} ;
static yyconst flex_int16_t yy_chk[538] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
2, 13, 16, 16, 16, 2, 35, 2, 55, 55,
55, 13, 159, 16, 158, 55, 59, 59, 35, 2,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
12, 19, 19, 19, 20, 21, 37, 27, 38, 28,
12, 41, 27, 19, 27, 19, 19, 42, 12, 28,
40, 20, 21, 29, 29, 155, 27, 28, 37, 47,
38, 47, 41, 28, 154, 45, 45, 45, 42, 149,
47, 72, 40, 84, 51, 51, 49, 51, 49, 29,
39, 39, 40, 39, 39, 39, 39, 49, 39, 68,
39, 39, 45, 72, 68, 84, 68, 70, 70, 73,
73, 97, 97, 88, 148, 72, 75, 75, 68, 76,
76, 76, 95, 95, 95, 144, 92, 86, 143, 95,
51, 51, 51, 51, 88, 73, 39, 39, 39, 39,
43, 43, 75, 43, 43, 43, 76, 43, 43, 86,
43, 43, 92, 86, 90, 90, 90, 99, 99, 105,
105, 106, 106, 117, 117, 108, 108, 108, 118, 118,
141, 110, 110, 138, 107, 125, 137, 115, 121, 126,
135, 90, 124, 121, 127, 132, 43, 43, 43, 43,
85, 85, 108, 85, 85, 85, 107, 110, 85, 115,
85, 85, 107, 128, 124, 121, 127, 125, 115, 147,
121, 126, 127, 125, 162, 162, 121, 126, 124, 131,
130, 163, 163, 129, 133, 128, 147, 134, 164, 164,
136, 128, 139, 140, 142, 122, 85, 85, 85, 85,
89, 89, 130, 89, 89, 89, 133, 130, 89, 134,
89, 89, 136, 133, 139, 140, 142, 139, 136, 145,
140, 150, 146, 151, 134, 152, 120, 160, 160, 156,
161, 161, 160, 166, 166, 161, 113, 111, 104, 103,
96, 145, 152, 150, 146, 151, 89, 89, 89, 89,
146, 156, 150, 157, 160, 145, 82, 161, 151, 79,
78, 77, 71, 157, 156, 69, 67, 66, 62, 60,
58, 57, 46, 44, 31, 157, 169, 169, 169, 170,
170, 30, 170, 170, 171, 26, 171, 25, 171, 171,
172, 24, 172, 172, 172, 172, 172, 172, 172, 173,
173, 173, 173, 173, 173, 173, 174, 174, 174, 174,
174, 174, 174, 174, 174, 175, 175, 175, 175, 175,
175, 175, 175, 175, 176, 176, 177, 177, 178, 178,
179, 179, 179, 22, 179, 179, 180, 180, 180, 18,
180, 180, 181, 181, 181, 181, 181, 181, 181, 181,
181, 182, 182, 182, 182, 182, 182, 182, 182, 182,
17, 15, 14, 11, 9, 5, 168, 168, 168, 168,
168, 168, 168, 168, 168, 168, 168, 168, 168, 168,
168, 168, 168, 168, 168, 168, 168, 168, 168, 168,
168, 168, 168, 168, 168, 168, 168, 168, 168, 168,
168, 168, 168, 168, 168, 168, 168, 168, 168, 168,
168, 168, 168, 168, 168, 168, 168
} ;
/* Table of booleans, true if rule could match eol. */
static yyconst flex_int32_t yy_rule_can_match_eol[41] =
{ 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, 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 "utf8-scanner.ll"
/* the "incl" state is used to pick up the name of an include file */
#line 7 "utf8-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=true;
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 709 "utf8-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 "utf8-scanner.ll"
#line 898 "utf8-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 >= 169 )
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 != 168 );
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 "utf8-scanner.ll"
{ Transducer::hopcroft_minimisation = false;};
YY_BREAK
case 2:
/* rule 2 can match eol */
YY_RULE_SETUP
#line 78 "utf8-scanner.ll"
{ Transducer::hopcroft_minimisation = true;};
YY_BREAK
case 3:
YY_RULE_SETUP
#line 80 "utf8-scanner.ll"
BEGIN(incl);
YY_BREAK
case 4:
YY_RULE_SETUP
#line 81 "utf8-scanner.ll"
/* eat the whitespace */
YY_BREAK
case 5:
YY_RULE_SETUP
#line 82 "utf8-scanner.ll"
{ error2("Missing quotes",yytext); }
YY_BREAK
case 6:
YY_RULE_SETUP
#line 83 "utf8-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 "utf8-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 "utf8-scanner.ll"
{ print_lineno(); /* ignore comments */ }
YY_BREAK
case 8:
/* rule 8 can match eol */
YY_RULE_SETUP
#line 124 "utf8-scanner.ll"
{ print_lineno(); /* ignore comments */ }
YY_BREAK
case 9:
YY_RULE_SETUP
#line 126 "utf8-scanner.ll"
{ /* ignore comments */ }
YY_BREAK
case 10:
YY_RULE_SETUP
#line 129 "utf8-scanner.ll"
{ return ALPHA; }
YY_BREAK
case 11:
YY_RULE_SETUP
#line 131 "utf8-scanner.ll"
{ return COMPOSE; }
YY_BREAK
case 12:
YY_RULE_SETUP
#line 132 "utf8-scanner.ll"
{ yylval.type = twol_both; return ARROW; }
YY_BREAK
case 13:
YY_RULE_SETUP
#line 133 "utf8-scanner.ll"
{ yylval.type = twol_right;return ARROW; }
YY_BREAK
case 14:
YY_RULE_SETUP
#line 134 "utf8-scanner.ll"
{ yylval.type = twol_left; return ARROW; }
YY_BREAK
case 15:
YY_RULE_SETUP
#line 135 "utf8-scanner.ll"
{ yylval.rtype = repl_up; return REPLACE; }
YY_BREAK
case 16:
YY_RULE_SETUP
#line 136 "utf8-scanner.ll"
{ yylval.rtype = repl_down; return REPLACE; }
YY_BREAK
case 17:
YY_RULE_SETUP
#line 137 "utf8-scanner.ll"
{ yylval.rtype = repl_right;return REPLACE; }
YY_BREAK
case 18:
YY_RULE_SETUP
#line 138 "utf8-scanner.ll"
{ yylval.rtype = repl_left; return REPLACE; }
YY_BREAK
case 19:
YY_RULE_SETUP
#line 139 "utf8-scanner.ll"
{ return PRINT; }
YY_BREAK
case 20:
YY_RULE_SETUP
#line 140 "utf8-scanner.ll"
{ return INSERT; }
YY_BREAK
case 21:
YY_RULE_SETUP
#line 141 "utf8-scanner.ll"
{ return POS; }
YY_BREAK
case 22:
YY_RULE_SETUP
#line 142 "utf8-scanner.ll"
{ return SWITCH; }
YY_BREAK
case 23:
YY_RULE_SETUP
#line 144 "utf8-scanner.ll"
{ return yytext[0]; }
YY_BREAK
case 24:
YY_RULE_SETUP
#line 146 "utf8-scanner.ll"
{ yylval.name = fst_strdup(yytext); return RVAR; }
YY_BREAK
case 25:
YY_RULE_SETUP
#line 148 "utf8-scanner.ll"
{ yylval.name = fst_strdup(yytext); return VAR; }
YY_BREAK
case 26:
YY_RULE_SETUP
#line 150 "utf8-scanner.ll"
{ yylval.name = fst_strdup(yytext); return RSVAR; }
YY_BREAK
case 27:
YY_RULE_SETUP
#line 152 "utf8-scanner.ll"
{ yylval.name = fst_strdup(yytext); return SVAR; }
YY_BREAK
case 28:
YY_RULE_SETUP
#line 154 "utf8-scanner.ll"
{ yylval.name = unquote(yytext,false); return SYMBOL; }
YY_BREAK
case 29:
YY_RULE_SETUP
#line 156 "utf8-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 "utf8-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 "utf8-scanner.ll"
{ /* ignored */ }
YY_BREAK
case 32:
/* rule 32 can match eol */
YY_RULE_SETUP
#line 169 "utf8-scanner.ll"
{ print_lineno(); /* ignored */ }
YY_BREAK
case 33:
/* rule 33 can match eol */
YY_RULE_SETUP
#line 170 "utf8-scanner.ll"
{ print_lineno(); return NEWLINE; }
YY_BREAK
case 34:
YY_RULE_SETUP
#line 172 "utf8-scanner.ll"
{ long l=atol(yytext+1);
if (l <= 1114112) { yylval.value=fst_strdup(int2utf8((unsigned)l)); return UTF8CHAR; }
yyerror("invalid expression");
}
YY_BREAK
case 35:
YY_RULE_SETUP
#line 178 "utf8-scanner.ll"
{ yylval.value=fst_strdup(yytext+1); return UTF8CHAR; }
YY_BREAK
case 36:
/* rule 36 can match eol */
YY_RULE_SETUP
#line 179 "utf8-scanner.ll"
{ yylval.value=fst_strdup(yytext); return UTF8CHAR; }
YY_BREAK
case 37:
YY_RULE_SETUP
#line 180 "utf8-scanner.ll"
{ yylval.value=fst_strdup(yytext); return UTF8CHAR; }
YY_BREAK
case 38:
YY_RULE_SETUP
#line 181 "utf8-scanner.ll"
{ yylval.value=fst_strdup(yytext); return UTF8CHAR; }
YY_BREAK
case 39:
YY_RULE_SETUP
#line 182 "utf8-scanner.ll"
{ yylval.value=fst_strdup(yytext); return UTF8CHAR; }
YY_BREAK
case 40:
YY_RULE_SETUP
#line 184 "utf8-scanner.ll"
ECHO;
YY_BREAK
#line 1246 "utf8-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 >= 169 )
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 >= 169 )
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 == 168);
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 184 "utf8-scanner.ll"
src/main/resources/SMOR/src/utf8-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=true;
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 <= 1114112) { yylval.value=fst_strdup(int2utf8((unsigned)l)); return UTF8CHAR; }
yyerror("invalid expression");
}
\\. { yylval.value=fst_strdup(yytext+1); return UTF8CHAR; }
[\x00-\x7f] { yylval.value=fst_strdup(yytext); return UTF8CHAR; }
[\xc0-\xdf]{CC} { yylval.value=fst_strdup(yytext); return UTF8CHAR; }
[\xe0-\xef]{CC}{2} { yylval.value=fst_strdup(yytext); return UTF8CHAR; }
[\xf0-\xff]{CC}{3} { yylval.value=fst_strdup(yytext); return UTF8CHAR; }
%%
src/main/resources/SMOR/src/utf8.C 0 → 100755
View file @ 0b611765
/*******************************************************************/
/* */
/* File: utf8.C */
/* Author: Helmut Schmid */
/* Purpose: */
/* Created: Mon Sep 5 17:49:16 2005 */
/* Modified: Wed Sep 29 15:08:34 2010 (schmid) */
/* */
/*******************************************************************/
#include "string.h"
#include "utf8.h"
namespace SFST {
const unsigned char get3LSbits=7;
const unsigned char get4LSbits=15;
const unsigned char get5LSbits=31;
const unsigned char get6LSbits=63;
const unsigned char set1MSbits=128;
const unsigned char set2MSbits=192;
const unsigned char set3MSbits=224;
const unsigned char set4MSbits=240;
/*******************************************************************/
/* */
/* int2utf8 */
/* */
/*******************************************************************/
char *int2utf8( unsigned int sym )
{
static unsigned char ch[5];
if (sym < 128) {
// 1-byte UTF8 symbol, 7 bits
ch[0] = (unsigned char)sym;
ch[1] = 0;
}
else if (sym < 2048) {
// 2-byte UTF8 symbol, 5+6 bits
ch[0] = (unsigned char)((sym >> 6) | set2MSbits);
ch[1] = (unsigned char)((sym & get6LSbits) | set1MSbits);
ch[2] = 0;
}
else if (sym < 65536) {
// 3-byte UTF8 symbol, 4+6+6 bits
ch[0] = (unsigned char)((sym >> 12) | set3MSbits);
ch[1] = (unsigned char)(((sym >> 6) & get6LSbits) | set1MSbits);
ch[2] = (unsigned char)((sym & get6LSbits) | set1MSbits);
ch[3] = 0;
}
else if (sym < 2097152) {
// 4-byte UTF8 symbol, 3+6+6+6 bits
ch[0] = (unsigned char)((sym >> 18) | set4MSbits);
ch[1] = (unsigned char)(((sym >> 12) & get6LSbits) | set1MSbits);
ch[2] = (unsigned char)(((sym >> 6) & get6LSbits) | set1MSbits);
ch[3] = (unsigned char)((sym & get6LSbits) | set1MSbits);
ch[4] = 0;
}
else
return NULL;
return (char*)ch;
}
/*******************************************************************/
/* */
/* utf8toint */
/* */
/*******************************************************************/
unsigned int utf8toint( char **s )
{
int bytes_to_come;
unsigned int result=0;
unsigned char c=(unsigned char)**s;
if (c >= (unsigned char)set4MSbits) { // 1111xxxx
bytes_to_come = 3;
result = (result << 3) | (c & get3LSbits);
}
else if (c >= (unsigned char) set3MSbits) { // 1110xxxx
// start of a three-byte symbol
bytes_to_come = 2;
result = (result << 4) | (c & get4LSbits);
}
else if (c >= (unsigned char) set2MSbits) { // 1100xxxx
// start of a two-byte symbol
bytes_to_come = 1;
result = (result << 5) | (c & get5LSbits);
}
else if (c < (unsigned char) set1MSbits) { // 0100xxxx
// one-byte symbol
bytes_to_come = 0;
result = c;
}
else
return 0; // error
while (bytes_to_come > 0) {
bytes_to_come--;
(*s)++;
c = (unsigned char)**s;
if (c < (unsigned char) set2MSbits &&
c >= (unsigned char) set1MSbits) // 1000xxxx
{
result = (result << 6) | (c & get6LSbits);
}
else
return 0;
}
(*s)++;
return result;
}
/*******************************************************************/
/* */
/* utf8toint */
/* */
/*******************************************************************/
unsigned int utf8toint( char *s )
{
unsigned int result = utf8toint( &s );
if (*s == 0) // all bytes converted?
return result;
return 0;
}
}
src/main/resources/SMOR/src/utf8.h 0 → 100755
View file @ 0b611765
/*******************************************************************/
/* */
/* File: utf8.h */
/* Author: Helmut Schmid */
/* Purpose: */
/* Created: Mon Sep 5 17:49:16 2005 */
/* Modified: Mon Apr 7 08:26:39 2008 (schmid) */
/* */
/*******************************************************************/
#ifndef _UTF8_H_
#define _UTF8_H_
namespace SFST {
unsigned int utf8toint( char *s );
unsigned int utf8toint( char **s );
char *int2utf8( unsigned int );
}
#endif
src/test/resources/results/compounds_with_hyphens_from_118719_to_118819.txt 0 → 100644
View file @ 0b611765
IT-Lösung 118801 IT Lösung GN: compound with hypen(s)
src/test/resources/results/compounds_without_hyphens__from_118719_to_118819.txt 0 → 100644
View file @ 0b611765
Ziegenbart 118719 Ziege Bart SMOR, GN, and ASV agree; SMOR: only one binary result: Ziege<NN> Bart<+NN>
Wirtschafterin 118721 \N \N SMOR, GN and ASV are null; Compound induced, but not splitted \N \N \N \N \N \N \N \N ASV: is not correctly splitted: [Wirtschaft, erin]
Windröschen 118722 Wind Röschen SMOR, GN, and ASV agree; SMOR: only one binary result: Wind<NN> Röschen<NN>
Ziegenbart 118725 Ziege Bart SMOR, GN, and ASV agree; SMOR: only one binary result: Ziege<NN> Bart<+NN>
Aschewolke 118726 Asche Wolke SMOR, GN, and ASV agree; SMOR: only one binary result: Asche<NN> Wolke<+NN>
Tonkopf 118728 Ton Kopf GN and ASV agree, SMOR is null; GN: 1 complete match
Wirtschafterin 118729 \N \N SMOR, GN and ASV are null; Compound induced, but not splitted \N \N \N \N \N \N \N \N ASV: is not correctly splitted: [Wirtschaft, erin]
Wichtelmännchen 118732 Wichtel Männchen SMOR, GN, and ASV agree; SMOR: only one binary result: Wichtel<NN> Männchen<NN>
Hürdensprint 118733 Hürde Sprint SMOR, GN, and ASV agree; SMOR: only one binary result: Hürde<NN> Sprint<+NN>
Puppenstadium 118734 Puppe Stadium SMOR, GN, and ASV agree; SMOR: only one binary result: Puppe<NN> Stadium<+NN>
Zinkblech 118735 Zink Blech SMOR, GN, and ASV agree; SMOR: only one binary result: Zink<NN> Blech<+NN>
Weltbestleistung 118736 Welt Bestleistung GN and ASV agree, SMOR is null; GN: 1 complete match
Wasserschutz 118738 Wasser Schutz SMOR, GN, and ASV agree; SMOR: only one binary result: Wasser<NN> Schutz<+NN>
Wasserschutz 118739 Wasser Schutz SMOR, GN, and ASV agree; SMOR: only one binary result: Wasser<NN> Schutz<+NN>
Wahlhilfe 118742 Wahl Hilfe SMOR, GN, and ASV agree; SMOR: only one binary result: Wahl<NN> Hilfe<+NN>
Knöchelchen 118746 \N \N SMOR, GN and ASV are null; Compound induced, but not splitted \N \N \N \N \N \N \N \N ASV: is not correctly splitted: [Knöchel, chen]
Schildbürger 118756 Schild Bürger SMOR, GN, and ASV agree; SMOR: only one binary result: Schild<NN> Bürger<+NN>
Schildbürgerin 118757 Schild Bürgerin SMOR and GN agree, ASV is null; SMOR: only one binary result: Schild<NN> Bürgerin<+NN>
Schlechtwetter 118758 schlecht Wetter GN and ASV agree, SMOR is null; GN: complete match with modifier small case
Knochenhaut 118760 Knochen Haut SMOR, GN, and ASV agree; SMOR: only one binary result: Knochen<NN> Haut<+NN>
Straßenverkehrsrecht 118761 Straßenverkehr Recht SMOR, GN, and ASV agree; SMOR: only one binary result: Straßenverkehr<NN> Recht<+NN>
Offizierskasino 118763 Offizier Kasino SMOR, GN, and ASV agree; SMOR: only one binary result: Offizier<NN> Kasino<+NN>
Sinusitis 118764 \N \N SMOR, GN and ASV are null; Compound induced, but not splitted \N \N \N \N \N \N \N \N ASV: is not correctly splitted: [Sinus, itis]
Helferlein 118765 Helfer Lein GN and ASV agree, SMOR is null; GN: 1 complete match
Rammsporn 118767 rammen Sporn SMOR and ASV do not agree, GN is null; SMOR: only one binary result: rammen<V> Sporn<+NN>
Schwangerschaftsmonat 118768 Schwangerschaft Monat SMOR, GN, and ASV agree; SMOR: only one binary result: Schwangerschaft<NN> Monat<+NN>
Erdschatten 118769 Erde Schatten SMOR and GN do not agree, ASV is null; SMOR: only one binary result: Erde<NN> Schatten<+NN>
Flankenangriff 118770 Flanke Angriff SMOR, GN, and ASV agree; SMOR: only one binary result: Flanke<NN> Angriff<+NN>
Regierungsbeschluss 118771 Regierung Beschluss SMOR, GN, and ASV agree; SMOR: only one binary result: Regierung<NN> Beschluss<+NN>
Pfarrerstochter 118773 Pfarrer Tochter SMOR, GN, and ASV agree; SMOR: only one binary result: Pfarrer<NN> Tochter<+NN>
Beratungsangebot 118774 Beratung Angebot SMOR, GN, and ASV agree; SMOR: only one binary result: Beratung<NN> Angebot<+NN>
Zeichenkunst 118775 Zeichen Kunst SMOR and GN agree, ASV is null; SMOR: only one binary result: Zeichen<NN> Kunst<+NN>
Fischereiflotte 118776 Fischerei Flotte SMOR, GN, and ASV agree; SMOR: only one binary result: Fischerei<NN> Flotte<+NN>
Naturfarbe 118777 Natur Farbe SMOR, GN, and ASV agree; SMOR: only one binary result: Natur<NN> Farbe<+NN>
Naturfarbe 118778 Natur Farbe SMOR, GN, and ASV agree; SMOR: only one binary result: Natur<NN> Farbe<+NN>
Wohnungsbauprogramm 118782 Wohnungsbau Programm SMOR and ASV are null; GN: 1 complete match
Eisstausee 118785 Eis Stausee GN and ASV agree, SMOR is null; GN: 1 complete match
Zigarettenrauch 118786 Zigarette Rauch SMOR, GN, and ASV agree; SMOR: only one binary result: Zigarette<NN> Rauch<+NN>
Glassorte 118787 Glas Sorte SMOR, GN, and ASV agree; SMOR: only one binary result: Glas<NN> Sorte<+NN>
Schülerheim 118789 Schüler Heim SMOR, GN, and ASV agree; SMOR: only one binary result: Schüler<NN> Heim<+NN>
Dampfmotor 118790 Dampf Motor SMOR, GN, and ASV agree; SMOR: only one binary result: Dampf<NN> Motor<+NN>
Hauptmieter 118791 haupt Mieter SMOR, GN, and ASV agree; SMOR: only one binary result: Haupt<NN> Mieter<+NN>
Hauptmieterin 118792 haupt Mieterin SMOR, GN, and ASV agree; SMOR: only one binary result: Haupt<NN> Mieterin<+NN>
Ehrenwache 118793 ehren Wache GN and ASV agree, SMOR not; SMOR: only one binary result: ehren<V><NN><SUFF> Wache<+NN>
Ehrenwache 118794 ehren Wache GN and ASV agree, SMOR not; SMOR: only one binary result: ehren<V><NN><SUFF> Wache<+NN>
Jubeljahr 118795 Jubel Jahr SMOR, GN, and ASV agree; SMOR: only one binary result: Jubel<NN> Jahr<+NN>
Bahnschranke 118796 Bahn Schranke SMOR, GN, and ASV agree; SMOR: head is hypernym: Bahn<NN> Schranke<+NN>
Autogrammstunde 118797 Autogramm Stunde GN and ASV agree, SMOR is null; GN: 1 complete match
Kernspin 118802 Kern Spin SMOR, GN, and ASV agree; SMOR: only one binary result: Kern<NN> Spin<+NN>
Gaszelle 118804 Gas Zelle SMOR, GN, and ASV agree; SMOR: only one binary result: Gas<NN> Zelle<+NN>
Doppelherrschaft 118805 doppelt Herrschaft GN and ASV agree, SMOR not; GN: 1 complete match
Faserstoff 118807 Faser Stoff SMOR, GN, and ASV agree; SMOR: only one binary result: Faser<NN> Stoff<+NN>
Tonbridge 118808 Ton Bridge GN and ASV agree, SMOR is null; GN: 1 complete match
Pallottinerin 118810 \N \N SMOR, GN and ASV are null; Compound induced, but not splitted \N \N \N \N \N \N \N \N ASV: is not correctly splitted: [Pallottin, erin]
Kinderarmut 118811 Kind Armut SMOR, GN, and ASV agree; SMOR: only one binary result: Kind<NN> Armut<+NN>
Laserwaffe 118812 Laser Waffe SMOR, GN, and ASV agree; SMOR: only one binary result: Laser<NN> Waffe<+NN>
Kinderhaus 118814 Kind Haus SMOR, GN, and ASV agree; SMOR: only one binary result: Kind<NN> Haus<+NN>
Wasserpistole 118815 Wasser Pistole SMOR, GN, and ASV agree; SMOR: only one binary result: Wasser<NN> Pistole<+NN>
Schnellfeuergewehr 118817 Schnellfeuer Gewehr SMOR, GN, and ASV agree; SMOR: only one binary result: Schnellfeuer<NN> Gewehr<+NN>
Schallplattenproduktion 118818 Schallplatte Produktion SMOR and ASV agree, GN not; SMOR: only one binary result: Schallplatte<NN> Produktion<+NN>
src/test/resources/results/non_compounds_from_118719_to_118819.txt 0 → 100644
View file @ 0b611765
np Wirtschafter 118720 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Wender 118723 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Welter 118724 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Wirtschafter 118727 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Wicht 118730 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Wicht 118731 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Waid 118741 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Vorleger 118743 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Vorkauf 118744 \N \N SMOR and ASV are null; No compound induced \N \N \N Vor Kauf GN: head is hypernym \N \N \N
np Völle 118745 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Knöllchen 118747 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Koka 118748 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Kraul 118749 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Krupp 118750 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Saudi 118751 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Schäfchen 118752 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Schänder 118753 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Schänderin 118754 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Kimm 118762 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Troas 118766 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Pastiche 118772 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Heuler 118779 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Heuler 118780 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Heuler 118781 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Ethnograf 118788 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Vorverstärker 118798 \N \N SMOR and ASV are null; No compound induced \N \N \N Vor Verstärker GN: head is hypernym \N \N \N
np Kolani 118800 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Adduktion 118803 \N \N SMOR, GN and ASV are null; noun ends with '-keit'/'-heit'; No compound induced \N \N \N \N \N \N \N \N \N
np Revanchismus 118806 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Pallottiner 118809 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Kombüse 118813 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
np Ausgasung 118816 \N \N SMOR, GN and ASV are null; noun ends with '-keit'/'-heit'; No compound induced \N \N \N \N \N \N \N \N \N
np Gischt 118819 \N \N SMOR, GN and ASV are null; No compound induced \N \N \N \N \N \N \N \N \N
src/test/resources/results/tmp/all_nouns_in_germanet.txt 0 → 100644
View file @ 0b611765
This source diff could not be displayed because it is too large. You can view the blob instead.
src/test/resources/results/tmp/smor_results_latin1.out 0 → 100644
View file @ 0b611765
This source diff could not be displayed because it is too large. You can view the blob instead.
src/test/resources/results/tmp/smor_results_utf8.out 0 → 100644
View file @ 0b611765
This source diff could not be displayed because it is too large. You can view the blob instead.
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