[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Re: Implementing recursion (Was Re: Char node-type)

Subject: Re: Implementing recursion (Was Re: Char node-type)
From: uche.ogbuji@xxxxxxxxxxxxxxx
Date: Fri, 24 Nov 2000 15:56:51 -0700
Re: Implementing recursion (Was Re: Char node-type)
> > In my opinion there must be some requirements in the standard
> > specifications about the minimum expected robustness and reliability of
> > an XSLT processor. A good and necessary requirement of this type is
> > that an XSLT processor should not crash in typical recursive
> > processing.
> 
> If I recall, scheme (and XSL's parent, DSSSL) mandate that
> implementations perform tail recursion elimination. XSLT of course
> hardly mandates anything about implementaions at all.
> However it would be good to know if the common implementations
> do do this, you said saxon does, what of the others?

4XSLT does.


-- 
Uche Ogbuji                               Principal Consultant
uche.ogbuji@xxxxxxxxxxxxxxx               +1 303 583 9900 x 101
Fourthought, Inc.                         http://Fourthought.com 
4735 East Walnut St, Ste. C, Boulder, CO 80301-2537, USA
Software-engineering, knowledge-management, XML, CORBA, Linux, Python



 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list


Current Thread

PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
Email
First Name
Last Name
Company
Subscribe in XML format
RSS 2.0
Atom 0.3
Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2013 All Rights Reserved.