Data processing means

• US 3,388,381 A
• Filed: 12/31/1962
• Issued: 06/11/1968
• Est. Priority Date: 12/31/1962
• Status: Expired due to Term

• Current Assignee: Harry J. Gray Jr, Noah S. Prywes, Samuel Litwin
• Original Assignee: Harry J. Gray Jr, Noah S. Prywes, Samuel Litwin
• Inventors: Prywes, Noah S., Litwin, Samuel, Gray, Harry J. Jr.
• Application Number:
  US04/248,825
• Time in Patent Office: 1,989 Days
• US Class Current: 1/1
• CPC Class Codes: G06F 15/78 comprising a single central processing unit
• CPC Class Codes: G06F 15/8038 Associative processors
• CPC Class Codes: G06F 16/9027 Trees
• CPC Class Codes: G06F 9/22 Microcontrol or microprogram arrangements
• CPC Class Codes: G06F 9/4484 Executing subprograms
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

Claims

2. AUTOMATIC PROGRAMMING MEANS, BASED ON THE INTERPRETIVE MODE, COMPRISING A PLURALITY OF NEW DATA INPUTS HAVING DATA AND ASSOCIATIVE WORDS ORGANIZED INTO ITEMS, THE ASSOCIATIVE WORDS COMPRISING A DESCRIPTOR AND BLANK SPACES FOR THE ADDRESSES, SUCH DESCRIPTORS BEING IN NATURAL LANGUAGE, SAID NEW DATA INPUT INCLUDING AUTOMATIC MEANS FOR THE ASSIGNMENT OF MACHINE CODES FOR THE CORRESPONDING DESCRIPTORS, AND FURTHER INCLUDING BLANKS WHERE LINKING ADDRESSES ARE REQUIRED, A PSEUDO-LANGUAGE INPUT OF A PLURALITY OF PROGRAMS DEFINING NEW WORDS, EACH PROGRAM HAVING A PLURALITY OF INSTRUCTION ITEMS AND FURTHER INCLUDING BLANKS WHERE LINKING ADDRESSES ARE REQUIRED, SELECTED PROGRAMS BEING RECURSIVE, A COMMAND-WORD AND OPERAND PSEUDO-LANGUAGE PROGRAM INPUT COMPRISING A PLURALITY OF COMMAND WORDS EACH ACCOMPANIED BY AT LEAST ONE OPERAND, THE COMMAND WORDS EACH BEING A WORD IN THE VOCABULARY OF THE PSEUDO-LANGUAGE AND THE NAMES OF OPERANDS EACH BEING WORDS IN THE VOCABULARY OF THE DESCRIPTORS, TREE GROWING PROGRAMS HAVING DECODING MEANS FOR TRANSLATING A NAME INTO A STORAGE LOCATION, MEANS FOR TRANSMITTING SAID NEW DATA INPUT AND SAID PSEUDO-LANGUAGE INPUT TO SAID TREE GROWING PROGRAMS, AUTOMATIC MEMORY SPACE ASSIGNMENT MEANS INCLUDING A SYNCHRONIZER FOR PROVIDING LINKING ADDRESSES, SAID SPACE ASSIGNMENT MEANS BEING FED BY SAID TREE GROWING PROGRAM AND FURTHER INCLUDING MEANS FOR INSERTING ADDRESSES IN SUCH BLANKS, AN EXECUTIVE PROGRAM COUPLED TO SAID COMMAND WORD AND OPERAND PSEUDO-LANGUAGE INPUT BY MEANS FOR SELECTING SENTENCES SEQUENTIALLY FROM SAID PROGRAM, SAID EXECUTIVE PROGRAM INCLUDING MEANS FOR SEPARATING THE COMMAND FROM THE OPERAND NAMES, MEANS FOR INITIATING THE RETRIEVAL AND EXECUTION OF A PROGRAM CORRESPONDING TO THE COMMAND, AND MEANS FOR INSERTING THE NAMES OF THE OPERANDS IN THE PROGRAM, AND AN ASSOCIATIVE MEMORY FED BY SAID AUTOMATIC MEMORY SPACE ASSIGNMENT MEANS AND SAID EXECUTIVE PROGRAM, AND IN TURN FEEDING SAID EXECUTIVE PROGRAM, SAID ASSOCIATIVE MEMORY COMPRISING AT LEAST ONE DATA TREE COUPLED TO SAID AUTOMATIC MEMORY SPACE ASSIGNMENT MEANS AND FEEDING AT LEAST ONE MULTI-ASSOCIATION AREA, AT LEAST ONE PROGRAM TREE COUPLED TO SAID AUTOMATIC MEMORY SPACE ASSIGNMENT MEANS AND SAID EXECUTIVE PROGRAM AND FEEDING AT LEAST ONE MULTI-ASSOCIATION AREA, SAID LAST-NAMED MULTI-ASSOCIATION AREA BEING COUPLED TO SAID EXECUTIVE PROGRAM.