Method for efficient writing/description of hierarchical data-structures e.g. for the Internet, requires listing of data elements and subordinate nodes after the introductory node

摘要

The method of platform-independent writing or describing of any hierarchically organized data-structure with at least one node-root overcomes the limitations of data-trees using platform-independent language in plain text, such as SGML, HTML etc for applications in heterogeneous networks e.g. the Internet. Each node can contain any number of data elements and any number (inclusive of 0) of sub-ordinate nodes. At least one node is introduced by the a maximum of one separate character (AK) of a specified alphabet (A), and at least one node after the said introductory character (AK) in any sequence lists the data elements and subordinate nodes contained in the said nodes.