Method, computer system and computer program product for processing extensible markup language streams
First Claim
1. A method performed by a computer system of processing an extensible markup language input stream having a tag structure with start and end tags which may enclose further tags, so that the tag structure may be represented by a tree structure, the method using objects mapped to tags contained in the input stream, said objects defining start and end methods which can be invoked, the method comprising:
- parsing the input stream, as a tag is found during the parsing process, building a tree representation of the input stream and the objects bound to tags by building the object mapped to the tag found into the tree representation according to the tag structure, invoking, during the parsing process, before the input stream is entirely parsed and the tree representation is entirely built, in response to finding a start tag, the start method defined in the object mapped to the tag found, and invoking, during the parsing process, before the input stream is entirely parsed and the tree representation is entirely built, in response to finding an end tag, the end method defined in the object mapped to the tag found, wherein, due to the fact that the object is built into the tree representation before one of the methods defined by it is invoked, the method invoked during the parsing process, before the input stream is entirely parsed, has awareness of the position of the tag to which it is mapped within the tree structure not yet entirely built.
8 Assignments
0 Petitions
Accused Products
Abstract
The invention is directed to a method performed by a computer system to process an extensible markup language input stream using discrete software components mapped to tags contained in the input stream, comprising: parsing the input stream; as a tag is parsed, invoking the software component mapped to it. The invention is also directed to a computer system, comprising: a processing unit and storage for processing programs; bindings representing a mapping between tags and discrete software components; a software engine comprising: a reader component that reads an extensible markup language input stream containing at least one tag; a parser component that parses the input stream; an execution component that, as a tag is parsed, invokes the software component mapped to the tag. The invention is also directed to a corresponding computer program product.
-
Citations
19 Claims
-
1. A method performed by a computer system of processing an extensible markup language input stream having a tag structure with start and end tags which may enclose further tags, so that the tag structure may be represented by a tree structure, the method using objects mapped to tags contained in the input stream, said objects defining start and end methods which can be invoked, the method comprising:
-
parsing the input stream, as a tag is found during the parsing process, building a tree representation of the input stream and the objects bound to tags by building the object mapped to the tag found into the tree representation according to the tag structure, invoking, during the parsing process, before the input stream is entirely parsed and the tree representation is entirely built, in response to finding a start tag, the start method defined in the object mapped to the tag found, and invoking, during the parsing process, before the input stream is entirely parsed and the tree representation is entirely built, in response to finding an end tag, the end method defined in the object mapped to the tag found, wherein, due to the fact that the object is built into the tree representation before one of the methods defined by it is invoked, the method invoked during the parsing process, before the input stream is entirely parsed, has awareness of the position of the tag to which it is mapped within the tree structure not yet entirely built. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A computer system, comprising:
-
a processing unit and storage for processing programs, bindings representing a mapping between tags and methods of discrete software components, a software engine comprising;
a reader component arranged to read an extensible markup language input stream having a tag structure with start and end tags which may enclose further tags, so that the tag structure may be represented by a tree structure, a parser component arranged to parse the input stream, an execution component, as a tag is found during the parsing process, arranged to;
build a tree representation of the input stream and the objects bound to tags by building the object mapped to the tag found into the tree representation according to the tag structure, invoke, during the parsing process, before the input stream is entirely parsed and the tree representation is entirely built, in response to finding a start tag, the start method defined in the object mapped to the tag found, and invoke, during the parsing process, before the input stream is entirely parsed and the tree representation is entirely built, in response to finding an end tag, the end method defined in the object mapped to the tag found, wherein, due to the fact that the object is built into the tree representation before one of the methods defined by it is invoked, the method invoked during the parsing process, before the input stream is entirely parsed, has awareness of the position of the tag to which it is mapped within the tree structure not yet entirely built. - View Dependent Claims (12, 13, 14, 15, 16)
-
-
17. A computer program product comprising a machine-readable medium with program code stored on it, for carrying out a method, when executed on a computer system, of processing an extensible markup language input stream having a tag structure with start and end tags which may enclose further tags, so that the tag structure may be represented by a tree structure, the method using objects mapped to tags contained in the input stream, said objects defining start and end methods which can be invoked, the program code being arranged to:
-
parse the input stream, as a tag is found during the parsing process;
build a tree representation of the input stream and the objects bound to tags by building the object mapped to the tag found into the tree representation according to the tag structure, invoke, during the parsing process, before the input stream is entirely parsed and the tree representation is entirely built, in response to finding a start tag, the start method defined in the object mapped to the tag found, and invoke, during the parsing process, before the input stream is entirely parsed and the tree representation is entirely built, in response to finding an end tag, the end method defined in the object mapped to the tag found, wherein, due to the fact that the object is built into the tree representation before one of the methods defined by it is invoked, the method invoked during the parsing process, before the input stream is entirely parsed, has awareness of the position of the tag to which it is mapped within the tree structure not yet entirely built. - View Dependent Claims (18)
-
-
19. A signal transmitted over a computer network comprising a representation of program code for carrying out a method, when executed on a computer system, of processing an extensible markup language input stream having a tag structure with start and end tags which may enclose further tags, so that the tag structure may be represented by a tree structure, the method using objects mapped to tags contained in the input stream, said objects defining start and end methods which can be invoked, the program code being arranged to:
-
parse the input stream, as a tag is found during the parsing process;
build a tree representation of the input stream and the objects bound to tags by building the object mapped to the tag found into the tree representation according to the stream tag structure, invoke, during the parsing process, before the input stream is entirely parsed and the tree representation is entirely built, in response to finding a start tag, the start method defined in the object mapped to the tag found, and invoke, during the parsing process, before the input stream is entirely parsed and the tree representation is entirely built, in response to finding an end tag, the end method defined in the object mapped to the tag found, wherein, due to the fact that the object is built into the tree representation before one of the methods defined by it is invoked, the method invoked during the parsing process, before the input stream is entirely parsed, has awareness of the position of the tag to which it is mapped within the tree structure not yet entirely built.
-
Specification