#include <stdio.h>
+#include "system.h"
extern char *calloc ();
extern char *realloc ();
block = calloc (n, 1);
if (block == NULL)
{
- fprintf (stderr, "%s: memory exhausted\n", program_name);
+ fprintf (stderr, _("%s: memory exhausted\n"), program_name);
done (1);
}
block = realloc (block, n);
if (block == NULL)
{
- fprintf (stderr, "%s: memory exhausted\n", program_name);
+ fprintf (stderr, _("%s: memory exhausted\n"), program_name);
done (1);
}
register int j;
register unsigned *rowp;
- printf("\n\n\nFIRSTS\n\n");
+ printf(_("\n\n\nFIRSTS\n\n"));
for (i = ntokens; i < nsyms; i++)
{
- printf("\n\n%s firsts\n\n", tags[i]);
+ printf(_("\n\n%s firsts\n\n"), tags[i]);
rowp = firsts + ((i - ntokens) * varsetsize);
register int j;
register unsigned *rp;
- printf("\n\n\nFDERIVES\n");
+ printf(_("\n\n\nFDERIVES\n"));
for (i = ntokens; i < nsyms; i++)
{
- printf("\n\n%s derives\n\n", tags[i]);
+ printf(_("\n\n%s derives\n\n"), tags[i]);
rp = fderives + i * rulesetsize;
for (j = 0; j <= nrules; j++)
{
if (sprec[i] < redprec)
{
- if (verboseflag) log_resolution(state, lookaheadnum, i, "reduce");
+ if (verboseflag) log_resolution(state, lookaheadnum, i, _("reduce"));
*fp2 &= ~mask; /* flush the shift for this token */
flush_shift(state, i);
}
else if (sprec[i] > redprec)
{
- if (verboseflag) log_resolution(state, lookaheadnum, i, "shift");
+ if (verboseflag) log_resolution(state, lookaheadnum, i, _("shift"));
*fp1 &= ~mask; /* flush the reduce for this token */
}
else
{
case RIGHT_ASSOC:
- if (verboseflag) log_resolution(state, lookaheadnum, i, "shift");
+ if (verboseflag) log_resolution(state, lookaheadnum, i, _("shift"));
break;
case LEFT_ASSOC:
- if (verboseflag) log_resolution(state, lookaheadnum, i, "reduce");
+ if (verboseflag) log_resolution(state, lookaheadnum, i, _("reduce"));
break;
case NON_ASSOC:
- if (verboseflag) log_resolution(state, lookaheadnum, i, "an error");
+ if (verboseflag) log_resolution(state, lookaheadnum, i, _("an error"));
break;
}
char *resolution;
{
fprintf(foutput,
- "Conflict in state %d between rule %d and token %s resolved as %s.\n",
+ _("Conflict in state %d between rule %d and token %s resolved as %s.\n"),
state, LAruleno[LAno], tags[token], resolution);
}
src_total += src_count;
rrc_total += rrc_count;
- fprintf(foutput, "State %d contains", i);
+ fprintf(foutput, _("State %d contains"), i);
if (src_count == 1)
- fprintf(foutput, " 1 shift/reduce conflict");
+ fprintf(foutput, _(" 1 shift/reduce conflict"));
else if (src_count > 1)
- fprintf(foutput, " %d shift/reduce conflicts", src_count);
+ fprintf(foutput, _(" %d shift/reduce conflicts"), src_count);
if (src_count > 0 && rrc_count > 0)
- fprintf(foutput, " and");
+ fprintf(foutput, _(" and"));
if (rrc_count == 1)
- fprintf(foutput, " 1 reduce/reduce conflict");
+ fprintf(foutput, _(" 1 reduce/reduce conflict"));
else if (rrc_count > 1)
- fprintf(foutput, " %d reduce/reduce conflicts", rrc_count);
+ fprintf(foutput, _(" %d reduce/reduce conflicts"), rrc_count);
putc('.', foutput);
putc('\n', foutput);
{
/* If invoked under the name `yacc', use the output format
specified by POSIX. */
- fprintf(stderr, "conflicts: ");
+ fprintf(stderr, _("conflicts: "));
if (src_total > 0)
- fprintf(stderr, " %d shift/reduce", src_total);
+ fprintf(stderr, _(" %d shift/reduce"), src_total);
if (src_total > 0 && rrc_total > 0)
fprintf(stderr, ",");
if (rrc_total > 0)
- fprintf(stderr, " %d reduce/reduce", rrc_total);
+ fprintf(stderr, _(" %d reduce/reduce"), rrc_total);
putc('\n', stderr);
}
else
{
- fprintf(stderr, "%s contains", infile);
+ fprintf(stderr, _("%s contains"), infile);
if (src_total == 1)
- fprintf(stderr, " 1 shift/reduce conflict");
+ fprintf(stderr, _(" 1 shift/reduce conflict"));
else if (src_total > 1)
- fprintf(stderr, " %d shift/reduce conflicts", src_total);
+ fprintf(stderr, _(" %d shift/reduce conflicts"), src_total);
if (src_total > 0 && rrc_total > 0)
- fprintf(stderr, " and");
+ fprintf(stderr, _(" and"));
if (rrc_total == 1)
- fprintf(stderr, " 1 reduce/reduce conflict");
+ fprintf(stderr, _(" 1 reduce/reduce conflict"));
else if (rrc_total > 1)
- fprintf(stderr, " %d reduce/reduce conflicts", rrc_total);
+ fprintf(stderr, _(" %d reduce/reduce conflicts"), rrc_total);
putc('.', stderr);
putc('\n', stderr);
for (i = 0; i < ntokens; i++)
{
if (mask & *fp3)
- fprintf(foutput, " %-4s\t[reduce using rule %d (%s)]\n",
+ fprintf(foutput, _(" %-4s\t[reduce using rule %d (%s)]\n"),
tags[i], default_rule, tags[rlhs[default_rule]]);
mask <<= 1;
}
}
- fprintf(foutput, " $default\treduce using rule %d (%s)\n\n",
+ fprintf(foutput, _(" $default\treduce using rule %d (%s)\n\n"),
default_rule, tags[rlhs[default_rule]]);
}
else if (n - m >= 1)
if (j != default_LA)
{
rule = LAruleno[j];
- fprintf(foutput, " %-4s\treduce using rule %d (%s)\n",
+ fprintf(foutput, _(" %-4s\treduce using rule %d (%s)\n"),
tags[i], rule, tags[rlhs[rule]]);
}
else defaulted = 1;
if (defaulted)
{
rule = LAruleno[default_LA];
- fprintf(foutput, " %-4s\treduce using rule %d (%s)\n",
+ fprintf(foutput, _(" %-4s\treduce using rule %d (%s)\n"),
tags[i], rule, tags[rlhs[rule]]);
defaulted = 0;
}
rule = LAruleno[j];
- fprintf(foutput, " %-4s\t[reduce using rule %d (%s)]\n",
+ fprintf(foutput, _(" %-4s\t[reduce using rule %d (%s)]\n"),
tags[i], rule, tags[rlhs[rule]]);
}
}
if (default_LA >= 0)
{
- fprintf(foutput, " $default\treduce using rule %d (%s)\n",
+ fprintf(foutput, _(" $default\treduce using rule %d (%s)\n"),
default_rule, tags[rlhs[default_rule]]);
}
extern char **tags;
- printf("\n\n\nDERIVES\n\n");
+ printf(_("\n\n\nDERIVES\n\n"));
for (i = ntokens; i < nsyms; i++)
{
- printf("%s derives", tags[i]);
+ printf(_("%s derives"), tags[i]);
for (sp = derives[i]; *sp > 0; sp++)
{
printf(" %d", *sp);
usage (stream)
FILE *stream;
{
- fprintf (stream, "\
+ fprintf (stream, _("\
Usage: %s [-dhklntvyV] [-b file-prefix] [-o outfile] [-p name-prefix]\n\
[--debug] [--defines] [--fixed-output-files] [--no-lines]\n\
[--verbose] [--version] [--help] [--yacc]\n\
[--no-parser] [--token-table]\n\
[--file-prefix=prefix] [--name-prefix=prefix]\n\
- [--output=outfile] grammar-file\n",
+ [--output=outfile] grammar-file\n"),
program_name);
}
if (optind == argc)
{
- fprintf(stderr, "%s: no grammar file given\n", program_name);
+ fprintf(stderr, _("%s: no grammar file given\n"), program_name);
exit(1);
}
if (optind < argc - 1)
- fprintf(stderr, "%s: extra arguments ignored after '%s'\n",
+ fprintf(stderr, _("%s: extra arguments ignored after '%s'\n"),
program_name, argv[optind]);
infile = argv[optind];
if (ISTOKEN(symbol)) break;
if (ngotos == MAXSHORT)
- toomany("gotos");
+ toomany(_("gotos"));
ngotos++;
goto_map[symbol]++;
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
-/*
+/*
lex is the entry point. It is called from reader.c.
It returns one of the token-type codes defined in lex.h.
When an identifier is seen, the code IDENTIFIER is returned
{
case '/':
c = getc(finput);
- if (c != '*' && c != '/')
+ if (c != '*' && c != '/')
{
- warn("unexpected `/' found and ignored");
+ warn(_("unexpected `/' found and ignored"));
break;
}
cplus_comment = (c == '/');
c = getc(finput);
}
else if (c == EOF)
- fatal("unterminated comment");
+ fatal(_("unterminated comment"));
else
c = getc(finput);
}
{
register int c = getc(f);
if (c == EOF)
- fatal("Unexpected end of file");
+ fatal(_("Unexpected end of file"));
return c;
}
int wasquote = 0;
c = safegetc(finput);
- if (c == '\n')
+ if (c == '\n')
{
- warn("unescaped newline in constant");
+ warn(_("unescaped newline in constant"));
ungetc(c, finput);
code = '?';
wasquote = 1;
else if (c != '\\')
{
code = c;
- if (c == term)
+ if (c == term)
wasquote = 1;
}
else
code = (code * 8) + (c - '0');
if (code >= 256 || code < 0)
{
- warni("octal value outside range 0...255: `\\%o'", code);
+ warni(_("octal value outside range 0...255: `\\%o'"), code);
code &= 0xFF;
break;
}
code *= 16, code += c - 'a' + 10;
else if (c >= 'A' && c <= 'F')
code *= 16, code += c - 'A' + 10;
- else
+ else
break;
if (code >= 256 || code<0)
{
- warni("hexadecimal value above 255: `\\x%x'", code);
+ warni(_("hexadecimal value above 255: `\\x%x'"), code);
code &= 0xFF;
break;
}
}
else
{
- warni ("unknown escape sequence: `\\' followed by `%s'",
+ warni (_("unknown escape sequence: `\\' followed by `%s'"),
printable_version(c));
code = '?';
}
c = getc(finput);
if (c != '\'')
{
- warn("use \"...\" for multi-character literal tokens");
+ warn(_("use \"...\" for multi-character literal tokens"));
dp = discard;
while (literalchar(&dp, &discode, '\'')) {}
}
while (c != '>')
{
if (c == EOF)
- fatal("unterminated type name at end of file");
- if (c == '\n')
+ fatal(_("unterminated type name at end of file"));
+ if (c == '\n')
{
- warn("unterminated type name");
+ warn(_("unterminated type name"));
ungetc(c, finput);
break;
}
}
*p = 0;
return (TYPENAME);
-
+
case '%':
return (parse_percent_token());
}
}
-/* the following table dictates the action taken for the various
+/* the following table dictates the action taken for the various
% directives. A setflag value causes the named flag to be
set. A retval action returns the code.
*/
struct percent_table_struct {
char *name;
- void *setflag;
+ void *setflag;
int retval;
} percent_table[] =
{
case '=':
return (PREC);
}
- if (!isalpha(c))
+ if (!isalpha(c))
return (ILLEGAL);
p = token_buffer;
short *r1;
#ifdef TRACE
- fprintf(stderr, "Entering set_nullable");
+ fprintf(stderr, _("Entering set_nullable"));
#endif
nullable = NEW2(nvars, char) - ntokens;
{
loc = j + from[k];
if (loc > MAXTABLE)
- fatals("maximum table size (%s) exceeded", int_to_string(MAXTABLE));
+ fatals(_("maximum table size (%s) exceeded"), int_to_string(MAXTABLE));
if (table[loc] != 0)
ok = 0;
print_token(extnum, token)
int extnum, token;
{
- fprintf(foutput, " type %d is %s\n", extnum, tags[token]);
+ fprintf(foutput, _(" type %d is %s\n"), extnum, tags[token]);
}
print_state(state)
int state;
{
- fprintf(foutput, "\n\nstate %d\n\n", state);
+ fprintf(foutput, _("\n\nstate %d\n\n"), state);
print_core(state);
print_actions(state);
}
sp++;
}
- fprintf (foutput, " (rule %d)", rule);
+ fprintf (foutput, _(" (rule %d)"), rule);
putc('\n', foutput);
}
if (!shiftp && !redp)
{
if (final_state == state)
- fprintf(foutput, " $default\taccept\n");
+ fprintf(foutput, _(" $default\taccept\n"));
else
- fprintf(foutput, " NO ACTIONS\n");
+ fprintf(foutput, _(" NO ACTIONS\n"));
return;
}
/* The following line used to be turned off. */
if (ISVAR(symbol)) break;
if (symbol==0) /* I.e. strcmp(tags[symbol],"$")==0 */
- fprintf(foutput, " $ \tgo to state %d\n", state1);
+ fprintf(foutput, _(" $ \tgo to state %d\n"), state1);
else
- fprintf(foutput, " %-4s\tshift, and go to state %d\n",
+ fprintf(foutput, _(" %-4s\tshift, and go to state %d\n"),
tags[symbol], state1);
}
{
if (! errp->errs[j]) continue;
symbol = errp->errs[j];
- fprintf(foutput, " %-4s\terror (nonassociative)\n", tags[symbol]);
+ fprintf(foutput, _(" %-4s\terror (nonassociative)\n"), tags[symbol]);
}
if (j > 0)
{
rule = redp->rules[0];
symbol = rlhs[rule];
- fprintf(foutput, " $default\treduce using rule %d (%s)\n\n",
+ fprintf(foutput, _(" $default\treduce using rule %d (%s)\n\n"),
rule, tags[symbol]);
}
else if (redp)
if (! shiftp->shifts[i]) continue;
state1 = shiftp->shifts[i];
symbol = accessing_symbol[state1];
- fprintf(foutput, " %-4s\tgo to state %d\n", tags[symbol], state1);
+ fprintf(foutput, _(" %-4s\tgo to state %d\n"), tags[symbol], state1);
}
putc('\n', foutput);
int column = 0;
/* rule # : LHS -> RHS */
- fputs("\nGrammar\n", foutput);
+ fputs(_("\nGrammar\n"), foutput);
for (i = 1; i <= nrules; i++)
/* Don't print rules disabled in reduce_grammar_tables. */
if (rlhs[i] >= 0)
{
- fprintf(foutput, "rule %-4d %s ->", i, tags[rlhs[i]]);
+ fprintf(foutput, _("rule %-4d %s ->"), i, tags[rlhs[i]]);
rule = &ritem[rrhs[i]];
if (*rule > 0)
while (*rule > 0)
fprintf(foutput, " %s", tags[*rule++]);
else
- fputs (" /* empty */", foutput);
+ fputs (_(" /* empty */"), foutput);
putc('\n', foutput);
}
/* TERMINAL (type #) : rule #s terminal is on RHS */
- fputs("\nTerminals, with rules where they appear\n\n", foutput);
+ fputs(_("\nTerminals, with rules where they appear\n\n"), foutput);
fprintf(foutput, "%s (-1)\n", tags[0]);
if (translations)
{
fprintf (foutput, "%s\n", buffer);
}
- fputs("\nNonterminals, with rules where they appear\n\n", foutput);
+ fputs(_("\nNonterminals, with rules where they appear\n\n"), foutput);
for (i = ntokens; i <= nsyms - 1; i++)
{
int left_count = 0, right_count = 0;
if (left_count > 0)
{
END_TEST (50);
- sprintf (buffer + strlen(buffer), " on left:");
+ sprintf (buffer + strlen(buffer), _(" on left:"));
for (j = 1; j <= nrules; j++)
{
if (left_count > 0)
sprintf (buffer + strlen(buffer), ",");
END_TEST (50);
- sprintf (buffer + strlen(buffer), " on right:");
+ sprintf (buffer + strlen(buffer), _(" on right:"));
for (j = 1; j <= nrules; j++)
{
for (rule = &ritem[rrhs[j]]; *rule > 0; rule++)
{
int c;
if (target == '\n')
- warn(" Skipping to next \\n");
+ warn(_(" Skipping to next \\n"));
else
- warni(" Skipping to next %c", target);
+ warni(_(" Skipping to next %c"), target);
do
c = skip_white_space();
while (c != target && c != EOF);
- if (c != EOF)
+ if (c != EOF)
ungetc(c, finput);
}
getsym("$undefined.")->class = STOKEN;
/* Read the declaration section. Copy %{ ... %} groups to ftable and fdefines file.
Also notice any %token, %left, etc. found there. */
- if (noparserflag)
+ if (noparserflag)
fprintf(ftable, "\n/* Bison-generated parse tables, made from %s\n",
infile);
else
case TOKEN:
parse_token_decl (STOKEN, SNTERM);
break;
-
+
case NTERM:
parse_token_decl (SNTERM, STOKEN);
break;
-
+
case TYPE:
parse_type_decl();
break;
-
+
case START:
parse_start_decl();
break;
-
+
case UNION:
parse_union_decl();
break;
-
+
case EXPECT:
parse_expect_decl();
break;
break;
default:
- warns("unrecognized: %s", token_buffer);
+ warns(_("unrecognized: %s"), token_buffer);
skip_to_char('%');
}
}
else if (c == EOF)
- fatal("no input grammar");
+ fatal(_("no input grammar"));
else
{
char buff[100];
- sprintf(buff, "unknown character: %s", printable_version(c));
+ sprintf(buff, _("unknown character: %s"), printable_version(c));
warn(buff);
skip_to_char('%');
}
case '%':
after_percent = -1;
break;
-
+
case '\'':
case '"':
match = c;
while (c != match)
{
if (c == EOF)
- fatal("unterminated string at end of file");
+ fatal(_("unterminated string at end of file"));
if (c == '\n')
{
- warn("unterminated string");
+ warn(_("unterminated string"));
ungetc(c, finput);
c = match;
continue;
}
putc(c, fattrs);
-
+
if (c == '\\')
{
c = getc(finput);
if (c == EOF)
- fatal("unterminated string at end of file");
+ fatal(_("unterminated string at end of file"));
putc(c, fattrs);
if (c == '\n')
lineno++;
c = getc(finput);
}
else if (c == EOF)
- fatal("unterminated comment in `%{' definition");
+ fatal(_("unterminated comment in `%{' definition"));
else
{
putc(c, fattrs);
break;
case EOF:
- fatal("unterminated `%{' definition");
+ fatal(_("unterminated `%{' definition"));
default:
putc(c, fattrs);
symbol = NULL;
}
else if (token == IDENTIFIER && *symval->tag == '\"'
- && symbol)
+ && symbol)
{
translations = 1;
symval->class = STOKEN;
symval->user_token_number = symbol->user_token_number;
symbol->user_token_number = SALIAS;
- symval->alias = symbol;
- symbol->alias = symval;
+ symval->alias = symbol;
+ symbol->alias = symval;
symbol = NULL;
nsyms--; /* symbol and symval combined are only one symbol */
symbol = symval;
if (symbol->class == what_is_not)
- warns("symbol %s redefined", symbol->tag);
+ warns(_("symbol %s redefined"), symbol->tag);
symbol->class = what_is;
if (what_is == SNTERM && oldclass != SNTERM)
symbol->value = nvars++;
if (symbol->type_name == NULL)
symbol->type_name = typename;
else if (strcmp(typename, symbol->type_name) != 0)
- warns("type redeclaration for %s", symbol->tag);
+ warns(_("type redeclaration for %s"), symbol->tag);
}
}
else if (symbol && token == NUMBER)
}
else
{
- warnss("`%s' is invalid in %s",
- token_buffer,
+ warnss(_("`%s' is invalid in %s"),
+ token_buffer,
(what_is == STOKEN) ? "%token" : "%nterm");
skip_to_char('%');
}
}
-/* parse what comes after %thong
+/* parse what comes after %thong
the full syntax is
%thong <type> token number literal
the <type> or number may be omitted. The number specifies the
The ->user_token_number of the first is SALIAS and the ->user_token_number
of the second is set to the number, if any, from the declaration.
The two symbols are linked via pointers in their ->alias fields.
-
+
during output_defines_table, the symbol is reported
thereafter, only the literal string is retained
it is the literal string that is output to yytname
/* process first token */
- if (token != IDENTIFIER)
+ if (token != IDENTIFIER)
{
- warns("unrecognized item %s, expected an identifier",
+ warns(_("unrecognized item %s, expected an identifier"),
token_buffer);
skip_to_char('%');
return;
symbol = symval;
token = lex(); /* get number or literal string */
-
+
if (token == NUMBER) {
usrtoknum = numval;
token = lex(); /* okay, did number, now get literal */
/* process literal string token */
- if (token != IDENTIFIER || *symval->tag != '\"')
+ if (token != IDENTIFIER || *symval->tag != '\"')
{
- warns("expected string constant instead of %s",
+ warns(_("expected string constant instead of %s"),
token_buffer);
skip_to_char('%');
return;
symval->type_name = typename;
symval->user_token_number = usrtoknum;
- symval->alias = symbol;
- symbol->alias = symval;
+ symval->alias = symbol;
+ symbol->alias = symval;
nsyms--; /* symbol and symval combined are only one symbol */
}
parse_start_decl ()
{
if (start_flag)
- warn("multiple %start declarations");
+ warn(_("multiple %start declarations"));
if (lex() != IDENTIFIER)
- warn("invalid %start declaration");
+ warn(_("invalid %start declaration"));
else
{
start_flag = 1;
if (lex() != TYPENAME)
{
- warn("%type declaration has no <typename>");
+ warn(_("%type declaration has no <typename>"));
skip_to_char('%');
return;
}
if (symval->type_name == NULL)
symval->type_name = name;
else if (strcmp(name, symval->type_name) != 0)
- warns("type redeclaration for %s", symval->tag);
+ warns(_("type redeclaration for %s"), symval->tag);
break;
default:
- warns("invalid %%type declaration due to item: `%s'", token_buffer);
+ warns(_("invalid %%type declaration due to item: `%s'"), token_buffer);
skip_to_char('%');
}
}
case IDENTIFIER:
if (symval->prec != 0)
- warns("redefining precedence of %s", symval->tag);
+ warns(_("redefining precedence of %s"), symval->tag);
symval->prec = lastprec;
symval->assoc = assoc;
if (symval->class == SNTERM)
- warns("symbol %s redefined", symval->tag);
+ warns(_("symbol %s redefined"), symval->tag);
symval->class = STOKEN;
if (name)
{ /* record the type, if one is specified */
if (symval->type_name == NULL)
symval->type_name = name;
else if (strcmp(name, symval->type_name) != 0)
- warns("type redeclaration for %s", symval->tag);
+ warns(_("type redeclaration for %s"), symval->tag);
}
break;
symval->user_token_number = numval;
translations = 1;
}
- else
+ else
{
- warns("invalid text (%s) - number should be after identifier",
+ warns(_("invalid text (%s) - number should be after identifier"),
token_buffer);
skip_to_char('%');
}
return;
default:
- warns("unexpected item: %s", token_buffer);
+ warns(_("unexpected item: %s"), token_buffer);
skip_to_char('%');
}
int cplus_comment;
if (typed)
- warn("multiple %union declarations");
+ warn(_("multiple %union declarations"));
typed = 1;
}
}
if (c == EOF)
- fatal("unterminated comment at end of file");
+ fatal(_("unterminated comment at end of file"));
if (!cplus_comment && c == '*')
{
case '}':
if (count == 0)
- warn ("unmatched close-brace (`}')");
+ warn (_("unmatched close-brace (`}')"));
count--;
if (count <= 0)
{
ungetc (c, finput);
if (count <= 0 || count > 10)
- warn("argument of %expect is not an integer");
+ warn(_("argument of %expect is not an integer"));
expected_conflicts = atoi (buffer);
}
int n;
symbol_list *rule;
{
- static char *msg = "invalid $ value";
+ static char *msg = N_("invalid $ value");
register int i;
register symbol_list *rp;
if (n < 0)
{
- warn(msg);
+ warn(_(msg));
return NULL;
}
rp = rp->next;
if (rp == NULL || rp->sym == NULL)
{
- warn(msg);
+ warn(_(msg));
return NULL;
}
i++;
putc(c, fguard);
if (count > 0)
count--;
- else
+ else
{
- warn("unmatched right brace (`}')");
+ warn(_("unmatched right brace (`}')"));
c = getc(finput); /* skip it */
}
break;
while (c != match)
{
if (c == EOF)
- fatal("unterminated string at end of file");
- if (c == '\n')
+ fatal(_("unterminated string at end of file"));
+ if (c == '\n')
{
- warn("unterminated string");
+ warn(_("unterminated string"));
ungetc(c, finput);
c = match; /* invent terminator */
continue;
}
putc(c, fguard);
-
+
if (c == '\\')
{
c = getc(finput);
if (c == EOF)
- fatal("unterminated string");
+ fatal(_("unterminated string"));
putc(c, fguard);
if (c == '\n')
lineno++;
c = getc(finput);
}
else if (c == EOF)
- fatal("unterminated comment");
+ fatal(_("unterminated comment"));
else
{
putc(c, fguard);
if (type_name)
fprintf(fguard, ".%s", type_name);
if(!type_name && typed)
- warns("$$ of `%s' has no declared type", rule->sym->tag);
+ warns(_("$$ of `%s' has no declared type"), rule->sym->tag);
}
else if (isdigit(c) || c == '-')
if (type_name)
fprintf(fguard, ".%s", type_name);
if(!type_name && typed)
- warnss("$%s of `%s' has no declared type", int_to_string(n), rule->sym->tag);
+ warnss(_("$%s of `%s' has no declared type"), int_to_string(n), rule->sym->tag);
continue;
}
else
- warni("$%s is invalid", printable_version(c));
+ warni(_("$%s is invalid"), printable_version(c));
break;
}
else
{
- warni("@%s is invalid", printable_version(c));
+ warni(_("@%s is invalid"), printable_version(c));
n = 1;
}
continue;
case EOF:
- fatal("unterminated %%guard clause");
+ fatal(_("unterminated %%guard clause"));
default:
putc(c, fguard);
{
if (c == '\n')
{
- warn("unterminated string");
+ warn(_("unterminated string"));
ungetc(c, finput);
c = match;
continue;
}
else if (c == EOF)
- fatal("unterminated string at end of file");
+ fatal(_("unterminated string at end of file"));
putc(c, faction);
{
c = getc(finput);
if (c == EOF)
- fatal("unterminated string");
+ fatal(_("unterminated string"));
putc(c, faction);
if (c == '\n')
lineno++;
c = getc(finput);
}
else if (c == EOF)
- fatal("unterminated comment");
+ fatal(_("unterminated comment"));
else
{
putc(c, faction);
if (!type_name) type_name = get_type_name(0, rule);
if (type_name)
fprintf(faction, ".%s", type_name);
- if(!type_name && typed)
- warns("$$ of `%s' has no declared type", rule->sym->tag);
+ if(!type_name && typed)
+ warns(_("$$ of `%s' has no declared type"), rule->sym->tag);
}
else if (isdigit(c) || c == '-')
{
fprintf(faction, "yyvsp[%d]", n - stack_offset);
if (type_name)
fprintf(faction, ".%s", type_name);
- if(!type_name && typed)
- warnss("$%s of `%s' has no declared type",
+ if(!type_name && typed)
+ warnss(_("$%s of `%s' has no declared type"),
int_to_string(n), rule->sym->tag);
continue;
}
else
- warni("$%s is invalid", printable_version(c));
+ warni(_("$%s is invalid"), printable_version(c));
break;
}
else
{
- warn("invalid @-construct");
+ warn(_("invalid @-construct"));
n = 1;
}
continue;
case EOF:
- fatal("unmatched `{'");
+ fatal(_("unmatched `{'"));
default:
putc(c, faction);
startval = lhs;
start_flag = 1;
}
-
+
t = lex();
if (t != COLON)
{
- warn("ill-formed rule: initial symbol not followed by colon");
+ warn(_("ill-formed rule: initial symbol not followed by colon"));
unlex(t);
}
}
if (nrules == 0 && t == BAR)
{
- warn("grammar starts with vertical bar");
+ warn(_("grammar starts with vertical bar"));
lhs = symval; /* BOGUS: use a random symval */
}
/* start a new rule and record its lhs. */
nvars++;
}
else if (lhs->class == STOKEN)
- warns("rule given for %s, which is a token", lhs->tag);
+ warns(_("rule given for %s, which is a token"), lhs->tag);
/* read the rhs of the rule. */
if (t == PREC)
{
- warn("two @prec's in a row");
+ warn(_("two @prec's in a row"));
t = lex();
crule->ruleprec = symval;
t = lex();
if (t == GUARD)
{
if (! semantic_parser)
- warn("%%guard present but %%semantic_parser not specified");
+ warn(_("%%guard present but %%semantic_parser not specified"));
copy_guard(crule, rulelength);
t = lex();
else if (t == LEFT_CURLY)
{
/* This case never occurs -wjh */
- if (actionflag) warn("two actions at end of one rule");
+ if (actionflag) warn(_("two actions at end of one rule"));
copy_action(crule, rulelength);
actionflag = 1;
xactions++; /* -wjh */
{
if (lhs->type_name == 0 || first_rhs->type_name == 0
|| strcmp(lhs->type_name,first_rhs->type_name))
- warnss("type clash (`%s' `%s') on default action",
+ warnss(_("type clash (`%s' `%s') on default action"),
lhs->type_name ? lhs->type_name : "",
first_rhs->type_name ? first_rhs->type_name : "");
}
/* Warn if there is no default for $$ but we need one. */
else if (!xactions && !first_rhs && lhs->type_name != 0)
- warn("empty rule for typed nonterminal, and no action");
+ warn(_("empty rule for typed nonterminal, and no action"));
if (t == SEMICOLON)
t = lex();
- }
+ }
#if 0
/* these things can appear as alternatives to rules. */
/* NO, they cannot.
else
{
- warns("invalid input: %s", token_buffer);
+ warns(_("invalid input: %s"), token_buffer);
t = lex();
}
}
/* grammar has been read. Do some checking */
if (nsyms > MAXSHORT)
- fatals("too many symbols (tokens plus nonterminals); maximum %s",
+ fatals(_("too many symbols (tokens plus nonterminals); maximum %s"),
int_to_string(MAXSHORT));
if (nrules == 0)
- fatal("no rules in the input grammar");
+ fatal(_("no rules in the input grammar"));
if (typed == 0 /* JF put out same default YYSTYPE as YACC does */
&& !value_components_used)
for (bp = firstsymbol; bp; bp = bp->next)
if (bp->class == SUNKNOWN)
{
- warns("symbol %s is used, but is not defined as a token and has no rules",
+ warns(_("symbol %s is used, but is not defined as a token and has no rules"),
bp->tag);
bp->class = SNTERM;
bp->value = nvars++;
t = lex();
- if (t != TYPENAME)
+ if (t != TYPENAME)
{
- warn("ill-formed %type declaration");
+ warn(_("ill-formed %type declaration"));
return t;
}
if (symval->type_name == NULL)
symval->type_name = name;
else if (strcmp(name, symval->type_name) != 0)
- warns("type redeclaration for %s", symval->tag);
+ warns(_("type redeclaration for %s"), symval->tag);
break;
{
/* this symbol and its alias are a single token defn.
allocate a tokno, and assign to both
- check agreement of ->prec and ->assoc fields
+ check agreement of ->prec and ->assoc fields
and make both the same
*/
if (bp->value == 0)
if (bp->prec != bp->alias->prec) {
if (bp->prec != 0 && bp->alias->prec != 0
&& bp->user_token_number == SALIAS)
- warnss("conflicting precedences for %s and %s",
+ warnss(_("conflicting precedences for %s and %s"),
bp->tag, bp->alias->tag);
if (bp->prec != 0) bp->alias->prec = bp->prec;
else bp->prec = bp->alias->prec;
if (bp->assoc != bp->alias->assoc) {
if (bp->assoc != 0 && bp->alias->assoc != 0
&& bp->user_token_number == SALIAS)
- warnss("conflicting assoc values for %s and %s",
+ warnss(_("conflicting assoc values for %s and %s"),
bp->tag, bp->alias->tag);
if (bp->assoc != 0) bp->alias->assoc = bp->assoc;
else bp->assoc = bp->alias->assoc;
the internal token number for $undefined.,
which represents all invalid inputs. */
for (i = 0; i <= max_user_token_number; i++)
- token_translations[i] = 2;
+ token_translations[i] = 2;
for (bp = firstsymbol; bp; bp = bp->next)
{
if (bp->value >= ntokens) continue; /* non-terminal */
- if (bp->user_token_number == SALIAS) continue;
+ if (bp->user_token_number == SALIAS) continue;
if (token_translations[bp->user_token_number] != 2)
- warnsss("tokens %s and %s both assigned number %s",
+ warnsss(_("tokens %s and %s both assigned number %s"),
tags[token_translations[bp->user_token_number]],
bp->tag,
int_to_string(bp->user_token_number));
output_token_defines(ftable);
if (startval->class == SUNKNOWN)
- fatals("the start symbol %s is undefined", startval->tag);
+ fatals(_("the start symbol %s is undefined"), startval->tag);
else if (startval->class == STOKEN)
- fatals("the start symbol %s is a token", startval->tag);
+ fatals(_("the start symbol %s is a token"), startval->tag);
start_symbol = startval->value;
#endif
}
}
-
-/* For named tokens, but not literal ones, define the name.
- The value is the user token number.
+
+/* For named tokens, but not literal ones, define the name.
+ The value is the user token number.
*/
void
output_token_defines(file)
if (bp->user_token_number == SALIAS) continue;
if ('\'' == *symbol) continue; /* skip literal character */
if (bp == errtoken) continue; /* skip error token */
- if ('\"' == *symbol)
+ if ('\"' == *symbol)
{
/* use literal string only if given a symbol with an alias */
if (bp->alias)
if (c != '\0') continue;
fprintf(file, "#define\t%s\t%d\n", symbol,
- ((translations && ! rawtoknumflag)
- ? bp->user_token_number
+ ((translations && ! rawtoknumflag)
+ ? bp->user_token_number
: bp->value));
if (semantic_parser)
fprintf(file, "#define\tT%s\t%d\n", symbol, bp->value);
print_notices();
if (!BITISSET(N, start_symbol - ntokens))
- fatals("Start symbol %s does not derive any sentence",
+ fatals(_("Start symbol %s does not derive any sentence"),
tags[start_symbol]);
reduce_grammar_tables();
/**/ statisticsflag = FALSE; /* someday getopts should handle this */
if (statisticsflag == TRUE)
fprintf(stderr,
- "reduced %s defines %d terminal%s, %d nonterminal%s\
-, and %d production%s.\n", infile,
+ _("reduced %s defines %d terminal%s, %d nonterminal%s\
+, and %d production%s.\n"), infile,
ntokens, (ntokens == 1 ? "" : "s"),
nvars, (nvars == 1 ? "" : "s"),
nrules, (nrules == 1 ? "" : "s"));
* process takes only 2 seconds on my 8Mhz AT.
*/
-static bool
+static bool
useful_production (i, N)
int i;
BSet N;
/* Remember that rules are 1-origin, symbols are 0-origin. */
-static void
+static void
useless_nonterminals ()
{
BSet Np, Ns;
* set being computed remains unchanged. Any nonterminals not in the
* set at that point are useless in that they will never be used in
* deriving a sentence of the language.
- *
+ *
* This iteration doesn't use any special traversal over the
* productions. A set is kept of all productions for which all the
* nonterminals in the RHS are in useful. Only productions not in
N = Np;
}
\f
-static void
+static void
inaccessable_symbols ()
{
BSet Vp, Vs, Pp;
* reachable symbols, add the production to the set of reachable
* productions, and add all of the nonterminals in the RHS of the
* production to the set of reachable symbols.
- *
+ *
* Consider only the (partially) reduced grammar which has only
* nonterminals in N and productions in P.
- *
+ *
* The result is the set P of productions in the reduced grammar, and
* the set V of symbols in the reduced grammar.
- *
+ *
* Although this algorithm also computes the set of terminals which are
* reachable, no terminal will be deleted from the grammar. Some
* terminals might not be in the grammar but might be generated by
Vp[i] = V[i];
for (i = 1; i <= nrules; i++)
{
- if (!BITISSET(Pp, i) && BITISSET(P, i) &&
+ if (!BITISSET(Pp, i) && BITISSET(P, i) &&
BITISSET(V, rlhs[i]))
{
for (r = &ritem[rrhs[i]]; *r >= 0; r++)
SETBIT(V1, rprecsym[i]);
}
\f
-static void
+static void
reduce_grammar_tables ()
{
/* This is turned off because we would need to change the numbers
}
}
\f
-static void
+static void
print_results ()
{
int i;
if (nuseless_nonterminals > 0)
{
- fprintf(foutput, "Useless nonterminals:\n\n");
+ fprintf(foutput, _("Useless nonterminals:\n\n"));
for (i = ntokens; i < nsyms; i++)
if (!BITISSET(V, i))
fprintf(foutput, " %s\n", tags[i]);
{
if (!b)
{
- fprintf(foutput, "\n\nTerminals which are not used:\n\n");
+ fprintf(foutput, _("\n\nTerminals which are not used:\n\n"));
b = TRUE;
}
fprintf(foutput, " %s\n", tags[i]);
if (nuseless_productions > 0)
{
- fprintf(foutput, "\n\nUseless rules:\n\n");
+ fprintf(foutput, _("\n\nUseless rules:\n\n"));
for (i = 1; i <= nrules; i++)
{
if (!BITISSET(P, i))
fprintf(foutput, "\n\n");
}
\f
-void
+void
dump_grammar ()
{
int i;
fprintf(foutput,
"ntokens = %d, nvars = %d, nsyms = %d, nrules = %d, nitems = %d\n\n",
ntokens, nvars, nsyms, nrules, nitems);
- fprintf(foutput, "Variables\n---------\n\n");
- fprintf(foutput, "Value Sprec Sassoc Tag\n");
+ fprintf(foutput, _("Variables\n---------\n\n"));
+ fprintf(foutput, _("Value Sprec Sassoc Tag\n"));
for (i = ntokens; i < nsyms; i++)
fprintf(foutput, "%5d %5d %5d %s\n",
i, sprec[i], sassoc[i], tags[i]);
fprintf(foutput, "\n\n");
- fprintf(foutput, "Rules\n-----\n\n");
+ fprintf(foutput, _("Rules\n-----\n\n"));
for (i = 1; i <= nrules; i++)
{
- fprintf(foutput, "%-5d(%5d%5d)%5d : (@%-5d)",
+ fprintf(foutput, "%-5d(%5d%5d)%5d : (@%-5d)",
i, rprec[i], rassoc[i], rlhs[i], rrhs[i]);
for (r = &ritem[rrhs[i]]; *r > 0; r++)
fprintf(foutput, "%5d", *r);
fprintf(foutput, " [%d]\n", -(*r));
}
fprintf(foutput, "\n\n");
- fprintf(foutput, "Rules interpreted\n-----------------\n\n");
+ fprintf(foutput, _("Rules interpreted\n-----------------\n\n"));
for (i = 1; i <= nrules; i++)
{
fprintf(foutput, "%-5d %s :", i, tags[rlhs[i]]);
}
-static void
+static void
print_notices ()
{
extern int fixed_outfiles;
if (fixed_outfiles && nuseless_productions)
- fprintf(stderr, "%d rules never reduced\n", nuseless_productions);
+ fprintf(stderr, _("%d rules never reduced\n"), nuseless_productions);
- fprintf(stderr, "%s contains ", infile);
+ fprintf(stderr, _("%s contains "), infile);
if (nuseless_nonterminals > 0)
{
- fprintf(stderr, "%d useless nonterminal%s",
+ fprintf(stderr, _("%d useless nonterminal%s"),
nuseless_nonterminals,
(nuseless_nonterminals == 1 ? "" : "s"));
}
if (nuseless_nonterminals > 0 && nuseless_productions > 0)
- fprintf(stderr, " and ");
+ fprintf(stderr, _(" and "));
if (nuseless_productions > 0)
{
- fprintf(stderr, "%d useless rule%s",
+ fprintf(stderr, _("%d useless rule%s"),
nuseless_productions,
(nuseless_productions == 1 ? "" : "s"));
}
projects / bison.git / commitdiff
