Dear Christopher, On Wed, Jul 21, 2010 at 18:00, Christopher Diggins <cdigg...@gmail.com>wrote:
> 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. > No, I didn't try that so far but indeed grammar optimization is something I had in mind for quite a while. What do you mean by using assertions? Also, in PEGs one has to be careful with reordering choices, as they are not symmetrical. Finally, it's not clear to me what should be the most efficient order for choices, especially if inferred automatically -- do you know any heuristics on that? Best, 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
