On 2014-05-23 3:49 PM, Reini Urban wrote:
On 05/20/2014 04:36 AM, Aaron Moss wrote:http://arxiv.org/abs/1405.4841"worst case quartic time" typo in the abstract
Not a typo; the worst case time bound is O(n^4).Though under the condition that the amount of backtracking and grammar nesting is bounded by a constant the algorithm should run in linear time.
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
