This is the mail archive of the
xsl-list@mulberrytech.com
mailing list .
Re: Implementing recursion (Was Re: Char node-type)
- To: xsl-list at mulberrytech dot com
- Subject: Re: Implementing recursion (Was Re: Char node-type)
- From: David Carlisle <davidc at nag dot co dot uk>
- Date: Fri, 24 Nov 2000 09:19:11 GMT
- References: <20001124042119.1885.qmail@web6303.mail.yahoo.com>
- Reply-To: xsl-list at mulberrytech dot com
> 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