t1.c

一种效率高

#line 215 "t1.y"
{ printf(" "); yyval.ptr = newJSBinaryOperator( OP_SL, yyvsp[-2].ptr, yyvsp[0].ptr ); ;
    break;}
case 74:
#line 216 "t1.y"
{ printf(" "); yyval.ptr = newJSBinaryOperator( OP_SR, yyvsp[-2].ptr, yyvsp[0].ptr );;
    break;}
case 75:
#line 219 "t1.y"
{ printf(" "); yyval.ptr = yyvsp[0].ptr; ;
    break;}
case 76:
#line 220 "t1.y"
{ printf("Add ( + )\n"); yyval.ptr = newJSBinaryOperator( OP_ADD, yyvsp[-2].ptr, yyvsp[0].ptr ); ;
    break;}
case 77:
#line 221 "t1.y"
{ printf("Sub ( - )\n"); yyval.ptr = newJSBinaryOperator( OP_SUB, yyvsp[-2].ptr, yyvsp[0].ptr ); ;
    break;}
case 78:
#line 224 "t1.y"
{ printf(" "); yyval.ptr = yyvsp[0].ptr; ;
    break;}
case 79:
#line 225 "t1.y"
{ printf("Mul ( * )\n"); yyval.ptr = newJSBinaryOperator( OP_MUL, yyvsp[-2].ptr, yyvsp[0].ptr ); ;
    break;}
case 80:
#line 226 "t1.y"
{ printf("Div ( / )\n"); yyval.ptr = newJSBinaryOperator( OP_DIV, yyvsp[-2].ptr, yyvsp[0].ptr ); ;
    break;}
case 81:
#line 229 "t1.y"
{ printf(" "); yyval.ptr = yyvsp[0].ptr; ;
    break;}
case 82:
#line 230 "t1.y"
{ printf("Unary Minus\n"); ;
    break;}
case 83:
#line 231 "t1.y"
{ printf("++ Prefix\n"); ;
    break;}
case 84:
#line 232 "t1.y"
{ printf("-- Prefix\n"); ;
    break;}
case 85:
#line 233 "t1.y"
{ printf("Postfix ++\n"); ;
    break;}
case 86:
#line 234 "t1.y"
{ printf("Postfix --\n"); ;
    break;}
case 87:
#line 235 "t1.y"
{ printf("new\n"); yyval.ptr = yyvsp[0].ptr; ;
    break;}
case 88:
#line 236 "t1.y"
{ printf("delete\n"); ;
    break;}
case 89:
#line 239 "t1.y"
{ printf(" "); yyval.ptr = 0L; ;
    break;}
case 90:
#line 240 "t1.y"
{ printf(" "); yyval.ptr = yyvsp[0].ptr; ;
    break;}
case 91:
#line 243 "t1.y"
{ printf(" "); yyval.ptr = newJSConstructorCall( newJSIdentifier( yyvsp[0].name ) , 0L ); ;
    break;}
case 92:
#line 244 "t1.y"
{ printf(" "); yyval.ptr = newJSConstructorCall( newJSIdentifier( yyvsp[-3].name ), yyvsp[-1].ptr ); ;
    break;}
case 93:
#line 245 "t1.y"
{ printf(" "); yyval.ptr = 0L; ;
    break;}
case 94:
#line 248 "t1.y"
{ printf(" "); yyval.ptr = yyvsp[0].ptr; ;
    break;}
case 95:
#line 249 "t1.y"
{ printf("[ ]\n"); yyval.ptr = newJSArrayAccess( yyvsp[-3].ptr, yyvsp[-1].ptr ); ;
    break;}
case 96:
#line 250 "t1.y"
{ printf("Function Call\n"); yyval.ptr = newJSFunctionCall( yyvsp[-3].ptr, yyvsp[-1].ptr ); ;
    break;}
case 97:
#line 253 "t1.y"
{ printf(" "); yyval.ptr = yyvsp[0].ptr; ;
    break;}
