On Tue, Feb 02, 2010 at 10:28:49AM -0600, Greg London wrote:
When you run the script, the output looks something like this:
benchmarking for 30 seconds...
Rate
parse_recdescent_many 19/s
parse_gnaw_many 64/s
parse_recdescent_few 270/s
parse_gnaw_few
[3x] is really surprising to me.
The generated parsers don't always run as fast as might be wished.
I think Greg is surprised it's ONLY 3x faster, given PRD's notorious
time for expressivity trade.
Either Greg needs a bigger test case ... One where PRD is taking
multiple seconds to answer
Oh, I know PRD can be slow. I think my full Verilog grammar was measured
in lines of verilog per minute or something.
I'm just surprised, shocked really, that Parse::Gnaw didn't turn out to be
even slower than Parse::RecDescent. In Parse::Gnaw, I pull the text apart
into a linked list with one
