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

📄 cqllex.cpp

📁 Pegasus is an open-source implementationof the DMTF CIM and WBEM standards. It is designed to be por
💻 CPP
📖 第 1 页 / 共 5 页
字号:
//%2006//////////////////////////////////////////////////////////////////////////// Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development// Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems.// Copyright (c) 2003 BMC Software; Hewlett-Packard Development Company, L.P.;// IBM Corp.; EMC Corporation, The Open Group.// Copyright (c) 2004 BMC Software; Hewlett-Packard Development Company, L.P.;// IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group.// Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.;// EMC Corporation; VERITAS Software Corporation; The Open Group.// Copyright (c) 2006 Hewlett-Packard Development Company, L.P.; IBM Corp.;// EMC Corporation; Symantec Corporation; The Open Group.//// 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 OR COPYRIGHT// HOLDERS 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_create_buffer CQL__create_buffer#define yy_delete_buffer CQL__delete_buffer#define yy_scan_buffer CQL__scan_buffer#define yy_scan_string CQL__scan_string#define yy_scan_bytes CQL__scan_bytes#define yy_flex_debug CQL__flex_debug#define yy_init_buffer CQL__init_buffer#define yy_flush_buffer CQL__flush_buffer#define yy_load_buffer_state CQL__load_buffer_state#define yy_switch_to_buffer CQL__switch_to_buffer#define yyin CQL_in#define yyleng CQL_leng#define yylex CQL_lex#define yyout CQL_out#define yyrestart CQL_restart#define yytext CQL_text#define yywrap CQL_wrap/* A lexical scanner generated by flex *//* Scanner skeleton version: * $Header: /cvs/MSB/pegasus/src/Pegasus/CQL/CQLLEX.cpp,v 1.15 2006/01/30 16:16:38 karl Exp $ */#define FLEX_SCANNER#define YY_FLEX_MAJOR_VERSION 2#define YY_FLEX_MINOR_VERSION 5#include <stdio.h>#include <unistd.h>/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */#ifdef c_plusplus#ifndef __cplusplus#define __cplusplus#endif#endif#ifdef __cplusplus#include <stdlib.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 16384typedef 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 yytextstatic 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 59#define YY_END_OF_BUFFER 60static yyconst short int yy_accept[170] =    {   0,        0,    0,   60,   58,   56,   57,   41,   58,   45,   46,       35,   37,   39,   38,   42,   36,   30,   30,   30,   52,       49,   54,   55,   55,   55,   55,   55,   55,   55,   55,       55,   55,   55,   55,   55,   43,   44,   48,   58,   56,        0,   34,   33,    0,    0,    0,   30,   30,   30,    0,        0,   29,   29,   40,   32,   32,   30,   28,    0,   51,       50,   53,   55,    0,   55,    5,    7,   55,   55,   55,       55,   55,   55,   12,   13,   55,   55,   55,   23,   55,       55,   55,   55,   47,    0,    0,   34,   31,    0,    0,       27,    0,   29,   29,    0,   32,    0,   26,    0,   22,        4,    6,   55,   55,   55,   55,   55,   55,   14,   55,       21,   55,   55,   55,   55,   55,   55,    0,   25,    0,       32,    0,    0,   32,   26,   24,    8,   55,   55,   55,       55,    2,   15,   20,   55,   55,   55,   18,   55,    0,       31,   25,    0,   32,    0,   24,    0,   55,   10,   19,       11,   16,   55,   55,    3,    0,    0,   24,   55,   55,        1,    0,   24,   55,   55,    9,   55,   17,    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,    1,    1,    4,    1,    1,    1,    5,    6,        7,    8,    9,   10,   11,   12,   13,   14,   15,   16,       16,   16,   16,   16,   16,   16,   16,   17,    1,   18,       19,   20,    1,    1,   21,   22,   23,   24,   25,   26,       27,   28,   29,   27,   30,   31,   32,   33,   34,   27,       27,   35,   36,   37,   38,   39,   40,   41,   42,   27,       43,   44,   45,    1,   46,    1,   21,   22,   23,   24,       25,   26,   27,   28,   29,   27,   30,   31,   32,   33,       34,   27,   27,   35,   36,   37,   38,   39,   40,   41,       42,   27,    1,   47,    1,    1,    1,   27,   27,   27,       27,   27,   27,   27,   27,   27,   27,   27,   27,   27,       27,   27,   27,   27,   27,   27,   27,   27,   27,   27,       27,   27,   27,   27,   27,   27,   27,   27,   27,   27,       27,   27,   27,   27,   27,   27,   27,   27,   27,   27,       27,   27,   27,   27,   27,   27,   27,   27,   27,   27,       27,   27,   27,   27,   27,   27,   27,   27,   27,   27,       27,   27,   27,   27,   27,   27,   27,   27,   27,   27,       27,   27,   27,   27,   27,   27,   27,   27,   27,   27,       27,   27,   27,   27,   27,   27,   27,   27,   27,   27,       27,   27,   27,   27,   27,   27,   27,   27,   27,   27,       27,   27,   27,   27,   27,   27,   27,   27,   27,   27,       27,   27,   27,   27,   27,   27,   27,   27,   27,   27,       27,   27,   27,   27,   27    } ;static yyconst int yy_meta[48] =    {   0,        1,    1,    2,    3,    4,    5,    5,    1,    1,    1,        1,    1,    1,    6,    6,    6,    7,    1,    1,    1,        8,    8,    8,    8,    8,    8,    9,    9,    9,    9,        9,    9,    9,    9,    9,    9,    9,    9,    9,    9,        9,    9,    3,    1,    1,    9,    1    } ;static yyconst short int yy_base[182] =    {   0,        0,    0,  438,  439,  435,  439,  439,   45,  439,  439,      439,   41,  439,   46,   51,  439,   56,   61,   70,   60,      439,  417,   57,   52,  418,   70,   42,   71,   74,   79,       81,   85,   84,   86,   94,  439,  439,  417,  386,  430,      111,   99,  439,  421,  120,  112,  117,  122,  133,  126,      138,  147,  156,  439,  151,  159,  166,  439,    0,  439,      439,  439,  398,  394,  166,  107,  392,  160,  168,  169,      170,  172,  175,  391,  174,  176,  180,  181,  186,  182,      183,  118,  188,  439,  107,  197,  439,  206,  211,  220,      439,    0,  228,  233,  242,  214,  250,    0,    0,  388,      383,  380,  201,  235,  220,  237,  243,   32,  377,  221,      370,  245,  246,  251,  250,  252,  253,  275,    0,  267,      278,  286,  289,  292,    0,  270,  362,  270,  268,  292,      261,  343,  341,  340,  279,  294,  295,  337,  298,  305,      310,    0,  313,  317,  348,  312,  307,  305,  334,  333,      330,  329,  317,  319,  328,  339,  171,  170,  318,  320,      194,  152,  141,  322,  323,   96,  325,   37,  439,  361,      365,  374,  383,  387,  390,  393,  394,  398,  404,  413,      422    } ;static yyconst short int yy_def[182] =    {   0,      169,    1,  169,  169,  169,  169,  169,  170,  169,  169,      169,  169,  169,  169,  169,  169,  169,  169,  169,  169,      169,  169,  171,  171,  171,  171,  171,  171,  171,  171,      171,  171,  171,  171,  171,  169,  169,  171,  169,  169,      170,  172,  169,  173,  173,  169,  169,  169,  169,  169,      169,  169,  169,  169,  169,  169,  169,  169,  174,  169,      169,  169,  171,  169,  171,  171,  171,  171,  171,  171,      171,  171,  171,  171,  171,  171,  171,  171,  171,  171,      171,  171,  171,  169,  172,  169,  169,  169,  169,  169,      169,  175,  169,  169,  169,  169,  169,  176,  177,  171,      171,  171,  171,  171,  171,  171,  171,  171,  171,  171,      171,  171,  171,  171,  171,  171,  171,  169,  178,  169,      169,  169,  169,  169,  176,  179,  171,  171,  171,  171,      171,  171,  171,  171,  171,  171,  171,  171,  171,  169,      169,  178,  169,  169,  169,  179,  180,  171,  171,  171,      171,  171,  171,  171,  171,  181,  180,  180,  171,  171,      171,  181,  181,  171,  171,  171,  171,  171,    0,  169,      169,  169,  169,  169,  169,  169,  169,  169,  169,  169,      169    } ;static yyconst short int yy_nxt[487] =    {   0,        4,    5,    6,    7,    8,    9,   10,   11,   12,   13,       14,   15,   16,   17,   18,   19,    4,   20,   21,   22,       23,   24,   25,   26,   27,   28,   25,   25,   29,   25,       30,   25,   31,   32,   25,   33,   34,   25,   25,   35,       25,   25,   36,    4,   37,   38,   39,   42,   64,   43,       44,   44,   46,   64,   47,   48,   49,   50,   64,   51,       52,   53,   54,  132,   55,   55,   55,   56,   64,   57,       57,   49,   56,   64,   57,   57,   49,   58,   60,   61,       70,   56,   58,   49,   49,   49,   64,   64,   45,   65,       64,   71,   66,   67,   68,   64,   59,   64,   69,   72,       64,   64,   64,   43,   80,   73,   74,   76,   81,   75,       64,   43,   64,   42,   77,   43,   44,   44,   78,   79,       82,   83,   87,   64,   85,   55,   55,   55,   56,  102,       57,   57,   49,   56,   64,   57,   57,   49,   58,   88,       88,   88,   86,   58,   56,  163,   49,   49,   49,   50,       86,   89,   89,   90,   45,  116,  163,   59,   50,   91,       93,   93,   94,   41,   55,   55,   55,   50,   91,   94,       94,   94,   96,   96,   96,   95,   64,   56,   92,   57,       57,   49,   64,   97,   64,   64,   64,   58,   64,  100,       64,   64,   64,  105,  109,  103,   64,   64,   64,   64,      106,   85,   64,  104,   64,  110,  107,  101,  108,  113,       64,  112,  117,  115,  158,  158,  111,   64,  114,   88,       88,   88,   50,  127,   89,   89,   90,   96,   96,   96,      118,   50,   91,   90,   90,   90,   64,   64,  122,   50,       85,   93,   93,   94,   50,  133,   94,   94,   94,   91,      120,   64,  120,   64,  129,  121,  121,  121,  123,   64,      123,   64,   64,  124,  124,  124,   64,   64,   64,   64,      135,  128,  130,  145,  137,  134,  138,   64,  131,  136,      121,  121,  121,  140,   64,  140,   64,  139,  141,  141,      141,  121,  121,  121,  143,   64,  143,  151,  148,  144,      144,  144,  124,  124,  124,  124,  124,  124,   64,  149,       64,   64,  147,  152,   64,  145,  150,  154,  141,  141,      141,   64,  155,  141,  141,  141,  144,  144,  144,  153,

⌨️ 快捷键说明

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