[
Lists Home |
Date Index |
Thread Index
]
Jonathan Robie wrote:
>Dimitre Novatchev
>> To avoid recursion in tree processing (isn't this what XSLT and XQuery
>> are all about)? This should be impossible by definition.
>I think you are confusing recursive data structures, which both languages
must be
>able to handle, with recursive algorithms.
To amplify what Jonathan wrote, by recursion I was referring to algorithms
and not data structures--in particular, the use of XSLT 1.0 named templates
that call themselves to accomplish things that can be accomplished more
intuitively for most people with procedural code in other languages. For
example, the repetition of something a fixed number of times.
When I mentioned XSLT developers who don't use recursion in an earlier
posting, I was referring to the ones who avoid the use of recursive named
templates.
Bob DuCharme www.snee.com/bob <bob@
snee.com> weblog on linking-related topics:
http://www.oreillynet.com/pub/au/1191
|
