Re: Switch statement code generation

nathan.mccauley@gmail.com schrieb:


>>> I'm trying to put together a list of various methods to do code generate
>>> for switch statements. ...
>
> Has anyone seen tries used for the string-based switch statements?


What dou you expect?


Visual Basic had such a feature, implemented as a series of string
compares and jumps.


The typical solution is a lookup in a (sorted, hashed...) string list,
followed by an "ordinary" switch with the index of the found string. The
target address could be attached to every string in that list, so that a
second switch is not required.


A string tree might give the best lookup performance.


DoDi


[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]

Return to the comp.compilers page.
Search the comp.compilers archives again.