case 98:
#line 254 "t1.y"
{ printf("Member ( '%s' )\n", yyvsp[0].name ); yyval.ptr = newJSMember( yyvsp[-2].ptr, yyvsp[0].name ); ;
    break;}
case 99:
#line 257 "t1.y"
{ yyval.ptr = 0L; ;
    break;}
case 100:
#line 258 "t1.y"
{ printf("ArgumentList\n"); yyval.ptr = yyvsp[0].ptr; ;
    break;}
case 101:
#line 261 "t1.y"
{ printf("Argument\n"); yyval.ptr = newJSArgument( yyvsp[0].ptr, 0L ); ;
    break;}
case 102:
#line 262 "t1.y"
{ printf("Argument (cont)\n"); yyval.ptr = newJSArgument( yyvsp[-2].ptr, yyvsp[0].ptr ); ;
    break;}
case 103:
#line 265 "t1.y"
{ printf("Paranthesis\n"); yyval.ptr = yyvsp[-1].ptr; ;
    break;}
case 104:
#line 266 "t1.y"
{ printf("ID '%s'\n",yyvsp[0].name); yyval.ptr = newJSIdentifier( yyvsp[0].name ); ;
    break;}
case 105:
#line 267 "t1.y"
{ printf("NUM\n"); yyval.ptr = newJSInteger( yyvsp[0].vali ); ;
    break;}
case 106:
#line 268 "t1.y"
{ printf(" "); yyval.ptr = newJSFloat( yyvsp[0].vald ); ;
    break;}
case 107:
#line 269 "t1.y"
{ printf(" "); yyval.ptr = newJSString( yyvsp[0].name ); ;
    break;}
case 108:
#line 270 "t1.y"
{ printf(" "); yyval.ptr = newJSBool( 0 ); ;
    break;}
case 109:
#line 271 "t1.y"
{ printf(" "); yyval.ptr = newJSBool( 1 ); ;
    break;}
case 110:
#line 272 "t1.y"
{ printf(" "); yyval.ptr = newJSNull(); ;
    break;}
