JPH04186433A - Rapid pattern searching mechanism based on keyword register system - Google Patents

Abstract

PURPOSE:To attain rapid pattern search by omitting processing for comparing and retrieving source programs stored in a real memory successively from its head at the time of searching a pattern. CONSTITUTION:This rapid pattern searching mechanism is constituted of a keyword detecting mechanism 1, a keyword table forming mechanism 2, a real memory storing position table forming mechanism 3, a search pattern keyword extracting mechanism 4, a control table retrieving mechanism 5, and so on. In the case of inputting an LISP source program 15, the storing position of the real memory 10 is registered and managed in a keyword included in a pattern to be searched in the future and the real memory position of a search pattern is found out from the keyword managed and registered at the time of searching the pattern. Thereby a processing time required for successively searching source files in the real memory 10 from its head can be omitted. Thus rapid pattern search can be attained.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to language processing, and particularly to a technique for speeding up pattern search processing in a LISP language processing system.

[Prior Art] Conventionally, pattern search processing in this type of LISP language processing system has been carried out by sequentially comparing a search pattern with a search pattern from the beginning of a search program stored in a real memory.

FIG. 5 is a schematic diagram showing conventional source file input processing and pattern search processing. 'The source program input is input from the LISP source program file 15 by the LI Sr program input mechanism 11, and is stored in the real memory area 10 by the real memory area storage device $12.

The pattern search process is executed using the search pattern input mechanism 1.
3, the pattern to be searched is input (CCCDDD YYY in FIG. 5), and the search pattern detection mechanism 1
4, the source file in the real memory area 10 is searched by sequentially comparing it with the search pattern from the beginning.

[Problems to be Solved by the Invention] In the conventional method described above, the source program in the real memory area must be compared and searched from the beginning with the search pattern every time a search process is performed. Therefore, the larger the capacity of the source program, the more
When searching for a pattern expressed by multiple nests of parentheses, such as in the SP language, there is a drawback that the more parentheses there are, the longer the pattern search takes.

LObject of the Invention J Therefore, an object of the present invention is to register and manage the storage location in real memory of a keyword included in a pattern to be searched in the future when inputting a LISP source program.
During a pattern search, the location of the search pattern in real memory is determined from the keywords that are managed and registered, and the search pattern is searched sequentially from the beginning of the source file in real memory, as in the conventional method. The aim is to realize this.

(Means for Solving the Problems) As a means for solving the above-mentioned problems, the present invention, in pattern search processing of a language processing device, inputs a source program using part or all of the pattern to be searched as a keyword. a keyword registration mechanism that is registered in advance; a keyword detection mechanism that checks whether a keyword registered by the keyword registration mechanism is input when inputting the source program; A keyword table creation mechanism that registers keywords in the management table, a real memory storage location table creation mechanism that manages where detected keywords are stored in the real memory area, and a keyword table creation mechanism that registers detected keywords in the real memory area. a search pattern keyword extraction mechanism that detects included keywords, and based on the detected keywords, refers to the keyword management table and the real memory storage location table,
The present invention provides a high-speed pattern search mechanism using a keyword registration method, characterized by comprising: a management table search mechanism for searching the position of a pattern to be searched in a real memory area;

[Example] (1) The configuration of the present invention will be explained with reference to the drawings.

FIG. 1 is an embodiment showing the configuration and processing flow of the present invention.

The configuration and processing are broadly divided into three parts, each of which has a flow: keyword registration processing, source program input processing, and pattern search processing.

In the high-speed pattern search mechanism using the keyword registration method of the present invention, in addition to the configuration of the conventional example shown in FIG.
and a keyword detection mechanism 1 for detecting keywords registered in the keyword registration file 7 when inputting a LISP source program. A keyword table creation mechanism 2 that registers detected keywords in a keyword management table 8; a real memory storage location table creation mechanism 3 that outputs the location where a LISP source program is stored in a real memory area 10 to a real memory storage location management table 9; ,and,
A search pattern keyword extraction mechanism 4 extracts keywords in a search target pattern when performing a pattern search, and a real memory storage location management table determines where the search target keyword is located in the real memory area from the keyword management table 8. The management table search mechanism 5 includes a management table search mechanism 5 that searches by tracing 9.

(2) Next, the operation of the present invention will be explained with reference to the drawings.

FIG. 2 shows and describes an example of the contents of files and tables that use the flow of keyword registration processing.

