⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 arith_lex.c

📁 Android 一些工具
💻 C
📖 第 1 页 / 共 4 页
字号:
 *	The Regents of the University of California.  All rights reserved. * * This code is derived from software contributed to Berkeley by * Kenneth Almquist. * * 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. 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. */#include <sys/cdefs.h>#ifndef lint#if 0static char sccsid[] = "@(#)arith_lex.l	8.3 (Berkeley) 5/4/95";#else__RCSID("$NetBSD: arith_lex.l,v 1.12.6.1 2005/04/07 11:38:58 tron Exp $");#endif#endif /* not lint */#include <unistd.h>#include "arith.h"#include "error.h"#include "expand.h"#include "var.h"extern int yylval;extern char *arith_buf, *arith_startbuf;#undef YY_INPUT#define YY_INPUT(buf,result,max) \	result = (*buf = *arith_buf++) ? 1 : YY_NULL;#define YY_NO_UNPUT#line 526 "arith_lex.c"#define INITIAL 0#ifndef YY_NO_UNISTD_H/* Special case for "unistd.h", since it is non-ANSI. We include it way * down here because we want the user's section 1 to have been scanned first. * The user has a chance to override it with an option. */#include <unistd.h>#endif#ifndef YY_EXTRA_TYPE#define YY_EXTRA_TYPE void *#endif/* Macros after this point can all be overridden by user definitions in * section 1. */#ifndef YY_SKIP_YYWRAP#ifdef __cplusplusextern "C" int yywrap (void );#elseextern int yywrap (void );#endif#endif    static void yyunput (int c,char *buf_ptr  );    #ifndef yytext_ptrstatic void yy_flex_strncpy (char *,yyconst char *,int );#endif#ifdef YY_NEED_STRLENstatic int yy_flex_strlen (yyconst char * );#endif#ifndef YY_NO_INPUT#ifdef __cplusplusstatic int yyinput (void );#elsestatic int input (void );#endif#endif/* Amount of stuff to slurp up with each read. */#ifndef YY_READ_BUF_SIZE#define YY_READ_BUF_SIZE 8192#endif/* Copy whatever the last rule matched to the standard output. */#ifndef ECHO/* This used to be an fputs(), but since the string might contain NUL's, * we now use fwrite(). */#define ECHO (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_LVALUE->yy_is_interactive ) \		{ \		int c = '*'; \		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); \			} \		}\\#endif/* No semi-colon after return; correct usage is to write "yyterminate();" - * we don't want an extra ';' after the "return" because that will cause * some compilers to complain about unreachable statements. */#ifndef yyterminate#define yyterminate() return YY_NULL#endif/* Number of entries by which start-condition stack grows. */#ifndef YY_START_STACK_INCR#define YY_START_STACK_INCR 25#endif/* Report a fatal error. */#ifndef YY_FATAL_ERROR#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )#endif/* end tables serialization structures and prototypes *//* Default declaration of generated scanner - a define so the user can * easily add parameters. */#ifndef YY_DECL#define YY_DECL_IS_OURS 1extern int yylex (void);#define YY_DECL int yylex (void)#endif /* !YY_DECL *//* Code executed at the beginning of each rule, after yytext and yyleng * have been set up. */#ifndef YY_USER_ACTION#define YY_USER_ACTION#endif/* Code executed at the end of each rule. */#ifndef YY_BREAK#define YY_BREAK break;#endif#define YY_RULE_SETUP \	YY_USER_ACTION/** The main scanner function which does all the work. */YY_DECL{	register yy_state_type yy_current_state;	register char *yy_cp, *yy_bp;	register int yy_act;    #line 60 "arith_lex.l"#line 679 "arith_lex.c"	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 ) {			yyensure_buffer_stack ();			YY_CURRENT_BUFFER_LVALUE =				yy_create_buffer(yyin,YY_BUF_SIZE );		}		yy_load_buffer_state( );		}	while ( 1 )		/* loops until end-of-file is reached */		{		yy_cp = (yy_c_buf_p);		/* Support of yytext. */		*yy_cp = (yy_hold_char);		/* yy_bp points to the position in yy_ch_buf of the start of		 * the current run.		 */		yy_bp = yy_cp;		yy_current_state = (yy_start);yy_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 >= 39 )					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] != 48 );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:/* rule 1 can match eol */YY_RULE_SETUP#line 61 "arith_lex.l"{ ; }	YY_BREAKcase 2:YY_RULE_SETUP#line 62 "arith_lex.l"{ yylval = strtol(yytext, 0, 0); return(ARITH_NUM); }	YY_BREAKcase 3:YY_RULE_SETUP#line 63 "arith_lex.l"{ yylval = strtol(yytext, 0, 0); return(ARITH_NUM); }	YY_BREAKcase 4:YY_RULE_SETUP#line 64 "arith_lex.l"{ yylval = strtol(yytext, 0, 0); return(ARITH_NUM); }	YY_BREAKcase 5:YY_RULE_SETUP#line 65 "arith_lex.l"{ char *v = lookupvar(yytext);			if (v) {				yylval = strtol(v, &v, 0);				if (*v == 0)					return ARITH_NUM;			}			error("arith: syntax error: \"%s\"", arith_startbuf);		}	YY_BREAKcase 6:YY_RULE_SETUP#line 73 "arith_lex.l"{ return(ARITH_LPAREN); }	YY_BREAKcase 7:YY_RULE_SETUP#line 74 "arith_lex.l"{ return(ARITH_RPAREN); }	YY_BREAKcase 8:YY_RULE_SETUP#line 75 "arith_lex.l"{ return(ARITH_OR); }	YY_BREAKcase 9:YY_RULE_SETUP#line 76 "arith_lex.l"{ return(ARITH_AND); }	YY_BREAKcase 10:YY_RULE_SETUP#line 77 "arith_lex.l"{ return(ARITH_BOR); }	YY_BREAKcase 11:YY_RULE_SETUP#line 78 "arith_lex.l"{ return(ARITH_BXOR); }	YY_BREAKcase 12:YY_RULE_SETUP#line 79 "arith_lex.l"{ return(ARITH_BAND); }	YY_BREAKcase 13:YY_RULE_SETUP#line 80 "arith_lex.l"{ return(ARITH_EQ); }	YY_BREAKcase 14:YY_RULE_SETUP#line 81 "arith_lex.l"{ return(ARITH_NE); }	YY_BREAKcase 15:YY_RULE_SETUP#line 82 "arith_lex.l"{ return(ARITH_GT); }	YY_BREAKcase 16:YY_RULE_SETUP#line 83 "arith_lex.l"{ return(ARITH_GE); }	YY_BREAKcase 17:YY_RULE_SETUP#line 84 "arith_lex.l"{ return(ARITH_LT); }	YY_BREAKcase 18:YY_RULE_SETUP#line 85 "arith_lex.l"{ return(ARITH_LE); }	YY_BREAKcase 19:YY_RULE_SETUP#line 86 "arith_lex.l"{ return(ARITH_LSHIFT); }	YY_BREAKcase 20:YY_RULE_SETUP#line 87 "arith_lex.l"{ return(ARITH_RSHIFT); }	YY_BREAKcase 21:YY_RULE_SETUP#line 88 "arith_lex.l"{ return(ARITH_MUL); }	YY_BREAKcase 22:YY_RULE_SETUP#line 89 "arith_lex.l"{ return(ARITH_DIV); }	YY_BREAKcase 23:YY_RULE_SETUP#line 90 "arith_lex.l"{ return(ARITH_REM); }	YY_BREAKcase 24:YY_RULE_SETUP#line 91 "arith_lex.l"{ return(ARITH_ADD); }	YY_BREAKcase 25:YY_RULE_SETUP#line 92 "arith_lex.l"{ return(ARITH_SUB); }	YY_BREAKcase 26:YY_RULE_SETUP#line 93 "arith_lex.l"{ return(ARITH_BNOT); }	YY_BREAKcase 27:YY_RULE_SETUP#line 94 "arith_lex.l"{ return(ARITH_NOT); }	YY_BREAKcase 28:YY_RULE_SETUP#line 95 "arith_lex.l"{ error("arith: syntax error: \"%s\"", arith_startbuf); }	YY_BREAKcase 29:YY_RULE_SETUP#line 96 "arith_lex.l"ECHO;	YY_BREAK#line 915 "arith_lex.c"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_LVALUE->yy_buffer_status == YY_BUFFER_NEW )			{			/* We're scanning a new file or input source.  It's			 * possible that this happened because the user			 * just pointed yyin at a new source and called			 * yylex().  If so, then we have to assure			 * consistency between YY_CURRENT_BUFFER and our			 * globals.  Here is the right place to do so, because			 * this is the first action (other than possibly a			 * back-up) that will match for the new input source.			 */			(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;			YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;			YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;			}		/* Note that here we test for yy_c_buf_p "<=" to the position		 * of the first EOB in the buffer, since yy_c_buf_p will		 * already have been incremented past the NUL character		 * (since all states make transitions on EOB to the

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -