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

📄 dlg_p.c

📁 本工具提供一个词法分析器和语法分析器的集成开发环境
💻 C
📖 第 1 页 / 共 2 页
字号:
#endif{	zzRULE;	zzBLOCK(zztasp1);	zzMake0;	{	zzaRet.l = new_nfa_node(); zzaRet.r = new_nfa_node();	if ( (LA(1)==L_BRACK) ) {		zzmatch(L_BRACK); zzCONSUME;		atom_list();		zzmatch(R_BRACK);				(zzaRet.l)->trans[0] = zzaRet.r;		(zzaRet.l)->label = set_dup(zzaArg(zztasp1,2 ).label);		set_orin(&used_chars,(zzaRet.l)->label); zzCONSUME;	}	else {		if ( (LA(1)==NOT) ) {			zzmatch(NOT); zzCONSUME;			zzmatch(L_BRACK); zzCONSUME;			atom_list();			zzmatch(R_BRACK);						(zzaRet.l)->trans[0] = zzaRet.r;			(zzaRet.l)->label = set_dif(normal_chars,zzaArg(zztasp1,3 ).label);			set_orin(&used_chars,(zzaRet.l)->label); zzCONSUME;		}		else {			if ( (LA(1)==L_PAR) ) {				zzmatch(L_PAR); zzCONSUME;				reg_expr();				zzmatch(R_PAR);								(zzaRet.l)->trans[0] = zzaArg(zztasp1,2 ).l;				(zzaArg(zztasp1,2 ).r)->trans[1] = zzaRet.r; zzCONSUME;			}			else {				if ( (LA(1)==L_BRACE) ) {					zzmatch(L_BRACE); zzCONSUME;					reg_expr();					zzmatch(R_BRACE);										(zzaRet.l)->trans[0] = zzaArg(zztasp1,2 ).l;					(zzaRet.l)->trans[1] = zzaRet.r;					(zzaArg(zztasp1,2 ).r)->trans[1] = zzaRet.r; zzCONSUME;				}				else {					if ( (setwd2[LA(1)]&0x80) ) {						atom();												(zzaRet.l)->trans[0] = zzaRet.r;						(zzaRet.l)->label = set_dup(zzaArg(zztasp1,1 ).label);						set_orin(&used_chars,(zzaRet.l)->label);					}					else {zzFAIL(1,zzerr5,&zzMissSet,&zzMissText,&zzBadTok,&zzBadText,&zzErrk); goto fail;}				}			}		}	}	zzEXIT(zztasp1);	return;fail:	zzEXIT(zztasp1);	zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);	zzresynch(setwd3, 0x1);	}}void#ifdef __USE_PROTOSatom_list(void)#elseatom_list()#endif{	zzRULE;	zzBLOCK(zztasp1);	zzMake0;	{	set_free(zzaRet.label);	{		zzBLOCK(zztasp2);		zzMake0;		{		while ( (setwd3[LA(1)]&0x2) ) {			near_atom();			set_orin(&(zzaRet.label),zzaArg(zztasp2,1 ).label);			zzLOOP(zztasp2);		}		zzEXIT(zztasp2);		}	}	zzEXIT(zztasp1);	return;fail:	zzEXIT(zztasp1);	zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);	zzresynch(setwd3, 0x4);	}}void#ifdef __USE_PROTOSnear_atom(void)#elsenear_atom()#endif{	zzRULE;	zzBLOCK(zztasp1);	zzMake0;	{	register int i;	register int i_prime;	anychar();	zzaRet.letter=zzaArg(zztasp1,1 ).letter; zzaRet.label=set_of(zzaArg(zztasp1,1 ).letter);	i_prime = zzaArg(zztasp1,1 ).letter + MIN_CHAR;	if (case_insensitive && islower(i_prime))	set_orel(toupper(i_prime)-MIN_CHAR,	&(zzaRet.label));	if (case_insensitive && isupper(i_prime))	set_orel(tolower(i_prime)-MIN_CHAR,	&(zzaRet.label));	{		zzBLOCK(zztasp2);		zzMake0;		{		if ( (LA(1)==RANGE) ) {			zzmatch(RANGE); zzCONSUME;			anychar();			if (case_insensitive){				i_prime = zzaRet.letter+MIN_CHAR;				zzaRet.letter = (islower(i_prime) ?				toupper(i_prime) : i_prime)-MIN_CHAR;				i_prime = zzaArg(zztasp2,2 ).letter+MIN_CHAR;				zzaArg(zztasp2,2 ).letter = (islower(i_prime) ?				toupper(i_prime) : i_prime)-MIN_CHAR;			}			/* check to see if range okay */			if (zzaRet.letter > zzaArg(zztasp2,2 ).letter){				error("invalid range  ", zzline);			}			for (i=zzaRet.letter; i<= (int)zzaArg(zztasp2,2 ).letter; ++i){				set_orel(i,&(zzaRet.label));				i_prime = i+MIN_CHAR;				if (case_insensitive && islower(i_prime))				set_orel(toupper(i_prime)-MIN_CHAR,				&(zzaRet.label));				if (case_insensitive && isupper(i_prime))				set_orel(tolower(i_prime)-MIN_CHAR,				&(zzaRet.label));			}		}		zzEXIT(zztasp2);		}	}	zzEXIT(zztasp1);	return;fail:	zzEXIT(zztasp1);	zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);	zzresynch(setwd3, 0x8);	}}void#ifdef __USE_PROTOSatom(void)#elseatom()#endif{	zzRULE;	zzBLOCK(zztasp1);	zzMake0;	{	register int i_prime;	anychar();	zzaRet.label = set_of(zzaArg(zztasp1,1 ).letter);	i_prime = zzaArg(zztasp1,1 ).letter + MIN_CHAR;	if (case_insensitive && islower(i_prime))	set_orel(toupper(i_prime)-MIN_CHAR,	&(zzaRet.label));	if (case_insensitive && isupper(i_prime))	set_orel(tolower(i_prime)-MIN_CHAR,	&(zzaRet.label));	zzEXIT(zztasp1);	return;fail:	zzEXIT(zztasp1);	zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);	zzresynch(setwd3, 0x10);	}}void#ifdef __USE_PROTOSanychar(void)#elseanychar()#endif{	zzRULE;	zzBLOCK(zztasp1);	zzMake0;	{	if ( (LA(1)==REGCHAR) ) {		zzmatch(REGCHAR);		zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR; zzCONSUME;	}	else {		if ( (LA(1)==OCTAL_VALUE) ) {			zzmatch(OCTAL_VALUE);			zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR; zzCONSUME;		}		else {			if ( (LA(1)==HEX_VALUE) ) {				zzmatch(HEX_VALUE);				zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR; zzCONSUME;			}			else {				if ( (LA(1)==DEC_VALUE) ) {					zzmatch(DEC_VALUE);					zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR; zzCONSUME;				}				else {					if ( (LA(1)==TAB) ) {						zzmatch(TAB);						zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR; zzCONSUME;					}					else {						if ( (LA(1)==NL) ) {							zzmatch(NL);							zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR; zzCONSUME;						}						else {							if ( (LA(1)==CR) ) {								zzmatch(CR);								zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR; zzCONSUME;							}							else {								if ( (LA(1)==BS) ) {									zzmatch(BS);									zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR; zzCONSUME;								}								else {									if ( (LA(1)==LIT) ) {										zzmatch(LIT);										zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR; zzCONSUME;									}									else {										if ( (LA(1)==L_EOF) ) {											zzmatch(L_EOF);											zzaRet.letter = 0; zzCONSUME;										}										else {zzFAIL(1,zzerr6,&zzMissSet,&zzMissText,&zzBadTok,&zzBadText,&zzErrk); goto fail;}									}								}							}						}					}				}			}		}	}	zzEXIT(zztasp1);	return;fail:	zzEXIT(zztasp1);	/* empty action */	zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);	zzresynch(setwd3, 0x20);	}}/* adds a new nfa to the binary tree and returns a pointer to it */nfa_node *new_nfa_node(){	register nfa_node *t;	static int nfa_size=0;	/* elements nfa_array[] can hold */		++nfa_allocated;	if (nfa_size<=nfa_allocated){		/* need to redo array */		if (!nfa_array){			/* need some to do inital allocation */			nfa_size=nfa_allocated+NFA_MIN;			nfa_array=(nfa_node **) malloc(sizeof(nfa_node*)*			nfa_size);		}else{			/* need more space */			nfa_size=2*(nfa_allocated+1);			nfa_array=(nfa_node **) realloc(nfa_array,			sizeof(nfa_node*)*nfa_size);		}	}	/* fill out entry in array */	t = (nfa_node*) malloc(sizeof(nfa_node));	nfa_array[nfa_allocated] = t;	*t = nfa_model_node;	t->node_no = nfa_allocated;	return t;}/* initialize the model node used to fill in newly made nfa_nodes */voidmake_nfa_model_node(){	nfa_model_node.node_no = -1; /* impossible value for real nfa node */	nfa_model_node.nfa_set = 0;	nfa_model_node.accept = 0;   /* error state default*/	nfa_model_node.trans[0] = NULL;	nfa_model_node.trans[1] = NULL;	nfa_model_node.label = empty;}#ifdef DEBUG/* print out the pointer value and the node_number */fprint_dfa_pair(f, p)FILE *f;nfa_node *p;{	if (p){		fprintf(f, "%x (%d)", p, p->node_no);	}else{		fprintf(f, "(nil)");	}}/* print out interest information on a set */fprint_set(f,s)FILE *f;set s;{	unsigned int *x;		fprintf(f, "n = %d,", s.n);	if (s.setword){		fprintf(f, "setword = %x,   ", s.setword);		/* print out all the elements in the set */		x = set_pdq(s);		while (*x!=nil){			fprintf(f, "%d ", *x);			++x;		}	}else{		fprintf(f, "setword = (nil)");	}}/* code to be able to dump out the nfasreturn 0 if okay dumpreturn 1 if screwed up*/int dump_nfas(first_node, last_node)int first_node;int last_node;{	register int i;	nfa_node *t;		for (i=first_node; i<=last_node; ++i){		t = NFA(i);		if (!t) break;		fprintf(stderr, "nfa_node %d {\n", t->node_no);		fprintf(stderr, "\n\tnfa_set = %d\n", t->nfa_set);		fprintf(stderr, "\taccept\t=\t%d\n", t->accept);		fprintf(stderr, "\ttrans\t=\t(");		fprint_dfa_pair(stderr, t->trans[0]);		fprintf(stderr, ",");		fprint_dfa_pair(stderr, t->trans[1]);		fprintf(stderr, ")\n");		fprintf(stderr, "\tlabel\t=\t{ ");		fprint_set(stderr, t->label);		fprintf(stderr, "\t}\n");		fprintf(stderr, "}\n\n");	}	return 0;}#endif/* DLG-specific syntax error message generator* (define USER_ZZSYN when compiling so don't get 2 definitions)*/void#ifdef __USE_PROTOSzzsyn(char *text, int tok, char *egroup, SetWordType *eset, int etok, int k, char *bad_text)#elsezzsyn(text, tok, egroup, eset, etok, k, bad_text)char *text, *egroup, *bad_text;int tok;int etok;int k;SetWordType *eset;#endif{fprintf(stderr, ErrHdr, file_str[0]!=NULL?file_str[0]:"stdin", zzline);fprintf(stderr, " syntax error at \"%s\"", (tok==zzEOF_TOKEN)?"EOF":text);if ( !etok && !eset ) {fprintf(stderr, "\n"); return;}if ( k==1 ) fprintf(stderr, " missing");else{fprintf(stderr, "; \"%s\" not", bad_text);if ( zzset_deg(eset)>1 ) fprintf(stderr, " in");}if ( zzset_deg(eset)>0 ) zzedecode(eset);else fprintf(stderr, " %s", zztokens[etok]);if ( strlen(egroup) > (size_t)0 ) fprintf(stderr, " in %s", egroup);fprintf(stderr, "\n");}

⌨️ 快捷键说明

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