Subversion Repositories Kolibri OS

#define YY_FLEX_MAJOR_VERSION 2

#define YY_FLEX_MINOR_VERSION 5

#define YY_FLEX_SUBMINOR_VERSION 35

#if YY_FLEX_SUBMINOR_VERSION > 0

#define FLEX_BETA

#endif

#include 

#include 

#include 

#include 

#define FLEXINT_H

 * if you want the limit (max/min) macros for int types.

 */

#ifndef __STDC_LIMIT_MACROS

#define __STDC_LIMIT_MACROS 1

#endif

typedef int8_t flex_int8_t;

typedef uint8_t flex_uint8_t;

typedef int16_t flex_int16_t;

typedef uint16_t flex_uint16_t;

typedef int32_t flex_int32_t;

typedef uint32_t flex_uint32_t;

typedef uint64_t flex_uint64_t;

#else

typedef signed char flex_int8_t;

typedef short int flex_int16_t;

typedef int flex_int32_t;

typedef unsigned char flex_uint8_t;

typedef unsigned short int flex_uint16_t;

typedef unsigned int flex_uint32_t;

#endif /* ! C99 */

#ifndef INT8_MIN

#define INT8_MIN               (-128)

#endif

#ifndef INT16_MIN

#define INT16_MIN              (-32767-1)

#endif

#ifndef INT32_MIN

#define INT32_MIN              (-2147483647-1)

#endif

#ifndef INT8_MAX

#define INT8_MAX               (127)

#endif

#ifndef INT16_MAX

#define INT16_MAX              (32767)

#endif

#ifndef INT32_MAX

#define INT32_MAX              (2147483647)

#endif

#ifndef UINT8_MAX

#define UINT8_MAX              (255U)

#endif

#ifndef UINT16_MAX

#define UINT16_MAX             (65535U)

#endif

#ifndef UINT32_MAX

#define UINT32_MAX             (4294967295U)

#endif

#define YY_USE_CONST

#if defined (__STDC__)

#endif	/* ! __cplusplus */

#define yyconst const

#else

#define yyconst

#endif

#define YY_NULL 0

 * 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)

 * but we do it the disgusting crufty way forced on us by the ()-less

 * definition of BEGIN.

 */

#define BEGIN (yy_start) = 1 + 2 *

 * 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

#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)

#define YY_NEW_FILE yyrestart(yyin  )

#ifndef YY_BUF_SIZE

#define YY_BUF_SIZE 16384

#endif

 */

#define YY_STATE_BUF_SIZE   ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))

#define YY_TYPEDEF_YY_BUFFER_STATE

typedef struct yy_buffer_state *YY_BUFFER_STATE;

#endif

#define YY_TYPEDEF_YY_SIZE_T

typedef size_t yy_size_t;

#endif

#define EOB_ACT_END_OF_FILE 1

#define EOB_ACT_LAST_MATCH 2

#define yyless(n) \

	do \

		{ \

		/* Undo effects of setting up yytext. */ \

        int yyless_macro_arg = (n); \

        YY_LESS_LINENO(yyless_macro_arg);\

		*yy_cp = (yy_hold_char); \

		YY_RESTORE_YY_MORE_OFFSET \

		(yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \

		YY_DO_BEFORE_ACTION; /* set up yytext again */ \

		} \

	while ( 0 )

#define YY_STRUCT_YY_BUFFER_STATE

struct yy_buffer_state

	{

	FILE *yy_input_file;

	char *yy_buf_pos;		/* current position in input buffer */

	 * characters.

	 */

	yy_size_t yy_buf_size;

	 * characters.

	 */

	yy_size_t yy_n_chars;

	 * and can realloc() it to grow it, and should free() it to

	 * delete it.

	 */

	int yy_is_our_buffer;

	 * 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;

	 * If so, '^' rules will be active on the next match, otherwise

	 * not.

	 */

	int yy_at_bol;

    int yy_bs_column; /**< The column count. */

	 * end of it.

	 */

	int yy_fill_buffer;

#define YY_BUFFER_NORMAL 1

	/* When an EOF's been seen but there's still some text to process

	 * then we mark the buffer as YY_EOF_PENDING, to indicate that we

	 * shouldn't try reading from the input source any more.  We might

	 * still have a bunch of tokens to match, though, because of

	 * possible backing-up.

	 *

	 * When we actually see the EOF, we change the status to "new"

	 * (via yyrestart()), so that the user can continue scanning by

	 * just pointing yyin at a new input file.

	 */

#define YY_BUFFER_EOF_PENDING 2

#endif /* !YY_STRUCT_YY_BUFFER_STATE */

static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */

static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */

static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */

 * future we want to put the buffer states in a more general

 * "scanner state".

 *

 * Returns the top of the stack, or NULL.

 */

#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \

                          ? (yy_buffer_stack)[(yy_buffer_stack_top)] \

                          : NULL)

 * NULL or when we need an lvalue. For internal use only.

 */

#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]

static char yy_hold_char;

static yy_size_t yy_n_chars;		/* number of characters read into yy_ch_buf */

yy_size_t yyleng;

static char *yy_c_buf_p = (char *) 0;

static int yy_init = 0;		/* whether we need to initialize */

static int yy_start = 0;	/* start state number */

 * instead of setting up a fresh yyin.  A bit of a hack ...

 */

static int yy_did_buffer_switch_on_eof;

void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer  );

