Am 04.04.2012 17:59, schrieb Dmitry Kozlov:
Unfortunately, I have never been in
touch with Earley algorithm.
Then that task is probably not for you.
> So I thought, final approach is to
implement flexible parse classes that can potentially describe
grammars of text formats which uses Mathematica6/7/8, Maxima, and
LaTeX style input, etc.
Any parsing framework can have such a system of parse classes.
> Common pattern for this tasks that I know is
Haskell-like monadic parse combinators, but they can give low
perfomance in python.
AFAIK they are limited to LL(k) grammars.
If that is correkt, they are not suitable.
In general, any parsing technology that cannot handle arbitrary grammars
would be a problem. We want to parse languages that are defined by
external entities, so we cannot modify the grammar so it's easier to
parse with LR, LL, or whatever technology we have a grasp for.
In other words, we need something that can handle arbitrary grammars.
Which means Earley or one of his successors (Tomita is the other Big
Name in the field).
--
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.
