US5381547A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for dynamically linking definable program elements of an interactive data processing system
Assignee: Siemens AG
•
Filing: 1990-10-24
•
Granted: 1995-01-10
•
Expires: 2010-10-24
Abstract
Abstract PCT No. PCT/EP90/01804 Sec. 371 Date May 28, 1992 Sec. 102(e) Date May 28, 1992 PCT Filed Oct. 24, 1990 PCT Pub. No. WO91/08534 PCT Pub. Date Jun. 13, 1991.In contrast to previous methods, for example for LISP systems, a central function caller with its complex status inquiries is not required, since a data structure with a link header is provided, to which directly executable execution code is always chained. Depending on the type of function and depending on the respective status of a definition of the program element, it is possible to provide here as execution code an error interface for undefined functions, a simulator interface for functions to be simulated, an interpreter interface for functions to be interpreted or a compiled program section for already compiled functions. As a result of dispensing with the status inquiries, it is possible to achieve considerable acceleration of the program execution, in particular for LISP systems, in which a function call often occurs for usually only short function operations.
Inventors
- 👤 Christian Flug
- 👤 Dieter Kolb
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 11:14
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/44; G06F9/448; G06F9/4482; G06F9/4484
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
188 words
A method in a computer implemented process for dynamically linking program elements of an interactive data processing system, that is capable of defining operations of the interactive data processing system by the program elements, comprising the steps of: a) generating and assigning, before run-time of a program that utilizes the program elements, a link header to each program element as a data block for storing chaining information, b) chaining, before the run-time of the program, a first execution code to the link header via the chaining information, c) if for any program element a respective first execution code is altered to a second execution code by operation of the interactive data processing system during the run-time of the program, regenerating the link header, replacing the respective first execution code with the generated second execution code, the regenerated link heater assigning the second execution code to the respective program element, d) when a program element is executed by operation of the data processing system during the run-time of the program, accessing a respective chained execution code via a respective assigned link header and executing the respective chained execution code.
Claim 2
Independent Claim
188 words
A method in a computer implemented process for dynamically linking program elements of an interactive data processing system, that is capable of defining operations of the interactive data processing system by the program elements, comprising the steps of: a) generating and assigning, before run-time of a program that utilizes the program elements, a link header to each program element as a data block for storing chaining information, b) chaining, before the run-time of the program, a first execution code to the link header via the chaining information, c) if for any program element a respective first execution code is altered to a second execution code by operation of the interactive data processing system during the run-time of the program, regenerating the link header, replacing the respective first execution code with the generated second execution code, the regenerated link heater assigning the second execution code to the respective program element, d) when a program element is executed by operation of the data processing system during the run-time of the program, accessing a respective chained execution code via a respective assigned link header and executing the respective chained execution code.
Claim 3
Dependent Claim
65 words
The method as claimed in claim 1, wherein the method further comprises, before the run-time of the program and after step a) and before step b), the step of providing to each program element a data entry referencing the link header, and wherein a respective data entry is used during run-time of the program to locate the link header in the interactive data processing system.
Claim 4
Dependent Claim
91 words
The method as claimed in claim 1, wherein a respective execution code that is chained to a respective link header is a predetermined execution code selected from the following execution codes: a) an error interface to an error handling program for an as yet undefined or no longer defined program element, b) a simulator interface to a simulator program for a program element to be simulated, c) an interpreter interface to an interpreter program for a program element to be interpreted, d) a compiled program sequence for a compiled program element.
Claim 5
Dependent Claim
17 words
The method as claimed in claim 3, wherein the interactive data processing system is a LISP system.
Claim 6
Dependent Claim
44 words
The method as claimed in claim 4, wherein the method further comprises entering into a respective link header of a respective program element a data entry as an identifier entry of the respective link header with a length specification for the respective link header.
Claim 7
Dependent Claim
43 words
The method as claimed in claim 4, wherein the method further comprises entering into a respective link header of a respective program element a data entry as link to an identification entry of a symbol which is associated with the respective program element.
Claim 8
Dependent Claim
33 words
The method as claimed in claim 4, wherein the method further comprises entering into a respective link header of a respective program element a data entry as link to the respective execution code.
Claim 9
Dependent Claim
32 words
The method as claimed in claim 4, wherein the method further comprises entering into a respective link header of a respective program element a data entry as link to an environment block.
Claim 10
Dependent Claim
32 words
The method as claimed in claim 4, wherein the method further comprises entering into a respective link header of a respective program element a data entry as link to a function source.
Claim 11
Dependent Claim
30 words
The method as claimed in claim 4, wherein the method further comprises entering into a respective link header of a respective program element a data entry as link to parameters.
Claim 12
Dependent Claim
42 words
The method as claimed in claim 4, wherein the method further comprises entering into a respective link header of a respective program element a data entry as link to a symbol or a constant which is used by the respective program element.
References Cited (Backward Citations)
US4558413A
Cited
US5247681A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-01-09 | 1998-07-11 | 1999-01-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-01-09 | 2002-07-11 | 2003-01-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-01-09 | 2006-07-11 | 2007-01-10 | $7700.00 | Window Closed / Lapsed |