First, the registration process in the keyword registration file 7 is performed in advance before inputting the LISP source program by the keyword registration mechanism 6 shown in FIG. Here, the content to be registered as a keyword in the keyword registration file 7 is as follows.
These are basic function names and standard function names in the LISP language, and arbitrary names according to the needs of the user. In this embodiment, arbitrary keywords such as AAA and CCC are registered.

Next, FIG. 3 shows an embodiment of source program input processing according to the present invention.

First, the source program is read from the LISP source program file 15 by the LISP7'e+gram input mechanism 11 according to the record length of the real memory area IO to be stored (step 21).

At this time, the keyword detection mechanism 1 checks whether a keyword registered in advance in the keyword registration file 7 exists in the input unit (here, in the roux code) (step 22). As a result of this check, keywords that are found to exist within the input unit are registered in the keyword management table 8 by the keyword table creation mechanism 2 (step 23).

The keyword management table 8 manages pairs of detected keywords and addresses of a real memory storage location management table 9 for managing the location on the real memory where the keywords are stored.

For example, in FIG. 3, "The storage location management table 9 of the keyword AAA on the real memory is at the address
It starts with 0'. ” is expressed as follows.

The registered keyword is stored in the real memory area 10 by the real memory area storage mechanism 12 (step 24).

At this time, the real memory storage location table creation mechanism 3 creates a real memory storage location management table 9 for each keyword.
is created, and the position of each keyword on real memory is managed (step 25).

For example, in FIG. 3, "The first storage position of the keyword AAA in the real memory is It is registered in the management table 9.

The above process is repeated for all source programs until the last input, and the input process ends (step 26).
.

FIG. 4 describes an example of pattern search processing together with the contents of the table used.

First, the search pattern input mechanism 13 selects a search pattern (CCCDDD) as an example.
YYY) and a search command are input (step 31
).

The search pattern keyword extraction mechanism 4 determines whether the input search pattern includes a keyword that has already been registered (step 32).

As a result, if it is found that the registered keyword (cCC in this example) is included, the management table search mechanism 5
The position x'0100110' of the real memory management table 9 is obtained from the keyword management table 8, and the position x'0 of the keyword CCC(7) on the real memory is obtained from the table 9.
201014' is determined (step 33).

Next, a search pattern is extracted from the position of the keyword on the real memory, and is compared with the target search pattern by the search pattern detection mechanism 14 (step 35).

Here, if the pattern on the real memory matches the searched pattern, the real memory location is registered (step 36).

If there is no match, the real memory storage location management table 9 for the keyword CCC is searched again, and the above process is repeated until the management information in the table disappears (steps 37 and 38).

[Effects of the Invention] As described above, according to the present invention, when searching for a pattern, it is possible to omit the process of sequentially comparing and searching from the beginning of the source program on the real memory. Therefore, even if the source program size increases, especially LIS
In the P language, even if the pattern to be searched includes multiple parentheses, the pattern search time can be shortened, and as a result, high-speed pattern search is possible.

[Brief explanation of the drawing]

FIG. 1 is a flow chart showing an outline of the configuration and processing of an embodiment of the present invention. FIG. 2 is a flowchart showing an embodiment of the keyword registration process of the present invention. FIG. 3 is a flowchart showing an embodiment of the source program input process of the present invention. FIG. 4 is a flowchart showing an embodiment of the pattern search process of the present invention. FIG. 5 is a flowchart of conventional source program input processing and pattern search processing. l...Keyword detection mechanism. 2... Keyword table creation mechanism, 3... Real memory storage position table creation mechanism, 4... Search pattern keyword extraction mechanism. 5.φ and management table search mechanism. 6...Keyword registration mechanism, 7...Keyword registration mechanism, 811 meeting-keyword management table. 9.--Real memory storage location management table, 10.Conflict-
Real memory area, 11...LISP program input mechanism, 12--Real memory area storage mechanism, 13φ search pattern input mechanism, 14--Search pattern detection mechanism,

Claims (1)

[Claims] In the pattern search process of the language processing device, part or all of the pattern to be searched is used as a keyword,
A keyword registration mechanism that registers a source program before inputting it; a keyword detection mechanism that checks whether a keyword registered by the keyword registration mechanism is input when inputting the source program; and when a keyword is detected. a keyword table creation mechanism that registers the keyword in a keyword management table; a real memory storage location table creation mechanism that manages where the detected keyword is stored in the real memory area; a search pattern keyword extraction mechanism that detects keywords included in the search target pattern; and based on the detected keywords, refer to the keyword management table and the real memory storage location table;
A high-speed pattern search mechanism using a keyword registration method, comprising: a management table search mechanism for searching the position of a pattern to be searched in a real memory area;