@Jo Thanks again for the clarifications. I did some research and I observed that conversion from Math Spec Languages to Sympy equivalent can be done via the use of RE themselves. So this will allow for a very efficient grammar(RE are manifestations of FSAs and the their conversions to CFGs is a quite simple algorithm). So in the end what matters is the underlying architecture by which the developer enter the details for the new parser to be made, which is then processed by the tool that I propose to build(the interface between a spec file and its conversion to python code so as to be processed by modgrammar) and then the resultant output is fed to modgrammar which then generates the final parser.
Regards, 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 sympy+unsubscr...@googlegroups.com. To post to this group, send email to sympy@googlegroups.com. 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/13e6283e-d5cd-4de7-a62c-6b007d519b89%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
