Skip to Content.
Sympa Menu

xom-interest - Re: [XOM-interest] Recursion

xom-interest AT lists.ibiblio.org

Subject: XOM API for Processing XML with Java

List archive

Chronological Thread  
  • From: "Bradley S. Huffman" <hip AT cs.okstate.edu>
  • To: Elliotte Rusty Harold <elharo AT metalab.unc.edu>
  • Cc: xom-interest AT lists.ibiblio.org
  • Subject: Re: [XOM-interest] Recursion
  • Date: Tue, 09 Mar 2004 11:09:17 -0600

Elliotte Rusty Harold writes:

> At 4:06 PM -0500 3/8/04, jcowan AT reutershealth.com wrote:
> > 0) Move to the root node.
> > 1) Process the current node.
> > 2) If the current node has a child:
> > move to the first child, go to step 1.
> > 3) If the current node has a rightward sibling:
> > move to the rightward sibling, go to step 1.
> > 4) If the current node has a parent:
> > move to the parent, go to step 2.
> > 5) Done.
>
>
> This algorithm needs to be adjusted somewhat for the serialization use case.
> The key difference is that a serializer needs to process an element
> twice, once for the start-tag before the children are processed and
> once for the end-tag after the children are processed.

Step 4 looks like a infinite loop to me. I think it should be "move to
the parent, go to step 3".

Brad




Archive powered by MHonArc 2.6.24.

Top of Page