src/main.c

/* Top level entry point of bison,
   Copyright 1984, 1986, 1989, 1992, 1995, 2000, 2001, 2002
   Free Software Foundation, Inc.

   This file is part of Bison, the GNU Compiler Compiler.

   Bison is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2, or (at your option)
   any later version.

   Bison is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with Bison; see the file COPYING.  If not, write to
   the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
   Boston, MA 02111-1307, USA.  */


#include "system.h"
#include "bitset.h"
#include "getargs.h"
#include "files.h"
#include "complain.h"
#include "derives.h"
#include "output.h"
#include "reader.h"
#include "lalr.h"
#include "reduce.h"
#include "nullable.h"
#include "print.h"
#include "LR0.h"
#include "conflicts.h"
#include "print_graph.h"
#include "muscle_tab.h"
#include "symtab.h"
#include "lex.h"

/* The name this program was run with, for messages.  */
char *program_name;

int
main (int argc, char *argv[])
{
  program_name = argv[0];
  setlocale (LC_ALL, "");
  bindtextdomain (PACKAGE, LOCALEDIR);
  textdomain (PACKAGE);

  bitset_stats_init ();

  lineno = 0;
  getargs (argc, argv);

  muscle_init ();

  /* Read the input.  Copy some parts of it to FGUARD, FACTION, FTABLE
     and FATTRS.  In file reader.c.  The other parts are recorded in
     the grammar; see gram.h.  */
  reader ();
  if (complain_message_count)
    exit (1);

  /* Find useless nonterminals and productions and reduce the grammar. */
  reduce_grammar ();

  /* Record other info about the grammar.  In files derives and
     nullable.  */
  set_derives ();
  set_nullable ();

  /* Convert to nondeterministic finite state machine.  In file LR0.
     See state.h for more info.  */
  generate_states ();

  /* make it deterministic.  In file lalr.  */
  lalr ();

  /* Find and record any conflicts: places where one token of
     lookahead is not enough to disambiguate the parsing.  In file
     conflicts.  Also resolve s/r conflicts based on precedence
     declarations.  */
  solve_conflicts ();
  conflicts_print ();

  /* Output file names. */
  compute_output_file_names ();

  /* Output the detailed report on the grammar.  */
  if (verbose_flag)
    print_results ();

  /* Stop if there were errors, to avoid trashing previous output
     files.  */
  if (complain_message_count)
    exit (1);

  /* Output the VCG graph.  */
  if (graph_flag)
    print_graph ();

  /* Output the tables and the parser to ftable.  In file output.  */
  output ();

  reduce_free ();
  free_conflicts ();
  free_nullable ();
  free_derives ();
  grammar_free ();

  /* 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;
}
Commit	Line	Data
	1	/* Top level entry point of bison,
	2	Copyright 1984, 1986, 1989, 1992, 1995, 2000, 2001, 2002
	3	Free Software Foundation, Inc.
	4
	5	This file is part of Bison, the GNU Compiler Compiler.
	6
	7	Bison is free software; you can redistribute it and/or modify
	8	it under the terms of the GNU General Public License as published by
	9	the Free Software Foundation; either version 2, or (at your option)
	10	any later version.
	11
	12	Bison is distributed in the hope that it will be useful,
	13	but WITHOUT ANY WARRANTY; without even the implied warranty of
	14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	15	GNU General Public License for more details.
	16
	17	You should have received a copy of the GNU General Public License
	18	along with Bison; see the file COPYING. If not, write to
	19	the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
	20	Boston, MA 02111-1307, USA. */
	21
	22
	23	#include "system.h"
	24	#include "bitset.h"
	25	#include "getargs.h"
	26	#include "files.h"
	27	#include "complain.h"
	28	#include "derives.h"
	29	#include "output.h"
	30	#include "reader.h"
	31	#include "lalr.h"
	32	#include "reduce.h"
	33	#include "nullable.h"
	34	#include "print.h"
	35	#include "LR0.h"
	36	#include "conflicts.h"
	37	#include "print_graph.h"
	38	#include "muscle_tab.h"
	39	#include "symtab.h"
	40	#include "lex.h"
	41
	42	/* The name this program was run with, for messages. */
	43	char *program_name;
	44
	45	int
	46	main (int argc, char *argv[])
	47	{
	48	program_name = argv[0];
	49	setlocale (LC_ALL, "");
	50	bindtextdomain (PACKAGE, LOCALEDIR);
	51	textdomain (PACKAGE);
	52
	53	bitset_stats_init ();
	54
	55	lineno = 0;
	56	getargs (argc, argv);
	57
	58	muscle_init ();
	59
	60	/* Read the input. Copy some parts of it to FGUARD, FACTION, FTABLE
	61	and FATTRS. In file reader.c. The other parts are recorded in
	62	the grammar; see gram.h. */
	63	reader ();
	64	if (complain_message_count)
	65	exit (1);
	66
	67	/* Find useless nonterminals and productions and reduce the grammar. */
	68	reduce_grammar ();
	69
	70	/* Record other info about the grammar. In files derives and
	71	nullable. */
	72	set_derives ();
	73	set_nullable ();
	74
	75	/* Convert to nondeterministic finite state machine. In file LR0.
	76	See state.h for more info. */
	77	generate_states ();
	78
	79	/* make it deterministic. In file lalr. */
	80	lalr ();
	81
	82	/* Find and record any conflicts: places where one token of
	83	lookahead is not enough to disambiguate the parsing. In file
	84	conflicts. Also resolve s/r conflicts based on precedence
	85	declarations. */
	86	solve_conflicts ();
	87	conflicts_print ();
	88
	89	/* Output file names. */
	90	compute_output_file_names ();
	91
	92	/* Output the detailed report on the grammar. */
	93	if (verbose_flag)
	94	print_results ();
	95
	96	/* Stop if there were errors, to avoid trashing previous output
	97	files. */
	98	if (complain_message_count)
	99	exit (1);
	100
	101	/* Output the VCG graph. */
	102	if (graph_flag)
	103	print_graph ();
	104
	105	/* Output the tables and the parser to ftable. In file output. */
	106	output ();
	107
	108	reduce_free ();
	109	free_conflicts ();
	110	free_nullable ();
	111	free_derives ();
	112	grammar_free ();
	113
	114	/* If using alloca.c, flush the alloca'ed memory for the benefit of
	115	people running Bison as a library in IDEs. */
	116	#if C_ALLOCA
	117	alloca (0);
	118	#endif
	119
	120	return complain_message_count ? EXIT_FAILURE : EXIT_SUCCESS;
	121	}