On Wed, Apr 4, 2012 at 10:08 PM, Joachim Durchholz <j...@durchholz.org> wrote: > Am 04.04.2012 17:59, schrieb Dmitry Kozlov: >> >> Haskell-like monadic parse combinators, but they can give low >> perfomance in python.nnn > > AFAIK they are limited to LL(k) grammars. > If that is correkt, they are not suitable.
In [0] they say that It can parse context-sensitive, infinite look-ahead grammars but it performs best on predictive (LL[1]) grammars. Sounds like LL(*), which is going to perform badly on left recursion. Sergiu [0] http://www.haskell.org/haskellwiki/Parsec -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to sympy@googlegroups.com. To unsubscribe from this group, send email to sympy+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
