kgram.c

来自「一个很不错的程序切片工具,希望大家来讨论以下,对测试人员很有帮助」· C语言 代码 · 共 1,918 行 · 第 1/5 页

					** "error", pop stack
					*/
#if YYDEBUG
#	define _POP_ "Error recovery pops state %d, uncovers state %d\n"
					if ( yydebug )
						(void)printf( _POP_, *yy_ps,
							yy_ps[-1] );
#	undef _POP_
#endif
					yy_ps--;
					yy_pv--;
				}
				/*
				** there is no state on stack with "error" as
				** a valid shift.  give up.
				*/
				YYABORT;
			case 3:		/* no shift yet; eat a token */
#if YYDEBUG
				/*
				** if debugging, look up token in list of
				** pairs.  0 and negative shouldn't occur,
				** but since timing doesn't matter when
				** debugging, it doesn't hurt to leave the
				** tests here.
				*/
				if ( yydebug )
				{
					register int yy_i;

					(void)printf( "Error recovery discards " );
					if ( yychar == 0 )
						(void)printf( "token end-of-file\n" );
					else if ( yychar < 0 )
						(void)printf( "token -none-\n" );
					else
					{
						for ( yy_i = 0;
							yytoks[yy_i].t_val >= 0;
							yy_i++ )
						{
							if ( yytoks[yy_i].t_val
								== yychar )
							{
								break;
							}
						}
						(void)printf( "token %s\n",
							yytoks[yy_i].t_name );
					}
				}
#endif /* YYDEBUG */
				if ( yychar == 0 )	/* reached EOF. quit */
					YYABORT;
				yychar = -1;
				goto yy_newstate;
			}
		}/* end if ( yy_n == 0 ) */
		/*
		** reduction by production yy_n
		** put stack tops, etc. so things right after switch
		*/
#if YYDEBUG
		/*
		** if debugging, print the string that is the user's
		** specification of the reduction which is just about
		** to be done.
		*/
		if ( yydebug )
			(void)printf( "Reduce by (%d) \"%s\"\n",
				yy_n, yyreds[ yy_n ] );
