Re: recursivly applying a transform to a result tree

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