US4587632A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Lookahead stack oriented computer
Assignee: Nokia Bell Labs
•
Filing: 1980-05-27
•
Granted: 1986-05-06
•
Expires: 2000-05-27
Abstract
Abstract A computer architecture is disclosed which obtains the advantages of stack oriented machines from a programming viewpoint and, at the same time, obtains the hardware advantages of a multiple operand architecture from the hardware viewpoint. This is accomplished by circuitry (13) which accepts stack oriented reverse-polish instruction tokens from the memory (10) and, by using a lookahead technique (23), optimizes the generation of storage-to-storage type instructions which are then executed by the storage-to-storage hardware configuration (14).
Inventors
- 👤 David R. Ditzel
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 05:05
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/44
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
151 words
A stack oriented microprocessor computer system comprising a main memory (10) for storing programs comprising a plurality of reverse polish (i.e., postfix) stack oriented instruction tokens, a stack memory (33), and an instruction execution unit (14) characterized by an operand stack storage mechanism (20,21,22) for storing tokens received from said main memory and referring to operands, an operator storage mechanism (24) for storing tokens received from said main memory and referring to operators, at least one lookahead storage mechanism (23) for storing either an instruction token referring to an operator received from said main memory or an instruction token referring to an operand following an instruction token referring to an operator received from said main memory, and means (18 and 31) responsive to said storage mechanisms for optimizing storage accesses by dynamically combining a plurality of said operand tokens and said operator tokens for simultaneous execution by said instruction execution unit.
Claim 2
Dependent Claim
151 words
A stack oriented microprocessor computer system comprising a main memory (10) for storing programs comprising a plurality of reverse polish (i.e., postfix) stack oriented instruction tokens, a stack memory (33), and an instruction execution unit (14) characterized by an operand stack storage mechanism (20,21,22) for storing tokens received from said main memory and referring to operands, an operator storage mechanism (24) for storing tokens received from said main memory and referring to operators, at least one lookahead storage mechanism (23) for storing either an instruction token referring to an operator received from said main memory or an instruction token referring to an operand following an instruction token referring to an operator received from said main memory, and means (18 and 31) responsive to said storage mechanisms for optimizing storage accesses by dynamically combining a plurality of said operand tokens and said operator tokens for simultaneous execution by said instruction execution unit.
Claim 3
Dependent Claim
46 words
The stack oriented computer system according to claim 1 characterized in that said operand stack mechanism includes at least three storage registers (20,21,22), and a status circuit (26,27,28) is associated with each of said storage registers for indicating the empty-full status of the associated storage register.
Claim 4
Dependent Claim
34 words
The stack oriented computer system according to claim 1, said optimizing means being characterized by means (18 and 31) for generating multiple address storage-to-storage type of instructions from the contents of said storage mechanisms.
Claim 5
Dependent Claim
34 words
The stack oriented computer system according to claim 1, said optimizing means being characterized by means (18 and 31) for generating multiple address register-to-register type of instructions from the contents of said storage mechanisms.
Claim 6
Dependent Claim
24 words
The stack oriented computer system according to claim 1 characterized in that each of said storage mechanisms comprises at least one storage register (20-24).
Claim 7
Dependent Claim
39 words
The stack oriented computer system according to claim 1 characterized in that each of said operand storage mechanisms comprises means for storing either an operand value or a storage location at which the value of said operand is stored.
Claim 8
Dependent Claim
59 words
The stack oriented computer system according to claim 3 or 4 characterized in that said instruction generating means (31) is enabled by the presence of a storage operator token in said operator storage mechanism (24) or by the presence of a nonstorage operator token in said operator storage mechanism (24) and an instruction token in said lookahead register (23).
Claim 9
Independent Claim
89 words
The method of executing reverse-polish computer instruction sequences stored in the memory of a computer characterized by the steps of (1) fetching reverse-polish instructions from said memory (12), (2) placing operand instructions in a first-in, first-out storage register (20,21,22,33), (3) placing operator instructions in a separate operator storage register (24), (4) placing at least one instruction following an operator instruction in a lookahead storage register (23), and (5) utilizing the contents of said storage registers to dynamically generate nonredundant, multiple address, optimized storage-to-storage or register-to-register instructions (18 or 31).
Claim 10
Independent Claim
89 words
The method of executing reverse-polish computer instruction sequences stored in the memory of a computer characterized by the steps of (1) fetching reverse-polish instructions from said memory (12), (2) placing operand instructions in a first-in, first-out storage register (20,21,22,33), (3) placing operator instructions in a separate operator storage register (24), (4) placing at least one instruction following an operator instruction in a lookahead storage register (23), and (5) utilizing the contents of said storage registers to dynamically generate nonredundant, multiple address, optimized storage-to-storage or register-to-register instructions (18 or 31).
Claim 11
Dependent Claim
43 words
The method according to claim 8 further characterized by the steps of (6) executing said storage-to-storage or register-to-register instructions, and (7) selectively returning the results of the execution of said instructions to said memory, to said first-in, first-out storage register, or to both.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-05-05 | 1989-11-04 | 1990-05-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-05-05 | 1993-11-04 | 1994-05-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-05-05 | 1997-11-04 | 1998-05-06 | $7700.00 | Window Closed / Lapsed |