This is the mail archive of the
xsl-list@mulberrytech.com
mailing list .
Re: recursivly applying a transform to a result tree
- To: <xsl-list at lists dot mulberrytech dot com>
- Subject: Re: [xsl] recursivly applying a transform to a result tree
- From: "korlyukov" <korlyukov at grsu dot grodno dot by>
- Date: Mon, 9 Apr 2001 06:04:56 +0300
- References: <003e01c0c01e$75e90050$1e01000a@defiant>
- Reply-To: xsl-list at lists dot mulberrytech dot com
You can see an example of use recursivly applying a transform to a result
tree
in my letter concerning Turing mashine
http://www.biglist.com/lists/xsl-list/archives/200103/msg01221.html
( http://www.refal.net/~korlukov/tm/ )
Alexandr
> The language is completly recursive by nature and obviously so is an
> implementation of the transform.
> But something strikes me as being very odd. Why are there no facilities
for
> recursivly applying a transform to a result tree fragment ? Is this a
design
> philosophy or perhaps a omission cq flaw ?
>
> Recursivly applying a transform to a result tree fragment is basically
> equivalant to recursing the transform with the result tree fragment as the
> source and a new stylesheet for processing:
> I hope someone can help me with these questions ?
> Marco Voetberg
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list