I agree totally. I just implemented a language tokenizer that uses the maximal munch algorithm described in this paper.
http://www.csc.lsu.edu/~gb/csc4351/Papers/Reps.pdf The algorithm given uses all kinds of variables and state. I was able to implement it without all that. I've also been able to implement some other 'classic' comp sci algorithms that use variables and state. The functional implementation seems to appear more complicated, but as you dig into it, the structure of the problem becomes easier to see and factor out. The overhead of things like looping gets factored out and the individual pieces are easier to unit test. The 'downside' is that it takes more thought. You really have to understand the problem you're working on. Jim On Dec 1, 10:08 am, Stuart Halloway <[EMAIL PROTECTED]> wrote: > Lazyness is just so cool: > > http://blog.thinkrelevance.com/2008/12/1/living-lazy-without-variables > > Feedback welcomed, > Stu --~--~---------~--~----~------------~-------~--~----~ 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 To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
