Patent US5690130A successfully refreshed from Google Patents.
EP0243110A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Computer system having source code re-creation capability
Assignee: Texas Instruments Inc
•
Filing: 1987-04-16
•
Granted: —
•
Expires: 2007-04-16
Abstract
Abstract A computer system capable of compiling PROLOG programs appends to the compiled code (46) information necessary to recreate the source which generated the compiled code. This allows program statements which use the original source code to be compiled. Each program statement is compiled into a separate block of code (40), with all statements in a procedure linked together in lists. Program statements can be compiled as they are created, and statements can be added or deleted by adding or deleting blocks of compiled code (46) from the appropriate lists.
Inventors
- 👤 Aditya Srivastava
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-31 04:19
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/40; G06F8/41; G06F9/00; G06F9/06; G06F9/44; G06F9/448; G06F9/4496
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
81 words
1 . A method for compiling source code statements of a programming language, comprising the steps of: (a) translating a source code statement into an object code block; (b) appending to the object code block information sufficient to recreate the source code statement: (c) linking the object code block and appended information into a list with object code and appended information for any related source code statements; and (d) repeating steps (a) through (c) for each of the source code statements.
Claim 2
Dependent Claim
81 words
1 . A method for compiling source code statements of a programming language, comprising the steps of: (a) translating a source code statement into an object code block; (b) appending to the object code block information sufficient to recreate the source code statement: (c) linking the object code block and appended information into a list with object code and appended information for any related source code statements; and (d) repeating steps (a) through (c) for each of the source code statements.
Claim 3
Dependent Claim
105 words
The method of Claim 1, wherein step (c) comprises: (c.1) creating a procedure execution frame for each procedure defined by the source code statements, each procedure execution frame having a plurality of pointers. wherein each pointer points to a list of object code blocks having a common property; (c.2) determining which procedure execution frame corresponds to the procedure in which the source code statement belongs: (c.3) selecting a list of object code blocks pointed to by a pointer in the determined procedure execution frame which have a common property with the source code statement: and (c.4) inserting the object code block into the selected list.
Claim 4
Independent Claim
76 words
A method for recreating a source code statement, comprising the steps of: (a) compiling the source code into an object code block; (b) appending to the object code block recreation commands, wherein such recreation commands contain information sufficient, when considered in combination with the object code block. to recreate the source code statement; and (c) executing the recreation commands and the object code block in a source code recreation mode to recreate the source code statement.
Claim 5
Independent Claim
76 words
A method for recreating a source code statement, comprising the steps of: (a) compiling the source code into an object code block; (b) appending to the object code block recreation commands, wherein such recreation commands contain information sufficient, when considered in combination with the object code block. to recreate the source code statement; and (c) executing the recreation commands and the object code block in a source code recreation mode to recreate the source code statement.
Claim 6
Dependent Claim
103 words
4 . A method for compiling a procedure having a plurality of clauses, comprising the steps of: (a) creating a procedure execution frame having a plurality of pointers, each pointer corresponding to a preselected subset of clauses of the procedure having similar characteristics; (b) separately compiling each clause into an object code block; (c) attaching to each object code block information sufficient to recreate the clause from which that object code block was compiled, to create a clause execution frame; and (d) inserting each clause execution frame into a data structure which is pointed to by one of the procedure execution frame pointers.
Claim 7
Dependent Claim
103 words
4 . A method for compiling a procedure having a plurality of clauses, comprising the steps of: (a) creating a procedure execution frame having a plurality of pointers, each pointer corresponding to a preselected subset of clauses of the procedure having similar characteristics; (b) separately compiling each clause into an object code block; (c) attaching to each object code block information sufficient to recreate the clause from which that object code block was compiled, to create a clause execution frame; and (d) inserting each clause execution frame into a data structure which is pointed to by one of the procedure execution frame pointers.
Claim 8
Dependent Claim
13 words
The method of Claim 4, wherein the data structure is a linked list.
Claim 9
Dependent Claim
31 words
The method of Claim 4. wherein the procedure execution frame pointers correspond to subsets of clauses which are to be executed depending on the type of argument passed to the procedure.
Claim 10
Independent Claim
60 words
A method for compiling a PROLOG program. comprising the steps of: (a) translating source code statements into individual object code blocks; (b) appending to the object code blocks information sufficient to recreate the source code statements; and (c) linking the object code blocks and appended information into lists with object code blocks and appended information for related source code statements.
Claim 11
Independent Claim
60 words
A method for compiling a PROLOG program. comprising the steps of: (a) translating source code statements into individual object code blocks; (b) appending to the object code blocks information sufficient to recreate the source code statements; and (c) linking the object code blocks and appended information into lists with object code blocks and appended information for related source code statements.
Claim 12
Dependent Claim
105 words
The method of Claim 7, wherein step (c) comprises: (c.l) creating a procedure execution frame for each procedure defined by the source code statements, each procedure execution frame having a plurality of pointers, wherein each pointer points to a list of object code blocks having a common property: (c.2) determining which procedure execution frame corresponds to the procedure in which the source code statement belongs; (c.3) selecting a list of object code blocks pointed to by a pointer in the determined procedure execution frame which have a common property with the source code statement: and (c.4) inserting the object code block into the selected list.
Claim 13
Dependent Claim
23 words
The method of Claim 8. wherein the common property of steps (c.1) and (c.3) comprises the type of an argument passed to the-procedure.
Claim 14
Dependent Claim
123 words
10 . In a computer system for executing programs and having executable memory, the improvement comprising: a plurality of procedure execution frames having pointers and located within the executable memory; and a plurality of clause execution frames located within the executable memory and associated with said procedure execution frames, wherein each of said clause execution frames has pointers capable of pointing to other clause execution frames, and wherein each of said clause execution frames can be reached by following pointers starting from a procedure execution frame, wherein each of said clause execution frames contains machine executable code, and further wherein each of said clause execution frames contains code sufficient to enable reconstruction of source code from which the machine executable code was derived.
Claim 15
Dependent Claim
123 words
10 . In a computer system for executing programs and having executable memory, the improvement comprising: a plurality of procedure execution frames having pointers and located within the executable memory; and a plurality of clause execution frames located within the executable memory and associated with said procedure execution frames, wherein each of said clause execution frames has pointers capable of pointing to other clause execution frames, and wherein each of said clause execution frames can be reached by following pointers starting from a procedure execution frame, wherein each of said clause execution frames contains machine executable code, and further wherein each of said clause execution frames contains code sufficient to enable reconstruction of source code from which the machine executable code was derived.
Claim 16
Dependent Claim
34 words
The system of Claim 10. further comprising a mode of execution within said system for executing the source code reconstruction statements and placing a copy of recreated source code into a preselected data structure.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.