Verify code runs in polynomial time, benchmark

[cacfd3a]

performs linear and polynomial and exponential regression on some test cases n=0-100 and see which has the highest coefficient of determination; select this one and assert the it matches what we expect (linear for left-recursive unambiguous grammars, n^2, n^3 otherwise)