On Tuesday, 3 May 2011 15:02:02 UTC-4, odyssomay wrote: > > I wrote a simple implementation: > http://gist.github.com/953966<https://gist.github.com/953966> > (only supports operators) > It's not very elegant (I don't know how to use fnparse..), but it is > functional. > What it does is find out what the next element in the operator stack and > the out stack should be, and then recursively update the stacks and output > the finished out stack. > > As I said I don't know how to use fnparse and therefore I couldn't really > understand your code. > Either way I hope that this code helps in some way.. ;) >
This is great, hadn't thought about using a protocol for this! I'll improve both versions to be able to compare them on equal ground and to see how they cope with adding more features. Although in the end, I think the recursive one will be faster while the monadic one will be more composable, Thanks -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
