Data processing: presentation processing of document – operator i – Presentation processing of document – Layout
Reexamination Certificate
2006-06-06
2006-06-06
Bashore, William (Department: 2176)
Data processing: presentation processing of document, operator i
Presentation processing of document
Layout
C715S252000, C715S252000
Reexamination Certificate
active
07058884
ABSTRACT:
Disclosed is a method of restructuring an input HTML document to comply with strict HTML. An input HTML document is linearly traversed to create a hierarchical tree structure representation (FIGS.2A–2F), the traversal maintaining a current insertion point (206, 210) for elements within the tree structure representation. During the traversal, elements (208) of the input HTML document that violate strict HTML are identified. Each element is then processed individually, initially by retracing the tree structure representation from the current insertion point to identify an further insertion point from which the identified element can depend, the retracing comprising noting each parent element of the identified element passed during said retracing. Then, at the further insertion point, new elements (218) are created in the tree structure representation to correspond to those parent elements passed during the retracing, the new elements being created in reverse chronological order to that encountered during the retracing. The identified element (208) is then append to a terminal one of the new elements. The tree structure representation can then be converted into an output HTML document.
REFERENCES:
patent: 5276793 (1994-01-01), Borgendale et al.
patent: 5973696 (1999-10-01), Agranat et al.
patent: 5991713 (1999-11-01), Unger et al.
patent: 6035326 (2000-03-01), Miles et al.
patent: 6507856 (2003-01-01), Chen et al.
patent: 6558431 (2003-05-01), Lynch et al.
patent: 6675354 (2004-01-01), Claussen et al.
patent: 2001/0018697 (2001-08-01), Kunitake et al.
patent: 2002/0073119 (2002-06-01), Richard
patent: 790581 (1997-08-01), None
patent: WO 97/33437 (1997-09-01), None
patent: WO 98/008168 (1998-02-01), None
patent: WO 99/53469 (1999-10-01), None
Cormen et al., Introduction to Algorithms, The Massachusetts Institute of Technology, Nineteenth Printing, 1997 (250-252 et seq.).
Michael Fourman and the University of Edinburgh, 22 Balanced Search Trees, © 1994-2004 (available at http://homepages.inf.ed.ac.uk/mfourman/teaching/mlCourse
otes/L22.html).
Scott Robert Ladd, C++ Templates and Tools, 2nd Ed., M&T Books, Copyright © 1996, pp. 187-215.
Bashore William
Nguyen-Ba Paul
LandOfFree
Structures to represent poorly formed HTML documents does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Structures to represent poorly formed HTML documents, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Structures to represent poorly formed HTML documents will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3677904