Why not, but just understand that by doing you, you would give a good answer to the wrong question :-)
So maybe better keep your energy when the right question shows up :-) :-) I say so, because I guess a good answer would not necessarily demonstrate (as its key 'selling point') mutually recursive functions as being the way to implement that. (but rather an answer involving growing sequences or vectors for each function, thus allowing to blow up the heap instead of the stack). Regards, -- Laurent 2009/6/10 arasoft <t...@arasoft.de>: > > I know, but wouldn't it be nice to show that using Clojure you can > write a solution that "really" works? > > On Jun 10, 5:38 pm, Laurent PETIT <laurent.pe...@gmail.com> wrote: >> I don't see the solutions provided for other languages solving the >> tail call problem. And I also don't see the problem explictly stating >> that a tail call optimized version is required. >> >> It seems rather to me that the page just want to exhibit that the >> language allows mutual recursion of calls, period ? >> >> So your first initial version seems sufficient. Look for example at >> the java provided version, it suffers from the same StackTrace >> problem. >> >> 2009/6/10 arasoft <t...@arasoft.de>: >> >> >> >> > Thank you for the answers. I now understand why this cannot work with >> > trampoline. >> > Is there another way to avoid stack overflow? I'd like to submit the >> > code tohttp://rosettacode.org/wiki/Mutual_Recursionto improve the >> > Clojure coverage and also to learn more stuff myself... >> >> > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
