> it may have been a language barrier - but i wasn't looking for a way to > convert Parslet to Treetop:) > what i was intending to ask is that i was wondering about what are the > benefit of generating code (treetop) vs keeping it in memory (parslet)
To be honest, I was hoping someone else would try to answer this. The question seems innocuous enough, but it is really hard to answer. The question really touches on the philosophical issues of compiler design. In terms of functionality, the two approaches are aequivalent (or can be made). In terms of speed, parslet may just be doing more work, and that means being slower. But apparently there are benchmarks which claim the opposite. The easy answer would be: It just is that way. If I had to cite one point where the two libraries differ: Perhaps it is easier to hack parslet to do new things, something that a lot of people do and that I encourage in the experiments and examples folders of the project. But as I am writing this, I am thinking of ways to disprove it, so let's stick with: there is no difference at all, its just Ruby code... regards, kaspar
