Related articles |
---|
[7 earlier articles] |
Re: Switch statement code generation Pidgeot18@verizon.invalid (Joshua Cranmer) (2009-11-04) |
Re: Switch statement code generation walter@bytecraft.com (Walter Banks) (2009-11-05) |
Re: Switch statement code generation bartc@freeuk.com (bartc) (2009-11-05) |
Re: Switch statement code generation nathan.mccauley@gmail.com (nathan.mccauley@gmail.com) (2009-11-07) |
Re: Switch statement code generation DrDiettrich1@aol.com (Hans-Peter Diettrich) (2009-11-08) |
Re: Switch statement code generation bear@sonic.net (Ray) (2009-11-09) |
Re: Switch statement code generation DrDiettrich1@aol.com (Hans-Peter Diettrich) (2009-11-11) |
Re: Switch statement code generation derek@knosof.co.uk (Derek M. Jones) (2009-11-11) |
Re: Switch statement code generation anton@mips.complang.tuwien.ac.at (2009-11-11) |
Re: Switch statement code generation idbaxter@semdesigns.com (Ira Baxter) (2009-11-14) |
Re: Switch statement code generation cfc@shell01.TheWorld.com (Chris F Clark) (2009-11-15) |
Re: Switch statement code generation pertti.kellomaki@tut.fi (Pertti Kellomaki) (2009-11-16) |
Re: Switch statement code generation haberg_20080406@math.su.se (Hans Aberg) (2009-11-17) |
From: | Hans-Peter Diettrich <DrDiettrich1@aol.com> |
Newsgroups: | comp.compilers |
Date: | Wed, 11 Nov 2009 08:52:58 +0100 |
Organization: | Compilers Central |
References: | 09-11-002 09-11-014 09-11-023 09-11-027 |
Keywords: | code |
Posted-Date: | 13 Nov 2009 00:48:29 EST |
Hans-Peter Diettrich schrieb:
> A string tree might give the best lookup performance.
> [If there's a lot of strings, a patricia trie might be faster than
> hashing or binary search since it doesn't require repeated scans of
> the string during the match process. -John]
Thanks for the "patricia trie" term :-)
Wikipedia redirects it to "Radix tree".
This is what I meant with "string tree".
DoDi
Return to the
comp.compilers page.
Search the
comp.compilers archives again.