> > With respect to time complexity, the question is that the parse time is > 2.4 or cubic with respect to exactly what?
The tradition is to measure time with respect to n, which n is the length of the input in characters of some alphabet, and the time only includes parsing time, not evaluation time. This is how Earley's algorithm can be cubic, when the number of parses can be super-exponential, and so simply listing every parse would be far worse than cubic. The idea here is that you don't know how complex or simple an evaluation the applications wants, so it would confuse things to include evaluation time. It's possible, for example, that parsing is simply recognition -- all you want is a "yes" or "no" as to whether the input matches the grammar. Again, best of luck, jeffrey -- You received this message because you are subscribed to the Google Groups "marpa parser" group. To unsubscribe from this group and stop receiving emails from it, send an email to marpa-parser+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
