/* Output the generated parsing program for bison,
- Copyright (C) 1984, 1986, 1989, 1992, 2000 Free Software Foundation, Inc.
+
+ Copyright (C) 1984, 1986, 1989, 1992, 2000, 2001 Free Software
+ Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
*/
#include "system.h"
+#include "obstack.h"
+#include "quotearg.h"
#include "getargs.h"
-#include "xalloc.h"
#include "files.h"
#include "gram.h"
#include "LR0.h"
#include "reader.h"
#include "conflicts.h"
-extern void berror PARAMS((const char *));
-
-
static int nvectors;
static int nentries;
-static short **froms;
-static short **tos;
-static short *tally;
-static short *width;
-static short *actrow;
-static short *state_count;
-static short *order;
-static short *base;
-static short *pos;
-static short *table;
-static short *check;
+static short **froms = NULL;
+static short **tos = NULL;
+static short *tally = NULL;
+static short *width = NULL;
+static short *actrow = NULL;
+static short *state_count = NULL;
+static short *order = NULL;
+static short *base = NULL;
+static short *pos = NULL;
+static short *table = NULL;
+static short *check = NULL;
static int lowzero;
static int high;
static inline void
-output_short_or_char_table (FILE *out,
+output_short_or_char_table (struct obstack *oout,
const char *comment,
const char *type,
const char *table_name,
short *short_table,
short first_value,
- short begin, short end)
+ int begin, int end)
{
int i, j;
if (comment)
- fprintf (out, "/* %s. */\n", comment);
+ obstack_fgrow1 (oout, "/* %s. */\n", comment);
- fprintf (out, "static const %s %s[] =\n{\n %6d",
- type, table_name, first_value);
+ obstack_fgrow3 (oout, "static const %s %s[] =\n{\n %6d",
+ type, table_name, first_value);
j = 1;
for (i = begin; i < end; i++)
{
- putc (',', out);
+ obstack_1grow (oout, ',');
if (j >= 10)
{
- fputs ("\n ", out);
+ obstack_sgrow (oout, "\n ");
j = 1;
}
else
j++;
}
- fprintf (out, "%6d", short_table[i]);
+ obstack_fgrow1 (oout, "%6d", short_table[i]);
}
- fprintf (out, "\n};\n");
+ obstack_sgrow (oout, "\n};\n");
}
static inline void
-output_short_table (FILE *out,
+output_short_table (struct obstack *oout,
const char *comment,
const char *table_name,
short *short_table,
short first_value,
- short begin, short end)
+ int begin, int end)
{
- output_short_or_char_table (out, comment, "short", table_name, short_table,
+ output_short_or_char_table (oout, comment, "short", table_name, short_table,
first_value, begin, end);
}
| certain files. |
`--------------------------------------------------------------*/
+/* Don't put the `%s' insides quotes, since it quotearg puts them. */
+
#define GUARDSTR \
"\n\
-#include \"%s\"\n\
+#include %s\n\
extern int yyerror;\n\
extern int yycost;\n\
extern char * yymsg;\n\
#define ACTSTR \
"\n\
-#include \"%s\"\n\
+#include %s\n\
extern YYSTYPE yyval;\n\
extern int yychar;\n\
\n\
void
output_headers (void)
{
+ char *attrsfile_quoted = 0;
+
if (semantic_parser)
- fprintf (fguard, GUARDSTR, attrsfile);
+ {
+ /* FIXME: This is *buggy*. ATTRSFILE is not computed yet, since
+ we are waiting for the full input file to have been read to
+ be sure of the output file name. So basically, here, a SEGV
+ is guaranteed. OTOH, currently semantic parsers are not
+ supported. */
+ attrsfile_quoted = quotearg_style (c_quoting_style, attrsfile);
+ obstack_fgrow1 (&guard_obstack, GUARDSTR, attrsfile_quoted);
+ }
if (no_parser_flag)
return;
- fprintf (faction, (semantic_parser ? ACTSTR : ACTSTR_SIMPLE), attrsfile);
-/* if (semantic_parser) JF moved this below
- fprintf(ftable, "#include \"%s\"\n", attrsfile);
- fprintf(ftable, "#include <stdio.h>\n\n");
-*/
+ if (semantic_parser)
+ obstack_fgrow1 (&action_obstack, ACTSTR, attrsfile_quoted);
+ else
+ obstack_sgrow (&action_obstack, ACTSTR_SIMPLE);
/* Rename certain symbols if -p was specified. */
if (spec_name_prefix)
{
- fprintf (ftable, "#define yyparse %sparse\n", spec_name_prefix);
- fprintf (ftable, "#define yylex %slex\n", spec_name_prefix);
- fprintf (ftable, "#define yyerror %serror\n", spec_name_prefix);
- fprintf (ftable, "#define yylval %slval\n", spec_name_prefix);
- fprintf (ftable, "#define yychar %schar\n", spec_name_prefix);
- fprintf (ftable, "#define yydebug %sdebug\n", spec_name_prefix);
- fprintf (ftable, "#define yynerrs %snerrs\n", spec_name_prefix);
+ obstack_fgrow1 (&table_obstack,
+ "#define yyparse %sparse\n", spec_name_prefix);
+ obstack_fgrow1 (&table_obstack,
+ "#define yylex %slex\n", spec_name_prefix);
+ obstack_fgrow1 (&table_obstack,
+ "#define yyerror %serror\n", spec_name_prefix);
+ obstack_fgrow1 (&table_obstack,
+ "#define yylval %slval\n", spec_name_prefix);
+ obstack_fgrow1 (&table_obstack,
+ "#define yychar %schar\n", spec_name_prefix);
+ obstack_fgrow1 (&table_obstack,
+ "#define yydebug %sdebug\n", spec_name_prefix);
+ obstack_fgrow1 (&table_obstack,
+ "#define yynerrs %snerrs\n", spec_name_prefix);
}
}
output_trailers (void)
{
if (semantic_parser)
- fprintf (fguard, "\n }\n}\n");
+ obstack_sgrow (&guard_obstack, "\n }\n}\n");
- fprintf (faction, "\n");
+ obstack_1grow (&action_obstack, '\n');
if (no_parser_flag)
return;
if (semantic_parser)
- fprintf (faction, " }\n");
- fprintf (faction, "}\n");
+ obstack_sgrow (&action_obstack, " }\n");
+
+ obstack_sgrow (&action_obstack, "}\n");
}
static void
output_token_translations (void)
{
- fputs ("\
+ obstack_sgrow (&table_obstack, "\
\n\
-/* YYRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */\n",
- ftable);
- if (translations)
- {
- fprintf (ftable,
+/* YYTRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */\n");
+
+ obstack_fgrow2 (&table_obstack,
"#define YYTRANSLATE(x) ((unsigned)(x) <= %d ? yytranslate[x] : %d)\
\n\
\n",
- max_user_token_number, nsyms);
+ max_user_token_number, nsyms);
- output_short_or_char_table (ftable,
- "YYRANSLATE[YYLEX] -- Bison token number corresponding to YYLEX",
- ntokens < 127 ? "char" : "short",
- "yytranslate", token_translations,
- 0, 1, max_user_token_number + 1);
- }
- else
- {
- fprintf (ftable, "\n#define YYTRANSLATE(x) (x)\n");
- }
+ output_short_or_char_table (&table_obstack,
+ "YYTRANSLATE[YYLEX] -- Bison token number corresponding to YYLEX",
+ ntokens < 127 ? "char" : "short",
+ "yytranslate", token_translations,
+ 0, 1, max_user_token_number + 1);
+
+ XFREE (token_translations);
}
yyprhs and yyrhs are needed only for yydebug. */
/* With the no_parser option, all tables are generated */
if (!semantic_parser && !no_parser_flag)
- fprintf (ftable, "\n#if YYDEBUG != 0\n");
+ obstack_sgrow (&table_obstack, "\n#if YYDEBUG\n");
- output_short_table (ftable, NULL, "yyprhs", rrhs,
- 0, 1, nrules + 1);
+ {
+ int i;
+ short *values = XCALLOC (short, nrules + 1);
+ for (i = 0; i < nrules + 1; ++i)
+ values[i] = rule_table[i].rhs;
+ output_short_table (&table_obstack, NULL, "yyprhs", values,
+ 0, 1, nrules + 1);
+ XFREE (values);
+ }
{
size_t yyrhs_size = 1;
for (sp = ritem + 1, i = 1; *sp; ++sp, ++i)
yyrhs[i] = *sp > 0 ? *sp : 0;
- output_short_table (ftable, NULL, "yyrhs", yyrhs,
+ output_short_table (&table_obstack, NULL, "yyrhs", yyrhs,
ritem[0], 1, yyrhs_size);
XFREE (yyrhs);
}
if (!semantic_parser && !no_parser_flag)
- fprintf (ftable, "\n#endif\n");
+ obstack_sgrow (&table_obstack, "\n#endif\n");
}
static void
output_stos (void)
{
- output_short_table (ftable, NULL, "yystos", accessing_symbol,
+ int i;
+ short *values = (short *) alloca (sizeof (short) * nstates);
+ for (i = 0; i < nstates; ++i)
+ values[i] = state_table[i].accessing_symbol;
+ output_short_table (&table_obstack,
+ "YYSTOS[STATE] -- Accessing symbol to the STATE",
+ "yystos", values,
0, 1, nstates);
}
int j;
short *short_tab = NULL;
- fputs ("\n\
-#if YYDEBUG != 0\n",
- ftable);
+ obstack_sgrow (&table_obstack, "\n\
+#if YYDEBUG\n");
- output_short_table (ftable,
- "YYRLINE[YYN] -- source line where rule number YYN was defined",
- "yyrline", rline,
- 0, 1, nrules + 1);
+ {
+ short *values = XCALLOC (short, nrules + 1);
+ for (i = 0; i < nrules + 1; ++i)
+ values[i] = rule_table[i].line;
+ output_short_table (&table_obstack,
+ "YYRLINE[YYN] -- source line where rule number YYN was defined",
+ "yyrline", values,
+ 0, 1, nrules + 1);
+ XFREE (values);
+ }
- fputs ("#endif\n\n", ftable);
+ obstack_sgrow (&table_obstack, "#endif\n\n");
if (token_table_flag || no_parser_flag)
{
- fprintf (ftable, "#define YYNTOKENS %d\n", ntokens);
- fprintf (ftable, "#define YYNNTS %d\n", nvars);
- fprintf (ftable, "#define YYNRULES %d\n", nrules);
- fprintf (ftable, "#define YYNSTATES %d\n", nstates);
- fprintf (ftable, "#define YYMAXUTOK %d\n\n", max_user_token_number);
+ obstack_fgrow1 (&table_obstack, "#define YYNTOKENS %d\n", ntokens);
+ obstack_fgrow1 (&table_obstack, "#define YYNNTS %d\n", nvars);
+ obstack_fgrow1 (&table_obstack, "#define YYNRULES %d\n", nrules);
+ obstack_fgrow1 (&table_obstack, "#define YYNSTATES %d\n", nstates);
+ obstack_fgrow1 (&table_obstack, "#define YYMAXUTOK %d\n\n",
+ max_user_token_number);
}
/* Output the table of symbol names. */
if (!token_table_flag && !no_parser_flag)
- fputs ("\n#if YYDEBUG != 0 || defined YYERROR_VERBOSE\n\n", ftable);
- fputs ("\
-/* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */\n",
- ftable);
- fprintf (ftable,
+ obstack_sgrow (&table_obstack,
+ "\n#if (YYDEBUG) || defined YYERROR_VERBOSE\n\n");
+ obstack_sgrow (&table_obstack, "\
+/* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */\n");
+ obstack_sgrow (&table_obstack,
"static const char *const yytname[] =\n{\n ");
j = 0;
if (j + strsize > 75)
{
- fputs ("\n ", ftable);
+ obstack_sgrow (&table_obstack, "\n ");
j = 2;
}
- putc ('\"', ftable);
+ obstack_1grow (&table_obstack, '\"');
for (p = tags[i]; p && *p; p++)
{
if (*p == '"' || *p == '\\')
- {
- fprintf (ftable, "\\%c", *p);
- }
+ obstack_fgrow1 (&table_obstack, "\\%c", *p);
else if (*p == '\n')
- {
- fprintf (ftable, "\\n");
- }
+ obstack_sgrow (&table_obstack, "\\n");
else if (*p == '\t')
- {
- fprintf (ftable, "\\t");
- }
+ obstack_sgrow (&table_obstack, "\\t");
else if (*p == '\b')
- {
- fprintf (ftable, "\\b");
- }
+ obstack_sgrow (&table_obstack, "\\b");
else if (*p < 040 || *p >= 0177)
- {
- fprintf (ftable, "\\%03o", *p);
- }
+ obstack_fgrow1 (&table_obstack, "\\%03o", *p);
else
- {
- putc (*p, ftable);
- }
+ obstack_1grow (&table_obstack, *p);
}
- fputs ("\", ", ftable);
+ obstack_sgrow (&table_obstack, "\", ");
j += strsize;
}
/* add a NULL entry to list of tokens */
- fprintf (ftable, "NULL\n};\n");
+ obstack_sgrow (&table_obstack, "NULL\n};\n");
if (!token_table_flag && !no_parser_flag)
- fprintf (ftable, "#endif\n\n");
+ obstack_sgrow (&table_obstack, "#endif\n\n");
/* Output YYTOKNUM. */
if (token_table_flag)
{
- output_short_table (ftable,
+ output_short_table (&table_obstack,
"YYTOKNUM[YYLEX] -- Index in YYTNAME corresponding to YYLEX",
"yytoknum", user_toknums,
0, 1, ntokens + 1);
}
/* Output YYR1. */
- output_short_table (ftable,
+ {
+ short *values = XCALLOC (short, nrules + 1);
+ for (i = 0; i < nrules + 1; ++i)
+ values[i] = rule_table[i].lhs;
+ output_short_table (&table_obstack,
"YYR1[YYN] -- Symbol number of symbol that rule YYN derives",
- "yyr1", rlhs,
- 0, 1, nrules + 1);
- XFREE (rlhs + 1);
+ "yyr1", values,
+ 0, 1, nrules + 1);
+ XFREE (values);
+ }
- putc ('\n', ftable);
+ obstack_1grow (&table_obstack, '\n');
/* Output YYR2. */
short_tab = XMALLOC (short, nrules + 1);
for (i = 1; i < nrules; i++)
- short_tab[i] = rrhs[i + 1] - rrhs[i] - 1;
- short_tab[nrules] = nitems - rrhs[nrules] - 1;
- output_short_table (ftable,
+ short_tab[i] = rule_table[i + 1].rhs - rule_table[i].rhs - 1;
+ short_tab[nrules] = nitems - rule_table[nrules].rhs - 1;
+ output_short_table (&table_obstack,
"YYR2[YYN] -- Number of symbols composing right hand side of rule YYN",
"yyr2", short_tab,
0, 1, nrules + 1);
- putc ('\n', ftable);
+ obstack_1grow (&table_obstack, '\n');
XFREE (short_tab);
- XFREE (rrhs + 1);
+ XFREE (rule_table + 1);
}
static void
output_defines (void)
{
- fprintf (ftable, "\n\n#define\tYYFINAL\t\t%d\n", final_state);
- fprintf (ftable, "#define\tYYFLAG\t\t%d\n", MINSHORT);
- fprintf (ftable, "#define\tYYNTBASE\t%d\n", ntokens);
+ obstack_fgrow1 (&table_obstack, "\n\n#define\tYYFINAL\t\t%d\n", final_state);
+ obstack_fgrow1 (&table_obstack, "#define\tYYFLAG\t\t%d\n", MINSHORT);
+ obstack_fgrow1 (&table_obstack, "#define\tYYNTBASE\t%d\n", ntokens);
}
int k;
int m = 0;
int n = 0;
- int count;
int default_rule;
int nreds;
- int max;
int rule;
int shift_state;
int symbol;
- unsigned mask;
- unsigned *wordp;
reductions *redp;
shifts *shiftp;
errs *errp;
default_rule = 0;
nreds = 0;
- redp = reduction_table[state];
+ redp = state_table[state].reductions;
if (redp)
{
{
/* loop over all the rules available here which require
lookahead */
- m = lookaheads[state];
- n = lookaheads[state + 1];
+ m = state_table[state].lookaheads;
+ n = state_table[state + 1].lookaheads;
for (i = n - 1; i >= m; i--)
- {
- rule = -LAruleno[i];
- wordp = LA + i * tokensetsize;
- mask = 1;
-
- /* and find each token which the rule finds acceptable
- to come next */
- for (j = 0; j < ntokens; j++)
- {
- /* and record this rule as the rule to use if that
- token follows. */
- if (mask & *wordp)
- actrow[j] = rule;
-
- mask <<= 1;
- if (mask == 0)
- {
- mask = 1;
- wordp++;
- }
- }
- }
+ /* and find each token which the rule finds acceptable
+ to come next */
+ for (j = 0; j < ntokens; j++)
+ /* and record this rule as the rule to use if that
+ token follows. */
+ if (BITISSET (LA (i), j))
+ actrow[j] = -LAruleno[i];
}
}
- shiftp = shift_table[state];
-
/* Now see which tokens are allowed for shifts in this state. For
them, record the shift as the thing to do. So shift is preferred
to reduce. */
-
- if (shiftp)
+ shiftp = state_table[state].shifts;
+ for (i = 0; i < shiftp->nshifts; i++)
{
- k = shiftp->nshifts;
-
- for (i = 0; i < k; i++)
- {
- shift_state = shiftp->shifts[i];
- if (!shift_state)
- continue;
+ shift_state = shiftp->shifts[i];
+ if (!shift_state)
+ continue;
- symbol = accessing_symbol[shift_state];
+ symbol = state_table[shift_state].accessing_symbol;
- if (ISVAR (symbol))
- break;
+ if (ISVAR (symbol))
+ break;
- actrow[symbol] = shift_state;
+ actrow[symbol] = shift_state;
- /* Do not use any default reduction if there is a shift for
- error */
- if (symbol == error_token_number)
- nodefault = 1;
- }
+ /* Do not use any default reduction if there is a shift for
+ error */
+ if (symbol == error_token_number)
+ nodefault = 1;
}
- errp = err_table[state];
-
/* See which tokens are an explicit error in this state (due to
%nonassoc). For them, record MINSHORT as the action. */
+ errp = state_table[state].errs;
if (errp)
{
if (nreds >= 1 && !nodefault)
{
- if (consistent[state])
+ if (state_table[state].consistent)
default_rule = redp->rules[0];
else
{
- max = 0;
+ int max = 0;
for (i = m; i < n; i++)
{
- count = 0;
+ int count = 0;
rule = -LAruleno[i];
for (j = 0; j < ntokens; j++)
}
XFREE (actrow);
- output_short_table (ftable,
+ output_short_table (&table_obstack,
"YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE\n\
doesn't specify something else to do. Zero means the default is an\n\
error",
"yydefact", yydefact,
yydefact[0], 1, nstates);
- putc ('\n', ftable);
+ obstack_1grow (&table_obstack, '\n');
XFREE (yydefact);
}
-static void
-free_shifts (void)
-{
- shifts *sp, *sptmp; /* JF derefrenced freed ptr */
-
- XFREE (shift_table);
-
- for (sp = first_shift; sp; sp = sptmp)
- {
- sptmp = sp->next;
- XFREE (sp);
- }
-}
-
-
-static void
-free_reductions (void)
-{
- reductions *rp, *rptmp; /* JF fixed freed ptr */
-
- XFREE (reduction_table);
-
- for (rp = first_reduction; rp; rp = rptmp)
- {
- rptmp = rp->next;
- XFREE (rp);
- }
-}
-
-
-
static void
save_column (int symbol, int default_state)
{
yydefgoto[i - ntokens] = default_state;
}
- output_short_table (ftable, NULL, "yydefgoto", yydefgoto,
+ output_short_table (&table_obstack, NULL, "yydefgoto", yydefgoto,
yydefgoto[0], 1, nsyms - ntokens);
XFREE (state_count);
return j;
}
}
-
- berror ("pack_vector");
- return 0; /* JF keep lint happy */
+#define pack_vector_succeeded 0
+ assert (pack_vector_succeeded);
+ return 0;
}
static void
output_base (void)
{
- output_short_table (ftable, NULL, "yypact", base,
+ output_short_table (&table_obstack, NULL, "yypact", base,
base[0], 1, nstates);
- putc ('\n', ftable);
+ obstack_1grow (&table_obstack, '\n');
- output_short_table (ftable, NULL, "yypgoto", base,
+ output_short_table (&table_obstack, NULL, "yypgoto", base,
base[nstates], nstates + 1, nvectors);
XFREE (base);
static void
output_table (void)
{
- fprintf (ftable, "\n\n#define\tYYLAST\t\t%d\n\n\n", high);
- output_short_table (ftable, NULL, "yytable", table,
+ obstack_fgrow1 (&table_obstack, "\n\n#define\tYYLAST\t\t%d\n\n\n", high);
+ output_short_table (&table_obstack, NULL, "yytable", table,
table[0], 1, high + 1);
XFREE (table);
}
static void
output_check (void)
{
- output_short_table (ftable, NULL, "yycheck", check,
+ output_short_table (&table_obstack, NULL, "yycheck", check,
check[0], 1, high + 1);
XFREE (check);
}
width = XCALLOC (short, nvectors);
token_actions ();
- free_shifts ();
- free_reductions ();
- XFREE (lookaheads);
+ LIST_FREE (shifts, first_shift);
+ LIST_FREE (reductions, first_reduction);
XFREE (LA);
XFREE (LAruleno);
- XFREE (accessing_symbol);
goto_actions ();
XFREE (goto_map + ntokens);
sort_actions ();
pack_table ();
- putc ('\n', ftable);
+ obstack_1grow (&table_obstack, '\n');
output_base ();
output_table ();
- putc ('\n', ftable);
+ obstack_1grow (&table_obstack, '\n');
output_check ();
}
-/* copy the parser code into the ftable file at the end. */
+/*------------------------------------------.
+| Copy the parser code into TABLE_OBSTACK. |
+`------------------------------------------*/
static void
output_parser (void)
{
int c;
- static int number_of_dollar_signs = 0;
-#ifdef DONTDEF
- FILE *fpars;
-#else
-#define fpars fparser
-#endif
+ FILE *fskel;
+ size_t line;
+ int actions_dumped = 0;
if (pure_parser)
- fprintf (ftable, "#define YYPURE 1\n\n");
-
-#ifdef DONTDEF
- /* JF no longer needed 'cuz open_extra_files changes the currently
- open parser from bison.simple to bison.hairy */
- if (semantic_parser)
- fpars = fparser;
- else
- fpars = fparser1;
-#endif
+ obstack_sgrow (&table_obstack, "#define YYPURE 1\n\n");
/* Loop over lines in the standard parser file. */
+ if (!skeleton)
+ {
+ if (semantic_parser)
+ skeleton = skeleton_find ("BISON_HAIRY", BISON_HAIRY);
+ else
+ skeleton = skeleton_find ("BISON_SIMPLE", BISON_SIMPLE);
+ }
+ assert (skeleton);
+ fskel = xfopen (skeleton, "r");
+
+ /* Set LINE to 2, not 1: `#line LINENUM' -- Here LINENUM is a
+ decimal integer constant. This specifies that the line number of
+ the *following* line of input, in its original source file, was
+ LINENUM. */
+ line = 2;
while (1)
{
- int write_line = 1;
+ enum line_type_e
+ {
+ regular_line,
+ sync_line, /* #line. */
+ actions_line /* %% actions. */
+ };
+ enum line_type_e line_type = regular_line;
- c = getc (fpars);
+ c = getc (fskel);
- /* See if the line starts with `#line.
- If so, set write_line to 0. */
- if (no_lines_flag)
- if (c == '#')
- {
- c = getc (fpars);
- if (c == 'l')
- {
- c = getc (fpars);
- if (c == 'i')
- {
- c = getc (fpars);
- if (c == 'n')
- {
- c = getc (fpars);
- if (c == 'e')
- write_line = 0;
+ /* Is this line special? */
+ if (c == '#')
+ {
+ /* See if it's a `#line' line. */
+ if ((c = getc (fskel)) == 'l')
+ if ((c = getc (fskel)) == 'i')
+ if ((c = getc (fskel)) == 'n')
+ if ((c = getc (fskel)) == 'e')
+ line_type = sync_line;
+ else
+ obstack_sgrow (&table_obstack, "#lin");
+ else
+ obstack_sgrow (&table_obstack, "#li");
+ else
+ obstack_sgrow (&table_obstack, "#l");
+ else
+ obstack_sgrow (&table_obstack, "#");
+ }
+ else if (c == '%')
+ {
+ /* See if it's a `%% actions' line. */
+ if ((c = getc (fskel)) == '%')
+ if ((c = getc (fskel)) == ' ')
+ if ((c = getc (fskel)) == 'a')
+ if ((c = getc (fskel)) == 'c')
+ if ((c = getc (fskel)) == 't')
+ if ((c = getc (fskel)) == 'i')
+ if ((c = getc (fskel)) == 'o')
+ if ((c = getc (fskel)) == 'n')
+ if ((c = getc (fskel)) == 's')
+ line_type = actions_line;
+ else
+ obstack_sgrow (&table_obstack, "%% action");
else
- fprintf (ftable, "#lin");
- }
+ obstack_sgrow (&table_obstack, "%% actio");
+ else
+ obstack_sgrow (&table_obstack, "%% acti");
else
- fprintf (ftable, "#li");
- }
+ obstack_sgrow (&table_obstack, "%% act");
+ else
+ obstack_sgrow (&table_obstack, "%% ac");
else
- fprintf (ftable, "#l");
- }
+ obstack_sgrow (&table_obstack, "%% a");
+ else
+ obstack_sgrow (&table_obstack, "%% ");
else
- fprintf (ftable, "#");
- }
+ obstack_sgrow (&table_obstack, "%%");
+ else
+ obstack_sgrow (&table_obstack, "%");
+ }
+
+ switch (line_type)
+ {
+ case sync_line:
+ if (!no_lines_flag)
+ obstack_fgrow2 (&table_obstack, "#line %d %s\n",
+ line, quotearg_style (c_quoting_style, skeleton));
+
+ /* Skip the end of line. */
+ for (; c != '\n' && c != EOF; c = getc (fskel))
+ /* nothing */;
+ break;
- /* now write out the line... */
- for (; c != '\n' && c != EOF; c = getc (fpars))
- if (write_line)
+ case actions_line:
{
- if (c == '$')
- {
- number_of_dollar_signs++;
- assert (number_of_dollar_signs == 1);
- /* `$' in the parser file indicates where to put the actions.
- Copy them in at this point. */
- rewind (faction);
- for (c = getc (faction); c != EOF; c = getc (faction))
- putc (c, ftable);
- /* Skip the end of the line containing `$'. */
- write_line = 0;
- }
- else
- putc (c, ftable);
+ size_t size = obstack_object_size (&action_obstack);
+
+ actions_dumped++;
+ assert (actions_dumped == 1);
+ obstack_grow (&table_obstack,
+ obstack_finish (&action_obstack),
+ size);
}
+
+ /* Skip the end of line. */
+ for (; c != '\n' && c != EOF; c = getc (fskel))
+ /* nothing */;
+ break;
+
+ case regular_line:
+ for (; c != '\n' && c != EOF; c = getc (fskel))
+ obstack_1grow (&table_obstack, c);
+ }
+
if (c == EOF)
break;
- putc (c, ftable);
+ obstack_1grow (&table_obstack, c);
+ line++;
}
- assert (number_of_dollar_signs == 1);
+ assert (actions_dumped == 1);
+ xfclose (fskel);
}
static void
int c;
if (!no_lines_flag)
- fprintf (ftable, "#line %d \"%s\"\n", lineno, infile);
-
- c = getc (finput);
- while (c != EOF)
- {
- putc (c, ftable);
- c = getc (finput);
- }
-}
-
-
-static void
-free_itemsets (void)
-{
- core *cp, *cptmp;
-
- XFREE (state_table);
+ obstack_fgrow2 (&table_obstack, "#line %d %s\n",
+ lineno, quotearg_style (c_quoting_style, infile));
- for (cp = first_state; cp; cp = cptmp)
- {
- cptmp = cp->next;
- XFREE (cp);
- }
+ while ((c = getc (finput)) != EOF)
+ obstack_1grow (&table_obstack, c);
}
void
output (void)
{
- int c;
-
/* output_token_defines(ftable); / * JF put out token defines FIRST */
- if (!semantic_parser) /* JF Put out other stuff */
+
+ /* If using a simple parser the definition of YYSTYPE are put into
+ TABLE_OBSTACK. */
+ if (!semantic_parser)
{
- rewind (fattrs);
- while ((c = getc (fattrs)) != EOF)
- putc (c, ftable);
+ size_t size = obstack_object_size (&attrs_obstack);
+ obstack_grow (&table_obstack, obstack_finish (&attrs_obstack), size);
}
- reader_output_yylsp (ftable);
- if (debug_flag)
- fputs ("\
+ reader_output_yylsp (&table_obstack);
+ obstack_fgrow1 (&table_obstack, "\
#ifndef YYDEBUG\n\
-# define YYDEBUG 1\n\
+# define YYDEBUG %d\n\
#endif\n\
-\n",
- ftable);
+\n", debug_flag);
if (semantic_parser)
- fprintf (ftable, "#include \"%s\"\n", attrsfile);
-
- if (!no_parser_flag)
- fprintf (ftable, "#include <stdio.h>\n\n");
-
- /* Make "const" do nothing if not in ANSI C. */
- fputs ("\
-#ifndef __cplusplus\n\
-# ifndef __STDC__\n\
-# define const\n\
-# endif\n\
-#endif\n\
-\n",
- ftable);
+ obstack_fgrow1 (&table_obstack, "#include %s\n",
+ quotearg_style (c_quoting_style, attrsfile));
- free_itemsets ();
+ LIST_FREE (core, first_state);
output_defines ();
output_token_translations ();
/* if (semantic_parser) */
output_stos ();
output_rule_data ();
output_actions ();
+ XFREE (state_table);
+
if (!no_parser_flag)
output_parser ();
output_program ();
projects / bison.git / blobdiff