case 111:
#line 273 "t1.y"
{ printf(" "); yyval.ptr = newJSThis(); ;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 543 "/usr/lib/bison.simple"

  yyvsp -= yylen;
  yyssp -= yylen;
#ifdef YYLSP_NEEDED
  yylsp -= yylen;
#endif

#if YYDEBUG != 0
  if (yydebug)
    {
      short *ssp1 = yyss - 1;
      fprintf (stderr, "state stack now");
      while (ssp1 != yyssp)
	fprintf (stderr, " %d", *++ssp1);
      fprintf (stderr, "\n");
    }
#endif

  *++yyvsp = yyval;

#ifdef YYLSP_NEEDED
  yylsp++;
  if (yylen == 0)
    {
      yylsp->first_line = yylloc.first_line;
      yylsp->first_column = yylloc.first_column;
      yylsp->last_line = (yylsp-1)->last_line;
      yylsp->last_column = (yylsp-1)->last_column;
      yylsp->text = 0;
    }
  else
    {
      yylsp->last_line = (yylsp+yylen-1)->last_line;
      yylsp->last_column = (yylsp+yylen-1)->last_column;
    }
#endif

  /* Now "shift" the result of the reduction.
     Determine what state that goes to,
     based on the state we popped back to
     and the rule number reduced by.  */

  yyn = yyr1[yyn];

  yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
  if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
    yystate = yytable[yystate];
  else
    yystate = yydefgoto[yyn - YYNTBASE];

  goto yynewstate;

yyerrlab:   /* here on detecting error */

  if (! yyerrstatus)
    /* If not already recovering from an error, report this error.  */
    {
      ++yynerrs;

#ifdef YYERROR_VERBOSE
      yyn = yypact[yystate];

      if (yyn > YYFLAG && yyn < YYLAST)
	{
	  int size = 0;
	  char *msg;
	  int x, count;

	  count = 0;
	  /* Start X at -yyn if nec to avoid negative indexes in yycheck.  */
	  for (x = (yyn < 0 ? -yyn : 0);
	       x < (sizeof(yytname) / sizeof(char *)); x++)
	    if (yycheck[x + yyn] == x)
	      size += strlen(yytname[x]) + 15, count++;
	  msg = (char *) malloc(size + 15);
	  if (msg != 0)
	    {
	      strcpy(msg, "parse error");

	      if (count < 5)
		{
		  count = 0;
		  for (x = (yyn < 0 ? -yyn : 0);
		       x < (sizeof(yytname) / sizeof(char *)); x++)
		    if (yycheck[x + yyn] == x)
		      {
			strcat(msg, count == 0 ? ", expecting `" : " or `");
			strcat(msg, yytname[x]);
			strcat(msg, "'");
			count++;
		      }
		}
	      yyerror(msg);
	      free(msg);
	    }
	  else
	    yyerror ("parse error; also virtual memory exceeded");
	}
      else
#endif /* YYERROR_VERBOSE */
	yyerror("parse error");
    }

  goto yyerrlab1;
yyerrlab1:   /* here on error raised explicitly by an action */

  if (yyerrstatus == 3)
    {
      /* if just tried and failed to reuse lookahead token after an error, discard it.  */

      /* return failure if at end of input */
      if (yychar == YYEOF)
	YYABORT;

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif

      yychar = YYEMPTY;
    }

  /* Else will try to reuse lookahead token
     after shifting the error token.  */

  yyerrstatus = 3;		/* Each real token shifted decrements this */

  goto yyerrhandle;

yyerrdefault:  /* current state does not do anything special for the error token. */

#if 0
  /* This is wrong; only states that explicitly want error tokens
     should shift them.  */
  yyn = yydefact[yystate];  /* If its default is to accept any token, ok.  Otherwise pop it.*/
  if (yyn) goto yydefault;
#endif

yyerrpop:   /* pop the current state because it cannot handle the error token */

  if (yyssp == yyss) YYABORT;
  yyvsp--;
  yystate = *--yyssp;
#ifdef YYLSP_NEEDED
  yylsp--;
#endif

#if YYDEBUG != 0
  if (yydebug)
    {
      short *ssp1 = yyss - 1;
      fprintf (stderr, "Error: state stack now");
      while (ssp1 != yyssp)
	fprintf (stderr, " %d", *++ssp1);
      fprintf (stderr, "\n");
    }
#endif

yyerrhandle:

  yyn = yypact[yystate];
  if (yyn == YYFLAG)
    goto yyerrdefault;

  yyn += YYTERROR;
  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
    goto yyerrdefault;

  yyn = yytable[yyn];
  if (yyn < 0)
    {
      if (yyn == YYFLAG)
	goto yyerrpop;
      yyn = -yyn;
      goto yyreduce;
    }
  else if (yyn == 0)
    goto yyerrpop;

  if (yyn == YYFINAL)
    YYACCEPT;

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Shifting error token, ");
#endif

  *++yyvsp = yylval;
#ifdef YYLSP_NEEDED
  *++yylsp = yylloc;
#endif

  yystate = yyn;
  goto yynewstate;

 yyacceptlab:
  /* YYACCEPT comes here.  */
  if (yyfree_stacks)
    {
      free (yyss);
      free (yyvs);
#ifdef YYLSP_NEEDED
      free (yyls);
#endif
    }
  return 0;

 yyabortlab:
  /* YYABORT comes here.  */
  if (yyfree_stacks)
    {
      free (yyss);
      free (yyvs);
#ifdef YYLSP_NEEDED
      free (yyls);
#endif
    }
  return 1;
}
#line 278 "t1.y"


void yyerror ( char *s )  /* Called by yyparse on error */
{
    printf ("ERROR: %s\n", s);
}

void mainParse( const char *_code )
{
    initFlex( _code );
    yyparse();
}