[antlr-interest] Lexer speed comparison
Ruslan Zasukhin
sunshine at public.kherson.ua
Thu Feb 26 11:38:05 PST 2004
on 2/26/04 1:13 AM, Terence Parr at parrt at cs.usfca.edu wrote:
> Hi Uli,
>
> Thanks for running some tests. Unfortunately, it reveals what I've
> suspected. There are two problems areas with ANTLR's lexers:
>
> (1) generally huge overhead since I'm mimicking LL parsing
> (2) my nextToken generates a poor approximation to a DFA for predicting
> which rule will succeed
>
> I have an interesting solution to this problem for ANTLR 3 that works
> in my prototype (that is, the algorithm computes the right stuff). It
> merges DFAs to get speed and simplicity of specification and then uses
> full parsing when you need it :)
>
> One of the big areas that will get attention in 3.0 is speed. :)
Thanks to God!
Count our our support in benchmarking and profiling.
> BTW, i'm building a lexer for Python at the moment and boy will it be
> SLOWWW! ;)
--
Best regards,
Ruslan Zasukhin [ I feel the need...the need for speed ]
-------------------------------------------------------------
e-mail: ruslan at paradigmasoft.com
web: http://www.paradigmasoft.com
To subscribe to the Valentina mail list go to:
http://lists.macserve.net/mailman/listinfo/valentina
-------------------------------------------------------------
Yahoo! Groups Links
<*> To visit your group on the web, go to:
http://groups.yahoo.com/group/antlr-interest/
<*> To unsubscribe from this group, send an email to:
antlr-interest-unsubscribe at yahoogroups.com
<*> Your use of Yahoo! Groups is subject to:
http://docs.yahoo.com/info/terms/
More information about the antlr-interest
mailing list