[Top][All Lists]

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

Re: Bison development

From: Akim Demaille
Subject: Re: Bison development
Date: 17 Jan 2002 12:03:17 +0100
User-agent: Gnus/5.0808 (Gnus v5.8.8) XEmacs/21.4 (Common Lisp)

>>>>> "Magnus" == Magnus Fromreide <address@hidden> writes:

Magnus> On 17 Jan 2002, Akim Demaille wrote:
>> OK, if you want a project, then there is one thing we need: that
>> someone find a good implementation of bit vector to implement sets.
>> We need a good implementation, efficient and with a nice interface.
>> There is a crucial need in Bison, but for the time being, unions,
>> intersections etc. are computed but loops all over the place.  We
>> need macros/routines that raise the abstraction level up to sets.

Magnus> GCC contains two or three versions of bitvectors with
Magnus> different properties (optimized for sparse sets etc.) Maybe
Magnus> one of them could be used? The problem might be the demand for
Magnus> a 'nice interface'.

Yep, I have already read the recent threads about [els]bitset.  I just
don't have time to read the details, but I think fetching GCC's
implementation would be the best approach.  Do you know the
differences between the different implementations?

reply via email to

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