| US 7,490,315 B2 | ||
| Persistent representations for complex data structures as interpreted programs | ||
| Mark A B Halstead, Kirkland, Wash. (US) | ||
| Assigned to Microsoft Corporation, Redmond, Wash. (US) | ||
| Filed on Jul. 06, 2005, as Appl. No. 11/176,651. | ||
| Application 11/176651 is a continuation of application No. 09/090119, filed on Jun. 04, 1998, granted, now 6,973,641. | ||
| Prior Publication US 2005/0268304 A1, Dec. 01, 2005 | ||
| This patent is subject to a terminal disclaimer. | ||
| Int. Cl. G06F 9/44 (2006.01) | ||
| U.S. Cl. 717—107 [717/139; 715/764] | 17 Claims |
| 1. A computer-implemented method for recreating a complex data object having a structure, the method comprising:
(a) configuring a program interpreter, the program interpreter comprising a stack-based virtual machine; and
(b) causing the program interpreter to:
(i) obtain a persistent representation of the structure of the complex data object as a sequence of directly executable instructions,
wherein the directly executable instructions are calls to a set of predefined functions used to create the complex data object;
(ii) interpret the directly executable instructions as calls to the set of predefined functions; and
(iii) call a predefined function corresponding to each directly executable instruction in the sequence of directly executable
instructions so as to construct the complex data object directly from the persistent representation, without parsing the persistent
representations,
wherein the stack-based virtual machine is located in a computer that presents the complex data object to a user.
|