<p>我认为您可以使用“childGenerator”方法并递归地使用这个方法以DFT的方式解析树。</p>
<pre><code>def recursiveChildren(x):
if "childGenerator" in dir(x):
for child in x.childGenerator():
name = getattr(child, "name", None)
if name is not None:
print "[Container Node]",child.name
recursiveChildren(child)
else:
if not x.isspace(): #Just to avoid printing "\n" parsed from document.
print "[Terminal Node]",x
if __name__ == "__main__":
soup = BeautifulSoup(your_data)
for child in soup.childGenerator():
recursiveChildren(child)
</code></pre>
<p>使用<code>"childGenerator" in dir(x)</code>我们确保元素是容器，终端节点（如<code>NavigableStrings</code>）不是容器，也不包含子节点。</p>
<p>例如HTML：</p>
<pre><code><html>
<ul>
<li>Lorem ipsum dolor sit amet, consectetuer adipiscing elit.</li>
<li>Aliquam tincidunt mauris eu risus.</li>
<li>Vestibulum auctor dapibus neque.</li>
</ul>
</html>
</code></pre>
<p>这些脚本打印。。。</p>
<pre><code>[Container Node] ul
[Container Node] li
[Terminal Node] Lorem ipsum dolor sit amet, consectetuer adipiscing elit.
[Container Node] li
[Terminal Node] Aliquam tincidunt mauris eu risus.
[Container Node] li
[Terminal Node] Vestibulum auctor dapibus neque.
</code></pre>
