| 摘要 |
PURPOSE:To perform the tree searching operation at a high speed in a logical processing system that can detect the searching failure of solution at a high speed, by deciding whether or not the searching conditions are included in an enable solution, i.e., a gathering of value that can be solutions by searching at each node of an and-or tree obtained from a program sentence. CONSTITUTION:A character string to be searched is stored in a main memory 32 together with zero added to the end of said character string. The information on the gathering of character strings to be searched is stored in a node value field 12 and a master node identifier field 13 of an associative memory 1 and an output memory 2 after conversion into the value of a tree structure table. Then zero is set to a searching register 4 with the single head character of the searched character string set to a searching register 3 respectively. As a result, he memory 1 works and a node identifier of the coincident node is obtained in an output register 5. Then the next searching character string is checked and it is decided that the contents of the register 5 are equal to the desired character string identifier as long as the value of said next searching character string is equal to zero. While the contents of the register 5 are shifted to the register 4 if the value of said character string not equal to zero. Then the next searching characters are set to the register 3. These processes are repeated.
|
