[antlr-interest] Hand made lexer 600(!!!!!) times faster of ANTLR'sone

[Ruslan Zasukhin]

On 2/24/05 1:45 PM, "Micheal J" <open.zone at virgin.net> wrote:

Hi Michael,

>> I remember excellent letter from another Russian developer
>> where he have describe steps to improve. He also have point
>> that he have plug on allocation class.
> 
> OK, that narrows it down:
> 1. Alex Sedow or 
>  
> http://www.antlr.org/pipermail/antlr-interest/2004-November/010102.html
> 2. Anton Safonov
>  
> http://www.antlr.org/pipermail/antlr-interest/2004-January/006083.html
> 
> I'm pretty sure you're referring to Alex's post...  ;-)

Yes, I mean Alex.

I have contact him asking send some sources...
It seems he have send me something, but it is better write own than try
integrate his. 

I think you can try contact him again.

>> Really, It is easy to see that during parsing we build tree,
>> then we kill the whole tree. So having own allocator in ANTLR
>> it is possible kill the whole tree not as million of delete
>> calls, but as single call to destroy the whole heap.
> 
> Agreed. 
> 
> On a related note, I'm interested in ideas about if and how something
> similar can be achieved in managed langauges (i.e. Java/C#) or do we have to
> trust the GC?

Actually I use only and only C++.

It seems I have not hear about such tricks for Java/C#.


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