Compare commits

..
65 Commits
Author SHA1 Message Date
Akim Demaille cf2e198269 Version 1.30e. 2001-11-26 16:47:53 +00:00
Akim Demaille af4483a0ab Typo. 2001-11-26 15:25:10 +00:00
Akim Demaille 674fd9acbc * src/reader.c (readgram): Make sure rules for mid-rule actions
have a lineno equal to that of their host rule.
Reported by Hans Aberg.
* tests/regression.at (Rule Line Numbers): New.
2001-11-26 15:24:06 +00:00
Akim Demaille 6fedd4d1d6 * src/LR0.c (allocate_itemsets): kernel_size contains ints, not
size_ts.
Reported by Hans Aberg.
2001-11-26 13:01:10 +00:00
Akim Demaille abe1baa044 * src/complain.c, src/complain.h (error): Remove, provided by
lib/error.[ch].
2001-11-26 11:26:35 +00:00
Akim Demaille 33285af04d * src/reader.c (read_declarations): Don't abort on tok_illegal,
issue an error message.
* tests/regression.at (Invalid %directive): New.
Reported by Hans Aberg.
2001-11-26 09:49:58 +00:00
Akim Demaille cd7f95831e * configure.in: Invoke AC_FUNC_OBSTACK and AC_FUNC_ERROR_AT_LINE.
* lib/Makefile.am (libbison_a_SOURCES): Adjust.
2001-11-26 09:19:56 +00:00
Akim Demaille 1b9a8440cd * src/conflicts.c (conflicts_print): Don't complain at all when
there are no reduce/reduce conflicts, and as many shift/reduce
conflicts as expected.
* tests/regression.at (%expect right): Adjust.
2001-11-26 09:18:40 +00:00
Marc Autret aead559e00 * doc/bison.texinfo (Mystery Conflicts): Hint '-v' use.
From Golubev I. N.
2001-11-25 12:57:33 +00:00
Akim Demaille 92b69b7f09 * lib/alloca.c: Update, from fileutils. 2001-11-23 14:55:36 +00:00
Akim Demaille 6e303f08d6 * lib/Makefile.am (libbison_a_LIBADD): Add @ALLOCA@. 2001-11-23 14:18:36 +00:00
Akim Demaille 3dfc01e247 Regen. 2001-11-23 14:17:53 +00:00
Akim Demaille 1503820f54 1.30e. 2001-11-23 14:15:42 +00:00
Akim Demaille bc9bb28004 Update. 2001-11-23 14:15:08 +00:00
Akim Demaille 16c4a35041 * src/system.h: Include alloca.h.
* src/main.c (main) [C_ALLOCA]: Call alloca (0).
2001-11-23 14:13:19 +00:00
Akim Demaille f0451dba71 * src/print_graph.c (print_actions): Remove `rule', unused.
* src/LR0.c (kernel_size): Contain `int' instead of `size_t' to
pacify GCC's signed < unsigned warnings.
* src/closure.c (itemsetsize): Likewise.
* src/reader.c (symbol_list_new): Static.
2001-11-23 14:04:08 +00:00
Akim Demaille a9f37dee0c Attaching lineno to buckets is stupid, since only one copy of each
symbol is kept, only the line of the first occurrence is kept too.
* src/symtab.h, src/symtab.c (bucket): Remove the line member.
* src/reader.c (rline_allocated): Remove, unused.
(symbol_list): Have a `line' member.
(symbol_list_new): New.
(readgram): Use it.
* src/print.c (print_grammar): Output the rule line numbers.
* tests/regression.at (Solved SR Conflicts)
(Unresolved SR Conflicts): Adjust.
Reported by Hans Aberg.
2001-11-23 14:03:43 +00:00
Akim Demaille 4b0979fcf3 Englishoes reported by Jim. 2001-11-21 11:45:51 +00:00
Akim Demaille cc35239e1b Remove all po/ generated files from repository. 2001-11-20 13:30:31 +00:00
Akim Demaille 2e2cbb3fad Remove doc/ generated files from the repository. 2001-11-20 13:29:40 +00:00
Akim Demaille adb4edee47 Version 1.30d. 2001-11-20 13:26:58 +00:00
Akim Demaille 65490badba . 2001-11-20 13:21:23 +00:00
Akim Demaille 8b044b8540 Adjust. 2001-11-20 13:14:13 +00:00
Akim Demaille 0704bc9b8e * po/sv.po: New.
* configure.in (ALL_LINGUAS): Adjust.
* po/POTFILE.in: Remove `nullable.c' and `derives.c' which no
longer contains strings to translate.
2001-11-20 13:10:12 +00:00
Akim Demaille 2b7c2ef124 * src/conflicts.c (conflicts_print): Add a missing n. 2001-11-19 11:07:50 +00:00
Akim Demaille 48e38d301e Formatting changes. 2001-11-19 10:28:25 +00:00
Akim Demaille 560757768c * src/nullable.c (nullable_print): New.
(set_nullable): Call it when tracing.
Better locality of variables.
2001-11-19 09:27:37 +00:00
Akim Demaille 238b8134ec * src/print.c (print_actions): Better locality of variables. 2001-11-19 09:27:24 +00:00
Akim Demaille 483642486d * src/derives.c (print_derives): Fix and enrich.
* src/closure.c (print_fderives): Likewise.
2001-11-19 09:27:11 +00:00
Akim Demaille 146ad4c8d0 * src/closure.c (itemsetend): Remove, replaced with...
(itemsetsize): new.
2001-11-19 09:26:57 +00:00
Akim Demaille f2a4c94506 * src/LR0.c (kernel_end): Remove, replaced with...
(kernel_size): new.
2001-11-19 09:26:43 +00:00
Akim Demaille 65fae038b9 * src/conflicts.c (set_conflicts): Use arrays instead of pointers
to clarify.
2001-11-19 09:26:30 +00:00
Akim Demaille e1cb5fb523 * src/closure.c (closure): Use arrays instead of pointers to clarify. 2001-11-19 09:26:17 +00:00
Akim Demaille 64fabbb49f * src/closure.c, src/derives.c, src/nullable.c: Adjust various
trace messages.
* src/LR0.c: Likewise.
(allocate_itemsets): Use arrays instead of pointers to clarify.
2001-11-19 09:25:36 +00:00
Akim Demaille 3b2925a060 * src/getargs.c (statistics_flag): Replace with...
(trace_flag): New.
(longopts): Accept --trace instead of --statistics.
* src/getargs.h: Adjust.
* src/LR0.c, src/closure.c, src/derives.c, src/nullable.c,
* src/reduce.c: Use trace_flags instead of the CPP conditional TRACE.
2001-11-19 09:21:26 +00:00
Akim Demaille 83bcf86639 * src/LR0.c (new_itemsets, get_state): Use more arrays and less
pointers to clarify the code.
(save_reductions, save_shifts): Factor common parts of alternatives.
2001-11-19 09:17:53 +00:00
Akim Demaille 8639df64a6 * src/LR0.c (new_state, get_state): Complete TRACE code.
* src/closure.c: Include `reader.h' to get `tags', needed by the
trace code.
Rename the conditional DEBUG as TRACE.
Output consistently TRACEs to stderr, not stdout.
* src/derives.c: Likewise.
* src/reduce.c: (inaccessable_symbols): Using if is better style
than goto.
Use `#if TRACE' instead of `#if 0' for tracing code.
2001-11-19 09:16:24 +00:00
Akim Demaille 377bd7c9a2 * src/system.h (LIST_FREE, shortcpy): New.
* src/LR0.c: Use them.
* src/output.c (free_itemsets, free_reductions, free_shifts):
Remove, replaced by LIST_FREE.
2001-11-19 09:14:54 +00:00
Akim Demaille b4a7a230f1 * src/state.h (CORE_ALLOC, SHIFTS_ALLOC, ERRS_ALLOC)
(REDUCTIONS_ALLOC):  New.
* src/LR0.c, src/conflicts.c: Use them to de-obfuscate memory
allocation.
2001-11-19 09:14:26 +00:00
Akim Demaille c1586e58fe * src/LR0.c (new_state): Complete trace code.
* src/nullable.c (set_nullable): Don't translate traces.
2001-11-19 09:14:07 +00:00
Akim Demaille 50766eee39 * src/print_graph.c (print_core): Better locality of variables.
* src/print.c (print_core): Likewise.
2001-11-19 09:13:53 +00:00
Akim Demaille dc3b81cd67 * src/vcg.c: You do the output, so you are responsible of the
handling of VCG syntax, in particular: use quotearg.
* src/print_graph.c: Don't.
(print_actions): Don't output the actions as part of the nodes,
since that's the job of the edges.
(print_state): Don't output by hand: fill the node description,
and ask for its output.
2001-11-19 09:13:40 +00:00
Akim Demaille c555896775 * src/bison.simple (yyparse): When reporting verbosely an error,
no longer issue additional quotes around token names.
* tests/calc.at: Adjust.
2001-11-19 09:13:26 +00:00
Akim Demaille 35f61cb998 * src/symtab.h, src/symtab.c: line' is a new member of bucket'.
* src/reader.c (record_rule_lines, rline, rline_allocated): Remove.
* src/output.c: Adjust.
2001-11-19 09:13:12 +00:00
Akim Demaille 9291f914de * src/gram.h (rprec, rprecsym, rassoc): Remove, now part of...
(rule_t): this.
* src/conflicts.c, src/reader.c, src/reduce.c: Adjust.
2001-11-19 09:12:49 +00:00
Akim Demaille ff1581dddb * src/gram.h (rule_t): New.
(rule_table): New.
(rrhs, rlhs): Remove, part of state_t.
* src/print_graph.c, src/closure.c, src/conflicts.c, src/derives.c,
* src/lalr.c, src/nullable.c, src/output.c, src/print.c,
* src/reader.c, src/reduce.c: Adjust.
2001-11-19 09:12:25 +00:00
Akim Demaille 4b9170b2c0 * src/reader.c (symbols_output): New, extracted from...
(packsymbols): Here.
(reader): Call it.
2001-11-19 09:12:02 +00:00
Akim Demaille 523a9eafdc * src/lalr.c (set_maxrhs, maxrhs): Remove, replaced with...
(maxrhs): this new function.
2001-11-19 09:11:47 +00:00
Akim Demaille bcdf932ed9 * src/lalr.c (F): New macro to access to the variable F.
Adjust.
2001-11-19 09:11:34 +00:00
Akim Demaille e2aabb3dc6 * src/lalr.h (LA): New macro to access to the variable LA.
* src/output.c, src/lalr.c, src/print_graph.c, src/conflicts.c:
* src/lalr.c: Adjust.
2001-11-19 09:11:21 +00:00
Akim Demaille e8ebe4b0c7 * src/lalr.c (initialize_LA): Only initialize LA. Let...
(set_state_table): handle the `lookaheads' members.
2001-11-19 09:11:03 +00:00
Akim Demaille 9043475828 * src/lalr.h (lookaheads): Removed array, which contents is now
member of...
(state_t): this structure.
* src/output.c, src/lalr.c, src/print_graph.c, src/conflicts.c:
Adjust.
2001-11-19 09:10:47 +00:00
Akim Demaille d80a86e0b5 * src/lalr.h (consistent): Removed array, which contents is now
member of...
(state_t): this structure.
* src/output.c, src/lalr.c, src/print_graph.c, src/conflicts.c:
Adjust.
2001-11-19 09:10:30 +00:00
Akim Demaille cfc3acf242 * src/lalr.h (reduction_table, shift_table): Removed arrays, which
contents is now members of...
(state_t): this structure.
* src/output.c, src/lalr.c, src/print_graph.c, src/conflicts.c:
Adjust.
2001-11-19 09:10:12 +00:00
Akim Demaille 93337ac41c * src/lalr.h (state_t): New.
(state_table): Be a state_t * instead of a core **.
(accessing_symbol): Remove, part of state_t.
* src/lalr.c: Adjust.
(set_accessing_symbol): Merge into...
(set_state_table): this.
* src/print_graph.c, src/conflicts.c: Adjust.
2001-11-19 09:08:44 +00:00
Akim Demaille 0d7803637b Bump to 1.30d. 2001-11-14 17:52:37 +00:00
Akim Demaille a62c863ec3 . 2001-11-14 15:35:09 +00:00
Akim Demaille 1e883de90c Version 1.30c. 2001-11-14 15:25:51 +00:00
Akim Demaille efcff8cd5c * tests/calc.at, tests/output.at, tests/regression.at,
* tests/testsuite.at, tests/torture.at: Rely on Autotest 2.52g:
now the tests are run in private dirs, therefore AC_CLEANUP and
family can be simplified to 0-ary.
* tests/atlocal.in: Now that we run `elsewhere' than in tests/,
use abs. path to find config.h.
2001-11-14 15:16:40 +00:00
Akim Demaille 3e85a00236 * src/bison.simple (yyparse): Let yyls1, yyss1 and yyvs1 be
defined only if yyoverflow is defined, to avoid `warning: unused
variable `yyvs1''.
Reported by The Test Suite.
2001-11-14 14:57:06 +00:00
Akim Demaille f85c981ac1 * src/print.c: Include reduce.h.
Reported by Hans Aberg.
2001-11-14 14:43:29 +00:00
Akim Demaille 5cb10dae3c * src/lex.c, src/lex.h (token_buffer, unlexed_token_buffer):
Revert a previous patch:  these are really const.
* src/conflicts.c (conflict_report): Additional useless pair of
braces to pacify GCC's warnings for `if () if () {} else {}'.
* src/lex.c (parse_percent_token): Replace equal_offset with
arg_offset.
arg is const.
Be sure to strdup `arg' when used, since there is no reason for
token_buffer not to change.
2001-11-14 14:42:14 +00:00
Akim Demaille 26e1ca45ba * src/system.h (EXIT_SUCCESS, EXIT_FAILURE): Ensure a proper
definition.
* src/main.c (main): Use them.
Suggested by Hans Aberg.
2001-11-14 14:14:48 +00:00
Akim Demaille 8888e43b2c Bump to 1.30c. 2001-11-12 10:31:00 +00:00
Akim Demaille d9ca2df2aa . 2001-11-12 10:21:45 +00:00
75 changed files with 3720 additions and 9106 deletions
+339 -1
View File
@@ -1,3 +1,341 @@
2001-11-26 Akim Demaille <[email protected]>
Version 1.30e.
2001-11-26 Akim Demaille <[email protected]>
* src/reader.c (readgram): Make sure rules for mid-rule actions
have a lineno equal to that of their host rule.
Reported by Hans Aberg.
* tests/regression.at (Rule Line Numbers): New.
2001-11-26 Akim Demaille <[email protected]>
* src/LR0.c (allocate_itemsets): kernel_size contains ints, not
size_ts.
Reported by Hans Aberg.
2001-11-26 Akim Demaille <[email protected]>
* src/complain.c, src/complain.h (error): Remove, provided by
lib/error.[ch].
2001-11-26 Akim Demaille <[email protected]>
* src/reader.c (read_declarations): Don't abort on tok_illegal,
issue an error message.
* tests/regression.at (Invalid %directive): New.
Reported by Hans Aberg.
2001-11-26 Akim Demaille <[email protected]>
* configure.in: Invoke AC_FUNC_OBSTACK and AC_FUNC_ERROR_AT_LINE.
* lib/Makefile.am (libbison_a_SOURCES): Adjust.
2001-11-26 Akim Demaille <[email protected]>
* src/conflicts.c (conflicts_print): Don't complain at all when
there are no reduce/reduce conflicts, and as many shift/reduce
conflicts as expected.
* tests/regression.at (%expect right): Adjust.
2001-11-25 Marc Autret <[email protected]>
* doc/bison.texinfo (Mystery Conflicts): Hint '-v' use.
From Golubev I. N.
2001-11-23 Akim Demaille <[email protected]>
* lib/alloca.c: Update, from fileutils.
2001-11-23 Akim Demaille <[email protected]>
* lib/Makefile.am (libbison_a_LIBADD): Add @ALLOCA@.
2001-11-23 Akim Demaille <[email protected]>
* src/system.h: Include alloca.h.
* src/main.c (main) [C_ALLOCA]: Call alloca (0).
2001-11-23 Akim Demaille <[email protected]>
* src/print_graph.c (print_actions): Remove `rule', unused.
* src/LR0.c (kernel_size): Contain `int' instead of `size_t' to
pacify GCC's signed < unsigned warnings.
* src/closure.c (itemsetsize): Likewise.
* src/reader.c (symbol_list_new): Static.
2001-11-23 Akim Demaille <[email protected]>
Attaching lineno to buckets is stupid, since only one copy of each
symbol is kept, only the line of the first occurrence is kept too.
* src/symtab.h, src/symtab.c (bucket): Remove the line member.
* src/reader.c (rline_allocated): Remove, unused.
(symbol_list): Have a `line' member.
(symbol_list_new): New.
(readgram): Use it.
* src/print.c (print_grammar): Output the rule line numbers.
* tests/regression.at (Solved SR Conflicts)
(Unresolved SR Conflicts): Adjust.
Reported by Hans Aberg.
2001-11-20 Akim Demaille <[email protected]>
Version 1.30d.
2001-11-20 Akim Demaille <[email protected]>
* po/sv.po: New.
* configure.in (ALL_LINGUAS): Adjust.
* po/POTFILE.in: Remove `nullable.c' and `derives.c' which no
longer contains strings to translate.
2001-11-19 Akim Demaille <[email protected]>
* src/conflicts.c (conflicts_print): Add a missing \n.
2001-11-19 Akim Demaille <[email protected]>
* src/nullable.c (nullable_print): New.
(set_nullable): Call it when tracing.
Better locality of variables.
2001-11-19 Akim Demaille <[email protected]>
* src/print.c (print_actions): Better locality of variables.
2001-11-19 Akim Demaille <[email protected]>
* src/derives.c (print_derives): Fix and enrich.
* src/closure.c (print_fderives): Likewise.
2001-11-19 Akim Demaille <[email protected]>
* src/closure.c (itemsetend): Remove, replaced with...
(itemsetsize): new.
2001-11-19 Akim Demaille <[email protected]>
* src/LR0.c (kernel_end): Remove, replaced with...
(kernel_size): new.
2001-11-19 Akim Demaille <[email protected]>
* src/conflicts.c (set_conflicts): Use arrays instead of pointers
to clarify.
2001-11-19 Akim Demaille <[email protected]>
* src/closure.c (closure): Use arrays instead of pointers to clarify.
2001-11-19 Akim Demaille <[email protected]>
* src/closure.c, src/derives.c, src/nullable.c: Adjust various
trace messages.
* src/LR0.c: Likewise.
(allocate_itemsets): Use arrays instead of pointers to clarify.
2001-11-19 Akim Demaille <[email protected]>
* src/getargs.c (statistics_flag): Replace with...
(trace_flag): New.
(longopts): Accept --trace instead of --statistics.
* src/getargs.h: Adjust.
* src/LR0.c, src/closure.c, src/derives.c, src/nullable.c,
* src/reduce.c: Use trace_flags instead of the CPP conditional TRACE.
2001-11-19 Akim Demaille <[email protected]>
* src/LR0.c (new_itemsets, get_state): Use more arrays and fewer
pointers to clarify the code.
(save_reductions, save_shifts): Factor common parts of alternatives.
2001-11-19 Akim Demaille <[email protected]>
* src/LR0.c (new_state, get_state): Complete TRACE code.
* src/closure.c: Include `reader.h' to get `tags', needed by the
trace code.
Rename the conditional DEBUG as TRACE.
Output consistently TRACEs to stderr, not stdout.
* src/derives.c: Likewise.
* src/reduce.c: (inaccessable_symbols): Using if is better style
than goto.
Use `#if TRACE' instead of `#if 0' for tracing code.
2001-11-19 Akim Demaille <[email protected]>
* src/system.h (LIST_FREE, shortcpy): New.
* src/LR0.c: Use them.
* src/output.c (free_itemsets, free_reductions, free_shifts):
Remove, replaced by LIST_FREE.
2001-11-19 Akim Demaille <[email protected]>
* src/state.h (CORE_ALLOC, SHIFTS_ALLOC, ERRS_ALLOC)
(REDUCTIONS_ALLOC): New.
* src/LR0.c, src/conflicts.c: Use them to de-obfuscate memory
allocation.
2001-11-19 Akim Demaille <[email protected]>
* src/LR0.c (new_state): Complete trace code.
* src/nullable.c (set_nullable): Don't translate traces.
2001-11-19 Akim Demaille <[email protected]>
* src/print_graph.c (print_core): Better locality of variables.
* src/print.c (print_core): Likewise.
2001-11-19 Akim Demaille <[email protected]>
* src/vcg.c: You do the output, so you are responsible of the
handling of VCG syntax, in particular: use quotearg.
* src/print_graph.c: Don't.
(print_actions): Don't output the actions as part of the nodes,
since that's the job of the edges.
(print_state): Don't output by hand: fill the node description,
and ask for its output.
2001-11-19 Akim Demaille <[email protected]>
* src/bison.simple (yyparse): When verbosely reporting an error,
no longer put additional quotes around token names.
* tests/calc.at: Adjust.
2001-11-19 Akim Demaille <[email protected]>
* src/symtab.h, src/symtab.c: `line' is a new member of `bucket'.
* src/reader.c (record_rule_lines, rline, rline_allocated): Remove.
* src/output.c: Adjust.
2001-11-19 Akim Demaille <[email protected]>
* src/gram.h (rprec, rprecsym, rassoc): Remove, now part of...
(rule_t): this.
* src/conflicts.c, src/reader.c, src/reduce.c: Adjust.
2001-11-19 Akim Demaille <[email protected]>
* src/gram.h (rule_t): New.
(rule_table): New.
(rrhs, rlhs): Remove, part of state_t.
* src/print_graph.c, src/closure.c, src/conflicts.c, src/derives.c,
* src/lalr.c, src/nullable.c, src/output.c, src/print.c,
* src/reader.c, src/reduce.c: Adjust.
2001-11-19 Akim Demaille <[email protected]>
* src/reader.c (symbols_output): New, extracted from...
(packsymbols): Here.
(reader): Call it.
2001-11-19 Akim Demaille <[email protected]>
* src/lalr.c (set_maxrhs, maxrhs): Remove, replaced with...
(maxrhs): this new function.
2001-11-19 Akim Demaille <[email protected]>
* src/lalr.c (F): New macro to access the variable F.
Adjust.
2001-11-19 Akim Demaille <[email protected]>
* src/lalr.h (LA): New macro to access the variable LA.
* src/output.c, src/lalr.c, src/print_graph.c, src/conflicts.c:
* src/lalr.c: Adjust.
2001-11-19 Akim Demaille <[email protected]>
* src/lalr.c (initialize_LA): Only initialize LA. Let...
(set_state_table): handle the `lookaheads' members.
2001-11-19 Akim Demaille <[email protected]>
* src/lalr.h (lookaheads): Removed array, whose contents is now
a member of...
(state_t): this structure.
* src/output.c, src/lalr.c, src/print_graph.c, src/conflicts.c:
Adjust.
2001-11-19 Akim Demaille <[email protected]>
* src/lalr.h (consistent): Removed array, whose contents is now
a member of...
(state_t): this structure.
* src/output.c, src/lalr.c, src/print_graph.c, src/conflicts.c:
Adjust.
2001-11-19 Akim Demaille <[email protected]>
* src/lalr.h (reduction_table, shift_table): Removed arrays, whose
contents are now members of...
(state_t): this structure.
* src/output.c, src/lalr.c, src/print_graph.c, src/conflicts.c:
Adjust.
2001-11-19 Akim Demaille <[email protected]>
* src/lalr.h (state_t): New.
(state_table): Be a state_t * instead of a core **.
(accessing_symbol): Remove, part of state_t.
* src/lalr.c: Adjust.
(set_accessing_symbol): Merge into...
(set_state_table): this.
* src/print_graph.c, src/conflicts.c: Adjust.
2001-11-14 Akim Demaille <[email protected]>
Version 1.30c.
2001-11-14 Akim Demaille <[email protected]>
* tests/calc.at, tests/output.at, tests/regression.at,
* tests/testsuite.at, tests/torture.at: Rely on Autotest 2.52g:
now the tests are run in private dirs, therefore AC_CLEANUP and
family can be simplified to 0-ary.
* tests/atlocal.in: Now that we run `elsewhere' than in tests/,
use abs. path to find config.h.
2001-11-14 Akim Demaille <[email protected]>
* tests/calc.at (AT_CHECK_CALC): Don't try to check the compiler's
stderr, there can be way too much random noise.
Instead pass -Werror to GCC and rely on the exit status.
Reported by Wolfram Wagner.
2001-11-14 Akim Demaille <[email protected]>
* src/bison.simple (yyparse): Let yyls1, yyss1 and yyvs1 be
defined only if yyoverflow is defined, to avoid `warning: unused
variable `yyvs1''.
Reported by The Test Suite.
2001-11-14 Akim Demaille <[email protected]>
* src/print.c: Include reduce.h.
Reported by Hans Aberg.
2001-11-14 Akim Demaille <[email protected]>
* src/lex.c, src/lex.h (token_buffer, unlexed_token_buffer):
Revert a previous patch: these are really const.
* src/conflicts.c (conflict_report): Additional useless pair of
braces to pacify GCC's warnings for `if () if () {} else {}'.
* src/lex.c (parse_percent_token): Replace equal_offset with
arg_offset.
arg is const.
Be sure to strdup `arg' when used, since there is no reason for
token_buffer not to change.
2001-11-14 Akim Demaille <[email protected]>
* src/system.h (EXIT_SUCCESS, EXIT_FAILURE): Ensure a proper
definition.
* src/main.c (main): Use them.
Suggested by Hans Aberg.
2001-11-12 Akim Demaille <[email protected]>
Version 1.30b.
@@ -82,7 +420,7 @@
* src/bison.simple (YYSTACK_REALLOC): New.
(yyparse) [!yyoverflow]: Use it and free the old stack.
Reported by FIXME: Who.
Reported by Per Allansson.
2001-11-05 Akim Demaille <[email protected]>
+31
View File
@@ -1,6 +1,37 @@
Bison News
----------
Changes in version 1.30e:
* Error messages
Some calls to strerror resulted in scrambled or missing error messages.
* %expect
When the number of shift/reduce conflicts is correct, don't issue
any warning.
* The verbose report includes the rule line numbers.
* Rule line numbers are fixed in traces.
Changes in version 1.30d:
* Swedish translation
* Parse errors
Verbose parse error messages from the parsers are better looking.
Before: parse error: unexpected `'/'', expecting `"number"' or `'-'' or `'(''
Now: parse error: unexpected '/', expecting "number" or '-' or '('
* Fixed VCG output
Was broken when strings aliases for symbols were used.
Changes in version 1.30c:
* Fixed a few warnings.
* Some portability issues.
Changes in version 1.30b:
* Fixed parser memory leaks.
+2
View File
@@ -9,6 +9,7 @@ Daniel Hagerty [email protected]
David J. MacKenzie [email protected]
Dick Streefland [email protected]
Fabrice Bauzac [email protected]
Golubev I. N [email protected]
Hans Aberg [email protected]
Jesse Thilo [email protected]
Jim Meyering [email protected]
@@ -26,6 +27,7 @@ Richard Stallman [email protected]
Robert Anisko [email protected]
Shura [email protected]
Tom Lane [email protected]
Wolfram Wagner [email protected]
Wwp [email protected]
Many people are not named here because we lost track of them. We
+67 -63
View File
@@ -5,29 +5,30 @@
*/
#undef CRAY_STACKSEG_END
/* Define if using `alloca.c'. */
/* Define to 1 if using `alloca.c'. */
#undef C_ALLOCA
/* Define to 1 if translation of program messages to the user's native
language is requested. */
#undef ENABLE_NLS
/* Define if you have `alloca', as a function or macro. */
/* Define to 1 if you have `alloca', as a function or macro. */
#undef HAVE_ALLOCA
/* Define if you have <alloca.h> and it should be used (not on Ultrix). */
/* Define to 1 if you have <alloca.h> and it should be used (not on Ultrix).
*/
#undef HAVE_ALLOCA_H
/* Define if you have the <argz.h> header file. */
/* Define to 1 if you have the <argz.h> header file. */
#undef HAVE_ARGZ_H
/* Define if you have the <ctype.h> header file. */
/* Define to 1 if you have the <ctype.h> header file. */
#undef HAVE_CTYPE_H
/* Define if backslash-a works in C strings. */
#undef HAVE_C_BACKSLASH_A
/* Define if you have the `dcgettext' function. */
/* Define to 1 if you have the `dcgettext' function. */
#undef HAVE_DCGETTEXT
/* Define to 1 if you have the declaration of `memchr', and to 0 if you don't.
@@ -60,46 +61,46 @@
/* Define if the realloc check has been performed. */
#undef HAVE_DONE_WORKING_REALLOC_CHECK
/* Define if you have the `doprnt' function. */
/* Define to 1 if you have the `doprnt' function. */
#undef HAVE_DOPRNT
/* Define if you have the `feof_unlocked' function. */
/* Define to 1 if you have the `feof_unlocked' function. */
#undef HAVE_FEOF_UNLOCKED
/* Define if you have the `fgets_unlocked' function. */
/* Define to 1 if you have the `fgets_unlocked' function. */
#undef HAVE_FGETS_UNLOCKED
/* Define if you have the `getcwd' function. */
/* Define to 1 if you have the `getcwd' function. */
#undef HAVE_GETCWD
/* Define if you have the `getegid' function. */
/* Define to 1 if you have the `getegid' function. */
#undef HAVE_GETEGID
/* Define if you have the `geteuid' function. */
/* Define to 1 if you have the `geteuid' function. */
#undef HAVE_GETEUID
/* Define if you have the `getgid' function. */
/* Define to 1 if you have the `getgid' function. */
#undef HAVE_GETGID
/* Define if you have the `getpagesize' function. */
/* Define to 1 if you have the `getpagesize' function. */
#undef HAVE_GETPAGESIZE
/* Define if the GNU gettext() function is already present or preinstalled. */
#undef HAVE_GETTEXT
/* Define if you have the `getuid' function. */
/* Define to 1 if you have the `getuid' function. */
#undef HAVE_GETUID
/* Define if you have the iconv() function. */
#undef HAVE_ICONV
/* Define if you have the <inttypes.h> header file. */
/* Define to 1 if you have the <inttypes.h> header file. */
#undef HAVE_INTTYPES_H
/* Define if you have the `isascii' function. */
/* Define to 1 if you have the `isascii' function. */
#undef HAVE_ISASCII
/* Define if you have the `iswprint' function. */
/* Define to 1 if you have the `iswprint' function. */
#undef HAVE_ISWPRINT
/* Define if you have <langinfo.h> and nl_langinfo(CODESET). */
@@ -108,127 +109,130 @@
/* Define if your <locale.h> file defines LC_MESSAGES. */
#undef HAVE_LC_MESSAGES
/* Define if you have the <limits.h> header file. */
/* Define to 1 if you have the <limits.h> header file. */
#undef HAVE_LIMITS_H
/* Define if you have the <locale.h> header file. */
/* Define to 1 if you have the <locale.h> header file. */
#undef HAVE_LOCALE_H
/* Define if you have the <malloc.h> header file. */
/* Define to 1 if you have the <malloc.h> header file. */
#undef HAVE_MALLOC_H
/* Define to 1 if mbrtowc and mbstate_t are properly declared. */
#undef HAVE_MBRTOWC
/* Define if you have the `mbsinit' function. */
/* Define to 1 if you have the `mbsinit' function. */
#undef HAVE_MBSINIT
/* Define if you have the `memchr' function. */
/* Define to 1 if you have the `memchr' function. */
#undef HAVE_MEMCHR
/* Define if you have the <memory.h> header file. */
/* Define to 1 if you have the <memory.h> header file. */
#undef HAVE_MEMORY_H
/* Define if you have the `mempcpy' function. */
/* Define to 1 if you have the `mempcpy' function. */
#undef HAVE_MEMPCPY
/* Define if you have the `mkstemp' function. */
/* Define to 1 if you have the `mkstemp' function. */
#undef HAVE_MKSTEMP
/* Define if you have a working `mmap' system call. */
/* Define to 1 if you have a working `mmap' system call. */
#undef HAVE_MMAP
/* Define if you have the `munmap' function. */
/* Define to 1 if you have the `munmap' function. */
#undef HAVE_MUNMAP
/* Define if you have the <nl_types.h> header file. */
/* Define to 1 if you have the <nl_types.h> header file. */
#undef HAVE_NL_TYPES_H
/* Define if you have the `putenv' function. */
/* Define to 1 if libc includes obstacks. */
#undef HAVE_OBSTACK
/* Define to 1 if you have the `putenv' function. */
#undef HAVE_PUTENV
/* Define if you have the `setenv' function. */
/* Define to 1 if you have the `setenv' function. */
#undef HAVE_SETENV
/* Define if you have the `setlocale' function. */
/* Define to 1 if you have the `setlocale' function. */
#undef HAVE_SETLOCALE
/* Define if you have the <stddef.h> header file. */
/* Define to 1 if you have the <stddef.h> header file. */
#undef HAVE_STDDEF_H
/* Define if you have the <stdint.h> header file. */
/* Define to 1 if you have the <stdint.h> header file. */
#undef HAVE_STDINT_H
/* Define if you have the <stdlib.h> header file. */
/* Define to 1 if you have the <stdlib.h> header file. */
#undef HAVE_STDLIB_H
/* Define if you have the `stpcpy' function. */
/* Define to 1 if you have the `stpcpy' function. */
#undef HAVE_STPCPY
/* Define if you have the `strcasecmp' function. */
/* Define to 1 if you have the `strcasecmp' function. */
#undef HAVE_STRCASECMP
/* Define if you have the `strchr' function. */
/* Define to 1 if you have the `strchr' function. */
#undef HAVE_STRCHR
/* Define if you have the `strdup' function. */
/* Define to 1 if you have the `strdup' function. */
#undef HAVE_STRDUP
/* Define if you have the `strerror' function. */
/* Define to 1 if you have the `strerror' function. */
#undef HAVE_STRERROR
/* Define if you have the `strerror_r' function. */
/* Define to 1 if you have the `strerror_r' function. */
#undef HAVE_STRERROR_R
/* Define if you have the <strings.h> header file. */
/* Define to 1 if you have the <strings.h> header file. */
#undef HAVE_STRINGS_H
/* Define if you have the <string.h> header file. */
/* Define to 1 if you have the <string.h> header file. */
#undef HAVE_STRING_H
/* Define if you have the `strndup' function. */
/* Define to 1 if you have the `strndup' function. */
#undef HAVE_STRNDUP
/* Define if you have the `strnlen' function. */
/* Define to 1 if you have the `strnlen' function. */
#undef HAVE_STRNLEN
/* Define if you have the `strspn' function. */
/* Define to 1 if you have the `strspn' function. */
#undef HAVE_STRSPN
/* Define if you have the `strtoul' function. */
/* Define to 1 if you have the `strtoul' function. */
#undef HAVE_STRTOUL
/* Define if you have the <sys/param.h> header file. */
/* Define to 1 if you have the <sys/param.h> header file. */
#undef HAVE_SYS_PARAM_H
/* Define if you have the <sys/stat.h> header file. */
/* Define to 1 if you have the <sys/stat.h> header file. */
#undef HAVE_SYS_STAT_H
/* Define if you have the <sys/types.h> header file. */
/* Define to 1 if you have the <sys/types.h> header file. */
#undef HAVE_SYS_TYPES_H
/* Define if you have the `tsearch' function. */
/* Define to 1 if you have the `tsearch' function. */
#undef HAVE_TSEARCH
/* Define if you have the <unistd.h> header file. */
/* Define to 1 if you have the <unistd.h> header file. */
#undef HAVE_UNISTD_H
/* Define if you have the `vprintf' function. */
/* Define to 1 if you have the `vprintf' function. */
#undef HAVE_VPRINTF
/* Define if you have the <wchar.h> header file. */
/* Define to 1 if you have the <wchar.h> header file. */
#undef HAVE_WCHAR_H
/* Define if you have the <wctype.h> header file. */
/* Define to 1 if you have the <wctype.h> header file. */
#undef HAVE_WCTYPE_H
/* Define if you have the `__argz_count' function. */
/* Define to 1 if you have the `__argz_count' function. */
#undef HAVE___ARGZ_COUNT
/* Define if you have the `__argz_next' function. */
/* Define to 1 if you have the `__argz_next' function. */
#undef HAVE___ARGZ_NEXT
/* Define if you have the `__argz_stringify' function. */
/* Define to 1 if you have the `__argz_stringify' function. */
#undef HAVE___ARGZ_STRINGIFY
/* Define as const if the declaration of iconv() needs const. */
@@ -248,7 +252,7 @@
STACK_DIRECTION = 0 => direction of growth unknown */
#undef STACK_DIRECTION
/* Define if you have the ANSI C header files. */
/* Define to 1 if you have the ANSI C header files. */
#undef STDC_HEADERS
/* Define to 1 if strerror_r returns char *. */
@@ -263,14 +267,14 @@
/* Define to 1 for GNU C library extensions. */
#undef _GNU_SOURCE
/* Define if on MINIX. */
/* Define to 1 if on MINIX. */
#undef _MINIX
/* Define if the system does not provide POSIX.1 features except with this
defined. */
/* Define to 2 if the system does not provide POSIX.1 features except with
this defined. */
#undef _POSIX_1_SOURCE
/* Define if you need to in order for `stat' and other things to work. */
/* Define to 1 if you need to in order for `stat' and other things to work. */
#undef _POSIX_SOURCE
/* Define to empty if `const' does not conform to ANSI C. */
+2 -2
View File
@@ -3,7 +3,7 @@
# Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001
# Free Software Foundation, Inc.
timestamp='2001-11-08'
timestamp='2001-11-26'
# This file is free software; you can redistribute it and/or modify it
# under the terms of the GNU General Public License as published by
@@ -1056,7 +1056,7 @@ EOF
*:QNX:*:4*)
echo i386-pc-qnx
exit 0 ;;
NSR-[KW]:NONSTOP_KERNEL:*:*)
NSR-[GKLNPTVW]:NONSTOP_KERNEL:*:*)
echo nsr-tandem-nsk${UNAME_RELEASE}
exit 0 ;;
*:NonStop-UX:*:*)
+4 -1
View File
@@ -3,7 +3,7 @@
# Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001
# Free Software Foundation, Inc.
timestamp='2001-11-08'
timestamp='2001-11-21'
# This file is (in principle) common to ALL GNU software.
# The presence of a machine in this file suggests that SOME GNU software
@@ -1126,6 +1126,9 @@ case $os in
-acis*)
os=-aos
;;
-atheos*)
os=-atheos
;;
-386bsd)
os=-bsd
;;
+1 -1
View File
@@ -1 +1 @@
1.30a
1.30d
Vendored
+115 -11
View File
@@ -1,6 +1,6 @@
#! /bin/sh
# Guess values for system-dependent variables and create Makefiles.
# Generated by GNU Autoconf 2.52g for GNU Bison 1.30b.
# Generated by GNU Autoconf 2.52g for GNU Bison 1.30e.
#
# Report bugs to <[email protected]>.
#
@@ -332,8 +332,8 @@ mandir='${prefix}/man'
# Identity of this package.
PACKAGE_NAME='GNU Bison'
PACKAGE_TARNAME='bison'
PACKAGE_VERSION='1.30b'
PACKAGE_STRING='GNU Bison 1.30b'
PACKAGE_VERSION='1.30e'
PACKAGE_STRING='GNU Bison 1.30e'
PACKAGE_BUGREPORT='[email protected]'
ac_prev=
@@ -760,7 +760,7 @@ if test "$ac_init_help" = "long"; then
# Omit some internal or obsolete options to make the list less imposing.
# This message is too long to be a string in the A/UX 3.1 sh.
cat <<_ACEOF
\`configure' configures GNU Bison 1.30b to adapt to many kinds of systems.
\`configure' configures GNU Bison 1.30e to adapt to many kinds of systems.
Usage: $0 [OPTION]... [VAR=VALUE]...
@@ -826,7 +826,7 @@ fi
if test -n "$ac_init_help"; then
case $ac_init_help in
short | recursive ) echo "Configuration of GNU Bison 1.30b:";;
short | recursive ) echo "Configuration of GNU Bison 1.30e:";;
esac
cat <<\_ACEOF
@@ -921,7 +921,7 @@ fi
test -n "$ac_init_help" && exit 0
if $ac_init_version; then
cat <<\_ACEOF
GNU Bison configure 1.30b
GNU Bison configure 1.30e
generated by GNU Autoconf 2.52g
Copyright 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001
@@ -936,7 +936,7 @@ cat >&5 <<_ACEOF
This file contains any messages produced by compilers while
running configure, to aid debugging if configure makes a mistake.
It was created by GNU Bison $as_me 1.30b, which was
It was created by GNU Bison $as_me 1.30e, which was
generated by GNU Autoconf 2.52g. Invocation command line was
$ $0 $@
@@ -1470,7 +1470,7 @@ fi
# Define the identity of the package.
PACKAGE=bison
VERSION=1.30b
VERSION=1.30e
cat >>confdefs.h <<_ACEOF
#define PACKAGE "$PACKAGE"
@@ -4840,6 +4840,110 @@ _ACEOF
fi
echo "$as_me:$LINENO: checking for obstacks" >&5
echo $ECHO_N "checking for obstacks... $ECHO_C" >&6
if test "${ac_cv_func_obstack+set}" = set; then
echo $ECHO_N "(cached) $ECHO_C" >&6
else
cat >conftest.$ac_ext <<_ACEOF
#line $LINENO "configure"
#include "confdefs.h"
#include "obstack.h"
#ifdef F77_DUMMY_MAIN
# ifdef __cplusplus
extern "C"
# endif
int F77_DUMMY_MAIN() { return 1; }
#endif
int
main ()
{
struct obstack *mem; obstack_free(mem,(char *) 0)
;
return 0;
}
_ACEOF
rm -f conftest.$ac_objext conftest$ac_exeext
if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5
(eval $ac_link) 2>&5
ac_status=$?
echo "$as_me:$LINENO: \$? = $ac_status" >&5
(exit $ac_status); } &&
{ ac_try='test -s conftest$ac_exeext'
{ (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5
(eval $ac_try) 2>&5
ac_status=$?
echo "$as_me:$LINENO: \$? = $ac_status" >&5
(exit $ac_status); }; }; then
ac_cv_func_obstack=yes
else
echo "$as_me: failed program was:" >&5
cat conftest.$ac_ext >&5
ac_cv_func_obstack=no
fi
rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext
fi
echo "$as_me:$LINENO: result: $ac_cv_func_obstack" >&5
echo "${ECHO_T}$ac_cv_func_obstack" >&6
if test $ac_cv_func_obstack = yes; then
cat >>confdefs.h <<\_ACEOF
#define HAVE_OBSTACK 1
_ACEOF
else
LIBOBJS="$LIBOBJS obstack.$ac_objext"
fi
echo "$as_me:$LINENO: checking for error_at_line" >&5
echo $ECHO_N "checking for error_at_line... $ECHO_C" >&6
if test "${ac_cv_lib_error_at_line+set}" = set; then
echo $ECHO_N "(cached) $ECHO_C" >&6
else
cat >conftest.$ac_ext <<_ACEOF
#line $LINENO "configure"
#include "confdefs.h"
#ifdef F77_DUMMY_MAIN
# ifdef __cplusplus
extern "C"
# endif
int F77_DUMMY_MAIN() { return 1; }
#endif
int
main ()
{
error_at_line (0, 0, "", 0, "");
;
return 0;
}
_ACEOF
rm -f conftest.$ac_objext conftest$ac_exeext
if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5
(eval $ac_link) 2>&5
ac_status=$?
echo "$as_me:$LINENO: \$? = $ac_status" >&5
(exit $ac_status); } &&
{ ac_try='test -s conftest$ac_exeext'
{ (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5
(eval $ac_try) 2>&5
ac_status=$?
echo "$as_me:$LINENO: \$? = $ac_status" >&5
(exit $ac_status); }; }; then
ac_cv_lib_error_at_line=yes
else
echo "$as_me: failed program was:" >&5
cat conftest.$ac_ext >&5
ac_cv_lib_error_at_line=no
fi
rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext
fi
echo "$as_me:$LINENO: result: $ac_cv_lib_error_at_line" >&5
echo "${ECHO_T}$ac_cv_lib_error_at_line" >&6
if test $ac_cv_lib_error_at_line = no; then
LIBOBJS="$LIBOBJS error.$ac_objext"
fi
for ac_func in mkstemp setlocale
@@ -6830,7 +6934,7 @@ echo "${ECHO_T}no" >&6
fi;
ALL_LINGUAS="de es et fr ja nl tr ru"
ALL_LINGUAS="de es et fr ja nl ru sv tr"
# Make sure we can run config.sub.
$ac_config_sub sun4 >/dev/null 2>&1 ||
{ { echo "$as_me:$LINENO: error: cannot run $ac_config_sub" >&5
@@ -9000,7 +9104,7 @@ _ASBOX
} >&5
cat >&5 <<_CSEOF
This file was extended by GNU Bison $as_me 1.30b, which was
This file was extended by GNU Bison $as_me 1.30e, which was
generated by GNU Autoconf 2.52g. Invocation command line was
CONFIG_FILES = $CONFIG_FILES
@@ -9062,7 +9166,7 @@ _ACEOF
cat >>$CONFIG_STATUS <<_ACEOF
ac_cs_version="\\
GNU Bison config.status 1.30b
GNU Bison config.status 1.30e
configured by $0, generated by GNU Autoconf 2.52g,
with options \\"`echo "$ac_configure_args" | sed 's/[\\""\`\$]/\\\\&/g'`\\"
+6 -4
View File
@@ -16,12 +16,12 @@
# 02111-1307 USA
# We need a recent Autoconf to run a recent Autotest.
AC_PREREQ(2.52e)
AC_PREREQ(2.52g)
AC_INIT([GNU Bison], [1.30b], [[email protected]])
AC_INIT([GNU Bison], [1.30e], [[email protected]])
AC_CONFIG_AUX_DIR(config)
AM_INIT_AUTOMAKE([bison], [1.30b])
AM_INIT_AUTOMAKE([bison], [1.30e])
AM_CONFIG_HEADER(config.h:config.hin)
# Initialize the test suite.
@@ -80,6 +80,8 @@ AM_C_PROTOTYPES
# Checks for library functions.
AC_FUNC_ALLOCA
AC_FUNC_OBSTACK
AC_FUNC_ERROR_AT_LINE
AC_CHECK_FUNCS(mkstemp setlocale)
AC_CHECK_DECLS([stpcpy, strndup, strnlen, memchr])
AC_REPLACE_FUNCS(stpcpy strndup strnlen strspn memchr)
@@ -89,7 +91,7 @@ jm_PREREQ_QUOTEARG
jm_PREREQ_ERROR
AM_WITH_DMALLOC
ALL_LINGUAS="de es et fr ja nl tr ru"
ALL_LINGUAS="de es et fr ja nl ru sv tr"
AM_GNU_GETTEXT(, need-ngettext)
# This is necessary so that .o files in LIBOBJS are also built via
+3 -8
View File
@@ -1,16 +1,11 @@
Makefile
bison.aux
Makefile Makefile.in
*.aux *.dvi *.log *.info* *.pdf *.ps
stamp-*
bison.cp
bison.cps
bison.dvi
bison.fn
bison.ky
bison.log
bison.pg
bison.ps
bison.toc
bison.tp
bison.vr
refcard.dvi
refcard.log
refcard.ps
-403
View File
@@ -1,403 +0,0 @@
# Makefile.in generated by automake 1.5a from Makefile.am.
# @configure_input@
# Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001
# Free Software Foundation, Inc.
# This Makefile.in is free software; the Free Software Foundation
# gives unlimited permission to copy and/or distribute it,
# with or without modifications, as long as this notice is preserved.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
# PARTICULAR PURPOSE.
@SET_MAKE@
SHELL = @SHELL@
srcdir = @srcdir@
top_srcdir = @top_srcdir@
VPATH = @srcdir@
prefix = @prefix@
exec_prefix = @exec_prefix@
bindir = @bindir@
sbindir = @sbindir@
libexecdir = @libexecdir@
datadir = @datadir@
sysconfdir = @sysconfdir@
sharedstatedir = @sharedstatedir@
localstatedir = @localstatedir@
libdir = @libdir@
infodir = @infodir@
mandir = @mandir@
includedir = @includedir@
oldincludedir = /usr/include
pkgdatadir = $(datadir)/@PACKAGE@
pkglibdir = $(libdir)/@PACKAGE@
pkgincludedir = $(includedir)/@PACKAGE@
top_builddir = ..
ACLOCAL = @ACLOCAL@
AUTOCONF = @AUTOCONF@
AUTOMAKE = @AUTOMAKE@
AUTOHEADER = @AUTOHEADER@
am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
INSTALL = @INSTALL@
INSTALL_PROGRAM = @INSTALL_PROGRAM@
INSTALL_DATA = @INSTALL_DATA@
INSTALL_SCRIPT = @INSTALL_SCRIPT@
INSTALL_HEADER = $(INSTALL_DATA)
transform = @program_transform_name@
NORMAL_INSTALL = :
PRE_INSTALL = :
POST_INSTALL = :
NORMAL_UNINSTALL = :
PRE_UNINSTALL = :
POST_UNINSTALL = :
host_alias = @host_alias@
host_triplet = @host@
EXEEXT = @EXEEXT@
OBJEXT = @OBJEXT@
PATH_SEPARATOR = @PATH_SEPARATOR@
AMTAR = @AMTAR@
AUTOM4TE = @AUTOM4TE@
AWK = @AWK@
BUILD_INCLUDED_LIBINTL = @BUILD_INCLUDED_LIBINTL@
CATALOGS = @CATALOGS@
CATOBJEXT = @CATOBJEXT@
CC = @CC@
CPP = @CPP@
DATADIRNAME = @DATADIRNAME@
DEPDIR = @DEPDIR@
GCC = @GCC@
GENCAT = @GENCAT@
GLIBC21 = @GLIBC21@
GMOFILES = @GMOFILES@
GMSGFMT = @GMSGFMT@
INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
INSTOBJEXT = @INSTOBJEXT@
INTLBISON = @INTLBISON@
INTLLIBS = @INTLLIBS@
INTLOBJS = @INTLOBJS@
INTL_LIBTOOL_SUFFIX_PREFIX = @INTL_LIBTOOL_SUFFIX_PREFIX@
LIB = @LIB@
LIBICONV = @LIBICONV@
MKINSTALLDIRS = @MKINSTALLDIRS@
MSGFMT = @MSGFMT@
PACKAGE = @PACKAGE@
POFILES = @POFILES@
POSUB = @POSUB@
RANLIB = @RANLIB@
U = @U@
USE_INCLUDED_LIBINTL = @USE_INCLUDED_LIBINTL@
USE_NLS = @USE_NLS@
VERSION = @VERSION@
WARNING_CFLAGS = @WARNING_CFLAGS@
am__include = @am__include@
am__quote = @am__quote@
install_sh = @install_sh@
AUTOMAKE_OPTIONS = 1.4
info_TEXINFOS = bison.texinfo
man_MANS = bison.1
bison_TEXINFOS = gpl.texi fdl.texi
EXTRA_DIST = FAQ bison.1 bison.rnh refcard.tex
CLEANFILES = refcard.dvi refcard.log refcard.ps
subdir = doc
mkinstalldirs = $(SHELL) $(top_srcdir)/config/mkinstalldirs
CONFIG_HEADER = $(top_builddir)/config.h
CONFIG_CLEAN_FILES =
DIST_SOURCES =
TEXINFO_TEX = $(top_srcdir)/config/texinfo.tex
INFO_DEPS = bison.info
DVIS = bison.dvi
TEXINFOS = bison.texinfo
NROFF = nroff
MANS = $(man_MANS)
DIST_COMMON = $(bison_TEXINFOS) Makefile.am Makefile.in stamp-vti \
version.texi
all: all-am
.SUFFIXES:
.SUFFIXES: .dvi .info .ps .texinfo
$(srcdir)/Makefile.in: Makefile.am $(top_srcdir)/configure.in $(ACLOCAL_M4)
cd $(top_srcdir) && \
$(AUTOMAKE) --gnu doc/Makefile
Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@
$(srcdir)/version.texi: $(srcdir)/stamp-vti
@:
$(srcdir)/stamp-vti: bison.texinfo $(top_srcdir)/configure.in
@(set `$(SHELL) $(top_srcdir)/config/mdate-sh $(srcdir)/bison.texinfo`; \
echo "@set UPDATED $$1 $$2 $$3"; \
echo "@set UPDATED-MONTH $$2 $$3"; \
echo "@set EDITION $(VERSION)"; \
echo "@set VERSION $(VERSION)") > vti.tmp
@cmp -s vti.tmp $(srcdir)/version.texi \
|| (echo "Updating $(srcdir)/version.texi"; \
cp vti.tmp $(srcdir)/version.texi)
-@rm -f vti.tmp
@cp $(srcdir)/version.texi $@
mostlyclean-vti:
-rm -f vti.tmp
maintainer-clean-vti:
-rm -f $(srcdir)/stamp-vti $(srcdir)/version.texi
bison.info: bison.texinfo $(srcdir)/version.texi $(bison_TEXINFOS)
bison.dvi: bison.texinfo $(srcdir)/version.texi $(bison_TEXINFOS)
.texinfo.info:
@cd $(srcdir) && rm -f $@ $@-[0-9] $@-[0-9][0-9]
cd $(srcdir) \
&& $(MAKEINFO) $(AM_MAKEINFOFLAGS) $(MAKEINFOFLAGS) \
`echo $< | sed 's,.*/,,'`
.texinfo.dvi:
TEXINPUTS="$(top_srcdir)/config$(PATH_SEPARATOR)$$TEXINPUTS" \
MAKEINFO='$(MAKEINFO) $(AM_MAKEINFOFLAGS) $(MAKEINFOFLAGS) -I $(srcdir)' \
$(TEXI2DVI) $<
.texinfo:
@cd $(srcdir) && rm -f $@ $@-[0-9] $@-[0-9][0-9]
cd $(srcdir) \
&& $(MAKEINFO) $(AM_MAKEINFOFLAGS) $(MAKEINFOFLAGS) \
`echo $< | sed 's,.*/,,'`
MAKEINFO = @MAKEINFO@
TEXI2DVI = texi2dvi
DVIPS = dvips
.dvi.ps:
$(DVIPS) $< -o $@
uninstall-info-am:
$(PRE_UNINSTALL)
@if (install-info --version && \
install-info --version | fgrep -i -v debian) >/dev/null 2>&1; then \
list='$(INFO_DEPS)'; \
for file in $$list; do \
echo " install-info --info-dir=$(DESTDIR)$(infodir) --remove $(DESTDIR)$(infodir)/$$file"; \
install-info --info-dir=$(DESTDIR)$(infodir) --remove $(DESTDIR)$(infodir)/$$file; \
done; \
else :; fi
@$(NORMAL_UNINSTALL)
@list='$(INFO_DEPS)'; \
for file in $$list; do \
(if cd $(DESTDIR)$(infodir); then \
echo " rm -f $$file $$file-[0-9] $$file-[0-9][0-9])"; \
rm -f $$file $$file-[0-9] $$file-[0-9][0-9]; \
else :; fi); \
done
dist-info: $(INFO_DEPS)
list='$(INFO_DEPS)'; \
for base in $$list; do \
d=$(srcdir); \
for file in $$d/$$base*; do \
relfile=`expr "$$file" : "$$d/\(.*\)"`; \
test -f $(distdir)/$$relfile || \
cp -p $$file $(distdir)/$$relfile; \
done; \
done
mostlyclean-aminfo:
-rm -f bison.aux bison.cp bison.cps bison.dvi bison.fn bison.ky bison.log \
bison.pg bison.ps bison.toc bison.tp bison.vr
maintainer-clean-aminfo:
cd $(srcdir) && \
for i in $(INFO_DEPS); do \
rm -f $$i; \
if test "`echo $$i-[0-9]*`" != "$$i-[0-9]*"; then \
rm -f $$i-[0-9]*; \
fi; \
done
man1dir = $(mandir)/man1
install-man1: $(man1_MANS) $(man_MANS)
@$(NORMAL_INSTALL)
$(mkinstalldirs) $(DESTDIR)$(man1dir)
@list='$(man1_MANS) $(dist_man1_MANS) $(nodist_man1_MANS)'; \
l2='$(man_MANS) $(dist_man_MANS) $(nodist_man_MANS)'; \
for i in $$l2; do \
case "$$i" in \
*.1*) list="$$list $$i" ;; \
esac; \
done; \
for i in $$list; do \
if test -f $(srcdir)/$$i; then file=$(srcdir)/$$i; \
else file=$$i; fi; \
ext=`echo $$i | sed -e 's/^.*\\.//'`; \
inst=`echo $$i | sed -e 's/\\.[0-9a-z]*$$//'`; \
inst=`echo $$inst | sed -e 's/^.*\///'`; \
inst=`echo $$inst | sed '$(transform)'`.$$ext; \
echo " $(INSTALL_DATA) $$file $(DESTDIR)$(man1dir)/$$inst"; \
$(INSTALL_DATA) $$file $(DESTDIR)$(man1dir)/$$inst; \
done
uninstall-man1:
@$(NORMAL_UNINSTALL)
@list='$(man1_MANS) $(dist_man1_MANS) $(nodist_man1_MANS)'; \
l2='$(man_MANS) $(dist_man_MANS) $(nodist_man_MANS)'; \
for i in $$l2; do \
case "$$i" in \
*.1*) list="$$list $$i" ;; \
esac; \
done; \
for i in $$list; do \
ext=`echo $$i | sed -e 's/^.*\\.//'`; \
inst=`echo $$i | sed -e 's/\\.[0-9a-z]*$$//'`; \
inst=`echo $$inst | sed -e 's/^.*\///'`; \
inst=`echo $$inst | sed '$(transform)'`.$$ext; \
echo " rm -f $(DESTDIR)$(man1dir)/$$inst"; \
rm -f $(DESTDIR)$(man1dir)/$$inst; \
done
tags: TAGS
TAGS:
DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
top_distdir = ..
distdir = $(top_distdir)/$(PACKAGE)-$(VERSION)
distdir: $(DISTFILES)
@for file in $(DISTFILES); do \
if test -f $$file; then d=.; else d=$(srcdir); fi; \
dir=`echo "$$file" | sed -e 's,/[^/]*$$,,'`; \
if test "$$dir" != "$$file" && test "$$dir" != "."; then \
$(mkinstalldirs) "$(distdir)/$$dir"; \
fi; \
if test -d $$d/$$file; then \
cp -pR $$d/$$file $(distdir) \
|| exit 1; \
else \
test -f $(distdir)/$$file \
|| cp -p $$d/$$file $(distdir)/$$file \
|| exit 1; \
fi; \
done
$(MAKE) $(AM_MAKEFLAGS) \
top_distdir="${top_distdir}" distdir="$(distdir)" \
dist-info
check-am: all-am
check: check-am
all-am: Makefile $(INFO_DEPS) $(MANS)
installdirs:
$(mkinstalldirs) $(DESTDIR)$(infodir) $(DESTDIR)$(man1dir)
install: install-am
install-exec: install-exec-am
install-data: install-data-am
uninstall: uninstall-am
install-am: all-am
@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
installcheck: installcheck-am
install-strip:
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
`test -z '$(STRIP)' || \
echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install
mostlyclean-generic:
clean-generic:
-test -z "$(CLEANFILES)" || rm -f $(CLEANFILES)
distclean-generic:
-rm -f Makefile $(CONFIG_CLEAN_FILES) stamp-h stamp-h[0-9]*
maintainer-clean-generic:
@echo "This command is intended for maintainers to use"
@echo "it deletes files that may require special tools to rebuild."
clean: clean-am
clean-am: clean-generic mostlyclean-am
distclean: distclean-am
distclean-am: clean-am distclean-generic
dvi: dvi-am
dvi-am: $(DVIS)
info: info-am
info-am: $(INFO_DEPS)
install-data-am: install-info-am install-man
install-exec-am:
install-info: install-info-am
install-info-am: $(INFO_DEPS)
@$(NORMAL_INSTALL)
$(mkinstalldirs) $(DESTDIR)$(infodir)
@list='$(INFO_DEPS)'; \
for file in $$list; do \
d=$(srcdir); \
for ifile in echo $$d/$$file $$d/$$file-[0-9] $$d/$$file-[0-9][0-9]; do \
if test -f $$ifile; then \
relfile=`expr "$$ifile" : "$$d/\(.*\)"`; \
echo " $(INSTALL_DATA) $$ifile $(DESTDIR)$(infodir)/$$relfile"; \
$(INSTALL_DATA) $$ifile $(DESTDIR)$(infodir)/$$relfile; \
else : ; fi; \
done; \
done
@$(POST_INSTALL)
@if (install-info --version && \
install-info --version | fgrep -i -v debian) >/dev/null 2>&1; then \
list='$(INFO_DEPS)'; \
for file in $$list; do \
echo " install-info --info-dir=$(DESTDIR)$(infodir) $(DESTDIR)$(infodir)/$$file";\
install-info --info-dir=$(DESTDIR)$(infodir) $(DESTDIR)$(infodir)/$$file || :;\
done; \
else : ; fi
install-man: install-man1
installcheck-am:
maintainer-clean: maintainer-clean-am
maintainer-clean-am: distclean-am maintainer-clean-aminfo \
maintainer-clean-generic maintainer-clean-vti
mostlyclean: mostlyclean-am
mostlyclean-am: mostlyclean-aminfo mostlyclean-generic mostlyclean-vti
uninstall-am: uninstall-info-am uninstall-man
uninstall-man: uninstall-man1
.PHONY: all all-am check check-am clean clean-generic dist-info \
distclean distclean-generic distdir dvi dvi-am info info-am \
install install-am install-data install-data-am install-exec \
install-exec-am install-info install-info-am install-man \
install-man1 install-strip installcheck installcheck-am \
installdirs maintainer-clean maintainer-clean-aminfo \
maintainer-clean-generic maintainer-clean-vti mostlyclean \
mostlyclean-aminfo mostlyclean-generic mostlyclean-vti \
uninstall uninstall-am uninstall-info-am uninstall-man \
uninstall-man1
refcard.dvi: refcard.tex
tex refcard.tex
refcard.ps: refcard.dvi
# Tell versions [3.59,3.63) of GNU make to not export all variables.
# Otherwise a system limit (for SysV at least) may be exceeded.
.NOEXPORT:
-145
View File
@@ -1,145 +0,0 @@
Ceci est le fichier Info bison.info, produit par Makeinfo version 4.0b
à partir bison.texinfo.
START-INFO-DIR-ENTRY
* bison: (bison). GNU Project parser generator (yacc replacement).
END-INFO-DIR-ENTRY
This file documents the Bison parser generator.
Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993, 1995, 1998, 1999,
2000, 2001 Free Software Foundation, Inc.
Permission is granted to make and distribute verbatim copies of this
manual provided the copyright notice and this permission notice are
preserved on all copies.
Permission is granted to copy and distribute modified versions of
this manual under the conditions for verbatim copying, provided also
that the sections entitled "GNU General Public License" and "Conditions
for Using Bison" are included exactly as in the original, and provided
that the entire resulting derived work is distributed under the terms
of a permission notice identical to this one.
Permission is granted to copy and distribute translations of this
manual into another language, under the above conditions for modified
versions, except that the sections entitled "GNU General Public
License", "Conditions for Using Bison" and this permission notice may be
included in translations approved by the Free Software Foundation
instead of in the original English.

Indirect:
bison.info-1: 1313
bison.info-2: 50632
bison.info-3: 100395
bison.info-4: 147417
bison.info-5: 197287

Tag Table:
(Indirect)
Node: Top1313
Node: Introduction8968
Node: Conditions10243
Node: Copying11707
Node: Concepts30910
Node: Language and Grammar31989
Node: Grammar in Bison36947
Node: Semantic Values38871
Node: Semantic Actions40972
Node: Locations Overview42161
Node: Bison Parser43608
Node: Stages45920
Node: Grammar Layout47203
Node: Examples48460
Node: RPN Calc49658
Node: Rpcalc Decls50632
Node: Rpcalc Rules52219
Node: Rpcalc Input54019
Node: Rpcalc Line55480
Node: Rpcalc Expr56595
Node: Rpcalc Lexer58540
Node: Rpcalc Main61112
Node: Rpcalc Error61510
Node: Rpcalc Gen62518
Node: Rpcalc Compile63667
Node: Infix Calc64542
Node: Simple Error Recovery67249
Node: Location Tracking Calc69138
Node: Ltcalc Decls69820
Node: Ltcalc Rules70713
Node: Ltcalc Lexer72723
Node: Multi-function Calc75049
Node: Mfcalc Decl76616
Node: Mfcalc Rules78639
Node: Mfcalc Symtab80019
Node: Exercises86392
Node: Grammar File86898
Node: Grammar Outline87746
Node: C Declarations88480
Node: Bison Declarations89060
Node: Grammar Rules89472
Node: C Code89932
Node: Symbols90862
Node: Rules95943
Node: Recursion97582
Node: Semantics99301
Node: Value Type100395
Node: Multiple Types101067
Node: Actions102084
Node: Action Types104869
Node: Mid-Rule Actions106172
Node: Locations111742
Node: Location Type112390
Node: Actions and Locations112948
Node: Location Default Action115104
Node: Declarations116567
Node: Token Decl117886
Node: Precedence Decl119899
Node: Union Decl121450
Node: Type Decl122294
Node: Expect Decl123200
Node: Start Decl124768
Node: Pure Decl125146
Node: Decl Summary126823
Node: Multiple Parsers132951
Node: Interface134445
Node: Parser Function135317
Node: Lexical136152
Node: Calling Convention137558
Node: Token Values140329
Node: Token Positions141478
Node: Pure Calling142363
Node: Error Reporting145295
Node: Action Features147417
Node: Algorithm150712
Node: Look-Ahead153005
Node: Shift/Reduce155137
Node: Precedence158049
Node: Why Precedence158700
Node: Using Precedence160565
Node: Precedence Examples161533
Node: How Precedence162234
Node: Contextual Precedence163383
Node: Parser States165174
Node: Reduce/Reduce166417
Node: Mystery Conflicts169978
Node: Stack Overflow173364
Node: Error Recovery174737
Node: Context Dependency179873
Node: Semantic Tokens180721
Node: Lexical Tie-ins183738
Node: Tie-in Recovery185286
Node: Debugging187458
Node: Invocation190759
Node: Bison Options192011
Node: Environment Variables195561
Node: Option Cross Key196409
Node: VMS Invocation197287
Node: Table of Symbols198071
Node: Glossary206039
Node: Copying This Manual212343
Node: GNU Free Documentation License212552
Node: Index232417

End Tag Table
-1075
View File
File diff suppressed because it is too large Load Diff
-1423
View File
File diff suppressed because it is too large Load Diff
-1248
View File
File diff suppressed because it is too large Load Diff
-1318
View File
File diff suppressed because it is too large Load Diff
-1072
View File
File diff suppressed because it is too large Load Diff
+3 -2
View File
@@ -4506,8 +4506,9 @@ produce parsers that are very large. In practice, Bison is more useful
as it is now.
When the problem arises, you can often fix it by identifying the two
parser states that are being confused, and adding something to make them
look distinct. In the above example, adding one rule to
parser states that are being confused (using @samp{-v}
(@pxref{Invocation, ,Invoking Bison}) can help), and adding something to
make them look distinct. In the above example, adding one rule to
@code{return_spec} as follows makes the problem go away:
@example
-4
View File
@@ -1,4 +0,0 @@
@set UPDATED 12 November 2001
@set UPDATED-MONTH November 2001
@set EDITION 1.30b
@set VERSION 1.30b
+3 -3
View File
@@ -1,4 +1,4 @@
@set UPDATED 12 November 2001
@set UPDATED 26 November 2001
@set UPDATED-MONTH November 2001
@set EDITION 1.30b
@set VERSION 1.30b
@set EDITION 1.30e
@set VERSION 1.30e
+1 -3
View File
@@ -12,11 +12,9 @@ INCLUDES = -I.. -I$(srcdir) -I../intl
EXTRA_DIST = malloc.c realloc.c
libbison_a_SOURCES = \
error.c error.h \
getopt.h getopt.c getopt1.c \
obstack.h obstack.c \
quote.h quote.c quotearg.h quotearg.c \
xalloc.h xmalloc.c xstrdup.c
libbison_a_LIBADD = @LIBOBJS@
libbison_a_LIBADD = @LIBOBJS@ @ALLOCA@
libbison_a_DEPENDENCIES = $(libbison_a_LIBADD)
+18 -18
View File
@@ -113,14 +113,12 @@ INCLUDES = -I.. -I$(srcdir) -I../intl
EXTRA_DIST = malloc.c realloc.c
libbison_a_SOURCES = \
error.c error.h \
getopt.h getopt.c getopt1.c \
obstack.h obstack.c \
quote.h quote.c quotearg.h quotearg.c \
xalloc.h xmalloc.c xstrdup.c
libbison_a_LIBADD = @LIBOBJS@
libbison_a_LIBADD = @LIBOBJS@ @ALLOCA@
libbison_a_DEPENDENCIES = $(libbison_a_LIBADD)
subdir = lib
mkinstalldirs = $(SHELL) $(top_srcdir)/config/mkinstalldirs
@@ -129,9 +127,9 @@ CONFIG_CLEAN_FILES =
LIBRARIES = $(noinst_LIBRARIES)
libbison_a_AR = $(AR) cru
am_libbison_a_OBJECTS = error$U.$(OBJEXT) getopt$U.$(OBJEXT) \
getopt1$U.$(OBJEXT) obstack$U.$(OBJEXT) quote$U.$(OBJEXT) \
quotearg$U.$(OBJEXT) xmalloc$U.$(OBJEXT) xstrdup$U.$(OBJEXT)
am_libbison_a_OBJECTS = getopt$U.$(OBJEXT) getopt1$U.$(OBJEXT) \
quote$U.$(OBJEXT) quotearg$U.$(OBJEXT) xmalloc$U.$(OBJEXT) \
xstrdup$U.$(OBJEXT)
libbison_a_OBJECTS = $(am_libbison_a_OBJECTS)
DEFS = @DEFS@
@@ -140,22 +138,23 @@ CPPFLAGS = @CPPFLAGS@
LDFLAGS = @LDFLAGS@
LIBS = @LIBS@
depcomp = $(SHELL) $(top_srcdir)/config/depcomp
@AMDEP_TRUE@DEP_FILES = $(DEPDIR)/error$U.Po $(DEPDIR)/getopt$U.Po \
@AMDEP_TRUE@ $(DEPDIR)/getopt1$U.Po $(DEPDIR)/malloc.Po \
@AMDEP_TRUE@ $(DEPDIR)/memchr.Po $(DEPDIR)/obstack$U.Po \
@AMDEP_TRUE@ $(DEPDIR)/quote$U.Po $(DEPDIR)/quotearg$U.Po \
@AMDEP_TRUE@ $(DEPDIR)/realloc.Po $(DEPDIR)/stpcpy.Po \
@AMDEP_TRUE@ $(DEPDIR)/strndup.Po $(DEPDIR)/strnlen.Po \
@AMDEP_TRUE@ $(DEPDIR)/strspn.Po $(DEPDIR)/xmalloc$U.Po \
@AMDEP_TRUE@ $(DEPDIR)/xstrdup$U.Po
@AMDEP_TRUE@DEP_FILES = $(DEPDIR)/alloca.Po $(DEPDIR)/error.Po \
@AMDEP_TRUE@ $(DEPDIR)/getopt$U.Po $(DEPDIR)/getopt1$U.Po \
@AMDEP_TRUE@ $(DEPDIR)/malloc.Po $(DEPDIR)/memchr.Po \
@AMDEP_TRUE@ $(DEPDIR)/obstack.Po $(DEPDIR)/quote$U.Po \
@AMDEP_TRUE@ $(DEPDIR)/quotearg$U.Po $(DEPDIR)/realloc.Po \
@AMDEP_TRUE@ $(DEPDIR)/stpcpy.Po $(DEPDIR)/strndup.Po \
@AMDEP_TRUE@ $(DEPDIR)/strnlen.Po $(DEPDIR)/strspn.Po \
@AMDEP_TRUE@ $(DEPDIR)/xmalloc$U.Po $(DEPDIR)/xstrdup$U.Po
COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
CCLD = $(CC)
LINK = $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
CFLAGS = @CFLAGS@
DIST_SOURCES = $(libbison_a_SOURCES)
DIST_COMMON = Makefile.am Makefile.in ansi2knr.1 ansi2knr.c malloc.c \
memchr.c realloc.c stpcpy.c strndup.c strnlen.c strspn.c
DIST_COMMON = Makefile.am Makefile.in alloca.c ansi2knr.1 ansi2knr.c \
error.c error.h malloc.c memchr.c obstack.c obstack.h realloc.c \
stpcpy.c strndup.c strnlen.c strspn.c
SOURCES = $(libbison_a_SOURCES)
all: all-am
@@ -194,12 +193,13 @@ clean-krextra:
mostlyclean-kr:
-test "$U" = "" || rm -f *_.c
@AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/error$U.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/alloca.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/error.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/getopt$U.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/getopt1$U.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/malloc.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/memchr.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/obstack$U.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/obstack.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/quote$U.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/quotearg$U.Po@am__quote@
@AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/realloc.Po@am__quote@
+66 -66
View File
@@ -22,18 +22,18 @@
your main control loop, etc. to force garbage collection. */
#ifdef HAVE_CONFIG_H
#include <config.h>
# include <config.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#if HAVE_STRING_H
# include <string.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#if HAVE_STDLIB_H
# include <stdlib.h>
#endif
#ifdef emacs
#include "blockinput.h"
# include "blockinput.h"
#endif
/* If compiling with GCC 2, this file's not needed. */
@@ -41,41 +41,41 @@
/* If someone has defined alloca as a macro,
there must be some other way alloca is supposed to work. */
#ifndef alloca
# ifndef alloca
#ifdef emacs
#ifdef static
# ifdef emacs
# ifdef static
/* actually, only want this if static is defined as ""
-- this is for usg, in which emacs must undefine static
in order to make unexec workable
*/
#ifndef STACK_DIRECTION
# ifndef STACK_DIRECTION
you
lose
-- must know STACK_DIRECTION at compile-time
#endif /* STACK_DIRECTION undefined */
#endif /* static */
#endif /* emacs */
# endif /* STACK_DIRECTION undefined */
# endif /* static */
# endif /* emacs */
/* If your stack is a linked list of frames, you have to
provide an "address metric" ADDRESS_FUNCTION macro. */
#if defined (CRAY) && defined (CRAY_STACKSEG_END)
# if defined (CRAY) && defined (CRAY_STACKSEG_END)
long i00afunc ();
#define ADDRESS_FUNCTION(arg) (char *) i00afunc (&(arg))
#else
#define ADDRESS_FUNCTION(arg) &(arg)
#endif
# define ADDRESS_FUNCTION(arg) (char *) i00afunc (&(arg))
# else
# define ADDRESS_FUNCTION(arg) &(arg)
# endif
#if __STDC__
# if __STDC__
typedef void *pointer;
#else
# else
typedef char *pointer;
#endif
# endif
#ifndef NULL
#define NULL 0
#endif
# ifndef NULL
# define NULL 0
# endif
/* Different portions of Emacs need to call different versions of
malloc. The Emacs executable needs alloca to call xmalloc, because
@@ -83,13 +83,14 @@ typedef char *pointer;
hand, the utilities in lib-src need alloca to call malloc; some of
them are very simple, and don't have an xmalloc routine.
Non-Emacs programs expect this to call use xmalloc.
Non-Emacs programs expect this to call xmalloc.
Callers below should use malloc. */
#ifndef emacs
#define malloc xmalloc
#endif
# ifndef emacs
# undef malloc
# define malloc xmalloc
# endif
extern pointer malloc ();
/* Define STACK_DIRECTION if you know the direction of stack
@@ -100,18 +101,18 @@ extern pointer malloc ();
STACK_DIRECTION < 0 => grows toward lower addresses
STACK_DIRECTION = 0 => direction of growth unknown */
#ifndef STACK_DIRECTION
#define STACK_DIRECTION 0 /* Direction unknown. */
#endif
# ifndef STACK_DIRECTION
# define STACK_DIRECTION 0 /* Direction unknown. */
# endif
#if STACK_DIRECTION != 0
# if STACK_DIRECTION != 0
#define STACK_DIR STACK_DIRECTION /* Known at compile-time. */
# define STACK_DIR STACK_DIRECTION /* Known at compile-time. */
#else /* STACK_DIRECTION == 0; need run-time code. */
# else /* STACK_DIRECTION == 0; need run-time code. */
static int stack_dir; /* 1 or -1 once known. */
#define STACK_DIR stack_dir
# define STACK_DIR stack_dir
static void
find_stack_direction ()
@@ -135,7 +136,7 @@ find_stack_direction ()
}
}
#endif /* STACK_DIRECTION == 0 */
# endif /* STACK_DIRECTION == 0 */
/* An "alloca header" is used to:
(a) chain together all alloca'ed blocks;
@@ -144,9 +145,9 @@ find_stack_direction ()
It is very important that sizeof(header) agree with malloc
alignment chunk size. The following default should work okay. */
#ifndef ALIGN_SIZE
#define ALIGN_SIZE sizeof(double)
#endif
# ifndef ALIGN_SIZE
# define ALIGN_SIZE sizeof(double)
# endif
typedef union hdr
{
@@ -168,16 +169,15 @@ static header *last_alloca_header = NULL; /* -> last alloca header. */
implementations of C, for example under Gould's UTX/32. */
pointer
alloca (size)
unsigned size;
alloca (size_t size)
{
auto char probe; /* Probes stack depth: */
register char *depth = ADDRESS_FUNCTION (probe);
#if STACK_DIRECTION == 0
# if STACK_DIRECTION == 0
if (STACK_DIR == 0) /* Unknown growth direction. */
find_stack_direction ();
#endif
# endif
/* Reclaim garbage, defined as all alloca'd storage that
was allocated from deeper in the stack than currently. */
@@ -185,9 +185,9 @@ alloca (size)
{
register header *hp; /* Traverses linked list. */
#ifdef emacs
# ifdef emacs
BLOCK_INPUT;
#endif
# endif
for (hp = last_alloca_header; hp != NULL;)
if ((STACK_DIR > 0 && hp->h.deep > depth)
@@ -204,9 +204,9 @@ alloca (size)
last_alloca_header = hp; /* -> last valid storage. */
#ifdef emacs
# ifdef emacs
UNBLOCK_INPUT;
#endif
# endif
}
if (size == 0)
@@ -232,15 +232,15 @@ alloca (size)
}
}
#if defined (CRAY) && defined (CRAY_STACKSEG_END)
# if defined (CRAY) && defined (CRAY_STACKSEG_END)
#ifdef DEBUG_I00AFUNC
#include <stdio.h>
#endif
# ifdef DEBUG_I00AFUNC
# include <stdio.h>
# endif
#ifndef CRAY_STACK
#define CRAY_STACK
#ifndef CRAY2
# ifndef CRAY_STACK
# define CRAY_STACK
# ifndef CRAY2
/* Stack structures for CRAY-1, CRAY X-MP, and CRAY Y-MP */
struct stack_control_header
{
@@ -292,7 +292,7 @@ struct stack_segment_linkage
long sss7;
};
#else /* CRAY2 */
# else /* CRAY2 */
/* The following structure defines the vector of words
returned by the STKSTAT library routine. */
struct stk_stat
@@ -345,10 +345,10 @@ struct stk_trailer
long unknown14;
};
#endif /* CRAY2 */
#endif /* not CRAY_STACK */
# endif /* CRAY2 */
# endif /* not CRAY_STACK */
#ifdef CRAY2
# ifdef CRAY2
/* Determine a "stack measure" for an arbitrary ADDRESS.
I doubt that "lint" will like this much. */
@@ -419,7 +419,7 @@ i00afunc (long *address)
return (result);
}
#else /* not CRAY2 */
# else /* not CRAY2 */
/* Stack address function for a CRAY-1, CRAY X-MP, or CRAY Y-MP.
Determine the number of the cell within the stack,
given the address of the cell. The purpose of this
@@ -464,9 +464,9 @@ i00afunc (long address)
while (!(this_segment <= address && address <= stkl))
{
#ifdef DEBUG_I00AFUNC
# ifdef DEBUG_I00AFUNC
fprintf (stderr, "%011o %011o %011o\n", this_segment, address, stkl);
#endif
# endif
if (pseg == 0)
break;
stkl = stkl - pseg;
@@ -485,9 +485,9 @@ i00afunc (long address)
while (pseg != 0)
{
#ifdef DEBUG_I00AFUNC
# ifdef DEBUG_I00AFUNC
fprintf (stderr, "%011o %011o\n", pseg, size);
#endif
# endif
stkl = stkl - pseg;
ssptr = (struct stack_segment_linkage *) stkl;
size = ssptr->sssize;
@@ -497,8 +497,8 @@ i00afunc (long address)
return (result);
}
#endif /* not CRAY2 */
#endif /* CRAY */
# endif /* not CRAY2 */
# endif /* CRAY */
#endif /* no alloca */
# endif /* no alloca */
#endif /* not GCC version 2 */
+1 -2
View File
@@ -1,6 +1,5 @@
ChangeLog
Makefile
Makefile.in
Makefile Makefile.in
POTFILES
bison.pot
stamp-cat-id
-25
View File
@@ -1,28 +1,3 @@
2001-11-02 gettextize <[email protected]>
* Makefile.in.in: Upgrade to gettext-0.10.40.
2001-11-02 gettextize <[email protected]>
* Makefile.in.in: Upgrade to gettext-0.10.40.
2001-11-02 gettextize <[email protected]>
* Makefile.in.in: Upgrade to gettext-0.10.40.
2001-10-10 gettextize <[email protected]>
* Makefile.in.in: Upgrade to gettext-0.10.40.
2001-10-10 gettextize <[email protected]>
* Makefile.in.in: Upgrade to gettext-0.10.40.
2001-10-09 gettextize <[email protected]>
* Makefile.in.in: Upgrade to gettext-0.10.40.
* cat-id-tbl.c: Remove file.
2001-09-27 gettextize <[email protected]>
* Makefile.in.in: Upgrade to gettext-0.10.40.
-2
View File
@@ -1,13 +1,11 @@
src/LR0.c
src/complain.c
src/conflicts.c
src/derives.c
src/files.c
src/getargs.c
src/lalr.c
src/lex.c
src/main.c
src/nullable.c
src/output.c
src/print.c
src/print_graph.c
BIN
View File
Binary file not shown.
+129 -125
View File
@@ -5,7 +5,7 @@
msgid ""
msgstr ""
"Project-Id-Version: bison 1.25\n"
"POT-Creation-Date: 2001-11-12 10:34+0100\n"
"POT-Creation-Date: 2001-11-26 16:23+0100\n"
"PO-Revision-Date: 1996-10-10 17:54 MET DST\n"
"Last-Translator: Ulrich Drepper <[email protected]>\n"
"Language-Team: German <[email protected]>\n"
@@ -13,7 +13,7 @@ msgstr ""
"Content-Type: text/plain; charset=ISO-8859-1\n"
"Content-Transfer-Encoding: 8-bit\n"
#: src/LR0.c:207
#: src/LR0.c:189
#, c-format
msgid "too many states (max %d)"
msgstr ""
@@ -26,7 +26,7 @@ msgstr ""
msgid "warning: "
msgstr ""
#: src/complain.c:238 src/complain.c:279
#: src/complain.c:238
#, fuzzy
msgid "fatal error: "
msgstr "fataler Fehler: %s\n"
@@ -48,61 +48,61 @@ msgstr "durch Schieben gel
msgid "an error"
msgstr "als Fehler betrachtet"
#: src/conflicts.c:411
#: src/conflicts.c:389
#, fuzzy, c-format
msgid "%d shift/reduce conflict"
msgid_plural "%d shift/reduce conflicts"
msgstr[0] " %d Schiebe/Reduziere Konflikte"
#: src/conflicts.c:418
#: src/conflicts.c:396
#, fuzzy
msgid "and"
msgstr " und"
#: src/conflicts.c:424
#: src/conflicts.c:402
#, fuzzy, c-format
msgid "%d reduce/reduce conflict"
msgid_plural "%d reduce/reduce conflicts"
msgstr[0] " %d Reduziere/Reduziere Konflikte"
#: src/conflicts.c:448
#: src/conflicts.c:426
#, fuzzy, c-format
msgid "State %d contains "
msgstr "Zustand %d enthält"
#. If invoked with `--yacc', use the output format specified by
#. POSIX.
#: src/conflicts.c:481
#: src/conflicts.c:470
msgid "conflicts: "
msgstr "Konflikte: "
#: src/conflicts.c:483
#: src/conflicts.c:472
#, c-format
msgid " %d shift/reduce"
msgstr " %d Schiebe/Reduziere"
#: src/conflicts.c:487
#: src/conflicts.c:476
#, c-format
msgid " %d reduce/reduce"
msgstr " %d Reduziere/Reduziere"
#: src/conflicts.c:492 src/reduce.c:497
#: src/conflicts.c:481 src/reduce.c:493
#, c-format
msgid "%s contains "
msgstr "%s enthält "
#: src/conflicts.c:500
#: src/conflicts.c:488
#, fuzzy, c-format
msgid "expected %d shift/reduce conflict"
msgid_plural "expected %d shift/reduce conflicts"
msgid "expected %d shift/reduce conflict\n"
msgid_plural "expected %d shift/reduce conflicts\n"
msgstr[0] " %d Schiebe/Reduziere Konflikte"
#: src/conflicts.c:587 src/conflicts.c:707
#: src/conflicts.c:575 src/conflicts.c:696
#, c-format
msgid " %-4s\t[reduce using rule %d (%s)]\n"
msgstr " %-4s\t[reduziere mit Regel %d (%s)]\n"
#: src/conflicts.c:598 src/print.c:171
#: src/conflicts.c:587 src/print.c:156
#, c-format
msgid ""
" $default\treduce using rule %d (%s)\n"
@@ -111,25 +111,16 @@ msgstr ""
" $default\treduziere mit Regel %d (%s)\n"
"\n"
#: src/conflicts.c:687 src/conflicts.c:701
#: src/conflicts.c:676 src/conflicts.c:690
#, c-format
msgid " %-4s\treduce using rule %d (%s)\n"
msgstr " %-4s\treduziere mit Tegel %d (%s)\n"
#: src/conflicts.c:727
#: src/conflicts.c:716
#, c-format
msgid " $default\treduce using rule %d (%s)\n"
msgstr " $default\treduziere mit Regel %d (%s)\n"
#: src/derives.c:43
msgid "DERIVES"
msgstr ""
#: src/derives.c:48
#, c-format
msgid "%s derives"
msgstr "%s leitet ab"
#: src/files.c:143
#, c-format
msgid "cannot open file `%s'"
@@ -209,7 +200,7 @@ msgid ""
"warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n"
msgstr ""
#: src/getargs.c:215 src/lex.c:693
#: src/getargs.c:215 src/lex.c:694
#, c-format
msgid "`%s' is no longer supported"
msgstr ""
@@ -229,7 +220,7 @@ msgstr "%s: keine Grammatik-Datei angegeben\n"
msgid "%s: extra arguments ignored after `%s'\n"
msgstr "%s: zusätzliche Argumente nach »%s« werden ignoriert\n"
#: src/lalr.c:311
#: src/lalr.c:293
#, c-format
msgid "too many gotos (max %d)"
msgstr ""
@@ -238,7 +229,7 @@ msgstr ""
msgid "unexpected `/' found and ignored"
msgstr "»/« wird hier nicht erwartet und wird deshalb ignoriert"
#: src/lex.c:105 src/reader.c:269
#: src/lex.c:105 src/reader.c:280
msgid "unterminated comment"
msgstr "unbeendeter Kommentar"
@@ -279,69 +270,65 @@ msgstr "unerwarteter Typname"
msgid "use \"...\" for multi-character literal tokens"
msgstr "für Literal mit mehreren Zeichen bitte \"...\" verwenden"
#: src/lex.c:666
#: src/lex.c:667
#, c-format
msgid "`%s' supports no argument: %s"
msgstr ""
#: src/lex.c:682
#: src/lex.c:683
#, fuzzy, c-format
msgid "`%s' requires an argument"
msgstr "%s: die Option »%s« erfordert ein Argument\n"
#: src/main.c:128
#: src/main.c:134
#, fuzzy, c-format
msgid "%s: internal error: %s\n"
msgstr "interner Fehler, %s\n"
#: src/nullable.c:51
msgid "Entering set_nullable"
msgstr "Führe »set_nullable« aus"
#: src/output.c:986
#: src/output.c:979
#, fuzzy, c-format
msgid "maximum table size (%d) exceeded"
msgstr "maximale Tabellengröße (%s) überschritten"
#: src/print.c:37
#: src/print.c:38
#, c-format
msgid " type %d is %s\n"
msgstr " Typ %d ist %s\n"
#: src/print.c:85
#: src/print.c:78
#, c-format
msgid " (rule %d)"
msgstr " (Regel %d)"
#: src/print.c:111
#: src/print.c:98
msgid " $default\taccept\n"
msgstr " $default\takzeptiere\n"
#: src/print.c:113
#: src/print.c:100
msgid " NO ACTIONS\n"
msgstr " KEINE AKTIONEN\n"
#: src/print.c:132
#: src/print.c:120
#, c-format
msgid " $ \tgo to state %d\n"
msgstr " $ \tgehe zu Zustand %d über\n"
#: src/print.c:135
#: src/print.c:123
#, c-format
msgid " %-4s\tshift, and go to state %d\n"
msgstr " %-4s\tSchiebe und gehe zu Zustand %d über\n"
#: src/print.c:159
#: src/print.c:144
#, c-format
msgid " %-4s\terror (nonassociative)\n"
msgstr " %-4s\tFehler (nicht assoziativ)\n"
#: src/print.c:187
#: src/print.c:173
#, c-format
msgid " %-4s\tgo to state %d\n"
msgstr " %-4s\tgehe zu Zustand %d über\n"
#: src/print.c:199
#: src/print.c:185
#, fuzzy, c-format
msgid "state %d"
msgstr ""
@@ -351,24 +338,28 @@ msgstr ""
"\n"
#. rule # : LHS -> RHS
#: src/print.c:229
#: src/print.c:215
#, fuzzy
msgid "Grammar"
msgstr ""
"\n"
"Grammatik\n"
#: src/print.c:234
#, c-format
msgid "rule %-4d %s ->"
#: src/print.c:216
msgid "Number, Line, Rule"
msgstr ""
#: src/print.c:221
#, fuzzy, c-format
msgid " %3d %3d %s ->"
msgstr "Regel %-4d %s ->"
#: src/print.c:240
#: src/print.c:228
msgid "empty"
msgstr ""
#. TERMINAL (type #) : rule #s terminal is on RHS
#: src/print.c:245
#: src/print.c:233
#, fuzzy
msgid "Terminals, with rules where they appear"
msgstr ""
@@ -376,7 +367,7 @@ msgstr ""
"Terminale und die Regeln un denen sie verwendet werden\n"
"\n"
#: src/print.c:269
#: src/print.c:257
#, fuzzy
msgid "Nonterminals, with rules where they appear"
msgstr ""
@@ -384,259 +375,268 @@ msgstr ""
"Nicht-Terminal und die Regeln in denen sie verwendet werden\n"
"\n"
#: src/print.c:295
#: src/print.c:283
msgid " on left:"
msgstr " auf der linken Seite:"
#: src/print.c:310
#: src/print.c:298
msgid " on right:"
msgstr " auf der rechten Seite:"
#: src/print_graph.c:174
#. If something has been added in the NODE_OBSTACK after
#. the declaration of the label, then we need a `\n'.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:165
#, fuzzy, c-format
msgid "%-4s\terror (nonassociative)"
msgstr " %-4s\tFehler (nicht assoziativ)\n"
#: src/print_graph.c:187
#.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:180
#, fuzzy, c-format
msgid "$default\treduce using rule %d (%s)"
msgstr " $default\treduziere mit Regel %d (%s)\n"
#: src/reader.c:78
#: src/reader.c:89
msgid " Skipping to next \\n"
msgstr " Überspringe Zeichen bis zum nächsten \\n"
#: src/reader.c:80
#: src/reader.c:91
#, c-format
msgid " Skipping to next %c"
msgstr " Überspringe Zeichen bis zum nächten %c"
#: src/reader.c:131 src/reader.c:143
#: src/reader.c:142 src/reader.c:154
msgid "invalid $ value"
msgstr "unzulässiger $ Wert"
#: src/reader.c:169 src/reader.c:184
#: src/reader.c:180 src/reader.c:195
msgid "unterminated string at end of file"
msgstr "unbeendete Zeichenkette am Ende der Datei"
#: src/reader.c:172
#: src/reader.c:183
msgid "unterminated string"
msgstr "unbeendete Zeichenkette"
#: src/reader.c:325 src/reader.c:389
#: src/reader.c:336 src/reader.c:400
#, fuzzy, c-format
msgid "%s is invalid"
msgstr "@%s ist unzulässig"
#: src/reader.c:365
#: src/reader.c:376
#, c-format
msgid "$$ of `%s' has no declared type"
msgstr "$$ von »%s« hat keine deklarierten Wert"
#: src/reader.c:382
#: src/reader.c:393
#, fuzzy, c-format
msgid "$%d of `%s' has no declared type"
msgstr "»%s« von »%s« hat keine deklarierten Wert"
#: src/reader.c:436
#: src/reader.c:447
msgid "unterminated `%{' definition"
msgstr "unbeendete »%{« Definition"
#: src/reader.c:481 src/reader.c:595 src/reader.c:645
#: src/reader.c:492 src/reader.c:607 src/reader.c:657
#, c-format
msgid "Premature EOF after %s"
msgstr ""
#: src/reader.c:498
#: src/reader.c:509
#, c-format
msgid "symbol `%s' used more than once as a literal string"
msgstr ""
#: src/reader.c:501
#: src/reader.c:512
#, c-format
msgid "symbol `%s' given more than one literal string"
msgstr ""
#: src/reader.c:522 src/reader.c:664
#: src/reader.c:533 src/reader.c:676
#, c-format
msgid "symbol %s redefined"
msgstr "Symbol %s noch einmal definiert"
#: src/reader.c:532 src/reader.c:610 src/reader.c:671 src/reader.c:1294
#: src/reader.c:543 src/reader.c:622 src/reader.c:683 src/reader.c:1292
#, c-format
msgid "type redeclaration for %s"
msgstr "erneute Deklaration des Typs für %s"
#: src/reader.c:541
#: src/reader.c:552
#, c-format
msgid "`%s' is invalid in %s"
msgstr "»%s« ist in %s nicht erlaubt"
#: src/reader.c:558 src/reader.c:723
#: src/reader.c:570 src/reader.c:735
#, fuzzy, c-format
msgid "multiple %s declarations"
msgstr "mehr als eine %start Deklaration"
#: src/reader.c:560 src/reader.c:902 src/reader.c:927 src/reader.c:1272
#: src/reader.c:572 src/reader.c:914 src/reader.c:939 src/reader.c:1270
#, fuzzy, c-format
msgid "invalid %s declaration"
msgstr "ungültige %start Deklaration"
#: src/reader.c:580
#: src/reader.c:592
msgid "%type declaration has no <typename>"
msgstr "%type Deklaration hat keinen <Typ-Namen>"
#: src/reader.c:615
#: src/reader.c:627
#, fuzzy, c-format
msgid "invalid %%type declaration due to item: %s"
msgstr "ungültige %%type Deklaration wegen »%s«"
#: src/reader.c:660
#: src/reader.c:672
#, c-format
msgid "redefining precedence of %s"
msgstr "Stellenwertigkeit von %s wird erneut definiert"
#: src/reader.c:683
#: src/reader.c:695
#, c-format
msgid "invalid text (%s) - number should be after identifier"
msgstr "unzulässiger Text (%s) - Nummer sollte nach Bezeichner kommen"
#: src/reader.c:693
#: src/reader.c:705
#, c-format
msgid "unexpected item: %s"
msgstr "unerwartetes Symbol: %s"
#: src/reader.c:766 src/reader.c:1098 src/reader.c:1169
#: src/reader.c:778 src/reader.c:1110 src/reader.c:1181
#, fuzzy, c-format
msgid "unmatched %s"
msgstr "»{« hat kein Gegenstück"
#: src/reader.c:798
#: src/reader.c:810
#, fuzzy, c-format
msgid "argument of %%expect is not an integer"
msgstr "Argument von %expect ist keine ganze Zahl"
#: src/reader.c:844
#: src/reader.c:856
#, c-format
msgid "unrecognized item %s, expected an identifier"
msgstr "unerwartetes Symbol %s, hier wird ein Bezeichner erwartet"
#: src/reader.c:866
#: src/reader.c:878
#, c-format
msgid "expected string constant instead of %s"
msgstr "hier wird eine Zeichenkette erwartet, nicht %s"
#: src/reader.c:1014
#: src/reader.c:1026
#, c-format
msgid "unrecognized: %s"
msgstr "unbekannt: %s"
#: src/reader.c:1019
#: src/reader.c:1031
msgid "no input grammar"
msgstr "keine Eingabe-Grammatik"
#: src/reader.c:1024
#: src/reader.c:1036
#, c-format
msgid "unknown character: %s"
msgstr "unbekanntes Zeichen: %s"
#: src/reader.c:1192
#: src/reader.c:1204
#, fuzzy, c-format
msgid "unterminated %guard clause"
msgstr "unbeendeter %%guard Fall"
#: src/reader.c:1359
#: src/reader.c:1357
msgid "ill-formed rule: initial symbol not followed by colon"
msgstr ""
"falsch geformte Regel: führendes Symbol wird nicht von einem Semikolon "
"gefolgt"
#: src/reader.c:1366
#: src/reader.c:1364
msgid "grammar starts with vertical bar"
msgstr "Grammatik fängt mit einem vertikalen Strich (»|«) an"
#: src/reader.c:1397
#: src/reader.c:1392
#, c-format
msgid "rule given for %s, which is a token"
msgstr "Regel für %s vorhanden, welches aber ein Token ist"
#: src/reader.c:1499
#: src/reader.c:1492
msgid "two @prec's in a row"
msgstr "zwei @prec Anweisungen nacheinander"
#: src/reader.c:1507
#: src/reader.c:1500
#, c-format
msgid "%%guard present but %%semantic_parser not specified"
msgstr ""
"%%guard Anweisung vorhanden, jedoch wird %%semantic_parser nicht angegeben"
#: src/reader.c:1516
#: src/reader.c:1509
msgid "two actions at end of one rule"
msgstr "Zwei Aktionen am Ende einer Regel"
#: src/reader.c:1530
#: src/reader.c:1523
#, c-format
msgid "type clash (`%s' `%s') on default action"
msgstr "Typkonflikt (»%s« »%s«) bei Default Aktion"
#: src/reader.c:1536
#: src/reader.c:1529
msgid "empty rule for typed nonterminal, and no action"
msgstr "leere Regel für Nicht-Terminal vmit Typ und keine Aktion"
#: src/reader.c:1580
#: src/reader.c:1573
#, c-format
msgid "invalid input: %s"
msgstr "ungültige Eingabe: %s"
#: src/reader.c:1588
#: src/reader.c:1581
#, fuzzy, c-format
msgid "too many symbols (tokens plus nonterminals); maximum %d"
msgstr "zu viele Symbols (Token plus Nicht-Terminal); Maximum %s"
#: src/reader.c:1591
#: src/reader.c:1584
msgid "no rules in the input grammar"
msgstr "Eingabegrammatik enthält keine Regeln"
#: src/reader.c:1615
#: src/reader.c:1608
#, c-format
msgid "symbol %s is used, but is not defined as a token and has no rules"
msgstr ""
"Symbol %s wird benutzt, ist aber nicht als Token definiert und hat keine "
"Regel"
#: src/reader.c:1707
#: src/reader.c:1743
#, fuzzy, c-format
msgid "tokens %s and %s both assigned number %d"
msgstr "Token %s und %s haben die selbe nummer %s"
#: src/reader.c:1760
#: src/reader.c:1796
#, c-format
msgid "conflicting precedences for %s and %s"
msgstr "Vorrangwertigkeiten für %s und %s widersprechen sich"
#: src/reader.c:1772
#: src/reader.c:1808
#, c-format
msgid "conflicting assoc values for %s and %s"
msgstr "assoc Werte für %s nd %s widersprechen sich"
#: src/reader.c:1811
#: src/reader.c:1847
#, c-format
msgid "the start symbol %s is undefined"
msgstr "das Startsymbol %s ist undefiniert"
#: src/reader.c:1813
#: src/reader.c:1849
#, c-format
msgid "the start symbol %s is a token"
msgstr "das Startsymbol %s ist ein Token"
#: src/reduce.c:405
#: src/reduce.c:400
#, fuzzy
msgid "Useless nonterminals:"
msgstr ""
"Nutzlose Nicht-Terminale:\n"
"\n"
#: src/reduce.c:419
#: src/reduce.c:414
#, fuzzy
msgid "Terminals which are not used:"
msgstr ""
@@ -645,7 +645,7 @@ msgstr ""
"Nicht genutzte Terminale:\n"
"\n"
#: src/reduce.c:430
#: src/reduce.c:425
#, fuzzy
msgid "Useless rules:"
msgstr ""
@@ -654,7 +654,7 @@ msgstr ""
"Ungenutzte Regeln:\n"
"\n"
#: src/reduce.c:458
#: src/reduce.c:451
msgid ""
"Variables\n"
"---------\n"
@@ -664,11 +664,11 @@ msgstr ""
"---------\n"
"\n"
#: src/reduce.c:459
#: src/reduce.c:452
msgid "Value Sprec Sassoc Tag\n"
msgstr "Wert Sprec Sassoc Tag\n"
#: src/reduce.c:463
#: src/reduce.c:456
msgid ""
"Rules\n"
"-----\n"
@@ -678,7 +678,7 @@ msgstr ""
"------\n"
"\n"
#: src/reduce.c:473
#: src/reduce.c:470
msgid ""
"Rules interpreted\n"
"-----------------\n"
@@ -688,38 +688,30 @@ msgstr ""
"----------------------\n"
"\n"
#: src/reduce.c:495
#: src/reduce.c:491
#, c-format
msgid "%d rules never reduced\n"
msgstr "%d wurde niemals reduziert\n"
#: src/reduce.c:501
#: src/reduce.c:497
#, c-format
msgid "%d useless nonterminal%s"
msgstr "%d ungenutzte Nicht-Terminal"
#: src/reduce.c:506
#: src/reduce.c:502
msgid " and "
msgstr " und "
#: src/reduce.c:510
#: src/reduce.c:506
#, c-format
msgid "%d useless rule%s"
msgstr "%d ungenutzte Regel"
#: src/reduce.c:540
#: src/reduce.c:536
#, c-format
msgid "Start symbol %s does not derive any sentence"
msgstr "es lassen sich keine Sätze vom Startsymbol %s ableiten"
#: src/reduce.c:553
#, c-format
msgid ""
"reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
msgstr ""
"Reduzierung von %s definiert %d Terminal, %d Nicht-Terminal und %d "
"Produktionen.\n"
#: lib/getopt.c:694
#, c-format
msgid "%s: option `%s' is ambiguous\n"
@@ -817,6 +809,9 @@ msgstr ""
#~ msgid "%s contains"
#~ msgstr "%s enthält"
#~ msgid "%s derives"
#~ msgstr "%s leitet ab"
#~ msgid ""
#~ "Usage: %s [-dhklntvyV] [-b file-prefix] [-o outfile] [-p name-prefix]\n"
#~ " [--debug] [--defines] [--fixed-output-files] [--no-lines]\n"
@@ -848,6 +843,9 @@ msgstr ""
#~ msgid "limit of %d exceeded, too many %s"
#~ msgstr "Grenze von %d erreicht, zu viele %s"
#~ msgid "Entering set_nullable"
#~ msgstr "Führe »set_nullable« aus"
#~ msgid "\t\t/* empty */"
#~ msgstr "\t\t/* leer */"
@@ -874,3 +872,9 @@ msgstr ""
#~ msgid "ill-formed %type declaration"
#~ msgstr "falsch geformte %type Deklaration"
#~ msgid ""
#~ "reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
#~ msgstr ""
#~ "Reduzierung von %s definiert %d Terminal, %d Nicht-Terminal und %d "
#~ "Produktionen.\n"
BIN
View File
Binary file not shown.
+153 -142
View File
@@ -30,7 +30,7 @@
msgid ""
msgstr ""
"Project-Id-Version: GNU bison 1.25\n"
"POT-Creation-Date: 2001-11-12 10:34+0100\n"
"POT-Creation-Date: 2001-11-26 16:23+0100\n"
"PO-Revision-Date: 1998-09-21 10:19+0200\n"
"Last-Translator: Nicolás García-Pedrajas <[email protected]>\n"
"Language-Team: Spanish <[email protected]>\n"
@@ -38,7 +38,7 @@ msgstr ""
"Content-Type: text/plain; charset=ISO-8859-1\n"
"Content-Transfer-Encoding: 8-bit\n"
#: src/LR0.c:207
#: src/LR0.c:189
#, c-format
msgid "too many states (max %d)"
msgstr ""
@@ -58,7 +58,7 @@ msgstr ""
# La verdad es que a mi lo de error fatal me suena fatal
# ngp
#
#: src/complain.c:238 src/complain.c:279
#: src/complain.c:238
#, fuzzy
msgid "fatal error: "
msgstr "error grave: %s\n"
@@ -82,31 +82,31 @@ msgstr "desplaza"
msgid "an error"
msgstr "un error"
#: src/conflicts.c:411
#: src/conflicts.c:389
#, fuzzy, c-format
msgid "%d shift/reduce conflict"
msgid_plural "%d shift/reduce conflicts"
msgstr[0] " %d conflictos desplazamiento/reducción"
#: src/conflicts.c:418
#: src/conflicts.c:396
#, fuzzy
msgid "and"
msgstr " y"
#: src/conflicts.c:424
#: src/conflicts.c:402
#, fuzzy, c-format
msgid "%d reduce/reduce conflict"
msgid_plural "%d reduce/reduce conflicts"
msgstr[0] " %d conflictos reducción/reducción"
#: src/conflicts.c:448
#: src/conflicts.c:426
#, fuzzy, c-format
msgid "State %d contains "
msgstr "El estado %d contiene"
#. If invoked with `--yacc', use the output format specified by
#. POSIX.
#: src/conflicts.c:481
#: src/conflicts.c:470
msgid "conflicts: "
msgstr "conflictos: "
@@ -122,7 +122,7 @@ msgstr "conflictos: "
# ok
# ngp
#
#: src/conflicts.c:483
#: src/conflicts.c:472
#, c-format
msgid " %d shift/reduce"
msgstr " %d desplazamiento(s)/reducción(ones)"
@@ -139,28 +139,28 @@ msgstr " %d desplazamiento(s)/reducci
#
# ok
# ngp
#: src/conflicts.c:487
#: src/conflicts.c:476
#, c-format
msgid " %d reduce/reduce"
msgstr " %d reducción(ones)/reducción(ones)"
#: src/conflicts.c:492 src/reduce.c:497
#: src/conflicts.c:481 src/reduce.c:493
#, c-format
msgid "%s contains "
msgstr "%s contiene "
#: src/conflicts.c:500
#: src/conflicts.c:488
#, fuzzy, c-format
msgid "expected %d shift/reduce conflict"
msgid_plural "expected %d shift/reduce conflicts"
msgid "expected %d shift/reduce conflict\n"
msgid_plural "expected %d shift/reduce conflicts\n"
msgstr[0] " %d conflictos desplazamiento/reducción"
#: src/conflicts.c:587 src/conflicts.c:707
#: src/conflicts.c:575 src/conflicts.c:696
#, c-format
msgid " %-4s\t[reduce using rule %d (%s)]\n"
msgstr " %-4s\t[reduce usando la regla %d (%s)]\n"
#: src/conflicts.c:598 src/print.c:171
#: src/conflicts.c:587 src/print.c:156
#, c-format
msgid ""
" $default\treduce using rule %d (%s)\n"
@@ -169,30 +169,16 @@ msgstr ""
" $default\treduce usando la regla %d (%s)\n"
"\n"
#: src/conflicts.c:687 src/conflicts.c:701
#: src/conflicts.c:676 src/conflicts.c:690
#, c-format
msgid " %-4s\treduce using rule %d (%s)\n"
msgstr " %-4s\treduce usando la regla %d (%s)\n"
#: src/conflicts.c:727
#: src/conflicts.c:716
#, c-format
msgid " $default\treduce using rule %d (%s)\n"
msgstr " $default\treduce usando la regla %d (%s)\n"
#: src/derives.c:43
#, fuzzy
msgid "DERIVES"
msgstr ""
"\n"
"\n"
"\n"
"DERIVACIONES\n"
#: src/derives.c:48
#, c-format
msgid "%s derives"
msgstr "%s deriva"
#: src/files.c:143
#, c-format
msgid "cannot open file `%s'"
@@ -272,7 +258,7 @@ msgid ""
"warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n"
msgstr ""
#: src/getargs.c:215 src/lex.c:693
#: src/getargs.c:215 src/lex.c:694
#, c-format
msgid "`%s' is no longer supported"
msgstr ""
@@ -295,7 +281,7 @@ msgstr "%s: no se ha especificado ning
msgid "%s: extra arguments ignored after `%s'\n"
msgstr "%s: los argumentos extra después de '%s' no se tendrán en cuenta\n"
#: src/lalr.c:311
#: src/lalr.c:293
#, c-format
msgid "too many gotos (max %d)"
msgstr ""
@@ -305,7 +291,7 @@ msgstr ""
msgid "unexpected `/' found and ignored"
msgstr "se ha encontrado `/' cuando no se esperaba, no se tendrán en cuenta"
#: src/lex.c:105 src/reader.c:269
#: src/lex.c:105 src/reader.c:280
msgid "unterminated comment"
msgstr "comentario sin terminar"
@@ -347,74 +333,70 @@ msgstr "nombre de tipo sin terminar"
msgid "use \"...\" for multi-character literal tokens"
msgstr "use \"...\" para terminales literales multicarácter"
#: src/lex.c:666
#: src/lex.c:667
#, c-format
msgid "`%s' supports no argument: %s"
msgstr ""
#: src/lex.c:682
#: src/lex.c:683
#, fuzzy, c-format
msgid "`%s' requires an argument"
msgstr "%s: la opción `%s' requiere un argumento\n"
#: src/main.c:128
#: src/main.c:134
#, fuzzy, c-format
msgid "%s: internal error: %s\n"
msgstr "error interno, %s\n"
#: src/nullable.c:51
msgid "Entering set_nullable"
msgstr "Entrando set_nullable"
# Únicamente cambio la posición del adjetivo `máximo'. En vez de después
# de `tabla', después de `tamaño' - cll
# en inglés era así, pero quizás en español sea mejor como dices
# ngp
#
#: src/output.c:986
#: src/output.c:979
#, fuzzy, c-format
msgid "maximum table size (%d) exceeded"
msgstr "excedido el tamaño máximo de la tabla (%s)"
#: src/print.c:37
#: src/print.c:38
#, c-format
msgid " type %d is %s\n"
msgstr " el tipo %d es %s\n"
#: src/print.c:85
#: src/print.c:78
#, c-format
msgid " (rule %d)"
msgstr " (regla %d)"
#: src/print.c:111
#: src/print.c:98
msgid " $default\taccept\n"
msgstr " $default\taceptar\n"
#: src/print.c:113
#: src/print.c:100
msgid " NO ACTIONS\n"
msgstr " SIN ACCIONES\n"
#: src/print.c:132
#: src/print.c:120
#, c-format
msgid " $ \tgo to state %d\n"
msgstr " $ \tir al estado %d\n"
#: src/print.c:135
#: src/print.c:123
#, c-format
msgid " %-4s\tshift, and go to state %d\n"
msgstr " %-4s\tdesplazar e ir al estado %d\n"
#: src/print.c:159
#: src/print.c:144
#, c-format
msgid " %-4s\terror (nonassociative)\n"
msgstr " %-4s\terror (no asociativo)\n"
#: src/print.c:187
#: src/print.c:173
#, c-format
msgid " %-4s\tgo to state %d\n"
msgstr " %-4s\tir al estado %d\n"
#: src/print.c:199
#: src/print.c:185
#, fuzzy, c-format
msgid "state %d"
msgstr ""
@@ -424,24 +406,28 @@ msgstr ""
"\n"
#. rule # : LHS -> RHS
#: src/print.c:229
#: src/print.c:215
#, fuzzy
msgid "Grammar"
msgstr ""
"\n"
"Gramática\n"
#: src/print.c:234
#, c-format
msgid "rule %-4d %s ->"
#: src/print.c:216
msgid "Number, Line, Rule"
msgstr ""
#: src/print.c:221
#, fuzzy, c-format
msgid " %3d %3d %s ->"
msgstr "regla %-4d %s ->"
#: src/print.c:240
#: src/print.c:228
msgid "empty"
msgstr ""
#. TERMINAL (type #) : rule #s terminal is on RHS
#: src/print.c:245
#: src/print.c:233
#, fuzzy
msgid "Terminals, with rules where they appear"
msgstr ""
@@ -449,121 +435,130 @@ msgstr ""
"Terminales con las reglas donde aparecen\n"
"\n"
#: src/print.c:269
#: src/print.c:257
#, fuzzy
msgid "Nonterminals, with rules where they appear"
msgstr ""
"\n"
"No terminales con las reglas donde aparecen\n"
#: src/print.c:295
#: src/print.c:283
msgid " on left:"
msgstr " en la izquierda:"
#: src/print.c:310
#: src/print.c:298
msgid " on right:"
msgstr " en la derecha:"
#: src/print_graph.c:174
#. If something has been added in the NODE_OBSTACK after
#. the declaration of the label, then we need a `\n'.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:165
#, fuzzy, c-format
msgid "%-4s\terror (nonassociative)"
msgstr " %-4s\terror (no asociativo)\n"
#: src/print_graph.c:187
#.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:180
#, fuzzy, c-format
msgid "$default\treduce using rule %d (%s)"
msgstr " $default\treduce usando la regla %d (%s)\n"
#: src/reader.c:78
#: src/reader.c:89
msgid " Skipping to next \\n"
msgstr " Saltando al siguiente \\n"
#: src/reader.c:80
#: src/reader.c:91
#, c-format
msgid " Skipping to next %c"
msgstr " Saltando al siguiente %c"
#: src/reader.c:131 src/reader.c:143
#: src/reader.c:142 src/reader.c:154
msgid "invalid $ value"
msgstr "valor $ no válido"
#: src/reader.c:169 src/reader.c:184
#: src/reader.c:180 src/reader.c:195
msgid "unterminated string at end of file"
msgstr "cadena sin terminar al final del fichero"
#: src/reader.c:172
#: src/reader.c:183
msgid "unterminated string"
msgstr "cadena sin terminar"
#: src/reader.c:325 src/reader.c:389
#: src/reader.c:336 src/reader.c:400
#, fuzzy, c-format
msgid "%s is invalid"
msgstr "@%s no es válido"
#: src/reader.c:365
#: src/reader.c:376
#, c-format
msgid "$$ of `%s' has no declared type"
msgstr "$$ de `%s' no tiene tipo declarado"
#: src/reader.c:382
#: src/reader.c:393
#, fuzzy, c-format
msgid "$%d of `%s' has no declared type"
msgstr "$%s de `%s' no tiene tipo declarado"
#: src/reader.c:436
#: src/reader.c:447
msgid "unterminated `%{' definition"
msgstr "definición `%{' sin terminar"
#: src/reader.c:481 src/reader.c:595 src/reader.c:645
#: src/reader.c:492 src/reader.c:607 src/reader.c:657
#, c-format
msgid "Premature EOF after %s"
msgstr ""
#: src/reader.c:498
#: src/reader.c:509
#, c-format
msgid "symbol `%s' used more than once as a literal string"
msgstr ""
#: src/reader.c:501
#: src/reader.c:512
#, c-format
msgid "symbol `%s' given more than one literal string"
msgstr ""
#: src/reader.c:522 src/reader.c:664
#: src/reader.c:533 src/reader.c:676
#, c-format
msgid "symbol %s redefined"
msgstr "redefinido el símbolo %s"
#: src/reader.c:532 src/reader.c:610 src/reader.c:671 src/reader.c:1294
#: src/reader.c:543 src/reader.c:622 src/reader.c:683 src/reader.c:1292
#, c-format
msgid "type redeclaration for %s"
msgstr "redeclaración del tipo de %s"
#: src/reader.c:541
#: src/reader.c:552
#, c-format
msgid "`%s' is invalid in %s"
msgstr "`%s' no es válido en %s"
#: src/reader.c:558 src/reader.c:723
#: src/reader.c:570 src/reader.c:735
#, fuzzy, c-format
msgid "multiple %s declarations"
msgstr "múltiples declaraciones de %start"
#: src/reader.c:560 src/reader.c:902 src/reader.c:927 src/reader.c:1272
#: src/reader.c:572 src/reader.c:914 src/reader.c:939 src/reader.c:1270
#, fuzzy, c-format
msgid "invalid %s declaration"
msgstr "declaración de %start no válida"
#: src/reader.c:580
#: src/reader.c:592
msgid "%type declaration has no <typename>"
msgstr "la declaración %type no tiene <nombre-tipo>"
#: src/reader.c:615
#: src/reader.c:627
#, fuzzy, c-format
msgid "invalid %%type declaration due to item: %s"
msgstr "declaración de %%type no válida debido al ítem: `%s'"
#: src/reader.c:660
#: src/reader.c:672
#, c-format
msgid "redefining precedence of %s"
msgstr "redefinición de la precedencia de %s"
@@ -572,7 +567,7 @@ msgstr "redefinici
# de "to must" y aquí se emplea en su forma condicional. Por eso, he
# cambiado `debe' por `debería' - cll
# ahí me has pillado en un olvido del inglés - ngp
#: src/reader.c:683
#: src/reader.c:695
#, c-format
msgid "invalid text (%s) - number should be after identifier"
msgstr ""
@@ -582,18 +577,18 @@ msgstr ""
# otras, como `inesperado'. Cualquiera es correcta, por supuesto y, en
# este caso, la segunda me parece más apropiada - cll
# ok - ngp
#: src/reader.c:693
#: src/reader.c:705
#, c-format
msgid "unexpected item: %s"
msgstr "ítem inesperado: %s"
# Cambio el orden y el sexo. Ahora está "en español". sv
#: src/reader.c:766 src/reader.c:1098 src/reader.c:1169
#: src/reader.c:778 src/reader.c:1110 src/reader.c:1181
#, fuzzy, c-format
msgid "unmatched %s"
msgstr "`{' desemparejada"
#: src/reader.c:798
#: src/reader.c:810
#, fuzzy, c-format
msgid "argument of %%expect is not an integer"
msgstr "el argumento de %expect no es un entero"
@@ -604,26 +599,26 @@ msgstr "el argumento de %expect no es un entero"
# - cll
# ok - ngp
#
#: src/reader.c:844
#: src/reader.c:856
#, c-format
msgid "unrecognized item %s, expected an identifier"
msgstr "no se reconoce el ítem %s, se esperaba un identificador"
#: src/reader.c:866
#: src/reader.c:878
#, c-format
msgid "expected string constant instead of %s"
msgstr "se esperaba una cadena constante en lugar de %s"
#: src/reader.c:1014
#: src/reader.c:1026
#, c-format
msgid "unrecognized: %s"
msgstr "no reconocido: %s"
#: src/reader.c:1019
#: src/reader.c:1031
msgid "no input grammar"
msgstr "no hay gramática de entrada"
#: src/reader.c:1024
#: src/reader.c:1036
#, c-format
msgid "unknown character: %s"
msgstr "carácter desconocido: %s"
@@ -632,105 +627,105 @@ msgstr "car
# mejor que `sin terminar' que me parece más "computerizado" - cll
# quizás un poco cacofónico lo de claúsula inconclusa - ngp
#
#: src/reader.c:1192
#: src/reader.c:1204
#, fuzzy, c-format
msgid "unterminated %guard clause"
msgstr "cláusula %%guard sin terminar"
#: src/reader.c:1359
#: src/reader.c:1357
msgid "ill-formed rule: initial symbol not followed by colon"
msgstr "regla mal formada: el símbolo inicial no está seguido por :"
#: src/reader.c:1366
#: src/reader.c:1364
msgid "grammar starts with vertical bar"
msgstr "la gramática comienza con una barra vertical"
#: src/reader.c:1397
#: src/reader.c:1392
#, c-format
msgid "rule given for %s, which is a token"
msgstr "se ha dado una regla para %s, que es un terminal"
#: src/reader.c:1499
#: src/reader.c:1492
msgid "two @prec's in a row"
msgstr "dos @prec en una línea"
# Insisto, el empleo de participios a secas me parece como hablar en
# indio. Por favor, permíteme que añada un "está" :) - cll
# ok - ngp
#: src/reader.c:1507
#: src/reader.c:1500
#, c-format
msgid "%%guard present but %%semantic_parser not specified"
msgstr "%%guard presente pero %%semantic_parser está sin especificar"
#: src/reader.c:1516
#: src/reader.c:1509
msgid "two actions at end of one rule"
msgstr "dos acciones al final de una regla"
#: src/reader.c:1530
#: src/reader.c:1523
#, c-format
msgid "type clash (`%s' `%s') on default action"
msgstr "los tipos (`%s' `%s') no concuerdan en la acción por defecto"
#: src/reader.c:1536
#: src/reader.c:1529
msgid "empty rule for typed nonterminal, and no action"
msgstr "regla vacía para un no terminal con tipo y no hay ninguna acción"
#: src/reader.c:1580
#: src/reader.c:1573
#, c-format
msgid "invalid input: %s"
msgstr "entrada no válida: %s"
#: src/reader.c:1588
#: src/reader.c:1581
#, fuzzy, c-format
msgid "too many symbols (tokens plus nonterminals); maximum %d"
msgstr "demasiados símbolos (terminales y no terminales); máximo %s"
#: src/reader.c:1591
#: src/reader.c:1584
msgid "no rules in the input grammar"
msgstr "no hay reglas en la gramática de entrada"
# `token' se debe traducir como `literal' - cll
# en terminología de compiladores token es más un terminal - ngp
#
#: src/reader.c:1615
#: src/reader.c:1608
#, c-format
msgid "symbol %s is used, but is not defined as a token and has no rules"
msgstr ""
"se usa el símbolo %s, pero no está definido como terminal y no tiene reglas"
#: src/reader.c:1707
#: src/reader.c:1743
#, fuzzy, c-format
msgid "tokens %s and %s both assigned number %d"
msgstr "los terminales %s y %s tienen asignados ambos el número %s"
#: src/reader.c:1760
#: src/reader.c:1796
#, c-format
msgid "conflicting precedences for %s and %s"
msgstr "precedencias en conflicto entre %s y %s"
#: src/reader.c:1772
#: src/reader.c:1808
#, c-format
msgid "conflicting assoc values for %s and %s"
msgstr "conflicto de valores assoc para %s y %s"
#: src/reader.c:1811
#: src/reader.c:1847
#, c-format
msgid "the start symbol %s is undefined"
msgstr "el símbolo de inicio (axioma) %s no está definido"
#: src/reader.c:1813
#: src/reader.c:1849
#, c-format
msgid "the start symbol %s is a token"
msgstr "el símbolo de inicio (axioma) %s es un terminal"
#: src/reduce.c:405
#: src/reduce.c:400
#, fuzzy
msgid "Useless nonterminals:"
msgstr ""
"No terminales sin uso:\n"
"\n"
#: src/reduce.c:419
#: src/reduce.c:414
#, fuzzy
msgid "Terminals which are not used:"
msgstr ""
@@ -739,7 +734,7 @@ msgstr ""
"Terminales que no se usan:\n"
"\n"
#: src/reduce.c:430
#: src/reduce.c:425
#, fuzzy
msgid "Useless rules:"
msgstr ""
@@ -748,7 +743,7 @@ msgstr ""
"Reglas sin uso:\n"
"\n"
#: src/reduce.c:458
#: src/reduce.c:451
msgid ""
"Variables\n"
"---------\n"
@@ -758,11 +753,11 @@ msgstr ""
"---------\n"
"\n"
#: src/reduce.c:459
#: src/reduce.c:452
msgid "Value Sprec Sassoc Tag\n"
msgstr "Valor Sprec Sasoc Tag\n"
#: src/reduce.c:463
#: src/reduce.c:456
msgid ""
"Rules\n"
"-----\n"
@@ -772,7 +767,7 @@ msgstr ""
"------\n"
"\n"
#: src/reduce.c:473
#: src/reduce.c:470
msgid ""
"Rules interpreted\n"
"-----------------\n"
@@ -782,50 +777,30 @@ msgstr ""
"--------------------\n"
"\n"
#: src/reduce.c:495
#: src/reduce.c:491
#, c-format
msgid "%d rules never reduced\n"
msgstr "%d reglas que nunca se han reducido\n"
#: src/reduce.c:501
#: src/reduce.c:497
#, c-format
msgid "%d useless nonterminal%s"
msgstr "%d no terminales %s sin uso"
#: src/reduce.c:506
#: src/reduce.c:502
msgid " and "
msgstr " y "
#: src/reduce.c:510
#: src/reduce.c:506
#, c-format
msgid "%d useless rule%s"
msgstr "%d regla%s sin uso"
#: src/reduce.c:540
#: src/reduce.c:536
#, c-format
msgid "Start symbol %s does not derive any sentence"
msgstr "El símbolo de inicio (axioma) %s no deriva ninguna sentencia"
# ¡¡No sé cómo resolver el problema!!
#
# Como corrector, me veo obligado a hacer una corrección ¡¡a tu comentario!!:
#
# ¡¡No sé cómo resolver el problema!!
#
# Esto es: `cómo' va acentuado y, además, `problema' podría ser hebreo,
# pero no español - cll
#
# Te recomiendo `la reducción de %s' en vez de seguir el estilo inglés y
# usar participios - cll
# un error lo tiene cualquiera - ngp
#: src/reduce.c:553
#, c-format
msgid ""
"reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
msgstr ""
"la reducción de %s define %d terminal%s, %d no terminal%s, y %d produccion%"
"s.\n"
#: lib/getopt.c:694
#, c-format
msgid "%s: option `%s' is ambiguous\n"
@@ -998,6 +973,21 @@ msgstr ""
#~ msgid "%s contains"
#~ msgstr "%s contiene"
#~ msgid ""
#~ "\n"
#~ "\n"
#~ "\n"
#~ "DERIVES\n"
#~ "\n"
#~ msgstr ""
#~ "\n"
#~ "\n"
#~ "\n"
#~ "DERIVACIONES\n"
#~ msgid "%s derives"
#~ msgstr "%s deriva"
#~ msgid ""
#~ "Usage: %s [-dhklntvyV] [-b file-prefix] [-o outfile] [-p name-prefix]\n"
#~ " [--debug] [--defines] [--fixed-output-files] [--no-lines]\n"
@@ -1040,6 +1030,9 @@ msgstr ""
#~ msgid "limit of %d exceeded, too many %s"
#~ msgstr "excedido el límite de %d, demasiados %s"
#~ msgid "Entering set_nullable"
#~ msgstr "Entrando set_nullable"
# Duda: ¿Estás seguro de que no será `vacío'? Si no lo estás o, si por
# el contrario, pudiera cualquiera de los casos, debieras traducirlo
# como `vacía/o' - cll
@@ -1075,3 +1068,21 @@ msgstr ""
#~ msgid "ill-formed %type declaration"
#~ msgstr "declaración %type incorrectamente formada"
# ¡¡No sé cómo resolver el problema!!
#
# Como corrector, me veo obligado a hacer una corrección ¡¡a tu comentario!!:
#
# ¡¡No sé cómo resolver el problema!!
#
# Esto es: `cómo' va acentuado y, además, `problema' podría ser hebreo,
# pero no español - cll
#
# Te recomiendo `la reducción de %s' en vez de seguir el estilo inglés y
# usar participios - cll
# un error lo tiene cualquiera - ngp
#~ msgid ""
#~ "reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
#~ msgstr ""
#~ "la reducción de %s define %d terminal%s, %d no terminal%s, y %d produccion"
#~ "%s.\n"
BIN
View File
Binary file not shown.
+131 -146
View File
@@ -4,16 +4,16 @@
#
msgid ""
msgstr ""
"Project-Id-Version: bison 1.30a\n"
"POT-Creation-Date: 2001-11-12 10:34+0100\n"
"PO-Revision-Date: 2001-11-05 21:19+02:00\n"
"Project-Id-Version: bison 1.30d\n"
"POT-Creation-Date: 2001-11-26 16:23+0100\n"
"PO-Revision-Date: 2001-11-21 17:33+0200\n"
"Last-Translator: Toomas Soome <[email protected]>\n"
"Language-Team: Estonian <[email protected]>\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=ISO-8859-15\n"
"Content-Transfer-Encoding: 8-bit\n"
#: src/LR0.c:207
#: src/LR0.c:189
#, c-format
msgid "too many states (max %d)"
msgstr "liiga palju olekuid (maks %d)"
@@ -26,7 +26,7 @@ msgstr "Tundmatu s
msgid "warning: "
msgstr "hoiatus: "
#: src/complain.c:238 src/complain.c:279
#: src/complain.c:238
msgid "fatal error: "
msgstr "fataalne viga: "
@@ -47,61 +47,63 @@ msgstr "nihutamine"
msgid "an error"
msgstr "viga"
#: src/conflicts.c:411
#, fuzzy, c-format
#: src/conflicts.c:389
#, c-format
msgid "%d shift/reduce conflict"
msgid_plural "%d shift/reduce conflicts"
msgstr[0] " %d nihutamine/redutseerimine konflikti"
msgstr[0] "%d nihutamine/redutseerimine konflikt"
msgstr[1] "%d nihutamine/redutseerimine konflikti"
#: src/conflicts.c:418
#, fuzzy
#: src/conflicts.c:396
msgid "and"
msgstr " ja"
msgstr "ja"
#: src/conflicts.c:424
#, fuzzy, c-format
#: src/conflicts.c:402
#, c-format
msgid "%d reduce/reduce conflict"
msgid_plural "%d reduce/reduce conflicts"
msgstr[0] " %d redutseerimine/redutseerimine konflikti"
msgstr[0] "%d redutseerimine/redutseerimine konflikt"
msgstr[1] "%d redutseerimine/redutseerimine konflikti"
#: src/conflicts.c:448
#, fuzzy, c-format
#: src/conflicts.c:426
#, c-format
msgid "State %d contains "
msgstr "Olek %d sisaldab"
msgstr "Olek %d sisaldab "
#. If invoked with `--yacc', use the output format specified by
#. POSIX.
#: src/conflicts.c:481
#: src/conflicts.c:470
msgid "conflicts: "
msgstr "konfliktid: "
#: src/conflicts.c:483
#: src/conflicts.c:472
#, c-format
msgid " %d shift/reduce"
msgstr " %d nihutamine/redutseerimine"
#: src/conflicts.c:487
#: src/conflicts.c:476
#, c-format
msgid " %d reduce/reduce"
msgstr " %d redutseerimine/redutseerimine"
#: src/conflicts.c:492 src/reduce.c:497
#: src/conflicts.c:481 src/reduce.c:493
#, c-format
msgid "%s contains "
msgstr "%s sisaldab "
#: src/conflicts.c:500
#, fuzzy, c-format
msgid "expected %d shift/reduce conflict"
msgid_plural "expected %d shift/reduce conflicts"
msgstr[0] " %d nihutamine/redutseerimine konflikti"
#: src/conflicts.c:488
#, c-format
msgid "expected %d shift/reduce conflict\n"
msgid_plural "expected %d shift/reduce conflicts\n"
msgstr[0] "eeldasime %d nihutamine/redutseerimine konflikti\n"
msgstr[1] "eeldasime %d nihutamine/redutseerimine konflikti\n"
#: src/conflicts.c:587 src/conflicts.c:707
#: src/conflicts.c:575 src/conflicts.c:696
#, c-format
msgid " %-4s\t[reduce using rule %d (%s)]\n"
msgstr " %-4s\t[redutseerin, kasutades reeglit %d (%s)]\n"
#: src/conflicts.c:598 src/print.c:171
#: src/conflicts.c:587 src/print.c:156
#, c-format
msgid ""
" $default\treduce using rule %d (%s)\n"
@@ -110,25 +112,16 @@ msgstr ""
" $default\tredutseerin kasutades reeglit %d (%s)\n"
"\n"
#: src/conflicts.c:687 src/conflicts.c:701
#: src/conflicts.c:676 src/conflicts.c:690
#, c-format
msgid " %-4s\treduce using rule %d (%s)\n"
msgstr " %-4s\tredutseerin kasutades reeglit %d (%s)\n"
#: src/conflicts.c:727
#: src/conflicts.c:716
#, c-format
msgid " $default\treduce using rule %d (%s)\n"
msgstr " $default\tredutseerin kasutades reeglit %d (%s)\n"
#: src/derives.c:43
msgid "DERIVES"
msgstr "DERIVES"
#: src/derives.c:48
#, c-format
msgid "%s derives"
msgstr "%s derives"
#: src/files.c:143
#, c-format
msgid "cannot open file `%s'"
@@ -232,7 +225,7 @@ msgstr ""
"See on vaba tarkvara; kopeerimistingimused leiate lähtetekstidest. Garantii\n"
"PUUDUB; ka müügiks või mingil eesmärgil kasutamiseks.\n"
#: src/getargs.c:215 src/lex.c:693
#: src/getargs.c:215 src/lex.c:694
#, c-format
msgid "`%s' is no longer supported"
msgstr "`%s' ei ole enam toetatud"
@@ -252,7 +245,7 @@ msgstr "%s: puudub grammatikafail\n"
msgid "%s: extra arguments ignored after `%s'\n"
msgstr "%s: ignoreerin lisaargumente peale `%s'\n"
#: src/lalr.c:311
#: src/lalr.c:293
#, c-format
msgid "too many gotos (max %d)"
msgstr "liiga palju gotosid (maks %d)"
@@ -261,7 +254,7 @@ msgstr "liiga palju gotosid (maks %d)"
msgid "unexpected `/' found and ignored"
msgstr "leidsin ja ignoreerin ootamatu `/'"
#: src/lex.c:105 src/reader.c:269
#: src/lex.c:105 src/reader.c:280
msgid "unterminated comment"
msgstr "lõpetamata kommentaar"
@@ -300,351 +293,360 @@ msgstr "l
msgid "use \"...\" for multi-character literal tokens"
msgstr "kasuta mitmesümboliliste literaalidega \"...\" konstruktsiooni"
#: src/lex.c:666
#: src/lex.c:667
#, c-format
msgid "`%s' supports no argument: %s"
msgstr "`%s' ei toeta argumente: %s"
#: src/lex.c:682
#: src/lex.c:683
#, c-format
msgid "`%s' requires an argument"
msgstr "võti `%s' nõuab argumenti"
#: src/main.c:128
#: src/main.c:134
#, c-format
msgid "%s: internal error: %s\n"
msgstr "%s: sisemine viga: %s\n"
#: src/nullable.c:51
msgid "Entering set_nullable"
msgstr "Entering set_nullable"
#: src/output.c:986
#: src/output.c:979
#, c-format
msgid "maximum table size (%d) exceeded"
msgstr "ületati maksimaalset tabelisuurust (%d)"
#: src/print.c:37
#: src/print.c:38
#, c-format
msgid " type %d is %s\n"
msgstr " tüüp %d on %s\n"
#: src/print.c:85
#: src/print.c:78
#, c-format
msgid " (rule %d)"
msgstr " (reegel %d)"
#: src/print.c:111
#: src/print.c:98
msgid " $default\taccept\n"
msgstr " $default\taktsepteerin\n"
#: src/print.c:113
#: src/print.c:100
msgid " NO ACTIONS\n"
msgstr " TEGEVUSI POLE\n"
#: src/print.c:132
#: src/print.c:120
#, c-format
msgid " $ \tgo to state %d\n"
msgstr " $ \tliigu olekule %d\n"
#: src/print.c:135
#: src/print.c:123
#, c-format
msgid " %-4s\tshift, and go to state %d\n"
msgstr " %-4s\tnihuta ja liigu olekule %d\n"
#: src/print.c:159
#: src/print.c:144
#, c-format
msgid " %-4s\terror (nonassociative)\n"
msgstr " %-4s\tviga (mitteassotsiatiivne)\n"
#: src/print.c:187
#: src/print.c:173
#, c-format
msgid " %-4s\tgo to state %d\n"
msgstr " %-4s\tliigu olekule %d\n"
#: src/print.c:199
#: src/print.c:185
#, c-format
msgid "state %d"
msgstr "olek %d"
#. rule # : LHS -> RHS
#: src/print.c:229
#: src/print.c:215
msgid "Grammar"
msgstr "Grammatika"
#: src/print.c:234
#, c-format
msgid "rule %-4d %s ->"
#: src/print.c:216
msgid "Number, Line, Rule"
msgstr ""
#: src/print.c:221
#, fuzzy, c-format
msgid " %3d %3d %s ->"
msgstr "reegel %-4d %s ->"
#: src/print.c:240
#: src/print.c:228
msgid "empty"
msgstr "tühi"
#. TERMINAL (type #) : rule #s terminal is on RHS
#: src/print.c:245
#: src/print.c:233
msgid "Terminals, with rules where they appear"
msgstr "Terminalid, koos reeglitega, kus nad ilmuvad"
#: src/print.c:269
#: src/print.c:257
msgid "Nonterminals, with rules where they appear"
msgstr "Mitteterminalid, koos reeglitega, kus nad ilmuvad"
#: src/print.c:295
#: src/print.c:283
msgid " on left:"
msgstr " vasakul:"
#: src/print.c:310
#: src/print.c:298
msgid " on right:"
msgstr " paremal:"
#: src/print_graph.c:174
#. If something has been added in the NODE_OBSTACK after
#. the declaration of the label, then we need a `\n'.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:165
#, c-format
msgid "%-4s\terror (nonassociative)"
msgstr "%-4s\tviga (mitteassotsiatiivne)"
#: src/print_graph.c:187
#.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:180
#, c-format
msgid "$default\treduce using rule %d (%s)"
msgstr "$default\tredutseerin kasutades reeglit %d (%s)"
#: src/reader.c:78
#: src/reader.c:89
msgid " Skipping to next \\n"
msgstr " Liigun järgmisele \\n"
#: src/reader.c:80
#: src/reader.c:91
#, c-format
msgid " Skipping to next %c"
msgstr " Liigun järgmisele %c"
#: src/reader.c:131 src/reader.c:143
#: src/reader.c:142 src/reader.c:154
msgid "invalid $ value"
msgstr "vigane $ väärtus"
#: src/reader.c:169 src/reader.c:184
#: src/reader.c:180 src/reader.c:195
msgid "unterminated string at end of file"
msgstr "lõpetamata sõne faili lõpus"
#: src/reader.c:172
#: src/reader.c:183
msgid "unterminated string"
msgstr "lõpetamata sõne"
#: src/reader.c:325 src/reader.c:389
#: src/reader.c:336 src/reader.c:400
#, c-format
msgid "%s is invalid"
msgstr "%s on vigane"
#: src/reader.c:365
#: src/reader.c:376
#, c-format
msgid "$$ of `%s' has no declared type"
msgstr "`%s' $$ ei oma deklareeritud tüüpi"
#: src/reader.c:382
#: src/reader.c:393
#, c-format
msgid "$%d of `%s' has no declared type"
msgstr "$%d `%s' ei oma deklareeritud tüüpi"
#: src/reader.c:436
#: src/reader.c:447
msgid "unterminated `%{' definition"
msgstr "lõpetamata `%{' definitsioon"
#: src/reader.c:481 src/reader.c:595 src/reader.c:645
#: src/reader.c:492 src/reader.c:607 src/reader.c:657
#, c-format
msgid "Premature EOF after %s"
msgstr "Enneaegne EOF peale %s"
#: src/reader.c:498
#: src/reader.c:509
#, c-format
msgid "symbol `%s' used more than once as a literal string"
msgstr "sümbolit `%s' on kasutatud enam kui kord literaal sõnena"
#: src/reader.c:501
#: src/reader.c:512
#, c-format
msgid "symbol `%s' given more than one literal string"
msgstr "sümbolile `%s' on antud enam kui üks literaal sõne"
#: src/reader.c:522 src/reader.c:664
#: src/reader.c:533 src/reader.c:676
#, c-format
msgid "symbol %s redefined"
msgstr "sümbol %s on uuesti defineeritud"
#: src/reader.c:532 src/reader.c:610 src/reader.c:671 src/reader.c:1294
#: src/reader.c:543 src/reader.c:622 src/reader.c:683 src/reader.c:1292
#, c-format
msgid "type redeclaration for %s"
msgstr "%s tüübi uuesti deklareerimine"
#: src/reader.c:541
#: src/reader.c:552
#, c-format
msgid "`%s' is invalid in %s"
msgstr "`%s' ei ole %s sees lubatud"
#: src/reader.c:558 src/reader.c:723
#: src/reader.c:570 src/reader.c:735
#, c-format
msgid "multiple %s declarations"
msgstr "korduvad %s deklaratsioonid"
#: src/reader.c:560 src/reader.c:902 src/reader.c:927 src/reader.c:1272
#: src/reader.c:572 src/reader.c:914 src/reader.c:939 src/reader.c:1270
#, c-format
msgid "invalid %s declaration"
msgstr "vigane %s deklaratsioon"
#: src/reader.c:580
#: src/reader.c:592
msgid "%type declaration has no <typename>"
msgstr "%type deklaratsioonis puudub <tüübinimi>"
#: src/reader.c:615
#: src/reader.c:627
#, c-format
msgid "invalid %%type declaration due to item: %s"
msgstr "vigane %%type deklaratsioon, element: %s"
#: src/reader.c:660
#: src/reader.c:672
#, c-format
msgid "redefining precedence of %s"
msgstr "%s prioriteedi uus definitsioon"
#: src/reader.c:683
#: src/reader.c:695
#, c-format
msgid "invalid text (%s) - number should be after identifier"
msgstr "vigane tekst (%s) - number peab olema peale identifikaatorit"
#: src/reader.c:693
#: src/reader.c:705
#, c-format
msgid "unexpected item: %s"
msgstr "ootamatu element: %s"
#: src/reader.c:766 src/reader.c:1098 src/reader.c:1169
#: src/reader.c:778 src/reader.c:1110 src/reader.c:1181
#, c-format
msgid "unmatched %s"
msgstr "puudub %s"
#: src/reader.c:798
#: src/reader.c:810
#, c-format
msgid "argument of %%expect is not an integer"
msgstr "%%expect argument ei ole täisarv"
#: src/reader.c:844
#: src/reader.c:856
#, c-format
msgid "unrecognized item %s, expected an identifier"
msgstr "tundmatu element %s, eeldasin identifikaatorit"
#: src/reader.c:866
#: src/reader.c:878
#, c-format
msgid "expected string constant instead of %s"
msgstr "eeldasin %s asemel sõnekonstanti"
#: src/reader.c:1014
#: src/reader.c:1026
#, c-format
msgid "unrecognized: %s"
msgstr "tundmatu: %s"
#: src/reader.c:1019
#: src/reader.c:1031
msgid "no input grammar"
msgstr "sisendgrammatikat pole"
#: src/reader.c:1024
#: src/reader.c:1036
#, c-format
msgid "unknown character: %s"
msgstr "tundmatu sümbol: %s"
#: src/reader.c:1192
#: src/reader.c:1204
#, c-format
msgid "unterminated %guard clause"
msgstr "lõpetamata %guard klausel"
#: src/reader.c:1359
#: src/reader.c:1357
msgid "ill-formed rule: initial symbol not followed by colon"
msgstr "vigaselt formeeritud reegel: algsümbolile ei järgne koolonit"
#: src/reader.c:1366
#: src/reader.c:1364
msgid "grammar starts with vertical bar"
msgstr "grammatika algab püstkriipsuga"
#: src/reader.c:1397
#: src/reader.c:1392
#, c-format
msgid "rule given for %s, which is a token"
msgstr "%s jaoks on antud reegel, aga see on märk"
#: src/reader.c:1499
#: src/reader.c:1492
msgid "two @prec's in a row"
msgstr "kaks @prec ühel real"
#: src/reader.c:1507
#: src/reader.c:1500
#, c-format
msgid "%%guard present but %%semantic_parser not specified"
msgstr "%%guard on määratud, aga %%semantic_parser ei ole"
#: src/reader.c:1516
#: src/reader.c:1509
msgid "two actions at end of one rule"
msgstr "kaks tegevust ühe reegli lõpus"
#: src/reader.c:1530
#: src/reader.c:1523
#, c-format
msgid "type clash (`%s' `%s') on default action"
msgstr "vaikimisi tegevuse tüübikonflikt (`%s' `%s')"
#: src/reader.c:1536
#: src/reader.c:1529
msgid "empty rule for typed nonterminal, and no action"
msgstr "tüübiga mitteterminalil on tühi reegel ja puudub tegevus"
#: src/reader.c:1580
#: src/reader.c:1573
#, c-format
msgid "invalid input: %s"
msgstr "vigane sisend: %s"
#: src/reader.c:1588
#: src/reader.c:1581
#, c-format
msgid "too many symbols (tokens plus nonterminals); maximum %d"
msgstr "liiga palju sümboleid (märgid ja mitteterminalid); maksimaalne on %d"
#: src/reader.c:1591
#: src/reader.c:1584
msgid "no rules in the input grammar"
msgstr "sisendgrammatikas pole reegleid"
#: src/reader.c:1615
#: src/reader.c:1608
#, c-format
msgid "symbol %s is used, but is not defined as a token and has no rules"
msgstr ""
"kasutatakse sümbolit %s, mis ei ole defineeritud märgina ja millel puuduvad "
"reeglid"
#: src/reader.c:1707
#: src/reader.c:1743
#, c-format
msgid "tokens %s and %s both assigned number %d"
msgstr "märkidele %s ja %s on mõlemale omistatud number %d"
#: src/reader.c:1760
#: src/reader.c:1796
#, c-format
msgid "conflicting precedences for %s and %s"
msgstr "%s ja %s omavad konfliktseid prioriteete"
#: src/reader.c:1772
#: src/reader.c:1808
#, c-format
msgid "conflicting assoc values for %s and %s"
msgstr "%s ja %s omavad konfliktseid assotsiatiivseid väärtuseid"
#: src/reader.c:1811
#: src/reader.c:1847
#, c-format
msgid "the start symbol %s is undefined"
msgstr "stardisümbol %s ei ole defineeritud"
#: src/reader.c:1813
#: src/reader.c:1849
#, c-format
msgid "the start symbol %s is a token"
msgstr "stardisümbol %s on märk"
#: src/reduce.c:405
#: src/reduce.c:400
msgid "Useless nonterminals:"
msgstr "Kasutamata mitteterminalid:"
#: src/reduce.c:419
#: src/reduce.c:414
msgid "Terminals which are not used:"
msgstr "Terminalid, mida ei kasutatud:"
#: src/reduce.c:430
#: src/reduce.c:425
msgid "Useless rules:"
msgstr "Kasutamata reeglid:"
#: src/reduce.c:458
#: src/reduce.c:451
msgid ""
"Variables\n"
"---------\n"
@@ -654,11 +656,11 @@ msgstr ""
"--------\n"
"\n"
#: src/reduce.c:459
#: src/reduce.c:452
msgid "Value Sprec Sassoc Tag\n"
msgstr "Value Sprec Sassoc Tag\n"
#: src/reduce.c:463
#: src/reduce.c:456
msgid ""
"Rules\n"
"-----\n"
@@ -668,7 +670,7 @@ msgstr ""
"-------\n"
"\n"
#: src/reduce.c:473
#: src/reduce.c:470
msgid ""
"Rules interpreted\n"
"-----------------\n"
@@ -678,38 +680,30 @@ msgstr ""
"------------------------\n"
"\n"
#: src/reduce.c:495
#: src/reduce.c:491
#, c-format
msgid "%d rules never reduced\n"
msgstr "%d reeglit ei redutseeritud\n"
#: src/reduce.c:501
#: src/reduce.c:497
#, c-format
msgid "%d useless nonterminal%s"
msgstr "%d kasutamata mitteterminali%s"
#: src/reduce.c:506
#: src/reduce.c:502
msgid " and "
msgstr " ja "
#: src/reduce.c:510
#: src/reduce.c:506
#, c-format
msgid "%d useless rule%s"
msgstr "%d kasutamata reeglit%s"
#: src/reduce.c:540
#: src/reduce.c:536
#, c-format
msgid "Start symbol %s does not derive any sentence"
msgstr "Stardisümbolist %s ei tuletata ühtegi lauset"
#: src/reduce.c:553
#, c-format
msgid ""
"reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
msgstr ""
"redutseeritud %s defineerib %d terminali%s, %d mitteterminali%s ja %d reeglit"
"%s.\n"
#: lib/getopt.c:694
#, c-format
msgid "%s: option `%s' is ambiguous\n"
@@ -796,12 +790,3 @@ msgstr "`"
#: lib/quotearg.c:269
msgid "'"
msgstr "'"
#~ msgid " 1 shift/reduce conflict"
#~ msgstr " 1 nihutamine/redutseerimine konflikt"
#~ msgid " 1 reduce/reduce conflict"
#~ msgstr " 1 redutseerimine/redutseerimine konflikt"
#~ msgid "%s contains"
#~ msgstr "%s sisaldab"
BIN
View File
Binary file not shown.
+156 -151
View File
@@ -5,16 +5,16 @@
#
msgid ""
msgstr ""
"Project-Id-Version: GNU bison 1.29f\n"
"POT-Creation-Date: 2001-11-12 10:34+0100\n"
"PO-Revision-Date: 2001-10-19 15:00-0500\n"
"Project-Id-Version: GNU bison 1.30d\n"
"POT-Creation-Date: 2001-11-26 16:23+0100\n"
"PO-Revision-Date: 2001-11-21 08:00-0500\n"
"Last-Translator: Michel Robitaille <[email protected]>\n"
"Language-Team: French <[email protected]>\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=ISO-8859-1\n"
"Content-Transfer-Encoding: 8-bit\n"
#: src/LR0.c:207
#: src/LR0.c:189
#, c-format
msgid "too many states (max %d)"
msgstr "nombre trop grand d'états (max %d)"
@@ -27,7 +27,7 @@ msgstr "Erreur syst
msgid "warning: "
msgstr "AVERTISSEMENT: "
#: src/complain.c:238 src/complain.c:279
#: src/complain.c:238
msgid "fatal error: "
msgstr "erreur fatale: "
@@ -49,61 +49,60 @@ msgstr "d
msgid "an error"
msgstr "une erreur"
#: src/conflicts.c:411
#, fuzzy, c-format
#: src/conflicts.c:389
#, c-format
msgid "%d shift/reduce conflict"
msgid_plural "%d shift/reduce conflicts"
msgstr[0] " %d conflits décalage/réduction"
msgstr[0] "%d conflits par décalage/réduction"
#: src/conflicts.c:418
#, fuzzy
#: src/conflicts.c:396
msgid "and"
msgstr " et"
msgstr "et"
#: src/conflicts.c:424
#, fuzzy, c-format
#: src/conflicts.c:402
#, c-format
msgid "%d reduce/reduce conflict"
msgid_plural "%d reduce/reduce conflicts"
msgstr[0] " %d conflits réduction/réduction"
msgstr[0] "%d conflits par réduction/réduction"
#: src/conflicts.c:448
#, fuzzy, c-format
#: src/conflicts.c:426
#, c-format
msgid "State %d contains "
msgstr "L'état %d contient"
msgstr "L'état %d contient "
#. If invoked with `--yacc', use the output format specified by
#. POSIX.
#: src/conflicts.c:481
#: src/conflicts.c:470
msgid "conflicts: "
msgstr "conflits: "
#: src/conflicts.c:483
#: src/conflicts.c:472
#, c-format
msgid " %d shift/reduce"
msgstr " %d décalage/réduction"
#: src/conflicts.c:487
#: src/conflicts.c:476
#, c-format
msgid " %d reduce/reduce"
msgstr " %d réduction/réduction"
#: src/conflicts.c:492 src/reduce.c:497
#: src/conflicts.c:481 src/reduce.c:493
#, c-format
msgid "%s contains "
msgstr "%s contient "
#: src/conflicts.c:500
#, fuzzy, c-format
msgid "expected %d shift/reduce conflict"
msgid_plural "expected %d shift/reduce conflicts"
msgstr[0] " %d conflits décalage/réduction"
#: src/conflicts.c:488
#, c-format
msgid "expected %d shift/reduce conflict\n"
msgid_plural "expected %d shift/reduce conflicts\n"
msgstr[0] "attendu %d conflits décalage/réduction\n"
#: src/conflicts.c:587 src/conflicts.c:707
#: src/conflicts.c:575 src/conflicts.c:696
#, c-format
msgid " %-4s\t[reduce using rule %d (%s)]\n"
msgstr " %-4s\t[réduction par la règle %d (%s)\n"
#: src/conflicts.c:598 src/print.c:171
#: src/conflicts.c:587 src/print.c:156
#, c-format
msgid ""
" $default\treduce using rule %d (%s)\n"
@@ -112,25 +111,16 @@ msgstr ""
" $défaut\tréduction par la règle %d (%s)\n"
"\n"
#: src/conflicts.c:687 src/conflicts.c:701
#: src/conflicts.c:676 src/conflicts.c:690
#, c-format
msgid " %-4s\treduce using rule %d (%s)\n"
msgstr " %-4s\tréduction par la règle %d (%s)\n"
#: src/conflicts.c:727
#: src/conflicts.c:716
#, c-format
msgid " $default\treduce using rule %d (%s)\n"
msgstr " $défaut\tréduction par la règle %d (%s)\n"
#: src/derives.c:43
msgid "DERIVES"
msgstr "DÉRIVES"
#: src/derives.c:48
#, c-format
msgid "%s derives"
msgstr "%s dérive"
#: src/files.c:143
#, c-format
msgid "cannot open file `%s'"
@@ -156,9 +146,9 @@ msgid ""
"If a long option shows an argument as mandatory, then it is mandatory\n"
"for the equivalent short option also. Similarly for optional arguments.\n"
msgstr ""
"Si une option de forme longue montre un paramètre comme étant obligatoire,\n"
"Si une option de forme longue montre un arguement comme étant obligatoire,\n"
"il est alors obligatoire également pour une option de forme courte.\n"
"Il en est de même pour les paramètres optionnels.\n"
"Il en est de même pour les arguments optionnels.\n"
#: src/getargs.c:98
msgid ""
@@ -195,7 +185,6 @@ msgstr ""
" -k, --token-table inclure la table des noms de jetons\n"
#: src/getargs.c:117
#, fuzzy
msgid ""
"Output:\n"
" -d, --defines also produce a header file\n"
@@ -209,7 +198,7 @@ msgstr ""
" -d, --defines produire un fichier d'en-tête\n"
" -v, --verbose produire une explication de l'automate\n"
" -b, --file-prefix=PREFIXE utiliser le PREFIXE pour le fichier de sortie\n"
" -o, --output-file=FICHIER produire la sortie dans le FICHIER\n"
" -o, --output=FICHIER produire la sortie dans le FICHIER\n"
" -g, --graph produire aussi la description du graphe VCG de "
"l'automate\n"
@@ -239,7 +228,7 @@ msgstr ""
"reproduction. AUCUNE garantie n'est donnée; tant pour des raisons\n"
"COMMERCIALES que pour RÉPONDRE À UN BESOIN PARTICULIER.\n"
#: src/getargs.c:215 src/lex.c:693
#: src/getargs.c:215 src/lex.c:694
#, c-format
msgid "`%s' is no longer supported"
msgstr "`%s' n'est plus supporté"
@@ -257,9 +246,9 @@ msgstr "%s: grammaire manquante\n"
#: src/getargs.c:250
#, c-format
msgid "%s: extra arguments ignored after `%s'\n"
msgstr "%s: paramètres supplémentaires ignorés après `%s'\n"
msgstr "%s: arguments supplémentaires ignorés après `%s'\n"
#: src/lalr.c:311
#: src/lalr.c:293
#, c-format
msgid "too many gotos (max %d)"
msgstr "nombre trop grand de \"goto\" (Max %d)"
@@ -268,7 +257,7 @@ msgstr "nombre trop grand de \"goto\" (Max %d)"
msgid "unexpected `/' found and ignored"
msgstr "`/' inattendu et ignoré"
#: src/lex.c:105 src/reader.c:269
#: src/lex.c:105 src/reader.c:280
msgid "unterminated comment"
msgstr "le commentaire ne se termine pas"
@@ -307,352 +296,361 @@ msgstr "le nom de type ne se termine pas"
msgid "use \"...\" for multi-character literal tokens"
msgstr "utilisez \"...\" pour les terminaux litéraux de plusieurs caractères"
#: src/lex.c:666
#: src/lex.c:667
#, c-format
msgid "`%s' supports no argument: %s"
msgstr ""
msgstr "`%s' ne supporte aucun argument: %s"
#: src/lex.c:682
#, fuzzy, c-format
#: src/lex.c:683
#, c-format
msgid "`%s' requires an argument"
msgstr "%s: l'option %s requiert un paramètre\n"
msgstr "`%s': requiert un argument"
#: src/main.c:128
#: src/main.c:134
#, c-format
msgid "%s: internal error: %s\n"
msgstr "%s: erreur interne: %s\n"
#: src/nullable.c:51
msgid "Entering set_nullable"
msgstr "Entré dans set_nullable"
#: src/output.c:986
#: src/output.c:979
#, c-format
msgid "maximum table size (%d) exceeded"
msgstr "taille maximale de la table (%d) dépassée"
#: src/print.c:37
#: src/print.c:38
#, c-format
msgid " type %d is %s\n"
msgstr " le type %d est %s\n"
#: src/print.c:85
#: src/print.c:78
#, c-format
msgid " (rule %d)"
msgstr " (règle %d)"
#: src/print.c:111
#: src/print.c:98
msgid " $default\taccept\n"
msgstr " $défaut\taccepter\n"
#: src/print.c:113
#: src/print.c:100
msgid " NO ACTIONS\n"
msgstr " PAS D'ACTION\n"
#: src/print.c:132
#: src/print.c:120
#, c-format
msgid " $ \tgo to state %d\n"
msgstr " $ \taller à l'état %d\n"
#: src/print.c:135
#: src/print.c:123
#, c-format
msgid " %-4s\tshift, and go to state %d\n"
msgstr " %-4s\tdécalage et aller à l'état %d\n"
#: src/print.c:159
#: src/print.c:144
#, c-format
msgid " %-4s\terror (nonassociative)\n"
msgstr " %-4s\terreur (non-associatif)\n"
#: src/print.c:187
#: src/print.c:173
#, c-format
msgid " %-4s\tgo to state %d\n"
msgstr " %-4s\taller à l'état %d\n"
#: src/print.c:199
#: src/print.c:185
#, c-format
msgid "state %d"
msgstr "état %d"
#. rule # : LHS -> RHS
#: src/print.c:229
#: src/print.c:215
msgid "Grammar"
msgstr "Grammaire"
#: src/print.c:234
#, c-format
msgid "rule %-4d %s ->"
#: src/print.c:216
msgid "Number, Line, Rule"
msgstr ""
#: src/print.c:221
#, fuzzy, c-format
msgid " %3d %3d %s ->"
msgstr "règle %-4d %s ->"
#: src/print.c:240
#: src/print.c:228
msgid "empty"
msgstr "vide"
#. TERMINAL (type #) : rule #s terminal is on RHS
#: src/print.c:245
#: src/print.c:233
msgid "Terminals, with rules where they appear"
msgstr "Terminaux, suivis des règles où ils apparaissent"
#: src/print.c:269
#: src/print.c:257
msgid "Nonterminals, with rules where they appear"
msgstr "Non-terminaux, suivis des règles où ils apparaissent"
#: src/print.c:295
#: src/print.c:283
msgid " on left:"
msgstr " à gauche:"
#: src/print.c:310
#: src/print.c:298
msgid " on right:"
msgstr " à droite:"
#: src/print_graph.c:174
#. If something has been added in the NODE_OBSTACK after
#. the declaration of the label, then we need a `\n'.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:165
#, c-format
msgid "%-4s\terror (nonassociative)"
msgstr "%-4s\terreur (non-associatif)"
#: src/print_graph.c:187
#.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:180
#, c-format
msgid "$default\treduce using rule %d (%s)"
msgstr "$défaut\tréduction par la règle %d (%s)"
#: src/reader.c:78
#: src/reader.c:89
msgid " Skipping to next \\n"
msgstr " Saut jusqu'au prochain \\n"
#: src/reader.c:80
#: src/reader.c:91
#, c-format
msgid " Skipping to next %c"
msgstr " Saut jusqu'au prochain %c"
#: src/reader.c:131 src/reader.c:143
#: src/reader.c:142 src/reader.c:154
msgid "invalid $ value"
msgstr "la valeur de symbole $ n'est pas valide"
#: src/reader.c:169 src/reader.c:184
#: src/reader.c:180 src/reader.c:195
msgid "unterminated string at end of file"
msgstr "chaîne de caractères non terminée en fin de fichier"
#: src/reader.c:172
#: src/reader.c:183
msgid "unterminated string"
msgstr "chaîne de caractère non terminée"
#: src/reader.c:325 src/reader.c:389
#: src/reader.c:336 src/reader.c:400
#, c-format
msgid "%s is invalid"
msgstr "%s n'est pas valide"
#: src/reader.c:365
#: src/reader.c:376
#, c-format
msgid "$$ of `%s' has no declared type"
msgstr "$$ de `%s' n'a pas son type déclaré"
#: src/reader.c:382
#: src/reader.c:393
#, c-format
msgid "$%d of `%s' has no declared type"
msgstr "$%d de `%s' n'a pas de type déclaré"
#: src/reader.c:436
#: src/reader.c:447
msgid "unterminated `%{' definition"
msgstr "La section de définition (%{) ne termine pas avant la fin du fichier"
#: src/reader.c:481 src/reader.c:595 src/reader.c:645
#: src/reader.c:492 src/reader.c:607 src/reader.c:657
#, c-format
msgid "Premature EOF after %s"
msgstr "Fin de fichier prématutée après %s"
#: src/reader.c:498
#: src/reader.c:509
#, c-format
msgid "symbol `%s' used more than once as a literal string"
msgstr "symbole `%s' utilisé plus d'une fois dans une chaîne litérale"
#: src/reader.c:501
#: src/reader.c:512
#, c-format
msgid "symbol `%s' given more than one literal string"
msgstr "symbole `%s' présent dans plus d'une chaîne litérale"
#: src/reader.c:522 src/reader.c:664
#: src/reader.c:533 src/reader.c:676
#, c-format
msgid "symbol %s redefined"
msgstr "symbole %s redéfini"
#: src/reader.c:532 src/reader.c:610 src/reader.c:671 src/reader.c:1294
#: src/reader.c:543 src/reader.c:622 src/reader.c:683 src/reader.c:1292
#, c-format
msgid "type redeclaration for %s"
msgstr "redéclaration du type de %s"
#: src/reader.c:541
#: src/reader.c:552
#, c-format
msgid "`%s' is invalid in %s"
msgstr "`%s' n'est pas valide dans %s"
#: src/reader.c:558 src/reader.c:723
#: src/reader.c:570 src/reader.c:735
#, c-format
msgid "multiple %s declarations"
msgstr "multiples déclarations %s"
#: src/reader.c:560 src/reader.c:902 src/reader.c:927 src/reader.c:1272
#: src/reader.c:572 src/reader.c:914 src/reader.c:939 src/reader.c:1270
#, c-format
msgid "invalid %s declaration"
msgstr "la déclaration %s n'est pas valide"
#: src/reader.c:580
#: src/reader.c:592
msgid "%type declaration has no <typename>"
msgstr "la déclaration %type n'a pas de <nom_de_type>"
#: src/reader.c:615
#: src/reader.c:627
#, c-format
msgid "invalid %%type declaration due to item: %s"
msgstr "la déclaration %%type n'est pas valide en raison de l'item: %s"
#: src/reader.c:660
#: src/reader.c:672
#, c-format
msgid "redefining precedence of %s"
msgstr "redéfinition du niveau de priorité de %s"
#: src/reader.c:683
#: src/reader.c:695
#, c-format
msgid "invalid text (%s) - number should be after identifier"
msgstr ""
"le texte n'est pas valide (%s) - le nombre devrait suivre l'identificateur"
#: src/reader.c:693
#: src/reader.c:705
#, c-format
msgid "unexpected item: %s"
msgstr "item inattendu: %s"
#: src/reader.c:766 src/reader.c:1098 src/reader.c:1169
#: src/reader.c:778 src/reader.c:1110 src/reader.c:1181
#, c-format
msgid "unmatched %s"
msgstr "non appariement de %s"
#: src/reader.c:798
#: src/reader.c:810
#, c-format
msgid "argument of %%expect is not an integer"
msgstr "le paramètre de %%expect n'est pas un entier"
msgstr "l'argument de %%expect n'est pas un entier"
#: src/reader.c:844
#: src/reader.c:856
#, c-format
msgid "unrecognized item %s, expected an identifier"
msgstr "item %s non reconnu, un identificateur est attendu"
#: src/reader.c:866
#: src/reader.c:878
#, c-format
msgid "expected string constant instead of %s"
msgstr "chaîne de caractères constante attendue plutôt que %s"
#: src/reader.c:1014
#: src/reader.c:1026
#, c-format
msgid "unrecognized: %s"
msgstr "non reconnu: %s"
#: src/reader.c:1019
#: src/reader.c:1031
msgid "no input grammar"
msgstr "aucune grammaire en entrée"
#: src/reader.c:1024
#: src/reader.c:1036
#, c-format
msgid "unknown character: %s"
msgstr "caractère inconnu: %s"
#: src/reader.c:1192
#: src/reader.c:1204
#, c-format
msgid "unterminated %guard clause"
msgstr "clause %guard non terminée"
#: src/reader.c:1359
#: src/reader.c:1357
msgid "ill-formed rule: initial symbol not followed by colon"
msgstr "règle mal formée: le symbole initial n'est pas suivi de `:'"
#: src/reader.c:1366
#: src/reader.c:1364
msgid "grammar starts with vertical bar"
msgstr "la grammaire débute par une barre verticale"
#: src/reader.c:1397
#: src/reader.c:1392
#, c-format
msgid "rule given for %s, which is a token"
msgstr "la règle pour %s, qui est un terminal"
#: src/reader.c:1499
#: src/reader.c:1492
msgid "two @prec's in a row"
msgstr "deux @prec de suite"
#: src/reader.c:1507
#: src/reader.c:1500
#, c-format
msgid "%%guard present but %%semantic_parser not specified"
msgstr "%%guard est présent mais %%semantic_parser n'est pas spécifié"
#: src/reader.c:1516
#: src/reader.c:1509
msgid "two actions at end of one rule"
msgstr "deux actions à la fin d'une même règle"
#: src/reader.c:1530
#: src/reader.c:1523
#, c-format
msgid "type clash (`%s' `%s') on default action"
msgstr "conflit de type (`%s' `%s') pour l'action par défaut"
#: src/reader.c:1536
#: src/reader.c:1529
msgid "empty rule for typed nonterminal, and no action"
msgstr "règle vide pour une catégorie typée et aucune action"
#: src/reader.c:1580
#: src/reader.c:1573
#, c-format
msgid "invalid input: %s"
msgstr "entrée non valide: %s"
#: src/reader.c:1588
#: src/reader.c:1581
#, c-format
msgid "too many symbols (tokens plus nonterminals); maximum %d"
msgstr "trop de symboles (jeton plus non terminaux); maximum %d"
#: src/reader.c:1591
#: src/reader.c:1584
msgid "no rules in the input grammar"
msgstr "la grammaire n'a pas de règles"
#: src/reader.c:1615
#: src/reader.c:1608
#, c-format
msgid "symbol %s is used, but is not defined as a token and has no rules"
msgstr ""
"le symbole %s est utilisé mais ce n'est pas un terminal et il ne possède pas "
"de règle"
#: src/reader.c:1707
#: src/reader.c:1743
#, c-format
msgid "tokens %s and %s both assigned number %d"
msgstr "les jetons %s et %s se sont vus assigner le nombre %d"
#: src/reader.c:1760
#: src/reader.c:1796
#, c-format
msgid "conflicting precedences for %s and %s"
msgstr "les priorités pour %s et %s entrent en conflit"
#: src/reader.c:1772
#: src/reader.c:1808
#, c-format
msgid "conflicting assoc values for %s and %s"
msgstr "les valeurs d'association de %s et %s entrent en conflit"
#: src/reader.c:1811
#: src/reader.c:1847
#, c-format
msgid "the start symbol %s is undefined"
msgstr "le symbole de départ %s n'est pas défini"
#: src/reader.c:1813
#: src/reader.c:1849
#, c-format
msgid "the start symbol %s is a token"
msgstr "le symbole de départ %s est un terminal"
#: src/reduce.c:405
#: src/reduce.c:400
msgid "Useless nonterminals:"
msgstr "Non-terminaux inutiles:"
#: src/reduce.c:419
#: src/reduce.c:414
msgid "Terminals which are not used:"
msgstr "Terminaux non utilisés:"
#: src/reduce.c:430
#: src/reduce.c:425
msgid "Useless rules:"
msgstr "Règles inutiles:"
#: src/reduce.c:458
#: src/reduce.c:451
msgid ""
"Variables\n"
"---------\n"
@@ -662,11 +660,11 @@ msgstr ""
"---------\n"
"\n"
#: src/reduce.c:459
#: src/reduce.c:452
msgid "Value Sprec Sassoc Tag\n"
msgstr "Valeur Spréc Sassoc Tag\n"
#: src/reduce.c:463
#: src/reduce.c:456
msgid ""
"Rules\n"
"-----\n"
@@ -676,7 +674,7 @@ msgstr ""
"------\n"
"\n"
#: src/reduce.c:473
#: src/reduce.c:470
msgid ""
"Rules interpreted\n"
"-----------------\n"
@@ -686,38 +684,30 @@ msgstr ""
"-------------------\n"
"\n"
#: src/reduce.c:495
#: src/reduce.c:491
#, c-format
msgid "%d rules never reduced\n"
msgstr "%d règles jamais réduites\n"
#: src/reduce.c:501
#: src/reduce.c:497
#, c-format
msgid "%d useless nonterminal%s"
msgstr "%d catégories non productives%s"
#: src/reduce.c:506
#: src/reduce.c:502
msgid " and "
msgstr " et "
#: src/reduce.c:510
#: src/reduce.c:506
#, c-format
msgid "%d useless rule%s"
msgstr "%d règle(s) non productive(s)%s"
#: src/reduce.c:540
#: src/reduce.c:536
#, c-format
msgid "Start symbol %s does not derive any sentence"
msgstr "Aucune phrase ne peut être dérivée du symbole de départ %s"
#: src/reduce.c:553
#, c-format
msgid ""
"reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
msgstr ""
"la réduction de %s définit %d terminal%s, %d catégorie%s et %d production%"
"s.\n"
#: lib/getopt.c:694
#, c-format
msgid "%s: option `%s' is ambiguous\n"
@@ -726,17 +716,17 @@ msgstr "%s: l'option %s est ambig
#: lib/getopt.c:719
#, c-format
msgid "%s: option `--%s' doesn't allow an argument\n"
msgstr "%s: l'option --%s n'admet pas de paramètre\n"
msgstr "%s: l'option --%s n'admet pas d'argument\n"
#: lib/getopt.c:724
#, c-format
msgid "%s: option `%c%s' doesn't allow an argument\n"
msgstr "%s: l'option %c%s n'admet pas de paramètre\n"
msgstr "%s: l'option %c%s n'admet pas d'argument\n"
#: lib/getopt.c:742 lib/getopt.c:915
#, c-format
msgid "%s: option `%s' requires an argument\n"
msgstr "%s: l'option %s requiert un paramètre\n"
msgstr "%s: l'option %s requiert un argument\n"
#. --option
#: lib/getopt.c:771
@@ -765,7 +755,7 @@ msgstr "%s: option non valide -- %c\n"
#: lib/getopt.c:834 lib/getopt.c:964
#, c-format
msgid "%s: option requires an argument -- %c\n"
msgstr "%s: l'option requiert un paramètre -- %c\n"
msgstr "%s: l'option requiert un argument -- %c\n"
#: lib/getopt.c:881
#, c-format
@@ -775,7 +765,7 @@ msgstr "%s: l'option `-W %s' est ambigu
#: lib/getopt.c:899
#, c-format
msgid "%s: option `-W %s' doesn't allow an argument\n"
msgstr "%s: l'option `-W %s' n'admet pas de paramètre\n"
msgstr "%s: l'option `-W %s' n'admet pas d'argument\n"
#. If XALLOC_FAIL_FUNC is NULL, or does return, display this message
#. before exiting when memory is exhausted. Goes through gettext.
@@ -805,6 +795,21 @@ msgstr "`"
msgid "'"
msgstr "'"
#~ msgid "DERIVES"
#~ msgstr "DÉRIVES"
#~ msgid "%s derives"
#~ msgstr "%s dérive"
#~ msgid "Entering set_nullable"
#~ msgstr "Entré dans set_nullable"
#~ msgid ""
#~ "reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
#~ msgstr ""
#~ "la réduction de %s définit %d terminal%s, %d catégorie%s et %d production%"
#~ "s.\n"
#~ msgid " 1 shift/reduce conflict"
#~ msgstr " 1 conflit décalage/réduction"
BIN
View File
Binary file not shown.
+142 -131
View File
@@ -5,7 +5,7 @@
msgid ""
msgstr ""
"Project-Id-Version: GNU bison 1.28\n"
"POT-Creation-Date: 2001-11-12 10:34+0100\n"
"POT-Creation-Date: 2001-11-26 16:23+0100\n"
"PO-Revision-Date: 1999-09-28 21:10+0900\n"
"Last-Translator: Daisuke Yamashita <[email protected]>\n"
"Language-Team: Japanese <[email protected]>\n"
@@ -13,7 +13,7 @@ msgstr ""
"Content-Type: text/plain; charset=EUC-JP\n"
"Content-Transfer-Encoding: 8bit\n"
#: src/LR0.c:207
#: src/LR0.c:189
#, fuzzy, c-format
msgid "too many states (max %d)"
msgstr "%s の数が多すぎます (最大 %d)"
@@ -26,7 +26,7 @@ msgstr ""
msgid "warning: "
msgstr ""
#: src/complain.c:238 src/complain.c:279
#: src/complain.c:238
#, fuzzy
msgid "fatal error: "
msgstr "%s: 致命的エラー: "
@@ -48,61 +48,61 @@ msgstr "
msgid "an error"
msgstr "エラー"
#: src/conflicts.c:411
#: src/conflicts.c:389
#, fuzzy, c-format
msgid "%d shift/reduce conflict"
msgid_plural "%d shift/reduce conflicts"
msgstr[0] " %d シフト/還元衝突"
#: src/conflicts.c:418
#: src/conflicts.c:396
#, fuzzy
msgid "and"
msgstr " および"
#: src/conflicts.c:424
#: src/conflicts.c:402
#, fuzzy, c-format
msgid "%d reduce/reduce conflict"
msgid_plural "%d reduce/reduce conflicts"
msgstr[0] " %d 還元/還元衝突"
#: src/conflicts.c:448
#: src/conflicts.c:426
#, fuzzy, c-format
msgid "State %d contains "
msgstr "状態 %d が含むのは"
#. If invoked with `--yacc', use the output format specified by
#. POSIX.
#: src/conflicts.c:481
#: src/conflicts.c:470
msgid "conflicts: "
msgstr "衝突: "
#: src/conflicts.c:483
#: src/conflicts.c:472
#, c-format
msgid " %d shift/reduce"
msgstr " %d シフト/還元"
#: src/conflicts.c:487
#: src/conflicts.c:476
#, c-format
msgid " %d reduce/reduce"
msgstr " %d 還元/還元"
#: src/conflicts.c:492 src/reduce.c:497
#: src/conflicts.c:481 src/reduce.c:493
#, c-format
msgid "%s contains "
msgstr "%s には"
#: src/conflicts.c:500
#: src/conflicts.c:488
#, fuzzy, c-format
msgid "expected %d shift/reduce conflict"
msgid_plural "expected %d shift/reduce conflicts"
msgid "expected %d shift/reduce conflict\n"
msgid_plural "expected %d shift/reduce conflicts\n"
msgstr[0] " %d シフト/還元衝突"
#: src/conflicts.c:587 src/conflicts.c:707
#: src/conflicts.c:575 src/conflicts.c:696
#, c-format
msgid " %-4s\t[reduce using rule %d (%s)]\n"
msgstr " %-4s\t[規則 %d を利用して還元 (%s)]\n"
#: src/conflicts.c:598 src/print.c:171
#: src/conflicts.c:587 src/print.c:156
#, c-format
msgid ""
" $default\treduce using rule %d (%s)\n"
@@ -111,31 +111,16 @@ msgstr ""
" $default\t規則 %d を利用して還元 (%s)\n"
"\n"
#: src/conflicts.c:687 src/conflicts.c:701
#: src/conflicts.c:676 src/conflicts.c:690
#, c-format
msgid " %-4s\treduce using rule %d (%s)\n"
msgstr " %-4s\t規則 %d を利用して還元 (%s)\n"
#: src/conflicts.c:727
#: src/conflicts.c:716
#, c-format
msgid " $default\treduce using rule %d (%s)\n"
msgstr " $default\t規則 %d を利用して還元 (%s)\n"
#: src/derives.c:43
#, fuzzy
msgid "DERIVES"
msgstr ""
"\n"
"\n"
"\n"
"DERIVES\n"
"\n"
#: src/derives.c:48
#, c-format
msgid "%s derives"
msgstr "%s は以下から派生"
#: src/files.c:143
#, c-format
msgid "cannot open file `%s'"
@@ -215,7 +200,7 @@ msgid ""
"warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n"
msgstr ""
#: src/getargs.c:215 src/lex.c:693
#: src/getargs.c:215 src/lex.c:694
#, c-format
msgid "`%s' is no longer supported"
msgstr ""
@@ -235,7 +220,7 @@ msgstr "%s: ʸˡ
msgid "%s: extra arguments ignored after `%s'\n"
msgstr "%s: '%s' より後ろの余分な引数は無視されました\n"
#: src/lalr.c:311
#: src/lalr.c:293
#, fuzzy, c-format
msgid "too many gotos (max %d)"
msgstr "%s の数が多すぎます (最大 %d)"
@@ -244,7 +229,7 @@ msgstr "%s
msgid "unexpected `/' found and ignored"
msgstr "予期しない `/' が見つかり、無視されました"
#: src/lex.c:105 src/reader.c:269
#: src/lex.c:105 src/reader.c:280
msgid "unterminated comment"
msgstr "閉じていないコメントです"
@@ -284,69 +269,65 @@ msgstr "
msgid "use \"...\" for multi-character literal tokens"
msgstr "複数文字のリテラルトークンには \"...\" を使いましょう"
#: src/lex.c:666
#: src/lex.c:667
#, c-format
msgid "`%s' supports no argument: %s"
msgstr ""
#: src/lex.c:682
#: src/lex.c:683
#, fuzzy, c-format
msgid "`%s' requires an argument"
msgstr "%s: オプション `%s' は引数を要求します\n"
#: src/main.c:128
#: src/main.c:134
#, c-format
msgid "%s: internal error: %s\n"
msgstr "%s: 内部エラー: %s\n"
#: src/nullable.c:51
msgid "Entering set_nullable"
msgstr "set_nullable に入ります"
#: src/output.c:986
#: src/output.c:979
#, fuzzy, c-format
msgid "maximum table size (%d) exceeded"
msgstr "最大テーブルサイズ (%s) を超えました"
#: src/print.c:37
#: src/print.c:38
#, c-format
msgid " type %d is %s\n"
msgstr " タイプ %d は %s です\n"
#: src/print.c:85
#: src/print.c:78
#, c-format
msgid " (rule %d)"
msgstr " (規則 %d)"
#: src/print.c:111
#: src/print.c:98
msgid " $default\taccept\n"
msgstr " $default\taccept\n"
#: src/print.c:113
#: src/print.c:100
msgid " NO ACTIONS\n"
msgstr " 動作無し\n"
#: src/print.c:132
#: src/print.c:120
#, c-format
msgid " $ \tgo to state %d\n"
msgstr " $ \t状態 %d へ\n"
#: src/print.c:135
#: src/print.c:123
#, c-format
msgid " %-4s\tshift, and go to state %d\n"
msgstr " %-4s\tシフト、および状態 %d へ\n"
#: src/print.c:159
#: src/print.c:144
#, c-format
msgid " %-4s\terror (nonassociative)\n"
msgstr " %-4s\tエラー (非結合)\n"
#: src/print.c:187
#: src/print.c:173
#, c-format
msgid " %-4s\tgo to state %d\n"
msgstr " %-4s\t状態 %d へ\n"
#: src/print.c:199
#: src/print.c:185
#, fuzzy, c-format
msgid "state %d"
msgstr ""
@@ -356,24 +337,28 @@ msgstr ""
"\n"
#. rule # : LHS -> RHS
#: src/print.c:229
#: src/print.c:215
#, fuzzy
msgid "Grammar"
msgstr ""
"\n"
"文法\n"
#: src/print.c:234
#, c-format
msgid "rule %-4d %s ->"
#: src/print.c:216
msgid "Number, Line, Rule"
msgstr ""
#: src/print.c:221
#, fuzzy, c-format
msgid " %3d %3d %s ->"
msgstr "規則 %-4d %s ->"
#: src/print.c:240
#: src/print.c:228
msgid "empty"
msgstr ""
#. TERMINAL (type #) : rule #s terminal is on RHS
#: src/print.c:245
#: src/print.c:233
#, fuzzy
msgid "Terminals, with rules where they appear"
msgstr ""
@@ -381,7 +366,7 @@ msgstr ""
"終端トークン、およびそこに現れた規則\n"
"\n"
#: src/print.c:269
#: src/print.c:257
#, fuzzy
msgid "Nonterminals, with rules where they appear"
msgstr ""
@@ -389,256 +374,265 @@ msgstr ""
"非終端トークン、およびそこに現れた規則\n"
"\n"
#: src/print.c:295
#: src/print.c:283
msgid " on left:"
msgstr " 左辺:"
#: src/print.c:310
#: src/print.c:298
msgid " on right:"
msgstr " 右辺:"
#: src/print_graph.c:174
#. If something has been added in the NODE_OBSTACK after
#. the declaration of the label, then we need a `\n'.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:165
#, fuzzy, c-format
msgid "%-4s\terror (nonassociative)"
msgstr " %-4s\tエラー (非結合)\n"
#: src/print_graph.c:187
#.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:180
#, fuzzy, c-format
msgid "$default\treduce using rule %d (%s)"
msgstr " $default\t規則 %d を利用して還元 (%s)\n"
#: src/reader.c:78
#: src/reader.c:89
msgid " Skipping to next \\n"
msgstr " 次の \\n にスキップ"
#: src/reader.c:80
#: src/reader.c:91
#, c-format
msgid " Skipping to next %c"
msgstr " 次の %c にスキップ"
#: src/reader.c:131 src/reader.c:143
#: src/reader.c:142 src/reader.c:154
msgid "invalid $ value"
msgstr "無効な $ の値"
#: src/reader.c:169 src/reader.c:184
#: src/reader.c:180 src/reader.c:195
msgid "unterminated string at end of file"
msgstr "閉じられていない文字列がファイル末尾にあります"
#: src/reader.c:172
#: src/reader.c:183
msgid "unterminated string"
msgstr "閉じられていない文字列"
#: src/reader.c:325 src/reader.c:389
#: src/reader.c:336 src/reader.c:400
#, fuzzy, c-format
msgid "%s is invalid"
msgstr "@%s は無効です"
#: src/reader.c:365
#: src/reader.c:376
#, c-format
msgid "$$ of `%s' has no declared type"
msgstr "`%s' の $$ に宣言のない型があります"
#: src/reader.c:382
#: src/reader.c:393
#, fuzzy, c-format
msgid "$%d of `%s' has no declared type"
msgstr "`%s' の $%s に宣言のない型があります"
#: src/reader.c:436
#: src/reader.c:447
msgid "unterminated `%{' definition"
msgstr "`%{' 定義 が閉じられていません"
#: src/reader.c:481 src/reader.c:595 src/reader.c:645
#: src/reader.c:492 src/reader.c:607 src/reader.c:657
#, c-format
msgid "Premature EOF after %s"
msgstr ""
#: src/reader.c:498
#: src/reader.c:509
#, c-format
msgid "symbol `%s' used more than once as a literal string"
msgstr ""
#: src/reader.c:501
#: src/reader.c:512
#, c-format
msgid "symbol `%s' given more than one literal string"
msgstr ""
#: src/reader.c:522 src/reader.c:664
#: src/reader.c:533 src/reader.c:676
#, c-format
msgid "symbol %s redefined"
msgstr "シンボル %s が再定義されました"
#: src/reader.c:532 src/reader.c:610 src/reader.c:671 src/reader.c:1294
#: src/reader.c:543 src/reader.c:622 src/reader.c:683 src/reader.c:1292
#, c-format
msgid "type redeclaration for %s"
msgstr "%s の型が再定義されました"
#: src/reader.c:541
#: src/reader.c:552
#, c-format
msgid "`%s' is invalid in %s"
msgstr "%2$s 内の `%1$s' は無効です"
#: src/reader.c:558 src/reader.c:723
#: src/reader.c:570 src/reader.c:735
#, fuzzy, c-format
msgid "multiple %s declarations"
msgstr "複数の %start が宣言されました"
#: src/reader.c:560 src/reader.c:902 src/reader.c:927 src/reader.c:1272
#: src/reader.c:572 src/reader.c:914 src/reader.c:939 src/reader.c:1270
#, fuzzy, c-format
msgid "invalid %s declaration"
msgstr "無効な %start が宣言されました"
#: src/reader.c:580
#: src/reader.c:592
msgid "%type declaration has no <typename>"
msgstr "%type 宣言に <タイプ名> がありません"
#: src/reader.c:615
#: src/reader.c:627
#, fuzzy, c-format
msgid "invalid %%type declaration due to item: %s"
msgstr "アイテムに与えられるべき %%type 宣言が無効です: `%s'"
#: src/reader.c:660
#: src/reader.c:672
#, c-format
msgid "redefining precedence of %s"
msgstr "%s に先行した再定義です"
#: src/reader.c:683
#: src/reader.c:695
#, c-format
msgid "invalid text (%s) - number should be after identifier"
msgstr "無効なテキスト (%s) - 数値は識別子の後ろにあるべきです"
#: src/reader.c:693
#: src/reader.c:705
#, c-format
msgid "unexpected item: %s"
msgstr "予期せぬアイテム: %s"
#: src/reader.c:766 src/reader.c:1098 src/reader.c:1169
#: src/reader.c:778 src/reader.c:1110 src/reader.c:1181
#, fuzzy, c-format
msgid "unmatched %s"
msgstr "対応のない `{' です"
#: src/reader.c:798
#: src/reader.c:810
#, fuzzy, c-format
msgid "argument of %%expect is not an integer"
msgstr "%expect の引数が整数値ではありません"
#: src/reader.c:844
#: src/reader.c:856
#, c-format
msgid "unrecognized item %s, expected an identifier"
msgstr "認識できないアイテム %s、ここでは識別子が期待されます"
#: src/reader.c:866
#: src/reader.c:878
#, c-format
msgid "expected string constant instead of %s"
msgstr "ここでは %s ではなく文字列定数が期待されます"
#: src/reader.c:1014
#: src/reader.c:1026
#, c-format
msgid "unrecognized: %s"
msgstr "認識できない: %s"
#: src/reader.c:1019
#: src/reader.c:1031
msgid "no input grammar"
msgstr "文法の入力が無い"
#: src/reader.c:1024
#: src/reader.c:1036
#, c-format
msgid "unknown character: %s"
msgstr "未知の文字: %s"
#: src/reader.c:1192
#: src/reader.c:1204
#, fuzzy, c-format
msgid "unterminated %guard clause"
msgstr "閉じられていない %%guard 節です"
#: src/reader.c:1359
#: src/reader.c:1357
msgid "ill-formed rule: initial symbol not followed by colon"
msgstr "邪悪な規則: 初期化シンボルにコロン (:) が続いていません"
#: src/reader.c:1366
#: src/reader.c:1364
msgid "grammar starts with vertical bar"
msgstr "文法は縦棒 (|) で始めます"
#: src/reader.c:1397
#: src/reader.c:1392
#, c-format
msgid "rule given for %s, which is a token"
msgstr "%s に規則が与えられ、それはトークンとなります"
#: src/reader.c:1499
#: src/reader.c:1492
msgid "two @prec's in a row"
msgstr "@prec のもの二つが同列になっています"
#: src/reader.c:1507
#: src/reader.c:1500
#, c-format
msgid "%%guard present but %%semantic_parser not specified"
msgstr "%%guard がありますが %%semantic_parser が指定されていません"
#: src/reader.c:1516
#: src/reader.c:1509
msgid "two actions at end of one rule"
msgstr "一つの規則の終りに二つの動作を指定しています"
#: src/reader.c:1530
#: src/reader.c:1523
#, c-format
msgid "type clash (`%s' `%s') on default action"
msgstr "初期状態の動作では型 (`%s' `%s') が衝突します"
#: src/reader.c:1536
#: src/reader.c:1529
msgid "empty rule for typed nonterminal, and no action"
msgstr "空の型付き非終端アイテム用規則であり、動作が起りません"
#: src/reader.c:1580
#: src/reader.c:1573
#, c-format
msgid "invalid input: %s"
msgstr "無効な入力: %s"
#: src/reader.c:1588
#: src/reader.c:1581
#, fuzzy, c-format
msgid "too many symbols (tokens plus nonterminals); maximum %d"
msgstr "シンボルが多すぎます (トークンと非終端アイテム) -- 最大 %s"
#: src/reader.c:1591
#: src/reader.c:1584
msgid "no rules in the input grammar"
msgstr "入力した文法に規則が定義されていません"
#: src/reader.c:1615
#: src/reader.c:1608
#, c-format
msgid "symbol %s is used, but is not defined as a token and has no rules"
msgstr ""
"シンボル %s が使われていますが、トークンとして定義されておらず、規則を持ちま"
"せん"
#: src/reader.c:1707
#: src/reader.c:1743
#, fuzzy, c-format
msgid "tokens %s and %s both assigned number %d"
msgstr "トークン %s と %s の双方が番号 %s に割り当てられました"
#: src/reader.c:1760
#: src/reader.c:1796
#, c-format
msgid "conflicting precedences for %s and %s"
msgstr "先行している %s と %s で競合が生じています"
#: src/reader.c:1772
#: src/reader.c:1808
#, c-format
msgid "conflicting assoc values for %s and %s"
msgstr "非結合値 %s と %s で競合が生じています"
#: src/reader.c:1811
#: src/reader.c:1847
#, c-format
msgid "the start symbol %s is undefined"
msgstr "開始シンボル %s は定義されていません"
#: src/reader.c:1813
#: src/reader.c:1849
#, c-format
msgid "the start symbol %s is a token"
msgstr "開始シンボル %s はトークンです"
#: src/reduce.c:405
#: src/reduce.c:400
#, fuzzy
msgid "Useless nonterminals:"
msgstr ""
"不使用非終端子:\n"
"\n"
#: src/reduce.c:419
#: src/reduce.c:414
#, fuzzy
msgid "Terminals which are not used:"
msgstr ""
@@ -647,7 +641,7 @@ msgstr ""
"利用されない終端子:\n"
"\n"
#: src/reduce.c:430
#: src/reduce.c:425
#, fuzzy
msgid "Useless rules:"
msgstr ""
@@ -656,7 +650,7 @@ msgstr ""
"不使用規則:\n"
"\n"
#: src/reduce.c:458
#: src/reduce.c:451
msgid ""
"Variables\n"
"---------\n"
@@ -666,11 +660,11 @@ msgstr ""
"---------\n"
"\n"
#: src/reduce.c:459
#: src/reduce.c:452
msgid "Value Sprec Sassoc Tag\n"
msgstr "値 前置 結合 タグ\n"
#: src/reduce.c:463
#: src/reduce.c:456
msgid ""
"Rules\n"
"-----\n"
@@ -680,7 +674,7 @@ msgstr ""
"-----\n"
"\n"
#: src/reduce.c:473
#: src/reduce.c:470
msgid ""
"Rules interpreted\n"
"-----------------\n"
@@ -690,38 +684,30 @@ msgstr ""
"-----------------\n"
"\n"
#: src/reduce.c:495
#: src/reduce.c:491
#, c-format
msgid "%d rules never reduced\n"
msgstr "%d 個の規則は決して還元されません\n"
#: src/reduce.c:501
#: src/reduce.c:497
#, c-format
msgid "%d useless nonterminal%s"
msgstr "%d 個の不使用非終端子%.0s"
#: src/reduce.c:506
#: src/reduce.c:502
msgid " and "
msgstr "および"
#: src/reduce.c:510
#: src/reduce.c:506
#, c-format
msgid "%d useless rule%s"
msgstr "%d 個の不使用規則%.0s"
#: src/reduce.c:540
#: src/reduce.c:536
#, c-format
msgid "Start symbol %s does not derive any sentence"
msgstr "開始シンボル %s はどの文にも由来しません"
#: src/reduce.c:553
#, c-format
msgid ""
"reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
msgstr ""
"還元ファイル %s で %d 個の終端子%.0s, %d 個の非終端子%.0s, %d 個の規則%.0sが"
"定義されました\n"
#: lib/getopt.c:694
#, c-format
msgid "%s: option `%s' is ambiguous\n"
@@ -865,6 +851,22 @@ msgstr ""
#~ msgid "%s contains"
#~ msgstr "%s には、"
#~ msgid ""
#~ "\n"
#~ "\n"
#~ "\n"
#~ "DERIVES\n"
#~ "\n"
#~ msgstr ""
#~ "\n"
#~ "\n"
#~ "\n"
#~ "DERIVES\n"
#~ "\n"
#~ msgid "%s derives"
#~ msgstr "%s は以下から派生"
#~ msgid ""
#~ "Usage: %s [-dhklntvyV] [-b file-prefix] [-o outfile] [-p name-prefix]\n"
#~ " [--debug] [--defines] [--fixed-output-files] [--no-lines]\n"
@@ -896,6 +898,9 @@ msgstr ""
#~ msgid "%s:%d: "
#~ msgstr "%s:%d: "
#~ msgid "Entering set_nullable"
#~ msgstr "set_nullable に入ります"
#~ msgid "\t\t/* empty */"
#~ msgstr "\t\t/* 空 */"
@@ -922,3 +927,9 @@ msgstr ""
#~ msgid "ill-formed %type declaration"
#~ msgstr "邪悪な %type 宣言です"
#~ msgid ""
#~ "reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
#~ msgstr ""
#~ "還元ファイル %s で %d 個の終端子%.0s, %d 個の非終端子%.0s, %d 個の規則%.0s"
#~ "が定義されました\n"
BIN
View File
Binary file not shown.
+142 -131
View File
@@ -5,7 +5,7 @@
msgid ""
msgstr ""
"Project-Id-Version: bison 1.25\n"
"POT-Creation-Date: 2001-11-12 10:34+0100\n"
"POT-Creation-Date: 2001-11-26 16:23+0100\n"
"PO-Revision-Date: 1996-08-27 15:34 MET DST\n"
"Last-Translator: Erick Branderhorst <[email protected]>\n"
"Language-Team: Dutch <[email protected]>\n"
@@ -13,7 +13,7 @@ msgstr ""
"Content-Type: text/plain; charset=ISO-8859-1\n"
"Content-Transfer-Encoding: 8-bit\n"
#: src/LR0.c:207
#: src/LR0.c:189
#, c-format
msgid "too many states (max %d)"
msgstr ""
@@ -26,7 +26,7 @@ msgstr ""
msgid "warning: "
msgstr ""
#: src/complain.c:238 src/complain.c:279
#: src/complain.c:238
#, fuzzy
msgid "fatal error: "
msgstr "fatale fout: %s\n"
@@ -48,61 +48,61 @@ msgstr "verschuif"
msgid "an error"
msgstr "een fout"
#: src/conflicts.c:411
#: src/conflicts.c:389
#, fuzzy, c-format
msgid "%d shift/reduce conflict"
msgid_plural "%d shift/reduce conflicts"
msgstr[0] " %d verschuif/reduceer conflicten"
#: src/conflicts.c:418
#: src/conflicts.c:396
#, fuzzy
msgid "and"
msgstr " en"
#: src/conflicts.c:424
#: src/conflicts.c:402
#, fuzzy, c-format
msgid "%d reduce/reduce conflict"
msgid_plural "%d reduce/reduce conflicts"
msgstr[0] " %d reduceer/reduceer conflicten"
#: src/conflicts.c:448
#: src/conflicts.c:426
#, fuzzy, c-format
msgid "State %d contains "
msgstr "Stadium %d bevat"
#. If invoked with `--yacc', use the output format specified by
#. POSIX.
#: src/conflicts.c:481
#: src/conflicts.c:470
msgid "conflicts: "
msgstr "conflictueerd: "
#: src/conflicts.c:483
#: src/conflicts.c:472
#, c-format
msgid " %d shift/reduce"
msgstr " %d vershuif/reduceer"
#: src/conflicts.c:487
#: src/conflicts.c:476
#, c-format
msgid " %d reduce/reduce"
msgstr " %d reduceer/reduceer"
#: src/conflicts.c:492 src/reduce.c:497
#: src/conflicts.c:481 src/reduce.c:493
#, c-format
msgid "%s contains "
msgstr "%s bevat"
#: src/conflicts.c:500
#: src/conflicts.c:488
#, fuzzy, c-format
msgid "expected %d shift/reduce conflict"
msgid_plural "expected %d shift/reduce conflicts"
msgid "expected %d shift/reduce conflict\n"
msgid_plural "expected %d shift/reduce conflicts\n"
msgstr[0] " %d verschuif/reduceer conflicten"
#: src/conflicts.c:587 src/conflicts.c:707
#: src/conflicts.c:575 src/conflicts.c:696
#, c-format
msgid " %-4s\t[reduce using rule %d (%s)]\n"
msgstr " %-4s\t[reduceer gebruikt regel %d (%s)]\n"
#: src/conflicts.c:598 src/print.c:171
#: src/conflicts.c:587 src/print.c:156
#, c-format
msgid ""
" $default\treduce using rule %d (%s)\n"
@@ -111,31 +111,16 @@ msgstr ""
" $default\treduce using rule %d (%s)\n"
"\n"
#: src/conflicts.c:687 src/conflicts.c:701
#: src/conflicts.c:676 src/conflicts.c:690
#, c-format
msgid " %-4s\treduce using rule %d (%s)\n"
msgstr ""
#: src/conflicts.c:727
#: src/conflicts.c:716
#, c-format
msgid " $default\treduce using rule %d (%s)\n"
msgstr ""
#: src/derives.c:43
#, fuzzy
msgid "DERIVES"
msgstr ""
"\n"
"\n"
"\n"
"AFGELEIDEN\n"
"\n"
#: src/derives.c:48
#, c-format
msgid "%s derives"
msgstr "%s afgeleiden"
#: src/files.c:143
#, c-format
msgid "cannot open file `%s'"
@@ -215,7 +200,7 @@ msgid ""
"warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n"
msgstr ""
#: src/getargs.c:215 src/lex.c:693
#: src/getargs.c:215 src/lex.c:694
#, c-format
msgid "`%s' is no longer supported"
msgstr ""
@@ -235,7 +220,7 @@ msgstr "%s: geen grammatica bestand gegeven\n"
msgid "%s: extra arguments ignored after `%s'\n"
msgstr "%s: extra argumenten genegeerd na '%s'\n"
#: src/lalr.c:311
#: src/lalr.c:293
#, c-format
msgid "too many gotos (max %d)"
msgstr ""
@@ -244,7 +229,7 @@ msgstr ""
msgid "unexpected `/' found and ignored"
msgstr "onverwachte `/' gevonden en genegeerd"
#: src/lex.c:105 src/reader.c:269
#: src/lex.c:105 src/reader.c:280
msgid "unterminated comment"
msgstr "ongetermineerd commentaar"
@@ -284,69 +269,65 @@ msgstr "niet getermineerd type naam"
msgid "use \"...\" for multi-character literal tokens"
msgstr "gebruik \"...\" voor meerdere karakters literal tekens"
#: src/lex.c:666
#: src/lex.c:667
#, c-format
msgid "`%s' supports no argument: %s"
msgstr ""
#: src/lex.c:682
#: src/lex.c:683
#, fuzzy, c-format
msgid "`%s' requires an argument"
msgstr "%s: optie `%s' vereist een argument\n"
#: src/main.c:128
#: src/main.c:134
#, fuzzy, c-format
msgid "%s: internal error: %s\n"
msgstr "interne fout, %s\n"
#: src/nullable.c:51
msgid "Entering set_nullable"
msgstr "Inkomende set nullable"
#: src/output.c:986
#: src/output.c:979
#, fuzzy, c-format
msgid "maximum table size (%d) exceeded"
msgstr "maximale tabel grootte (%s) overschreden"
#: src/print.c:37
#: src/print.c:38
#, c-format
msgid " type %d is %s\n"
msgstr ""
#: src/print.c:85
#: src/print.c:78
#, c-format
msgid " (rule %d)"
msgstr " (regel %d)"
#: src/print.c:111
#: src/print.c:98
msgid " $default\taccept\n"
msgstr ""
#: src/print.c:113
#: src/print.c:100
msgid " NO ACTIONS\n"
msgstr " GEEN AKTIES\n"
#: src/print.c:132
#: src/print.c:120
#, c-format
msgid " $ \tgo to state %d\n"
msgstr ""
#: src/print.c:135
#: src/print.c:123
#, c-format
msgid " %-4s\tshift, and go to state %d\n"
msgstr ""
#: src/print.c:159
#: src/print.c:144
#, c-format
msgid " %-4s\terror (nonassociative)\n"
msgstr ""
#: src/print.c:187
#: src/print.c:173
#, c-format
msgid " %-4s\tgo to state %d\n"
msgstr ""
#: src/print.c:199
#: src/print.c:185
#, fuzzy, c-format
msgid "state %d"
msgstr ""
@@ -356,24 +337,28 @@ msgstr ""
"\n"
#. rule # : LHS -> RHS
#: src/print.c:229
#: src/print.c:215
#, fuzzy
msgid "Grammar"
msgstr ""
"\n"
"Grammatica\n"
#: src/print.c:234
#, c-format
msgid "rule %-4d %s ->"
#: src/print.c:216
msgid "Number, Line, Rule"
msgstr ""
#: src/print.c:221
#, fuzzy, c-format
msgid " %3d %3d %s ->"
msgstr "regel %-4d %s ->"
#: src/print.c:240
#: src/print.c:228
msgid "empty"
msgstr ""
#. TERMINAL (type #) : rule #s terminal is on RHS
#: src/print.c:245
#: src/print.c:233
#, fuzzy
msgid "Terminals, with rules where they appear"
msgstr ""
@@ -381,7 +366,7 @@ msgstr ""
"Terminals, met regels waar ze voorkomen\n"
"\n"
#: src/print.c:269
#: src/print.c:257
#, fuzzy
msgid "Nonterminals, with rules where they appear"
msgstr ""
@@ -389,259 +374,268 @@ msgstr ""
"Geen terminals, met regels waar ze voorkomen\n"
"\n"
#: src/print.c:295
#: src/print.c:283
msgid " on left:"
msgstr " links:"
#: src/print.c:310
#: src/print.c:298
msgid " on right:"
msgstr " rechts:"
#: src/print_graph.c:174
#. If something has been added in the NODE_OBSTACK after
#. the declaration of the label, then we need a `\n'.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:165
#, c-format
msgid "%-4s\terror (nonassociative)"
msgstr ""
#: src/print_graph.c:187
#.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:180
#, fuzzy, c-format
msgid "$default\treduce using rule %d (%s)"
msgstr ""
" $default\treduce using rule %d (%s)\n"
"\n"
#: src/reader.c:78
#: src/reader.c:89
msgid " Skipping to next \\n"
msgstr " Verder naar volgende \\n"
#: src/reader.c:80
#: src/reader.c:91
#, c-format
msgid " Skipping to next %c"
msgstr " Verder naar volgende %c"
#: src/reader.c:131 src/reader.c:143
#: src/reader.c:142 src/reader.c:154
msgid "invalid $ value"
msgstr "onjuiste $ waarde"
#: src/reader.c:169 src/reader.c:184
#: src/reader.c:180 src/reader.c:195
msgid "unterminated string at end of file"
msgstr "niet getermineerde string aan einde van bestand"
#: src/reader.c:172
#: src/reader.c:183
msgid "unterminated string"
msgstr "niet getermineerde string"
#: src/reader.c:325 src/reader.c:389
#: src/reader.c:336 src/reader.c:400
#, fuzzy, c-format
msgid "%s is invalid"
msgstr "@%s is onjuist"
#: src/reader.c:365
#: src/reader.c:376
#, c-format
msgid "$$ of `%s' has no declared type"
msgstr "$$ van `%s' heeft geen gedeclareerd type"
#: src/reader.c:382
#: src/reader.c:393
#, fuzzy, c-format
msgid "$%d of `%s' has no declared type"
msgstr "$%s van `%s' heeft geen gedeclareerd type"
#: src/reader.c:436
#: src/reader.c:447
msgid "unterminated `%{' definition"
msgstr "niet getermineerde `%{' definitie"
#: src/reader.c:481 src/reader.c:595 src/reader.c:645
#: src/reader.c:492 src/reader.c:607 src/reader.c:657
#, c-format
msgid "Premature EOF after %s"
msgstr ""
#: src/reader.c:498
#: src/reader.c:509
#, c-format
msgid "symbol `%s' used more than once as a literal string"
msgstr ""
#: src/reader.c:501
#: src/reader.c:512
#, c-format
msgid "symbol `%s' given more than one literal string"
msgstr ""
#: src/reader.c:522 src/reader.c:664
#: src/reader.c:533 src/reader.c:676
#, c-format
msgid "symbol %s redefined"
msgstr "symbool %s opnieuw gedefinieerd"
#: src/reader.c:532 src/reader.c:610 src/reader.c:671 src/reader.c:1294
#: src/reader.c:543 src/reader.c:622 src/reader.c:683 src/reader.c:1292
#, c-format
msgid "type redeclaration for %s"
msgstr "type herdeclaratie voor %s"
#: src/reader.c:541
#: src/reader.c:552
#, c-format
msgid "`%s' is invalid in %s"
msgstr "`%s' is onjuist in %s"
#: src/reader.c:558 src/reader.c:723
#: src/reader.c:570 src/reader.c:735
#, fuzzy, c-format
msgid "multiple %s declarations"
msgstr "meerdere %start declaraties"
#: src/reader.c:560 src/reader.c:902 src/reader.c:927 src/reader.c:1272
#: src/reader.c:572 src/reader.c:914 src/reader.c:939 src/reader.c:1270
#, fuzzy, c-format
msgid "invalid %s declaration"
msgstr "onjuiste %start declaratie"
#: src/reader.c:580
#: src/reader.c:592
msgid "%type declaration has no <typename>"
msgstr "%type declaratie heeft geen <typenaam>"
#: src/reader.c:615
#: src/reader.c:627
#, fuzzy, c-format
msgid "invalid %%type declaration due to item: %s"
msgstr "onjuist %%type declaratie door item: `%s'"
#: src/reader.c:660
#: src/reader.c:672
#, c-format
msgid "redefining precedence of %s"
msgstr "herdefinieren voorganger van %s"
#: src/reader.c:683
#: src/reader.c:695
#, c-format
msgid "invalid text (%s) - number should be after identifier"
msgstr "onjuiste tekst (%s) - nummer hoort na de identifier"
#: src/reader.c:693
#: src/reader.c:705
#, c-format
msgid "unexpected item: %s"
msgstr "onbekend item: %s"
#: src/reader.c:766 src/reader.c:1098 src/reader.c:1169
#: src/reader.c:778 src/reader.c:1110 src/reader.c:1181
#, fuzzy, c-format
msgid "unmatched %s"
msgstr "niet overeenkomstige `{'"
#: src/reader.c:798
#: src/reader.c:810
#, fuzzy, c-format
msgid "argument of %%expect is not an integer"
msgstr "argument van %expect is niet een integer"
#: src/reader.c:844
#: src/reader.c:856
#, c-format
msgid "unrecognized item %s, expected an identifier"
msgstr "onbekend item %s, verwacht een identifier"
#: src/reader.c:866
#: src/reader.c:878
#, c-format
msgid "expected string constant instead of %s"
msgstr "verwacht string constante in plaats van %s"
#: src/reader.c:1014
#: src/reader.c:1026
#, c-format
msgid "unrecognized: %s"
msgstr "onbekend: %s"
#: src/reader.c:1019
#: src/reader.c:1031
msgid "no input grammar"
msgstr "geen invoer grammatica"
#: src/reader.c:1024
#: src/reader.c:1036
#, c-format
msgid "unknown character: %s"
msgstr "onbekend karakter: %s"
#: src/reader.c:1192
#: src/reader.c:1204
#, fuzzy, c-format
msgid "unterminated %guard clause"
msgstr "niet getermineerde %%guard voorwaarde"
#: src/reader.c:1359
#: src/reader.c:1357
msgid "ill-formed rule: initial symbol not followed by colon"
msgstr ""
"slecht geformuleerde regel: initieel symbool niet gevolgd door dubbele punt"
#: src/reader.c:1366
#: src/reader.c:1364
msgid "grammar starts with vertical bar"
msgstr "grammatica start met een verticale bar"
#: src/reader.c:1397
#: src/reader.c:1392
#, c-format
msgid "rule given for %s, which is a token"
msgstr "regel geven voor %s, welke een teken is"
#: src/reader.c:1499
#: src/reader.c:1492
msgid "two @prec's in a row"
msgstr "twee @prec's in een regel"
#: src/reader.c:1507
#: src/reader.c:1500
#, c-format
msgid "%%guard present but %%semantic_parser not specified"
msgstr "%%guard aanwezig maar %%semantic_parser niet gespecificeerd"
#: src/reader.c:1516
#: src/reader.c:1509
msgid "two actions at end of one rule"
msgstr "twee akties aan het einde van een regel"
#: src/reader.c:1530
#: src/reader.c:1523
#, c-format
msgid "type clash (`%s' `%s') on default action"
msgstr "type clash (`%s' `%s') bij standaard aktie"
#: src/reader.c:1536
#: src/reader.c:1529
msgid "empty rule for typed nonterminal, and no action"
msgstr "lege regel voor getypte niet terminal, en geen aktie"
#: src/reader.c:1580
#: src/reader.c:1573
#, c-format
msgid "invalid input: %s"
msgstr "ongeldige invoer: %s"
#: src/reader.c:1588
#: src/reader.c:1581
#, fuzzy, c-format
msgid "too many symbols (tokens plus nonterminals); maximum %d"
msgstr "te veel symbolen (tekens plus nietterminals); maximum %s"
#: src/reader.c:1591
#: src/reader.c:1584
msgid "no rules in the input grammar"
msgstr "geen regels voor invoer grammatica"
#: src/reader.c:1615
#: src/reader.c:1608
#, c-format
msgid "symbol %s is used, but is not defined as a token and has no rules"
msgstr ""
"symbool %s is gebruikt, maar is niet gedefinieerd als een teken en\n"
"heeft geen regels"
#: src/reader.c:1707
#: src/reader.c:1743
#, c-format
msgid "tokens %s and %s both assigned number %d"
msgstr ""
#: src/reader.c:1760
#: src/reader.c:1796
#, c-format
msgid "conflicting precedences for %s and %s"
msgstr "conflictuerende precedentein voor %s en %s"
#: src/reader.c:1772
#: src/reader.c:1808
#, c-format
msgid "conflicting assoc values for %s and %s"
msgstr "conflictuerende associatieve waarden voor %s en %s"
#: src/reader.c:1811
#: src/reader.c:1847
#, c-format
msgid "the start symbol %s is undefined"
msgstr ""
#: src/reader.c:1813
#: src/reader.c:1849
#, c-format
msgid "the start symbol %s is a token"
msgstr "het start symbool %s is een token"
#: src/reduce.c:405
#: src/reduce.c:400
#, fuzzy
msgid "Useless nonterminals:"
msgstr ""
"Onbruikbare niet terminals:\n"
"\n"
#: src/reduce.c:419
#: src/reduce.c:414
#, fuzzy
msgid "Terminals which are not used:"
msgstr ""
@@ -650,7 +644,7 @@ msgstr ""
"Terminals welke niet worden gebruikt:\n"
"\n"
#: src/reduce.c:430
#: src/reduce.c:425
#, fuzzy
msgid "Useless rules:"
msgstr ""
@@ -659,7 +653,7 @@ msgstr ""
"Onbruikbare regels:\n"
"\n"
#: src/reduce.c:458
#: src/reduce.c:451
msgid ""
"Variables\n"
"---------\n"
@@ -669,11 +663,11 @@ msgstr ""
"----------\n"
"\n"
#: src/reduce.c:459
#: src/reduce.c:452
msgid "Value Sprec Sassoc Tag\n"
msgstr "Waarde Sprec Sassoc Tag\n"
#: src/reduce.c:463
#: src/reduce.c:456
msgid ""
"Rules\n"
"-----\n"
@@ -683,7 +677,7 @@ msgstr ""
"------\n"
"\n"
#: src/reduce.c:473
#: src/reduce.c:470
msgid ""
"Rules interpreted\n"
"-----------------\n"
@@ -693,38 +687,30 @@ msgstr ""
"-----------------------\n"
"\n"
#: src/reduce.c:495
#: src/reduce.c:491
#, c-format
msgid "%d rules never reduced\n"
msgstr "%d regels nooit gereduceerd\n"
#: src/reduce.c:501
#: src/reduce.c:497
#, c-format
msgid "%d useless nonterminal%s"
msgstr "%d onbruikbare niet terminal%s"
#: src/reduce.c:506
#: src/reduce.c:502
msgid " and "
msgstr " en "
#: src/reduce.c:510
#: src/reduce.c:506
#, c-format
msgid "%d useless rule%s"
msgstr "%d onbruikbare regels%s"
#: src/reduce.c:540
#: src/reduce.c:536
#, c-format
msgid "Start symbol %s does not derive any sentence"
msgstr "Start symbool %s is niet afkomstig uit een zin"
#: src/reduce.c:553
#, c-format
msgid ""
"reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
msgstr ""
"gereduceerd %s gedefinieerd %d terminal%s, %d nietterminal%s, en %d productie"
"%s.\n"
#: lib/getopt.c:694
#, c-format
msgid "%s: option `%s' is ambiguous\n"
@@ -868,6 +854,22 @@ msgstr ""
#~ msgid "%s contains"
#~ msgstr "%s bevat"
#~ msgid ""
#~ "\n"
#~ "\n"
#~ "\n"
#~ "DERIVES\n"
#~ "\n"
#~ msgstr ""
#~ "\n"
#~ "\n"
#~ "\n"
#~ "AFGELEIDEN\n"
#~ "\n"
#~ msgid "%s derives"
#~ msgstr "%s afgeleiden"
#~ msgid ""
#~ "Usage: %s [-dhklntvyV] [-b file-prefix] [-o outfile] [-p name-prefix]\n"
#~ " [--debug] [--defines] [--fixed-output-files] [--no-lines]\n"
@@ -898,6 +900,9 @@ msgstr ""
#~ msgid "limit of %d exceeded, too many %s"
#~ msgstr "limiet van %d overschreden, te veel %s"
#~ msgid "Entering set_nullable"
#~ msgstr "Inkomende set nullable"
#~ msgid "unterminated comment in `%{' definition"
#~ msgstr "niet getermineerd commentaar in `%{' definitie"
@@ -921,3 +926,9 @@ msgstr ""
#~ msgid "ill-formed %type declaration"
#~ msgstr "slecht geformuleerde %type declaratie"
#~ msgid ""
#~ "reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
#~ msgstr ""
#~ "gereduceerd %s gedefinieerd %d terminal%s, %d nietterminal%s, en %d "
#~ "productie%s.\n"
BIN
View File
Binary file not shown.
+132 -125
View File
@@ -5,7 +5,7 @@
msgid ""
msgstr ""
"Project-Id-Version: bison 1.29\n"
"POT-Creation-Date: 2001-11-12 10:34+0100\n"
"POT-Creation-Date: 2001-11-26 16:23+0100\n"
"PO-Revision-Date: 2001-09-09 13:49+04:00\n"
"Last-Translator: Dmitry S. Sivachenko <[email protected]>\n"
"Language-Team: Russian <[email protected]>\n"
@@ -13,7 +13,7 @@ msgstr ""
"Content-Type: text/plain; charset=koi8-r\n"
"Content-Transfer-Encoding: 8-bit\n"
#: src/LR0.c:207
#: src/LR0.c:189
#, c-format
msgid "too many states (max %d)"
msgstr "ÓÌÉÛËÏÍ ÍÎÏÇÏ ÓÏÓÔÏÑÎÉÊ (ÍÁËÓÉÍÁÌØÎÏ %d)"
@@ -26,7 +26,7 @@ msgstr "
msgid "warning: "
msgstr "ÐÒÅÄÕÐÒÅÖÄÅÎÉÅ: "
#: src/complain.c:238 src/complain.c:279
#: src/complain.c:238
msgid "fatal error: "
msgstr "ÆÁÔÁÌØÎÁÑ ÏÛÉÂËÁ: "
@@ -48,61 +48,61 @@ msgstr "
msgid "an error"
msgstr "ÏÛÉÂËÁ"
#: src/conflicts.c:411
#: src/conflicts.c:389
#, fuzzy, c-format
msgid "%d shift/reduce conflict"
msgid_plural "%d shift/reduce conflicts"
msgstr[0] " %d ËÏÎÆÌÉËÔÏ× ÓÄ×ÉÇÁ/×Ù×ÏÄÁ"
#: src/conflicts.c:418
#: src/conflicts.c:396
#, fuzzy
msgid "and"
msgstr " É"
#: src/conflicts.c:424
#: src/conflicts.c:402
#, fuzzy, c-format
msgid "%d reduce/reduce conflict"
msgid_plural "%d reduce/reduce conflicts"
msgstr[0] " %d ËÏÎÆÌÉËÔÏ× ×Ù×ÏÄÁ/×Ù×ÏÄÁ"
#: src/conflicts.c:448
#: src/conflicts.c:426
#, fuzzy, c-format
msgid "State %d contains "
msgstr "óÏÓÔÏÑÎÉÅ %d ÓÏÄÅÒÖÉÔ"
#. If invoked with `--yacc', use the output format specified by
#. POSIX.
#: src/conflicts.c:481
#: src/conflicts.c:470
msgid "conflicts: "
msgstr "ËÏÎÆÌÉËÔÙ: "
#: src/conflicts.c:483
#: src/conflicts.c:472
#, c-format
msgid " %d shift/reduce"
msgstr " %d ÓÄ×ÉÇ/×Ù×ÏÄ"
#: src/conflicts.c:487
#: src/conflicts.c:476
#, c-format
msgid " %d reduce/reduce"
msgstr " %d ×Ù×ÏÄ/×Ù×ÏÄ"
#: src/conflicts.c:492 src/reduce.c:497
#: src/conflicts.c:481 src/reduce.c:493
#, c-format
msgid "%s contains "
msgstr "%s ÓÏÄÅÒÖÉÔ "
#: src/conflicts.c:500
#: src/conflicts.c:488
#, fuzzy, c-format
msgid "expected %d shift/reduce conflict"
msgid_plural "expected %d shift/reduce conflicts"
msgid "expected %d shift/reduce conflict\n"
msgid_plural "expected %d shift/reduce conflicts\n"
msgstr[0] " %d ËÏÎÆÌÉËÔÏ× ÓÄ×ÉÇÁ/×Ù×ÏÄÁ"
#: src/conflicts.c:587 src/conflicts.c:707
#: src/conflicts.c:575 src/conflicts.c:696
#, c-format
msgid " %-4s\t[reduce using rule %d (%s)]\n"
msgstr " %-4s\t[×Ù×ÏÄ Ó ÉÓÐÏÌØÚÏ×ÁÎÉÅÍ ÐÒÁ×ÉÌÁ %d (%s)]\n"
#: src/conflicts.c:598 src/print.c:171
#: src/conflicts.c:587 src/print.c:156
#, c-format
msgid ""
" $default\treduce using rule %d (%s)\n"
@@ -111,25 +111,16 @@ msgstr ""
" $default\t×Ù×ÏÄ Ó ÉÓÐÏÌØÚÏ×ÁÎÉÅÍ ÐÒÁ×ÉÌÁ %d (%s)\n"
"\n"
#: src/conflicts.c:687 src/conflicts.c:701
#: src/conflicts.c:676 src/conflicts.c:690
#, c-format
msgid " %-4s\treduce using rule %d (%s)\n"
msgstr " %-4s\t×Ù×ÏÄ Ó ÉÓÐÏÌØÚÏ×ÁÎÉÅÍ ÐÒÁ×ÉÌÁ %d (%s)\n"
#: src/conflicts.c:727
#: src/conflicts.c:716
#, c-format
msgid " $default\treduce using rule %d (%s)\n"
msgstr " $default\t×Ù×ÏÄ Ó ÉÓÐÏÌØÚÏ×ÁÎÉÅÍ ÐÒÁ×ÉÌÁ %d (%s)\n"
#: src/derives.c:43
msgid "DERIVES"
msgstr "DERIVES"
#: src/derives.c:48
#, c-format
msgid "%s derives"
msgstr "%s ×Ù×ÏÄÉÔ"
#: src/files.c:143
#, c-format
msgid "cannot open file `%s'"
@@ -238,7 +229,7 @@ msgstr ""
"ðòéçïäîïóôé\n"
"äìñ ïðòåäåìåîîïê ãåìé.\n"
#: src/getargs.c:215 src/lex.c:693
#: src/getargs.c:215 src/lex.c:694
#, c-format
msgid "`%s' is no longer supported"
msgstr "`%s' ÂÏÌØÛÅ ÎÅ ÐÏÄÄÅÒÖÉ×ÁÅÔÓÑ"
@@ -258,7 +249,7 @@ msgstr "%s:
msgid "%s: extra arguments ignored after `%s'\n"
msgstr "%s: ÌÉÛÎÉÅ ÁÒÇÕÍÅÎÔÙ ÐÏÓÌÅ `%s' ÉÇÎÏÒÉÒÏ×ÁÎÙ\n"
#: src/lalr.c:311
#: src/lalr.c:293
#, c-format
msgid "too many gotos (max %d)"
msgstr "ÓÌÉÛËÏÍ ÍÎÏÇÏ goto (ÍÁËÓÉÍÁÌØÎÏ %d)"
@@ -267,7 +258,7 @@ msgstr "
msgid "unexpected `/' found and ignored"
msgstr "×ÓÔÒÅÞÅÎ É ÐÒÏÉÇÎÏÒÉÒÏ×ÁÎ ÎÅÏÖÉÄÁÎÎÙÊ ÓÉÍ×ÏÌ `/'"
#: src/lex.c:105 src/reader.c:269
#: src/lex.c:105 src/reader.c:280
msgid "unterminated comment"
msgstr "ÎÅÚÁËÏÎÞÅÎÎÙÊ ËÏÍÍÅÎÔÁÒÉÊ"
@@ -306,350 +297,359 @@ msgstr "
msgid "use \"...\" for multi-character literal tokens"
msgstr "ÉÓÐÏÌØÚÕÊÔÅ \"...\" ÄÌÑ ÍÎÏÇÏÓÉÍ×ÏÌØÎÙÈ ÌÉÔÅÒÁÌØÎÙÈ ÌÅËÓÅÍ"
#: src/lex.c:666
#: src/lex.c:667
#, c-format
msgid "`%s' supports no argument: %s"
msgstr ""
#: src/lex.c:682
#: src/lex.c:683
#, fuzzy, c-format
msgid "`%s' requires an argument"
msgstr "%s: ËÌÀÞ `%s' ÄÏÌÖÅÎ ÉÓÐÏÌØÚÏ×ÁÔØÓÑ Ó ÁÒÇÕÍÅÎÔÏÍ\n"
#: src/main.c:128
#: src/main.c:134
#, c-format
msgid "%s: internal error: %s\n"
msgstr "%s: ×ÎÕÔÒÅÎÎÑÑ ÏÛÉÂËÁ: %s\n"
#: src/nullable.c:51
msgid "Entering set_nullable"
msgstr "÷ÈÏÄ × set_nullable"
#: src/output.c:986
#: src/output.c:979
#, c-format
msgid "maximum table size (%d) exceeded"
msgstr "ÐÒÅ×ÙÛÅÎ ÍÁËÓÉÍÁÌØÎÙÊ ÒÁÚÍÅÒ ÔÁÂÌÉÃÙ (%d)"
#: src/print.c:37
#: src/print.c:38
#, c-format
msgid " type %d is %s\n"
msgstr " ÔÉÐ %d Ñ×ÌÑÅÔÓÑ %s\n"
#: src/print.c:85
#: src/print.c:78
#, c-format
msgid " (rule %d)"
msgstr " (ÐÒÁ×ÉÌÏ %d)"
#: src/print.c:111
#: src/print.c:98
msgid " $default\taccept\n"
msgstr " $default\tÐÒÉÎÑÔÉÅ\n"
#: src/print.c:113
#: src/print.c:100
msgid " NO ACTIONS\n"
msgstr " îåô äåêóô÷éê\n"
#: src/print.c:132
#: src/print.c:120
#, c-format
msgid " $ \tgo to state %d\n"
msgstr " $ \tÐÅÒÅÈÏÄ × ÓÏÓÔÏÑÎÉÅ %d\n"
#: src/print.c:135
#: src/print.c:123
#, c-format
msgid " %-4s\tshift, and go to state %d\n"
msgstr " %-4s\tÓÄ×ÉÇ, É ÐÅÒÅÈÏÄ × ÓÏÓÔÏÑÎÉÅ %d\n"
#: src/print.c:159
#: src/print.c:144
#, c-format
msgid " %-4s\terror (nonassociative)\n"
msgstr " %-4s\tÏÛÉÂËÁ (ÎÅÁÓÓÏÃÉÁÔÉ×ÎÁÑ)\n"
#: src/print.c:187
#: src/print.c:173
#, c-format
msgid " %-4s\tgo to state %d\n"
msgstr " %-4s\tÐÅÒÅÈÏÄ × ÓÏÓÔÏÑÎÉÅ %d\n"
#: src/print.c:199
#: src/print.c:185
#, c-format
msgid "state %d"
msgstr "ÓÏÓÔÏÑÎÉÅ %d"
#. rule # : LHS -> RHS
#: src/print.c:229
#: src/print.c:215
msgid "Grammar"
msgstr "çÒÁÍÍÁÔÉËÁ"
#: src/print.c:234
#, c-format
msgid "rule %-4d %s ->"
#: src/print.c:216
msgid "Number, Line, Rule"
msgstr ""
#: src/print.c:221
#, fuzzy, c-format
msgid " %3d %3d %s ->"
msgstr "ÐÒÁ×ÉÌÏ %-4d %s ->"
#: src/print.c:240
#: src/print.c:228
msgid "empty"
msgstr ""
#. TERMINAL (type #) : rule #s terminal is on RHS
#: src/print.c:245
#: src/print.c:233
msgid "Terminals, with rules where they appear"
msgstr "ôÅÒÍÉÎÁÌØÎÙÅ ÓÉÍ×ÏÌÙ Ó ÐÒÁ×ÉÌÁÍÉ, × ËÏÔÏÒÙÈ ÏÎÉ ÐÏÑ×ÌÑÀÔÓÑ"
#: src/print.c:269
#: src/print.c:257
msgid "Nonterminals, with rules where they appear"
msgstr "îÅÔÅÒÍÉÎÁÌØÎÙÅ ÓÉÍ×ÏÌÙ Ó ÐÒÁ×ÉÌÁÍÉ, × ËÏÔÏÒÙÈ ÏÎÉ ÐÏÑ×ÌÑÀÔÓÑ"
#: src/print.c:295
#: src/print.c:283
msgid " on left:"
msgstr " ÎÁÌÅ×Ï:"
#: src/print.c:310
#: src/print.c:298
msgid " on right:"
msgstr " ÎÁÐÒÁ×Ï:"
#: src/print_graph.c:174
#. If something has been added in the NODE_OBSTACK after
#. the declaration of the label, then we need a `\n'.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:165
#, c-format
msgid "%-4s\terror (nonassociative)"
msgstr "%-4s\tÏÛÉÂËÁ (ÎÅÁÓÓÏÃÉÁÔÉ×ÎÁÑ)"
#: src/print_graph.c:187
#.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:180
#, c-format
msgid "$default\treduce using rule %d (%s)"
msgstr "$default\t×Ù×ÏÄ Ó ÉÓÐÏÌØÚÏ×ÁÎÉÅÍ ÐÒÁ×ÉÌÁ %d (%s)"
#: src/reader.c:78
#: src/reader.c:89
msgid " Skipping to next \\n"
msgstr " ðÒÏÐÕÓË ÄÏ ÓÌÅÄÕÀÝÅÇÏ \\n"
#: src/reader.c:80
#: src/reader.c:91
#, c-format
msgid " Skipping to next %c"
msgstr " ðÒÏÐÕÓË ÄÏ ÓÌÅÄÕÀÝÅÇÏ %c"
#: src/reader.c:131 src/reader.c:143
#: src/reader.c:142 src/reader.c:154
msgid "invalid $ value"
msgstr "ÎÅ×ÅÒÎÏÅ $ ÚÎÁÞÅÎÉÅ"
#: src/reader.c:169 src/reader.c:184
#: src/reader.c:180 src/reader.c:195
msgid "unterminated string at end of file"
msgstr "ÎÅÚÁËÏÎÞÅÎÎÁÑ ÓÔÒÏËÁ × ËÏÎÃÅ ÆÁÊÌÁ"
#: src/reader.c:172
#: src/reader.c:183
msgid "unterminated string"
msgstr "ÎÅÚÁËÏÎÞÅÎÎÁÑ ÓÔÒÏËÁ"
#: src/reader.c:325 src/reader.c:389
#: src/reader.c:336 src/reader.c:400
#, c-format
msgid "%s is invalid"
msgstr "ÎÅ×ÅÒÎÙÊ ÚÎÁË %s"
#: src/reader.c:365
#: src/reader.c:376
#, c-format
msgid "$$ of `%s' has no declared type"
msgstr "$$ × `%s' ÎÅ ÉÍÅÅÔ ÏÐÉÓÁÎÎÏÇÏ ÔÉÐÁ"
#: src/reader.c:382
#: src/reader.c:393
#, c-format
msgid "$%d of `%s' has no declared type"
msgstr "$%d ÉÚ `%s' ÎÅ ÉÍÅÅÔ ÏÐÉÓÁÎÎÏÇÏ ÔÉÐÁ"
#: src/reader.c:436
#: src/reader.c:447
msgid "unterminated `%{' definition"
msgstr "ÎÅÚÁËÏÎÞÅÎÎÏÅ ÏÐÒÅÄÅÌÅÎÉÅ `%{'"
#: src/reader.c:481 src/reader.c:595 src/reader.c:645
#: src/reader.c:492 src/reader.c:607 src/reader.c:657
#, c-format
msgid "Premature EOF after %s"
msgstr "ðÒÅÖÄÅ×ÒÅÍÅÎÎÙÊ ËÏÎÅà ÆÁÊÌÁ ÐÏÓÌÅ %s"
#: src/reader.c:498
#: src/reader.c:509
#, c-format
msgid "symbol `%s' used more than once as a literal string"
msgstr ""
#: src/reader.c:501
#: src/reader.c:512
#, c-format
msgid "symbol `%s' given more than one literal string"
msgstr ""
#: src/reader.c:522 src/reader.c:664
#: src/reader.c:533 src/reader.c:676
#, c-format
msgid "symbol %s redefined"
msgstr "ÐÏ×ÔÏÒÎÏÅ ÏÐÒÅÄÅÌÅÎÉÅ ÓÉÍ×ÏÌÁ %s"
#: src/reader.c:532 src/reader.c:610 src/reader.c:671 src/reader.c:1294
#: src/reader.c:543 src/reader.c:622 src/reader.c:683 src/reader.c:1292
#, c-format
msgid "type redeclaration for %s"
msgstr "ÐÏ×ÔÏÒÎÏÅ ÏÐÉÓÁÎÉÅ ÔÉÐÁ ÄÌÑ %s"
#: src/reader.c:541
#: src/reader.c:552
#, c-format
msgid "`%s' is invalid in %s"
msgstr "`%s' ÎÅ×ÅÒÎÏ × %s"
#: src/reader.c:558 src/reader.c:723
#: src/reader.c:570 src/reader.c:735
#, c-format
msgid "multiple %s declarations"
msgstr "ÍÎÏÖÅÓÔ×ÅÎÎÏÅ ÏÐÉÓÁÎÉÅ %s"
#: src/reader.c:560 src/reader.c:902 src/reader.c:927 src/reader.c:1272
#: src/reader.c:572 src/reader.c:914 src/reader.c:939 src/reader.c:1270
#, c-format
msgid "invalid %s declaration"
msgstr "ÎÅ×ÅÒÎÏÅ ÏÐÉÓÁÎÉÅ %s"
#: src/reader.c:580
#: src/reader.c:592
msgid "%type declaration has no <typename>"
msgstr "ÏÐÉÓÁÎÉÅ %type ÎÅ ÉÍÅÅÔ <ÉÍÑ_ÔÉÐÁ>"
#: src/reader.c:615
#: src/reader.c:627
#, c-format
msgid "invalid %%type declaration due to item: %s"
msgstr "ÎÅ×ÅÒÎÏÅ ÏÐÉÓÁÎÉÅ %%type ÉÚ-ÚÁ ÜÌÅÍÅÎÔÁ: %s"
#: src/reader.c:660
#: src/reader.c:672
#, c-format
msgid "redefining precedence of %s"
msgstr "ÐÅÒÅÏÐÒÅÄÅÌÅÎÉÅ ÐÒÉÏÒÉÔÅÔÁ ÄÌÑ %s"
#: src/reader.c:683
#: src/reader.c:695
#, c-format
msgid "invalid text (%s) - number should be after identifier"
msgstr "ÎÅ×ÅÒÎÙÊ ÔÅËÓÔ (%s) - ÞÉÓÌÏ ÄÏÌÖÎÏ ÓÌÅÄÏ×ÁÔØ ÚÁ ÉÄÅÎÔÉÆÉËÁÔÏÒÏÍ"
#: src/reader.c:693
#: src/reader.c:705
#, c-format
msgid "unexpected item: %s"
msgstr "ÎÅÏÖÉÄÁÎÎÙÊ ÜÌÅÍÅÎÔ: %s"
#: src/reader.c:766 src/reader.c:1098 src/reader.c:1169
#: src/reader.c:778 src/reader.c:1110 src/reader.c:1181
#, c-format
msgid "unmatched %s"
msgstr "ÎÅÐÁÒÎÁÑ %s"
#: src/reader.c:798
#: src/reader.c:810
#, c-format
msgid "argument of %%expect is not an integer"
msgstr "ÁÒÇÕÍÅÎÔ %%expect ÎÅ Ñ×ÌÑÅÔÓÑ ÃÅÌÙÍ ÞÉÓÌÏÍ"
#: src/reader.c:844
#: src/reader.c:856
#, c-format
msgid "unrecognized item %s, expected an identifier"
msgstr "ÎÅÒÁÓÐÏÚÎÁÎÎÙÊ ÜÌÅÍÅÎÔ %s, ÏÖÉÄÁÌÓÑ ÉÄÅÎÔÉÆÉËÁÔÏÒ"
#: src/reader.c:866
#: src/reader.c:878
#, c-format
msgid "expected string constant instead of %s"
msgstr "×ÍÅÓÔÏ %s ÏÖÉÄÁÌÁÓØ ÓÔÒÏËÏ×ÁÑ ÐÏÓÔÏÑÎÎÁÑ"
#: src/reader.c:1014
#: src/reader.c:1026
#, c-format
msgid "unrecognized: %s"
msgstr "ÎÅÒÁÓÐÏÚÎÁÎÏ: %s"
#: src/reader.c:1019
#: src/reader.c:1031
msgid "no input grammar"
msgstr "ÎÅÔ ×ÈÏÄÎÏÊ ÇÒÁÍÍÁÔÉËÉ"
#: src/reader.c:1024
#: src/reader.c:1036
#, c-format
msgid "unknown character: %s"
msgstr "ÎÅÉÚ×ÅÓÔÎÙÊ ÓÉÍ×ÏÌ: %s"
#: src/reader.c:1192
#: src/reader.c:1204
#, c-format
msgid "unterminated %guard clause"
msgstr "ÎÅÚÁËÏÎÞÅÎÎÙÊ ÏÐÅÒÁÔÏÒ %guard"
#: src/reader.c:1359
#: src/reader.c:1357
msgid "ill-formed rule: initial symbol not followed by colon"
msgstr "ÎÅ×ÅÒÎÏÅ ÐÒÁ×ÉÌÏ: Ä×ÏÅÔÏÞÉÅ ÎÅ ÓÌÅÄÕÅÔ ÚÁ ÎÁÞÁÌØÎÙÍ ÓÉÍ×ÏÌÏÍ"
#: src/reader.c:1366
#: src/reader.c:1364
msgid "grammar starts with vertical bar"
msgstr "ÇÒÁÍÍÁÔÉËÁ ÎÁÞÉÎÁÅÔÓÑ Ó ×ÅÒÔÉËÁÌØÎÏÊ ÞÅÒÔÙ"
#: src/reader.c:1397
#: src/reader.c:1392
#, c-format
msgid "rule given for %s, which is a token"
msgstr "ÐÒÁ×ÉÌÏ ÚÁÄÁÎÏ ÄÌÑ %s, ËÏÔÏÒÙÊ Ñ×ÌÑÅÔÓÑ ÌÅËÓÅÍÏÊ"
#: src/reader.c:1499
#: src/reader.c:1492
msgid "two @prec's in a row"
msgstr "Ä×Á @prec ÐÏÄÒÑÄ"
#: src/reader.c:1507
#: src/reader.c:1500
#, c-format
msgid "%%guard present but %%semantic_parser not specified"
msgstr "%%guard ÐÒÉÓÕÔÓÔ×ÕÅÔ, Á %%semantic_parser ÎÅ ÚÁÄÁÎ"
#: src/reader.c:1516
#: src/reader.c:1509
msgid "two actions at end of one rule"
msgstr "Ä×Á ÄÅÊÓÔ×ÉÑ × ËÏÎÃÅ ÏÄÎÏÇÏ ÐÒÁ×ÉÌÁ"
#: src/reader.c:1530
#: src/reader.c:1523
#, c-format
msgid "type clash (`%s' `%s') on default action"
msgstr "ËÏÎÆÌÉËÔ ÔÉÐÏ× (`%s' `%s') ÎÁ ÄÅÊÓÔ×ÉÉ ÐÏ ÕÍÏÌÞÁÎÉÀ"
#: src/reader.c:1536
#: src/reader.c:1529
msgid "empty rule for typed nonterminal, and no action"
msgstr ""
"ÐÕÓÔÏÅ ÐÒÁ×ÉÌÏ ÄÌÑ ÔÉÐÉÚÉÒÏ×ÁÎÎÏÇÏ ÎÅÔÅÒÍÉÎÁÌØÎÏÇÏ ÓÉÍ×ÏÌÁ, É ÎÅÔ ÄÅÊÓÔ×ÉÑ"
#: src/reader.c:1580
#: src/reader.c:1573
#, c-format
msgid "invalid input: %s"
msgstr "ÎÅ×ÅÒÎÙÅ ×ÈÏÄÎÙÅ ÄÁÎÎÙÅ: %s"
#: src/reader.c:1588
#: src/reader.c:1581
#, c-format
msgid "too many symbols (tokens plus nonterminals); maximum %d"
msgstr "ÓÌÉÛËÏÍ ÍÎÏÇÏ ÓÉÍ×ÏÌÏ× (ÌÅËÓÅÍÙ ÐÌÀÓ ÎÅÔÅÒÍÉÎÁÌÙ); ÍÁËÓÉÍÁÌØÎÏ %d"
#: src/reader.c:1591
#: src/reader.c:1584
msgid "no rules in the input grammar"
msgstr "ÏÔÓÕÔÓÔ×ÕÀÔ ÐÒÁ×ÉÌÁ ×Ï ×ÈÏÄÎÏÊ ÇÒÁÍÍÁÔÉËÅ"
#: src/reader.c:1615
#: src/reader.c:1608
#, c-format
msgid "symbol %s is used, but is not defined as a token and has no rules"
msgstr "ÓÉÍ×ÏÌ %s ÉÓÐÏÌØÚÕÅÔÓÑ, ÎÏ ÎÅ ÏÐÒÅÄÅÌÅÎ ËÁË ÌÅËÓÅÍÁ É ÎÅ ÉÍÅÅÔ ÐÒÁ×ÉÌ"
#: src/reader.c:1707
#: src/reader.c:1743
#, c-format
msgid "tokens %s and %s both assigned number %d"
msgstr "ÏÂÅÉÍ ÌÅËÓÅÍÁÍ %s É %s ÐÒÉÓ×ÏÅÎ ÎÏÍÅÒ %d"
#: src/reader.c:1760
#: src/reader.c:1796
#, c-format
msgid "conflicting precedences for %s and %s"
msgstr "ÐÒÏÔÉ×ÏÒÅÞÉ×ÙÅ ÐÒÉÏÒÉÔÅÔÙ ÄÌÑ %s É %s"
#: src/reader.c:1772
#: src/reader.c:1808
#, c-format
msgid "conflicting assoc values for %s and %s"
msgstr "ÐÒÏÔÉ×ÏÒÅÞÉ×ÙÅ ÚÎÁÞÅÎÉÑ ÁÓÓÏÃÉÁÔÉ×ÎÏÓÔÉ ÄÌÑ %s É %s"
#: src/reader.c:1811
#: src/reader.c:1847
#, c-format
msgid "the start symbol %s is undefined"
msgstr "ÎÁÞÁÌØÎÙÊ ÓÉÍ×ÏÌ %s ÎÅÏÐÒÅÄÅÌÅÎ"
#: src/reader.c:1813
#: src/reader.c:1849
#, c-format
msgid "the start symbol %s is a token"
msgstr "ÎÁÞÁÌØÎÙÊ ÓÉÍ×ÏÌ %s Ñ×ÌÑÅÔÓÑ ÌÅËÓÅÍÏÊ"
#: src/reduce.c:405
#: src/reduce.c:400
msgid "Useless nonterminals:"
msgstr "âÅÓÐÏÌÅÚÎÙÅ ÎÅÔÅÒÍÉÎÁÌÙ:"
#: src/reduce.c:419
#: src/reduce.c:414
msgid "Terminals which are not used:"
msgstr "îÅÉÓÐÏÌØÚÏ×ÁÎÎÙÅ ÔÅÒÍÉÎÁÌÙ:"
#: src/reduce.c:430
#: src/reduce.c:425
msgid "Useless rules:"
msgstr "âÅÓÐÏÌÅÚÎÙÅ ÐÒÁ×ÉÌÁ:"
#: src/reduce.c:458
#: src/reduce.c:451
msgid ""
"Variables\n"
"---------\n"
@@ -659,11 +659,11 @@ msgstr ""
"----------\n"
"\n"
#: src/reduce.c:459
#: src/reduce.c:452
msgid "Value Sprec Sassoc Tag\n"
msgstr "úÎÁÞ ðÒÉÏÒ áÓÓÏÃ ôÅÇ\n"
#: src/reduce.c:463
#: src/reduce.c:456
msgid ""
"Rules\n"
"-----\n"
@@ -673,7 +673,7 @@ msgstr ""
"-------\n"
"\n"
#: src/reduce.c:473
#: src/reduce.c:470
msgid ""
"Rules interpreted\n"
"-----------------\n"
@@ -683,38 +683,30 @@ msgstr ""
"--------------------------\n"
"\n"
#: src/reduce.c:495
#: src/reduce.c:491
#, c-format
msgid "%d rules never reduced\n"
msgstr "%d ÐÒÁ×ÉÌ ÎÅ Ó×ÅÄÅÎÏ\n"
#: src/reduce.c:501
#: src/reduce.c:497
#, c-format
msgid "%d useless nonterminal%s"
msgstr "%d ÂÅÓÐÏÌÅÚÎÙÈ ÎÅÔÅÒÍÉÎÁÌÏ×%s"
#: src/reduce.c:506
#: src/reduce.c:502
msgid " and "
msgstr " É "
#: src/reduce.c:510
#: src/reduce.c:506
#, c-format
msgid "%d useless rule%s"
msgstr "%d ÂÅÓÐÏÌÅÚÎÙÈ ÐÒÁ×ÉÌ%s"
#: src/reduce.c:540
#: src/reduce.c:536
#, c-format
msgid "Start symbol %s does not derive any sentence"
msgstr "îÁÞÁÌØÎÙÊ ÓÉÍ×ÏÌ %s ÎÅ ×Ù×ÏÄÉÔ ÎÉ ÏÄÎÏÇÏ ÐÒÅÄÌÏÖÅÎÉÑ"
#: src/reduce.c:553
#, c-format
msgid ""
"reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
msgstr ""
"×Ù×ÅÄÅÎÎÙÊ %s ÏÐÒÅÄÅÌÑÅÔ %d ÔÅÒÍÉÎÁÌÏ×%s, %d ÎÅÔÅÒÍÉÎÁÌÏ×%s, É %d ÐÒÁ×ÉÌ "
"×Ù×ÏÄÁ%s.\n"
#: lib/getopt.c:694
#, c-format
msgid "%s: option `%s' is ambiguous\n"
@@ -811,6 +803,15 @@ msgstr "'"
#~ msgid "%s contains"
#~ msgstr "%s ÓÏÄÅÒÖÉÔ"
#~ msgid "DERIVES"
#~ msgstr "DERIVES"
#~ msgid "%s derives"
#~ msgstr "%s ×Ù×ÏÄÉÔ"
#~ msgid "Entering set_nullable"
#~ msgstr "÷ÈÏÄ × set_nullable"
#~ msgid "\t\t/* empty */"
#~ msgstr "\t\t/* ÐÕÓÔÏ */"
@@ -820,5 +821,11 @@ msgstr "'"
#~ msgid "multiple %%source_extension declarations"
#~ msgstr "ÍÎÏÖÅÓÔ×ÅÎÎÙÅ ÏÐÉÓÁÎÉÑ %%source_extension"
#~ msgid ""
#~ "reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
#~ msgstr ""
#~ "×Ù×ÅÄÅÎÎÙÊ %s ÏÐÒÅÄÅÌÑÅÔ %d ÔÅÒÍÉÎÁÌÏ×%s, %d ÎÅÔÅÒÍÉÎÁÌÏ×%s, É %d ÐÒÁ×ÉÌ "
#~ "×Ù×ÏÄÁ%s.\n"
#~ msgid "@%s is invalid"
#~ msgstr "ÎÅ×ÅÒÎÙÊ ÚÎÁË @%s"
+804
View File
@@ -0,0 +1,804 @@
# Swedish messages for bison.
# Copyright © 2001 Free Software Foundation, Inc.
# Göran Uddeborg <[email protected]>, 2001.
# $Revision$
#
msgid ""
msgstr ""
"Project-Id-Version: bison 1.30d\n"
"POT-Creation-Date: 2001-11-26 16:23+0100\n"
"PO-Revision-Date: 2001-11-21 22:10+0100\n"
"Last-Translator: Göran Uddeborg <[email protected]>\n"
"Language-Team: Swedish <[email protected]>\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=iso-8859-1\n"
"Content-Transfer-Encoding: 8bit\n"
"Plural-Forms: nplurals=2; plural=(n != 1);\n"
#: src/LR0.c:189
#, c-format
msgid "too many states (max %d)"
msgstr "för många tillstånd (max %d)"
#: lib/error.c:128 lib/error.c:156 src/complain.c:96
msgid "Unknown system error"
msgstr "Okänt systemfel"
#: src/complain.c:150
msgid "warning: "
msgstr "varning: "
#: src/complain.c:238
msgid "fatal error: "
msgstr "ödesdigert fel: "
#: src/conflicts.c:45
#, c-format
msgid "Conflict in state %d between rule %d and token %s resolved as %s.\n"
msgstr ""
"Konflikt i tillstånd %d mellan regel %d och element %s, löstes med %s.\n"
#: src/conflicts.c:111 src/conflicts.c:134
msgid "reduce"
msgstr "reducera"
#: src/conflicts.c:117 src/conflicts.c:130
msgid "shift"
msgstr "skifta"
#: src/conflicts.c:138
msgid "an error"
msgstr "ett fel"
#: src/conflicts.c:389
#, c-format
msgid "%d shift/reduce conflict"
msgid_plural "%d shift/reduce conflicts"
msgstr[0] "%d skifta/reducerakonflikt"
msgstr[1] "%d skifta/reducerakonflikter"
#: src/conflicts.c:396
msgid "and"
msgstr "och"
#: src/conflicts.c:402
#, c-format
msgid "%d reduce/reduce conflict"
msgid_plural "%d reduce/reduce conflicts"
msgstr[0] "%d reducera/reducerakonflikt"
msgstr[1] "%d reducera/reducerakonflikter"
#: src/conflicts.c:426
#, c-format
msgid "State %d contains "
msgstr "Tillstånd %d innehåller "
#. If invoked with `--yacc', use the output format specified by
#. POSIX.
#: src/conflicts.c:470
msgid "conflicts: "
msgstr "konflikter: "
#: src/conflicts.c:472
#, c-format
msgid " %d shift/reduce"
msgstr " %d skifta/reducera"
#: src/conflicts.c:476
#, c-format
msgid " %d reduce/reduce"
msgstr " %d reducera/reducera"
#: src/conflicts.c:481 src/reduce.c:493
#, c-format
msgid "%s contains "
msgstr "%s innehåller "
#: src/conflicts.c:488
#, c-format
msgid "expected %d shift/reduce conflict\n"
msgid_plural "expected %d shift/reduce conflicts\n"
msgstr[0] "förväntade %d skifta/reducerakonflikt\n"
msgstr[1] "förväntade %d skifta/reducerakonflikter\n"
#: src/conflicts.c:575 src/conflicts.c:696
#, c-format
msgid " %-4s\t[reduce using rule %d (%s)]\n"
msgstr " %-4s\t[reducera med regel %d (%s)]\n"
#: src/conflicts.c:587 src/print.c:156
#, c-format
msgid ""
" $default\treduce using rule %d (%s)\n"
"\n"
msgstr ""
" $standard\treducera med regel %d (%s)\n"
"\n"
#: src/conflicts.c:676 src/conflicts.c:690
#, c-format
msgid " %-4s\treduce using rule %d (%s)\n"
msgstr " %-4s\treducera med regel %d (%s)\n"
#: src/conflicts.c:716
#, c-format
msgid " $default\treduce using rule %d (%s)\n"
msgstr " $standard\treducera med regel %d (%s)\n"
#: src/files.c:143
#, c-format
msgid "cannot open file `%s'"
msgstr "kan inte öppna filen \"%s\""
#: src/files.c:162
msgid "cannot close file"
msgstr "kan inte stänga fil"
#. Some efforts were made to ease the translators' task, please
#. continue.
#: src/getargs.c:84
msgid "GNU bison generates parsers for LALR(1) grammars.\n"
msgstr "GNU bison genererar parsrar för LALR(1)-grammatiker.\n"
#: src/getargs.c:88
#, c-format
msgid "Usage: %s [OPTION]... FILE\n"
msgstr "Användning: %s [FLAGGA]... FIL\n"
#: src/getargs.c:92
msgid ""
"If a long option shows an argument as mandatory, then it is mandatory\n"
"for the equivalent short option also. Similarly for optional arguments.\n"
msgstr ""
"Om en lång flagga visar ett argument som obligatoriskt är det\n"
"obligatoriskt för den motsvarande korta flaggan också. Motsvarande\n"
"för valfria argument.\n"
#: src/getargs.c:98
msgid ""
"Operation modes:\n"
" -h, --help display this help and exit\n"
" -V, --version output version information and exit\n"
" -y, --yacc emulate POSIX yacc\n"
msgstr ""
"Arbetslägen:\n"
" -h, --help visa denna hjälptext och avsluta\n"
" -V, --version visa versionsinformation och avsluta\n"
" -y, --yacc emulera POSIX-yacc\n"
#: src/getargs.c:105
msgid ""
"Parser:\n"
" -S, --skeleton=FILE specify the skeleton to use\n"
" -t, --debug instrument the parser for debugging\n"
" --locations enable locations computation\n"
" -p, --name-prefix=PREFIX prepend PREFIX to the external symbols\n"
" -l, --no-lines don't generate `#line' directives\n"
" -n, --no-parser generate the tables only\n"
" -k, --token-table include a table of token names\n"
msgstr ""
"Tolk:\n"
" -S, --skeleton=FIL ange skelettfilen som skall användas\n"
" -t, --debug instrumentera tolken för felsökning\n"
" --locations aktivera lägesberäkning\n"
" -p, --name-prefix=PREFIX lägg till PREFIX före externa symboler\n"
" -l, --no-lines generera inte \"#line\"-direktiv\n"
" -n, --no-parser generera endast tabellerna\n"
" -k, --token-table inkludera en tabell över elementnamn\n"
#: src/getargs.c:117
msgid ""
"Output:\n"
" -d, --defines also produce a header file\n"
" -v, --verbose also produce an explanation of the automaton\n"
" -b, --file-prefix=PREFIX specify a PREFIX for output files\n"
" -o, --output=FILE leave output to FILE\n"
" -g, --graph also produce a VCG description of the "
"automaton\n"
msgstr ""
"Utdata:\n"
" -d, --defines skapa också en huvudfil\n"
" -v, --verbose skapa också en förklaring av automaten\n"
" -b, --file-prefix=PREFIX ange ett PREFIX för utdatafiler\n"
" -o, --output=FIL lägg utdata i FIL\n"
" -g, --graph skapa också en VCG-beskrivning av automaten\n"
#: src/getargs.c:127
msgid "Report bugs to <[email protected]>.\n"
msgstr ""
"Rapportera fel till <[email protected]>.\n"
"Rapportera anmärkningar på översättningen till <[email protected]>.\n"
#. Some efforts were made to ease the translators' task, please
#. continue.
#: src/getargs.c:141
#, c-format
msgid "bison (GNU Bison) %s"
msgstr "bison (GNU Bison) %s"
#: src/getargs.c:146
msgid ""
"Copyright 1984, 1986, 1989, 1992, 2000, 2001 Free Software Foundation, Inc.\n"
msgstr ""
"Copyright 1984, 1986, 1989, 1992, 2000, 2001 Free Software Foundation, Inc.\n"
#: src/getargs.c:150
msgid ""
"This is free software; see the source for copying conditions. There is NO\n"
"warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n"
msgstr ""
"Detta är fri programvara, se källkoden för kopieringsvillkor. Det\n"
"finns INGEN garanti, inte ens för SÄLJBARHET eller LÄMPLIGHET FÖR ETT\n"
"SPECIELLT ÄNDAMÅL.\n"
#: src/getargs.c:215 src/lex.c:694
#, c-format
msgid "`%s' is no longer supported"
msgstr "\"%s\" stöds inte längre"
#: src/getargs.c:239
#, c-format
msgid "Try `%s --help' for more information.\n"
msgstr "Försök med \"%s --help\" för mer information.\n"
#: src/getargs.c:246
#, c-format
msgid "%s: no grammar file given\n"
msgstr "%s: ingen grammatikfil angiven\n"
#: src/getargs.c:250
#, c-format
msgid "%s: extra arguments ignored after `%s'\n"
msgstr "%s: extra argument ignorerade efter \"%s\"\n"
#: src/lalr.c:293
#, c-format
msgid "too many gotos (max %d)"
msgstr "för många goto (max %d)"
#: src/lex.c:76
msgid "unexpected `/' found and ignored"
msgstr "oväntat \"/\" hittat och ignorerat"
#: src/lex.c:105 src/reader.c:280
msgid "unterminated comment"
msgstr "oavslutad kommentar"
#: src/lex.c:137
msgid "unexpected end of file"
msgstr "oväntat filslut"
#: src/lex.c:166
msgid "unescaped newline in constant"
msgstr "oskyddat nyradstecken i konstant"
#: src/lex.c:208
#, c-format
msgid "octal value outside range 0...255: `\\%o'"
msgstr "oktalt värde utanför intervallet 0-255: \"\\%o\""
#: src/lex.c:233
#, c-format
msgid "hexadecimal value above 255: `\\x%x'"
msgstr "hexadecimalt värde över 255: \"\\x%x\""
#: src/lex.c:245
#, c-format
msgid "unknown escape sequence: `\\' followed by `%s'"
msgstr "okänd specialsekvens: \"\\\" följt av \"%s\""
#: src/lex.c:342
msgid "unterminated type name at end of file"
msgstr "oavslutat typnamn vid filslut"
#: src/lex.c:345
msgid "unterminated type name"
msgstr "oavslutat typnamn"
#: src/lex.c:438
msgid "use \"...\" for multi-character literal tokens"
msgstr "använd \"...\" för bokstavliga element med mer än ett tecken"
#: src/lex.c:667
#, c-format
msgid "`%s' supports no argument: %s"
msgstr "\"%s\" stödjer inga argument: %s"
#: src/lex.c:683
#, c-format
msgid "`%s' requires an argument"
msgstr "\"%s\" behöver ett argument"
#: src/main.c:134
#, c-format
msgid "%s: internal error: %s\n"
msgstr "%s: internt fel: %s\n"
#: src/output.c:979
#, c-format
msgid "maximum table size (%d) exceeded"
msgstr "maximal tabellstorlek (%d) överskriden"
#: src/print.c:38
#, c-format
msgid " type %d is %s\n"
msgstr " typ %d är %s\n"
#: src/print.c:78
#, c-format
msgid " (rule %d)"
msgstr " (regel %d)"
#: src/print.c:98
msgid " $default\taccept\n"
msgstr " $standard\tacceptera\n"
#: src/print.c:100
msgid " NO ACTIONS\n"
msgstr " INGA ÅTGÄRDER\n"
#: src/print.c:120
#, c-format
msgid " $ \tgo to state %d\n"
msgstr " $ \tgå till tillstånd %d\n"
#: src/print.c:123
#, c-format
msgid " %-4s\tshift, and go to state %d\n"
msgstr " %-4s\tskifta, och gå till tillstånd %d\n"
#: src/print.c:144
#, c-format
msgid " %-4s\terror (nonassociative)\n"
msgstr " %-4s\tfel (ickeassociativ)\n"
#: src/print.c:173
#, c-format
msgid " %-4s\tgo to state %d\n"
msgstr " %-4s\tgå till tillstånd %d\n"
#: src/print.c:185
#, c-format
msgid "state %d"
msgstr "tillstånd %d"
#. rule # : LHS -> RHS
#: src/print.c:215
msgid "Grammar"
msgstr "Grammatik"
#: src/print.c:216
msgid "Number, Line, Rule"
msgstr ""
#: src/print.c:221
#, fuzzy, c-format
msgid " %3d %3d %s ->"
msgstr "regel %-4d %s ->"
#: src/print.c:228
msgid "empty"
msgstr "tom"
#. TERMINAL (type #) : rule #s terminal is on RHS
#: src/print.c:233
msgid "Terminals, with rules where they appear"
msgstr "Terminaler, med regler där de förekommer"
#: src/print.c:257
msgid "Nonterminals, with rules where they appear"
msgstr "Icketerminaler, med regler där de förekommer"
#: src/print.c:283
msgid " on left:"
msgstr " till vänster:"
#: src/print.c:298
msgid " on right:"
msgstr " till höger:"
#. If something has been added in the NODE_OBSTACK after
#. the declaration of the label, then we need a `\n'.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:165
#, c-format
msgid "%-4s\terror (nonassociative)"
msgstr "%-4s\tfel (ickeassociativ)"
#.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:180
#, c-format
msgid "$default\treduce using rule %d (%s)"
msgstr "$standard\treducera med regel %d (%s)"
#: src/reader.c:89
msgid " Skipping to next \\n"
msgstr " Hoppar över till nästa \\n"
#: src/reader.c:91
#, c-format
msgid " Skipping to next %c"
msgstr " Hoppar över till nästa %c"
#: src/reader.c:142 src/reader.c:154
msgid "invalid $ value"
msgstr "felaktigt $-värde"
#: src/reader.c:180 src/reader.c:195
msgid "unterminated string at end of file"
msgstr "oavslutad sträng vid filslut"
#: src/reader.c:183
msgid "unterminated string"
msgstr "oavslutad sträng"
#: src/reader.c:336 src/reader.c:400
#, c-format
msgid "%s is invalid"
msgstr "%s är felaktigt"
#: src/reader.c:376
#, c-format
msgid "$$ of `%s' has no declared type"
msgstr "$$ för \"%s\" har ingen deklarerad typ"
#: src/reader.c:393
#, c-format
msgid "$%d of `%s' has no declared type"
msgstr "$%d för \"%s\" har ingen deklarerad typ"
#: src/reader.c:447
msgid "unterminated `%{' definition"
msgstr "oavslutad \"%{\"-definition"
#: src/reader.c:492 src/reader.c:607 src/reader.c:657
#, c-format
msgid "Premature EOF after %s"
msgstr "Förtida filslut efter %s"
#: src/reader.c:509
#, c-format
msgid "symbol `%s' used more than once as a literal string"
msgstr "symbolen \"%s\" används mer än en gång som en bokstavlig sträng"
#: src/reader.c:512
#, c-format
msgid "symbol `%s' given more than one literal string"
msgstr "symbolen \"%s\" har fått mer än en bokstavlig sträng"
#: src/reader.c:533 src/reader.c:676
#, c-format
msgid "symbol %s redefined"
msgstr "symbolen %s omdefinierad"
#: src/reader.c:543 src/reader.c:622 src/reader.c:683 src/reader.c:1292
#, c-format
msgid "type redeclaration for %s"
msgstr "typen omdeklarerad för %s"
#: src/reader.c:552
#, c-format
msgid "`%s' is invalid in %s"
msgstr "\"%s\" är felaktig i %s"
#: src/reader.c:570 src/reader.c:735
#, c-format
msgid "multiple %s declarations"
msgstr "flera %s-deklarationer"
#: src/reader.c:572 src/reader.c:914 src/reader.c:939 src/reader.c:1270
#, c-format
msgid "invalid %s declaration"
msgstr "felaktig %s-deklaration"
#: src/reader.c:592
msgid "%type declaration has no <typename>"
msgstr "%type-deklaration har inget <typnamn>"
#: src/reader.c:627
#, c-format
msgid "invalid %%type declaration due to item: %s"
msgstr "felaktig %%type-deklaration på grund av objekt: %s"
#: src/reader.c:672
#, c-format
msgid "redefining precedence of %s"
msgstr "omdefinition av precedens för %s"
#: src/reader.c:695
#, c-format
msgid "invalid text (%s) - number should be after identifier"
msgstr "felaktig text (%s) - tal skulle följa efter identifierare"
#: src/reader.c:705
#, c-format
msgid "unexpected item: %s"
msgstr "oväntat objekt: %s"
#: src/reader.c:778 src/reader.c:1110 src/reader.c:1181
#, c-format
msgid "unmatched %s"
msgstr "ensam %s"
#: src/reader.c:810
#, c-format
msgid "argument of %%expect is not an integer"
msgstr "argument till %%expect är inte ett heltal"
#: src/reader.c:856
#, c-format
msgid "unrecognized item %s, expected an identifier"
msgstr "oväntat objekt %s, förväntade en identifierare"
#: src/reader.c:878
#, c-format
msgid "expected string constant instead of %s"
msgstr "förväntade strängkonstant istället för %s"
#: src/reader.c:1026
#, c-format
msgid "unrecognized: %s"
msgstr "okänt: %s"
#: src/reader.c:1031
msgid "no input grammar"
msgstr "ingen ingrammatik"
#: src/reader.c:1036
#, c-format
msgid "unknown character: %s"
msgstr "okänt tecken: %s"
#: src/reader.c:1204
#, c-format
msgid "unterminated %guard clause"
msgstr "oavlutad %guard-sats"
#: src/reader.c:1357
msgid "ill-formed rule: initial symbol not followed by colon"
msgstr "felskriven regel: första symbolen följs inte av ett kolon"
#: src/reader.c:1364
msgid "grammar starts with vertical bar"
msgstr "grammatiken startar med ett vertikalt streck"
#: src/reader.c:1392
#, c-format
msgid "rule given for %s, which is a token"
msgstr "regel given för %s, som är ett element"
#: src/reader.c:1492
msgid "two @prec's in a row"
msgstr "två @prec i rad"
#: src/reader.c:1500
#, c-format
msgid "%%guard present but %%semantic_parser not specified"
msgstr "%%guard finns men %%semantic_parser är inte angiven"
#: src/reader.c:1509
msgid "two actions at end of one rule"
msgstr "två åtgärder vid slutet av en regel"
#: src/reader.c:1523
#, c-format
msgid "type clash (`%s' `%s') on default action"
msgstr "typkonflikt (\"%s\" \"%s\") för standardåtgärd"
#: src/reader.c:1529
msgid "empty rule for typed nonterminal, and no action"
msgstr "tom regel för typad icketerminal, och ingen åtgärd"
#: src/reader.c:1573
#, c-format
msgid "invalid input: %s"
msgstr "felaktig indata: %s"
#: src/reader.c:1581
#, c-format
msgid "too many symbols (tokens plus nonterminals); maximum %d"
msgstr "för många symboler (element plus icketerminaler); max %d"
#: src/reader.c:1584
msgid "no rules in the input grammar"
msgstr "inga regler i ingrammatiken"
#: src/reader.c:1608
#, c-format
msgid "symbol %s is used, but is not defined as a token and has no rules"
msgstr ""
"symbolen %s används, men är inte definierad som ett element och har inga "
"regler"
#: src/reader.c:1743
#, c-format
msgid "tokens %s and %s both assigned number %d"
msgstr "elementen %s och %s har båda fått nummer %d"
#: src/reader.c:1796
#, c-format
msgid "conflicting precedences for %s and %s"
msgstr "motstridiga precedenser mellan %s och %s"
#: src/reader.c:1808
#, c-format
msgid "conflicting assoc values for %s and %s"
msgstr "motstridiga assoc-värden mellan %s och %s"
#: src/reader.c:1847
#, c-format
msgid "the start symbol %s is undefined"
msgstr "startsymbolen %s är odefinierad"
#: src/reader.c:1849
#, c-format
msgid "the start symbol %s is a token"
msgstr "startsymbolen %s är ett element"
#: src/reduce.c:400
msgid "Useless nonterminals:"
msgstr "Oanvändbara icketerminaler:"
#: src/reduce.c:414
msgid "Terminals which are not used:"
msgstr "Terminaler som inte används:"
#: src/reduce.c:425
msgid "Useless rules:"
msgstr "Oanvändbara regler:"
#: src/reduce.c:451
msgid ""
"Variables\n"
"---------\n"
"\n"
msgstr ""
"Variabler\n"
"---------\n"
"\n"
#: src/reduce.c:452
msgid "Value Sprec Sassoc Tag\n"
msgstr "Värde Sprec Sassoc Tagg\n"
#: src/reduce.c:456
msgid ""
"Rules\n"
"-----\n"
"\n"
msgstr ""
"Regler\n"
"------\n"
"\n"
#: src/reduce.c:470
msgid ""
"Rules interpreted\n"
"-----------------\n"
"\n"
msgstr ""
"Tolkade regler\n"
"--------------\n"
"\n"
#: src/reduce.c:491
#, c-format
msgid "%d rules never reduced\n"
msgstr "%d regler reduceras aldrig\n"
# Jag har anmält att det är fel att anta att "s" är en universell pluraländelse.
# Jag föreslog också att de använder ngettext istället.
# "Vad göras skall är redan gjort."
#: src/reduce.c:497
#, c-format
msgid "%d useless nonterminal%s"
msgstr "%d oanvändbara icketerminaler%.0s"
#: src/reduce.c:502
msgid " and "
msgstr " och "
#: src/reduce.c:506
#, c-format
msgid "%d useless rule%s"
msgstr "%d oanvändbara regler%.0s"
#: src/reduce.c:536
#, c-format
msgid "Start symbol %s does not derive any sentence"
msgstr "Startsymbolen %s genererar inga meningar"
#: lib/getopt.c:694
#, c-format
msgid "%s: option `%s' is ambiguous\n"
msgstr "%s: flaggan \"%s\" är tvetydig\n"
#: lib/getopt.c:719
#, c-format
msgid "%s: option `--%s' doesn't allow an argument\n"
msgstr "%s: flaggan \"--%s\" tar inget argument\n"
#: lib/getopt.c:724
#, c-format
msgid "%s: option `%c%s' doesn't allow an argument\n"
msgstr "%s: flaggan \"%c%s\" tar inget argument\n"
#: lib/getopt.c:742 lib/getopt.c:915
#, c-format
msgid "%s: option `%s' requires an argument\n"
msgstr "%s: flaggan \"%s\" behöver ett argument\n"
#. --option
#: lib/getopt.c:771
#, c-format
msgid "%s: unrecognized option `--%s'\n"
msgstr "%s: okänd flagga \"--%s\"\n"
#. +option or -option
#: lib/getopt.c:775
#, c-format
msgid "%s: unrecognized option `%c%s'\n"
msgstr "%s: okänd flagga \"%c%s\"\n"
#. 1003.2 specifies the format of this message.
#: lib/getopt.c:801
#, c-format
msgid "%s: illegal option -- %c\n"
msgstr "%s: otillåten flagga -- %c\n"
#: lib/getopt.c:804
#, c-format
msgid "%s: invalid option -- %c\n"
msgstr "%s: ogiltig flagga --%c\n"
#. 1003.2 specifies the format of this message.
#: lib/getopt.c:834 lib/getopt.c:964
#, c-format
msgid "%s: option requires an argument -- %c\n"
msgstr "%s: flaggan behöver ett argument -- %c\n"
#: lib/getopt.c:881
#, c-format
msgid "%s: option `-W %s' is ambiguous\n"
msgstr "%s: flaggan \"-W %s\" är tvetydig\n"
#: lib/getopt.c:899
#, c-format
msgid "%s: option `-W %s' doesn't allow an argument\n"
msgstr "%s: flaggan \"-W %s\" tar inget argument\n"
#. If XALLOC_FAIL_FUNC is NULL, or does return, display this message
#. before exiting when memory is exhausted. Goes through gettext.
#: lib/obstack.c:494 lib/obstack.c:497 lib/xmalloc.c:66
msgid "memory exhausted"
msgstr "minnet slut"
# När vi går över till Unicode mer allmänt kanske vi bör översätta båda dessa
# med U+201D (RIGHT DOUBLE QUOTATION MARK) på svenska. Eller?
#
#. Get translations for open and closing quotation marks.
#.
#. The message catalog should translate "`" to a left
#. quotation mark suitable for the locale, and similarly for
#. "'". If the catalog has no translation,
#. locale_quoting_style quotes `like this', and
#. clocale_quoting_style quotes "like this".
#.
#. For example, an American English Unicode locale should
#. translate "`" to U+201C (LEFT DOUBLE QUOTATION MARK), and
#. should translate "'" to U+201D (RIGHT DOUBLE QUOTATION
#. MARK). A British English Unicode locale should instead
#. translate these to U+2018 (LEFT SINGLE QUOTATION MARK) and
#. U+2019 (RIGHT SINGLE QUOTATION MARK), respectively.
#: lib/quotearg.c:268
msgid "`"
msgstr "\""
#: lib/quotearg.c:269
msgid "'"
msgstr "\""
+132 -125
View File
@@ -5,7 +5,7 @@
msgid ""
msgstr ""
"Project-Id-Version: bison 1.30\n"
"POT-Creation-Date: 2001-11-12 10:34+0100\n"
"POT-Creation-Date: 2001-11-26 16:23+0100\n"
"PO-Revision-Date: 2001-11-02 14:49GMT\n"
"Last-Translator: Altug Bayram <[email protected]>\n"
"Language-Team: Turkish <[email protected]>\n"
@@ -14,7 +14,7 @@ msgstr ""
"Content-Transfer-Encoding: 8bit\n"
"X-Generator: KBabel 0.9.5\n"
#: src/LR0.c:207
#: src/LR0.c:189
#, c-format
msgid "too many states (max %d)"
msgstr "çok fazla durum (en fazla %d)"
@@ -27,7 +27,7 @@ msgstr "Bilinmeyen sistem hatas
msgid "warning: "
msgstr "uyarý: "
#: src/complain.c:238 src/complain.c:279
#: src/complain.c:238
msgid "fatal error: "
msgstr "ölümcül hata:"
@@ -50,61 +50,61 @@ msgstr "
msgid "an error"
msgstr "bir hata"
#: src/conflicts.c:411
#: src/conflicts.c:389
#, fuzzy, c-format
msgid "%d shift/reduce conflict"
msgid_plural "%d shift/reduce conflicts"
msgstr[0] " %d öteleme/indirgeme çeliþkisi"
#: src/conflicts.c:418
#: src/conflicts.c:396
#, fuzzy
msgid "and"
msgstr " ve"
#: src/conflicts.c:424
#: src/conflicts.c:402
#, fuzzy, c-format
msgid "%d reduce/reduce conflict"
msgid_plural "%d reduce/reduce conflicts"
msgstr[0] " %d indirgeme/indirgeme çeliþkisi"
#: src/conflicts.c:448
#: src/conflicts.c:426
#, fuzzy, c-format
msgid "State %d contains "
msgstr "%d durumu içerir"
#. If invoked with `--yacc', use the output format specified by
#. POSIX.
#: src/conflicts.c:481
#: src/conflicts.c:470
msgid "conflicts: "
msgstr "çeliþkiler: "
#: src/conflicts.c:483
#: src/conflicts.c:472
#, c-format
msgid " %d shift/reduce"
msgstr " %d öteleme/indirgeme"
#: src/conflicts.c:487
#: src/conflicts.c:476
#, c-format
msgid " %d reduce/reduce"
msgstr " %d indirgeme/indirgeme"
#: src/conflicts.c:492 src/reduce.c:497
#: src/conflicts.c:481 src/reduce.c:493
#, c-format
msgid "%s contains "
msgstr "%s içerir "
#: src/conflicts.c:500
#: src/conflicts.c:488
#, fuzzy, c-format
msgid "expected %d shift/reduce conflict"
msgid_plural "expected %d shift/reduce conflicts"
msgid "expected %d shift/reduce conflict\n"
msgid_plural "expected %d shift/reduce conflicts\n"
msgstr[0] " %d öteleme/indirgeme çeliþkisi"
#: src/conflicts.c:587 src/conflicts.c:707
#: src/conflicts.c:575 src/conflicts.c:696
#, c-format
msgid " %-4s\t[reduce using rule %d (%s)]\n"
msgstr " %-4s\t[indirgeme kural %d (%s)'i kullanýyor]\n"
#: src/conflicts.c:598 src/print.c:171
#: src/conflicts.c:587 src/print.c:156
#, c-format
msgid ""
" $default\treduce using rule %d (%s)\n"
@@ -113,25 +113,16 @@ msgstr ""
" $default\tindirgeme kural %d (%s)'i kullanýyor\n"
"\n"
#: src/conflicts.c:687 src/conflicts.c:701
#: src/conflicts.c:676 src/conflicts.c:690
#, c-format
msgid " %-4s\treduce using rule %d (%s)\n"
msgstr " %-4s\tindirgeme kural %d (%s)'i kullanýyor\n"
#: src/conflicts.c:727
#: src/conflicts.c:716
#, c-format
msgid " $default\treduce using rule %d (%s)\n"
msgstr " $default\tindirgeme kural %d (%s)'i kullanýyor\n"
#: src/derives.c:43
msgid "DERIVES"
msgstr "TÜRETÝLENLER"
#: src/derives.c:48
#, c-format
msgid "%s derives"
msgstr "%s türetildi"
#: src/files.c:143
#, c-format
msgid "cannot open file `%s'"
@@ -238,7 +229,7 @@ msgstr ""
"Hiçbir garantisi yoktur; hatta SATILABÝLÝRLÝÐÝ veya ÞAHSÝ KULLANIMINIZA\n"
"UYGUNLUÐU için bile garanti verilmez.\n"
#: src/getargs.c:215 src/lex.c:693
#: src/getargs.c:215 src/lex.c:694
#, c-format
msgid "`%s' is no longer supported"
msgstr "`%s' artýk desteklenmeyecek"
@@ -258,7 +249,7 @@ msgstr "%s: verilen gramer dosyas
msgid "%s: extra arguments ignored after `%s'\n"
msgstr "%s: '%s' den sonraki ek baðýmsýz deðiþkenler yoksayýldý\n"
#: src/lalr.c:311
#: src/lalr.c:293
#, c-format
msgid "too many gotos (max %d)"
msgstr "gotos çok fazla (en fazla %d)"
@@ -267,7 +258,7 @@ msgstr "gotos
msgid "unexpected `/' found and ignored"
msgstr "beklenmeyen `/' bulundu ve yoksayýldý"
#: src/lex.c:105 src/reader.c:269
#: src/lex.c:105 src/reader.c:280
msgid "unterminated comment"
msgstr "sonlandýrýlmamýþ açýklama"
@@ -306,352 +297,361 @@ msgstr "sonland
msgid "use \"...\" for multi-character literal tokens"
msgstr "cok-karakterli yazýn andaçlarý için \"...\" kullan"
#: src/lex.c:666
#: src/lex.c:667
#, c-format
msgid "`%s' supports no argument: %s"
msgstr ""
#: src/lex.c:682
#: src/lex.c:683
#, fuzzy, c-format
msgid "`%s' requires an argument"
msgstr "%s: `%s' seçeneði bir argümanla kullanýlýr\n"
#: src/main.c:128
#: src/main.c:134
#, c-format
msgid "%s: internal error: %s\n"
msgstr "%s: iç hata: %s\n"
#: src/nullable.c:51
msgid "Entering set_nullable"
msgstr "set_nullable'a girildi"
#: src/output.c:986
#: src/output.c:979
#, c-format
msgid "maximum table size (%d) exceeded"
msgstr "en büyük tablo uzunluðu (%d) aþýldý"
#: src/print.c:37
#: src/print.c:38
#, c-format
msgid " type %d is %s\n"
msgstr " tip %d %s'dir\n"
#: src/print.c:85
#: src/print.c:78
#, c-format
msgid " (rule %d)"
msgstr " (kural %d)"
#: src/print.c:111
#: src/print.c:98
msgid " $default\taccept\n"
msgstr " $default\tonayla\n"
#: src/print.c:113
#: src/print.c:100
msgid " NO ACTIONS\n"
msgstr " EYLEMLER YOK\n"
#: src/print.c:132
#: src/print.c:120
#, c-format
msgid " $ \tgo to state %d\n"
msgstr " $ \tdurum %d'ye git\n"
#: src/print.c:135
#: src/print.c:123
#, c-format
msgid " %-4s\tshift, and go to state %d\n"
msgstr " %-4s\tötele, ve durum %d'ye git\n"
#: src/print.c:159
#: src/print.c:144
#, c-format
msgid " %-4s\terror (nonassociative)\n"
msgstr " %-4s\thata (birleþmeli deðil)\n"
#: src/print.c:187
#: src/print.c:173
#, c-format
msgid " %-4s\tgo to state %d\n"
msgstr " %-4s\tdurum %d'ye git\n"
#: src/print.c:199
#: src/print.c:185
#, c-format
msgid "state %d"
msgstr "durum %d"
#. rule # : LHS -> RHS
#: src/print.c:229
#: src/print.c:215
msgid "Grammar"
msgstr "Gramer"
#: src/print.c:234
#, c-format
msgid "rule %-4d %s ->"
#: src/print.c:216
msgid "Number, Line, Rule"
msgstr ""
#: src/print.c:221
#, fuzzy, c-format
msgid " %3d %3d %s ->"
msgstr "kural %-4d %s ->"
#: src/print.c:240
#: src/print.c:228
msgid "empty"
msgstr "boþ"
#. TERMINAL (type #) : rule #s terminal is on RHS
#: src/print.c:245
#: src/print.c:233
msgid "Terminals, with rules where they appear"
msgstr "Sabit simgeler, kurallarýnýn bulunduklarý yerde"
#: src/print.c:269
#: src/print.c:257
msgid "Nonterminals, with rules where they appear"
msgstr "Deðiþken simgeler, kurallarýnýn bulunduklarý yerde"
#: src/print.c:295
#: src/print.c:283
msgid " on left:"
msgstr " solda:"
#: src/print.c:310
#: src/print.c:298
msgid " on right:"
msgstr " saðda:"
#: src/print_graph.c:174
#. If something has been added in the NODE_OBSTACK after
#. the declaration of the label, then we need a `\n'.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:165
#, c-format
msgid "%-4s\terror (nonassociative)"
msgstr "%-4s\thata (birleþmeli deðil)"
#: src/print_graph.c:187
#.
#. if (obstack_object_size (node_obstack) > node_output_size)
#. obstack_sgrow (node_obstack, "\n");
#.
#: src/print_graph.c:180
#, c-format
msgid "$default\treduce using rule %d (%s)"
msgstr "$default\tindirgeme kural %d (%s)'i kullanýyor"
#: src/reader.c:78
#: src/reader.c:89
msgid " Skipping to next \\n"
msgstr " Sonrakine atlanýyor \\n"
#: src/reader.c:80
#: src/reader.c:91
#, c-format
msgid " Skipping to next %c"
msgstr " Sonraki %c'ye atlanýyor"
#: src/reader.c:131 src/reader.c:143
#: src/reader.c:142 src/reader.c:154
msgid "invalid $ value"
msgstr "geçersiz $ deðeri"
#: src/reader.c:169 src/reader.c:184
#: src/reader.c:180 src/reader.c:195
msgid "unterminated string at end of file"
msgstr "dosyanýn sonunda sonlandýrýlmamýþ dizge"
#: src/reader.c:172
#: src/reader.c:183
msgid "unterminated string"
msgstr "sonlandýrýlmamýþ dizge"
#: src/reader.c:325 src/reader.c:389
#: src/reader.c:336 src/reader.c:400
#, c-format
msgid "%s is invalid"
msgstr "%s geçersizdir"
#: src/reader.c:365
#: src/reader.c:376
#, c-format
msgid "$$ of `%s' has no declared type"
msgstr "`%s''in $$'ý bildirilmiþ tip deðil"
#: src/reader.c:382
#: src/reader.c:393
#, c-format
msgid "$%d of `%s' has no declared type"
msgstr "`%d''in $%s'i bildirilmiþ tip deðil"
#: src/reader.c:436
#: src/reader.c:447
msgid "unterminated `%{' definition"
msgstr "`%{' tanýmlamasý sonlandýrýlmamýþ"
#: src/reader.c:481 src/reader.c:595 src/reader.c:645
#: src/reader.c:492 src/reader.c:607 src/reader.c:657
#, c-format
msgid "Premature EOF after %s"
msgstr "%s'den sonra erken EOF"
#: src/reader.c:498
#: src/reader.c:509
#, c-format
msgid "symbol `%s' used more than once as a literal string"
msgstr "simge `%s' bir harfiyen uyumlu dizgi gibi birden fazla kullanýldý"
#: src/reader.c:501
#: src/reader.c:512
#, c-format
msgid "symbol `%s' given more than one literal string"
msgstr "simge `%s' bir harfiyen uyumlu dizgi gibi birden fazla verilmiþ"
#: src/reader.c:522 src/reader.c:664
#: src/reader.c:533 src/reader.c:676
#, c-format
msgid "symbol %s redefined"
msgstr "%s simgesi yeniden tanýmlandý"
#: src/reader.c:532 src/reader.c:610 src/reader.c:671 src/reader.c:1294
#: src/reader.c:543 src/reader.c:622 src/reader.c:683 src/reader.c:1292
#, c-format
msgid "type redeclaration for %s"
msgstr "%s için yeniden tip bildirimi"
#: src/reader.c:541
#: src/reader.c:552
#, c-format
msgid "`%s' is invalid in %s"
msgstr "`%s' %s içinde geçersizdir"
#: src/reader.c:558 src/reader.c:723
#: src/reader.c:570 src/reader.c:735
#, c-format
msgid "multiple %s declarations"
msgstr "çoklu %s bildirimleri"
#: src/reader.c:560 src/reader.c:902 src/reader.c:927 src/reader.c:1272
#: src/reader.c:572 src/reader.c:914 src/reader.c:939 src/reader.c:1270
#, c-format
msgid "invalid %s declaration"
msgstr "geçersiz %s bildirimi"
#: src/reader.c:580
#: src/reader.c:592
msgid "%type declaration has no <typename>"
msgstr "%type bildirimi <tipadý>'na sahip deðil"
#: src/reader.c:615
#: src/reader.c:627
#, c-format
msgid "invalid %%type declaration due to item: %s"
msgstr "geçersiz %%type bildirimine neden olan öðe: `%s'"
#: src/reader.c:660
#: src/reader.c:672
#, c-format
msgid "redefining precedence of %s"
msgstr "%s'in önceliði tekrar tanýmlandý"
#: src/reader.c:683
#: src/reader.c:695
#, c-format
msgid "invalid text (%s) - number should be after identifier"
msgstr "geçersiz metin (%s) - sayý tanýtýcýdan sonra olmalýdýr"
#: src/reader.c:693
#: src/reader.c:705
#, c-format
msgid "unexpected item: %s"
msgstr "beklenmeyen öðe: %s"
#: src/reader.c:766 src/reader.c:1098 src/reader.c:1169
#: src/reader.c:778 src/reader.c:1110 src/reader.c:1181
#, c-format
msgid "unmatched %s"
msgstr "eþlenemeyen %s"
#: src/reader.c:798
#: src/reader.c:810
#, c-format
msgid "argument of %%expect is not an integer"
msgstr "%%expect'in baðýmsýz deðiþkeni bir tamsayý deðildir"
#: src/reader.c:844
#: src/reader.c:856
#, c-format
msgid "unrecognized item %s, expected an identifier"
msgstr "%s öðesi tanýnmadý, beklenen bir tanýtýcýdýr"
#: src/reader.c:866
#: src/reader.c:878
#, c-format
msgid "expected string constant instead of %s"
msgstr "%s'in yerine beklenen dizgi sabitidir"
#: src/reader.c:1014
#: src/reader.c:1026
#, c-format
msgid "unrecognized: %s"
msgstr "tanýnmayan: %s"
#: src/reader.c:1019
#: src/reader.c:1031
msgid "no input grammar"
msgstr "girdi grameri yok"
#: src/reader.c:1024
#: src/reader.c:1036
#, c-format
msgid "unknown character: %s"
msgstr "bilinmeyen karakter: %s"
#: src/reader.c:1192
#: src/reader.c:1204
#, c-format
msgid "unterminated %guard clause"
msgstr "sonlandýrýlmamýþ %guard yantümcesi"
#: src/reader.c:1359
#: src/reader.c:1357
msgid "ill-formed rule: initial symbol not followed by colon"
msgstr "kötü-biçimli kural: baþlangýç simgesini takip eden kolon(:) yok"
#: src/reader.c:1366
#: src/reader.c:1364
msgid "grammar starts with vertical bar"
msgstr "gramer düþey çubuk ile baþlýyor"
#: src/reader.c:1397
#: src/reader.c:1392
#, c-format
msgid "rule given for %s, which is a token"
msgstr "bir andaç olan %s için verilen kural"
#: src/reader.c:1499
#: src/reader.c:1492
msgid "two @prec's in a row"
msgstr "bir satýrda iki @prec"
#: src/reader.c:1507
#: src/reader.c:1500
#, c-format
msgid "%%guard present but %%semantic_parser not specified"
msgstr "%%guard sunulmuþ fakat %%semantic_parser belirlenmemiþ"
#: src/reader.c:1516
#: src/reader.c:1509
msgid "two actions at end of one rule"
msgstr "bir kuralýn sonunda iki eylem"
#: src/reader.c:1530
#: src/reader.c:1523
#, c-format
msgid "type clash (`%s' `%s') on default action"
msgstr "öntanýmlý eylem üzerinde (`%s' `%s') tip çatýþmasý"
#: src/reader.c:1536
#: src/reader.c:1529
msgid "empty rule for typed nonterminal, and no action"
msgstr ""
"Tipli deðiþken simge için boþ kural tanýmlanmýþ, ve eylem belirtilmemiþ"
#: src/reader.c:1580
#: src/reader.c:1573
#, c-format
msgid "invalid input: %s"
msgstr "geçersiz girdi: %s"
#: src/reader.c:1588
#: src/reader.c:1581
#, c-format
msgid "too many symbols (tokens plus nonterminals); maximum %d"
msgstr "çok fazla simge var (andaçlar ve deðiþken simgeler); en fazla %d"
#: src/reader.c:1591
#: src/reader.c:1584
msgid "no rules in the input grammar"
msgstr "girdi grameri içinde kurallar yok"
#: src/reader.c:1615
#: src/reader.c:1608
#, c-format
msgid "symbol %s is used, but is not defined as a token and has no rules"
msgstr ""
"simge %s kullanýldý, fakat bir andaç gibi tanýmlanmadý ve kurallara "
"sahipdeðil"
#: src/reader.c:1707
#: src/reader.c:1743
#, c-format
msgid "tokens %s and %s both assigned number %d"
msgstr "%s ve %s andaçlarýnýn her ikisi %d sayýsýna atandý"
#: src/reader.c:1760
#: src/reader.c:1796
#, c-format
msgid "conflicting precedences for %s and %s"
msgstr "%s ve %s için çeliþen öncelikler"
#: src/reader.c:1772
#: src/reader.c:1808
#, c-format
msgid "conflicting assoc values for %s and %s"
msgstr "%s ve %s için çeliþen birleþmeli deðerler"
#: src/reader.c:1811
#: src/reader.c:1847
#, c-format
msgid "the start symbol %s is undefined"
msgstr "baþlangýç simgesi %s tanýmlanmadý"
#: src/reader.c:1813
#: src/reader.c:1849
#, c-format
msgid "the start symbol %s is a token"
msgstr "baþlangýç simgesi %s bir andaçtýr"
#: src/reduce.c:405
#: src/reduce.c:400
msgid "Useless nonterminals:"
msgstr "Yararsýz kurallar:"
#: src/reduce.c:419
#: src/reduce.c:414
msgid "Terminals which are not used:"
msgstr "Kullanýlmayan sabit simgeler:"
#: src/reduce.c:430
#: src/reduce.c:425
msgid "Useless rules:"
msgstr "Yararsýz kurallar:"
#: src/reduce.c:458
#: src/reduce.c:451
msgid ""
"Variables\n"
"---------\n"
@@ -661,11 +661,11 @@ msgstr ""
"-----------\n"
"\n"
#: src/reduce.c:459
#: src/reduce.c:452
msgid "Value Sprec Sassoc Tag\n"
msgstr "Deðer Söncel Sbirleþ Etiket\n"
#: src/reduce.c:463
#: src/reduce.c:456
msgid ""
"Rules\n"
"-----\n"
@@ -675,7 +675,7 @@ msgstr ""
"--------\n"
"\n"
#: src/reduce.c:473
#: src/reduce.c:470
msgid ""
"Rules interpreted\n"
"-----------------\n"
@@ -685,38 +685,30 @@ msgstr ""
"-------------------\n"
"\n"
#: src/reduce.c:495
#: src/reduce.c:491
#, c-format
msgid "%d rules never reduced\n"
msgstr "%d kural asla indirgenmedi\n"
#: src/reduce.c:501
#: src/reduce.c:497
#, c-format
msgid "%d useless nonterminal%s"
msgstr "%d yararsýz deðiþken simge%s"
#: src/reduce.c:506
#: src/reduce.c:502
msgid " and "
msgstr " ve "
#: src/reduce.c:510
#: src/reduce.c:506
#, c-format
msgid "%d useless rule%s"
msgstr "%d yararsýz kural%s"
#: src/reduce.c:540
#: src/reduce.c:536
#, c-format
msgid "Start symbol %s does not derive any sentence"
msgstr "Baþlangýç simgesi %s herhangi bir cümleden türemez"
#: src/reduce.c:553
#, c-format
msgid ""
"reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
msgstr ""
"indirgenen %s tanýmlanan %d sabit simge%s, %d deðiþken simge%s,ve %d üretilen"
"%s.\n"
#: lib/getopt.c:694
#, c-format
msgid "%s: option `%s' is ambiguous\n"
@@ -812,3 +804,18 @@ msgstr "'"
#~ msgid "%s contains"
#~ msgstr "%s içerir"
#~ msgid "DERIVES"
#~ msgstr "TÜRETÝLENLER"
#~ msgid "%s derives"
#~ msgstr "%s türetildi"
#~ msgid "Entering set_nullable"
#~ msgstr "set_nullable'a girildi"
#~ msgid ""
#~ "reduced %s defines %d terminal%s, %d nonterminal%s, and %d production%s.\n"
#~ msgstr ""
#~ "indirgenen %s tanýmlanan %d sabit simge%s, %d deðiþken simge%s,ve %d "
#~ "üretilen%s.\n"
+75 -156
View File
@@ -1,5 +1,5 @@
/* Generate the nondeterministic finite state machine for bison,
Copyright 1984, 1986, 1989, 2000 Free Software Foundation, Inc.
Copyright 1984, 1986, 1989, 2000, 2001 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
@@ -23,6 +23,8 @@
The entry point is generate_states. */
#include "system.h"
#include "getargs.h"
#include "reader.h"
#include "gram.h"
#include "state.h"
#include "complain.h"
@@ -48,7 +50,7 @@ static short *redset = NULL;
static short *shiftset = NULL;
static short **kernel_base = NULL;
static short **kernel_end = NULL;
static int *kernel_size = NULL;
static short *kernel_items = NULL;
/* hash table for states, to recognize equivalent ones. */
@@ -60,8 +62,6 @@ static core **state_table = NULL;
static void
allocate_itemsets (void)
{
short *itemp = NULL;
int symbol;
int i;
int count;
short *symbol_count = NULL;
@@ -69,17 +69,12 @@ allocate_itemsets (void)
count = 0;
symbol_count = XCALLOC (short, nsyms);
itemp = ritem;
symbol = *itemp++;
while (symbol)
{
if (symbol > 0)
{
count++;
symbol_count[symbol]++;
}
symbol = *itemp++;
}
for (i = 0; ritem[i]; ++i)
if (ritem[i] > 0)
{
count++;
symbol_count[ritem[i]]++;
}
/* See comments before new_itemsets. All the vectors of items
live inside KERNEL_ITEMS. The number of active items after
@@ -99,7 +94,7 @@ allocate_itemsets (void)
}
shift_symbol = symbol_count;
kernel_end = XCALLOC (short *, nsyms);
kernel_size = XCALLOC (int, nsyms);
}
@@ -121,7 +116,7 @@ free_storage (void)
XFREE (redset);
XFREE (shiftset);
XFREE (kernel_base);
XFREE (kernel_end);
XFREE (kernel_size);
XFREE (kernel_items);
XFREE (state_table);
}
@@ -137,8 +132,7 @@ free_storage (void)
| shift_symbol is set to a vector of the symbols that can be |
| shifted. For each symbol in the grammar, kernel_base[symbol] |
| points to a vector of item numbers activated if that symbol is |
| shifted, and kernel_end[symbol] points after the end of that |
| vector. |
| shifted, and kernel_size[symbol] is their numbers. |
`----------------------------------------------------------------*/
static void
@@ -146,37 +140,29 @@ new_itemsets (void)
{
int i;
int shiftcount;
short *isp;
short *ksp;
int symbol;
#if TRACE
fprintf (stderr, "Entering new_itemsets\n");
#endif
if (trace_flag)
fprintf (stderr, "Entering new_itemsets, state = %d\n",
this_state->number);
for (i = 0; i < nsyms; i++)
kernel_end[i] = NULL;
kernel_size[i] = 0;
shiftcount = 0;
isp = itemset;
while (isp < itemsetend)
for (i = 0; i < itemsetsize; ++i)
{
i = *isp++;
symbol = ritem[i];
int symbol = ritem[itemset[i]];
if (symbol > 0)
{
ksp = kernel_end[symbol];
if (!ksp)
if (!kernel_size[symbol])
{
shift_symbol[shiftcount++] = symbol;
ksp = kernel_base[symbol];
shift_symbol[shiftcount] = symbol;
shiftcount++;
}
*ksp++ = i + 1;
kernel_end[symbol] = ksp;
kernel_base[symbol][kernel_size[symbol]] = itemset[i] + 1;
kernel_size[symbol]++;
}
}
@@ -193,36 +179,24 @@ new_itemsets (void)
static core *
new_state (int symbol)
{
int n;
core *p;
short *isp1;
short *isp2;
short *iend;
#if TRACE
fprintf (stderr, "Entering new_state, symbol = %d\n", symbol);
#endif
if (trace_flag)
fprintf (stderr, "Entering new_state, state = %d, symbol = %d (%s)\n",
this_state->number, symbol, tags[symbol]);
if (nstates >= MAXSHORT)
fatal (_("too many states (max %d)"), MAXSHORT);
isp1 = kernel_base[symbol];
iend = kernel_end[symbol];
n = iend - isp1;
p =
(core *) xcalloc ((unsigned) (sizeof (core) + (n - 1) * sizeof (short)), 1);
p = CORE_ALLOC (kernel_size[symbol]);
p->accessing_symbol = symbol;
p->number = nstates;
p->nitems = n;
p->nitems = kernel_size[symbol];
isp2 = p->items;
while (isp1 < iend)
*isp2++ = *isp1++;
shortcpy (p->items, kernel_base[symbol], kernel_size[symbol]);
last_state->next = p;
last_state = p;
nstates++;
return p;
@@ -232,54 +206,39 @@ new_state (int symbol)
/*--------------------------------------------------------------.
| Find the state number for the state we would get to (from the |
| current state) by shifting symbol. Create a new state if no |
| equivalent one exists already. Used by append_states. |
| equivalent one exists already. Used by append_states. |
`--------------------------------------------------------------*/
static int
get_state (int symbol)
{
int key;
short *isp1;
short *isp2;
short *iend;
int i;
core *sp;
int found;
int n;
if (trace_flag)
fprintf (stderr, "Entering get_state, state = %d, symbol = %d (%s)\n",
this_state->number, symbol, tags[symbol]);
#if TRACE
fprintf (stderr, "Entering get_state, symbol = %d\n", symbol);
#endif
isp1 = kernel_base[symbol];
iend = kernel_end[symbol];
n = iend - isp1;
/* add up the target state's active item numbers to get a hash key */
/* Add up the target state's active item numbers to get a hash key.
*/
key = 0;
while (isp1 < iend)
key += *isp1++;
for (i = 0; i < kernel_size[symbol]; ++i)
key += kernel_base[symbol][i];
key = key % STATE_TABLE_SIZE;
sp = state_table[key];
if (sp)
{
found = 0;
int found = 0;
while (!found)
{
if (sp->nitems == n)
if (sp->nitems == kernel_size[symbol])
{
found = 1;
isp1 = kernel_base[symbol];
isp2 = sp->items;
while (found && isp1 < iend)
{
if (*isp1++ != *isp2++)
found = 0;
}
for (i = 0; i < kernel_size[symbol]; ++i)
if (kernel_base[symbol][i] != sp->items[i])
found = 0;
}
if (!found)
@@ -301,6 +260,9 @@ get_state (int symbol)
state_table[key] = sp = new_state (symbol);
}
if (trace_flag)
fprintf (stderr, "Exiting get_state => %d\n", sp->number);
return sp->number;
}
@@ -318,9 +280,9 @@ append_states (void)
int j;
int symbol;
#if TRACE
fprintf (stderr, "Entering append_states\n");
#endif
if (trace_flag)
fprintf (stderr, "Entering append_states, state = %d\n",
this_state->number);
/* first sort shift_symbol into increasing order */
@@ -337,20 +299,14 @@ append_states (void)
}
for (i = 0; i < nshifts; i++)
{
symbol = shift_symbol[i];
shiftset[i] = get_state (symbol);
}
shiftset[i] = get_state (shift_symbol[i]);
}
static void
new_states (void)
{
core *p;
p = (core *) xcalloc ((unsigned) (sizeof (core) - sizeof (short)), 1);
first_state = last_state = this_state = p;
first_state = last_state = this_state = CORE_ALLOC (0);
nstates = 1;
}
@@ -358,34 +314,18 @@ new_states (void)
static void
save_shifts (void)
{
shifts *p;
short *sp1;
short *sp2;
short *send;
p = (shifts *) xcalloc ((unsigned) (sizeof (shifts) +
(nshifts - 1) * sizeof (short)), 1);
shifts *p = SHIFTS_ALLOC (nshifts);
p->number = this_state->number;
p->nshifts = nshifts;
sp1 = shiftset;
sp2 = p->shifts;
send = shiftset + nshifts;
while (sp1 < send)
*sp2++ = *sp1++;
shortcpy (p->shifts, shiftset, nshifts);
if (last_shift)
{
last_shift->next = p;
last_shift = p;
}
last_shift->next = p;
else
{
first_shift = p;
last_shift = p;
}
first_shift = p;
last_shift = p;
}
@@ -400,7 +340,7 @@ insert_start_shift (void)
core *statep;
shifts *sp;
statep = (core *) xcalloc ((unsigned) (sizeof (core) - sizeof (short)), 1);
statep = CORE_ALLOC (0);
statep->number = nstates;
statep->accessing_symbol = start_symbol;
@@ -408,7 +348,7 @@ insert_start_shift (void)
last_state = statep;
/* Make a shift from this state to (what will be) the final state. */
sp = XCALLOC (shifts, 1);
sp = SHIFTS_ALLOC (1);
sp->number = nstates++;
sp->nshifts = 1;
sp->shifts[0] = nstates;
@@ -465,10 +405,7 @@ augment_automaton (void)
if (sp && sp->number == k)
{
sp2 = (shifts *) xcalloc ((unsigned) (sizeof (shifts)
+
sp->nshifts *
sizeof (short)), 1);
sp2 = SHIFTS_ALLOC (sp->nshifts + 1);
sp2->number = k;
sp2->nshifts = sp->nshifts + 1;
sp2->shifts[0] = nstates;
@@ -485,7 +422,7 @@ augment_automaton (void)
}
else
{
sp2 = XCALLOC (shifts, 1);
sp2 = SHIFTS_ALLOC (1);
sp2->number = k;
sp2->nshifts = 1;
sp2->shifts[0] = nstates;
@@ -504,8 +441,7 @@ augment_automaton (void)
going to the next-to-final state (yet to be made). */
sp = first_shift;
sp2 = (shifts *) xcalloc (sizeof (shifts)
+ sp->nshifts * sizeof (short), 1);
sp2 = SHIFTS_ALLOC (sp->nshifts + 1);
sp2->nshifts = sp->nshifts + 1;
/* Stick this shift into the vector at the proper place. */
@@ -538,7 +474,7 @@ augment_automaton (void)
{
/* The initial state didn't even have any shifts.
Give it one shift, to the next-to-final state. */
sp = XCALLOC (shifts, 1);
sp = SHIFTS_ALLOC (1);
sp->nshifts = 1;
sp->shifts[0] = nstates;
@@ -556,7 +492,7 @@ augment_automaton (void)
/* There are no shifts for any state.
Make one shift, from the initial state to the next-to-final state. */
sp = XCALLOC (shifts, 1);
sp = SHIFTS_ALLOC (1);
sp->nshifts = 1;
sp->shifts[0] = nstates;
@@ -572,13 +508,13 @@ augment_automaton (void)
/* Make the final state--the one that follows a shift from the
next-to-final state.
The symbol for that shift is 0 (end-of-file). */
statep = (core *) xcalloc ((unsigned) (sizeof (core) - sizeof (short)), 1);
statep = CORE_ALLOC (0);
statep->number = nstates;
last_state->next = statep;
last_state = statep;
/* Make the shift from the final state to the termination state. */
sp = XCALLOC (shifts, 1);
sp = SHIFTS_ALLOC (1);
sp->number = nstates++;
sp->nshifts = 1;
sp->shifts[0] = nstates;
@@ -590,7 +526,7 @@ augment_automaton (void)
final_state = nstates;
/* Make the termination state. */
statep = (core *) xcalloc ((unsigned) (sizeof (core) - sizeof (short)), 1);
statep = CORE_ALLOC (0);
statep->number = nstates++;
last_state->next = statep;
last_state = statep;
@@ -606,21 +542,15 @@ augment_automaton (void)
static void
save_reductions (void)
{
short *isp;
short *rp1;
short *rp2;
int item;
int count;
reductions *p;
short *rend;
int i;
/* Find and count the active items that represent ends of rules. */
count = 0;
for (isp = itemset; isp < itemsetend; isp++)
for (i = 0; i < itemsetsize; ++i)
{
item = ritem[*isp];
int item = ritem[itemset[i]];
if (item < 0)
redset[count++] = -item;
}
@@ -629,29 +559,18 @@ save_reductions (void)
if (count)
{
p = (reductions *) xcalloc ((unsigned) (sizeof (reductions) +
(count - 1) * sizeof (short)), 1);
reductions *p = REDUCTIONS_ALLOC (count);
p->number = this_state->number;
p->nreds = count;
rp1 = redset;
rp2 = p->rules;
rend = rp1 + count;
for (/* nothing */; rp1 < rend; ++rp1, ++rp2)
*rp2 = *rp1;
shortcpy (p->rules, redset, count);
if (last_reduction)
{
last_reduction->next = p;
last_reduction = p;
}
last_reduction->next = p;
else
{
first_reduction = p;
last_reduction = p;
}
first_reduction = p;
last_reduction = p;
}
}
+33 -36
View File
@@ -385,40 +385,38 @@ yyparse (YYPARSE_PARAM_ARG)
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;
#if 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. */
# if 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
{
/* 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;
yyss = yyss1; yyvs = yyvs1;
/* Each stack pointer address is followed by the size of the
data in use in that stack, in bytes. */
# if YYLSP_NEEDED
yyls = yyls1;
YYLTYPE *yyls1 = yyls;
/* 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);
yyls = yyls1;
# else
yyoverflow ("parser stack overflow",
&yyss1, size * sizeof (*yyssp),
&yyvs1, size * sizeof (*yyvsp),
&yystacksize);
# endif
yyss = yyss1;
yyvs = yyvs1;
}
#else /* no yyoverflow */
/* Extend the stack our own way. */
if (yystacksize >= YYMAXDEPTH)
@@ -673,30 +671,29 @@ yyerrlab:
int x, count;
count = 0;
/* Start X at -yyn if nec to avoid negative indexes in yycheck. */
for (x = (yyn < 0 ? -yyn : 0);
/* Start X at -YYN if negative to avoid negative indexes in
YYCHECK. */
for (x = yyn < 0 ? -yyn : 0;
x < (int) (sizeof (yytname) / sizeof (char *)); x++)
if (yycheck[x + yyn] == x)
size += strlen (yytname[x]) + 15, count++;
size += strlen ("parse error, unexpected `") + 1;
size += strlen ("parse error, unexpected ") + 1;
size += strlen (yytname[YYTRANSLATE (yychar)]);
msg = (char *) malloc (size);
if (msg != 0)
{
strcpy (msg, "parse error, unexpected `");
strcpy (msg, "parse error, unexpected ");
strcat (msg, yytname[YYTRANSLATE (yychar)]);
strcat (msg, "'");
if (count < 5)
{
count = 0;
for (x = (yyn < 0 ? -yyn : 0);
for (x = yyn < 0 ? -yyn : 0;
x < (int) (sizeof (yytname) / sizeof (char *)); x++)
if (yycheck[x + yyn] == x)
{
strcat (msg, count == 0 ? ", expecting `" : " or `");
strcat (msg, count == 0 ? ", expecting " : " or ");
strcat (msg, yytname[x]);
strcat (msg, "'");
count++;
}
}
@@ -704,7 +701,7 @@ yyerrlab:
free (msg);
}
else
yyerror ("parse error; also virtual memory exceeded");
yyerror ("parse error; also virtual memory exhausted");
}
else
#endif /* YYERROR_VERBOSE */
+66 -65
View File
@@ -1,5 +1,5 @@
/* Subroutines for bison
Copyright 1984, 1989, 2000 Free Software Foundation, Inc.
Copyright 1984, 1989, 2000, 2001 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
@@ -19,26 +19,32 @@
02111-1307, USA. */
#include "system.h"
#include "getargs.h"
#include "gram.h"
#include "reader.h"
#include "closure.h"
#include "derives.h"
#include "warshall.h"
/* ITEMSETSIZE is the size of the array ITEMSET. */
short *itemset;
short *itemsetend;
int itemsetsize;
static unsigned *ruleset;
/* internal data. See comments before set_fderives and set_firsts. */
static unsigned *fderives;
static unsigned *firsts;
#define FDERIVES(Symbol) (fderives + (Symbol) * rulesetsize)
#define FIRSTS(Symbol) (firsts + (Symbol) * varsetsize)
/* number of words required to hold a bit for each rule */
static int rulesetsize;
/* number of words required to hold a bit for each variable */
static int varsetsize;
#if DEBUG
/*-----------------.
| Debugging code. |
@@ -47,11 +53,11 @@ static int varsetsize;
static void
print_closure (int n)
{
short *isp;
printf ("\n\nn = %d\n\n", n);
for (isp = itemset; isp < itemsetend; isp++)
printf (" %d\n", *isp);
int i;
fprintf (stderr, "n = %d\n", n);
for (i = 0; i < itemsetsize; ++i)
fprintf (stderr, " %d\n", itemset[i]);
fprintf (stderr, "\n\n");
}
@@ -62,18 +68,19 @@ print_firsts (void)
int j;
unsigned *rowp;
printf ("\n\n\nFIRSTS\n\n");
fprintf (stderr, "FIRSTS\n");
for (i = ntokens; i < nsyms; i++)
{
printf ("\n\n%s firsts\n\n", tags[i]);
fprintf (stderr, "\t%s firsts\n", tags[i]);
rowp = firsts + ((i - ntokens) * varsetsize);
rowp = FIRSTS (i - ntokens);
for (j = 0; j < nvars; j++)
if (BITISSET (rowp, j))
printf (" %s\n", tags[j + ntokens]);
fprintf (stderr, "\t\t%d (%s)\n", j + ntokens, tags[j + ntokens]);
}
fprintf (stderr, "\n\n");
}
@@ -84,21 +91,25 @@ print_fderives (void)
int j;
unsigned *rp;
printf ("\n\n\nFDERIVES\n");
fprintf (stderr, "FDERIVES\n");
for (i = ntokens; i < nsyms; i++)
{
printf ("\n\n%s derives\n\n", tags[i]);
rp = fderives + i * rulesetsize;
fprintf (stderr, "\t%s derives\n", tags[i]);
rp = FDERIVES (i);
for (j = 0; j <= nrules; j++)
if (BITISSET (rp, j))
printf (" %d\n", j);
{
short *rhsp;
fprintf (stderr, "\t\t%d:", j);
for (rhsp = ritem + rule_table[j].rhs; *rhsp > 0; ++rhsp)
fprintf (stderr, " %s", tags[*rhsp]);
fputc ('\n', stderr);
}
}
fflush (stdout);
fprintf (stderr, "\n\n");
}
#endif
/*-------------------------------------------------------------------.
| Set FIRSTS to be an NVARS by NVARS bit matrix indicating which |
@@ -130,7 +141,7 @@ set_firsts (void)
sp = derives[i];
while (*sp >= 0)
{
symbol = ritem[rrhs[*sp++]];
symbol = ritem[rule_table[*sp++].rhs];
if (ISVAR (symbol))
{
symbol -= ntokens;
@@ -143,9 +154,8 @@ set_firsts (void)
RTC (firsts, nvars);
#ifdef DEBUG
print_firsts ();
#endif
if (trace_flag)
print_firsts ();
}
/*-------------------------------------------------------------------.
@@ -175,11 +185,11 @@ set_fderives (void)
set_firsts ();
rrow = fderives + ntokens * rulesetsize;
rrow = FDERIVES (ntokens);
for (i = ntokens; i < nsyms; i++)
{
vrow = firsts + ((i - ntokens) * varsetsize);
vrow = FIRSTS (i - ntokens);
cword = *vrow++;
b = 0;
for (j = ntokens; j < nsyms; j++)
@@ -188,9 +198,7 @@ set_fderives (void)
{
rp = derives[j];
while ((ruleno = *rp++) > 0)
{
SETBIT (rrow, ruleno);
}
SETBIT (rrow, ruleno);
}
b++;
@@ -204,9 +212,8 @@ set_fderives (void)
rrow += rulesetsize;
}
#ifdef DEBUG
print_fderives ();
#endif
if (trace_flag)
print_fderives ();
XFREE (firsts);
}
@@ -229,52 +236,47 @@ void
closure (short *core, int n)
{
int ruleno;
unsigned word;
short *csp;
unsigned *dsp;
unsigned *rsp;
short *csend;
unsigned *rsend;
int symbol;
int itemno;
int i;
rsp = ruleset;
rsend = ruleset + rulesetsize;
csend = core + n;
if (trace_flag)
{
fprintf (stderr, "Entering closure (items = {");
for (i = 0; i < n; ++i)
fprintf (stderr, " %d ", core[i]);
fprintf (stderr, "}, nitems = %d)\n", n);
}
if (n == 0)
{
dsp = fderives + start_symbol * rulesetsize;
while (rsp < rsend)
*rsp++ = *dsp++;
for (i = 0; i < rulesetsize; ++i)
ruleset[i] = FDERIVES (start_symbol)[i];
}
else
{
while (rsp < rsend)
*rsp++ = 0;
for (i = 0; i < rulesetsize; ++i)
ruleset[i] = 0;
csp = core;
while (csp < csend)
for (i = 0; i < n; ++i)
{
symbol = ritem[*csp++];
int symbol = ritem[core[i]];
if (ISVAR (symbol))
{
dsp = fderives + symbol * rulesetsize;
rsp = ruleset;
while (rsp < rsend)
*rsp++ |= *dsp++;
int j;
for (j = 0; j < rulesetsize; ++j)
ruleset[j] |= FDERIVES (symbol)[j];
}
}
}
ruleno = 0;
itemsetend = itemset;
itemsetsize = 0;
csp = core;
rsp = ruleset;
while (rsp < rsend)
for (i = 0; i < rulesetsize; ++i)
{
word = *rsp++;
int word = ruleset[i];
if (word == 0)
{
ruleno += BITS_PER_WORD;
@@ -287,10 +289,10 @@ closure (short *core, int n)
{
if (word & (1 << b))
{
itemno = rrhs[ruleno];
while (csp < csend && *csp < itemno)
*itemsetend++ = *csp++;
*itemsetend++ = itemno;
itemno = rule_table[ruleno].rhs;
while (csp < (core + n) && *csp < itemno)
itemset[itemsetsize++] = *csp++;
itemset[itemsetsize++] = itemno;
}
ruleno++;
@@ -298,12 +300,11 @@ closure (short *core, int n)
}
}
while (csp < csend)
*itemsetend++ = *csp++;
while (csp < (core + n))
itemset[itemsetsize++] = *csp++;
#if DEBUG
print_closure (n);
#endif
if (trace_flag)
print_closure (n);
}
+2 -2
View File
@@ -1,5 +1,5 @@
/* Subroutines for bison
Copyright 1984, 1989, 2000 Free Software Foundation, Inc.
Copyright 1984, 1989, 2000, 2001 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
@@ -51,6 +51,6 @@ void closure PARAMS ((short *items, int n));
void free_closure PARAMS ((void));
extern short *itemset;
extern short *itemsetend;
extern int itemsetsize;
#endif /* !CLOSURE_H_ */
+1 -60
View File
@@ -1,5 +1,5 @@
/* Declaration for error-reporting function for Bison.
Copyright 2000 Free Software Foundation, Inc.
Copyright 2000, 2001 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
@@ -248,62 +248,3 @@ fatal (message, va_alist)
fflush (stderr);
exit (1);
}
/*------------------------------------------------------------------.
| A severe error has occurred, we cannot proceed. Exit with STATUS, |
| and report the error message of the errno ERRNUM. |
`------------------------------------------------------------------*/
void
#if defined VA_START && defined __STDC__
error (int status, int errnum,
const char *message, ...)
#else
error (status, errnum, message, va_alist)
int status;
int errnum;
char *message;
va_dcl
#endif
{
#ifdef VA_START
va_list args;
#endif
fflush (stdout);
if (infile != NULL)
fprintf (stderr, "%s:%d: ", infile, lineno);
else
fprintf (stderr, "%s:", program_name);
fputs (_("fatal error: "), stderr);
#ifdef VA_START
VA_START (args, message);
vfprintf (stderr, message, args);
va_end (args);
#else
fprintf (stderr, message, a1, a2, a3, a4, a5, a6, a7, a8);
#endif
if (errnum)
{
#if defined HAVE_STRERROR_R || _LIBC
char errbuf[1024];
# if HAVE_WORKING_STRERROR_R || _LIBC
fprintf (stderr, ": %s", __strerror_r (errnum, errbuf, sizeof errbuf));
# else
/* Don't use __strerror_r's return value because on some systems
(at least DEC UNIX 4.0[A-D]) strerror_r returns `int'. */
__strerror_r (errnum, errbuf, sizeof errbuf);
fprintf (stderr, ": %s", errbuf);
# endif
#else
fprintf (stderr, ": %s", strerror (errnum));
#endif
}
putc ('\n', stderr);
fflush (stderr);
if (status)
exit (status);
}
+2 -10
View File
@@ -1,5 +1,5 @@
/* Declaration for error-reporting function for Bison.
Copyright 2000 Free Software Foundation, Inc.
Copyright 2000, 2001 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
@@ -40,18 +40,10 @@ extern void complain (const char *format, ...)
extern void fatal (const char *format, ...)
__attribute__ ((__format__ (__printf__, 1, 2)));
/* Print a message with `fprintf (stderr, FORMAT, ...)';
if ERRNUM is nonzero, follow it with ": " and strerror (ERRNUM).
If STATUS is nonzero, terminate the program with `exit (STATUS)'. */
extern void error (int status, int errnum,
const char *format, ...)
__attribute__ ((__format__ (__printf__, 3, 4)));
#else
void warn ();
void complain ();
void error ();
void fatal ();
#endif
/* Position in the current input file. */
+88 -99
View File
@@ -60,7 +60,7 @@ flush_shift (int state, int token)
shifts *shiftp;
int k, i;
shiftp = shift_table[state];
shiftp = state_table[state].shift_table;
if (shiftp)
{
@@ -68,7 +68,7 @@ flush_shift (int state, int token)
for (i = 0; i < k; i++)
{
if (shiftp->shifts[i]
&& token == accessing_symbol[shiftp->shifts[i]])
&& token == state_table[shiftp->shifts[i]].accessing_symbol)
(shiftp->shifts[i]) = 0;
}
}
@@ -90,14 +90,14 @@ resolve_sr_conflict (int state, int lookaheadnum)
unsigned *fp1;
unsigned *fp2;
int redprec;
errs *errp = (errs *) xcalloc (sizeof (errs) + ntokens * sizeof (short), 1);
errs *errp = ERRS_ALLOC (ntokens + 1);
short *errtokens = errp->errs;
/* find the rule to reduce by to get precedence of reduction */
redprec = rprec[LAruleno[lookaheadnum]];
redprec = rule_table[LAruleno[lookaheadnum]].prec;
mask = 1;
fp1 = LA + lookaheadnum * tokensetsize;
fp1 = LA (lookaheadnum);
fp2 = lookaheadset;
for (i = 0; i < ntokens; i++)
{
@@ -170,7 +170,7 @@ resolve_sr_conflict (int state, int lookaheadnum)
/* Some tokens have been explicitly made errors. Allocate
a permanent errs structure for this state, to record them. */
i = (char *) errtokens - (char *) errp;
err_table[state] = (errs *) xcalloc ((unsigned int) i, 1);
err_table[state] = ERRS_ALLOC (i + 1);
bcopy (errp, err_table[state], i);
}
else
@@ -182,75 +182,53 @@ resolve_sr_conflict (int state, int lookaheadnum)
static void
set_conflicts (int state)
{
int i;
int k;
int i, j;
shifts *shiftp;
unsigned *fp2;
unsigned *fp3;
unsigned *fp4;
unsigned *fp1;
int symbol;
if (consistent[state])
if (state_table[state].consistent)
return;
for (i = 0; i < tokensetsize; i++)
lookaheadset[i] = 0;
shiftp = shift_table[state];
shiftp = state_table[state].shift_table;
if (shiftp)
{
k = shiftp->nshifts;
for (i = 0; i < k; i++)
{
symbol = accessing_symbol[shiftp->shifts[i]];
if (ISVAR (symbol))
break;
SETBIT (lookaheadset, symbol);
}
}
k = lookaheads[state + 1];
fp4 = lookaheadset + tokensetsize;
for (i = 0; i < shiftp->nshifts; i++)
{
symbol = state_table[shiftp->shifts[i]].accessing_symbol;
if (ISVAR (symbol))
break;
SETBIT (lookaheadset, symbol);
}
/* Loop over all rules which require lookahead in this state. First
check for shift-reduce conflict, and try to resolve using
precedence */
for (i = lookaheads[state]; i < k; i++)
if (rprec[LAruleno[i]])
{
fp1 = LA + i * tokensetsize;
fp2 = fp1;
fp3 = lookaheadset;
while (fp3 < fp4)
for (i = state_table[state].lookaheads;
i < state_table[state + 1].lookaheads;
++i)
if (rule_table[LAruleno[i]].prec)
for (j = 0; j < tokensetsize; ++j)
if (LA (i)[j] & lookaheadset[j])
{
if (*fp2++ & *fp3++)
{
resolve_sr_conflict (state, i);
break;
}
resolve_sr_conflict (state, i);
break;
}
}
/* Loop over all rules which require lookahead in this state. Check
for conflicts not resolved above. */
for (i = lookaheads[state]; i < k; i++)
for (i = state_table[state].lookaheads;
i < state_table[state + 1].lookaheads;
++i)
{
fp1 = LA + i * tokensetsize;
fp2 = fp1;
fp3 = lookaheadset;
while (fp3 < fp4)
if (*fp2++ & *fp3++)
for (j = 0; j < tokensetsize; ++j)
if (LA (i)[j] & lookaheadset[j])
conflicts[state] = 1;
fp2 = fp1;
fp3 = lookaheadset;
while (fp3 < fp4)
*fp3++ |= *fp2++;
for (j = 0; j < tokensetsize; ++j)
lookaheadset[j] |= LA (i)[j];
}
}
@@ -288,7 +266,7 @@ count_sr_conflicts (int state)
int src_count = 0;
shiftp = shift_table[state];
shiftp = state_table[state].shift_table;
if (!shiftp)
return 0;
@@ -303,18 +281,18 @@ count_sr_conflicts (int state)
{
if (!shiftp->shifts[i])
continue;
symbol = accessing_symbol[shiftp->shifts[i]];
symbol = state_table[shiftp->shifts[i]].accessing_symbol;
if (ISVAR (symbol))
break;
SETBIT (shiftset, symbol);
}
k = lookaheads[state + 1];
k = state_table[state + 1].lookaheads;
fp3 = lookaheadset + tokensetsize;
for (i = lookaheads[state]; i < k; i++)
for (i = state_table[state].lookaheads; i < k; i++)
{
fp1 = LA + i * tokensetsize;
fp1 = LA (i);
fp2 = lookaheadset;
while (fp2 < fp3)
@@ -359,14 +337,14 @@ count_rr_conflicts (int state)
int rrc_count = 0;
int m = lookaheads[state];
int n = lookaheads[state + 1];
int m = state_table[state].lookaheads;
int n = state_table[state + 1].lookaheads;
if (n - m < 2)
return 0;
mask = 1;
baseword = LA + m * tokensetsize;
baseword = LA (m);
for (i = 0; i < ntokens; i++)
{
unsigned *wordp = baseword;
@@ -461,6 +439,11 @@ conflicts_print (void)
{
int i;
/* Is the number of SR conflicts OK? Either EXPECTED_CONFLICTS is
not set, and then we want 0 SR, or else it is specified, in which
case we want equality. */
int src_ok = 0;
int src_total = 0;
int rrc_total = 0;
@@ -472,33 +455,38 @@ conflicts_print (void)
rrc_total += count_rr_conflicts (i);
}
/* Report the total number of conflicts on STDERR. */
if (src_total || rrc_total)
if (yacc_flag)
{
/* If invoked with `--yacc', use the output format specified by
POSIX. */
fprintf (stderr, _("conflicts: "));
if (src_total > 0)
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);
putc ('\n', stderr);
}
else
{
fprintf (stderr, _("%s contains "), infile);
fputs (conflict_report (src_total, rrc_total), stderr);
}
src_ok = src_total == (expected_conflicts == -1 ? 0 : expected_conflicts);
if (expected_conflicts != -1
&& src_total != expected_conflicts)
/* If there are no RR conflicts, and as many SR conflicts as
expected, then there is nothing to report. */
if (!rrc_total && src_ok)
return;
/* Report the total number of conflicts on STDERR. */
if (yacc_flag)
{
/* If invoked with `--yacc', use the output format specified by
POSIX. */
fprintf (stderr, _("conflicts: "));
if (src_total > 0)
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);
putc ('\n', stderr);
}
else
{
fprintf (stderr, _("%s contains "), infile);
fputs (conflict_report (src_total, rrc_total), stderr);
}
if (expected_conflicts != -1 && !src_ok)
{
complain_message_count++;
fprintf (stderr, ngettext ("expected %d shift/reduce conflict",
"expected %d shift/reduce conflicts",
fprintf (stderr, ngettext ("expected %d shift/reduce conflict\n",
"expected %d shift/reduce conflicts\n",
expected_conflicts),
expected_conflicts);
}
@@ -531,7 +519,7 @@ print_reductions (FILE *out, int state)
for (i = 0; i < tokensetsize; i++)
shiftset[i] = 0;
shiftp = shift_table[state];
shiftp = state_table[state].shift_table;
if (shiftp)
{
k = shiftp->nshifts;
@@ -539,7 +527,7 @@ print_reductions (FILE *out, int state)
{
if (!shiftp->shifts[i])
continue;
symbol = accessing_symbol[shiftp->shifts[i]];
symbol = state_table[shiftp->shifts[i]].accessing_symbol;
if (ISVAR (symbol))
break;
/* if this state has a shift for the error token,
@@ -563,14 +551,14 @@ print_reductions (FILE *out, int state)
}
}
m = lookaheads[state];
n = lookaheads[state + 1];
m = state_table[state].lookaheads;
n = state_table[state + 1].lookaheads;
if (n - m == 1 && !nodefault)
{
default_rule = LAruleno[m];
fp1 = LA + m * tokensetsize;
fp1 = LA (m);
fp2 = shiftset;
fp3 = lookaheadset;
fp4 = lookaheadset + tokensetsize;
@@ -585,7 +573,8 @@ print_reductions (FILE *out, int state)
{
if (mask & *fp3)
fprintf (out, _(" %-4s\t[reduce using rule %d (%s)]\n"),
tags[i], default_rule, tags[rlhs[default_rule]]);
tags[i], default_rule,
tags[rule_table[default_rule].lhs]);
mask <<= 1;
if (mask == 0)
@@ -596,7 +585,7 @@ print_reductions (FILE *out, int state)
}
fprintf (out, _(" $default\treduce using rule %d (%s)\n\n"),
default_rule, tags[rlhs[default_rule]]);
default_rule, tags[rule_table[default_rule].lhs]);
}
else if (n - m >= 1)
{
@@ -607,7 +596,7 @@ print_reductions (FILE *out, int state)
if (!nodefault)
for (i = m; i < n; i++)
{
fp1 = LA + i * tokensetsize;
fp1 = LA (i);
fp2 = shiftset;
fp3 = lookaheadset;
@@ -654,7 +643,7 @@ print_reductions (FILE *out, int state)
{
if (!shiftp->shifts[i])
continue;
symbol = accessing_symbol[shiftp->shifts[i]];
symbol = state_table[shiftp->shifts[i]].accessing_symbol;
if (ISVAR (symbol))
break;
SETBIT (shiftset, symbol);
@@ -662,7 +651,7 @@ print_reductions (FILE *out, int state)
}
mask = 1;
fp1 = LA + m * tokensetsize;
fp1 = LA (m);
fp2 = shiftset;
for (i = 0; i < ntokens; i++)
{
@@ -685,7 +674,7 @@ print_reductions (FILE *out, int state)
rule = LAruleno[j];
fprintf (out,
_(" %-4s\treduce using rule %d (%s)\n"),
tags[i], rule, tags[rlhs[rule]]);
tags[i], rule, tags[rule_table[rule].lhs]);
}
else
defaulted = 1;
@@ -699,13 +688,13 @@ print_reductions (FILE *out, int state)
rule = LAruleno[default_LA];
fprintf (out,
_(" %-4s\treduce using rule %d (%s)\n"),
tags[i], rule, tags[rlhs[rule]]);
tags[i], rule, tags[rule_table[rule].lhs]);
defaulted = 0;
}
rule = LAruleno[j];
fprintf (out,
_(" %-4s\t[reduce using rule %d (%s)]\n"),
tags[i], rule, tags[rlhs[rule]]);
tags[i], rule, tags[rule_table[rule].lhs]);
}
}
@@ -725,7 +714,7 @@ print_reductions (FILE *out, int state)
if (default_LA >= 0)
fprintf (out, _(" $default\treduce using rule %d (%s)\n"),
default_rule, tags[rlhs[default_rule]]);
default_rule, tags[rule_table[default_rule].lhs]);
}
}
+15 -15
View File
@@ -1,5 +1,5 @@
/* Match rules with nonterminals for bison,
Copyright 1984, 1989, 2000 Free Software Foundation, Inc.
Copyright 1984, 1989, 2000, 2001 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
@@ -25,38 +25,39 @@
*/
#include "system.h"
#include "getargs.h"
#include "types.h"
#include "reader.h"
#include "gram.h"
#include "derives.h"
short **derives;
#if DEBUG
static void
print_derives (void)
{
int i;
short *sp;
fputs ("\n\n\n", stdout);
printf (_("DERIVES"));
fputs ("\n\n", stdout);
fputs ("DERIVES\n", stderr);
for (i = ntokens; i < nsyms; i++)
{
printf (_("%s derives"), tags[i]);
short *sp;
fprintf (stderr, "\t%s derives\n", tags[i]);
for (sp = derives[i]; *sp > 0; sp++)
{
printf (" %d", *sp);
short *rhsp;
fprintf (stderr, "\t\t%d:", *sp);
for (rhsp = ritem + rule_table[*sp].rhs; *rhsp > 0; ++rhsp)
fprintf (stderr, " %s", tags[*rhsp]);
fputc ('\n', stderr);
}
putchar ('\n');
}
putchar ('\n');
fputs ("\n\n", stderr);
}
#endif
void
set_derives (void)
@@ -74,7 +75,7 @@ set_derives (void)
p = delts;
for (i = nrules; i > 0; i--)
{
lhs = rlhs[i];
lhs = rule_table[i].lhs;
if (lhs >= 0)
{
p->next = dset[lhs];
@@ -99,9 +100,8 @@ set_derives (void)
*q++ = -1;
}
#if DEBUG
print_derives ();
#endif
if (trace_flag)
print_derives ();
XFREE (dset + ntokens);
XFREE (delts);
+2 -2
View File
@@ -211,9 +211,9 @@ skeleton_find (const char *envvar, const char *skeleton_name)
if (!res)
{
/* Skeleton file name without path */
const char *skel_name = strrchr(skeleton_name, '/');
const char *skel_name = strrchr (skeleton_name, '/');
if (!skel_name)
skel_name = strrchr(skeleton_name, '\\');
skel_name = strrchr (skeleton_name, '\\');
if (!skel_name)
skel_name = skeleton_name;
else
+2 -2
View File
@@ -32,9 +32,9 @@ int no_lines_flag = 0;
int no_parser_flag = 0;
int token_table_flag = 0;
int verbose_flag = 0;
int statistics_flag = 0;
int yacc_flag = 0; /* for -y */
int graph_flag = 0;
int trace_flag = 0;
const char *skeleton = NULL;
@@ -68,7 +68,7 @@ static struct option longopts[] =
{"graph", optional_argument, 0, 'g'},
/* Hidden. */
{"statistics", no_argument, &statistics_flag, 1},
{"trace", no_argument, &trace_flag, 1},
{0, 0, 0, 0}
};
+1 -1
View File
@@ -31,11 +31,11 @@ extern int defines_flag; /* for -d */
extern int locations_flag;
extern int no_lines_flag; /* for -l */
extern int no_parser_flag; /* for -n */
extern int statistics_flag;
extern int token_table_flag; /* for -k */
extern int verbose_flag; /* for -v */
extern int graph_flag; /* for -g */
extern int yacc_flag; /* for -y */
extern int trace_flag;
void getargs PARAMS ((int argc, char *argv[]));
+3 -3
View File
@@ -1,5 +1,5 @@
/* Allocate input grammar variables for bison,
Copyright 1984, 1986, 1989 Free Software Foundation, Inc.
Copyright 1984, 1986, 1989, 2001 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
@@ -20,6 +20,7 @@ Boston, MA 02111-1307, USA. */
#include "system.h"
#include "gram.h"
void dummy PARAMS((void));
@@ -32,8 +33,7 @@ int ntokens;
int nvars;
short *ritem = NULL;
short *rlhs = NULL;
short *rrhs = NULL;
rule_t *rule_table = NULL;
short *rprec = NULL;
short *rprecsym = NULL;
short *sprec = NULL;
+37 -19
View File
@@ -1,5 +1,5 @@
/* Data definitions for internal representation of bison's input,
Copyright 1984, 1986, 1989, 1992 Free Software Foundation, Inc.
Copyright 1984, 1986, 1989, 1992, 2001 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
@@ -38,21 +38,36 @@
The rules receive rule numbers 1 to nrules in the order they are
written. Actions and guards are accessed via the rule number.
The rules themselves are described by three arrays: rrhs, rlhs and
ritem. rlhs[R] is the symbol number of the left hand side of rule
R. The right hand side is stored as symbol numbers in a portion of
ritem. rrhs[R] contains the index in ritem of the beginning of the
The rules themselves are described by several arrays: amongst which
RITEM, and RULE_TABLE.
RULE_TABLE is an array of struct rule_s, which members are:
RULE_TABLE[R].lhs -- the symbol number of the left hand side of
rule R. If -1, the rule has been thrown out by reduce.c and should
be ignored.
RULE_TABLE[R].rhs -- the index in RITEM of the beginning of the
portion for rule R.
If rlhs[R] is -1, the rule has been thrown out by reduce.c and
should be ignored.
RULE_TABLE[R].prec -- the precedence level of R.
RULE_TABLE[R].precsym -- the symbol-number of the symbol in %prec
for R (if any).
RULE_TABLE[R].assoc -- the associativity of R.
RULE_TABLE[R].line -- the line where R was defined.
The right hand side is stored as symbol numbers in a portion of
RITEM.
The length of the portion is one greater than the number of symbols
in the rule's right hand side. The last element in the portion
contains minus R, which identifies it as the end of a portion and
says which rule it is for.
The portions of ritem come in order of increasing rule number and
The portions of RITEM come in order of increasing rule number and
are followed by an element which is zero to mark the end. nitems
is the total length of ritem, not counting the final zero. Each
element of ritem is called an "item" and its index in ritem is an
@@ -61,10 +76,7 @@
Item numbers are used in the finite state machine to represent
places that parsing can get to.
Precedence levels are recorded in the vectors sprec and rprec.
sprec records the precedence level of each symbol, rprec the
precedence level of each rule. rprecsym is the symbol-number of
the symbol in %prec for this rule (if any).
SPREC records the precedence level of each symbol.
Precedence levels are assigned in increasing order starting with 1
so that numerically higher precedence values mean tighter binding
@@ -84,18 +96,12 @@ extern int ntokens;
extern int nvars;
extern short *ritem;
extern short *rlhs;
extern short *rrhs;
extern short *rprec;
extern short *rprecsym;
extern short *sprec;
extern short *rassoc;
extern short *sassoc;
extern short *rline; /* Source line number of each rule */
extern int start_symbol;
/* associativity values in elements of rassoc, sassoc. */
typedef enum
{
@@ -105,6 +111,18 @@ typedef enum
} associativity;
typedef struct rule_s
{
short lhs;
short rhs;
short prec;
short precsym;
short assoc;
short line;
} rule_t;
extern struct rule_s *rule_table;
/* token translation table: indexed by a token number as returned by
the user's yylex routine, it yields the internal token number used
by the parser and throughout bison. */
+121 -168
View File
@@ -1,5 +1,5 @@
/* Compute look-ahead criteria for bison,
Copyright 1984, 1986, 1989, 2000 Free Software Foundation, Inc.
Copyright 1984, 1986, 1989, 2000, 2001 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
@@ -32,15 +32,15 @@
#include "nullable.h"
#include "derives.h"
/* All the decorated states, indexed by the state number. Warning:
there is a state_TABLE in LR0.c, but it is different and static.
*/
state_t *state_table = NULL;
int tokensetsize;
short *lookaheads;
short *LAruleno;
unsigned *LA;
short *accessing_symbol;
char *consistent;
core **state_table;
shifts **shift_table;
reductions **reduction_table;
short *goto_map;
short *from_state;
short *to_state;
@@ -48,9 +48,13 @@ short *to_state;
extern void berror PARAMS ((const char *));
static int infinity;
static int maxrhs;
static int ngotos;
static unsigned *F;
/* And for the famous F variable, which named is so descriptive that a
comment is hardly needed. <grin>. */
static unsigned *F = NULL;
#define F(Rule) (F + (Rule) * tokensetsize)
static short **includes;
static shorts **lookback;
static short **R;
@@ -74,8 +78,8 @@ traverse (int i)
VERTICES[++top] = i;
INDEX[i] = height = top;
base = F + i * tokensetsize;
fp3 = base + tokensetsize;
base = F (i);
fp3 = F (i + 1);
rp = R[i];
if (rp)
@@ -89,7 +93,7 @@ traverse (int i)
INDEX[i] = INDEX[j];
fp1 = base;
fp2 = F + j * tokensetsize;
fp2 = F (j);
while (fp1 < fp3)
*fp1++ |= *fp2++;
@@ -107,7 +111,7 @@ traverse (int i)
break;
fp1 = base;
fp2 = F + j * tokensetsize;
fp2 = F (j);
while (fp1 < fp3)
*fp2++ = *fp1++;
@@ -132,65 +136,85 @@ digraph (short **relation)
INDEX[i] = 0;
for (i = 0; i < ngotos; i++)
{
if (INDEX[i] == 0 && R[i])
traverse (i);
}
if (INDEX[i] == 0 && R[i])
traverse (i);
XFREE (INDEX);
XFREE (VERTICES);
}
/*--------------------.
| Build STATE_TABLE. |
`--------------------*/
static void
set_state_table (void)
{
core *sp;
/* NSTATES + 1 because lookahead for the pseudo state number NSTATES
might be used (see conflicts.c). It is too opaque for me to
provide a probably less hacky implementation. --akim */
state_table = XCALLOC (state_t, nstates + 1);
state_table = XCALLOC (core *, nstates);
{
core *sp;
for (sp = first_state; sp; sp = sp->next)
{
state_table[sp->number].state = sp;
state_table[sp->number].accessing_symbol = sp->accessing_symbol;
}
}
for (sp = first_state; sp; sp = sp->next)
state_table[sp->number] = sp;
{
shifts *sp;
for (sp = first_shift; sp; sp = sp->next)
state_table[sp->number].shift_table = sp;
}
{
reductions *rp;
for (rp = first_reduction; rp; rp = rp->next)
state_table[rp->number].reduction_table = rp;
}
/* Initializing the lookaheads members. Please note that it must be
performed after having set some of the other members which are
used below. Change with extreme caution. */
{
int i;
int count = 0;
for (i = 0; i < nstates; i++)
{
int k;
reductions *rp = state_table[i].reduction_table;
shifts *sp = state_table[i].shift_table;
state_table[i].lookaheads = count;
if (rp
&& (rp->nreds > 1
|| (sp && !ISVAR (state_table[sp->shifts[0]].accessing_symbol))))
count += rp->nreds;
else
state_table[i].consistent = 1;
if (sp)
for (k = 0; k < sp->nshifts; k++)
if (state_table[sp->shifts[k]].accessing_symbol
== error_token_number)
{
state_table[i].consistent = 0;
break;
}
}
state_table[nstates].lookaheads = count;
}
}
static void
set_accessing_symbol (void)
{
core *sp;
accessing_symbol = XCALLOC (short, nstates);
for (sp = first_state; sp; sp = sp->next)
accessing_symbol[sp->number] = sp->accessing_symbol;
}
static void
set_shift_table (void)
{
shifts *sp;
shift_table = XCALLOC (shifts *, nstates);
for (sp = first_shift; sp; sp = sp->next)
shift_table[sp->number] = sp;
}
static void
set_reduction_table (void)
{
reductions *rp;
reduction_table = XCALLOC (reductions *, nstates);
for (rp = first_reduction; rp; rp = rp->next)
reduction_table[rp->number] = rp;
}
static void
set_maxrhs (void)
/* Return the size of the longest ride hand side of the rules. */
static size_t
maxrhs (void)
{
short *itemp;
int length;
@@ -212,7 +236,7 @@ set_maxrhs (void)
}
}
maxrhs = max;
return max;
}
@@ -221,65 +245,23 @@ initialize_LA (void)
{
int i;
int j;
int count;
reductions *rp;
shifts *sp;
short *np;
reductions *rp;
consistent = XCALLOC (char, nstates);
lookaheads = XCALLOC (short, nstates + 1);
size_t nLA = state_table[nstates].lookaheads;
if (!nLA)
nLA = 1;
count = 0;
for (i = 0; i < nstates; i++)
{
int k;
lookaheads[i] = count;
rp = reduction_table[i];
sp = shift_table[i];
if (rp && (rp->nreds > 1
|| (sp && !ISVAR (accessing_symbol[sp->shifts[0]]))))
count += rp->nreds;
else
consistent[i] = 1;
if (sp)
for (k = 0; k < sp->nshifts; k++)
{
if (accessing_symbol[sp->shifts[k]] == error_token_number)
{
consistent[i] = 0;
break;
}
}
}
lookaheads[nstates] = count;
if (count == 0)
{
LA = XCALLOC (unsigned, 1 * tokensetsize);
LAruleno = XCALLOC (short, 1);
lookback = XCALLOC (shorts *, 1);
}
else
{
LA = XCALLOC (unsigned, count * tokensetsize);
LAruleno = XCALLOC (short, count);
lookback = XCALLOC (shorts *, count);
}
LA = XCALLOC (unsigned, nLA * tokensetsize);
LAruleno = XCALLOC (short, nLA);
lookback = XCALLOC (shorts *, nLA);
np = LAruleno;
for (i = 0; i < nstates; i++)
{
if (!consistent[i])
{
if ((rp = reduction_table[i]))
for (j = 0; j < rp->nreds; j++)
*np++ = rp->rules[j];
}
}
if (!state_table[i].consistent)
if ((rp = state_table[i].reduction_table))
for (j = 0; j < rp->nreds; j++)
*np++ = rp->rules[j];
}
@@ -302,7 +284,7 @@ set_goto_map (void)
{
for (i = sp->nshifts - 1; i >= 0; i--)
{
symbol = accessing_symbol[sp->shifts[i]];
symbol = state_table[sp->shifts[i]].accessing_symbol;
if (ISTOKEN (symbol))
break;
@@ -337,7 +319,7 @@ set_goto_map (void)
for (i = sp->nshifts - 1; i >= 0; i--)
{
state2 = sp->shifts[i];
symbol = accessing_symbol[state2];
symbol = state_table[state2].accessing_symbol;
if (ISTOKEN (symbol))
break;
@@ -413,7 +395,7 @@ initialize_F (void)
for (i = 0; i < ngotos; i++)
{
stateno = to_state[i];
sp = shift_table[stateno];
sp = state_table[stateno].shift_table;
if (sp)
{
@@ -421,7 +403,7 @@ initialize_F (void)
for (j = 0; j < k; j++)
{
symbol = accessing_symbol[sp->shifts[j]];
symbol = state_table[sp->shifts[j]].accessing_symbol;
if (ISVAR (symbol))
break;
SETBIT (rowp, symbol);
@@ -429,7 +411,7 @@ initialize_F (void)
for (; j < k; j++)
{
symbol = accessing_symbol[sp->shifts[j]];
symbol = state_table[sp->shifts[j]].accessing_symbol;
if (nullable[symbol])
edge[nedges++] = map_goto (stateno, symbol);
}
@@ -452,10 +434,7 @@ initialize_F (void)
digraph (reads);
for (i = 0; i < ngotos; i++)
{
if (reads[i])
XFREE (reads[i]);
}
XFREE (reads[i]);
XFREE (reads);
XFREE (edge);
@@ -470,8 +449,8 @@ add_lookback_edge (int stateno, int ruleno, int gotono)
int found;
shorts *sp;
i = lookaheads[stateno];
k = lookaheads[stateno + 1];
i = state_table[stateno].lookaheads;
k = state_table[stateno + 1].lookaheads;
found = 0;
while (!found && i < k)
{
@@ -568,13 +547,13 @@ build_relations (void)
includes = XCALLOC (short *, ngotos);
edge = XCALLOC (short, ngotos + 1);
states = XCALLOC (short, maxrhs + 1);
states = XCALLOC (short, maxrhs () + 1);
for (i = 0; i < ngotos; i++)
{
nedges = 0;
state1 = from_state[i];
symbol1 = accessing_symbol[to_state[i]];
symbol1 = state_table[to_state[i]].accessing_symbol;
for (rulep = derives[symbol1]; *rulep > 0; rulep++)
{
@@ -582,23 +561,23 @@ build_relations (void)
states[0] = state1;
stateno = state1;
for (rp = ritem + rrhs[*rulep]; *rp > 0; rp++)
for (rp = ritem + rule_table[*rulep].rhs; *rp > 0; rp++)
{
symbol2 = *rp;
sp = shift_table[stateno];
sp = state_table[stateno].shift_table;
k = sp->nshifts;
for (j = 0; j < k; j++)
{
stateno = sp->shifts[j];
if (accessing_symbol[stateno] == symbol2)
if (state_table[stateno].accessing_symbol == symbol2)
break;
}
states[length++] = stateno;
}
if (!consistent[stateno])
if (!state_table[stateno].consistent)
add_lookback_edge (stateno, *rulep, i);
length--;
@@ -651,10 +630,7 @@ compute_FOLLOWS (void)
digraph (includes);
for (i = 0; i < ngotos; i++)
{
if (includes[i])
XFREE (includes[i]);
}
XFREE (includes[i]);
XFREE (includes);
}
@@ -664,39 +640,20 @@ static void
compute_lookaheads (void)
{
int i;
int n;
unsigned *fp1;
unsigned *fp2;
unsigned *fp3;
shorts *sp;
unsigned *rowp;
shorts *sptmp; /* JF */
rowp = LA;
n = lookaheads[nstates];
for (i = 0; i < n; i++)
{
fp3 = rowp + tokensetsize;
for (sp = lookback[i]; sp; sp = sp->next)
{
fp1 = rowp;
fp2 = F + tokensetsize * sp->value;
while (fp1 < fp3)
*fp1++ |= *fp2++;
}
for (i = 0; i < state_table[nstates].lookaheads; i++)
for (sp = lookback[i]; sp; sp = sp->next)
{
unsigned *fp1 = LA (i);
unsigned *fp2 = F (sp->value);
while (fp1 < LA (i + 1))
*fp1++ |= *fp2++;
}
rowp = fp3;
}
for (i = 0; i < n; i++)
{
/* JF removed ref to freed storage */
for (sp = lookback[i]; sp; sp = sptmp)
{
sptmp = sp->next;
XFREE (sp);
}
}
/* Free LOOKBACK. */
for (i = 0; i < state_table[nstates].lookaheads; i++)
LIST_FREE (shorts, lookback[i]);
XFREE (lookback);
XFREE (F);
@@ -709,10 +666,6 @@ lalr (void)
tokensetsize = WORDSIZE (ntokens);
set_state_table ();
set_accessing_symbol ();
set_shift_table ();
set_reduction_table ();
set_maxrhs ();
initialize_LA ();
set_goto_map ();
initialize_F ();
+27 -13
View File
@@ -49,12 +49,6 @@ extern short *goto_map;
extern short *from_state;
extern short *to_state;
/* CONSISTENT[S] is nonzero if no lookahead is needed to decide what
to do in state S. */
extern char *consistent;
/* LARULENO is a vector which records the rules that need lookahead in
various states. The elements of LARULENO that apply to state S are
those from LOOKAHEADS[S] through LOOKAHEADS[S+1]-1. Each element
@@ -72,15 +66,35 @@ extern short *LAruleno;
it is a conflict. */
extern unsigned *LA;
#define LA(Rule) (LA + (Rule) * tokensetsize)
/* A structure decorating a state, with additional information. */
typedef struct state_s
{
/* A state. */
core *state;
/* Its accessing symbol. */
short accessing_symbol;
shifts *shift_table;
reductions *reduction_table;
/* Nonzero if no lookahead is needed to decide what to do in state
S. */
char consistent;
short lookaheads;
} state_t;
/* All the decorated states, indexed by the state number. Warning:
there is a state_TABLE in LR0.c, but it is different and static.
*/
extern state_t *state_table;
extern int tokensetsize;
extern short *lookaheads;
extern short *accessing_symbol;
extern core **state_table;
extern shifts **shift_table;
extern reductions **reduction_table;
/* The number of lookaheads. */
extern size_t nlookaheads;
#endif /* !LALR_H_ */
+24 -23
View File
@@ -29,15 +29,15 @@
/* Buffer for storing the current token. */
struct obstack token_obstack;
char *token_buffer = NULL;
const char *token_buffer = NULL;
bucket *symval;
bucket *symval = NULL;
int numval;
/* A token to be reread, see unlex and lex. */
static token_t unlexed = tok_undef;
static bucket *unlexed_symval = NULL;
static char *unlexed_token_buffer = NULL;
static const char *unlexed_token_buffer = NULL;
void
lex_init (void)
@@ -585,9 +585,9 @@ token_t
parse_percent_token (void)
{
struct percent_table_struct *tx = NULL;
/* Where `=' was found in token_buffer. */
size_t equal_offset = 0;
char *arg = NULL;
const char *arg = NULL;
/* Where the ARG was found in token_buffer. */
size_t arg_offset = 0;
int c = getc (finput);
@@ -629,33 +629,34 @@ parse_percent_token (void)
c = getc (finput);
}
/* %DIRECTIVE="ARG". Separate into
TOKEN_BUFFER = `%DIRECTIVE\0ARG\0'.
This is a bit hackish, but once we move to a Bison parser,
things will be cleaned up. */
if (c == '=')
{
equal_offset = obstack_object_size (&token_obstack);
obstack_1grow (&token_obstack, c);
/* End of the directive. We skip the `='. */
obstack_1grow (&token_obstack, '\0');
/* Fetch the ARG if present. */
c = getc (finput);
if (c = '"')
if (c == '"')
{
int code; /* ignored here */
obstack_1grow (&token_obstack, '"');
/* Read up to and including ". */
while (literalchar (&token_obstack, &code, '"'))
/* nothing */;
int code;
arg_offset = obstack_object_size (&token_obstack);
/* Read up to and including `"'. Do not append the closing
`"' in the output: it's not part of the ARG. */
while (literalchar (NULL, &code, '"'))
obstack_1grow (&token_obstack, code);
}
/* else: should be an error. */
}
else
ungetc (c, finput);
obstack_1grow (&token_obstack, '\0');
token_buffer = obstack_finish (&token_obstack);
if (equal_offset)
{
/* %token_buffer="arg" */
arg = token_buffer + equal_offset + 2;
arg[strlen (arg) - 1] = '\0';
token_buffer[equal_offset] = '\0';
}
if (arg_offset)
arg = token_buffer + arg_offset;
/* table lookup % directive */
for (tx = percent_table; tx->name; tx++)
@@ -676,7 +677,7 @@ parse_percent_token (void)
precedence. Side effect: if this %-option is used
several times, only the first is honored. Bah. */
if (!*((char **) (tx->set_flag)))
*((char **) (tx->set_flag)) = arg;
*((char **) (tx->set_flag)) = xstrdup (arg);
}
else
fatal (_("`%s' requires an argument"), token_buffer);
+1 -1
View File
@@ -55,7 +55,7 @@ typedef enum token_e
tok_obsolete
} token_t;
extern char *token_buffer;
extern const char *token_buffer;
extern bucket *symval;
extern int numval;
+7 -1
View File
@@ -117,7 +117,13 @@ main (int argc, char *argv[])
output_files ();
exit (complain_message_count ? 1 : 0);
/* If using alloca.c, flush the alloca'ed memory for the benefit of
people running Bison as a library in IDEs. */
#if C_ALLOCA
alloca (0);
#endif
return complain_message_count ? EXIT_FAILURE : EXIT_SUCCESS;
}
/* Abort for an internal error denoted by string S. */
+27 -18
View File
@@ -1,5 +1,5 @@
/* Part of the bison parser generator,
Copyright 1984, 1989, 2000 Free Software Foundation, Inc.
Copyright 1984, 1989, 2000, 2001 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
@@ -24,32 +24,39 @@
do so. */
#include "system.h"
#include "getargs.h"
#include "reader.h"
#include "types.h"
#include "gram.h"
#include "nullable.h"
char *nullable = NULL;
static void
nullable_print (FILE *out)
{
int i;
fputs ("NULLABLE\n", out);
for (i = ntokens; i < nsyms; i++)
fprintf (out, "\t%s: %s\n", tags[i], nullable[i] ? "yes" : "no");
fputs ("\n\n", out);
}
void
set_nullable (void)
{
short *r;
short *s1;
short *s2;
int ruleno;
int symbol;
shorts *p;
short *squeue;
short *rcount;
shorts **rsets;
shorts *relts;
char any_tokens;
short *r1;
#ifdef TRACE
fprintf (stderr, _("Entering set_nullable"));
#endif
if (trace_flag)
fprintf (stderr, "Entering set_nullable\n");
nullable = XCALLOC (char, nvars) - ntokens;
@@ -69,7 +76,7 @@ set_nullable (void)
{
if (*r < 0)
{
symbol = rlhs[-(*r++)];
int symbol = rule_table[-(*r++)].lhs;
if (symbol >= 0 && !nullable[symbol])
{
nullable[symbol] = 1;
@@ -78,17 +85,16 @@ set_nullable (void)
}
else
{
r1 = r;
any_tokens = 0;
int any_tokens = 0;
int symbol;
short *r1 = r;
for (symbol = *r++; symbol > 0; symbol = *r++)
{
if (ISTOKEN (symbol))
any_tokens = 1;
}
if (ISTOKEN (symbol))
any_tokens = 1;
if (!any_tokens)
{
ruleno = -symbol;
int ruleno = -symbol;
r = r1;
for (symbol = *r++; symbol > 0; symbol = *r++)
{
@@ -107,11 +113,11 @@ set_nullable (void)
p = rsets[*s1++];
while (p)
{
ruleno = p->value;
int ruleno = p->value;
p = p->next;
if (--rcount[ruleno] == 0)
{
symbol = rlhs[ruleno];
int symbol = rule_table[ruleno].lhs;
if (symbol >= 0 && !nullable[symbol])
{
nullable[symbol] = 1;
@@ -125,6 +131,9 @@ set_nullable (void)
XFREE (rcount);
XFREE (rsets + ntokens);
XFREE (relts);
if (trace_flag)
nullable_print (stderr);
}
+50 -72
View File
@@ -319,8 +319,15 @@ output_gram (void)
if (!semantic_parser && !no_parser_flag)
obstack_sgrow (&table_obstack, "\n#if YYDEBUG != 0\n");
output_short_table (&table_obstack, 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;
@@ -347,7 +354,13 @@ output_gram (void)
static void
output_stos (void)
{
output_short_table (&table_obstack, 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);
}
@@ -362,10 +375,16 @@ output_rule_data (void)
obstack_sgrow (&table_obstack, "\n\
#if YYDEBUG != 0\n");
output_short_table (&table_obstack,
"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);
}
obstack_sgrow (&table_obstack, "#endif\n\n");
@@ -449,19 +468,24 @@ output_rule_data (void)
}
/* Output YYR1. */
output_short_table (&table_obstack,
{
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);
}
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;
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,
@@ -470,7 +494,7 @@ output_rule_data (void)
XFREE (short_tab);
XFREE (rrhs + 1);
XFREE (rule_table + 1);
}
@@ -524,7 +548,7 @@ action_row (int state)
default_rule = 0;
nreds = 0;
redp = reduction_table[state];
redp = state_table[state].reduction_table;
if (redp)
{
@@ -534,13 +558,13 @@ action_row (int state)
{
/* 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;
wordp = LA (i);
mask = 1;
/* and find each token which the rule finds acceptable
@@ -563,7 +587,7 @@ action_row (int state)
}
}
shiftp = shift_table[state];
shiftp = state_table[state].shift_table;
/* 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
@@ -579,7 +603,7 @@ action_row (int state)
if (!shift_state)
continue;
symbol = accessing_symbol[shift_state];
symbol = state_table[shift_state].accessing_symbol;
if (ISVAR (symbol))
break;
@@ -614,7 +638,7 @@ action_row (int state)
if (nreds >= 1 && !nodefault)
{
if (consistent[state])
if (state_table[state].consistent)
default_rule = redp->rules[0];
else
{
@@ -736,37 +760,6 @@ token_actions (void)
}
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)
{
@@ -1116,12 +1109,10 @@ output_actions (void)
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);
@@ -1288,21 +1279,6 @@ output_program (void)
}
static void
free_itemsets (void)
{
core *cp, *cptmp;
XFREE (state_table);
for (cp = first_state; cp; cp = cptmp)
{
cptmp = cp->next;
XFREE (cp);
}
}
/*----------------------------------------------------------.
| Output the parsing tables and the parser code to ftable. |
`----------------------------------------------------------*/
@@ -1334,7 +1310,7 @@ output (void)
if (!no_parser_flag)
obstack_sgrow (&table_obstack, "#include <stdio.h>\n\n");
free_itemsets ();
LIST_FREE (core, first_state);
output_defines ();
output_token_translations ();
/* if (semantic_parser) */
@@ -1345,6 +1321,8 @@ output (void)
output_stos ();
output_rule_data ();
output_actions ();
XFREE (state_table);
if (!no_parser_flag)
output_parser ();
output_program ();
+43 -55
View File
@@ -1,5 +1,5 @@
/* Print information on generated parser, for bison,
Copyright 1984, 1986, 1989, 2000 Free Software Foundation, Inc.
Copyright 1984, 1986, 1989, 2000, 2001 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
@@ -29,6 +29,7 @@
#include "state.h"
#include "reader.h"
#include "print.h"
#include "reduce.h"
#if 0
static void
@@ -47,40 +48,32 @@ static void
print_core (FILE *out, int state)
{
int i;
int k;
int rule;
core *statep;
short *sp;
short *sp1;
core *statep = state_table[state].state;
statep = state_table[state];
k = statep->nitems;
if (k == 0)
if (!statep->nitems)
return;
for (i = 0; i < k; i++)
for (i = 0; i < statep->nitems; i++)
{
short *sp;
short *sp1;
int rule;
sp1 = sp = ritem + statep->items[i];
while (*sp > 0)
sp++;
rule = -(*sp);
fprintf (out, " %s -> ", tags[rlhs[rule]]);
fprintf (out, " %s -> ", tags[rule_table[rule].lhs]);
for (sp = ritem + rrhs[rule]; sp < sp1; sp++)
{
fprintf (out, "%s ", tags[*sp]);
}
for (sp = ritem + rule_table[rule].rhs; sp < sp1; sp++)
fprintf (out, "%s ", tags[*sp]);
fputc ('.', out);
while (*sp > 0)
{
fprintf (out, " %s", tags[*sp]);
sp++;
}
for (/* Nothing */; *sp > 0; ++sp)
fprintf (out, " %s", tags[*sp]);
fprintf (out, _(" (rule %d)"), rule);
fputc ('\n', out);
@@ -94,16 +87,10 @@ print_actions (FILE *out, int state)
{
int i;
int k;
int state1;
int symbol;
shifts *shiftp;
errs *errp;
reductions *redp;
int rule;
shiftp = shift_table[state];
redp = reduction_table[state];
errp = err_table[state];
shifts *shiftp = state_table[state].shift_table;
reductions *redp = state_table[state].reduction_table;
errs *errp = err_table[state];
if (!shiftp && !redp)
{
@@ -120,10 +107,11 @@ print_actions (FILE *out, int state)
for (i = 0; i < k; i++)
{
if (!shiftp->shifts[i])
int symbol;
int state1 = shiftp->shifts[i];
if (!state1)
continue;
state1 = shiftp->shifts[i];
symbol = accessing_symbol[state1];
symbol = state_table[state1].accessing_symbol;
/* The following line used to be turned off. */
if (ISVAR (symbol))
break;
@@ -147,15 +135,12 @@ print_actions (FILE *out, int state)
if (errp)
{
int j, nerrs;
nerrs = errp->nerrs;
for (j = 0; j < nerrs; j++)
int j;
for (j = 0; j < errp->nerrs; j++)
{
if (!errp->errs[j])
int symbol = errp->errs[j];
if (!symbol)
continue;
symbol = errp->errs[j];
fprintf (out, _(" %-4s\terror (nonassociative)\n"),
tags[symbol]);
}
@@ -164,10 +149,10 @@ print_actions (FILE *out, int state)
fputc ('\n', out);
}
if (consistent[state] && redp)
if (state_table[state].consistent && redp)
{
rule = redp->rules[0];
symbol = rlhs[rule];
int rule = redp->rules[0];
int symbol = rule_table[rule].lhs;
fprintf (out, _(" $default\treduce using rule %d (%s)\n\n"),
rule, tags[symbol]);
}
@@ -180,10 +165,11 @@ print_actions (FILE *out, int state)
{
for (; i < k; i++)
{
if (!shiftp->shifts[i])
int symbol;
int state1 = shiftp->shifts[i];
if (!state1)
continue;
state1 = shiftp->shifts[i];
symbol = accessing_symbol[state1];
symbol = state_table[state1].accessing_symbol;
fprintf (out, _(" %-4s\tgo to state %d\n"),
tags[symbol], state1);
}
@@ -227,17 +213,19 @@ print_grammar (FILE *out)
/* rule # : LHS -> RHS */
fprintf (out, "\n%s\n\n", _("Grammar"));
fprintf (out, " %s\n", _("Number, Line, Rule"));
for (i = 1; i <= nrules; i++)
/* Don't print rules disabled in reduce_grammar_tables. */
if (rlhs[i] >= 0)
if (rule_table[i].lhs >= 0)
{
fprintf (out, _("rule %-4d %s ->"), i, tags[rlhs[i]]);
rule = &ritem[rrhs[i]];
fprintf (out, _(" %3d %3d %s ->"),
i, rule_table[i].line, tags[rule_table[i].lhs]);
rule = &ritem[rule_table[i].rhs];
if (*rule > 0)
while (*rule > 0)
fprintf (out, " %s", tags[*rule++]);
else
fprintf (out, " /* %s */", _("empty"));
fprintf (out, " /* %s */", _("empty"));
fputc ('\n', out);
}
@@ -255,7 +243,7 @@ print_grammar (FILE *out)
sprintf (buffer, " (%d)", i);
for (j = 1; j <= nrules; j++)
for (rule = &ritem[rrhs[j]]; *rule > 0; rule++)
for (rule = &ritem[rule_table[j].rhs]; *rule > 0; rule++)
if (*rule == token_translations[i])
{
END_TEST (65);
@@ -273,9 +261,9 @@ print_grammar (FILE *out)
for (j = 1; j <= nrules; j++)
{
if (rlhs[j] == i)
if (rule_table[j].lhs == i)
left_count++;
for (rule = &ritem[rrhs[j]]; *rule > 0; rule++)
for (rule = &ritem[rule_table[j].rhs]; *rule > 0; rule++)
if (*rule == i)
{
right_count++;
@@ -297,7 +285,7 @@ print_grammar (FILE *out)
for (j = 1; j <= nrules; j++)
{
END_TEST (65);
if (rlhs[j] == i)
if (rule_table[j].lhs == i)
sprintf (buffer + strlen (buffer), " %d", j);
}
}
@@ -310,7 +298,7 @@ print_grammar (FILE *out)
sprintf (buffer + strlen (buffer), _(" on right:"));
for (j = 1; j <= nrules; j++)
{
for (rule = &ritem[rrhs[j]]; *rule > 0; rule++)
for (rule = &ritem[rule_table[j].rhs]; *rule > 0; rule++)
if (*rule == i)
{
END_TEST (65);
+58 -73
View File
@@ -31,42 +31,25 @@
#include "obstack.h"
#include "print_graph.h"
#include "vcg.h"
#include "quotearg.h"
static graph_t graph;
static FILE *fgraph = NULL;
static size_t node_output_size = 0;
/* Return an unambiguous printable representated, allocated in slot 0,
for NAME, suitable for C strings. */
static char const *
quote (char const *name)
{
return quotearg_n_style (0, escape_quoting_style, name);
}
/* This part will construct the label of nodes. */
static void
print_core (int state, struct obstack *node_obstack)
{
int i;
int k;
int rule;
core *statep;
short *sp;
short *sp1;
core *statep = state_table[state].state;
statep = state_table[state];
k = statep->nitems;
if (k == 0)
if (!statep->nitems)
return;
for (i = 0; i < k; i++)
for (i = 0; i < statep->nitems; i++)
{
if (i)
obstack_sgrow (node_obstack, "\\n");
short *sp;
short *sp1;
int rule;
sp1 = sp = ritem + statep->items[i];
@@ -75,23 +58,30 @@ print_core (int state, struct obstack *node_obstack)
rule = -(*sp);
if (i)
obstack_1grow (node_obstack, '\n');
obstack_fgrow1 (node_obstack, "%d: ", rule);
obstack_fgrow1 (node_obstack, " %s -> ", quote (tags[rlhs[rule]]));
obstack_fgrow1 (node_obstack, " %s -> ",
tags[rule_table[rule].lhs]);
for (sp = ritem + rrhs[rule]; sp < sp1; sp++)
obstack_fgrow1 (node_obstack, "%s ", quote (tags[*sp]));
for (sp = ritem + rule_table[rule].rhs; sp < sp1; sp++)
obstack_fgrow1 (node_obstack, "%s ", tags[*sp]);
obstack_1grow (node_obstack, '.');
while (*sp > 0)
obstack_fgrow1 (node_obstack, " %s", quote (tags[*sp++]));
for (/* Nothing */; *sp > 0; ++sp)
obstack_fgrow1 (node_obstack, " %s", tags[*sp]);
}
}
/* Output in graph_obstack edges specifications in incidence with current
node. */
/*---------------------------------------------------------------.
| Output in graph_obstack edges specifications in incidence with |
| current node. |
`---------------------------------------------------------------*/
static void
print_actions (int state, const char *node_name, struct obstack *node_obstack)
print_actions (int state, const char *node_name)
{
int i;
int k;
@@ -100,20 +90,21 @@ print_actions (int state, const char *node_name, struct obstack *node_obstack)
shifts *shiftp;
errs *errp;
reductions *redp;
int rule;
static char buff[10];
edge_t edge;
shiftp = shift_table[state];
redp = reduction_table[state];
shiftp = state_table[state].shift_table;
redp = state_table[state].reduction_table;
errp = err_table[state];
if (!shiftp && !redp)
{
#if 0
if (final_state == state)
obstack_sgrow (node_obstack, "$default: accept");
else
obstack_sgrow (node_obstack, "NO ACTIONS");
#endif
return;
}
@@ -126,7 +117,7 @@ print_actions (int state, const char *node_name, struct obstack *node_obstack)
if (!shiftp->shifts[i])
continue;
state1 = shiftp->shifts[i];
symbol = accessing_symbol[state1];
symbol = state_table[state1].accessing_symbol;
if (ISVAR (symbol))
break;
@@ -142,9 +133,7 @@ print_actions (int state, const char *node_name, struct obstack *node_obstack)
sprintf (buff, "%d", state1);
edge.targetname = buff;
edge.color = (symbol == 0) ? red : blue;
/* FIXME: Be aware that quote uses static memory. The string
must be output immediately (which is the case here). */
edge.label = tags[symbol] ? quote (tags[symbol]) : NULL;
edge.label = tags[symbol];
output_edge (&edge, fgraph);
close_edge (fgraph);
}
@@ -156,6 +145,7 @@ print_actions (int state, const char *node_name, struct obstack *node_obstack)
k = 0;
}
#if 0
if (errp)
{
int j, nerrs;
@@ -168,25 +158,29 @@ print_actions (int state, const char *node_name, struct obstack *node_obstack)
continue;
symbol = errp->errs[j];
/* If something has been added in the NODE_OBSTACK after
the declaration of the label, then we need a `\n'. */
the declaration of the label, then we need a `\n'.
if (obstack_object_size (node_obstack) > node_output_size)
obstack_sgrow (node_obstack, "\\n");
obstack_sgrow (node_obstack, "\n");
*/
obstack_fgrow1 (node_obstack, _("%-4s\terror (nonassociative)"),
tags[symbol]);
}
if (j > 0)
obstack_sgrow (node_obstack, "\\n");
obstack_1grow (node_obstack, '\n');
}
if (consistent[state] && redp)
if (state_table[state].consistent && redp)
{
rule = redp->rules[0];
symbol = rlhs[rule];
symbol = rule_table[rule].lhs;
/*
if (obstack_object_size (node_obstack) > node_output_size)
obstack_sgrow (node_obstack, "\\n");
obstack_sgrow (node_obstack, "\n");
*/
obstack_fgrow2 (node_obstack, _("$default\treduce using rule %d (%s)"),
rule, tags[symbol]);
}
#endif
if (i < k)
{
@@ -195,7 +189,7 @@ print_actions (int state, const char *node_name, struct obstack *node_obstack)
if (!shiftp->shifts[i])
continue;
state1 = shiftp->shifts[i];
symbol = accessing_symbol[state1];
symbol = state_table[state1].accessing_symbol;
new_edge (&edge);
open_edge (&edge, fgraph);
@@ -203,15 +197,19 @@ print_actions (int state, const char *node_name, struct obstack *node_obstack)
sprintf (buff, "%d", state1);
edge.targetname = buff;
edge.color = red;
edge.label = tags[symbol] ? quote (tags[symbol]) : NULL;
edge.label = tags[symbol];
output_edge (&edge, fgraph);
close_edge (fgraph);
}
}
}
/* Output in GRAPH_OBSTACK the current node specifications and edges
which go out from that node. */
/*-------------------------------------------------------------.
| Output in FGRAPH the current node specifications and exiting |
| edges. |
`-------------------------------------------------------------*/
static void
print_state (int state)
{
@@ -219,35 +217,22 @@ print_state (int state)
struct obstack node_obstack;
node_t node;
/* The labels of the nodes are their the items. */
obstack_init (&node_obstack);
new_node (&node); /* Set node attributs default value. */
new_node (&node);
sprintf (name, "%d", state);
node.title = name; /* Give a name to the node. */
{
/* Here we begin to compute the node label. */
obstack_sgrow (&node_obstack, "\t\tlabel:\t\""); /* Open Label */
/* Keep the size of NODE_OBSTACK before computing the label. It is
useful to format the label. */
node_output_size = obstack_object_size (&node_obstack);
/* Compute the labels of nodes on the fly. */
print_core (state, &node_obstack);
/* Compute edges and additionnal parts of node label. */
print_actions (state, node.title, &node_obstack);
obstack_sgrow (&node_obstack, "\"\n"); /* Close Label. */
}
node.title = name;
print_core (state, &node_obstack);
obstack_1grow (&node_obstack, '\0');
node.label = obstack_finish (&node_obstack);
open_node (fgraph);
/* Output a VCG formatted attributs list. */
output_node (&node, fgraph);
/* Save the node label. */
fwrite (obstack_base (&node_obstack),
obstack_object_size (&node_obstack), 1, fgraph);
close_node (fgraph);
/* Output the edges. */
print_actions (state, name);
obstack_free (&node_obstack, 0);
}
@@ -256,7 +241,7 @@ void
print_graph (void)
{
int i;
if (!graph_flag)
return;
@@ -267,7 +252,7 @@ print_graph (void)
#if 0
graph.smanhattan_edges = yes;
graph.manhattan_edges = yes;
graph.manhattan_edges = yes;
#endif
graph.display_edge_labels = yes;
@@ -285,8 +270,8 @@ print_graph (void)
open_graph (fgraph);
output_graph (&graph, fgraph);
/* Output nodes and edges. */
for (i = 0; i < nstates; i++)
/* Output nodes & edges. */
print_state (i);
/* Close graph. */
+88 -91
View File
@@ -34,13 +34,11 @@
#include "reader.h"
#include "conflicts.h"
/* Number of slots allocated (but not necessarily used yet) in `rline' */
static int rline_allocated;
typedef struct symbol_list
{
struct symbol_list *next;
bucket *sym;
int line;
bucket *ruleprec;
}
symbol_list;
@@ -64,6 +62,19 @@ static int lastprec;
static bucket *errtoken;
static bucket *undeftoken;
static symbol_list *
symbol_list_new (bucket *sym)
{
symbol_list *res = XMALLOC (symbol_list, 1);
res->next = NULL;
res->sym = sym;
res->line = lineno;
res->ruleprec = NULL;
return res;
}
/*===================\
@@ -121,7 +132,7 @@ read_signed_integer (FILE *stream)
`--------------------------------------------------------------*/
static char *
get_type_name (int n, symbol_list * rule)
get_type_name (int n, symbol_list *rule)
{
int i;
symbol_list *rp;
@@ -539,7 +550,8 @@ parse_token_decl (symbol_class what_is, symbol_class what_is_not)
else
{
complain (_("`%s' is invalid in %s"),
token_buffer, (what_is == token_sym) ? "%token" : "%nterm");
token_buffer,
(what_is == token_sym) ? "%token" : "%nterm");
skip_to_char ('%');
}
}
@@ -1006,10 +1018,10 @@ read_declarations (void)
case tok_stropt:
case tok_intopt:
case tok_obsolete:
case tok_illegal:
abort ();
break;
case tok_illegal:
default:
complain (_("unrecognized: %s"), token_buffer);
skip_to_char ('%');
@@ -1215,20 +1227,6 @@ copy_guard (symbol_list *rule, int stack_offset)
}
static void
record_rule_line (void)
{
/* Record each rule's source line number in rline table. */
if (nrules >= rline_allocated)
{
rline_allocated = nrules * 2;
rline = XREALLOC (rline, short, rline_allocated);
}
rline[nrules] = lineno;
}
/*-------------------------------------------------------------------.
| Generate a dummy symbol, a nonterminal, whose name cannot conflict |
| with the user's names. |
@@ -1371,10 +1369,7 @@ readgram (void)
nrules++;
nitems++;
record_rule_line ();
p = XCALLOC (symbol_list, 1);
p->sym = lhs;
p = symbol_list_new (lhs);
crule1 = p1;
if (p1)
@@ -1436,36 +1431,35 @@ readgram (void)
non-terminal. */
if (action_flag)
{
bucket *sdummy;
/* Since the action was written out with this rule's
number, we must give the new rule this number by
inserting the new rule before it. */
/* Make a dummy nonterminal, a gensym. */
sdummy = gensym ();
bucket *sdummy = gensym ();
/* Make a new rule, whose body is empty,
before the current one, so that the action
just read can belong to it. */
/* Make a new rule, whose body is empty, before the
current one, so that the action just read can
belong to it. */
nrules++;
nitems++;
record_rule_line ();
p = XCALLOC (symbol_list, 1);
p = symbol_list_new (sdummy);
/* Attach its lineno to that of the host rule. */
p->line = crule->line;
if (crule1)
crule1->next = p;
else
grammar = p;
p->sym = sdummy;
crule1 = XCALLOC (symbol_list, 1);
p->next = crule1;
/* End of the rule. */
crule1 = symbol_list_new (NULL);
crule1->next = crule;
p->next = crule1;
/* Insert the dummy generated by that rule into this
rule. */
nitems++;
p = XCALLOC (symbol_list, 1);
p->sym = sdummy;
p = symbol_list_new (sdummy);
p1->next = p;
p1 = p;
@@ -1475,8 +1469,7 @@ readgram (void)
if (t == tok_identifier)
{
nitems++;
p = XCALLOC (symbol_list, 1);
p->sym = symval;
p = symbol_list_new (symval);
p1->next = p;
p1 = p;
}
@@ -1490,7 +1483,7 @@ readgram (void)
} /* end of read rhs of rule */
/* Put an empty link in the list to mark the end of this rule */
p = XCALLOC (symbol_list, 1);
p = symbol_list_new (NULL);
p1->next = p;
p1 = p;
@@ -1672,6 +1665,49 @@ output_token_defines (struct obstack *oout)
}
/*--------------------.
| Output the header. |
`--------------------*/
static void
symbols_output (void)
{
if (defines_flag)
{
output_token_defines (&defines_obstack);
if (!pure_parser)
{
if (spec_name_prefix)
obstack_fgrow1 (&defines_obstack, "\nextern YYSTYPE %slval;\n",
spec_name_prefix);
else
obstack_sgrow (&defines_obstack,
"\nextern YYSTYPE yylval;\n");
}
if (semantic_parser)
{
int i;
for (i = ntokens; i < nsyms; i++)
{
/* don't make these for dummy nonterminals made by gensym. */
if (*tags[i] != '@')
obstack_fgrow2 (&defines_obstack,
"# define\tNT%s\t%d\n", tags[i], i);
}
#if 0
/* `fdefines' is now a temporary file, so we need to copy its
contents in `done', so we can't close it here. */
fclose (fdefines);
fdefines = NULL;
#endif
}
}
}
/*------------------------------------------------------------------.
| Set TOKEN_TRANSLATIONS. Check that no two symbols share the same |
| number. |
@@ -1813,40 +1849,6 @@ packsymbols (void)
fatal (_("the start symbol %s is a token"), startval->tag);
start_symbol = startval->value;
if (defines_flag)
{
output_token_defines (&defines_obstack);
if (!pure_parser)
{
if (spec_name_prefix)
obstack_fgrow1 (&defines_obstack, "\nextern YYSTYPE %slval;\n",
spec_name_prefix);
else
obstack_sgrow (&defines_obstack,
"\nextern YYSTYPE yylval;\n");
}
if (semantic_parser)
{
int i;
for (i = ntokens; i < nsyms; i++)
{
/* don't make these for dummy nonterminals made by gensym. */
if (*tags[i] != '@')
obstack_fgrow2 (&defines_obstack,
"# define\tNT%s\t%d\n", tags[i], i);
}
#if 0
/* `fdefines' is now a temporary file, so we need to copy its
contents in `done', so we can't close it here. */
fclose (fdefines);
fdefines = NULL;
#endif
}
}
}
@@ -1862,14 +1864,8 @@ packgram (void)
int ruleno;
symbol_list *p;
bucket *ruleprec;
ritem = XCALLOC (short, nitems + 1);
rlhs = XCALLOC (short, nrules) - 1;
rrhs = XCALLOC (short, nrules) - 1;
rprec = XCALLOC (short, nrules) - 1;
rprecsym = XCALLOC (short, nrules) - 1;
rassoc = XCALLOC (short, nrules) - 1;
rule_table = XCALLOC (rule_t, nrules) - 1;
itemno = 0;
ruleno = 1;
@@ -1877,9 +1873,10 @@ packgram (void)
p = grammar;
while (p)
{
rlhs[ruleno] = p->sym->value;
rrhs[ruleno] = itemno;
ruleprec = p->ruleprec;
bucket *ruleprec = p->ruleprec;
rule_table[ruleno].lhs = p->sym->value;
rule_table[ruleno].rhs = itemno;
rule_table[ruleno].line = p->line;
p = p->next;
while (p && p->sym)
@@ -1889,8 +1886,8 @@ packgram (void)
of the last token in it. */
if (p->sym->class == token_sym)
{
rprec[ruleno] = p->sym->prec;
rassoc[ruleno] = p->sym->assoc;
rule_table[ruleno].prec = p->sym->prec;
rule_table[ruleno].assoc = p->sym->assoc;
}
if (p)
p = p->next;
@@ -1900,9 +1897,9 @@ packgram (void)
the specified symbol's precedence replaces the default. */
if (ruleprec)
{
rprec[ruleno] = ruleprec->prec;
rassoc[ruleno] = ruleprec->assoc;
rprecsym[ruleno] = ruleprec->value;
rule_table[ruleno].prec = ruleprec->prec;
rule_table[ruleno].assoc = ruleprec->assoc;
rule_table[ruleno].precsym = ruleprec->value;
}
ritem[itemno++] = -ruleno;
@@ -1933,8 +1930,6 @@ reader (void)
nvars = 0;
nrules = 0;
nitems = 0;
rline_allocated = 10;
rline = XCALLOC (short, rline_allocated);
typed = 0;
lastprec = 0;
@@ -1990,6 +1985,8 @@ reader (void)
packsymbols ();
/* Convert the grammar into the format described in gram.h. */
packgram ();
/* Output the headers. */
symbols_output ();
}
+59 -72
View File
@@ -100,7 +100,7 @@ useful_production (int i, BSet N0)
/* A production is useful if all of the nonterminals in its appear
in the set of useful nonterminals. */
for (r = &ritem[rrhs[i]]; *r > 0; r++)
for (r = &ritem[rule_table[i].rhs]; *r > 0; r++)
if (ISVAR (n = *r))
if (!BITISSET (N0, n - ntokens))
return FALSE;
@@ -149,7 +149,7 @@ useless_nonterminals (void)
{
if (useful_production (i, N))
{
SETBIT (Np, rlhs[i] - ntokens);
SETBIT (Np, rule_table[i].lhs - ntokens);
SETBIT (P, i);
}
}
@@ -200,38 +200,33 @@ inaccessable_symbols (void)
Pp = XCALLOC (unsigned, WORDSIZE (nrules + 1));
/* If the start symbol isn't useful, then nothing will be useful. */
if (!BITISSET (N, start_symbol - ntokens))
goto end_iteration;
SETBIT (V, start_symbol);
while (1)
if (BITISSET (N, start_symbol - ntokens))
{
for (i = WORDSIZE (nsyms) - 1; i >= 0; i--)
Vp[i] = V[i];
for (i = 1; i <= nrules; i++)
SETBIT (V, start_symbol);
while (1)
{
if (!BITISSET (Pp, i) && BITISSET (P, i) && BITISSET (V, rlhs[i]))
for (i = WORDSIZE (nsyms) - 1; i >= 0; i--)
Vp[i] = V[i];
for (i = 1; i <= nrules; i++)
{
for (r = &ritem[rrhs[i]]; *r >= 0; r++)
if (!BITISSET (Pp, i)
&& BITISSET (P, i)
&& BITISSET (V, rule_table[i].lhs))
{
if (ISTOKEN (t = *r) || BITISSET (N, t - ntokens))
{
for (r = &ritem[rule_table[i].rhs]; *r >= 0; r++)
if (ISTOKEN (t = *r) || BITISSET (N, t - ntokens))
SETBIT (Vp, t);
}
SETBIT (Pp, i);
}
SETBIT (Pp, i);
}
if (bits_equal (V, Vp, WORDSIZE (nsyms)))
break;
Vs = Vp;
Vp = V;
V = Vs;
}
if (bits_equal (V, Vp, WORDSIZE (nsyms)))
{
break;
}
Vs = Vp;
Vp = V;
V = Vs;
}
end_iteration:
XFREE (V);
V = Vp;
@@ -255,8 +250,8 @@ end_iteration:
/* A token that was used in %prec should not be warned about. */
for (i = 1; i < nrules; i++)
if (rprecsym[i] != 0)
SETBIT (V1, rprecsym[i]);
if (rule_table[i].precsym != 0)
SETBIT (V1, rule_table[i].precsym);
}
static void
@@ -279,15 +274,15 @@ reduce_grammar_tables (void)
np++;
if (pn != np)
{
rlhs[np] = rlhs[pn];
rule_table[np].lhs = rule_table[pn].lhs;
rline[np] = rline[pn];
rprec[np] = rprec[pn];
rassoc[np] = rassoc[pn];
rrhs[np] = rrhs[pn];
if (rrhs[np] != ni)
rule_table[np].prec = rule_table[pn].prec;
rule_table[np].assoc = rule_table[pn].assoc;
rule_table[np].rhs = rule_table[pn].rhs;
if (rule_table[np].rhs != ni)
{
pi = rrhs[np];
rrhs[np] = ni;
pi = rule_table[np].rhs;
rule_table[np].rhs = ni;
while (ritem[pi] >= 0)
ritem[ni++] = ritem[pi++];
ritem[ni++] = -np;
@@ -319,7 +314,7 @@ reduce_grammar_tables (void)
{
if (!BITISSET (P, pn))
{
rlhs[pn] = -1;
rule_table[pn].lhs = -1;
}
}
}
@@ -368,11 +363,11 @@ reduce_grammar_tables (void)
for (i = 1; i <= nrules; i++)
{
/* Ignore the rules disabled above. */
if (rlhs[i] >= 0)
rlhs[i] = nontermmap[rlhs[i]];
if (ISVAR (rprecsym[i]))
if (rule_table[i].lhs >= 0)
rule_table[i].lhs = nontermmap[rule_table[i].lhs];
if (ISVAR (rule_table[i].precsym))
/* Can this happen? */
rprecsym[i] = nontermmap[rprecsym[i]];
rule_table[i].precsym = nontermmap[rule_table[i].precsym];
}
for (r = ritem; *r; r++)
@@ -430,28 +425,26 @@ reduce_output (FILE *out)
fprintf (out, _("Useless rules:"));
fprintf (out, "\n\n");
for (i = 1; i <= nrules; i++)
{
if (!BITISSET (P, i))
{
fprintf (out, "#%-4d ", i);
fprintf (out, "%s :\t", tags[rlhs[i]]);
for (r = &ritem[rrhs[i]]; *r >= 0; r++)
fprintf (out, " %s", tags[*r]);
fprintf (out, ";\n");
}
}
if (!BITISSET (P, i))
{
fprintf (out, "#%-4d ", i);
fprintf (out, "%s :\t", tags[rule_table[i].lhs]);
for (r = &ritem[rule_table[i].rhs]; *r >= 0; r++)
fprintf (out, " %s", tags[*r]);
fprintf (out, ";\n");
}
}
if (nuseless_nonterminals > 0 || nuseless_productions > 0 || b)
fprintf (out, "\n\n");
}
#if 0 /* XXX currently unused. */
static void
dump_grammar (FILE *out)
{
int i;
rule r;
fprintf (out, "REDUCED GRAMMAR\n\n");
fprintf (out,
"ntokens = %d, nvars = %d, nsyms = %d, nrules = %d, nitems = %d\n\n",
ntokens, nvars, nsyms, nrules, nitems);
@@ -464,8 +457,12 @@ dump_grammar (FILE *out)
for (i = 1; i <= nrules; i++)
{
fprintf (out, "%-5d(%5d%5d)%5d : (@%-5d)",
i, rprec[i], rassoc[i], rlhs[i], rrhs[i]);
for (r = &ritem[rrhs[i]]; *r > 0; r++)
i,
rule_table[i].prec,
rule_table[i].assoc,
rule_table[i].lhs,
rule_table[i].rhs);
for (r = &ritem[rule_table[i].rhs]; *r > 0; r++)
fprintf (out, "%5d", *r);
fprintf (out, " [%d]\n", -(*r));
}
@@ -473,14 +470,13 @@ dump_grammar (FILE *out)
fprintf (out, _("Rules interpreted\n-----------------\n\n"));
for (i = 1; i <= nrules; i++)
{
fprintf (out, "%-5d %s :", i, tags[rlhs[i]]);
for (r = &ritem[rrhs[i]]; *r > 0; r++)
fprintf (out, "%-5d %s :", i, tags[rule_table[i].lhs]);
for (r = &ritem[rule_table[i].rhs]; *r > 0; r++)
fprintf (out, " %s", tags[*r]);
fputc ('\n', out);
}
fprintf (out, "\n\n");
}
#endif
@@ -541,24 +537,15 @@ reduce_grammar (void)
tags[start_symbol]);
reduce_grammar_tables ();
#if 0
if (verbose_flag)
{
fprintf (out, "REDUCED GRAMMAR\n\n");
dump_grammar ();
}
#endif
if (statistics_flag)
fprintf (stderr, _("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"));
if (trace_flag)
{
dump_grammar (stderr);
fprintf (stderr, "reduced %s defines %d terminals, %d nonterminals\
, and %d productions.\n",
infile, ntokens, nvars, nrules);
}
}
+14 -1
View File
@@ -99,7 +99,9 @@ typedef struct core
}
core;
#define CORE_ALLOC(Nitems) \
(core *) xcalloc ((unsigned) (sizeof (core) \
+ (Nitems - 1) * sizeof (short)), 1)
typedef struct shifts
{
@@ -110,6 +112,9 @@ typedef struct shifts
}
shifts;
#define SHIFTS_ALLOC(Nshifts) \
(shifts *) xcalloc ((unsigned) (sizeof (shifts) \
+ (Nshifts - 1) * sizeof (short)), 1)
typedef struct errs
@@ -119,6 +124,10 @@ typedef struct errs
}
errs;
#define ERRS_ALLOC(Nerrs) \
(errs *) xcalloc ((unsigned) (sizeof (errs) \
+ (Nerrs - 1) * sizeof (short)), 1)
typedef struct reductions
@@ -130,4 +139,8 @@ typedef struct reductions
}
reductions;
#define REDUCTIONS_ALLOC(Nreductions) \
(reductions *) xcalloc ((unsigned) (sizeof (reductions) \
+ (Nreductions - 1) * sizeof (short)), 1)
#endif /* !STATE_H_ */
+42
View File
@@ -40,6 +40,18 @@
# include <stdlib.h>
#endif
/* The following test is to work around the gross typo in
systems like Sony NEWS-OS Release 4.0C, whereby EXIT_FAILURE
is defined to 0, not 1. */
#if !EXIT_FAILURE
# undef EXIT_FAILURE
# define EXIT_FAILURE 1
#endif
#ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
#endif
#if HAVE_UNISTD_H
# include <unistd.h>
#endif
@@ -67,6 +79,21 @@
extern int errno;
#endif
/* AIX requires this to be the first thing in the file. */
#ifndef __GNUC__
# if HAVE_ALLOCA_H
# include <alloca.h>
# else
# ifdef _AIX
#pragma alloca
# else
# ifndef alloca /* predefined by HP cc +Olibcalls */
char *alloca ();
# endif
# endif
# endif
#endif
#if PROTOTYPES
# define PARAMS(p) p
#else
@@ -267,6 +294,21 @@ do { \
#endif
/* As memcpy, but for shorts. */
#define shortcpy(Dest, Src, Num) \
memcpy (Dest, Src, Num * sizeof (short))
/* Free a linked list. */
#define LIST_FREE(Type, List) \
do { \
Type *_node, *_next; \
for (_node = List; _node; _node = _next) \
{ \
_next = _node->next; \
XFREE (_node); \
} \
} while (0)
/*---------------------------------.
| Debugging the memory allocator. |
`---------------------------------*/
+46 -35
View File
@@ -21,6 +21,16 @@
#include "system.h"
#include "vcg.h"
#include "vcg_defaults.h"
#include "quotearg.h"
/* Return an unambiguous printable representated, allocated in slot 0,
for NAME, suitable for C strings. */
static char const *
quote (char const *name)
{
return quotearg_n_style (0, c_quoting_style, name);
}
/* Initialize a graph with the default values. */
void
@@ -429,7 +439,7 @@ void
add_classname (graph_t *g, int val, const char *name)
{
struct classname_s *classname;
classname = XMALLOC (struct classname_s, 1);
classname->no = val;
classname->name = name;
@@ -441,7 +451,7 @@ void
add_infoname (graph_t *g, int integer, const char *string)
{
struct infoname_s *infoname;
infoname = XMALLOC (struct infoname_s, 1);
infoname->integer = integer;
infoname->string = string;
@@ -451,11 +461,11 @@ add_infoname (graph_t *g, int integer, const char *string)
/* Build a colorentry struct and add it to the list. */
void
add_colorentry (graph_t *g, int color_idx, int red_cp,
add_colorentry (graph_t *g, int color_idx, int red_cp,
int green_cp, int blue_cp)
{
struct colorentry_s *ce;
ce = XMALLOC (struct colorentry_s, 1);
ce->color_index = color_idx;
ce->red_cp = red_cp;
@@ -556,9 +566,9 @@ void
output_node (node_t *node, FILE *fout)
{
if (node->title != N_TITLE)
fprintf (fout, "\t\ttitle:\t\"%s\"\n", node->title);
fprintf (fout, "\t\ttitle:\t%s\n", quote (node->title));
if (node->label != N_LABEL)
fprintf (fout, "\t\tlabel:\t\"%s\"\n", node->label);
fprintf (fout, "\t\tlabel:\t%s\n", quote (node->label));
if ((node->locx != N_LOCX) && (node->locy != N_LOCY))
fprintf (fout, "\t\tloc { x: %d y: %d }\t\n", node->locx, node->locy);
@@ -600,12 +610,13 @@ output_node (node_t *node, FILE *fout)
fprintf (fout, "\t\tbordercolor:\t%s\n",
get_color_str (node->bordercolor));
if (node->infos[0])
fprintf (fout, "\t\tinfo1:\t\"%s\"\n", node->infos[0]);
if (node->infos[1])
fprintf (fout, "\t\tinfo2:\t\"%s\"\n", node->infos[1]);
if (node->infos[2])
fprintf (fout, "\t\tinfo3:\t\"%s\"\n", node->infos[2]);
{
int i;
for (i = 0; i < 3; ++i)
if (node->infos[i])
fprintf (fout, "\t\tinfo%d:\t%s\n",
i, quote (node->infos[i]));
}
}
void
@@ -614,16 +625,16 @@ output_edge (edge_t *edge, FILE *fout)
/* FIXME: SOURCENAME and TARGETNAME are mandatory
so it has to be fatal not to give these informations. */
if (edge->sourcename != E_SOURCENAME)
fprintf (fout, "\t\tsourcename:\t\"%s\"\n", edge->sourcename);
fprintf (fout, "\t\tsourcename:\t%s\n", quote (edge->sourcename));
if (edge->targetname != E_TARGETNAME)
fprintf (fout, "\t\ttargetname:\t\"%s\"\n", edge->targetname);
fprintf (fout, "\t\ttargetname:\t%s\n", quote (edge->targetname));
if (edge->label != E_LABEL)
fprintf (fout, "\t\tlabel:\t\"%s\"\n", edge->label);
fprintf (fout, "\t\tlabel:\t%s\n", quote (edge->label));
if (edge->linestyle != E_LINESTYLE)
fprintf (fout, "\t\tlinestyle:\t\"%s\"\n",
get_linestyle_str(edge->linestyle));
fprintf (fout, "\t\tlinestyle:\t%s\n",
quote (get_linestyle_str(edge->linestyle)));
if (edge->thickness != E_THICKNESS)
fprintf (fout, "\t\tthickness:\t%d\n", edge->thickness);
@@ -666,16 +677,16 @@ void
output_graph (graph_t *graph, FILE *fout)
{
if (graph->title)
fprintf (fout, "\ttitle:\t\"%s\"\n", graph->title);
fprintf (fout, "\ttitle:\t%s\n", quote (graph->title));
if (graph->label)
fprintf (fout, "\tlabel:\t\"%s\"\n", graph->label);
fprintf (fout, "\tlabel:\t%s\n", quote (graph->label));
if (graph->infos[0])
fprintf (fout, "\tinfo1:\t\"%s\"\n", graph->infos[0]);
if (graph->infos[1])
fprintf (fout, "\tinfo2:\t\"%s\"\n", graph->infos[1]);
if (graph->infos[2])
fprintf (fout, "\tinfo3:\t\"%s\"\n", graph->infos[2]);
{
int i;
for (i = 0; i < 3; ++i)
if (graph->infos[i])
fprintf (fout, "\tinfo%d:\t%s\n", i, quote (graph->infos[i]));
}
if (graph->color != G_COLOR)
fprintf (fout, "\tcolor:\t%s\n", get_color_str (graph->color));
@@ -711,11 +722,11 @@ output_graph (graph_t *graph, FILE *fout)
if (graph->shape != G_SHAPE)
fprintf (fout, "\tshape:\t%s\n", get_shape_str (graph->shape));
if (graph->vertical_order != G_VERTICAL_ORDER)
fprintf (fout, "\tvertical_order:\t%d\n", graph->vertical_order);
fprintf (fout, "\tvertical_order:\t%d\n", graph->vertical_order);
if (graph->horizontal_order != G_HORIZONTAL_ORDER)
fprintf (fout, "\thorizontal_order:\t%d\n", graph->horizontal_order);
fprintf (fout, "\thorizontal_order:\t%d\n", graph->horizontal_order);
if (graph->xmax != G_XMAX)
fprintf (fout, "\txmax:\t%d\n", graph->xmax);
@@ -743,8 +754,8 @@ output_graph (graph_t *graph, FILE *fout)
if (graph->hidden != G_HIDDEN)
fprintf (fout, "\thidden:\t%d\n", graph->hidden);
/* FIXME: Unallocate struct list if required.
/* FIXME: Unallocate struct list if required.
Maybe with a little function. */
if (graph->classname != G_CLASSNAME)
{
@@ -765,15 +776,15 @@ output_graph (graph_t *graph, FILE *fout)
if (graph->colorentry != G_COLORENTRY)
{
struct colorentry_s *ite;
for (ite = graph->colorentry; ite; ite = ite->next)
{
fprintf (fout, "\tcolorentry %d :\t%d %d %d\n",
ite->color_index,
{
fprintf (fout, "\tcolorentry %d :\t%d %d %d\n",
ite->color_index,
ite->red_cp,
ite->green_cp,
ite->blue_cp);
}
}
}
if (graph->layoutalgorithm != G_LAYOUTALGORITHM)
+1 -1
View File
@@ -10,4 +10,4 @@ CFLAGS='@CFLAGS@'
GCC='@GCC@'
# We need `config.h'.
CPPFLAGS="-I $top_builddir @CPPFLAGS@"
CPPFLAGS="-I $top_buildpath @CPPFLAGS@"
+14 -8
View File
@@ -338,8 +338,14 @@ AT_CHECK([bison calc.y -o calc.c m4_bpatsubst([$1], [--yyerror-verbose])],
# Maybe some day we will have proper Autoconf macros to disable these
# warnings, but this place is not the right one for that.
# So let's keep only GCC warnings, which we know are sane.
AT_CHECK([$CC $CFLAGS $CPPFLAGS calc.c -o calc], 0, [], [stderr])
AT_CHECK([if test "$GCC" = yes; then cat stderr; else true; fi])
# Well, that's only part of the story: some assemblers issue warnings
# which can be totally useless, and actually polluting. It seems that
# the best bet be to completely ignore stderr, but to pass -Werror
# to GCC.
if test "$GCC" = yes; then
CFLAGS="$CFLAGS -Werror"
fi
AT_CHECK([$CC $CFLAGS $CPPFLAGS calc.c -o calc], 0, [], [ignore])
# Test the priorities.
_AT_CHECK_CALC([$1],
@@ -360,24 +366,24 @@ _AT_CHECK_CALC([$1],
# Some parse errors.
_AT_CHECK_CALC_ERROR([$1], [+1], [8],
[1.0:1.1],
[unexpected `'+''])
[unexpected '+'])
_AT_CHECK_CALC_ERROR([$1], [1//2], [17],
[1.2:1.3],
[unexpected `'/'', expecting `NUM' or `'-'' or `'(''])
[unexpected '/', expecting NUM or '-' or '('])
_AT_CHECK_CALC_ERROR([$1], [error], [8],
[1.0:1.1],
[unexpected `$undefined.'])
[unexpected $undefined.])
_AT_CHECK_CALC_ERROR([$1], [1 = 2 = 3], [23],
[1.6:1.7],
[unexpected `'=''])
[unexpected '='])
_AT_CHECK_CALC_ERROR([$1],
[
+1],
[16],
[2.0:2.1],
[unexpected `'+''])
[unexpected '+'])
AT_CLEANUP(calc calc.c calc.h calc.output)
AT_CLEANUP
])# AT_CHECK_CALC
+1 -1
View File
@@ -31,7 +31,7 @@ foo: {}
AT_CHECK([bison $3 $1], 0)
AT_CHECK([ls $4], [], [ignore])
AT_CLEANUP($4)
AT_CLEANUP
])
AT_CHECK_OUTPUT([foo.y], [], [-dv],
+186 -25
View File
@@ -40,7 +40,7 @@ exp: '(' exp ')' | NUM ;
AT_CHECK([bison -v duplicate.y -o duplicate.c], 0, ignore, ignore)
AT_CLEANUP([duplicate.*])
AT_CLEANUP
## ------------------------- ##
@@ -65,8 +65,9 @@ AT_CHECK([cat input.output], [],
Grammar
rule 1 exp -> exp OP exp
rule 2 exp -> NUM
Number, Line, Rule
1 3 exp -> exp OP exp
2 3 exp -> NUM
Terminals, with rules where they appear
@@ -139,7 +140,7 @@ state 6
$default accept
]])
AT_CLEANUP(input.c input.output)
AT_CLEANUP
## --------------------- ##
@@ -163,8 +164,9 @@ AT_CHECK([cat input.output], [],
Grammar
rule 1 exp -> exp OP exp
rule 2 exp -> NUM
Number, Line, Rule
1 4 exp -> exp OP exp
2 4 exp -> NUM
Terminals, with rules where they appear
@@ -236,7 +238,149 @@ state 6
$default accept
]])
AT_CLEANUP(input.c input.output)
AT_CLEANUP
## ------------------- ##
## Rule Line Numbers. ##
## ------------------- ##
AT_SETUP([Rule Line Numbers])
AT_DATA([input.y],
[[%%
expr:
'a'
{
}
'b'
{
}
|
{
}
'c'
{
}
]])
AT_CHECK([bison input.y -o input.c -v], 0, [], [])
# Check the contents of the report.
AT_CHECK([cat input.output], [],
[[
Grammar
Number, Line, Rule
1 2 @1 -> /* empty */
2 2 expr -> 'a' @1 'b'
3 15 @2 -> /* empty */
4 15 expr -> @2 'c'
Terminals, with rules where they appear
$ (-1)
'a' (97) 2
'b' (98) 2
'c' (99) 4
error (256)
Nonterminals, with rules where they appear
expr (6)
on left: 2 4
@1 (7)
on left: 1, on right: 2
@2 (8)
on left: 3, on right: 4
state 0
'a' shift, and go to state 1
$default reduce using rule 3 (@2)
expr go to state 6
@2 go to state 2
state 1
expr -> 'a' . @1 'b' (rule 2)
$default reduce using rule 1 (@1)
@1 go to state 3
state 2
expr -> @2 . 'c' (rule 4)
'c' shift, and go to state 4
state 3
expr -> 'a' @1 . 'b' (rule 2)
'b' shift, and go to state 5
state 4
expr -> @2 'c' . (rule 4)
$default reduce using rule 4 (expr)
state 5
expr -> 'a' @1 'b' . (rule 2)
$default reduce using rule 2 (expr)
state 6
$ go to state 7
state 7
$ go to state 8
state 8
$default accept
]])
AT_CLEANUP
@@ -257,7 +401,7 @@ AT_CHECK([bison input.y -o input.c], 1, [],
[input.y contains 1 shift/reduce conflict.
expected 0 shift/reduce conflicts
])
AT_CLEANUP(input.c)
AT_CLEANUP
## --------------- ##
@@ -273,10 +417,8 @@ AT_DATA([input.y],
exp: exp OP exp | NUM;
]])
AT_CHECK([bison input.y -o input.c], 0, [],
[input.y contains 1 shift/reduce conflict.
])
AT_CLEANUP(input.c)
AT_CHECK([bison input.y -o input.c], 0)
AT_CLEANUP
## ------------------ ##
@@ -296,7 +438,7 @@ AT_CHECK([bison input.y -o input.c], 1, [],
[input.y contains 1 shift/reduce conflict.
expected 2 shift/reduce conflicts
])
AT_CLEANUP(input.c)
AT_CLEANUP
## ---------------------- ##
@@ -318,7 +460,7 @@ exp: ;
AT_CHECK([bison -v input.y -o input.c], 0, ignore, ignore)
AT_CLEANUP([input.*])
AT_CLEANUP
@@ -341,7 +483,7 @@ exp: {};
AT_CHECK([bison --defines union.y])
AT_CLEANUP([union.*])
AT_CLEANUP
## --------------------------------------- ##
@@ -364,7 +506,7 @@ exp: {};
AT_CHECK([bison union-comment.y])
AT_CHECK([fgrep '//*' union-comment.tab.c], [1], [])
AT_CLEANUP([union-comment.*])
AT_CLEANUP
## ----------------- ##
@@ -380,9 +522,9 @@ AT_DATA([input.y],
]])
AT_CHECK([bison input.y], [1], [],
[input.y:2: invalid input: `?'
[[input.y:2: invalid input: `?'
input.y:3: fatal error: no rules in the input grammar
])
]])
AT_CLEANUP
@@ -400,8 +542,29 @@ default: 'a' }
]])
AT_CHECK([bison input.y], [1], [],
[input.y:2: invalid input: `}'
])
[[input.y:2: invalid input: `}'
]])
AT_CLEANUP
## -------------------- ##
## Invalid %directive. ##
## -------------------- ##
AT_SETUP([Invalid %directive])
AT_DATA([input.y],
[[%invalid
]])
AT_CHECK([bison input.y], [1], [],
[[input.y:1: unrecognized: %invalid
input.y:1: Skipping to next %
input.y:2: fatal error: no input grammar
]])
AT_CLEANUP
@@ -416,11 +579,9 @@ AT_CLEANUP
m4_define([AT_TEST_CPP_GUARD_H],
[AT_SETUP([Invalid CPP guards: $1])
# possibly create and nuke inner directories.
m4_bmatch([$1], [[/]],
[dirname=`AS_DIRNAME([$1])`
# Possibly create inner directories.
dirname=`AS_DIRNAME([$1])`
AS_MKDIR_P([$dirname])
AT_CLEANUP_FILES([$dirname])])
AT_DATA([$1.y],
[%%
@@ -432,7 +593,7 @@ AT_CHECK([bison --defines=$1.h $1.y])
# CPP should be happy with it.
AT_CHECK([$CC -E $1.h], 0, [ignore])
AT_CLEANUP($1.*)
AT_CLEANUP
])
AT_TEST_CPP_GUARD_H([input/input])
+1 -1
View File
@@ -19,7 +19,7 @@
# 02111-1307, USA.
# We need a recent Autotest.
m4_version_prereq([2.52e])
m4_version_prereq([2.52g])
AT_INIT
-1
View File
@@ -73,7 +73,6 @@ main (int argc, const char **argv)
]])
AT_CHECK([bison input.y -o input.c])
AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -o input], 0, [], [ignore])
AT_CLEANUP_FILES(input input.c)
])