Hi, everyone! I'm interested in including a Sage module that allows one to handle systems of equations on words. For instance, if one wants to find all solutions of the equation u = ~(u) (where ~ means the reversal of the word, i.e. rewriting it in the opposite order), one should get the palindromes.
One part of the code would need to parse strings of the form u = ~(u) or, for instance, u * v = phi(u * v) The natural way to handle it would be to use a formal grammar and a parser like pyparsing [1] to extract a list or a dictionary representing the expression. Is there any standard way to do so in Sage ? Is there already such a package ? I haven't found anything in the standard documentation of Python that could perform the task. Any help welcome! Thank you Alex [1] http://pyparsing.wikispaces.com/ -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
