2 * Copyright (c) 1989 The Regents of the University of California.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 static char sccsid[] = "@(#)closure.c 5.3 (Berkeley) 5/24/93";
43 #include <sys/cdefs.h>
44 __FBSDID("$FreeBSD$");
53 static void set_EFF(void);
55 static void print_closure(int);
56 static void print_EFF();
57 static void print_first_derives();
60 static unsigned *first_derives;
74 rowsize = WORDSIZE(nvars);
75 EFF = NEW2(nvars * rowsize, unsigned);
78 for (i = start_symbol; i < nsyms; i++)
81 for (rule = *sp; rule > 0; rule = *++sp)
83 symbol = ritem[rrhs[rule]];
86 symbol -= start_symbol;
93 reflexive_transitive_closure(EFF, nvars);
116 rulesetsize = WORDSIZE(nrules);
117 varsetsize = WORDSIZE(nvars);
118 first_derives = NEW2(nvars * rulesetsize, unsigned) - ntokens * rulesetsize;
122 rrow = first_derives + ntokens * rulesetsize;
123 for (i = start_symbol; i < nsyms; i++)
125 vrow = EFF + ((i - ntokens) * varsetsize);
127 for (j = start_symbol; j < nsyms; k++, j++)
129 if (k >= BITS_PER_WORD)
135 if (cword & (1 << k))
138 while ((rule = *rp++) >= 0)
149 print_first_derives();
174 rulesetsize = WORDSIZE(nrules);
175 rsend = ruleset + rulesetsize;
176 for (rsp = ruleset; rsp < rsend; rsp++)
180 for (csp = nucleus; csp < csend; ++csp)
182 symbol = ritem[*csp];
185 dsp = first_derives + symbol * rulesetsize;
193 itemsetend = itemset;
195 for (rsp = ruleset; rsp < rsend; ++rsp)
200 for (i = 0; i < BITS_PER_WORD; ++i)
204 itemno = rrhs[ruleno+i];
205 while (csp < csend && *csp < itemno)
206 *itemsetend++ = *csp++;
207 *itemsetend++ = itemno;
208 while (csp < csend && *csp == itemno)
213 ruleno += BITS_PER_WORD;
217 *itemsetend++ = *csp++;
231 FREE(first_derives + ntokens * WORDSIZE(nrules));
243 printf("\n\nn = %d\n\n", n);
244 for (isp = itemset; isp < itemsetend; isp++)
245 printf(" %d\n", *isp);
257 printf("\n\nEpsilon Free Firsts\n");
259 for (i = start_symbol; i < nsyms; i++)
261 printf("\n%s", symbol_name[i]);
262 rowp = EFF + ((i - start_symbol) * WORDSIZE(nvars));
266 for (j = 0; j < nvars; k++, j++)
268 if (k >= BITS_PER_WORD)
275 printf(" %s", symbol_name[start_symbol + j]);
282 print_first_derives()
290 printf("\n\n\nFirst Derives\n");
292 for (i = start_symbol; i < nsyms; i++)
294 printf("\n%s derives\n", symbol_name[i]);
295 rp = first_derives + i * WORDSIZE(nrules);
297 for (j = 0; j <= nrules; k++, j++)
299 if (k >= BITS_PER_WORD)
305 if (cword & (1 << k))