On 1 Dec 2008, at 13:30, 山东 wrote:
...
I think it just uses the standard method as described in books like
Aho, Sethi & Ullman, "Compilers..." (the "Dragon book"), an iteration
until it stops. There is a more efficient method using Tarjan's SCC
algorithm - search the archives for the Use
Le 1 déc. 08 à 13:02, Wouter Sieburgh a écrit :
Hi
I've got a problem building bison 2.*:
Making all in src
make[2]: Entering directory `/develop/devroot64/bison-2.4/src-
bison-2.4/src'
/bin/sh ../build-aux/ylwrap parse-gram.y y.tab.c parse-gram.c y.tab.h
parse-gram.h y.output parse-gram.out
c2ompute_FOLLOWS()
{
register int i;
digraph(includes);
for (i = 0; i < ngotos; i++)
{
if (includes[i]) FREE(includes[i]);
}
FREE(includes);
}
digraph(relation)
short **relation;
{
register int i;
infinity = ngotos + 2;
INDEX = NEW2(ngotos + 1, short);
VERTICES =
On Mon, 1 Dec 2008, sgaurelius wrote:
>
> I found out how to do this. I have one other problem though. When I debug, it
> doesn;t go where it should go. I mean, if I have a rule L_BRKT expr R_BRKT,
> in the parser.cc there is a switch statement and this rule is one case of
> it. When I set a br
I found out how to do this. I have one other problem though. When I debug, it
doesn;t go where it should go. I mean, if I have a rule L_BRKT expr R_BRKT,
in the parser.cc there is a switch statement and this rule is one case of
it. When I set a breakpoint to this case, it never goes there, even if
