X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/3628146521aa93cdd499fa5058d21c7be33014bf..f7aed660541ed7b05c4d892334dfe64ba200a4a2:/src/lalr.c?ds=sidebyside diff --git a/src/lalr.c b/src/lalr.c index 27e3d286..2c0c942a 100644 --- a/src/lalr.c +++ b/src/lalr.c @@ -1,348 +1,147 @@ /* Compute look-ahead criteria for bison, - Copyright (C) 1984, 1986, 1989 Free Software Foundation, Inc. + Copyright (C) 1984, 1986, 1989, 2000, 2001, 2002 + Free Software Foundation, Inc. -This file is part of Bison, the GNU Compiler Compiler. + 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 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. + 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. */ + 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. */ -/* Compute how to make the finite state machine deterministic; - find which rules need lookahead in each state, and which lookahead tokens they accept. +/* Compute how to make the finite state machine deterministic; find + which rules need lookahead in each state, and which lookahead + tokens they accept. */ -lalr(), the entry point, builds these data structures: - -goto_map, from_state and to_state - record each shift transition which accepts a variable (a nonterminal). -ngotos is the number of such transitions. -from_state[t] is the state number which a transition leads from -and to_state[t] is the state number it leads to. -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. - -consistent[s] is nonzero if no lookahead is needed to decide what to do in state s. - -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 of LAruleno is a rule number. - -If lr is the length of LAruleno, then a number from 0 to lr-1 -can specify both a rule and a state where the rule might be applied. - -LA is a lr by ntokens matrix of bits. -LA[l, i] is 1 if the rule LAruleno[l] is applicable in the appropriate state - when the next token is symbol i. -If LA[l, i] and LA[l, j] are both 1 for i != j, it is a conflict. -*/ - -#include #include "system.h" -#include "machine.h" -#include "types.h" -#include "state.h" -#include "alloc.h" +#include "bitset.h" +#include "bitsetv.h" +#include "relation.h" +#include "quotearg.h" +#include "symtab.h" #include "gram.h" +#include "reader.h" +#include "LR0.h" #include "complain.h" - -extern short **derives; -extern char *nullable; - - -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; - -void lalr PARAMS((void)); -short **transpose PARAMS((short **, int)); -void set_state_table PARAMS((void)); -void set_accessing_symbol PARAMS((void)); -void set_shift_table PARAMS((void)); -void set_reduction_table PARAMS((void)); -void set_maxrhs PARAMS((void)); -void initialize_LA PARAMS((void)); -void set_goto_map PARAMS((void)); -int map_goto PARAMS((int, int)); -void initialize_F PARAMS((void)); -void build_relations PARAMS((void)); -void add_lookback_edge PARAMS((int, int, int)); -void compute_FOLLOWS PARAMS((void)); -void compute_lookaheads PARAMS((void)); -void digraph PARAMS((short **)); -void traverse PARAMS((register int)); - -extern void berror PARAMS((char *)); - -static int infinity; -static int maxrhs; -static int ngotos; -static unsigned *F; -static short **includes; -static shorts **lookback; -static short **R; -static short *INDEX; -static short *VERTICES; -static int top; - - -void -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(); - build_relations(); - compute_FOLLOWS(); - compute_lookaheads(); -} - - -void -set_state_table (void) -{ - register core *sp; - - state_table = NEW2(nstates, core *); - - for (sp = first_state; sp; sp = sp->next) - state_table[sp->number] = sp; -} - - -void -set_accessing_symbol (void) -{ - register core *sp; - - accessing_symbol = NEW2(nstates, short); - - for (sp = first_state; sp; sp = sp->next) - accessing_symbol[sp->number] = sp->accessing_symbol; -} - - -void -set_shift_table (void) +#include "lalr.h" +#include "nullable.h" +#include "derives.h" +#include "getargs.h" + +goto_number_t *goto_map = NULL; +static goto_number_t ngotos = 0; +state_number_t *from_state = NULL; +state_number_t *to_state = NULL; + +/* Linked list of goto numbers. */ +typedef struct goto_list_s { - register shifts *sp; + struct goto_list_s *next; + goto_number_t value; +} goto_list_t; - shift_table = NEW2(nstates, shifts *); - for (sp = first_shift; sp; sp = sp->next) - shift_table[sp->number] = sp; -} +/* LA is a LR by NTOKENS matrix of bits. LA[l, i] is 1 if the rule + LArule[l] is applicable in the appropriate state when the next + token is symbol i. If LA[l, i] and LA[l, j] are both 1 for i != j, + it is a conflict. */ +static bitsetv LA = NULL; +size_t nLA; -void -set_reduction_table (void) -{ - register reductions *rp; - reduction_table = NEW2(nstates, reductions *); +/* And for the famous F variable, which name is so descriptive that a + comment is hardly needed. . */ +static bitsetv F = NULL; - for (rp = first_reduction; rp; rp = rp->next) - reduction_table[rp->number] = rp; -} +static goto_number_t **includes; +static goto_list_t **lookback; -void -set_maxrhs (void) -{ - register short *itemp; - register int length; - register int max; - length = 0; - max = 0; - for (itemp = ritem; *itemp; itemp++) - { - if (*itemp > 0) - { - length++; - } - else - { - if (length > max) max = length; - length = 0; - } - } - - maxrhs = max; -} - - -void -initialize_LA (void) -{ - register int i; - register int j; - register int count; - register reductions *rp; - register shifts *sp; - register short *np; - consistent = NEW2(nstates, char); - lookaheads = NEW2(nstates + 1, short); - - count = 0; - for (i = 0; i < nstates; i++) - { - register 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 = NEW2(1 * tokensetsize, unsigned); - LAruleno = NEW2(1, short); - lookback = NEW2(1, shorts *); - } - else - { - LA = NEW2(count * tokensetsize, unsigned); - LAruleno = NEW2(count, short); - lookback = NEW2(count, shorts *); - } - - 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]; - } - } -} - - -void +static void set_goto_map (void) { - register shifts *sp; - register int i; - register int symbol; - register int k; - register short *temp_map; - register int state2; - register int state1; + state_number_t state; + goto_number_t *temp_map; - goto_map = NEW2(nvars + 1, short) - ntokens; - temp_map = NEW2(nvars + 1, short) - ntokens; + goto_map = XCALLOC (goto_number_t, nvars + 1) - ntokens; + temp_map = XCALLOC (goto_number_t, nvars + 1) - ntokens; ngotos = 0; - for (sp = first_shift; sp; sp = sp->next) + for (state = 0; state < nstates; ++state) { - for (i = sp->nshifts - 1; i >= 0; i--) + transitions_t *sp = states[state]->transitions; + int i; + for (i = sp->num - 1; i >= 0 && TRANSITION_IS_GOTO (sp, i); --i) { - symbol = accessing_symbol[sp->shifts[i]]; - - if (ISTOKEN(symbol)) break; - - if (ngotos == MAXSHORT) - fatal (_("too many gotos (max %d)"), MAXSHORT); + if (ngotos == GOTO_NUMBER_MAX) + fatal (_("too many gotos (max %d)"), GOTO_NUMBER_MAX); ngotos++; - goto_map[symbol]++; - } + goto_map[TRANSITION_SYMBOL (sp, i)]++; + } } - k = 0; - for (i = ntokens; i < nsyms; i++) - { - temp_map[i] = k; - k += goto_map[i]; - } + { + int k = 0; + int i; + for (i = ntokens; i < nsyms; i++) + { + temp_map[i] = k; + k += goto_map[i]; + } - for (i = ntokens; i < nsyms; i++) - goto_map[i] = temp_map[i]; + for (i = ntokens; i < nsyms; i++) + goto_map[i] = temp_map[i]; - goto_map[nsyms] = ngotos; - temp_map[nsyms] = ngotos; + goto_map[nsyms] = ngotos; + temp_map[nsyms] = ngotos; + } - from_state = NEW2(ngotos, short); - to_state = NEW2(ngotos, short); + from_state = XCALLOC (state_number_t, ngotos); + to_state = XCALLOC (state_number_t, ngotos); - for (sp = first_shift; sp; sp = sp->next) + for (state = 0; state < nstates; ++state) { - state1 = sp->number; - for (i = sp->nshifts - 1; i >= 0; i--) + transitions_t *sp = states[state]->transitions; + int i; + for (i = sp->num - 1; i >= 0 && TRANSITION_IS_GOTO (sp, i); --i) { - state2 = sp->shifts[i]; - symbol = accessing_symbol[state2]; - - if (ISTOKEN(symbol)) break; - - k = temp_map[symbol]++; - from_state[k] = state1; - to_state[k] = state2; + int k = temp_map[TRANSITION_SYMBOL (sp, i)]++; + from_state[k] = state; + to_state[k] = sp->states[i]->number; } } - FREE(temp_map + ntokens); + XFREE (temp_map + ntokens); } -/* Map_goto maps a state/symbol pair into its numeric representation. */ +/*----------------------------------------------------------. +| Map a state/symbol pair into its numeric representation. | +`----------------------------------------------------------*/ -int -map_goto (int state, int symbol) +static int +map_goto (state_number_t state, symbol_number_t symbol) { - register int high; - register int low; - register int middle; - register int s; + int high; + int low; + int middle; + state_number_t s; low = goto_map[symbol]; high = goto_map[symbol + 1] - 1; @@ -359,142 +158,102 @@ map_goto (int state, int symbol) high = middle - 1; } - berror("map_goto"); -/* NOTREACHED */ + assert (0); + /* NOTREACHED */ return 0; } -void +static void initialize_F (void) { - register int i; - register int j; - register int k; - register shifts *sp; - register short *edge; - register unsigned *rowp; - register short *rp; - register short **reads; - register int nedges; - register int stateno; - register int symbol; - register int nwords; - - nwords = ngotos * tokensetsize; - F = NEW2(nwords, unsigned); - - reads = NEW2(ngotos, short *); - edge = NEW2(ngotos + 1, short); - nedges = 0; - - rowp = F; - for (i = 0; i < ngotos; i++) - { - stateno = to_state[i]; - sp = shift_table[stateno]; + goto_number_t **reads = XCALLOC (goto_number_t *, ngotos); + goto_number_t *edge = XCALLOC (goto_number_t, ngotos + 1); + int nedges = 0; - if (sp) - { - k = sp->nshifts; - - for (j = 0; j < k; j++) - { - symbol = accessing_symbol[sp->shifts[j]]; - if (ISVAR(symbol)) - break; - SETBIT(rowp, symbol); - } + int i; - for (; j < k; j++) - { - symbol = accessing_symbol[sp->shifts[j]]; - if (nullable[symbol]) - edge[nedges++] = map_goto(stateno, symbol); - } + F = bitsetv_create (ngotos, ntokens, BITSET_FIXED); - if (nedges) - { - reads[i] = rp = NEW2(nedges + 1, short); + for (i = 0; i < ngotos; i++) + { + state_number_t stateno = to_state[i]; + transitions_t *sp = states[stateno]->transitions; - for (j = 0; j < nedges; j++) - rp[j] = edge[j]; + int j; + FOR_EACH_SHIFT (sp, j) + bitset_set (F[i], TRANSITION_SYMBOL (sp, j)); - rp[nedges] = -1; - nedges = 0; - } + for (; j < sp->num; j++) + { + symbol_number_t symbol = TRANSITION_SYMBOL (sp, j); + if (nullable[symbol]) + edge[nedges++] = map_goto (stateno, symbol); } - rowp += tokensetsize; + if (nedges) + { + reads[i] = XCALLOC (goto_number_t, nedges + 1); + memcpy (reads[i], edge, nedges * sizeof (edge[0])); + reads[i][nedges] = -1; + nedges = 0; + } } - digraph(reads); + relation_digraph (reads, ngotos, &F); for (i = 0; i < ngotos; i++) - { - if (reads[i]) - FREE(reads[i]); - } + XFREE (reads[i]); - FREE(reads); - FREE(edge); + XFREE (reads); + XFREE (edge); } -void +static void +add_lookback_edge (state_t *state, rule_t *rule, int gotono) +{ + int r = state_reduction_find (state, rule); + goto_list_t *sp = XCALLOC (goto_list_t, 1); + sp->next = lookback[(state->reductions->lookaheads - LA) + r]; + sp->value = gotono; + lookback[(state->reductions->lookaheads - LA) + r] = sp; +} + + + +static void build_relations (void) { - register int i; - register int j; - register int k; - register short *rulep; - register short *rp; - register shifts *sp; - register int length; - register int nedges; - register int done; - register int state1; - register int stateno; - register int symbol1; - register int symbol2; - register short *shortp; - register short *edge; - register short *states; - register short **new_includes; - - includes = NEW2(ngotos, short *); - edge = NEW2(ngotos + 1, short); - states = NEW2(maxrhs + 1, short); + goto_number_t *edge = XCALLOC (goto_number_t, ngotos + 1); + state_number_t *states1 = XCALLOC (state_number_t, ritem_longest_rhs () + 1); + int i; + + includes = XCALLOC (goto_number_t *, ngotos); for (i = 0; i < ngotos; i++) { - nedges = 0; - state1 = from_state[i]; - symbol1 = accessing_symbol[to_state[i]]; + int nedges = 0; + symbol_number_t symbol1 = states[to_state[i]]->accessing_symbol; + rule_t **rulep; - for (rulep = derives[symbol1]; *rulep > 0; rulep++) + for (rulep = derives[symbol1]; *rulep; rulep++) { - length = 1; - states[0] = state1; - stateno = state1; + int done; + int length = 1; + item_number_t *rp; + state_t *state = states[from_state[i]]; + states1[0] = state->number; - for (rp = ritem + rrhs[*rulep]; *rp > 0; rp++) + for (rp = (*rulep)->rhs; *rp >= 0; rp++) { - symbol2 = *rp; - sp = shift_table[stateno]; - k = sp->nshifts; - - for (j = 0; j < k; j++) - { - stateno = sp->shifts[j]; - if (accessing_symbol[stateno] == symbol2) break; - } - - states[length++] = stateno; + state = transitions_to (state->transitions, + item_number_as_symbol_number (*rp)); + states1[length++] = state->number; } - if (!consistent[stateno]) - add_lookback_edge(stateno, *rulep, i); + if (!state->consistent) + add_lookback_edge (state, *rulep, i); length--; done = 0; @@ -502,262 +261,195 @@ build_relations (void) { done = 1; rp--; - /* JF added rp>=ritem && I hope to god its right! */ - if (rp>=ritem && ISVAR(*rp)) + /* JF added rp>=ritem && I hope to god its right! */ + if (rp >= ritem && ISVAR (*rp)) { - stateno = states[--length]; - edge[nedges++] = map_goto(stateno, *rp); - if (nullable[*rp]) done = 0; + /* Downcasting from item_number_t to symbol_number_t. */ + edge[nedges++] = map_goto (states1[--length], + item_number_as_symbol_number (*rp)); + if (nullable[*rp]) + done = 0; } } } if (nedges) { - includes[i] = shortp = NEW2(nedges + 1, short); + int j; + includes[i] = XCALLOC (goto_number_t, nedges + 1); for (j = 0; j < nedges; j++) - shortp[j] = edge[j]; - shortp[nedges] = -1; + includes[i][j] = edge[j]; + includes[i][nedges] = -1; } } - new_includes = transpose(includes, ngotos); - - for (i = 0; i < ngotos; i++) - if (includes[i]) - FREE(includes[i]); - - FREE(includes); + XFREE (edge); + XFREE (states1); - includes = new_includes; - - FREE(edge); - FREE(states); + relation_transpose (&includes, ngotos); } -void -add_lookback_edge (int stateno, int ruleno, int gotono) -{ - register int i; - register int k; - register int found; - register shorts *sp; - - i = lookaheads[stateno]; - k = lookaheads[stateno + 1]; - found = 0; - while (!found && i < k) - { - if (LAruleno[i] == ruleno) - found = 1; - else - i++; - } - if (found == 0) - berror("add_lookback_edge"); - - sp = NEW(shorts); - sp->next = lookback[i]; - sp->value = gotono; - lookback[i] = sp; -} - - - -short ** -transpose (short **R_arg, int n) +static void +compute_FOLLOWS (void) { - register short **new_R; - register short **temp_R; - register short *nedges; - register short *sp; - register int i; - register int k; - - nedges = NEW2(n, short); - - for (i = 0; i < n; i++) - { - sp = R_arg[i]; - if (sp) - { - while (*sp >= 0) - nedges[*sp++]++; - } - } - - new_R = NEW2(n, short *); - temp_R = NEW2(n, short *); - - for (i = 0; i < n; i++) - { - k = nedges[i]; - if (k > 0) - { - sp = NEW2(k + 1, short); - new_R[i] = sp; - temp_R[i] = sp; - sp[k] = -1; - } - } - - FREE(nedges); + int i; - for (i = 0; i < n; i++) - { - sp = R_arg[i]; - if (sp) - { - while (*sp >= 0) - *temp_R[*sp++]++ = i; - } - } + relation_digraph (includes, ngotos, &F); - FREE(temp_R); + for (i = 0; i < ngotos; i++) + XFREE (includes[i]); - return new_R; + XFREE (includes); } -void -compute_FOLLOWS (void) +static void +compute_lookaheads (void) { - register int i; + size_t i; + goto_list_t *sp; - digraph(includes); + for (i = 0; i < nLA; i++) + for (sp = lookback[i]; sp; sp = sp->next) + bitset_or (LA[i], LA[i], F[sp->value]); - for (i = 0; i < ngotos; i++) - { - if (includes[i]) FREE(includes[i]); - } + /* Free LOOKBACK. */ + for (i = 0; i < nLA; i++) + LIST_FREE (goto_list_t, lookback[i]); - FREE(includes); + XFREE (lookback); + bitsetv_free (F); } -void -compute_lookaheads (void) -{ - register int i; - register int n; - register unsigned *fp1; - register unsigned *fp2; - register unsigned *fp3; - register shorts *sp; - register unsigned *rowp; -/* register short *rulep; JF unused */ -/* register int count; JF unused */ - register 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++; - } +/*---------------------------------------------------------------. +| Count the number of lookaheads required for STATE (NLOOKAHEADS | +| member). | +`---------------------------------------------------------------*/ - rowp = fp3; - } +static int +state_lookaheads_count (state_t *state) +{ + int k; + int nlookaheads = 0; + reductions_t *rp = state->reductions; + transitions_t *sp = state->transitions; + + /* We need a lookahead either to distinguish different + reductions (i.e., there are two or more), or to distinguish a + reduction from a shift. Otherwise, it is straightforward, + and the state is `consistent'. */ + if (rp->num > 1 + || (rp->num == 1 && sp->num && + !TRANSITION_IS_DISABLED (sp, 0) && TRANSITION_IS_SHIFT (sp, 0))) + nlookaheads += rp->num; + else + state->consistent = 1; - for (i = 0; i < n; i++) - {/* JF removed ref to freed storage */ - for (sp = lookback[i]; sp; sp = sptmp) { - sptmp=sp->next; - FREE(sp); + for (k = 0; k < sp->num; k++) + if (!TRANSITION_IS_DISABLED (sp, k) && TRANSITION_IS_ERROR (sp, k)) + { + state->consistent = 0; + break; } - } - FREE(lookback); - FREE(F); + return nlookaheads; } -void -digraph (short **relation) -{ - register int i; +/*----------------------------------------------. +| Compute LA, NLA, and the lookaheads members. | +`----------------------------------------------*/ - infinity = ngotos + 2; - INDEX = NEW2(ngotos + 1, short); - VERTICES = NEW2(ngotos + 1, short); - top = 0; +static void +initialize_LA (void) +{ + state_number_t i; + bitsetv pLA; - R = relation; + /* Compute the total number of reductions requiring a lookahead. */ + nLA = 0; + for (i = 0; i < nstates; i++) + nLA += state_lookaheads_count (states[i]); + /* Avoid having to special case 0. */ + if (!nLA) + nLA = 1; - for (i = 0; i < ngotos; i++) - INDEX[i] = 0; + pLA = LA = bitsetv_create (nLA, ntokens, BITSET_FIXED); + lookback = XCALLOC (goto_list_t *, nLA); - for (i = 0; i < ngotos; i++) + /* Initialize the members LOOKAHEADS for each state which reductions + require lookaheads. */ + for (i = 0; i < nstates; i++) { - if (INDEX[i] == 0 && R[i]) - traverse(i); + int count = state_lookaheads_count (states[i]); + if (count) + { + states[i]->reductions->lookaheads = pLA; + pLA += count; + } } - - FREE(INDEX); - FREE(VERTICES); } -void -traverse (register int i) -{ - register unsigned *fp1; - register unsigned *fp2; - register unsigned *fp3; - register int j; - register short *rp; - - int height; - unsigned *base; - - VERTICES[++top] = i; - INDEX[i] = height = top; - - base = F + i * tokensetsize; - fp3 = base + tokensetsize; +/*---------------------------------------. +| Output the lookaheads for each state. | +`---------------------------------------*/ - rp = R[i]; - if (rp) +static void +lookaheads_print (FILE *out) +{ + state_number_t i; + int j, k; + fprintf (out, "Lookaheads: BEGIN\n"); + for (i = 0; i < nstates; ++i) { - while ((j = *rp++) >= 0) - { - if (INDEX[j] == 0) - traverse(j); + reductions_t *reds = states[i]->reductions; + bitset_iterator iter; + int nlookaheads = 0; - if (INDEX[i] > INDEX[j]) - INDEX[i] = INDEX[j]; + if (reds->lookaheads) + for (k = 0; k < reds->num; ++k) + if (reds->lookaheads[k]) + ++nlookaheads; - fp1 = base; - fp2 = F + j * tokensetsize; + fprintf (out, "State %d: %d lookaheads\n", + i, nlookaheads); - while (fp1 < fp3) - *fp1++ |= *fp2++; - } + if (reds->lookaheads) + for (j = 0; j < reds->num; ++j) + BITSET_FOR_EACH (iter, reds->lookaheads[j], k, 0) + { + fprintf (out, " on %d (%s) -> rule %d\n", + k, symbols[k]->tag, + reds->rules[j]->number); + }; } + fprintf (out, "Lookaheads: END\n"); +} - if (INDEX[i] == height) - { - for (;;) - { - j = VERTICES[top--]; - INDEX[j] = infinity; - - if (i == j) - break; +void +lalr (void) +{ + initialize_LA (); + set_goto_map (); + initialize_F (); + build_relations (); + compute_FOLLOWS (); + compute_lookaheads (); + + if (trace_flag & trace_sets) + lookaheads_print (stderr); +} - fp1 = base; - fp2 = F + j * tokensetsize; - while (fp1 < fp3) - *fp2++ = *fp1++; - } - } +void +lalr_free (void) +{ + state_number_t s; + for (s = 0; s < nstates; ++s) + states[s]->reductions->lookaheads = NULL; + bitsetv_free (LA); }