One parsing technique that you can try is Top Down Operator Precedence (http://portal.acm.org/citation.cfm?id=512931). It is hardly traditional, but recently I have found it to be fairly practical. I currently implement a tdop parser in such a way that I have things grouped into environments (a bit like little grammars for a single production), and within these environments, for any particular operator being matched, I allow for ordered choice of the ways to match it, and very limited backtracking within the current active environment.
Best Regards, Peter Goodman, http://ioreader.com 70 Winston Circle, Montreal, Quebec H9S 4X6 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
