X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/23ec25b7c6c4eb587a5fa832f67765a6143b7925..e34e97bcd736ab3193bfd3abd4162db3b159836d:/src/main.c?ds=sidebyside diff --git a/src/main.c b/src/main.c index c8dc696e..0396b0f1 100644 --- a/src/main.c +++ b/src/main.c @@ -1,7 +1,7 @@ /* Top level entry point of Bison. - Copyright (C) 1984, 1986, 1989, 1992, 1995, 2000, 2001, 2002, 2004, - 2005, 2006, 2007, 2008, 2009 Free Software Foundation, Inc. + Copyright (C) 1984, 1986, 1989, 1992, 1995, 2000-2002, 2004-2012 Free + Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -24,10 +24,12 @@ #include #include #include +#include #include #include #include "LR0.h" +#include "closeout.h" #include "complain.h" #include "conflicts.h" #include "derives.h" @@ -42,6 +44,7 @@ #include "print.h" #include "print_graph.h" #include "print-xml.h" +#include #include "reader.h" #include "reduce.h" #include "scan-code.h" @@ -52,16 +55,25 @@ #include "uniqstr.h" - int main (int argc, char *argv[]) { - program_name = argv[0]; + set_program_name (argv[0]); setlocale (LC_ALL, ""); (void) bindtextdomain (PACKAGE, LOCALEDIR); (void) bindtextdomain ("bison-runtime", LOCALEDIR); (void) textdomain (PACKAGE); + { + char const *cp = getenv ("LC_CTYPE"); + if (cp && !strcmp (cp, "C")) + set_custom_quoting ("e_quoting_options, "'", "'"); + else + set_quoting_style ("e_quoting_options, locale_quoting_style); + } + + atexit (close_stdout); + uniqstrs_new (); muscle_init (); @@ -97,15 +109,14 @@ main (int argc, char *argv[]) nullable_compute (); timevar_pop (TV_SETS); - /* Convert to nondeterministic finite state machine. In file LR0. - See state.h for more info. */ + /* Compute LR(0) parser states. See state.h for more info. */ timevar_push (TV_LR0); generate_states (); timevar_pop (TV_LR0); - /* Make it deterministic by computing lookahead sets. Except when LALR(1) is - requested, split states to eliminate LR(1)-relative inadequacies. In file - lalr and ielr. */ + /* Add lookahead sets to parser states. Except when LALR(1) is + requested, split states to eliminate LR(1)-relative + inadequacies. */ ielr (); /* Find and record any conflicts: places where one token of