Hi Adam, that's what LL(*) does in ANTLR. It uses cyclic dfa to
predict alts and fails over to backtracking if it can't figure out a
cyclic DFA. I'm working on the LL(*) paper as we speak to submit this
Fall.
ANTLR is not scannerless so that makes the analysis more useful.
Ter
On Jul 21, 2010, at 2:56 AM, 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
