On Sunday, March 11, 2012 12:00:52 AM UTC+5:30, scolobb wrote: > > Hello, > > On Sat, Mar 10, 2012 at 8:11 PM, Bharath M R <catchmrbhar...@gmail.com> > wrote: > > > >> What is really needed is a parser, that goes through an expression, > >> and builds a syntax tree out of it. What you need to do is build > >> something that is modular enough that you can easily plug in new rules > >> to it (like "integrate expr dx" => integrate(expr, x), or "x y" -> > >> x*y). > > > > This looks interesting. I recently did a course on finite automata and I > > think > > I can use the things I learnt. I need to read up on parsing though. > >> My area of research is very tightly connected with formal languages; >> I've had a course in parsing techniques last semester. If you have >> any questions, I'll be glad to try to help :-) > > Sergiu > @Sergiu I was looking at top down operator precedence parsing for the task (http://javascript.crockford.com/tdop/tdop.html) . One of the important task is to come up with the grammar. Is it possible to meet you on IRC sometime to discuss about this? My time zone is GMT + 5:30.
-- You received this message because you are subscribed to the Google Groups "sympy" group. To view this discussion on the web visit https://groups.google.com/d/msg/sympy/-/SuLBAcpnnR4J. To post to this group, send email to sympy@googlegroups.com. To unsubscribe from this group, send email to sympy+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
