[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Multiple, different, %merge of a token sequence

From: Joel E. Denny
Subject: Re: Multiple, different, %merge of a token sequence
Date: Sat, 6 May 2006 14:51:41 -0400 (EDT)

On Wed, 3 May 2006, Derek M Jones wrote:

> Ok.  It would be useful to add a warning to the documentation that
> this kind of thing sometimes happens (at least for the moment).

Yes, I agree, but it's been an issue of finding time.

> > Unfortunately, it seems like the most obvious solution will worsen the
> > parser's time complexity.  I'm exploring a more sophisticated solution, but
> > I'm afraid it'll be a while before I return to it.
> I can parse + other not very complicated stuff all the .c files in
> the gcc/postgresql/openafs/openmotif/netscape (original C version)
> source trees in under 30 cpu seconds.  Having this increased to 60
> seconds would not be a problem.

I don't know yet what the penalty would be.

> Would I be correct to say this subtree sharing would not occur if
> the grammar was left recursive?

Sorry, I don't follow.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]