Assume that you already have have say java code in memory both as string and as suffix tree.
If rule would look at most 5 characters then we could memoize all its occurences in single step. I am wondering if suffix tree actualy gave us some speedup. -- The MGs ran out of gas. _______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
