I would like to discuss my plan of action to develop the general parsing framework for Sympy. Right now the code is quite messy. The modules for different language extensions such as Mathematica or MathML are implemented quite separately and there exists little common between them. Also, the parsing is done via a simple implementation of heuristics that cover the most common expressions. So as a solution to all this, I propose this. Create a language recognizer module that takes the input string and then based on its probability to belong to different language groups, we decide in the end to which language does it belong to. After a successful identification, we can then assign the string to the appropriate module. Since every language too will have subdivisions in them (E.g. in Sympy we have assumptions, calculus etc), we then decide which parts of the string belong to which part of the language spec. After that we can parse the string according to rules specified in the module and make it Sympy compliant. Also as a part of this project, I would like to implement the parser for Latex and rudimentary natural language.
Please provide feedback regarding this idea. Thanks, Aditya Shah -- 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. For more options, visit https://groups.google.com/groups/opt_out.