YY_BUFFER_STATE yy_create_buffer (FILE *file,int size  );

void yy_delete_buffer (YY_BUFFER_STATE b  );

void yy_flush_buffer (YY_BUFFER_STATE b  );

void yypush_buffer_state (YY_BUFFER_STATE new_buffer  );

void yypop_buffer_state (void );

static void yy_load_buffer_state (void );

static void yy_init_buffer (YY_BUFFER_STATE b,FILE *file  );

YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str  );

YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,yy_size_t len  );

void *yyrealloc (void *,yy_size_t  );

void yyfree (void *  );

	{ \

	if ( ! YY_CURRENT_BUFFER ){ \

        yyensure_buffer_stack (); \

		YY_CURRENT_BUFFER_LVALUE =    \

            yy_create_buffer(yyin,YY_BUF_SIZE ); \

	} \

	YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \

	}

	{ \

	if ( ! YY_CURRENT_BUFFER ){\

        yyensure_buffer_stack (); \

		YY_CURRENT_BUFFER_LVALUE =    \

            yy_create_buffer(yyin,YY_BUF_SIZE ); \

	} \

	YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \

	}

#define yytext_ptr yytext

static yy_state_type yy_try_NUL_trans (yy_state_type current_state  );

static int yy_get_next_buffer (void );

static void yy_fatal_error (yyconst char msg[]  );

 * corresponding action - sets up yytext.

 */

#define YY_DO_BEFORE_ACTION \

	(yytext_ptr) = yy_bp; \

	yyleng = (yy_size_t) (yy_cp - yy_bp); \

	(yy_hold_char) = *yy_cp; \

	*yy_cp = '\0'; \

	(yy_c_buf_p) = yy_cp;

#define YY_END_OF_BUFFER 41

/* This struct is not used in this scanner,

   but its presence is necessary. */

struct yy_trans_info

	{

	flex_int32_t yy_verify;

	flex_int32_t yy_nxt;

	};

