[
Lists Home |
Date Index |
Thread Index
]
Kirkham, Pete (UK) 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.
>>
>>
>
>It depends what you mean by recursion- when Rick Marshall mentioned it, I scanned through all the code I'd written in the last month, and all the tree processing iterates on an explicit stack rather then using recursion at the language level (big trees). There are far more cases of conceptual recursion rather than language level recursion- in SAX for example the calls on the handler for nested element are conceptually 'inside' the calls for the enclosing element, event though they are made sequentially and iteratively.
>
>Anyway, all recursive algorithms can be transformed to iterative ones, and visa-versa.
>
>
i agree. it's just a case of who looks after the stack.
>
>Pete
>
>********************************************************************
>This email and any attachments are confidential to the intended
>recipient and may also be privileged. If you are not the intended
>recipient please delete it from your system and notify the sender.
>You should not copy it or use it for any purpose nor disclose or
>distribute its contents to any other person.
>********************************************************************
>
>-----------------------------------------------------------------
>The xml-dev list is sponsored by XML.org <http://www.xml.org>, an
>initiative of OASIS <http://www.oasis-open.org>
>
>The list archives are at http://lists.xml.org/archives/xml-dev/
>
>To subscribe or unsubscribe from this list use the subscription
>manager: <http://www.oasis-open.org/mlmanage/index.php>
>
>
>
>
begin:vcard
fn:Rick Marshall
n:Marshall;Rick
email;internet:rjm@zenucom.com
tel;cell:+61 411 287 530
x-mozilla-html:TRUE
version:2.1
end:vcard
|
