> > Maybe that there is a way to also incorporate this in sympy somehow, > and if it is, I am all for it. > For a lot of reasons, I've needed to build my own formula parser. I've a tree structure with objects, each having a tag to know if it is simplified or not.
For example, x^2+15/25 will be see first as : + NOT SIMPLIFIED >>> ^ NOT SIMPLIFIED >>>>>> x SIMPLIFIED >>>>>> 2 SIMPLIFIED >>> / NOT SIMPLIFIED >>>>>> 15 SIMPLIFIED >>>>>> 25 SIMPLIFIED Then a procedure will do calculations as follows + NOT SIMPLIFIED *>>> ^ SIMPLIFIED* >>>>>> x SIMPLIFIED >>>>>> 2 SIMPLIFIED *>>> / SIMPLIFIED >>>>>> 3 SIMPLIFIED >>>>>> 5 SIMPLIFIED* *+ SIMPLIFIED* >>> ^ SIMPLIFIED >>>>>> x SIMPLIFIED >>>>>> 2 SIMPLIFIED >>> / SIMPLIFIED >>>>>> 3 SIMPLIFIED >>>>>> 5 SIMPLIFIED I've not yet done this because I'm working firstly to have a tool so as to print mathematical documents in WEB, ONLY TEXT and PDF easily. Best regards. Christophe. -- 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.