static yyconst flex_int16_t yy_accept[177] =

    {   0,

        0,    0,   41,   40,   39,   38,   35,   32,   33,   36,

       40,   34,   37,   35,   35,   35,   35,   35,   35,   35,

       35,   35,   35,   35,   35,   35,   35,   35,   35,   35,

       35,   35,   35,   35,   35,   35,   36,   31,   37,   35,

       35,   35,   35,   35,   35,   35,   35,   35,   35,   35,

       35,   35,   35,   35,   35,   35,   35,   35,   35,   35,

       35,   35,   35,   35,   35,   35,   35,   35,   35,   35,

       35,   35,    7,   35,   35,   35,   35,   35,   35,   35,

       35,   35,   35,   35,   35,   35,   22,   35,   35,   35,

       35,   35,   35,   35,   35,   35,   35,   35,   35,   35,

       35,   35,   35,   35,   35,   35,   35,   25,   26,   27,

       35,   30,   35,   35,   35,    3,   35,   35,   35,   35,

       35,   35,   35,   35,   35,   18,   35,   35,   35,   35,

       35,   35,   35,    1,    2,    4,    5,   35,   35,   35,

       35,   35,   16,   17,   19,   20,   35,   35,   35,   35,

       35,   35,    8,    9,   13,   14,   35,   23,   24,   28,

       29,   35,   35,    6,   21,    0

    } ;

    {   0,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    2,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    3,    1,    1,    1,    4,    1,    1,    1,    5,

        6,    7,    8,    9,    4,    4,    4,    4,    4,    4,

        4,    4,    4,    4,    4,    4,    4,    4,   10,    1,

        1,    1,    1,    1,   11,   12,   13,   14,   15,   16,

        4,   17,   18,    4,    4,   19,   20,   21,   22,   23,

        4,   24,   25,   26,   27,   28,    4,   29,   30,    4,

        1,    4,    1,    1,    4,    1,   31,   32,   33,   34,

       42,   43,    4,   44,   45,   46,   47,   48,    4,   49,

       50,    4,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1

    } ;

    {   0,

        1,    2,    1,    3,    1,    1,    1,    1,    1,    1,

        3,    3,    3,    3,    3,    3,    3,    3,    3,    3,

        3,    3,    3,    3,    3,    3,    3,    3,    3,    3,

        3,    3,    3,    3,    3,    3,    3,    3,    3,    3,

        3,    3,    3,    3,    3,    3,    3,    3,    3,    3

    } ;

    {   0,

        0,    0,  193,  194,  194,  194,    0,  194,  194,    0,

      190,  194,    0,  177,   32,   37,   32,  163,  174,  170,

      164,  171,  174,  169,  149,   15,   22,   17,  135,  146,

      142,  136,  143,  146,  141,    0,    0,  194,    0,  161,

      159,  158,  153,  147,  156,  143,  149,  148,  141,  150,

      141,  135,  138,  127,  125,  124,  119,  113,  122,  109,

      115,  114,  107,  116,  107,  101,  104,   43,  136,  135,

      130,  129,    0,  119,  123,  118,  114,  118,  119,  122,

      124,   25,  104,  103,   98,   97,    0,   87,   91,   86,

       82,   86,   87,   90,   92,  105,  100,   97,   94,   93,

       70,   67,   64,   63,   75,   76,   72,    0,    0,    0,

       74,    0,   62,   91,   88,    0,   86,   85,   73,   85,

       79,   83,   70,   62,   59,    0,   57,   56,   44,   56,

       50,   54,   41,    0,    0,    0,    0,   63,   58,   59,

       67,   66,    0,    0,    0,    0,   38,   33,   34,   42,

       41,   51,    0,    0,    0,    0,   30,    0,    0,    0,

        0,   43,   21,    0,    0,  194,   65,   66,   69

    } ;

    {   0,

      176,    1,  176,  176,  176,  176,  177,  176,  176,  178,

      176,  176,  179,  177,  177,  177,  177,  177,  177,  177,

      177,  177,  177,  177,  177,  177,  177,  177,  177,  177,

      177,  177,  177,  177,  177,  177,  178,  176,  179,  177,

      177,  177,  177,  177,  177,  177,  177,  177,  177,  177,

      177,  177,  177,  177,  177,  177,  177,  177,  177,  177,

      177,  177,  177,  177,  177,  177,  177,  177,  177,  177,

      177,  177,  177,  177,  177,  177,  177,  177,  177,  177,

      177,  177,  177,  177,  177,  177,  177,  177,  177,  177,

      177,  177,  177,  177,  177,  177,  177,  177,  177,  177,

      177,  177,  177,  177,  177,  177,  177,  177,  177,  177,

      177,  177,  177,  177,  177,  177,  177,  177,  177,  177,

      177,  177,  177,  177,  177,  177,  177,  177,  177,  177,

      177,  177,  177,  177,  177,  177,  177,  177,  177,  177,

      177,  177,  177,  177,  177,  177,  177,  177,  177,  177,

      177,  177,  177,  177,  177,  177,  177,  177,  177,  177,

      177,  177,  177,  177,  177,    0,  176,  176,  176

    } ;

    {   0,

        4,    5,    6,    7,    8,    9,   10,   11,   12,   13,

       14,    7,   15,   16,   17,   18,   19,    7,   20,    7,

        7,   21,    7,   22,   23,    7,    7,   24,    7,    7,

       25,    7,   26,   27,   28,   29,   30,    7,   31,    7,

        7,   32,    7,   33,   34,    7,    7,   35,    7,    7,

       41,   43,   45,   55,   44,   42,   57,   59,   56,   58,

       46,   96,   97,  110,  111,   60,   37,   36,   37,   39,

      175,   39,  174,  173,  172,  171,  170,  169,  168,  167,

      166,  165,  164,  163,  162,  161,  160,  159,  158,  157,

      156,  155,  154,  153,  152,  151,  150,  149,  148,  147,

      136,  135,  134,  133,  132,  131,  130,  129,  128,  127,

      126,  125,  124,  123,  122,  121,  120,  119,  118,  117,

      116,  115,  114,  113,  112,  109,  108,  107,  106,  105,

      104,  103,  102,  101,  100,   99,   98,   95,   94,   93,

       92,   91,   90,   89,   88,   87,   86,   85,   84,   83,

       82,   81,   80,   79,   78,   77,   76,   75,   74,   73,

       72,   71,   70,   69,   68,   67,   66,   65,   64,   63,

       62,   61,   54,   53,   52,   51,   50,   49,   48,   47,

       40,   38,  176,    3,  176,  176,  176,  176,  176,  176,

      176,  176,  176,  176,  176,  176,  176,  176,  176,  176,

      176,  176,  176,  176,  176,  176,  176,  176,  176,  176,

      176,  176,  176,  176,  176,  176,  176,  176,  176,  176,

      176,  176,  176,  176

    } ;

    {   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,

       15,   16,   17,   26,   16,   15,   27,   28,   26,   27,

       17,   68,   68,   82,   82,   28,  178,  177,  178,  179,

      173,  179,  172,  167,  162,  161,  160,  159,  158,  157,

      152,  151,  150,  149,  148,  143,  142,  141,  140,  139,

      138,  137,  135,  134,  133,  132,  131,  130,  129,  128,

      112,  111,  110,  109,  107,  103,  102,  101,  100,   99,

       98,   97,   96,   95,   94,   93,   92,   91,   90,   89,

       88,   86,   85,   84,   83,   81,   80,   79,   78,   77,

       76,   75,   74,   72,   71,   70,   69,   67,   66,   65,

       64,   63,   62,   61,   60,   59,   58,   57,   56,   55,

       54,   53,   52,   51,   50,   49,   48,   47,   46,   45,

       44,   43,   42,   41,   40,   35,   34,   33,   32,   31,

       30,   29,   25,   24,   23,   22,   21,   20,   19,   18,

       14,   11,    3,  176,  176,  176,  176,  176,  176,  176,

      176,  176,  176,  176,  176,  176,  176,  176,  176,  176,

      176,  176,  176,  176,  176,  176,  176,  176,  176,  176,

      176,  176,  176,  176,  176,  176,  176,  176,  176,  176,

      176,  176,  176,  176

    } ;

