On 10 December 2013 19:13, Amos Jeffries <squid3_at_treenet.co.nz> wrote:
> The problem with comparing input strings to a SBuf of characters is that
> parsing a input of length N againt charset of size M takes O(N*M) time.
Huh? There are linear time parsers with PEGs. Or maybe I don't
understand one of your preconditions to come up with an N*M complexity
here.
-Rob
-- Robert Collins <rbtcollins_at_hp.com> Distinguished Technologist HP Converged CloudReceived on Tue Dec 10 2013 - 10:26:15 MST
This archive was generated by hypermail 2.2.0 : Tue Dec 10 2013 - 12:00:10 MST