Method of determining whether a document tree is weakly valid
September 8, 2014. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.Patent ReferencesMethod for integrating structured data and string data on a text processing system Editing of a superblock data structure System for editing real and virtual storage and secondary storage media Parser for natural language text Apparatus and process for creating variably sized block diagrams to accommodate variable text contents while yet retaining overall block shape Apparatus for transferring block data in original form and editing the block data Method and system for the representation of multiple analyses in dependency grammar and parser for generating such representation Method for copying a marked portion of a structured document Method and apparatus for analyzing the semantics and syntax of a sentence or a phrase Technique for creating and expanding element marks in a structured document InventorsAssigneeApplicationNo. 303286 filed on 09/08/1994US Classes:715/513Structured document (e.g., HTML, SGML, ODA, CDA)ExaminersPrimary: Nguyen, Phu K.Assistant: Vo, Cliff N. Attorney, Agent or FirmInternational ClassG06F 007/28AbstractSome document languages such as the Standard Generalized Markup Language (SGML) represent documents as trees with each node of the tree labelled with a tag and each node's immediate descendants taken in order having tags that satisfy a production corresponding to the parent's tag. Thus, a document is represented as a complete parse tree satisfying the production rules of a grammar. To simplify maintaining a valid document/parse tree at all stages, an efficient check is made whether a document is valid or can be extended to a valid document and furthermore to show how a document could be changed to be valid. A document can be extended to a valid document if is equal to a valid document with possibly some nodes deleted. External (leaf) nodes can just be deleted. Internal nodes are deleted by replacing the arc from the parent with multiple arcs (in the same order) from the parent to each of the children of the deleted node. A grammar is constructed from the given grammar that includes those documents that can be completed to a valid document and is called a gapped grammar. A method is provided to teach how a gapped grammar can be constructed from a grammar, a parser/checker is efficiently implemented.Other References
| |