static char *yy_last_accepting_cpos;

int yy_flex_debug = 0;

 * 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 "arlex.l"

#define YY_NO_INPUT 1

#line 4 "arlex.l"

/* arlex.l - Strange script language lexer */

   it under the terms of the GNU General Public License as published by

   the Free Software Foundation; either version 3 of the License, or

   (at your option) any later version.

   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.

   along with this program; if not, write to the Free Software

   Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,

   MA 02110-1301, USA.  */

#include "ansidecl.h"

#include "libiberty.h"

#include "arparse.h"

#define YY_NO_UNPUT

#endif

#line 598 "arlex.c"

/* Special case for "unistd.h", since it is non-ANSI. We include it way

 * down here because we want the user's section 1 to have been scanned first.

 * The user has a chance to override it with an option.

 */

#include 

#endif

#define YY_EXTRA_TYPE void *

#endif

   These are made visible to non-reentrant scanners for convenience. */

 * section 1.

 */

#ifdef __cplusplus

extern "C" int yywrap (void );

#else

extern int yywrap (void );

#endif

#endif

static void yy_flex_strncpy (char *,yyconst char *,int );

#endif

static int yy_flex_strlen (yyconst char * );

#endif

static int yyinput (void );

#else

static int input (void );

#endif

#ifndef YY_READ_BUF_SIZE

