ctkparser.cpp

C-Talk is interpreted scripting language with C-like syntax and dynamic type checking. Variables in

#endif

/* Push a new state, which is found in  yystate  .  */
/* In all cases, when you get here, the value and location stacks
   have just been pushed. so pushing a state here evens the stacks.  */
yynewstate:

  *++yyssp = yystate;

  if (yyssp >= yyss + yystacksize - 1)
    {
      /* Give user a chance to reallocate the stack */
      /* Use copies of these so that the &'s don't force the real ones into memory. */
      YYSTYPE *yyvs1 = yyvs;
      short *yyss1 = yyss;
#ifdef YYLSP_NEEDED
      YYLTYPE *yyls1 = yyls;
#endif

      /* Get the current used size of the three stacks, in elements.  */
      int size = yyssp - yyss + 1;

#ifdef yyoverflow
      /* Each stack pointer address is followed by the size of
	 the data in use in that stack, in bytes.  */
#ifdef YYLSP_NEEDED
      /* This used to be a conditional around just the two extra args,
	 but that might be undefined if yyoverflow is a macro.  */
      yyoverflow("parser stack overflow",
		 &yyss1, size * sizeof (*yyssp),
		 &yyvs1, size * sizeof (*yyvsp),
		 &yyls1, size * sizeof (*yylsp),
		 &yystacksize);
#else
      yyoverflow("parser stack overflow",
		 &yyss1, size * sizeof (*yyssp),
		 &yyvs1, size * sizeof (*yyvsp),
		 &yystacksize);
#endif

      yyss = yyss1; yyvs = yyvs1;
#ifdef YYLSP_NEEDED
      yyls = yyls1;
#endif
#else /* no yyoverflow */
      /* Extend the stack our own way.  */
      if (yystacksize >= YYMAXDEPTH)
	{
	  yyerror("parser stack overflow");
	  return 2;
	}
      yystacksize *= 2;
      if (yystacksize > YYMAXDEPTH)
	yystacksize = YYMAXDEPTH;
      yyss = (short *) alloca (yystacksize * sizeof (*yyssp));
      __yy_memcpy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
      yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
      __yy_memcpy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
      yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
      __yy_memcpy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp));
#endif
#endif /* no yyoverflow */

      yyssp = yyss + size - 1;
      yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
      yylsp = yyls + size - 1;
#endif

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Stack size increased to %d\n", yystacksize);
#endif

      if (yyssp >= yyss + yystacksize - 1)
	YYABORT;
    }

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Entering state %d\n", yystate);
#endif

  goto yybackup;
 yybackup:

/* Do appropriate processing given the current state.  */
/* Read a lookahead token if we need one and don't already have one.  */
/* yyresume: */

  /* First try to decide what to do without reference to lookahead token.  */

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

  /* Not known => get a lookahead token if don't already have one.  */

  /* yychar is either YYEMPTY or YYEOF
     or a valid token in external form.  */

  if (yychar == YYEMPTY)
    {
#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Reading a token: ");
#endif
      yychar = YYLEX;
    }

  /* Convert token to internal form (in yychar1) for indexing tables with */

  if (yychar <= 0)		/* This means end of input. */
    {
      yychar1 = 0;
      yychar = YYEOF;		/* Don't call YYLEX any more */

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Now at end of input.\n");
#endif
    }
  else
    {
      yychar1 = YYTRANSLATE(yychar);

#if YYDEBUG != 0
      if (yydebug)
	{
	  fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
	  /* Give the individual parser a way to print the precise meaning
	     of a token, for further debugging info.  */
#ifdef YYPRINT
	  YYPRINT (stderr, yychar, yylval);
#endif
	  fprintf (stderr, ")\n");
	}
#endif
    }

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

  yyn = yytable[yyn];

  /* yyn is what to do for this token type in this state.
     Negative => reduce, -yyn is rule number.
     Positive => shift, yyn is new state.
       New state is final state => don't bother to shift,
       just return success.
     0, or most negative number => error.  */

  if (yyn < 0)
    {
      if (yyn == YYFLAG)
	goto yyerrlab;
      yyn = -yyn;
      goto yyreduce;
    }
  else if (yyn == 0)
    goto yyerrlab;

  if (yyn == YYFINAL)
    YYACCEPT;

  /* Shift the lookahead token.  */

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

  /* Discard the token being shifted unless it is eof.  */
  if (yychar != YYEOF)
    yychar = YYEMPTY;

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

  /* count tokens shifted since error; after three, turn off error status.  */
  if (yyerrstatus) yyerrstatus--;

  yystate = yyn;
  goto yynewstate;

/* Do the default action for the current state.  */
yydefault:

  yyn = yydefact[yystate];
  if (yyn == 0)
    goto yyerrlab;

/* Do a reduction.  yyn is the number of a rule to reduce with.  */
yyreduce:
  yylen = yyr2[yyn];
  if (yylen > 0)
    yyval = yyvsp[1-yylen]; /* implement default value of the action */

#if YYDEBUG != 0
  if (yydebug)
    {
      int i;

      fprintf (stderr, "Reducing via rule %d (line %d), ",
	       yyn, yyrline[yyn]);

      /* Print the symbols being reduced, and their result.  */
      for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
	fprintf (stderr, "%s ", yytname[yyrhs[i]]);
      fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
    }
