[antlr-interest] Fast Token-Recognition (Possible in ANTLR?)

[Jim Idle]

> -----Original Message-----
> From: Timmy Turner [mailto:timm.turn at gmail.com]
> Sent: Sunday, February 24, 2008 2:09 AM
> Thanks for your replies!
> 
> >  IMHO it's much simpler to
> >  use a standalone component implementing fast search for multiple
> strings
> >  (there's a lot of them available, in various languages) than ANTLR.
> 
> Hm... I couldn't find any trie implementations for Java that would fit
> my needs, maybe you could provide me with some links?

If you switch to the C runtime, you get a an implementation for free 
;-)> However, I have only coded a trie with a 64 bit key as yet as that 
is all I needed for memorization. Later, I will add a trie that allows a 
string key, once I need one for my own projects.

Tries are easy to code in C, but probably less efficient to do so in 
Java. However, aren't some of the standard collections (not the Hash 
ones) done this way anyway? You could probably look at the Java source 
and find out if I isn't documented somewhere.

Jim