Path: csiph.com!newsfeed.hal-mli.net!feeder3.hal-mli.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!newsfeed.xs4all.nl!newsfeed1.news.xs4all.nl!xs4all!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail
MIME-Version: 1.0
In-Reply-To: <l71j4q$c8l$1@ger.gmane.org>
References: <d75d1f2c-05c6-4fa6-ae0a-28e13de3097a@googlegroups.com> <l71j4q$c8l$1@ger.gmane.org>
Date: Tue, 26 Nov 2013 07:23:20 -0500
Subject: Re: parsing nested unbounded XML fields with ElementTree
From: Larry Martell <larry.martell@gmail.com>
To: Stefan Behnel <stefan_ml@behnel.de>
Content-Type: text/plain; charset=UTF-8
Cc: python-list@python.org
Precedence: list
Newsgroups: comp.lang.python
Message-ID: <mailman.3232.1385468604.18130.python-list@python.org>
Lines: 64
NNTP-Posting-Host: 2001:888:2000:d::a6
Xref: csiph.com comp.lang.python:60506

On Tue, Nov 26, 2013 at 2:38 AM, Stefan Behnel <stefan_ml@behnel.de> wrote:
> Larry.Martell...@gmail.com, 25.11.2013 23:22:
>> I have an XML file that has an element called "Node". These can be nested to any depth and the depth of the nesting is not known to me. I need to parse the file and preserve the nesting. For exmaple, if the XML file had:
>>
>> <Node Name="A">
>>    <Node Name="B">
>>       <Node Name="C">
>>         <Node Name="D">
>>           <Node Name="E">
>>
>> When I'm parsing Node "E" I need to know I'm in A/B/C/D/E. Problem is I don't know how deep this can be. This is the code I have so far:
>>
>> nodes = []
>>
>> def parseChild(c):
>>     if c.tag == 'Node':
>>         if 'Name' in c.attrib:
>>             nodes.append(c.attrib['Name'])
>>         for c1 in c:
>>             parseChild(c1)
>>     else:
>>         for node in nodes:
>>             print node,
>>         print c.tag
>>
>> for parent in tree.getiterator():
>>     for child in parent:
>>         for x in child:
>>             parseChild(x)
>
> This seems hugely redundant. tree.getiterator() already returns a recursive
> iterable, and then, for each nodes in your document, you are running
> recursively over its entire subtree. Meaning that you'll visit each node as
> many times as its depth in the tree.
>
>
>> My problem is that I don't know when I'm done with a node and I should
>> remove a level of nesting. I would think this is a fairly common
>> situation, but I could not find any examples of parsing a file like
>> this. Perhaps I'm going about it completely wrong.
>
> Your recursive traversal function tells you when you're done. If you drop
> the getiterator() bit, reaching the end of parseChild() means that you're
> done with the element and start backing up. So you can simply pass down a
> list of element names that you append() at the beginning of the function
> and pop() at the end, i.e. a stack. That list will then always give you the
> current path from the root node.

Thanks for the reply. How can I remove getiterator()? Then I won't be
traversing the nodes of the tree. I can't iterate over tree. I am also
unclear on where to do the pop(). I tried putting it just after the
recursive call to parseChild() and I tried putting as the very last
statement in parseChild() - neither one gave the desired result. Can
you show me in code what you mean?

Thanks!
-larry

>
> Alternatively, if you want to use lxml.etree instead of ElementTree, you
> can use it's iterwalk() function, which gives you the same thing but
> without recursion, as a plain iterator.
>
> http://lxml.de/parsing.html#iterparse-and-iterwalk