------------------------------- --------------------------.
| yy_stack_print - Print the state stack from its BOTTOM up to its |
| TOP (included). | p align="justify"> `----------------------------------------- ------------------------- */
# if defined (__STDC__) | | defined (__cplusplus) void_stack_print (short int * bottom, short int * top)
# elsevoid_stack_print (bottom, top) int * bottom; int * top;
# endif
{(stderr, "Stack now"); (/ * Nothing. * /; bottom <= top; + + bottom) (stderr, "% d", * bottom); (stderr, " n");
}
# define YY_STACK_PRINT (Bottom, Top) { (yydebug) _stack_print ((Bottom), (Top));
} while (0)
/* ---------------------------------------- --------.
| Report that the YYRULE is going to be reduced. | p align="justify"> `----------------------------------------- ------- */
# if defined (__STDC__) | | defined (__cplusplus) void_reduce_print (int yyrule)
# elsevoid_reduce_print (yyrule) yyrule;
# endif
{yyi; long int yylno = yyrline [yyrule]; (stderr, "Reducing stack by rule% d (line% lu),", - 1, yylno);
/* Print the symbols being reduced, and their result. */(Yyi = yyprhs [yyrule]; 0 <= yyrhs [yyi]; yyi + +) (stderr, "% s", yytname [yyrhs [yyi]]); (stderr, "->% s n ", yytname [yyr1 [yyrule]]);
}
# define YY_REDUCE_PRINT (Rule) { (yydebug) _reduce_print (Rule);
} while (0)
/* Nonzero means print parse trace. It is left uninitialized so thatparsers can coexist. */Yydebug;
# else/*! YYDEBUG */
# define YYDPRINTF (Args)
# define YY_SYMBOL_PRINT (Title, Type, Value, Location)
# define YY_STACK_PRINT (Bottom, Top)
# define YY_REDUCE_PRINT (Rule)
# endif/*! YYDEBUG */
/* YYINITDEPTH - initial size of the parser's stacks. */p align="justify"> # ifndefYYINITDEPTH
# define YYINITDEPTH 200
# endif
/* YYMAXDEPTH - maximum size the stacks can grow to (effective onlythe built-in stack extension method is used). not make this value too large; the results are undefined if_ALLOC_MAXIMUM # ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
# endif
# if YYERROR_VERBOSE
# ifndef yystrlen