#endif


  switch (yyn) {

case 1:
#line 120 "parser.y"
{ 
    yyval.prog = new CtkProgram(yyvsp[-1].toks, yyvsp[0].stmt);
    CtkCompiler::instance.program = yyval.prog;
;
    break;}
case 2:
#line 125 "parser.y"
{ yyval.toks = NULL; ;
    break;}
case 3:
#line 125 "parser.y"
{ yyval.toks = yyvsp[-1].toks; ;
    break;}
case 4:
#line 127 "parser.y"
{ yyval.stmt = NULL; ;
    break;}
case 5:
#line 127 "parser.y"
{ yyvsp[-1].stmt->next = yyvsp[0].stmt; yyval.stmt = yyvsp[-1].stmt; ;
    break;}
case 21:
#line 133 "parser.y"
{ 
    yyval.stmt = new CtkFuncDef(yyvsp[-4].tok, yyvsp[-2].toks, yyvsp[0].stmt);
;
    break;}
case 22:
#line 137 "parser.y"
{ yyval.toks = NULL; ;
    break;}
case 24:
#line 139 "parser.y"
{ yyval.toks = new CtkTokenList(yyvsp[0].tok, NULL); ;
    break;}
case 25:
#line 140 "parser.y"
{ yyval.toks = new CtkTokenList(yyvsp[-2].tok, yyvsp[0].toks); ;
    break;}
case 26:
#line 142 "parser.y"
{ 
    yyval.stmt = new CtkIfStmt(yyvsp[-3].expr, yyvsp[-1].stmt, yyvsp[0].stmt);
;
    break;}
case 27:
#line 146 "parser.y"
{ yyval.stmt = NULL; ;
    break;}
case 28:
#line 146 "parser.y"
{ yyval.stmt = yyvsp[0].stmt; ;
    break;}
case 29:
#line 148 "parser.y"
{ 
    yyval.stmt = new CtkForStmt(yyvsp[-6].expr, yyvsp[-4].expr, yyvsp[-2].expr, yyvsp[0].stmt);
;
    break;}
case 30:
#line 152 "parser.y"
{ yyval.expr = NULL; ;
    break;}
case 32:
#line 154 "parser.y"
{ 
     yyval.stmt = new CtkDoWhileStmt(yyvsp[-5].stmt, yyvsp[-2].expr);
;
    break;}
case 33:
#line 158 "parser.y"
{ 
     yyval.stmt = new CtkWhileStmt(yyvsp[-2].expr, yyvsp[0].stmt);
;
    break;}
case 34:
#line 162 "parser.y"
{ 
    yyval.stmt = new CtkSwitchStmt(yyvsp[-4].expr, yyvsp[-1].cass);
;
    break;}
case 35:
#line 166 "parser.y"
{ yyval.cass = NULL; ;
    break;}
case 36:
#line 166 "parser.y"
{ yyvsp[-1].cass->next = yyvsp[0].cass; yyval.cass = yyvsp[-1].cass; ;
    break;}
case 37:
#line 168 "parser.y"
{ 
    yyval.cass = new CtkCaseStmt(yyvsp[-2].expr, yyvsp[0].stmt); 
;
    break;}
case 38:
#line 171 "parser.y"
{ 
    yyval.cass = new CtkCaseStmt(NULL, yyvsp[0].stmt); 
;
    break;}
case 39:
#line 175 "parser.y"
{ 
    yyval.stmt = new CtkContinueStmt();
;
    break;}
case 40:
#line 179 "parser.y"
{ 
    yyval.stmt = new CtkBreakStmt();
;
    break;}
case 41:
#line 183 "parser.y"
{ 
    yyval.stmt = new CtkReturnStmt();
;
    break;}
case 42:
#line 186 "parser.y"
{ 
    yyval.stmt = new CtkReturnStmt(yyvsp[-1].expr);
;
    break;}
case 43:
#line 190 "parser.y"
{ 
    yyval.stmt = new CtkThrowStmt(yyvsp[-1].expr); 
;
    break;}
case 44:
#line 194 "parser.y"
{ 
    yyval.stmt = new CtkTryStmt(yyvsp[-5].stmt, yyvsp[-2].tok, yyvsp[0].stmt);
;
    break;}
case 45:
#line 198 "parser.y"
{ yyval.stmt = yyvsp[-1].stmt; ;
    break;}
case 46:
#line 200 "parser.y"
{ yyval.stmt = new CtkExprStmt(yyvsp[-1].expr); ;
    break;}
case 47:
#line 202 "parser.y"
{ yyval.stmt = new CtkEmptyStmt(); ;
    break;}
case 48:
#line 204 "parser.y"
{ 
    yyval.stmt = new CtkSynchronizedStmt(yyvsp[-2].expr, yyvsp[0].stmt);
;
    break;}
case 50:
#line 209 "parser.y"
{ yyval.expr = new CtkAddExpr(yyvsp[-2].expr, yyvsp[0].expr); ;
    break;}
case 51:
#line 210 "parser.y"
{ yyval.expr = new CtkSubExpr(yyvsp[-2].expr, yyvsp[0].expr); ;
    break;}
case 52:
#line 211 "parser.y"
{ yyval.expr = new CtkDivExpr(yyvsp[-2].expr, yyvsp[0].expr); ;
    break;}
case 53:
#line 212 "parser.y"
{ yyval.expr = new CtkModExpr(yyvsp[-2].expr, yyvsp[0].expr); ;
    break;}
case 54:
#line 213 "parser.y"
{ yyval.expr = new CtkMulExpr(yyvsp[-2].expr, yyvsp[0].expr); ;
    break;}
case 55:
#line 214 "parser.y"
{ yyval.expr = new CtkOrExpr(yyvsp[-2].expr, yyvsp[0].expr); ;
    break;}