#define YY_READ_BUF_SIZE 8192

#endif

#ifndef ECHO

/* This used to be an fputs(), but since the string might contain NUL's,

 * we now use fwrite().

 */

#define ECHO fwrite( yytext, yyleng, 1, yyout )

#endif

 * is returned in "result".

 */

#ifndef YY_INPUT

#define YY_INPUT(buf,result,max_size) \

	if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \

		{ \

		int c = '*'; \

		yy_size_t n; \

		for ( n = 0; n < max_size && \

			     (c = getc( yyin )) != EOF && c != '\n'; ++n ) \

			buf[n] = (char) c; \

		if ( c == '\n' ) \

			buf[n++] = (char) c; \

		if ( c == EOF && ferror( yyin ) ) \

			YY_FATAL_ERROR( "input in flex scanner failed" ); \

		result = n; \

		} \

	else \

		{ \

		errno=0; \

		while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \

			{ \

			if( errno != EINTR) \

				{ \

				YY_FATAL_ERROR( "input in flex scanner failed" ); \

				break; \

				} \

			errno=0; \

			clearerr(yyin); \

			} \

		}\

\

 * 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

#ifndef YY_START_STACK_INCR

#define YY_START_STACK_INCR 25

#endif

#ifndef YY_FATAL_ERROR

#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )

#endif

 * easily add parameters.

 */

#ifndef YY_DECL

#define YY_DECL_IS_OURS 1

#endif /* !YY_DECL */

 * have been set up.

 */

#ifndef YY_USER_ACTION

#define YY_USER_ACTION

#endif

#ifndef YY_BREAK

#define YY_BREAK break;

#endif

	YY_USER_ACTION

 */

YY_DECL

