On 05.09.2014 00:34, Orlando Hill wrote:
I think, the main complication would be needing to collect the ! and & expressions as you generate the string, and then match the expressions against the final candidate string at the appropriate positions. If one of the ! or & expressions fails, then the generated string is not actually part of your language.
I remember people saying that ! and & are mostly used pretty close to the terminal expressions. How much would we lose in practice if we did away with infinite lookahead and replaced it with a one bound by how much of the string is consumed by the immediately following expression?
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
