> Is there a PEG parser around here which does not keep all the symbols
> each in
> its own node? Or, maybe, any one which is faster than a dying snail? Just
> wondering.

As one of the authors of one of these libraries which are slow as a 
dying snail, I am wondering: How do you measure? Would you like to 
contribute your benchmark, so that our (quite extensive) optimization 
efforts can go your way? And finally, what is the ground speed of a 
dying snail?

My measurements (to contribute to the thread as well) are here: 
http://blog.absurd.li/2011/02/02/parslet_and_its_friends.html

k