You may have already tried this, but just in case, have you optimized your grammar to minimize backtracking? This can be done by reordering choice rules and using assertions. I have never had any performance problems with PEG grammars and recursive descent parsers, even parsing thousands of C++ files. Christopher On Wed, Jul 21, 2010 at 5:56 AM, Adam Koprowski <adam.koprow...@mlstate.com>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
