Hi,
I have here some statistics for parsing with and without memoization of
files up to 400kB in Java and C:
http://www.romanredz.se/papers/Parsing.pdf
http://www.romanredz.se/papers/FI2008.pdf
Unfortunately, the statistics are in terms of procedure calls, rather
than milliseconds.
A recent paper by Mizushima, Maeda and Yamaguchi describe a method that
amounts to use of predictive parsing whenever it is possible in PEG:
http://ialab.cs.tsukuba.ac.jp/~mizusima/publications/paste513-mizushima.pdf
Regards
Roman Redziejowski [http://www.romanredz.se]
Adam Koprowski wrote:
Dear all,
I'm using PEG parsing (with & without memoization) intensively but
started to run into performance problems. I was wondering about the
possibility of combining PEG parsing with more traditional (and more
efficient) techniques of (LA)LR parsers (for relevant, simple parts of
the grammar). Anyone has any experience with that? Any thoughts?
References?
Thank you in advance,
Adam
--
/Adam Koprowski/ *[*http://adam-koprowski.net]
/R&D /@/ MLstate/ *[*http://mlstate.com]
------------------------------------------------------------------------
_______________________________________________
PEG mailing list
PEG@lists.csail.mit.edu
https://lists.csail.mit.edu/mailman/listinfo/peg
_______________________________________________
PEG mailing list
PEG@lists.csail.mit.edu
https://lists.csail.mit.edu/mailman/listinfo/peg
