mirror of
https://git.savannah.gnu.org/git/bison.git
synced 2026-03-09 12:23:04 +00:00
f805dfcb3f
Its value can be "LALR", "IELR", or "canonical LR". * lib/timevar.def (TV_IELR_PHASE1): New var. (TV_IELR_PHASE2): New var. (TV_IELR_PHASE3): New var. (TV_IELR_PHASE4): New var. * src/Makefile.am (bison_SOURCES): Add AnnotationList.c, AnnotationList.h, InadequacyList.c, InadequacyList.h, Sbitset.c, Sbitset.h, ielr.h, and ielr.c. * src/getargs.h, src/getargs.c (enum trace, trace_args, trace_types): Add trace_ielr. * src/lalr.h, src/lalr.c (ngotos): Export it. (F): Rename to... (goto_follows): ... this, update all uses, and export it. (set_goto_map): Export it. (map_goto): Export it. (compute_lookahead_tokens): Don't free goto_follows yet. Now handled in ielr. (initialize_LA): Export it. Move lookback allocation to... (lalr): ... here because, for canonical LR, initialize_LA must be invoked but lookback and much of the rest of LALR isn't needed. * main.c (main): Instead of lalr, invoke ielr, which invokes lalr. * src/reader.c (reader): Default lr.type to "LALR". Default lr.default_rules to "accepting" if lr.type is "canonical LR". Leave the default as "all" otherwise. Check for a valid lr.type value. * src/state.h, src/state.c (struct state_list): Add state_list member. (state_new): Initialize state_list member to NULL. (state_new_isocore): New function, exported. * tests/existing.at (AT_TEST_EXISTING_GRAMMAR): New macro that exercises all values of lr.type. (GNU AWK Grammar): Rename test group to... (GNU AWK 3.1.0 Grammar): ... this, and extend to use AT_TEST_EXISTING_GRAMMAR. (GNU Cim Grammar): Extend to use AT_TEST_EXISTING_GRAMMAR. (GNU pic Grammar): Rename test group to... (GNU pic (Groff 1.18.1) Grammar): ... this, and extend to use AT_TEST_EXISTING_GRAMMAR. * tests/reduce.at (AT_TEST_LR_TYPE): New macro that exercises all values of lr.type. (Single State Split): New test groups using AT_TEST_LR_TYPE. (Lane Split): Likewise. (Complex Lane Split): Likewise. (Split During Added Lookahead Propagation): Likewise.
108 lines
3.0 KiB
C
108 lines
3.0 KiB
C
/* Compute lookahead criteria for bison,
|
|
|
|
Copyright (C) 1984, 1986, 1989, 2000, 2002, 2004, 2006, 2007, 2009
|
|
Free Software Foundation, Inc.
|
|
|
|
This file is part of Bison, the GNU Compiler Compiler.
|
|
|
|
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 Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program 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 this program. If not, see <http://www.gnu.org/licenses/>. */
|
|
|
|
#ifndef LALR_H_
|
|
# define LALR_H_
|
|
|
|
# include <bitset.h>
|
|
# include <bitsetv.h>
|
|
|
|
/* Import the definition of RULE_T. */
|
|
# include "gram.h"
|
|
|
|
/* Import the definition of CORE, TRANSITIONS and REDUCTIONS. */
|
|
# include "state.h"
|
|
|
|
|
|
/** Build the LALR(1) automaton.
|
|
|
|
Compute how to make the finite state machine deterministic; find
|
|
which rules need lookahead in each state, and which lookahead
|
|
tokens they accept.
|
|
|
|
Also builds:
|
|
- #goto_map
|
|
- #from_state
|
|
- #to_state
|
|
- #goto_follows
|
|
*/
|
|
void lalr (void);
|
|
|
|
/**
|
|
* Set #nLA and allocate all reduction lookahead sets. Normally invoked by
|
|
* #lalr.
|
|
*/
|
|
void initialize_LA (void);
|
|
|
|
/**
|
|
* Build only:
|
|
* - #goto_map
|
|
* - #from_state
|
|
* - #to_state
|
|
* Normally invoked by #lalr.
|
|
*/
|
|
void set_goto_map (void);
|
|
|
|
/**
|
|
* Update state numbers recorded in #goto_map, #from_state, and #to_state such
|
|
* that:
|
|
* - \c nstates_old is the old number of states.
|
|
* - Where \c i is the old state number, <tt>old_to_new[i]</tt> is either:
|
|
* - \c nstates_old if state \c i is removed because it is unreachable.
|
|
* Thus, remove all goto entries involving this state.
|
|
* - The new state number.
|
|
*/
|
|
void lalr_update_state_numbers (state_number old_to_new[],
|
|
state_number nstates_old);
|
|
|
|
|
|
/** Release the information related to lookahead tokens.
|
|
|
|
Can be performed once the action tables are computed. */
|
|
void lalr_free (void);
|
|
|
|
typedef size_t goto_number;
|
|
# define GOTO_NUMBER_MAXIMUM ((goto_number) -1)
|
|
|
|
/** Index into #from_state and #to_state.
|
|
|
|
All the transitions that accept a particular variable are grouped
|
|
together and GOTO_MAP[I - NTOKENS] is the index in FROM_STATE and
|
|
TO_STATE of the first of them. */
|
|
extern goto_number *goto_map;
|
|
|
|
/** The size of #from_state and #to_state. */
|
|
extern goto_number ngotos;
|
|
|
|
/** State number which a transition leads from. */
|
|
extern state_number *from_state;
|
|
|
|
/** State number it leads to. */
|
|
extern state_number *to_state;
|
|
|
|
/** Map a state/symbol pair into its numeric representation. */
|
|
goto_number map_goto (state_number s0, symbol_number sym);
|
|
|
|
/* goto_follows[i] is the set of tokens following goto i. */
|
|
extern bitsetv goto_follows;
|
|
|
|
|
|
#endif /* !LALR_H_ */
|