Future/bison
1
0
Fork 0
mirror of https://git.savannah.gnu.org/git/bison.git synced 2026-03-19 01:03:04 +00:00
Code Issues Packages Projects Releases Wiki Activity

* src/output.c (output_rule_data): Output the documentation of

Browse Source 
some of the tables.
(Copyright notice): Update.
Formatting changes.
This commit is contained in:
Akim Demaille
2000-03-17 10:48:28 +00:00
parent 0de741ca66
commit 9ee3c97bce
2 changed files with 61 additions and 43 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
ChangeLog
View File

@@ -1,3 +1,10 @@
2000-03-16 Akim Demaille <akim@epita.fr>
* src/output.c (output_rule_data): Output the documentation of
some of the tables.
(Copyright notice): Update.
Formatting changes.
2000-03-16 Akim Demaille <akim@epita.fr> 2000-03-16 Akim Demaille <akim@epita.fr>
* src/bison.s1 [!YYDEBUG]: Define yydebug to 0. This allows to * src/bison.s1 [!YYDEBUG]: Define yydebug to 0. This allows to

97
src/output.c
View File

@@ -1,22 +1,22 @@
/* Output the generated parsing program for bison, /* Output the generated parsing program for bison,
Copyright (C) 1984, 1986, 1989, 1992 Free Software Foundation, Inc. Copyright (C) 1984, 1986, 1989, 1992, 2000 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler. This file is part of Bison, the GNU Compiler Compiler.
Bison is free software; you can redistribute it and/or modify Bison is free software; you can redistribute it and/or modify it
it under the terms of the GNU General Public License as published by under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option) the Free Software Foundation; either version 2, or (at your option)
any later version. any later version.
Bison is distributed in the hope that it will be useful, Bison is distributed in the hope that it will be useful, but
but WITHOUT ANY WARRANTY; without even the implied warranty of WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
GNU General Public License for more details. General Public License for more details.
You should have received a copy of the GNU General Public License You should have received a copy of the GNU General Public License
along with Bison; see the file COPYING. If not, write to along with Bison; see the file COPYING. If not, write to the Free
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
Boston, MA 02111-1307, USA. */ 02111-1307, USA. */
/* functions to output parsing data to various files. Entries are: /* functions to output parsing data to various files. Entries are:
@@ -76,11 +76,11 @@ yypact[s] = index in yytable of the portion describing state s.
If the value is zero, the default action from yydefact[s] is used. If the value is zero, the default action from yydefact[s] is used.
yypgoto[i] = the index in yytable of the portion describing yypgoto[i] = the index in yytable of the portion describing
what to do after reducing a rule that derives variable i + ntokens. what to do after reducing a rule that derives variable i + ntokens.
This portion is indexed by the parser state number, s, This portion is indexed by the parser state number, s,
as of before the text for this nonterminal was read. as of before the text for this nonterminal was read.
The value from yytable is the state to go to if The value from yytable is the state to go to if
the corresponding value in yycheck is s. the corresponding value in yycheck is s.
yytable = a vector filled with portions for different uses, yytable = a vector filled with portions for different uses,
@@ -236,8 +236,8 @@ output_trailers (void)
fprintf(fguard, "\n }\n}\n"); fprintf(fguard, "\n }\n}\n");
fprintf(faction, "\n"); fprintf(faction, "\n");
if (noparserflag) if (noparserflag)
return; return;
if (semantic_parser) if (semantic_parser)
@@ -300,17 +300,17 @@ output_token_translations (void)
fprintf(ftable, fprintf(ftable,
"\n#define YYTRANSLATE(x) ((unsigned)(x) <= %d ? yytranslate[x] : %d)\n", "\n#define YYTRANSLATE(x) ((unsigned)(x) <= %d ? yytranslate[x] : %d)\n",
max_user_token_number, nsyms); max_user_token_number, nsyms);
if (ntokens < 127) /* play it very safe; check maximum element value. */ if (ntokens < 127) /* play it very safe; check maximum element value. */
fprintf(ftable, "\nstatic const char yytranslate[] = { 0"); fprintf(ftable, "\nstatic const char yytranslate[] = { 0");
else else
fprintf(ftable, "\nstatic const short yytranslate[] = { 0"); fprintf(ftable, "\nstatic const short yytranslate[] = { 0");
j = 10; j = 10;
for (i = 1; i <= max_user_token_number; i++) for (i = 1; i <= max_user_token_number; i++)
{ {
putc(',', ftable); putc(',', ftable);
if (j >= 10) if (j >= 10)
{ {
putc('\n', ftable); putc('\n', ftable);
@@ -320,16 +320,16 @@ output_token_translations (void)
{ {
j++; j++;
} }
fprintf(ftable, "%6d", token_translations[i]); fprintf(ftable, "%6d", token_translations[i]);
} }
fprintf(ftable, "\n};\n"); fprintf(ftable, "\n};\n");
} }
else else
{ {
fprintf(ftable, "\n#define YYTRANSLATE(x) (x)\n"); fprintf(ftable, "\n#define YYTRANSLATE(x) (x)\n");
} }
} }
@@ -340,7 +340,7 @@ output_gram (void)
register int j; register int j;
register short *sp; register short *sp;
/* With the ordinary parser, /* With the ordinary parser,
yyprhs and yyrhs are needed only for yydebug. */ yyprhs and yyrhs are needed only for yydebug. */
/* With the noparser option, all tables are generated */ /* With the noparser option, all tables are generated */
if (! semantic_parser && ! noparserflag) if (! semantic_parser && ! noparserflag)
@@ -434,8 +434,10 @@ output_rule_data (void)
register int i; register int i;
register int j; register int j;
fprintf(ftable, "\n#if YYDEBUG != 0\n"); fputs ("\n\
fprintf(ftable, "static const short yyrline[] = { 0"); #if YYDEBUG != 0\n\
/* YYRLINE[yyn]: source line where rule number YYN was defined. */\n\
static const short yyrline[] = { 0", ftable);
j = 10; j = 10;
for (i = 1; i <= nrules; i++) for (i = 1; i <= nrules; i++)
@@ -529,18 +531,20 @@ output_rule_data (void)
putc ('\"', ftable); putc ('\"', ftable);
j++; j++;
} }
fprintf(ftable, ", NULL\n};\n"); /* add a NULL entry to list of tokens */ /* add a NULL entry to list of tokens */
fprintf (ftable, ", NULL\n};\n");
if (! toknumflag && ! noparserflag) if (! toknumflag && ! noparserflag)
fprintf(ftable, "#endif\n\n"); fprintf (ftable, "#endif\n\n");
if (toknumflag) /* Output YYTOKNUM. */
if (toknumflag)
{ {
fprintf(ftable, "static const short yytoknum[] = { 0"); fprintf(ftable, "static const short yytoknum[] = { 0");
j = 10; j = 10;
for (i = 1; i <= ntokens; i++) { for (i = 1; i <= ntokens; i++) {
putc(',', ftable); putc(',', ftable);
if (j >= 10) if (j >= 10)
{ {
putc('\n', ftable); putc('\n', ftable);
j = 1; j = 1;
@@ -552,7 +556,10 @@ output_rule_data (void)
fprintf(ftable, "\n};\n\n"); fprintf(ftable, "\n};\n\n");
} }
fprintf(ftable, "static const short yyr1[] = { 0"); /* Output YYR1. */
fputs ("\
/* YYR1[YYN]: Symbol number of symbol that rule YYN derives. */\n\
static const short yyr1[] = { 0", ftable);
j = 10; j = 10;
for (i = 1; i <= nrules; i++) for (i = 1; i <= nrules; i++)
@@ -571,11 +578,15 @@ output_rule_data (void)
fprintf(ftable, "%6d", rlhs[i]); fprintf(ftable, "%6d", rlhs[i]);
} }
FREE(rlhs + 1); FREE(rlhs + 1);
fputs ("\n\
};\n\
\n", ftable);
fprintf(ftable, "\n};\n\nstatic const short yyr2[] = { 0"); /* Output YYR2. */
fputs ("\
/* YYR2[YYN]: Number of symbols composing right hand side of rule YYN. */\n\
static const short yyr2[] = { 0", ftable);
j = 10; j = 10;
for (i = 1; i < nrules; i++) for (i = 1; i < nrules; i++)
{ {
@@ -821,23 +832,23 @@ action_row (int state)
{ {
count = 0; count = 0;
rule = - LAruleno[i]; rule = - LAruleno[i];
for (j = 0; j < ntokens; j++) for (j = 0; j < ntokens; j++)
{ {
if (actrow[j] == rule) if (actrow[j] == rule)
count++; count++;
} }
if (count > max) if (count > max)
{ {
max = count; max = count;
default_rule = rule; default_rule = rule;
} }
} }
/* actions which match the default are replaced with zero, /* actions which match the default are replaced with zero,
which means "use the default" */ which means "use the default" */
if (max > 0) if (max > 0)
{ {
for (j = 0; j < ntokens; j++) for (j = 0; j < ntokens; j++)
@@ -845,7 +856,7 @@ action_row (int state)
if (actrow[j] == default_rule) if (actrow[j] == default_rule)
actrow[j] = 0; actrow[j] = 0;
} }
default_rule = - default_rule; default_rule = - default_rule;
} }
} }
@@ -1030,8 +1041,8 @@ save_column (int symbol, int default_state)
/* the next few functions decide how to pack /* The next few functions decide how to pack the actions and gotos
the actions and gotos information into yytable. */ information into yytable. */
void void
sort_actions (void) sort_actions (void)
@@ -1375,7 +1386,7 @@ output_parser (void)
/* See if the line starts with `#line. /* See if the line starts with `#line.
If so, set write_line to 0. */ If so, set write_line to 0. */
if (nolinesflag) if (nolinesflag)
if (c == '#') if (c == '#')
{ {
c = getc(fpars); c = getc(fpars);
if (c == 'l') if (c == 'l')