* Copyright (c) 1989 The Regents of the University of California.
* This code is derived from software contributed to Berkeley by
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
static char sccsid
[] = "@(#)closure.c 5.2 (Berkeley) 6/1/90";
static unsigned *first_derives
;
rowsize
= WORDSIZE(nvars
);
EFF
= NEW2(nvars
* rowsize
, unsigned);
for (i
= start_symbol
; i
< nsyms
; i
++)
for (rule
= *sp
; rule
> 0; rule
= *++sp
)
symbol
= ritem
[rrhs
[rule
]];
reflexive_transitive_closure(EFF
, nvars
);
rulesetsize
= WORDSIZE(nrules
);
varsetsize
= WORDSIZE(nvars
);
first_derives
= NEW2(nvars
* rulesetsize
, unsigned) - ntokens
* rulesetsize
;
rrow
= first_derives
+ ntokens
* rulesetsize
;
for (i
= start_symbol
; i
< nsyms
; i
++)
vrow
= EFF
+ ((i
- ntokens
) * varsetsize
);
for (j
= start_symbol
; j
< nsyms
; j
++)
while ((rule
= *rp
++) >= 0)
register int rulesetsize
;
rulesetsize
= WORDSIZE(nrules
);
rsend
= ruleset
+ rulesetsize
;
for (rsp
= ruleset
; rsp
< rsend
; rsp
++)
for (csp
= nucleus
; csp
< csend
; ++csp
)
dsp
= first_derives
+ symbol
* rulesetsize
;
for (rsp
= ruleset
; rsp
< rsend
; ++rsp
)
while (csp
< csend
&& *csp
< itemno
)
while (csp
< csend
&& *csp
== itemno
)
FREE(first_derives
+ ntokens
* WORDSIZE(nrules
));
printf("\n\nn = %d\n\n", n
);
for (isp
= itemset
; isp
< itemsetend
; isp
++)
printf("\n\nEpsilon Free Firsts\n");
for (i
= start_symbol
; i
< nsyms
; i
++)
printf("\n%s", symbol_name
[i
]);
rowp
= EFF
+ ((i
- start_symbol
) * WORDSIZE(nvars
));
for (j
= 0; j
< nvars
; j
++)
printf(" %s", symbol_name
[start_symbol
+ j
]);
printf("\n\n\nFirst Derives\n");
for (i
= start_symbol
; i
< nsyms
; i
++)
printf("\n%s derives\n", symbol_name
[i
]);
rp
= first_derives
+ i
* WORDSIZE(nrules
);
for (j
= 0; j
<= nrules
; j
++)