Subject: Re: Implementing recursion (Was Re: Char node-type) From: David Carlisle <davidc@xxxxxxxxx> Date: Fri, 24 Nov 2000 09:19:11 GMT |
> Will it not be simpler just to use SAXON -- it recognises tail > recursion and implements it using iteration -- therefore no stack > overflow will occur. But a good question is the algorithm in question tail recursive? If it's doing a binary cut and processing each branch with two recursive calls then, it isn't... David _____________________________________________________________________ This message has been checked for all known viruses by Star Internet delivered through the MessageLabs Virus Control Centre. For further information visit http://www.star.net.uk/stats.asp XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: Implementing recursion (Was Re:, Richard Light | Thread | Re: Implementing recursion (Was Re:, Richard Light |
Re: Implementing recursion (Was Re:, Richard Light | Date | Re: Implementing recursion (Was Re:, David Carlisle |
Month |