Subject: RE: Implementing recursion (Was Re: Char node-type) From: Dimitre Novatchev <dnovatchev@xxxxxxxxx> Date: Sat, 25 Nov 2000 01:00:58 -0800 (PST) |
At least, there should be a well-known suite of tests that demonstrates how an XSLT processor handles cases of interest (among them highly recursive transformations), so that customers/developers could take an informed decision before committing heavily to a specific XSLT processor. Dimitre Novatchev. ----------------------Original message ------------------------ > 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. It seems unwise to me to mandate anything that isn't verifiable. Mandating that the processor can handle a recursion depth of 1000 is one thing, mandating how it should achieve this is another. Even then, specifying limits is a difficult area because it depends both on the XSLT processor and on the platform it runs on. Mike Kay __________________________________________________ Do You Yahoo!? Yahoo! Shopping - Thousands of Stores. Millions of Products. http://shopping.yahoo.com/ XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
RE: Implementing recursion (Was Re:, Kay Michael | Thread | RE: XSL Compilation, Kay Michael |
Re: Performance versus legibility, Dimitre Novatchev | Date | BUG or Non-Conformance -- the name(, Dimitre Novatchev |
Month |