[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Faster token table lookups
From: |
Akim Demaille |
Subject: |
Re: Faster token table lookups |
Date: |
19 Dec 2000 14:42:25 +0100 |
User-agent: |
Gnus/5.0807 (Gnus v5.8.7) XEmacs/21.1 (Channel Islands) |
>>>>> "Hans" == Hans Aberg <address@hidden> writes:
Hans> Token table lookups in the parser that Bison generates (cf. the
Hans> manual, the %token_table option & sec 4.2.1) can be speeded up
Hans> if Bison writes a token table with the names sorted
Hans> alphabetically: A search in yytname takes now average linear
Hans> time; by contrast, a sorted table can be searched in at most
Hans> log_2 time.
Hi Hans,
I don't understand your point. AFAIK we never lookup for anything in
this table. It's used the other way round: we have the token numbers,
we want to know their `human' names, and that a simple matter of
reading a cell of an array.
So I don't know what you are talking about.
- Faster token table lookups, Hans Aberg, 2000/12/15
- Re: Faster token table lookups,
Akim Demaille <=
- Re: Faster token table lookups, Hans Aberg, 2000/12/19
- Re: Faster token table lookups, Akim Demaille, 2000/12/20
- Re: Faster token table lookups, Hans Aberg, 2000/12/20
- Re: Faster token table lookups, Hans Aberg, 2000/12/22
- Re: Faster token table lookups, Akim Demaille, 2000/12/22
- Re: Faster token table lookups, Hans Aberg, 2000/12/22
- Re: Faster token table lookups, Hans Aberg, 2000/12/22