package html2txt;import java.util.*;import java.io.BufferedReader;import java.io.FileNotFoundException;import java.io.FileReader;import java.io.IOException;import java.text.SimpleDateFormat;/** * Do some format on web display. * * @author Xuefeng */public class WebFormatter {    public static void main(String[] args)    {        BufferedReader br;                  String HtmlStr="";        try {            br = new BufferedReader(                     new FileReader("e:\\a.html"));                                        String t=null;            while((t=br.readLine())!=null){//读一行                HtmlStr=HtmlStr+t;              }        } catch (FileNotFoundException e) {            // TODO Auto-generated catch block            e.printStackTrace();        } catch (IOException e) {            // TODO Auto-generated catch block            e.printStackTrace();        }                  //HtmlStr="
     
       　三、改进措施
     
     
      　　1、 多关注优等生，让他们一定要保持稳定。多关注中等生，在一定程度上能够让他们与优等生逐一雌雄。多鼓励下游生！努力使两极分化最小化！
     
     
      　　2、一如既往抓学风。要做到勤说（每天每时常提醒）、勤问（每天能够与个别学生进行交流）、勤查（每天检查各科作业的完成情况），加大管理力度，让学生能在安静的环境中学习。
     
     
      　　3、做好学生的思想工作，阐明各校之间竞争的严峻形势，让学生有忧患意识，从而调动学习的积极性。
     
     
      　　4、 多与各科教师联系，及时了解学生动态，接受科任老师的建议。多与家长交流，形成合力，共同督促学生学习，使其进步。
     
     
      　　5、 继续进行“一帮一”互助学习帮教活动，让优生带动差生学习，共同取得进步。
     
     
      　　6、 学生进行深刻的自我反思，对自己的学习提出具体的要求。
     
     
      　　7、 举行一次学法交流会，促成每个学生形成适合自己的良好学习方法。
     
";        String str=html2text(HtmlStr);        System.out.println(str);    }          public static String html2text(String html) {        if(html==null||html=="")        {            return "";        }        StringBuffer sb = new StringBuffer(html.length());        char[] data = html.toCharArray();        int start = 0;        boolean previousIsPre = false;        Token token = null;        for(;;) {            token = parse(data, start, previousIsPre);            if(token==null)                break;            previousIsPre = token.isPreTag();            sb = sb.append(token.getText());            start += token.getLength();        }        return sb.toString();    }    private static Token parse(char[] data, int start, boolean previousIsPre) {        if(start>=data.length)            return null;        // try to read next char:        char c = data[start];        if(c=='<') {            // this is a tag or comment or script:            int end_index = indexOf(data, start+1, '>');            if(end_index==(-1)) {                // the left is all text!                return new Token(Token.TOKEN_TEXT, data, start, data.length, previousIsPre);            }            String s = new String(data, start, end_index-start+1);            // now we got s="<...>":            if(s.startsWith("
     ");                if(end_comment_index==(-1)) {                    // illegal end, but treat as comment:                    return new Token(Token.TOKEN_COMMENT, data, start, data.length, previousIsPre);                }                else                    return new Token(Token.TOKEN_COMMENT, data, start, end_comment_index+3, previousIsPre);            }            String s_lowerCase = s.toLowerCase();            if(s_lowerCase.startsWith("
     
      ");                if(end_script_index==(-1))                    // illegal end, but treat as script:                    return new Token(Token.TOKEN_SCRIPT, data, start, data.length, previousIsPre);                else                    return new Token(Token.TOKEN_SCRIPT, data, start, end_script_index+9, previousIsPre);            }            else { // this is a tag:                return new Token(Token.TOKEN_TAG, data, start, start+s.length(), previousIsPre);            }        }        // this is a text:        int next_tag_index = indexOf(data, start+1, '<');        if(next_tag_index==(-1))            return new Token(Token.TOKEN_TEXT, data, start, data.length, previousIsPre);        return new Token(Token.TOKEN_TEXT, data, start, next_tag_index, previousIsPre);    }    private static int indexOf(char[] data, int start, String s) {        char[] ss = s.toCharArray();        // TODO: performance can improve!        for(int i=start; i<(data.length-ss.length); i++) {            // compare from data[i] with ss[0]:            boolean match = true;            for(int j=0; j
      
           public static final int TOKEN_TAG     = 2; // tag like 
       
, , etc.    public static final int TOKEN_SCRIPT  = 3;    private static final char[] TAG_BR  = "
         
          ");        SPECIAL_CHARS.put("&",  "&");        SPECIAL_CHARS.put("®",  "(r)");        SPECIAL_CHARS.put("©", "(c)");        SPECIAL_CHARS.put(" ", " ");        SPECIAL_CHARS.put("£", "?");    }    public Token(int type, char[] data, int start, int end, boolean previousIsPre) {        this.type = type;        this.length = end - start;        this.html = new String(data, start, length);     //   System.out.println("[Token] html=" + html + ".");        parseText(previousIsPre);       // System.out.println("[Token] text=" + text + ".");    }    public int getLength() {        return length;    }    public boolean isPreTag() {        return isPre;    }    private void parseText(boolean previousIsPre) {        if(type==TOKEN_TAG) {            char[] cs = html.toCharArray();            if(compareTag(TAG_BR, cs) || compareTag(TAG_P, cs))                text = "\n";            else if(compareTag(TAG_LI, cs))                text = "\n* ";            else if(compareTag(TAG_PRE, cs))                isPre = true;            else if(compareTag(TAG_HR, cs))                text = "\n--------\n";            else if(compareString(END_TAG_TD, cs))                text = "\t";            else if(compareString(END_TAG_TR, cs) || compareString(END_TAG_LI, cs))                text = "\n";        }        // text token:        else if(type==TOKEN_TEXT) {            text = toText(html, previousIsPre);        }    }    public String getText() {        return text==null ? "" : text;    }    private String toText(String html, final boolean isPre) {        char[] cs = html.toCharArray();        StringBuffer buffer = new StringBuffer(cs.length);        int start = 0;        boolean continueSpace = false;        char current, next;        for(;;) {            if(start>=cs.length)                break;            current = cs[start]; // read current char            if(start+1
          
           0 && code<65536) { // this is a special char:                                    buffer = buffer.append((char)code);                                    // continue loop:                                    start++;                                    continue;                                }                            }                            catch(Exception e) {}                            // just normal char:                            buffer = buffer.append("&#");                            // continue loop:                            start+=2;                            continue;                        }                        else { // just '&':                            buffer = buffer.append('&');                            // continue loop:                            start++;                            continue;                        }                    }                }            }            else { // just a normal char!                buffer = buffer.append(current);                // continue loop:                start++;                continue;            }        }        return buffer.toString();    }    // read from cs[start] util meet the specified char 'util',    // or null if not found:    private int readUtil(final char[] cs, final int start, final char util, final int maxLength) {        int end = start+maxLength;        if(end>cs.length)            end = cs.length;        for(int i=start; i
           
            "    private boolean compareTag(final char[] ori_tag, char[] tag) {        if(ori_tag.length>=tag.length)            return false;        for(int i=0; i
            
             ori_tag.length) {            char c = Character.toLowerCase(tag[ori_tag.length]);            if(c<'a' || c>'z')                return true;            return false;        }        return true;    }    private boolean compareString(final char[] ori, char[] comp) {        if(ori.length>comp.length)            return false;        for(int i=0; i