@Jo Thank you, that was quite enlightening. Now as to the parsers, they are not exactly parsers. We do have rudimentary parsers for Mathematica and Maxima in sympy right now. If you take a look at their code, you can see that they are not CFGs but simple RE rules. They perform very good under almost all the circumstances (although I encountered a bug in the Mathematica module and fixed it). The point is that this functionality allows us to embed small snippets already written in other languages. So the aim here right now is to generate a parser(or a converter as you may call it) that converts that snippet to equivalent python/sympy code. After that is successfully done, we can move onto a generic parser framework that can convert entire programs to sympy equivalent code. And I was going for a parser generator framework for sympy that generates a parser, not just a parser itself.
Thanks, Aditya -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/0b730418-4978-4203-8e64-176c34ed4151%40googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
