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: Richard Light <richard at light dot demon dot co dot uk>
- Date: Fri, 24 Nov 2000 07:39:42 +0000
- References: <20001124042119.1885.qmail@web6303.mail.yahoo.com>
- Reply-To: xsl-list at mulberrytech dot com
In message <20001124042119.1885.qmail@web6303.mail.yahoo.com>, Dimitre
Novatchev <dnovatchev@yahoo.com> writes
>Will it not be simpler just to use SAXON -- it recognises tail
>recursion and implements it using iteration -- therefore no stack
>overflow will occur.
Thanks - I didn't know that.
I must say, I always see it is a bit of a defeat for the principle of
XSLT when the answer to a question is "use processor X".
Anyway, it looks as though the "Char node-type Party" doesn't have much
popular support ...
Richard.
Richard Light
SGML/XML and Museum Information Consultancy
richard@light.demon.co.uk
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list