Collection to represent ol ul il structures in recursive function

Question

Hello
Im trying to write a terminal based web-browser and have a little problem when it comes to presentation of <ul><ol><li> tags.
Im using recursion to step through the tags and the main function looks something like this (just wrote down a simplified version) It reads an xhtml document.
private boolean  inBody= false;
private int numberOfB = 0;
private int numberOfEm = 0;
public void printNodeLeaves(Node N)
     switch (N.getNodeType())
case Node.DOCUMENT_NODE:
case Node.ELEMENT_NODE:
String nName = N.getNodeName(); //F�r ut taggar som B,P,EM osv
if (nName.equalsIgnoreCase("body")) inBody= true;
if (nName.equalsIgnoreCase("b")){
  numberOfB++;
  //Print out boldtext
if (nName.equalsIgnoreCase("p")) itw.newline(2);
if (nName.equalsIgnoreCase("em")){
     numberOfEm++;          
     //Print out italic text                    
//Recursion      
NodeList children= N.getChildNodes();
if (children != null)
    for (int i=0; i<children.getLength(); ++i){              
         printNodeLeaves(children.item(i));              
if (nName.equalsIgnoreCase("b")){
     numberOfB--;
     if(numberOfB==0) // Turn of the bold
     if(numberOfEm>0) // Turn on the italic
if (nName.equalsIgnoreCase("em")) {
     numberOfEm--;
     if(numberOfEm==0) //Turn of the italic
     if(numberOfB>0) //Turn on bold
if (nName.equalsIgnoreCase("p")) itw.newline(2);
     break;
     case Node.TEXT_NODE:
     if (inBody){                   
         itw.print(N.getNodeValue().replaceAll("\n", " "));                    
}My problem is when it comes to the lists, both <ul> and <ol> tags contains <il>, im looking for a way to represent
the lists in some kind of collection, linkedlist maybe. I was thinking of making a class that contains a list and property that tells me if the list is a <ul> or <ol>. The problem is that a <ul> could containt a <ol> and vice verca, ant of course they must be able to be nested. Why i need the ul and the ol in the same collection is because <il> in a <ol> should be outprinted with the number first followed by a dott, and <ul> should have a * in front of each <il>.
Anyone that have any thoughts on this?

Answer 1

Odd question. Why do you need to represent them in a collection? Seems like they're probably as well organized as they will be in the DOM. You should just process nodes recursively and if the current node is a "ol" then each child should be displayed with an integer that counts up from 1. If you hit an "ul" while processing the "ol" it shouldn't matter, you should process it then continue processing the "ol".
One suggestion:
use:
String nName = N.getNodeName().toLowerCase().intern();
then do if(nName == "tagname")
as is, you are converting each character to lower case and comparing everytime. If you internalize, then == will work and is a simple reference comparison.
More about internalization:
http://java.sun.com/docs/books/jls/second_edition/html/lexical.doc.html#19369