Dear All, My name is Fadel Al-Hassan, I'm using PEG grammar for some linguistic pattern matching tasks.
But, during my work I have noticed that the grammar, mentioned in Dr.Ford paper, for recognizing (a^n b^n c^n) D => &(A !b) a* B !. A => aAb / "" B => bBc / "" will also recognize (a^m b^n c^n where m >= n). Since the first match of A rule can be an empty string. So as to avoid this I added another predicate for D rule so it becomes: D => &(A !a !b) a* B !. Is this right? or I misunderstood something here? Yours Sincerely
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