{

	register yy_state_type yy_current_state;

	register char *yy_cp, *yy_bp;

	register int yy_act;

		{

		(yy_init) = 1;

		YY_USER_INIT;

#endif

			(yy_start) = 1;	/* first start state */

			yyin = stdin;

			yyout = stdout;

			yyensure_buffer_stack ();

			YY_CURRENT_BUFFER_LVALUE =

				yy_create_buffer(yyin,YY_BUF_SIZE );

		}

		}

		{

		yy_cp = (yy_c_buf_p);

		*yy_cp = (yy_hold_char);

		 * the current run.

		 */

		yy_bp = yy_cp;

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 >= 177 )

					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] != 194 );

		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];

			}

	{ /* 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;

YY_RULE_SETUP

#line 47 "arlex.l"

{ return ADDLIB; }

	YY_BREAK

case 2:

YY_RULE_SETUP

#line 48 "arlex.l"

{ return ADDMOD; }

	YY_BREAK

case 3:

YY_RULE_SETUP

#line 49 "arlex.l"

{ return CLEAR; }

	YY_BREAK

case 4:

YY_RULE_SETUP

#line 50 "arlex.l"

{ return CREATE; }

	YY_BREAK

case 5:

YY_RULE_SETUP

#line 51 "arlex.l"

{ return DELETE; }

	YY_BREAK

case 6:

YY_RULE_SETUP

#line 52 "arlex.l"

{ return DIRECTORY; }

	YY_BREAK

case 7:

YY_RULE_SETUP

#line 53 "arlex.l"

{ return END; }

	YY_BREAK

case 8:

YY_RULE_SETUP

#line 54 "arlex.l"

{ return EXTRACT; }

	YY_BREAK

case 9:

YY_RULE_SETUP

#line 55 "arlex.l"

{ return FULLDIR; }

	YY_BREAK

case 10:

YY_RULE_SETUP

#line 56 "arlex.l"

{ return HELP; }

	YY_BREAK

case 11:

YY_RULE_SETUP

#line 57 "arlex.l"

{ return LIST; }

	YY_BREAK

case 12:

YY_RULE_SETUP

#line 58 "arlex.l"

{ return OPEN; }

	YY_BREAK

case 13:

YY_RULE_SETUP

#line 59 "arlex.l"

{ return REPLACE; }

	YY_BREAK

case 14:

YY_RULE_SETUP

#line 60 "arlex.l"

{ return VERBOSE; }

	YY_BREAK

case 15:

YY_RULE_SETUP

#line 61 "arlex.l"

{ return SAVE; }

	YY_BREAK

case 16:

YY_RULE_SETUP

#line 62 "arlex.l"

{ return ADDLIB; }

	YY_BREAK

case 17:

YY_RULE_SETUP

#line 63 "arlex.l"

{ return ADDMOD; }

	YY_BREAK

case 18:

YY_RULE_SETUP

#line 64 "arlex.l"

{ return CLEAR; }

	YY_BREAK

case 19:

YY_RULE_SETUP

#line 65 "arlex.l"

{ return CREATE; }

	YY_BREAK

case 20:

YY_RULE_SETUP

#line 66 "arlex.l"

{ return DELETE; }

	YY_BREAK

case 21:

YY_RULE_SETUP

#line 67 "arlex.l"

{ return DIRECTORY; }

	YY_BREAK

case 22:

YY_RULE_SETUP

#line 68 "arlex.l"

{ return END; }

	YY_BREAK

case 23:

YY_RULE_SETUP

#line 69 "arlex.l"

{ return EXTRACT; }

	YY_BREAK

case 24:

YY_RULE_SETUP

#line 70 "arlex.l"

{ return FULLDIR; }

	YY_BREAK

case 25:

YY_RULE_SETUP

#line 71 "arlex.l"

{ return HELP; }

	YY_BREAK

case 26:

YY_RULE_SETUP

#line 72 "arlex.l"

{ return LIST; }

	YY_BREAK

case 27:

YY_RULE_SETUP

#line 73 "arlex.l"

{ return OPEN; }

	YY_BREAK

case 28:

YY_RULE_SETUP

#line 74 "arlex.l"

{ return REPLACE; }

	YY_BREAK

case 29:

YY_RULE_SETUP

#line 75 "arlex.l"

{ return VERBOSE; }

	YY_BREAK

case 30:

YY_RULE_SETUP

#line 76 "arlex.l"

{ return SAVE; }

	YY_BREAK

case 31:

/* rule 31 can match eol */

YY_RULE_SETUP

#line 77 "arlex.l"

{ linenumber ++; }

	YY_BREAK

case 32:

YY_RULE_SETUP

#line 78 "arlex.l"

{ return '('; }

	YY_BREAK

case 33:

YY_RULE_SETUP

#line 79 "arlex.l"

{ return ')'; }

	YY_BREAK

case 34:

YY_RULE_SETUP

#line 80 "arlex.l"

{ return ','; }

	YY_BREAK

case 35:

YY_RULE_SETUP

#line 81 "arlex.l"

{

		yylval.name =  xstrdup (yytext);

		return FILENAME;

		}

	YY_BREAK

case 36:

YY_RULE_SETUP

#line 85 "arlex.l"

{ }

	YY_BREAK

case 37:

YY_RULE_SETUP

#line 86 "arlex.l"

{ }

	YY_BREAK

case 38:

YY_RULE_SETUP

#line 87 "arlex.l"

{ }

	YY_BREAK

case 39:

/* rule 39 can match eol */

YY_RULE_SETUP

#line 88 "arlex.l"

{ linenumber ++; return NEWLINE; }

	YY_BREAK

case 40:

YY_RULE_SETUP

#line 90 "arlex.l"

ECHO;

	YY_BREAK

#line 1069 "arlex.c"

case YY_STATE_EOF(INITIAL):

	yyterminate();

		{

		/* Amount of text matched not including the EOB char. */

		int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1;

		*yy_cp = (yy_hold_char);

		YY_RESTORE_YY_MORE_OFFSET

			{

			/* We're scanning a new file or input source.  It's

			 * possible that this happened because the user

			 * just pointed yyin at a new source and called

			 * yylex().  If so, then we have to assure

			 * consistency between YY_CURRENT_BUFFER and our

			 * globals.  Here is the right place to do so, because

			 * this is the first action (other than possibly a

			 * back-up) that will match for the new input source.

			 */

			(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;

			YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;

			YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;

			}

		 * of the first EOB in the buffer, since yy_c_buf_p will

		 * already have been incremented past the NUL character

		 * (since all states make transitions on EOB to the

		 * end-of-buffer state).  Contrast this with the test

		 * in input().

		 */

		if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )

			{ /* This was really a NUL. */

			yy_state_type yy_next_state;

			 * 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