/* A lexical scanner generated by flex */
/* Scanner skeleton version:
* $Header: /cvs/root/flex/flex/skel.c,v 1.2 2004/05/07 00:28:17 jkh Exp $
*/
#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)
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 100
#define YY_END_OF_BUFFER 101
static yyconst short int yy_accept[250] =
{ 0,
0, 0, 0, 0, 0, 0, 0, 0, 101, 80,
3, 1, 12, 76, 2, 37, 80, 80, 79, 80,
80, 80, 80, 80, 39, 5, 16, 31, 20, 75,
75, 75, 75, 80, 78, 33, 75, 75, 75, 75,
75, 75, 75, 75, 75, 75, 75, 75, 75, 75,
75, 75, 80, 77, 14, 100, 99, 86, 85, 99,
84, 82, 83, 84, 3, 13, 15, 2, 34, 36,
36, 28, 10, 32, 26, 22, 24, 23, 25, 39,
27, 39, 39, 0, 17, 18, 19, 21, 75, 75,
75, 38, 4, 29, 75, 75, 75, 75, 75, 42,
75, 75, 75, 75, 75, 75, 43, 58, 75, 75,
75, 75, 75, 75, 75, 75, 75, 75, 75, 75,
75, 75, 75, 11, 98, 87, 96, 95, 94, 92,
90, 88, 91, 89, 93, 98, 81, 36, 35, 30,
39, 0, 39, 75, 7, 75, 75, 75, 75, 67,
75, 75, 75, 64, 41, 75, 75, 75, 75, 63,
75, 62, 75, 75, 75, 75, 75, 66, 75, 75,
75, 75, 54, 75, 75, 75, 75, 96, 97, 75,
75, 75, 75, 75, 75, 44, 46, 8, 75, 55,
75, 75, 75, 45, 75, 70, 75, 75, 75, 65,
75, 75, 75, 75, 75, 75, 96, 6, 68, 47,
74, 75, 75, 75, 75, 56, 75, 57, 49, 75,
52, 75, 71, 75, 75, 75, 75, 40, 75, 60,
75, 75, 61, 50, 9, 75, 53, 69, 75, 75,
75, 75, 59, 51, 73, 72, 48, 8, 0
} ;
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, 2, 4, 5, 6, 7, 8, 9, 1, 1,
10, 11, 12, 1, 13, 14, 15, 16, 16, 17,
16, 16, 16, 16, 16, 18, 18, 1, 19, 20,
21, 22, 1, 1, 23, 24, 23, 25, 26, 27,
28, 29, 30, 29, 29, 29, 29, 31, 29, 29,
29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
1, 32, 33, 34, 29, 1, 35, 36, 37, 38,
39, 40, 41, 42, 43, 29, 44, 45, 46, 47,
48, 49, 50, 51, 52, 53, 54, 55, 56, 57,
58, 29, 1, 59, 60, 61, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 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[62] =
{ 0,
1, 1, 2, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 3, 3, 3, 1, 1,
1, 1, 3, 3, 3, 3, 3, 4, 4, 4,
4, 1, 1, 1, 3, 3, 3, 3, 3, 3,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 1, 1,
1
} ;
static yyconst short int yy_base[260] =
{ 0,
0, 0, 0, 0, 59, 60, 63, 64, 324, 325,
321, 325, 47, 325, 0, 53, 301, 312, 325, 61,
62, 60, 59, 299, 71, 325, 298, 297, 72, 0,
291, 285, 288, 311, 325, 292, 259, 260, 53, 51,
55, 32, 63, 64, 66, 275, 270, 257, 68, 70,
259, 264, 246, 325, 325, 325, 325, 325, 325, 124,
325, 325, 325, 301, 301, 325, 325, 0, 100, 0,
275, 325, 325, 280, 325, 325, 325, 325, 325, 109,
325, 116, 135, 150, 325, 325, 325, 325, 0, 272,
274, 0, 325, 325, 263, 258, 248, 84, 250, 0,
242, 94, 242, 245, 238, 236, 0, 85, 242, 247,
234, 229, 242, 237, 230, 235, 94, 230, 245, 243,
226, 124, 234, 325, 325, 325, 130, 325, 325, 325,
325, 325, 325, 325, 325, 0, 325, 0, 0, 325,
166, 169, 172, 246, 0, 228, 239, 221, 219, 0,
232, 231, 216, 0, 0, 231, 222, 230, 226, 0,
223, 0, 226, 209, 214, 222, 205, 0, 215, 214,
203, 208, 202, 200, 204, 202, 205, 141, 0, 218,
231, 203, 207, 202, 191, 0, 0, 190, 199, 0,
184, 187, 197, 0, 185, 0, 186, 183, 180, 0,
181, 151, 164, 146, 152, 161, 325, 0, 0, 0,
0, 152, 159, 154, 149, 0, 153, 0, 154, 146,
0, 138, 0, 129, 130, 134, 133, 0, 116, 0,
117, 115, 0, 0, 0, 110, 0, 0, 93, 79,
83, 62, 0, 0, 0, 0, 0, 0, 325, 205,
209, 213, 217, 219, 221, 225, 229, 231, 103
} ;
static yyconst short int yy_def[260] =
{ 0,
249, 1, 250, 250, 251, 251, 252, 252, 249, 249,
249, 249, 249, 249, 253, 254, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249, 249, 249, 249, 255,
255, 255, 255, 249, 249, 249, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 249, 249, 249, 249, 249, 249, 249, 256,
249, 249, 249, 257, 249, 249, 249, 253, 249, 258,
258, 249, 249, 249, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249, 249, 249, 255, 255,
255, 255, 249, 249, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 249, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 259, 249, 258, 258, 249,
249, 249, 249, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 249, 259, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 249, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 0, 249,
249, 249, 249, 249, 249, 249, 249, 249, 249
} ;
static yyconst short int yy_nxt[387] =
{ 0,
10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
20, 21, 22, 23, 24, 25, 25, 25, 26, 27,
28, 29, 30, 31, 30, 32, 30, 30, 30, 30,
33, 34, 35, 36, 37, 38, 39, 40, 41, 42,
43, 30, 44, 30, 45, 46, 47, 30, 48, 30,
49, 50, 51, 30, 30, 52, 30, 30, 53, 54,
55, 58, 58, 59, 59, 62, 62, 66, 69, 69,
69, 74, 78, 76, 80, 80, 80, 63, 63, 103,
79, 75, 77, 71, 82, 104, 83, 83, 83, 99,
60, 60, 87, 88, 64, 64, 84, 97, 100, 101,
98, 105, 114, 107, 109, 179, 115, 67, 248, 84,
108, 102, 116, 110, 106, 69, 69, 69, 117, 118,
119, 247, 159, 120, 80, 80, 80, 121, 126, 246,
149, 141, 141, 141, 84, 150, 153, 160, 169, 127,
127, 84, 154, 245, 170, 178, 178, 84, 82, 244,
83, 83, 83, 243, 84, 128, 207, 207, 129, 130,
84, 142, 142, 131, 242, 143, 143, 143, 175, 241,
132, 240, 239, 84, 133, 238, 134, 176, 135, 237,
136, 141, 141, 141, 143, 143, 143, 143, 143, 143,
236, 84, 235, 234, 233, 232, 231, 230, 229, 228,
227, 226, 225, 224, 84, 56, 56, 56, 56, 57,
57, 57, 57, 61, 61, 61, 61, 68, 223, 68,
68, 70, 70, 89, 89, 125, 222, 125, 125, 137,
137, 137, 137, 138, 138, 221, 220, 219, 218, 217,
216, 215, 214, 213, 212, 211, 210, 209, 208, 206,
205, 204, 203, 202, 201, 200, 199, 198, 197, 196,
195, 194, 193, 192, 191, 190, 189, 188, 187, 186,
185, 184, 183, 182, 181, 180, 177, 174, 173, 172,
171, 168, 167, 166, 165, 164, 163, 162, 161, 158,
157, 156, 155, 152, 151, 148, 147, 146, 145, 144,
140, 139, 65, 93, 124, 123, 122, 113, 112, 111,
96, 95, 94, 93, 92, 91, 90, 86, 85, 81,
73, 72, 65, 249, 9, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249
} ;
static yyconst short int yy_chk[387] =
{ 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, 5, 6, 5, 6, 7, 8, 13, 16, 16,
16, 20, 22, 21, 23, 23, 23, 7, 8, 42,
22, 20, 21, 16, 25, 42, 25, 25, 25, 40,
5, 6, 29, 29, 7, 8, 25, 39, 40, 41,
39, 43, 49, 44, 45, 259, 49, 13, 242, 25,
44, 41, 50, 45, 43, 69, 69, 69, 50, 50,
50, 241, 108, 50, 80, 80, 80, 50, 60, 240,
98, 82, 82, 82, 80, 98, 102, 108, 117, 60,
60, 82, 102, 239, 117, 127, 127, 80, 83, 236,
83, 83, 83, 232, 82, 60, 178, 178, 60, 60,
83, 84, 84, 60, 231, 84, 84, 84, 122, 229,
60, 227, 226, 83, 60, 225, 60, 122, 60, 224,
60, 141, 141, 141, 142, 142, 142, 143, 143, 143,
222, 141, 220, 219, 217, 215, 214, 213, 212, 206,
205, 204, 203, 202, 141, 250, 250, 250, 250, 251,
251, 251, 251, 252, 252, 252, 252, 253, 201, 253,
253, 254, 254, 255, 255, 256, 199, 256, 256, 257,
257, 257, 257, 258, 258, 198, 197, 195, 193, 192,
191, 189, 188, 185, 184, 183, 182, 181, 180, 177,
176, 175, 174, 173, 172, 171, 170, 169, 167, 166,
165, 164, 163, 161, 159, 158, 157, 156, 153, 152,
151, 149, 148, 147, 146, 144, 123, 121, 120, 119,
118, 116, 115, 114, 113, 112, 111, 110, 109, 106,
105, 104, 103, 101, 99, 97, 96, 95, 91, 90,
74, 71, 65, 64, 53, 52, 51, 48, 47, 46,
38, 37, 36, 34, 33, 32, 31, 28, 27, 24,
18, 17, 11, 9, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249, 249, 249, 249, 249,
249, 249, 249, 249, 249, 249
} ;
static yy_state_type yy_last_accepting_state;
static char *yy_last_accepting_cpos;
/* 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 "awk.lx.l"
#define INITIAL 0
#line 2 "awk.lx.l"
/*
Changes by Gunnar Ritter, Freiburg i. Br., Germany, December 2002.
Sccsid @(#)awk.lx.l 1.13 (gritter) 11/22/05>
*/
/* UNIX(R) Regular Expression Tools
Copyright (C) 2001 Caldera International, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to:
Free Software Foundation, Inc.
59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
/*
* flex port partially taken from 4.4BSD awk,
*
* Copyright (c) 1991
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/* copyright "%c%" */
/* from unixsrc:usr/src/common/cmd/awk/awk.lx.l /main/uw7_nj/1 */
/* from RCS Header: awk.lx.l 1.2 91/06/25 */
/*%Start A str sc reg comment*/
/*%X A str sc reg comment*/
#define A 1
#define str 2
#define reg 3
#line 71 "awk.lx.l"
#include "awk.h"
#include "y.tab.h"
#include <pfmt.h>
#include <unistd.h>
static void awk_unputstr(const char *s);
#ifdef FLEX_SCANNER
static int awk_yytchar;
int awk_input(void);
static void awk_unput(int c);
#undef YY_INPUT
#define YY_INPUT(buf, result, max_size) { \
int c = awk_input(); \
result = (c == EOF || c == '\0') ? YY_NULL : (buf[0] = c, 1); \
}
#else /* !FLEX_SCANNER */
#undef input /* defeat lex */
#undef unput
int input(void);
void unput(int c);
#define awk_unput(c) unput(c)
#define awk_yytchar yytchar
#endif /* !FLEX_SCANNER */
extern YYSTYPE yylval;
extern int infunc;
int lineno = 1;
int bracecnt = 0;
int brackcnt = 0;
int parencnt = 0;
#define DEBUG
#ifdef DEBUG
# define RET(x) {if(dbg)printf("lex %s [%s]\n", tokname(x), yytext); return(x); }
#else
# define RET(x) return(x)
#endif
#define CADD cbuf[clen++] = yytext[0]; \
if (clen >= CBUFLEN-1) { \
vyyerror(":90:String/reg expr %.10s ... too long", cbuf); \
BEGIN INITIAL; \
}
static const char extra[] = ":91:Extra %c";
extern const char nlstring[];
unsigned char cbuf[CBUFLEN];
unsigned char *s;
int clen, cflag;
/* 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 133 "awk.lx.l"
static int sc_flag = 0;
if (sc_flag) {
BEGIN INITIAL;
sc_flag = 0;
RET('}');
}
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_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 >= 250 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
++yy_cp;
}
while ( yy_base[yy_current_state] != 325 );
yy_find_action:
yy_act = yy_accept[yy_current_state];
if ( yy_act == 0 )
{ /* have to back up */
yy_cp = yy_last_accepting_cpos;
yy_current_state = yy_last_accepting_state;
yy_act = yy_accept[yy_current_state];
}
YY_DO_BEFORE_ACTION;
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:
YY_RULE_SETUP
#line 142 "awk.lx.l"
{ lineno++; RET(NL); }
YY_BREAK
case 2:
YY_RULE_SETUP
#line 143 "awk.lx.l"
{ ; } /* strip comments */
YY_BREAK
case 3:
YY_RULE_SETUP
#line 144 "awk.lx.l"
{ ; }
YY_BREAK
case 4:
YY_RULE_SETUP
#line 145 "awk.lx.l"
lineno++;
YY_BREAK
case 5:
YY_RULE_SETUP
#line 146 "awk.lx.l"
{ RET(';'); }
YY_BREAK
case 6:
YY_RULE_SETUP
#line 148 "awk.lx.l"
{ RET(XBEGIN); }
YY_BREAK
case 7:
YY_RULE_SETUP
#line 149 "awk.lx.l"
{ RET(XEND); }
YY_BREAK
case 8:
YY_RULE_SETUP
#line 150 "awk.lx.l"
{ if (infunc) vyyerror(":92:Illegal nested function"); RET(FUNC); }
YY_BREAK
case 9:
YY_RULE_SETUP
#line 151 "awk.lx.l"
{ if (!infunc) vyyerror(":93:Return not in function"); RET(RETURN); }
YY_BREAK
case 10:
YY_RULE_SETUP
#line 152 "awk.lx.l"
{ RET(AND); }
YY_BREAK
case 11:
YY_RULE_SETUP
#line 153 "awk.lx.l"
{ RET(BOR); }
YY_BREAK
case 12:
YY_RULE_SETUP
#line 154 "awk.lx.l"
{ RET(NOT); }
YY_BREAK
case 13:
YY_RULE_SETUP
#line 155 "awk.lx.l"
{ yylval.i = NE; RET(NE); }
YY_BREAK
case 14:
YY_RULE_SETUP
#line 156 "awk.lx.l"
{ yylval.i = MATCH; RET(MATCHOP); }
YY_BREAK
case 15:
YY_RULE_SETUP
#line 157 "awk.lx.l"
{ yylval.i = NOTMATCH; RET(MATCHOP); }
YY_BREAK
case 16:
YY_RULE_SETUP
#line 158 "awk.lx.l"
{ yylval.i = LT; RET(LT); }
YY_BREAK
case 17:
YY_RULE_SETUP
#line 159 "awk.lx.l"
{ yylval.i = LE; RET(LE); }
YY_BREAK
case 18:
YY_RULE_SETUP
#line 160 "awk.lx.l"
{ yylval.i = EQ; RET(EQ); }
YY_BREAK
case 19:
YY_RULE_SETUP
#line 161 "awk.lx.l"
{ yylval.i = GE; RET(GE); }
YY_BREAK
case 20:
YY_RULE_SETUP
#line 162 "awk.lx.l"
{ yylval.i = GT; RET(GT); }
YY_BREAK
case 21:
YY_RULE_SETUP
#line 163 "awk.lx.l"
{ yylval.i = APPEND; RET(APPEND); }
YY_BREAK
case 22:
YY_RULE_SETUP
#line 164 "awk.lx.l"
{ yylval.i = INCR; RET(INCR); }
YY_BREAK
case 23:
YY_RULE_SETUP
#line 165 "awk.lx.l"
{ yylval.i = DECR; RET(DECR); }
YY_BREAK
case 24:
YY_RULE_SETUP
#line 166 "awk.lx.l"
{ yylval.i = ADDEQ; RET(ASGNOP); }
YY_BREAK
case 25:
YY_RULE_SETUP
#line 167 "awk.lx.l"
{ yylval.i = SUBEQ; RET(ASGNOP); }
YY_BREAK
case 26:
YY_RULE_SETUP
#line 168 "awk.lx.l"
{ yylval.i = MULTEQ; RET(ASGNOP); }
YY_BREAK
case 27:
YY_RULE_SETUP
#line 169 "awk.lx.l"
{ yylval.i = DIVEQ; RET(ASGNOP); }
YY_BREAK
case 28:
YY_RULE_SETUP
#line 170 "awk.lx.l"
{ yylval.i = MODEQ; RET(ASGNOP); }
YY_BREAK
case 29:
YY_RULE_SETUP
#line 171 "awk.lx.l"
{ yylval.i = POWEQ; RET(ASGNOP); }
YY_BREAK
case 30:
YY_RULE_SETUP
#line 172 "awk.lx.l"
{ yylval.i = POWEQ; RET(ASGNOP); }
YY_BREAK
case 31:
YY_RULE_SETUP
#line 173 "awk.lx.l"
{ yylval.i = ASSIGN; RET(ASGNOP); }
YY_BREAK
case 32:
YY_RULE_SETUP
#line 174 "awk.lx.l"
{ RET(POWER); }
YY_BREAK
case 33:
YY_RULE_SETUP
#line 175 "awk.lx.l"
{ RET(POWER); }
YY_BREAK
case 34:
YY_RULE_SETUP
#line 177 "awk.lx.l"
{ yylval.cp = fieldadr(atoi(yytext+1)); RET(FIELD); }
YY_BREAK
case 35:
YY_RULE_SETUP
#line 178 "awk.lx.l"
{ awk_unputstr("(NF)"); return(INDIRECT); }
YY_BREAK
case 36:
YY_RULE_SETUP
#line 179 "awk.lx.l"
{ int c, n;
c = awk_yytchar;
if (c == '(' || c == '[' || infunc && (n=isarg(yytext+1)) >= 0) {
awk_unputstr(yytext+1);
return(INDIRECT);
} else {
yylval.cp = setsymtab((unsigned char *)yytext+1,"",0.0,STR|NUM,symtab);
RET(IVAR);
}
}
YY_BREAK
case 37:
YY_RULE_SETUP
#line 189 "awk.lx.l"
{ RET(INDIRECT); }
YY_BREAK
case 38:
YY_RULE_SETUP
#line 190 "awk.lx.l"
{ yylval.cp = setsymtab((unsigned char *)yytext, "", 0.0, NUM, symtab); RET(VARNF); }
YY_BREAK
case 39:
YY_RULE_SETUP
#line 192 "awk.lx.l"
{
yylval.cp = setsymtab((unsigned char *)yytext, tostring((unsigned char *)yytext), awk_atof(yytext), CON|NUM, symtab);
RET(NUMBER); }
YY_BREAK
case 40:
YY_RULE_SETUP
#line 196 "awk.lx.l"
{ RET(WHILE); }
YY_BREAK
case 41:
YY_RULE_SETUP
#line 197 "awk.lx.l"
{ RET(FOR); }
YY_BREAK
case 42:
YY_RULE_SETUP
#line 198 "awk.lx.l"
{ RET(DO); }
YY_BREAK
case 43:
YY_RULE_SETUP
#line 199 "awk.lx.l"
{ RET(IF); }
YY_BREAK
case 44:
YY_RULE_SETUP
#line 200 "awk.lx.l"
{ RET(ELSE); }
YY_BREAK
case 45:
YY_RULE_SETUP
#line 201 "awk.lx.l"
{ RET(NEXT); }
YY_BREAK
case 46:
YY_RULE_SETUP
#line 202 "awk.lx.l"
{ RET(EXIT); }
YY_BREAK
case 47:
YY_RULE_SETUP
#line 203 "awk.lx.l"
{ RET(BREAK); }
YY_BREAK
case 48:
YY_RULE_SETUP
#line 204 "awk.lx.l"
{ RET(CONTINUE); }
YY_BREAK
case 49:
YY_RULE_SETUP
#line 205 "awk.lx.l"
{ yylval.i = PRINT; RET(PRINT); }
YY_BREAK
case 50:
YY_RULE_SETUP
#line 206 "awk.lx.l"
{ yylval.i = PRINTF; RET(PRINTF); }
YY_BREAK
case 51:
YY_RULE_SETUP
#line 207 "awk.lx.l"
{ yylval.i = SPRINTF; RET(SPRINTF); }
YY_BREAK
case 52:
YY_RULE_SETUP
#line 208 "awk.lx.l"
{ yylval.i = SPLIT; RET(SPLIT); }
YY_BREAK
case 53:
YY_RULE_SETUP
#line 209 "awk.lx.l"
{ RET(SUBSTR); }
YY_BREAK
case 54:
YY_RULE_SETUP
#line 210 "awk.lx.l"
{ yylval.i = SUB; RET(SUB); }
YY_BREAK
case 55:
YY_RULE_SETUP
#line 211 "awk.lx.l"
{ yylval.i = GSUB; RET(GSUB); }
YY_BREAK
case 56:
YY_RULE_SETUP
#line 212 "awk.lx.l"
{ RET(INDEX); }
YY_BREAK
case 57:
YY_RULE_SETUP
#line 213 "awk.lx.l"
{ RET(MATCHFCN); }
YY_BREAK
case 58:
YY_RULE_SETUP
#line 214 "awk.lx.l"
{ RET(IN); }
YY_BREAK
case 59:
YY_RULE_SETUP
#line 215 "awk.lx.l"
{ RET(GETLINE); }
YY_BREAK
case 60:
YY_RULE_SETUP
#line 216 "awk.lx.l"
{ RET(DELETE); }
YY_BREAK
case 61:
YY_RULE_SETUP
#line 217 "awk.lx.l"
{ yylval.i = FLENGTH; RET(BLTIN); }
YY_BREAK
case 62:
YY_RULE_SETUP
#line 218 "awk.lx.l"
{ yylval.i = FLOG; RET(BLTIN); }
YY_BREAK
case 63:
YY_RULE_SETUP
#line 219 "awk.lx.l"
{ yylval.i = FINT; RET(BLTIN); }
YY_BREAK
case 64:
YY_RULE_SETUP
#line 220 "awk.lx.l"
{ yylval.i = FEXP; RET(BLTIN); }
YY_BREAK
case 65:
YY_RULE_SETUP
#line 221 "awk.lx.l"
{ yylval.i = FSQRT; RET(BLTIN); }
YY_BREAK
case 66:
YY_RULE_SETUP
#line 222 "awk.lx.l"
{ yylval.i = FSIN; RET(BLTIN); }
YY_BREAK
case 67:
YY_RULE_SETUP
#line 223 "awk.lx.l"
{ yylval.i = FCOS; RET(BLTIN); }
YY_BREAK
case 68:
YY_RULE_SETUP
#line 224 "awk.lx.l"
{ yylval.i = FATAN; RET(BLTIN); }
YY_BREAK
case 69:
YY_RULE_SETUP
#line 225 "awk.lx.l"
{ yylval.i = FSYSTEM; RET(BLTIN); }
YY_BREAK
case 70:
YY_RULE_SETUP
#line 226 "awk.lx.l"
{ yylval.i = FRAND; RET(BLTIN); }
YY_BREAK
case 71:
YY_RULE_SETUP
#line 227 "awk.lx.l"
{ yylval.i = FSRAND; RET(BLTIN); }
YY_BREAK
case 72:
YY_RULE_SETUP
#line 228 "awk.lx.l"
{ yylval.i = FTOUPPER; RET(BLTIN); }
YY_BREAK
case 73:
YY_RULE_SETUP
#line 229 "awk.lx.l"
{ yylval.i = FTOLOWER; RET(BLTIN); }
YY_BREAK
case 74:
YY_RULE_SETUP
#line 230 "awk.lx.l"
{ yylval.i = FCLOSE; RET(BLTIN); }
YY_BREAK
case 75:
YY_RULE_SETUP
#line 232 "awk.lx.l"
{ int n, c;
c = awk_yytchar; /* look for '(' */
if (c != '(' && infunc && (n=isarg(yytext)) >= 0) {
yylval.i = n;
RET(ARG);
} else {
yylval.cp = setsymtab((unsigned char *)yytext,"",0.0,STR|NUM,symtab);
if (c == '(') {
RET(CALL);
} else {
RET(VAR);
}
}
}
YY_BREAK
case 76:
YY_RULE_SETUP
#line 246 "awk.lx.l"
{ BEGIN str; clen = 0; }
YY_BREAK
case 77:
YY_RULE_SETUP
#line 248 "awk.lx.l"
{ if (--bracecnt < 0) vyyerror(extra, '}'); sc_flag = 1; RET(';'); }
YY_BREAK
case 78:
YY_RULE_SETUP
#line 249 "awk.lx.l"
{ if (--brackcnt < 0) vyyerror(extra, ']'); RET(']'); }
YY_BREAK
case 79:
YY_RULE_SETUP
#line 250 "awk.lx.l"
{ if (--parencnt < 0) vyyerror(extra, ')'); RET(')'); }
YY_BREAK
case 80:
YY_RULE_SETUP
#line 252 "awk.lx.l"
{ if (yytext[0] == '{') bracecnt++;
else if (yytext[0] == '[') brackcnt++;
else if (yytext[0] == '(') parencnt++;
RET(yylval.i = yytext[0]); /* everything else */ }
YY_BREAK
case 81:
YY_RULE_SETUP
#line 257 "awk.lx.l"
{ cbuf[clen++] = '\\'; cbuf[clen++] = yytext[1]; }
YY_BREAK
case 82:
YY_RULE_SETUP
#line 258 "awk.lx.l"
{ vyyerror(":94:Newline in regular expression %.10s ...", cbuf); lineno++; BEGIN INITIAL; }
YY_BREAK
case 83:
YY_RULE_SETUP
#line 259 "awk.lx.l"
{ BEGIN INITIAL;
cbuf[clen] = 0;
yylval.s = tostring(cbuf);
awk_unput('/');
RET(REGEXPR); }
YY_BREAK
case 84:
YY_RULE_SETUP
#line 264 "awk.lx.l"
{ CADD; }
YY_BREAK
case 85:
YY_RULE_SETUP
#line 266 "awk.lx.l"
{ BEGIN INITIAL;
cbuf[clen] = 0; s = tostring(cbuf);
cbuf[clen] = ' '; cbuf[++clen] = 0;
yylval.cp = setsymtab(cbuf, s, 0.0, CON|STR, symtab);
RET(STRING); }
YY_BREAK
case 86:
YY_RULE_SETUP
#line 271 "awk.lx.l"
{ vyyerror(nlstring, cbuf); lineno++; BEGIN INITIAL; }
YY_BREAK
case 87:
YY_RULE_SETUP
#line 272 "awk.lx.l"
{ cbuf[clen++] = '"'; }
YY_BREAK
case 88:
YY_RULE_SETUP
#line 273 "awk.lx.l"
{ cbuf[clen++] = '\n'; }
YY_BREAK
case 89:
YY_RULE_SETUP
#line 274 "awk.lx.l"
{ cbuf[clen++] = '\t'; }
YY_BREAK
case 90:
YY_RULE_SETUP
#line 275 "awk.lx.l"
{ cbuf[clen++] = '\f'; }
YY_BREAK
case 91:
YY_RULE_SETUP
#line 276 "awk.lx.l"
{ cbuf[clen++] = '\r'; }
YY_BREAK
case 92:
YY_RULE_SETUP
#line 277 "awk.lx.l"
{ cbuf[clen++] = '\b'; }
YY_BREAK
case 93:
YY_RULE_SETUP
#line 278 "awk.lx.l"
{ cbuf[clen++] = '\v'; } /* these ANSIisms may not be known by */
YY_BREAK
case 94:
YY_RULE_SETUP
#line 279 "awk.lx.l"
{ cbuf[clen++] = '\007'; } /* your compiler. hence 007 for bell */
YY_BREAK
case 95:
YY_RULE_SETUP
#line 280 "awk.lx.l"
{ cbuf[clen++] = '\\'; }
YY_BREAK
case 96:
YY_RULE_SETUP
#line 281 "awk.lx.l"
{ int n;
sscanf(yytext+1, "%o", &n); cbuf[clen++] = n; }
YY_BREAK
case 97:
YY_RULE_SETUP
#line 283 "awk.lx.l"
{ int n; /* ANSI permits any number! */
sscanf(yytext+2, "%x", &n); cbuf[clen++] = n; }
YY_BREAK
case 98:
YY_RULE_SETUP
#line 285 "awk.lx.l"
{ cbuf[clen++] = yytext[1]; }
YY_BREAK
case 99:
YY_RULE_SETUP
#line 286 "awk.lx.l"
{ CADD; }
YY_BREAK
case 100:
YY_RULE_SETUP
#line 288 "awk.lx.l"
ECHO;
YY_BREAK
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(A):
case YY_STATE_EOF(str):
case YY_STATE_EOF(reg):
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;
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->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()
{
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;
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 >= 250 )
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 );
*/
#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 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 >= 250 )
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 == 249);
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 288 "awk.lx.l"
void
startreg(void)
{
BEGIN reg;
clen = 0;
}
/* input() and unput() were transcriptions of the standard lex
macros for input and output with additions for error message
printing. God help us all if someone changes how lex works.
- Luckily, the BSD people did most of the flex porting already
for oawk.
*/
unsigned char ebuf[300];
unsigned char *ep = ebuf;
#ifdef FLEX_SCANNER
int
awk_input(void)
{
register int c;
extern unsigned char *lexprog;
if (lexprog != NULL) { /* awk '...' */
if (c = *lexprog & 0377)
lexprog++;
} else /* awk -f ... */
c = pgetc();
if (c == EOF)
c = 0;
if (ep >= ebuf + sizeof ebuf)
ep = ebuf;
awk_yytchar = c;
return *ep++ = c;
}
static void
awk_unput(int c)
{
awk_yytchar = c;
unput(c);
}
#else /* !FLEX_SCANNER */
int
input(void)
{
register int c;
extern unsigned char *lexprog;
if (yysptr > yysbuf)
c = U(*--yysptr) & 0377;
else if (lexprog != NULL) { /* awk '...' */
if (c = *lexprog & 0377)
lexprog++;
} else /* awk -f ... */
c = pgetc();
if (c == '\n')
yylineno++;
else if (c == EOF)
c = 0;
if (ep >= ebuf + sizeof ebuf)
ep = ebuf;
return *ep++ = c;
}
int
awk_input(void)
{
return input();
}
void
unput(int c)
{
yytchar = c;
if (yytchar == '\n')
yylineno--;
*yysptr++ = yytchar;
if (--ep < ebuf)
ep = ebuf + sizeof(ebuf) - 1;
}
#endif /* !FLEX_SCANNER */
static void
awk_unputstr(const char *s)
{
int i;
for (i = strlen(s)-1; i >= 0; i--)
awk_unput(s[i]);
}
syntax highlighted by Code2HTML, v. 0.9.1