The loop in the example code I gave is a do-while loop, so the first iteration through doesn't invoke the length test. Thus I believe a null match will work, it is just that any future left recursive matches for the same rule at the same point must match with additional length.
I'm missing something: the first iteration forces a base case, in my example no characters with null as the semantic value. With Bryan's condition, that's it; no more recursion. But my point is that I need to try the recursive case now.
Robert _______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
