TDE
/
tdelibs
mirror of https://mirror.git.trinitydesktop.org/gitea/TDE/tdelibs
0
0
Fork 0
Code Issues Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '1e9fe867b0'
${ noResults }
tdelibs/dcop/dcopidl/scanner.cc

2509 lines
70 KiB
Raw Normal View History Unescape

Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. BUG:215923 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
15 years ago
#line 2 "scanner.cc"
/* A lexical scanner generated by flex */
/* Scanner skeleton version:
* $Header$
*/
#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 5
#include <stdio.h>
/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */
#ifdef c_plusplus
#ifndef __cplusplus
#define __cplusplus
#endif
#endif
#ifdef __cplusplus
#include <stdlib.h>
#include <unistd.h>
/* Use prototypes in function declarations. */
#define YY_USE_PROTOS
/* The "const" storage-class-modifier is valid. */
#define YY_USE_CONST
#else /* ! __cplusplus */
#if __STDC__
#define YY_USE_PROTOS
#define YY_USE_CONST
#endif /* __STDC__ */
#endif /* ! __cplusplus */
#ifdef __TURBOC__
#pragma warn -rch
#pragma warn -use
#include <io.h>
#include <stdlib.h>
#define YY_USE_CONST
#define YY_USE_PROTOS
#endif
#ifdef YY_USE_CONST
#define yyconst const
#else
#define yyconst
#endif
#ifdef YY_USE_PROTOS
#define YY_PROTO(proto) proto
#else
#define YY_PROTO(proto) ()
#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. */
#define YY_BUF_SIZE 16384
typedef struct yy_buffer_state *YY_BUFFER_STATE;
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
/* The funky do-while in the following #define is used to turn the definition
* int a single C statement (which needs a semi-colon terminator). This
* avoids problems with code like:
*
* if ( condition_holds )
* yyless( 5 );
* else
* do_something_else();
*
* Prior to using the do-while the compiler would get upset at the
* "else" because it interpreted the "if" statement as being all
* done when it reached the ';' after the yyless() call.
*/
/* Return all but the first 'n' matched characters back to the input stream. */
#define yyless(n) \
do \
{ \
/* Undo effects of setting up yytext. */ \
*yy_cp = yy_hold_char; \
YY_RESTORE_YY_MORE_OFFSET \
yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \
YY_DO_BEFORE_ACTION; /* set up yytext again */ \
} \
while ( 0 )
#define unput(c) yyunput( c, yytext_ptr )
/* The following is because we cannot portably get our hands on size_t
* (without autoconf's help, which isn't available because we want
* flex-generated scanners to compile on their own).
*/
typedef unsigned int yy_size_t;
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;
/* 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
};
static YY_BUFFER_STATE yy_current_buffer = 0;
/* 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".
*/
#define YY_CURRENT_BUFFER yy_current_buffer
/* 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 = 1; /* 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 YY_PROTO(( FILE *input_file ));
void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer ));
void yy_load_buffer_state YY_PROTO(( void ));
YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size ));
void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b ));
void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file ));
void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b ));
#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer )
YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size ));
YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str ));
YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len ));
static void *yy_flex_alloc YY_PROTO(( yy_size_t ));
static void *yy_flex_realloc YY_PROTO(( void *, yy_size_t ));
static void yy_flex_free YY_PROTO(( void * ));
#define yy_new_buffer yy_create_buffer
#define yy_set_interactive(is_interactive) \
{ \
if ( ! yy_current_buffer ) \
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
yy_current_buffer->yy_is_interactive = is_interactive; \
}
#define yy_set_bol(at_bol) \
{ \
if ( ! yy_current_buffer ) \
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
yy_current_buffer->yy_at_bol = at_bol; \
}
#define YY_AT_BOL() (yy_current_buffer->yy_at_bol)
#define YY_USES_REJECT
#define yywrap() 1
#define YY_SKIP_YYWRAP
typedef unsigned char YY_CHAR;
FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
typedef int yy_state_type;
extern char *yytext;
#define yytext_ptr yytext
static yy_state_type yy_get_previous_state YY_PROTO(( void ));
static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state ));
static int yy_get_next_buffer YY_PROTO(( void ));
static void yy_fatal_error YY_PROTO(( 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 = (int) (yy_cp - yy_bp); \
yy_hold_char = *yy_cp; \
*yy_cp = '\0'; \
yy_c_buf_p = yy_cp;
#define YY_NUM_RULES 83
#define YY_END_OF_BUFFER 84
static yyconst short int yy_acclist[655] =
{ 0,
6, 6, 84, 6, 82, 83, 1, 6, 82, 83,
2, 83, 6, 82, 83, 6, 82, 83, 6, 82,
83, 6, 23, 82, 83, 6, 82, 83, 6, 14,
82, 83, 6, 15, 82, 83, 7, 21, 82, 83,
6, 17, 82, 83, 6, 20, 82, 83, 6, 18,
82, 83, 6, 28, 82, 83, 6, 82, 83, 6,
68, 78, 82, 83, 6, 77, 82, 83, 6, 16,
82, 83, 6, 22, 82, 83, 6, 24, 82, 83,
6, 27, 82, 83, 6, 25, 82, 83, 6, 71,
82, 83, 6, 71, 82, 83, 6, 71, 82, 83,
6, 71, 82, 83, 6, 71, 82, 83, 6, 30,
82, 83, 6, 31, 82, 83, 6, 71, 82, 83,
6, 71, 82, 83, 6, 71, 82, 83, 6, 71,
82, 83, 6, 71, 82, 83, 6, 71, 82, 83,
6, 71, 82, 83, 6, 71, 82, 83, 6, 71,
82, 83, 6, 71, 82, 83, 6, 71, 82, 83,
6, 71, 82, 83, 6, 71, 82, 83, 6, 71,
82, 83, 6, 71, 82, 83, 6, 12, 82, 83,
5, 13, 82, 83, 6, 19, 82, 83, 6, 6,
34, 6, 6, 81, 6, 6, 11, 6, 9, 6,
6, 6, 4, 6, 32, 6, 6, 75, 3, 6,
8, 6, 6, 78, 6, 6, 6, 68, 6, 79,
6, 77, 6, 77, 6, 26, 6, 33, 6, 71,
6, 71, 6, 71, 6, 71, 6, 71, 6, 71,
6, 71, 6, 71, 6, 71, 6, 71, 6, 71,
6, 71, 6, 71, 6, 71, 6, 71, 6, 71,
6, 71, 6, 71, 6, 71, 6, 71, 6, 71,
6, 71, 6, 71, 6, 71, 6, 71, 6, 71,
6, 71, 6, 71, 6, 71, 6, 71, 81, 6,
6, 6, 9, 9, 6, 6, 80, 80, 6, 80,
6, 6, 6, 29, 6, 6, 8, 8, 6, 74,
6, 6, 73, 6, 79, 6, 71, 6, 71, 6,
71, 6, 71, 6, 71, 6, 71, 6, 71, 6,
71, 6, 71, 6, 71, 6, 71, 6, 71, 6,
58, 71, 6, 71, 6, 71, 6, 71, 6, 71,
6, 71, 6, 71, 6, 71, 6, 71, 6, 71,
6, 71, 6, 71, 6, 71, 6, 71, 6, 71,
6, 71, 6, 71, 6, 71, 6, 71, 6, 71,
6, 6, 6, 6, 6, 6, 6, 76, 6, 6,
71, 6, 71, 6, 71, 6, 61, 71, 6, 59,
71, 6, 71, 6, 71, 6, 36, 71, 6, 71,
6, 71, 6, 71, 6, 71, 6, 71, 6, 50,
71, 6, 71, 6, 71, 6, 71, 6, 71, 6,
71, 6, 71, 6, 71, 6, 71, 6, 71, 6,
71, 6, 71, 6, 71, 6, 57, 71, 6, 71,
6, 71, 6, 71, 6, 71, 6, 6, 6, 6,
6, 6, 72, 6, 62, 71, 6, 71, 6, 71,
6, 39, 71, 6, 35, 71, 6, 71, 6, 60,
71, 6, 71, 6, 71, 6, 71, 6, 71, 6,
71, 6, 71, 6, 71, 6, 71, 6, 71, 6,
71, 6, 49, 71, 6, 71, 6, 71, 6, 56,
71, 6, 71, 6, 71, 6, 71, 6, 71, 6,
38, 71, 6, 71, 6, 6, 66, 71, 6, 71,
6, 71, 6, 51, 71, 6, 44, 71, 6, 63,
71, 6, 71, 6, 71, 6, 71, 6, 71, 6,
71, 6, 43, 71, 6, 55, 71, 6, 71, 6,
47, 71, 6, 45, 71, 6, 40, 71, 6, 71,
6, 71, 6, 71, 6, 6, 71, 6, 6, 71,
6, 46, 71, 6, 71, 6, 71, 6, 53, 71,
6, 71, 6, 54, 71, 6, 65, 71, 6, 71,
6, 42, 71, 6, 6, 67, 71, 6, 69, 6,
69, 6, 71, 6, 71, 6, 41, 71, 6, 71,
6, 48, 71, 6, 6, 6, 6, 71, 6, 37,
71, 6, 52, 71, 6, 11, 6, 6, 70, 6,
71, 10, 11, 6, 6, 71, 10, 6, 71, 6,
71, 6, 64, 71
} ;
static yyconst short int yy_accept[312] =
{ 0,
1, 2, 3, 4, 7, 11, 13, 16, 19, 22,
26, 29, 33, 37, 41, 45, 49, 53, 57, 60,
65, 69, 73, 77, 81, 85, 89, 93, 97, 101,
105, 109, 113, 117, 121, 125, 129, 133, 137, 141,
145, 149, 153, 157, 161, 165, 169, 173, 177, 181,
185, 189, 190, 192, 193, 195, 195, 196, 197, 198,
200, 200, 201, 202, 202, 203, 204, 206, 207, 209,
210, 212, 213, 215, 216, 217, 219, 221, 223, 225,
227, 229, 231, 233, 235, 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, 289, 290, 290, 291, 292, 294, 295, 296, 298,
299, 301, 302, 303, 305, 306, 308, 309, 311, 312,
314, 316, 318, 320, 322, 324, 326, 328, 330, 332,
334, 336, 338, 340, 343, 345, 347, 349, 351, 353,
355, 357, 359, 361, 363, 365, 367, 369, 371, 373,
375, 377, 379, 381, 381, 381, 382, 383, 384, 385,
386, 387, 389, 390, 392, 394, 396, 399, 402, 404,
406, 409, 411, 413, 415, 417, 419, 422, 424, 426,
428, 430, 432, 434, 436, 438, 440, 442, 444, 446,
449, 451, 453, 455, 457, 457, 457, 458, 459, 460,
461, 462, 464, 467, 469, 471, 474, 477, 479, 482,
484, 486, 488, 490, 492, 494, 496, 498, 500, 502,
505, 507, 509, 512, 514, 516, 518, 520, 523, 525,
525, 525, 526, 529, 531, 533, 536, 539, 542, 544,
546, 548, 550, 552, 555, 558, 560, 563, 566, 569,
571, 573, 575, 576, 578, 579, 581, 584, 586, 588,
591, 593, 596, 599, 601, 604, 605, 608, 610, 611,
612, 614, 616, 619, 621, 624, 625, 626, 627, 629,
632, 635, 636, 637, 638, 638, 640, 642, 642, 642,
644, 645, 645, 647, 648, 648, 648, 650, 652, 655,
655
} ;
static yyconst int yy_ec[256] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 4, 5, 6, 7, 1, 1, 8, 9, 10,
11, 12, 13, 14, 15, 16, 17, 18, 19, 19,
19, 19, 19, 19, 19, 20, 20, 21, 22, 23,
24, 25, 26, 1, 27, 28, 29, 30, 31, 32,
33, 33, 33, 34, 35, 36, 33, 33, 37, 38,
39, 40, 41, 42, 43, 33, 33, 44, 33, 33,
45, 46, 47, 1, 48, 1, 49, 50, 51, 52,
53, 54, 55, 56, 57, 33, 58, 59, 60, 61,
62, 63, 33, 64, 65, 66, 67, 68, 33, 69,
70, 33, 71, 1, 72, 73, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1
} ;
static yyconst int yy_meta[74] =
{ 0,
1, 2, 3, 4, 1, 5, 1, 1, 5, 1,
1, 6, 1, 1, 1, 1, 1, 7, 7, 8,
1, 1, 1, 1, 1, 5, 8, 8, 8, 8,
8, 8, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 9, 1, 5, 1, 4, 7, 7,
8, 8, 8, 7, 4, 4, 4, 4, 4, 4,
9, 4, 4, 9, 4, 9, 4, 9, 9, 4,
1, 10, 1
} ;
static yyconst short int yy_base[329] =
{ 0,
0, 0, 904, 0, 0, 1106, 879, 72, 74, 0,
73, 0, 0, 885, 0, 0, 876, 71, 64, 79,
85, 879, 0, 69, 874, 82, 148, 221, 61, 69,
73, 0, 0, 81, 53, 75, 67, 85, 98, 84,
93, 103, 114, 148, 120, 140, 141, 155, 0, 1106,
0, 0, 0, 178, 0, 193, 289, 124, 1106, 180,
887, 188, 880, 879, 353, 1106, 0, 858, 238, 1106,
117, 189, 243, 257, 198, 0, 405, 266, 0, 0,
0, 846, 99, 158, 160, 171, 206, 238, 193, 213,
224, 244, 226, 245, 237, 251, 243, 254, 188, 266,
272, 252, 274, 279, 278, 297, 289, 286, 298, 273,
290, 1106, 308, 372, 442, 317, 869, 329, 0, 1106,
860, 351, 479, 0, 368, 332, 0, 374, 346, 390,
0, 304, 176, 320, 369, 348, 341, 346, 355, 386,
399, 389, 294, 840, 401, 340, 349, 393, 402, 411,
414, 404, 416, 403, 420, 418, 421, 422, 423, 424,
448, 441, 438, 494, 0, 532, 603, 511, 506, 667,
498, 501, 528, 451, 499, 508, 839, 838, 474, 461,
837, 426, 510, 495, 518, 522, 836, 525, 526, 527,
528, 532, 530, 531, 533, 537, 535, 539, 538, 835,
540, 542, 546, 541, 592, 716, 600, 601, 569, 852,
598, 606, 832, 544, 612, 831, 830, 553, 829, 567,
610, 566, 561, 601, 600, 613, 617, 618, 621, 827,
615, 631, 824, 633, 623, 624, 632, 820, 643, 655,
656, 678, 813, 638, 676, 807, 805, 661, 651, 664,
644, 673, 683, 797, 763, 687, 762, 756, 732, 678,
680, 681, 725, 685, 797, 688, 715, 704, 696, 697,
698, 547, 534, 702, 476, 769, 459, 870, 456, 0,
684, 711, 413, 730, 358, 825, 774, 336, 729, 310,
107, 827, 733, 773, 790, 0, 734, 810, 760, 1106,
788, 771, 752, 1106, 784, 785, 767, 790, 56, 1106,
943, 952, 962, 972, 982, 991, 1001, 1011, 1021, 1027,
1036, 1046, 1050, 1058, 1066, 1075, 1085, 1095
} ;
static yyconst short int yy_def[329] =
{ 0,
310, 1, 310, 311, 311, 310, 311, 312, 313, 311,
314, 311, 311, 310, 311, 311, 311, 311, 311, 311,
311, 311, 311, 311, 311, 311, 315, 315, 28, 28,
28, 311, 311, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 311, 310,
311, 311, 311, 312, 311, 316, 311, 313, 310, 317,
318, 313, 311, 310, 311, 310, 311, 311, 311, 310,
319, 311, 311, 311, 311, 311, 311, 311, 311, 311,
311, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 310, 320, 312, 311, 317, 321, 313, 311, 310,
311, 311, 311, 311, 311, 319, 322, 311, 311, 311,
77, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 316, 323, 312, 312, 313, 311, 311,
311, 311, 311, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 316, 316, 312, 312, 313, 311,
311, 311, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 316,
316, 313, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 313, 28, 324, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 313, 28, 324, 311, 325,
28, 28, 28, 28, 28, 313, 326, 311, 28, 28,
28, 326, 327, 313, 328, 311, 28, 327, 310, 310,
313, 318, 28, 310, 310, 318, 28, 28, 28, 0,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310
} ;
static yyconst short int yy_nxt[1180] =
{ 0,
4, 5, 6, 5, 7, 8, 9, 10, 11, 12,
13, 14, 15, 16, 17, 18, 19, 20, 21, 21,
22, 23, 24, 25, 26, 4, 27, 27, 27, 27,
27, 28, 27, 27, 29, 27, 27, 27, 30, 27,
27, 31, 27, 27, 32, 4, 33, 27, 27, 27,
34, 27, 35, 36, 27, 27, 37, 38, 39, 40,
41, 42, 43, 44, 45, 46, 47, 48, 27, 27,
49, 50, 51, 52, 52, 70, 59, 55, 60, 82,
71, 52, 82, 56, 64, 61, 68, 82, 69, 69,
69, 81, 53, 82, 72, 82, 73, 73, 74, 82,
72, 82, 78, 78, 78, 53, 81, 82, 84, 75,
82, 82, 86, 90, 76, 75, 85, 57, 65, 82,
79, 91, 77, 92, 82, 82, 59, 94, 127, 82,
62, 75, 95, 82, 132, 61, 87, 75, 93, 88,
82, 98, 89, 56, 64, 61, 82, 77, 52, 52,
97, 52, 52, 52, 52, 52, 52, 52, 52, 96,
52, 52, 52, 52, 52, 99, 82, 82, 52, 52,
52, 52, 52, 52, 82, 103, 104, 100, 105, 52,
101, 82, 59, 55, 82, 106, 82, 133, 127, 56,
59, 117, 52, 52, 52, 61, 134, 82, 112, 61,
102, 109, 82, 107, 175, 110, 128, 128, 128, 108,
129, 111, 129, 135, 82, 130, 130, 130, 52, 82,
52, 52, 52, 57, 52, 52, 52, 52, 52, 52,
52, 52, 82, 52, 52, 52, 52, 52, 113, 82,
149, 52, 52, 52, 52, 52, 52, 83, 118, 56,
82, 117, 82, 138, 136, 69, 69, 69, 72, 61,
73, 73, 74, 82, 82, 52, 52, 52, 125, 82,
82, 82, 72, 75, 74, 74, 74, 82, 82, 139,
82, 72, 142, 78, 78, 78, 137, 75, 145, 140,
125, 52, 82, 52, 54, 75, 75, 54, 82, 82,
82, 79, 141, 143, 82, 82, 114, 114, 147, 75,
144, 146, 82, 148, 54, 82, 82, 153, 75, 59,
82, 152, 150, 82, 82, 164, 164, 151, 117, 162,
82, 59, 115, 155, 54, 154, 82, 54, 54, 156,
61, 296, 54, 127, 174, 157, 82, 176, 160, 54,
185, 165, 54, 163, 54, 159, 54, 115, 63, 119,
158, 121, 161, 130, 130, 130, 82, 82, 169, 169,
122, 122, 82, 52, 82, 82, 165, 55, 63, 168,
171, 82, 171, 56, 82, 172, 172, 172, 117, 166,
166, 128, 128, 128, 187, 82, 123, 188, 63, 177,
61, 63, 63, 127, 173, 179, 63, 130, 130, 130,
180, 178, 82, 63, 181, 82, 63, 57, 63, 82,
63, 123, 131, 131, 131, 82, 173, 82, 82, 82,
82, 131, 131, 131, 131, 131, 131, 82, 182, 82,
82, 184, 82, 56, 82, 189, 82, 82, 82, 82,
82, 186, 82, 131, 131, 131, 131, 131, 131, 167,
167, 167, 193, 183, 82, 190, 195, 82, 167, 167,
167, 167, 167, 167, 82, 200, 201, 82, 191, 192,
196, 213, 194, 197, 288, 82, 198, 82, 199, 218,
167, 167, 167, 167, 167, 167, 170, 170, 170, 112,
82, 203, 82, 204, 202, 170, 170, 170, 170, 170,
170, 205, 205, 59, 119, 172, 172, 172, 172, 172,
172, 82, 61, 63, 63, 82, 217, 170, 170, 170,
170, 170, 170, 52, 82, 214, 82, 55, 216, 113,
211, 215, 211, 56, 82, 212, 212, 212, 82, 207,
207, 82, 82, 82, 82, 220, 82, 82, 82, 82,
82, 82, 219, 82, 82, 82, 82, 82, 82, 209,
82, 59, 82, 82, 223, 225, 226, 57, 221, 82,
61, 243, 61, 222, 227, 231, 228, 82, 235, 232,
224, 236, 82, 82, 229, 234, 237, 112, 230, 233,
238, 52, 52, 56, 52, 55, 55, 239, 55, 240,
240, 56, 56, 245, 56, 212, 212, 212, 246, 249,
208, 208, 208, 212, 212, 212, 82, 82, 248, 208,
208, 208, 208, 208, 208, 242, 82, 113, 82, 82,
61, 82, 244, 82, 82, 57, 57, 82, 57, 82,
82, 208, 208, 208, 208, 208, 208, 82, 82, 82,
112, 112, 247, 250, 82, 251, 264, 253, 254, 82,
82, 56, 56, 256, 56, 119, 260, 82, 252, 265,
59, 255, 257, 258, 210, 210, 210, 82, 259, 61,
82, 262, 261, 210, 210, 210, 210, 210, 210, 82,
113, 113, 82, 267, 82, 269, 82, 82, 266, 82,
82, 82, 268, 82, 82, 210, 210, 210, 210, 210,
210, 112, 82, 82, 82, 270, 277, 59, 82, 263,
82, 273, 274, 241, 241, 241, 61, 82, 299, 275,
289, 82, 241, 241, 241, 241, 241, 241, 271, 61,
284, 272, 281, 285, 282, 82, 82, 299, 82, 283,
82, 113, 304, 290, 241, 241, 241, 241, 241, 241,
286, 59, 286, 300, 287, 300, 293, 276, 82, 294,
61, 291, 82, 297, 61, 295, 304, 300, 82, 82,
300, 287, 293, 82, 303, 302, 61, 52, 294, 61,
307, 52, 279, 52, 52, 52, 52, 52, 280, 52,
52, 52, 52, 52, 302, 299, 82, 52, 52, 52,
52, 52, 52, 82, 305, 308, 286, 59, 286, 293,
287, 82, 294, 82, 299, 306, 61, 301, 295, 82,
61, 52, 52, 52, 61, 295, 82, 287, 305, 306,
82, 294, 301, 82, 309, 82, 82, 82, 82, 61,
119, 82, 82, 82, 82, 82, 82, 52, 119, 52,
52, 59, 82, 124, 52, 52, 52, 52, 52, 52,
52, 280, 52, 52, 52, 52, 52, 120, 119, 59,
52, 52, 52, 52, 52, 52, 61, 53, 295, 80,
67, 66, 53, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 52, 52, 52, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
52, 310, 52, 52, 52, 310, 52, 52, 310, 52,
52, 52, 54, 54, 310, 54, 54, 54, 54, 54,
54, 54, 58, 58, 58, 58, 58, 58, 58, 58,
58, 58, 63, 63, 310, 63, 63, 63, 63, 63,
63, 63, 82, 82, 310, 82, 82, 310, 82, 82,
82, 56, 310, 310, 56, 56, 56, 56, 56, 56,
56, 116, 116, 116, 116, 116, 116, 116, 116, 116,
116, 61, 61, 61, 61, 61, 61, 61, 61, 61,
61, 126, 126, 310, 126, 126, 126, 126, 126, 126,
126, 56, 310, 56, 310, 56, 117, 117, 117, 117,
117, 117, 117, 117, 117, 117, 127, 127, 310, 127,
127, 127, 127, 127, 127, 127, 206, 206, 278, 278,
310, 278, 278, 278, 278, 278, 278, 280, 310, 280,
310, 280, 280, 280, 280, 292, 292, 292, 292, 292,
292, 292, 292, 292, 292, 298, 298, 298, 298, 298,
298, 298, 298, 298, 298, 295, 295, 295, 295, 295,
295, 295, 295, 295, 295, 3, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310
} ;
static yyconst short int yy_chk[1180] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 8, 11, 19, 9, 8, 9, 35,
19, 11, 309, 8, 11, 9, 18, 29, 18, 18,
18, 24, 24, 37, 20, 30, 20, 20, 20, 31,
21, 36, 21, 21, 21, 26, 26, 34, 29, 20,
40, 38, 31, 35, 20, 21, 30, 8, 11, 41,
21, 35, 20, 36, 39, 83, 58, 37, 71, 42,
9, 20, 38, 291, 83, 58, 34, 21, 36, 34,
43, 41, 34, 8, 11, 9, 45, 20, 27, 27,
40, 27, 27, 27, 27, 27, 27, 27, 27, 39,
27, 27, 27, 27, 27, 42, 46, 47, 27, 27,
27, 27, 27, 27, 44, 45, 45, 43, 45, 54,
43, 48, 60, 54, 84, 45, 85, 84, 71, 54,
62, 60, 27, 27, 27, 58, 85, 86, 56, 62,
44, 47, 133, 46, 133, 47, 72, 72, 72, 46,
75, 48, 75, 86, 99, 75, 75, 75, 27, 89,
27, 28, 28, 54, 28, 28, 28, 28, 28, 28,
28, 28, 87, 28, 28, 28, 28, 28, 56, 90,
99, 28, 28, 28, 28, 28, 28, 28, 62, 54,
91, 60, 93, 89, 87, 69, 69, 69, 73, 62,
73, 73, 73, 95, 88, 28, 28, 28, 69, 97,
92, 94, 74, 73, 74, 74, 74, 96, 102, 90,
98, 78, 93, 78, 78, 78, 88, 74, 95, 91,
69, 28, 100, 28, 57, 73, 78, 57, 101, 110,
103, 78, 92, 94, 105, 104, 57, 57, 97, 74,
94, 96, 108, 98, 57, 107, 111, 102, 78, 116,
143, 101, 100, 106, 109, 113, 113, 100, 116, 110,
132, 118, 57, 104, 57, 103, 290, 57, 57, 105,
118, 288, 57, 126, 132, 106, 134, 134, 108, 57,
143, 113, 57, 111, 57, 107, 57, 57, 65, 122,
106, 65, 109, 129, 129, 129, 146, 137, 122, 122,
65, 65, 138, 114, 136, 147, 113, 114, 65, 118,
125, 139, 125, 114, 285, 125, 125, 125, 116, 114,
114, 128, 128, 128, 146, 135, 65, 147, 65, 135,
118, 65, 65, 126, 128, 137, 65, 130, 130, 130,
138, 136, 140, 65, 139, 142, 65, 114, 65, 148,
65, 65, 77, 77, 77, 141, 128, 145, 149, 154,
152, 77, 77, 77, 77, 77, 77, 150, 140, 283,
151, 142, 153, 114, 156, 148, 155, 157, 158, 159,
160, 145, 182, 77, 77, 77, 77, 77, 77, 115,
115, 115, 152, 141, 163, 149, 154, 162, 115, 115,
115, 115, 115, 115, 161, 159, 160, 174, 150, 151,
155, 174, 153, 156, 279, 277, 157, 180, 158, 182,
115, 115, 115, 115, 115, 115, 123, 123, 123, 164,
179, 162, 275, 163, 161, 123, 123, 123, 123, 123,
123, 164, 164, 168, 169, 171, 171, 171, 172, 172,
172, 184, 168, 169, 169, 175, 180, 123, 123, 123,
123, 123, 123, 166, 176, 175, 183, 166, 179, 164,
173, 176, 173, 166, 185, 173, 173, 173, 186, 166,
166, 188, 189, 190, 191, 184, 193, 194, 192, 195,
273, 197, 183, 196, 199, 198, 201, 204, 202, 168,
214, 209, 203, 272, 188, 190, 191, 166, 185, 218,
209, 214, 168, 186, 192, 196, 193, 223, 199, 196,
189, 201, 222, 220, 194, 198, 202, 205, 195, 197,
203, 207, 208, 166, 167, 207, 208, 204, 167, 205,
205, 207, 208, 218, 167, 211, 211, 211, 220, 223,
167, 167, 167, 212, 212, 212, 225, 224, 222, 167,
167, 167, 167, 167, 167, 209, 221, 205, 215, 226,
209, 231, 215, 227, 228, 207, 208, 229, 167, 235,
236, 167, 167, 167, 167, 167, 167, 232, 237, 234,
240, 241, 221, 224, 244, 225, 244, 227, 228, 239,
251, 207, 208, 231, 167, 170, 236, 249, 226, 245,
242, 229, 232, 234, 170, 170, 170, 248, 235, 242,
250, 239, 237, 170, 170, 170, 170, 170, 170, 252,
240, 241, 245, 249, 260, 251, 261, 262, 248, 253,
281, 264, 250, 256, 266, 170, 170, 170, 170, 170,
170, 206, 269, 270, 271, 252, 264, 263, 274, 242,
268, 260, 261, 206, 206, 206, 263, 282, 293, 262,
281, 267, 206, 206, 206, 206, 206, 206, 253, 242,
271, 256, 266, 274, 268, 289, 284, 293, 259, 269,
297, 206, 299, 282, 206, 206, 206, 206, 206, 206,
276, 276, 276, 302, 276, 294, 287, 263, 303, 287,
276, 284, 258, 289, 294, 287, 305, 306, 257, 255,
301, 276, 295, 307, 297, 295, 263, 265, 287, 301,
303, 265, 265, 265, 265, 265, 265, 265, 265, 265,
265, 265, 265, 265, 295, 298, 308, 265, 265, 265,
265, 265, 265, 254, 299, 307, 286, 286, 286, 292,
286, 247, 292, 246, 298, 302, 286, 294, 292, 243,
276, 265, 265, 265, 294, 287, 238, 286, 305, 306,
233, 292, 301, 230, 308, 219, 217, 216, 213, 301,
210, 200, 187, 181, 178, 177, 144, 265, 121, 265,
278, 117, 82, 68, 278, 278, 278, 278, 278, 278,
278, 278, 278, 278, 278, 278, 278, 64, 63, 61,
278, 278, 278, 278, 278, 278, 286, 25, 292, 22,
17, 14, 7, 3, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 278, 278, 278, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
278, 0, 278, 311, 311, 0, 311, 311, 0, 311,
311, 311, 312, 312, 0, 312, 312, 312, 312, 312,
312, 312, 313, 313, 313, 313, 313, 313, 313, 313,
313, 313, 314, 314, 0, 314, 314, 314, 314, 314,
314, 314, 315, 315, 0, 315, 315, 0, 315, 315,
315, 316, 0, 0, 316, 316, 316, 316, 316, 316,
316, 317, 317, 317, 317, 317, 317, 317, 317, 317,
317, 318, 318, 318, 318, 318, 318, 318, 318, 318,
318, 319, 319, 0, 319, 319, 319, 319, 319, 319,
319, 320, 0, 320, 0, 320, 321, 321, 321, 321,
321, 321, 321, 321, 321, 321, 322, 322, 0, 322,
322, 322, 322, 322, 322, 322, 323, 323, 324, 324,
0, 324, 324, 324, 324, 324, 324, 325, 0, 325,
0, 325, 325, 325, 325, 326, 326, 326, 326, 326,
326, 326, 326, 326, 326, 327, 327, 327, 327, 327,
327, 327, 327, 327, 327, 328, 328, 328, 328, 328,
328, 328, 328, 328, 328, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310, 310,
310, 310, 310, 310, 310, 310, 310, 310, 310
} ;
static yy_state_type yy_state_buf[YY_BUF_SIZE + 2], *yy_state_ptr;
static char *yy_full_match;
static int yy_lp;
#define REJECT \
{ \
*yy_cp = yy_hold_char; /* undo effects of setting up yytext */ \
yy_cp = yy_full_match; /* restore poss. backed-over text */ \
++yy_lp; \
Revert automated changes Sorry guys, they are just not ready for prime time Work will continue as always git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1212479 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
14 years ago
goto find_rule; \
Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. BUG:215923 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
15 years ago
}
#define yymore() yymore_used_but_not_detected
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET
char *yytext;
#line 1 "scanner.ll"
#define INITIAL 0
#line 2 "scanner.ll"
/*****************************************************************
Copyright (c) 1999 Torben Weis <weis@kde.org>
Copyright (c) 2000 Matthias Ettrich <ettrich@kde.org>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
******************************************************************/
#define YY_NO_UNPUT
#include <stdlib.h>
#include <ctype.h>
TQt conversion fixes git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1158447 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
14 years ago
class TQString;
Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. BUG:215923 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
15 years ago
#ifndef KDE_USE_FINAL
#include "yacc.cc.h"
#endif
extern int idl_line_no;
int comment_mode;
int function_mode = 0;
Trinity Qt initial conversion git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1157647 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
14 years ago
#include <tqstring.h>
#include <tqregexp.h>
Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. BUG:215923 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
15 years ago
static long ascii_to_longlong( long base, const char *s )
{
long ll = 0;
while( *s != '\0' ) {
char c = *s++;
if( c >= 'a' )
c -= 'a' - 'A';
c -= '0';
if( c > 9 )
c -= 'A' - '0' - 10;
ll = ll * base + c;
}
return ll;
}
static double ascii_to_longdouble (const char *s)
{
double d;
#ifdef HAVE_SCANF_LF
sscanf (s, "%Lf", &d);
#else
/*
* this is only an approximation and will probably break fixed<>
* parameter calculation on systems where
* sizeof(double) < sizeof(long double). but fortunately all
* systems where scanf("%Lf") is known to be broken (Linux/Alpha
* and HPUX) have sizeof(double) == sizeof(long double).
*/
d = strtod (s, NULL);
#endif
return d;
}
static char translate_char( const char *s )
{
char c = *s++;
if( c != '\\' )
return c;
c = *s++;
switch( c ) {
case 'n':
return '\n';
case 't':
return '\t';
case 'v':
return '\v';
case 'b':
return '\b';
case 'r':
return '\r';
case 'f':
return '\f';
case 'a':
return '\a';
case '\\':
return '\\';
case '?':
return '\?';
case '\'':
return '\'';
case '"':
return '"';
case 'x':
case 'X':
return (char) ascii_to_longlong( 16, s );
default:
// Gotta be an octal
return (char) ascii_to_longlong( 8, s );
}
}
#define YY_NEVER_INTERACTIVE 1
/*--------------------------------------------------------------------------*/
/*--------------------------------------------------------------------------*/
/*--------------------------------------------------------------------------*/
#line 933 "scanner.cc"
/* Macros after this point can all be overridden by user definitions in
* section 1.
*/
#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int yywrap YY_PROTO(( void ));
#else
extern int yywrap YY_PROTO(( void ));
#endif
#endif
#ifndef YY_NO_UNPUT
static void yyunput YY_PROTO(( int c, char *buf_ptr ));
#endif
#ifndef yytext_ptr
static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int ));
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen YY_PROTO(( yyconst char * ));
#endif
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput YY_PROTO(( void ));
#else
static int input YY_PROTO(( void ));
#endif
#endif
#if YY_STACK_USED
static int yy_start_stack_ptr = 0;
static int yy_start_stack_depth = 0;
static int *yy_start_stack = 0;
#ifndef YY_NO_PUSH_STATE
static void yy_push_state YY_PROTO(( int new_state ));
#endif
#ifndef YY_NO_POP_STATE
static void yy_pop_state YY_PROTO(( void ));
#endif
#ifndef YY_NO_TOP_STATE
static int yy_top_state YY_PROTO(( void ));
#endif
#else
#define YY_NO_PUSH_STATE 1
#define YY_NO_POP_STATE 1
#define YY_NO_TOP_STATE 1
#endif
#ifdef YY_MALLOC_DECL
YY_MALLOC_DECL
#else
#if __STDC__
#ifndef __cplusplus
#include <stdlib.h>
#endif
#else
/* Just try to get by without declaring the routines. This will fail
* miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
* or sizeof(void*) != sizeof(int).
*/
#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 (void) fwrite( yytext, yyleng, 1, yyout )
#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->yy_is_interactive ) \
{ \
int c = '*', 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 if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \
&& ferror( yyin ) ) \
YY_FATAL_ERROR( "input in flex scanner failed" );
#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
/* Default declaration of generated scanner - a define so the user can
* easily add parameters.
*/
#ifndef YY_DECL
#define YY_DECL int yylex YY_PROTO(( void ))
#endif
/* 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 \
YY_USER_ACTION
YY_DECL
{
register yy_state_type yy_current_state;
register char *yy_cp, *yy_bp;
register int yy_act;
#line 148 "scanner.ll"
#line 1087 "scanner.cc"
if ( yy_init )
{
yy_init = 0;
#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 )
yy_current_buffer =
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_state_ptr = yy_state_buf;
*yy_state_ptr++ = yy_current_state;
yy_match:
do
{
register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*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 >= 311 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
*yy_state_ptr++ = yy_current_state;
++yy_cp;
}
while ( yy_current_state != 310 );
Revert automated changes Sorry guys, they are just not ready for prime time Work will continue as always git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1212479 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
14 years ago
yy_find_action:
Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. BUG:215923 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
15 years ago
yy_current_state = *--yy_state_ptr;
yy_lp = yy_accept[yy_current_state];
Revert automated changes Sorry guys, they are just not ready for prime time Work will continue as always git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1212479 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
14 years ago
find_rule: /* we branch to this label when backing up */
for ( ; ; ) /* until we find what rule we matched */
Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. BUG:215923 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
15 years ago
{
if ( yy_lp && yy_lp < yy_accept[yy_current_state + 1] )
{
yy_act = yy_acclist[yy_lp];
{
yy_full_match = yy_cp;
break;
}
}
--yy_cp;
yy_current_state = *--yy_state_ptr;
yy_lp = yy_accept[yy_current_state];
}
YY_DO_BEFORE_ACTION;
do_action: /* This label is used only to access EOF actions. */
switch ( yy_act )
{ /* beginning of action switch */
case 1:
YY_RULE_SETUP
#line 150 "scanner.ll"
;
YY_BREAK
case 2:
YY_RULE_SETUP
#line 151 "scanner.ll"
{ idl_line_no++; }
YY_BREAK
case 3:
YY_RULE_SETUP
#line 153 "scanner.ll"
{ comment_mode = 1; }
YY_BREAK
case 4:
YY_RULE_SETUP
#line 154 "scanner.ll"
{ if (!comment_mode) { REJECT; } else { comment_mode = 0; } }
YY_BREAK
case 5:
YY_RULE_SETUP
#line 155 "scanner.ll"
{
if (! comment_mode) {
if (!function_mode) { REJECT; } else {
function_mode = 0;
return T_RIGHT_CURLY_BRACKET;
}
}
}
YY_BREAK
case 6:
YY_RULE_SETUP
#line 163 "scanner.ll"
{ if (!comment_mode && !function_mode) { REJECT; } }
YY_BREAK
case 7:
YY_RULE_SETUP
#line 164 "scanner.ll"
{ if (!comment_mode) { REJECT; } }
YY_BREAK
case 8:
YY_RULE_SETUP
#line 166 "scanner.ll"
;
YY_BREAK
case 9:
YY_RULE_SETUP
#line 167 "scanner.ll"
{
exit( 1 );
}
YY_BREAK
case 10:
YY_RULE_SETUP
#line 170 "scanner.ll"
{
Trinity Qt initial conversion git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1157647 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
14 years ago
TQString s( yytext );
Initial conversion for TQt for Qt4 3.4.0 TP2 This will also compile with TQt for Qt3, and should not cause any problems with dependent modules such as kdebase. If it does then it needs to be fixed! git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1214149 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
14 years ago
int i = s.tqfind(TQRegExp("[\"<]"))+1;
int j = s.tqfind(TQRegExp("[\">]"), i);
Trinity Qt initial conversion git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1157647 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
14 years ago
yylval._str = new TQString( s.mid( i, j - i ) );
Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. BUG:215923 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
15 years ago
idl_line_no++;
return T_INCLUDE;
}
YY_BREAK
case 11:
YY_RULE_SETUP
#line 178 "scanner.ll"
{
idl_line_no++;
}
YY_BREAK
case 12:
YY_RULE_SETUP
#line 181 "scanner.ll"
return T_LEFT_CURLY_BRACKET;
YY_BREAK
case 13:
YY_RULE_SETUP
#line 182 "scanner.ll"
return T_RIGHT_CURLY_BRACKET;
YY_BREAK
case 14:
YY_RULE_SETUP
#line 183 "scanner.ll"
return T_LEFT_PARANTHESIS;
YY_BREAK
case 15:
YY_RULE_SETUP
#line 184 "scanner.ll"
return T_RIGHT_PARANTHESIS;
YY_BREAK
case 16:
YY_RULE_SETUP
#line 185 "scanner.ll"
return T_COLON;
YY_BREAK
case 17:
YY_RULE_SETUP
#line 186 "scanner.ll"
return T_PLUS;
YY_BREAK
case 18:
YY_RULE_SETUP
#line 187 "scanner.ll"
return T_MINUS;
YY_BREAK
case 19:
YY_RULE_SETUP
#line 188 "scanner.ll"
return T_TILDE;
YY_BREAK
case 20:
YY_RULE_SETUP
#line 189 "scanner.ll"
return T_COMMA;
YY_BREAK
case 21:
YY_RULE_SETUP
#line 190 "scanner.ll"
return T_ASTERISK;
YY_BREAK
case 22:
YY_RULE_SETUP
#line 191 "scanner.ll"
return T_SEMICOLON;
YY_BREAK
case 23:
YY_RULE_SETUP
#line 192 "scanner.ll"
return T_AMPERSAND;
YY_BREAK
case 24:
YY_RULE_SETUP
#line 193 "scanner.ll"
return T_LESS;
YY_BREAK
case 25:
YY_RULE_SETUP
#line 194 "scanner.ll"
return T_GREATER;
YY_BREAK
case 26:
YY_RULE_SETUP
#line 195 "scanner.ll"
return T_SCOPE;
YY_BREAK
case 27:
YY_RULE_SETUP
#line 196 "scanner.ll"
return T_EQUAL;
YY_BREAK
case 28:
YY_RULE_SETUP
#line 197 "scanner.ll"
return T_ACCESS;
YY_BREAK
case 29:
YY_RULE_SETUP
#line 198 "scanner.ll"
return T_TRIPLE_DOT;
YY_BREAK
case 30:
YY_RULE_SETUP
#line 199 "scanner.ll"
return T_ARRAY_OPEN;
YY_BREAK
case 31:
YY_RULE_SETUP
#line 200 "scanner.ll"
return T_ARRAY_CLOSE;
YY_BREAK
case 32:
YY_RULE_SETUP
#line 201 "scanner.ll"
return T_ACCESS;
YY_BREAK
case 33:
YY_RULE_SETUP
#line 202 "scanner.ll"
return T_SHIFT;
YY_BREAK
case 34:
YY_RULE_SETUP
#line 203 "scanner.ll"
return T_MISCOPERATOR;
YY_BREAK
case 35:
YY_RULE_SETUP
#line 206 "scanner.ll"
return T_CONST;
YY_BREAK
case 36:
YY_RULE_SETUP
#line 207 "scanner.ll"
return T_ENUM;
YY_BREAK
case 37:
YY_RULE_SETUP
#line 208 "scanner.ll"
return T_NAMESPACE;
YY_BREAK
case 38:
YY_RULE_SETUP
#line 209 "scanner.ll"
return T_USING;
YY_BREAK
case 39:
YY_RULE_SETUP
#line 210 "scanner.ll"
return T_CLASS;
YY_BREAK
case 40:
YY_RULE_SETUP
#line 211 "scanner.ll"
return T_STRUCT;
YY_BREAK
case 41:
YY_RULE_SETUP
#line 212 "scanner.ll"
return T_FUNOPERATOR;
YY_BREAK
case 42:
YY_RULE_SETUP
#line 213 "scanner.ll"
return T_VIRTUAL;
YY_BREAK
case 43:
YY_RULE_SETUP
#line 214 "scanner.ll"
return T_PUBLIC;
YY_BREAK
case 44:
YY_RULE_SETUP
#line 215 "scanner.ll"
return T_INLINE;
YY_BREAK
case 45:
YY_RULE_SETUP
#line 216 "scanner.ll"
return T_STATIC;
YY_BREAK
case 46:
YY_RULE_SETUP
#line 217 "scanner.ll"
return T_MUTABLE;
YY_BREAK
case 47:
YY_RULE_SETUP
#line 218 "scanner.ll"
return T_SIGNED;
YY_BREAK
case 48:
YY_RULE_SETUP
#line 219 "scanner.ll"
return T_UNSIGNED;
YY_BREAK
case 49:
YY_RULE_SETUP
#line 220 "scanner.ll"
return T_SHORT;
YY_BREAK
case 50:
YY_RULE_SETUP
#line 221 "scanner.ll"
return T_LONG;
YY_BREAK
case 51:
YY_RULE_SETUP
#line 222 "scanner.ll"
return T_FRIEND;
YY_BREAK
case 52:
YY_RULE_SETUP
#line 223 "scanner.ll"
return T_PROTECTED;
YY_BREAK
case 53:
YY_RULE_SETUP
#line 224 "scanner.ll"
return T_PRIVATE;
YY_BREAK
case 54:
YY_RULE_SETUP
#line 225 "scanner.ll"
return T_SIGNAL;
YY_BREAK
case 55:
YY_RULE_SETUP
#line 226 "scanner.ll"
return T_RETURN;
YY_BREAK
case 56:
YY_RULE_SETUP
#line 227 "scanner.ll"
return T_SLOT;
YY_BREAK
case 57:
YY_RULE_SETUP
#line 228 "scanner.ll"
return T_TRUE;
YY_BREAK
case 58:
YY_RULE_SETUP
#line 229 "scanner.ll"
return T_INT;
YY_BREAK
case 59:
YY_RULE_SETUP
#line 230 "scanner.ll"
return T_CHAR;
YY_BREAK
case 60:
YY_RULE_SETUP
#line 231 "scanner.ll"
return T_FALSE;
YY_BREAK
case 61:
YY_RULE_SETUP
#line 232 "scanner.ll"
return T_TRUE;
YY_BREAK
case 62:
YY_RULE_SETUP
#line 233 "scanner.ll"
return T_FALSE;
YY_BREAK
case 63:
YY_RULE_SETUP
#line 234 "scanner.ll"
return T_DCOP_AREA;
YY_BREAK
case 64:
YY_RULE_SETUP
#line 235 "scanner.ll"
return T_DCOP_SIGNAL_AREA;
YY_BREAK
case 65:
YY_RULE_SETUP
#line 236 "scanner.ll"
return T_TYPEDEF;
YY_BREAK
case 66:
YY_RULE_SETUP
#line 237 "scanner.ll"
return T_DCOP;
YY_BREAK
case 67:
YY_RULE_SETUP
#line 238 "scanner.ll"
;
YY_BREAK
case 68:
YY_RULE_SETUP
#line 239 "scanner.ll"
return T_NULL;
YY_BREAK
case 69:
YY_RULE_SETUP
#line 240 "scanner.ll"
return T_EXTERN;
YY_BREAK
case 70:
YY_RULE_SETUP
#line 241 "scanner.ll"
return T_EXTERN_C;
YY_BREAK
case 71:
YY_RULE_SETUP
#line 243 "scanner.ll"
{
Trinity Qt initial conversion git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1157647 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
14 years ago
yylval._str = new TQString( yytext );
Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. BUG:215923 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
15 years ago
return T_IDENTIFIER;
}
YY_BREAK
case 72:
#line 249 "scanner.ll"
case 73:
#line 250 "scanner.ll"
case 74:
#line 251 "scanner.ll"
case 75:
#line 252 "scanner.ll"
case 76:
YY_RULE_SETUP
#line 252 "scanner.ll"
{
yylval._float = ascii_to_longdouble( yytext );
return T_DOUBLE_LITERAL;
}
YY_BREAK
case 77:
YY_RULE_SETUP
#line 256 "scanner.ll"
{
yylval._int = ascii_to_longlong( 10, yytext );
return T_INTEGER_LITERAL;
}
YY_BREAK
case 78:
YY_RULE_SETUP
#line 260 "scanner.ll"
{
yylval._int = ascii_to_longlong( 8, yytext );
return T_INTEGER_LITERAL;
}
YY_BREAK
case 79:
YY_RULE_SETUP
#line 264 "scanner.ll"
{
yylval._int = ascii_to_longlong( 16, yytext + 2 );
return T_INTEGER_LITERAL;
}
YY_BREAK
case 80:
YY_RULE_SETUP
#line 268 "scanner.ll"
{
Trinity Qt initial conversion git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1157647 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
14 years ago
TQCString s( yytext );
Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. BUG:215923 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
15 years ago
s = s.mid( 1, s.length() - 2 );
yylval._char = translate_char( s );
return T_CHARACTER_LITERAL;
}
YY_BREAK
case 81:
YY_RULE_SETUP
#line 274 "scanner.ll"
{
Trinity Qt initial conversion git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1157647 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
14 years ago
TQString s( yytext );
yylval._str = new TQString( s.mid( 1, s.length() - 2 ) );
Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. BUG:215923 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
15 years ago
return T_STRING_LITERAL;
}
YY_BREAK
case 82:
YY_RULE_SETUP
#line 279 "scanner.ll"
{
if (function_mode)
return yylex(); // call once again
qFatal("could not parse %c(%d) at line %d" , yytext[0], yytext[0], idl_line_no);
return T_UNKNOWN;
}
YY_BREAK
case 83:
YY_RULE_SETUP
#line 287 "scanner.ll"
ECHO;
YY_BREAK
#line 1622 "scanner.cc"
case YY_STATE_EOF(INITIAL):
yyterminate();
case YY_END_OF_BUFFER:
{
/* Amount of text matched not including the EOB char. */
int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1;
/* Undo the effects of YY_DO_BEFORE_ACTION. */
*yy_cp = yy_hold_char;
YY_RESTORE_YY_MORE_OFFSET
if ( yy_current_buffer->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->yy_n_chars;
yy_current_buffer->yy_input_file = yyin;
yy_current_buffer->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->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_c_buf_p;
Revert automated changes Sorry guys, they are just not ready for prime time Work will continue as always git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1212479 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
14 years ago
goto yy_find_action;
Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. BUG:215923 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
15 years ago
}
}
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->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;
Revert automated changes Sorry guys, they are just not ready for prime time Work will continue as always git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1212479 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
14 years ago
goto yy_find_action;
Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features. BUG:215923 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
15 years ago
}
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()
{
register char *dest = yy_current_buffer->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->yy_ch_buf[yy_n_chars + 1] )
YY_FATAL_ERROR(
"fatal flex scanner internal error--end of buffer missed" );
if ( yy_current_buffer->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->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->yy_n_chars = yy_n_chars = 0;
else
{
int num_to_read =
yy_current_buffer->yy_buf_size - number_to_move - 1;
while ( num_to_read <= 0 )
{ /* Not enough room in the buffer - grow it. */
#ifdef YY_USES_REJECT
YY_FATAL_ERROR(
"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
#else
/* 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. */
yy_flex_realloc( (void *) b->yy_ch_buf,
b->yy_buf_size + 2 );
}
else
/* Can't grow it, we don't own it. */
b->yy_ch_buf = 0;
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR(
"fatal error - scanner input buffer overflow" );
yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
num_to_read = yy_current_buffer->yy_buf_size -
number_to_move - 1;
#endif
}
if ( num_to_read > YY_READ_BUF_SIZE )
num_to_read = YY_READ_BUF_SIZE;
/* Read in more data. */
YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]),
yy_n_chars, num_to_read );
yy_current_buffer->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->yy_buffer_status =
YY_BUFFER_EOF_PENDING;
}
}
else
ret_val = EOB_ACT_CONTINUE_SCAN;
yy_n_chars += number_to_move;
yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR;
yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
yytext_ptr = &yy_current_buffer->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()
{
register yy_state_type yy_current_state;
register char *yy_cp;
yy_current_state = yy_start;
yy_state_ptr = yy_state_buf;
*yy_state_ptr++ = yy_current_state;
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);
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 >= 311 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
*yy_state_ptr++ = yy_current_state;
}
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 );
*/
#ifdef YY_USE_PROTOS
static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state )
#else
static yy_state_type yy_try_NUL_trans( yy_current_state )
yy_state_type yy_current_state;
#endif
{
register int yy_is_jam;
register YY_CHAR yy_c = 1;
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 >= 311 )
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 == 310);
if ( ! yy_is_jam )
*yy_state_ptr++ = yy_current_state;
return yy_is_jam ? 0 : yy_current_state;
}
#ifndef YY_NO_UNPUT
#ifdef YY_USE_PROTOS
static void yyunput( int c, register char *yy_bp )
#else
static void yyunput( c, yy_bp )
int c;
register char *yy_bp;
#endif
{
register char *yy_cp = yy_c_buf_p;
/* undo effects of setting up yytext */
*yy_cp = yy_hold_char;
if ( yy_cp < yy_current_buffer->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->yy_ch_buf[
yy_current_buffer->yy_buf_size + 2];
register char *source =
&yy_current_buffer->yy_ch_buf[number_to_move];
while ( source > yy_current_buffer->yy_ch_buf )
*--dest = *--source;
yy_cp += (int) (dest - source);
yy_bp += (int) (dest - source);
yy_current_buffer->yy_n_chars =
yy_n_chars = yy_current_buffer->yy_buf_size;
if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
YY_FATAL_ERROR( "flex scanner push-back overflow" );
}
*--yy_cp = (char) c;
yytext_ptr = yy_bp;
yy_hold_char = *yy_cp;
yy_c_buf_p = yy_cp;
}
#endif /* ifndef YY_NO_UNPUT */
#ifdef __cplusplus
static int yyinput()
#else
static int input()
#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->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 );
/* fall through */
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;
return c;
}
#ifdef YY_USE_PROTOS
void yyrestart( FILE *input_file )
#else
void yyrestart( input_file )
FILE *input_file;
#endif
{
if ( ! yy_current_buffer )
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE );
yy_init_buffer( yy_current_buffer, input_file );
yy_load_buffer_state();
}
#ifdef YY_USE_PROTOS
void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
#else
void yy_switch_to_buffer( new_buffer )
YY_BUFFER_STATE new_buffer;
#endif
{
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->yy_buf_pos = yy_c_buf_p;
yy_current_buffer->yy_n_chars = yy_n_chars;
}
yy_current_buffer = 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;
}
#ifdef YY_USE_PROTOS
void yy_load_buffer_state( void )
#else
void yy_load_buffer_state()
#endif
{
yy_n_chars = yy_current_buffer->yy_n_chars;
yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos;
yyin = yy_current_buffer->yy_input_file;
yy_hold_char = *yy_c_buf_p;
}
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
#else
YY_BUFFER_STATE yy_create_buffer( file, size )
FILE *file;
int size;
#endif
{
YY_BUFFER_STATE b;
b = (YY_BUFFER_STATE) yy_flex_alloc( 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 *) yy_flex_alloc( 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;
}
#ifdef YY_USE_PROTOS
void yy_delete_buffer( YY_BUFFER_STATE b )
#else
void yy_delete_buffer( b )
YY_BUFFER_STATE b;
#endif
{
if ( ! b )
return;
if ( b == yy_current_buffer )
yy_current_buffer = (YY_BUFFER_STATE) 0;
if ( b->yy_is_our_buffer )
yy_flex_free( (void *) b->yy_ch_buf );
yy_flex_free( (void *) b );
}
#ifndef YY_ALWAYS_INTERACTIVE
#ifndef YY_NEVER_INTERACTIVE
extern int isatty YY_PROTO(( int ));
#endif
#endif
#ifdef YY_USE_PROTOS
void yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
#else
void yy_init_buffer( b, file )
YY_BUFFER_STATE b;
FILE *file;
#endif
{
yy_flush_buffer( b );
b->yy_input_file = file;
b->yy_fill_buffer = 1;
#if YY_ALWAYS_INTERACTIVE
b->yy_is_interactive = 1;
#else
#if YY_NEVER_INTERACTIVE
b->yy_is_interactive = 0;
#else
b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
#endif
#endif
}
#ifdef YY_USE_PROTOS
void yy_flush_buffer( YY_BUFFER_STATE b )
#else
void yy_flush_buffer( b )
YY_BUFFER_STATE b;
#endif
{
if ( ! b )
return;
b->yy_n_chars = 0;
/* We always need two end-of-buffer characters. The first causes
* a transition to the end-of-buffer state. The second causes
* a jam in that state.
*/
b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
b->yy_buf_pos = &b->yy_ch_buf[0];
b->yy_at_bol = 1;
b->yy_buffer_status = YY_BUFFER_NEW;
if ( b == yy_current_buffer )
yy_load_buffer_state();
}
#ifndef YY_NO_SCAN_BUFFER
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size )
#else
YY_BUFFER_STATE yy_scan_buffer( base, size )
char *base;
yy_size_t size;
#endif
{
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) yy_flex_alloc( 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;
}
#endif
#ifndef YY_NO_SCAN_STRING
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str )
#else
YY_BUFFER_STATE yy_scan_string( yy_str )
yyconst char *yy_str;
#endif
{
int len;
for ( len = 0; yy_str[len]; ++len )
;
return yy_scan_bytes( yy_str, len );
}
#endif
#ifndef YY_NO_SCAN_BYTES
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len )
#else
YY_BUFFER_STATE yy_scan_bytes( bytes, len )
yyconst char *bytes;
int len;
#endif
{
YY_BUFFER_STATE b;
char *buf;
yy_size_t n;
int i;
/* Get memory for full buffer, including space for trailing EOB's. */
n = len + 2;
buf = (char *) yy_flex_alloc( n );
if ( ! buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
for ( i = 0; i < len; ++i )
buf[i] = bytes[i];
buf[len] = buf[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;
}
#endif
#ifndef YY_NO_PUSH_STATE
#ifdef YY_USE_PROTOS
static void yy_push_state( int new_state )
#else
static void yy_push_state( new_state )
int new_state;
#endif
{
if ( yy_start_stack_ptr >= yy_start_stack_depth )
{
yy_size_t new_size;
yy_start_stack_depth += YY_START_STACK_INCR;
new_size = yy_start_stack_depth * sizeof( int );
if ( ! yy_start_stack )
yy_start_stack = (int *) yy_flex_alloc( new_size );
else
yy_start_stack = (int *) yy_flex_realloc(
(void *) yy_start_stack, new_size );
if ( ! yy_start_stack )
YY_FATAL_ERROR(
"out of memory expanding start-condition stack" );
}
yy_start_stack[yy_start_stack_ptr++] = YY_START;
BEGIN(new_state);
}
#endif
#ifndef YY_NO_POP_STATE
static void yy_pop_state()
{
if ( --yy_start_stack_ptr < 0 )
YY_FATAL_ERROR( "start-condition stack underflow" );
BEGIN(yy_start_stack[yy_start_stack_ptr]);
}
#endif
#ifndef YY_NO_TOP_STATE
static int yy_top_state()
{
return yy_start_stack[yy_start_stack_ptr - 1];
}
#endif
#ifndef YY_EXIT_FAILURE
#define YY_EXIT_FAILURE 2
#endif
#ifdef YY_USE_PROTOS
static void yy_fatal_error( yyconst char msg[] )
#else
static void yy_fatal_error( msg )
char msg[];
#endif
{
(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. */ \
yytext[yyleng] = yy_hold_char; \
yy_c_buf_p = yytext + n; \
yy_hold_char = *yy_c_buf_p; \
*yy_c_buf_p = '\0'; \
yyleng = n; \
} \
while ( 0 )
/* Internal utility routines. */
#ifndef yytext_ptr
#ifdef YY_USE_PROTOS
static void yy_flex_strncpy( char *s1, yyconst char *s2, int n )
#else
static void yy_flex_strncpy( s1, s2, n )
char *s1;
yyconst char *s2;
int n;
#endif
{
register int i;
for ( i = 0; i < n; ++i )
s1[i] = s2[i];
}
#endif
#ifdef YY_NEED_STRLEN
#ifdef YY_USE_PROTOS
static int yy_flex_strlen( yyconst char *s )
#else
static int yy_flex_strlen( s )
yyconst char *s;
#endif
{
register int n;
for ( n = 0; s[n]; ++n )
;
return n;
}
#endif
#ifdef YY_USE_PROTOS
static void *yy_flex_alloc( yy_size_t size )
#else
static void *yy_flex_alloc( size )
yy_size_t size;
#endif
{
return (void *) malloc( size );
}
#ifdef YY_USE_PROTOS
static void *yy_flex_realloc( void *ptr, yy_size_t size )
#else
static void *yy_flex_realloc( ptr, size )
void *ptr;
yy_size_t size;
#endif
{
/* 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 );
}
#ifdef YY_USE_PROTOS
static void yy_flex_free( void *ptr )
#else
static void yy_flex_free( ptr )
void *ptr;
#endif
{
free( ptr );
}
#if YY_MAIN
int main()
{
yylex();
return 0;
}
#endif
#line 287 "scanner.ll"
void dcopidlInitFlex( const char *_code )
{
comment_mode = 0;
yy_switch_to_buffer( yy_scan_string( _code ) );
}