Am 04.04.2012 23:04, schrieb Sergiu Ivanov:
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.
I hear there are ways around this, but they involve modifying the grammar.
Which means the grammar is going to be farther away from the intuitive
structure. A parsing expert can work around this, people with other
primary skills (such as LaTeX and math experts around here in SymPy)
will find this to be very hard to maintain.
From that perspective, I'm +10 for an Earley-style parser :-)
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sympy?hl=en.