#endif
		yytmp = yy_n;			/* value to switch over */
		yypvt = yy_pv;			/* $vars top of value stack */
		/*
		** Look in goto table for next state
		** Sorry about using yy_state here as temporary
		** register variable, but why not, if it works...
		** If yyr2[ yy_n ] doesn't have the low order bit
		** set, then there is no action to be done for
		** this reduction.  So, no saving & unsaving of
		** registers done.  The only difference between the
		** code just after the if and the body of the if is
		** the goto yy_stack in the body.  This way the test
		** can be made before the choice of what to do is needed.
		*/
		{
			/* length of production doubled with extra bit */
			register int yy_len = yyr2[ yy_n ];

			if ( !( yy_len & 01 ) )
			{
				yy_len >>= 1;
				yyval = ( yy_pv -= yy_len )[1];	/* $$ = $1 */
				yy_state = yypgo[ yy_n = yyr1[ yy_n ] ] +
					*( yy_ps -= yy_len ) + 1;
				if ( yy_state >= YYLAST ||
					yychk[ yy_state =
					yyact[ yy_state ] ] != -yy_n )
				{
					yy_state = yyact[ yypgo[ yy_n ] ];
				}
				goto yy_stack;
			}
			yy_len >>= 1;
			yyval = ( yy_pv -= yy_len )[1];	/* $$ = $1 */
			yy_state = yypgo[ yy_n = yyr1[ yy_n ] ] +
				*( yy_ps -= yy_len ) + 1;
			if ( yy_state >= YYLAST ||
				yychk[ yy_state = yyact[ yy_state ] ] != -yy_n )
			{
				yy_state = yyact[ yypgo[ yy_n ] ];
			}
		}
					/* save until reenter driver code */
		yystate = yy_state;
		yyps = yy_ps;
		yypv = yy_pv;
	}
	/*
	** code supplied by user is placed in this switch
	*/
	switch( yytmp )
	{
		
case 1:
# line 80 "kgram.y"
{yyval.tree = make_leaf(ID_OP,yypvt[-0].token);} break;
case 2:
# line 82 "kgram.y"
{yyval.tree = make_leaf(CON_OP,yypvt[-0].token);} break;
case 3:
# line 84 "kgram.y"
{yyval.tree = make_leaf(CON_OP,yypvt[-0].token);} break;
case 4:
# line 86 "kgram.y"
{
			tree_ptr	t;
			t = make_tree (LEFTP_OP,yypvt[-1].tree,(token_ptr)NULL);
			yyval.tree = make_tree (RIGHTP_OP,t,(token_ptr)NULL);
			t->token = yypvt[-2].token;
			yyval.tree->token = yypvt[-0].token;} break;
case 8:
# line 101 "kgram.y"
{yyval.tree = make_tree (ARRAY_OP,yypvt[-3].tree,yypvt[-1].tree);} break;
case 9:
# line 103 "kgram.y"
{yyval.tree = make_tree (CALL_OP,yypvt[-2].tree,(token_ptr)NULL);} break;
case 10:
# line 105 "kgram.y"
{yyval.tree = make_tree (CALL_OP,yypvt[-3].tree,yypvt[-1].tree);} break;
case 11:
# line 107 "kgram.y"
{yyval.tree = make_tree (DOT_OP,yypvt[-2].tree,
			make_leaf(ID_OP,yypvt[-0].token));} break;
case 12:
# line 110 "kgram.y"
{yyval.tree = make_tree (POINTER_OP,yypvt[-2].tree,
			make_leaf(ID_OP,yypvt[-0].token));} break;
case 13:
# line 113 "kgram.y"
{yyval.tree = make_tree (POST_OP,yypvt[-1].tree,(token_ptr)NULL); yyval.tree->token = yypvt[-0].token;} break;
case 14:
# line 115 "kgram.y"
{yyval.tree = make_tree (POST_OP,yypvt[-1].tree,(token_ptr)NULL); yyval.tree->token = yypvt[-0].token;} break;
case 16:
# line 121 "kgram.y"
{yyval.tree = make_tree (ARG_OP,yypvt[-3].tree,yypvt[-0].tree);} break;
case 17:
# line 124 "kgram.y"
{if(!in_init)type_seen = 0;} break;
case 19:
# line 130 "kgram.y"
{yyval.tree = make_tree (PRE_OP,yypvt[-0].tree,(token_ptr)NULL);yyval.tree->token = yypvt[-1].token;} break;
case 20:
# line 132 "kgram.y"
{yyval.tree = make_tree (PRE_OP,yypvt[-0].tree,(token_ptr)NULL);yyval.tree->token = yypvt[-1].token;} break;
case 21:
# line 134 "kgram.y"
{yyval.tree = make_tree (yypvt[-1].tree->op_code,yypvt[-0].tree,(token_ptr)NULL);
		if (yypvt[-1].tree->op_code == DEREF_OP)
			yyval.tree->token = yypvt[-1].tree->token;} break;
case 22:
# line 138 "kgram.y"
{yyval.tree = make_tree (UN_OP,yypvt[-0].tree,(token_ptr)NULL);} break;
case 23:
# line 140 "kgram.y"
{yyval.tree = make_leaf(CON_OP,yypvt[-3].token);} break;
case 24:
# line 145 "kgram.y"
{yyval.tree = make_leaf(ADDR_OP,yypvt[-0].token);} break;
case 25:
# line 147 "kgram.y"
{yyval.tree = make_leaf(DEREF_OP,yypvt[-0].token);} break;
case 26:
# line 149 "kgram.y"
{yyval.tree = make_leaf(UN_OP,yypvt[-0].token);} break;
case 27:
# line 151 "kgram.y"
{yyval.tree = make_leaf(UN_OP,yypvt[-0].token);} break;
case 28:
# line 153 "kgram.y"
{yyval.tree = make_leaf(UN_OP,yypvt[-0].token);} break;
case 29:
# line 155 "kgram.y"
{yyval.tree = make_leaf(UN_OP,yypvt[-0].token);} break;
case 31:
# line 161 "kgram.y"
{
			/*
			if ($2){if($2->desc.decl->decl_flags & FLAG_TYPE_USER_NAME)
					$$ = make_tree (CAST_OP,
						make_leaf(ID_OP,$2),$4);
				else 
					$$ = make_tree (CAST_OP,(token_ptr)NULL,$4);
			}
			else 
				$$ = make_tree (CAST_OP,(token_ptr)NULL,$4);
			*/
			yyval.tree = make_tree (CAST_OP,
						make_leaf(TYPENAME_OP,yypvt[-2].token),yypvt[-0].tree);
		} break;
case 33:
# line 180 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 34:
# line 182 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 35:
# line 184 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 37:
# line 190 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 38:
# line 192 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 40:
# line 198 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 41:
# line 200 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 43:
# line 206 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 44:
# line 208 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 45:
# line 210 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 46:
# line 212 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 48:
# line 218 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 49:
# line 220 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 51:
# line 226 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 53:
# line 232 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 55:
# line 238 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 57:
# line 244 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 59:
# line 250 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 61:
# line 256 "kgram.y"
{yyval.tree = make_tree (BIN_OP,yypvt[-4].tree,
			make_tree (BIN_OP,yypvt[-2].tree,yypvt[-0].tree));
		} break;
case 63:
# line 264 "kgram.y"
{yyval.tree = make_tree ((yypvt[-1].op == 0)?RELASGN_OP:ASGN_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 64:
# line 269 "kgram.y"
{ yyval.op = 1;} break;
case 65:
# line 271 "kgram.y"
{ yyval.op = NULL;} break;
case 66:
# line 273 "kgram.y"
{ yyval.op = NULL;} break;
case 67:
# line 275 "kgram.y"
{ yyval.op = NULL;} break;
case 68:
# line 277 "kgram.y"
{ yyval.op = NULL;} break;
case 69:
# line 279 "kgram.y"
{ yyval.op = NULL;} break;
case 70:
# line 281 "kgram.y"
{ yyval.op = NULL;} break;
case 71:
# line 283 "kgram.y"
{ yyval.op = NULL;} break;
case 72:
# line 285 "kgram.y"
{ yyval.op = NULL;} break;
case 73:
# line 287 "kgram.y"
{ yyval.op = NULL;} break;
case 74:
# line 289 "kgram.y"
{ yyval.op = NULL;} break;
case 77:
# line 298 "kgram.y"
{yyval.tree = make_tree (COMMA_OP,yypvt[-2].tree,yypvt[-0].tree);} break;
case 79:
# line 307 "kgram.y"
{
			decl (yypvt[-1].token,(token_ptr)NULL,False);
			end_typedef();
		} break;
case 80:
# line 312 "kgram.y"
{
			decl (yypvt[-2].token,yypvt[-1].token,False);
			if(c_opt)print_decl (yypvt[-2].token,yypvt[-1].token);
			yypvt[-2].token->desc.decl->vars = yypvt[-1].token;
			end_typedef();
		} break;
case 82:
# line 323 "kgram.y"
{yypvt[-1].token->desc.decl->decl_flags |=
			yypvt[-0].token->desc.decl->decl_flags ;
		yypvt[-1].token->desc.decl->tag = yypvt[-0].token->desc.decl->tag;
		yypvt[-1].token->desc.decl->vars = yypvt[-0].token->desc.decl->vars;
		yypvt[-1].token->desc.decl->members = yypvt[-0].token->desc.decl->members;
		yypvt[-1].token->desc.decl->member_ste = yypvt[-0].token->desc.decl->member_ste;
		if (!yypvt[-1].token->text) yypvt[-1].token->text = yypvt[-0].token->text;
		} break;
case 84:
# line 333 "kgram.y"
{if (yypvt[-1].token && yypvt[-0].token)yypvt[-0].token->desc.decl->decl_flags |=
				yypvt[-1].token->desc.decl->decl_flags ;
			yyval.token = yypvt[-0].token;
		} break;
case 86:
# line 339 "kgram.y"
{yypvt[-1].token->desc.decl->decl_flags |=
			yypvt[-0].token->desc.decl->decl_flags ;
		if (!yypvt[-1].token->text) yypvt[-1].token->text = yypvt[-0].token->text;
		} break;
case 88:
# line 348 "kgram.y"
{
			token_ptr	t;
/*
**********************************************************
*                                                        *
*  Collect list of declarators                           *
*                                                        *
**********************************************************
*/

			if (yypvt[-2].token){
				t = yypvt[-2].token;
				while (t->next) t = t->next;
				t->next = yypvt[-0].token;
			}
			else yyval.token = yypvt[-0].token;
		} break;
case 90:
# line 370 "kgram.y"
{ end_init();} break;
case 91:
# line 375 "kgram.y"
{make_decl (yypvt[-0].token, FLAG_SC_TYPEDEF);
			start_typedef();
			set_typedef = True;} break;
case 92: