If the combinators work like my C++ ones, where backtracking has to be specifically allowed (with a 'try' or 'attempt' combinator), if you don't use this combinator you are guaranteed linear time. This is because choice combinators will fail (with an exception) if any of the left hand side parsers fail and have consumed any input.
Keean. On 15 May 2015 13:50, "Jonathan S. Shapiro" <[email protected]> wrote: > Addendum: One reason to want an unambiguous parser is the guarantee of > linear-time parsing. > > _______________________________________________ > bitc-dev mailing list > [email protected] > http://www.coyotos.org/mailman/listinfo/bitc-dev > >
_______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
