JPH07160494A - Correction device for input character string at coding time - Google Patents

Abstract

PURPOSE:To reduce misinput which is caused when a source program is coded. CONSTITUTION:In a storage device 2, the grammar of a language used to generate a source program, words which are prepared for the language, a character string which is inputted from an input part 31 so as to generate the source program, etc., are stored. A key word extraction part 11 extracts a word which meets grammatical conditions (e.g. function name) as a key word from the character string inputted from the input part 31 and a retrieval means 12 performs fuzzy retrieval in the storage device 2 to find words which are similar to the key word and words which match the key word. When only words which are similar to the key word is found by the retrieval means 12, a determining means 13 determines one of the found words as a correct word corresponding to the key word and an alteration means 14 substitutes the word which is judged by the determining means 13 to be correct for the key word in the source program that is being generated.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a device for correcting an input character string at the time of coding, which can reduce input errors occurring at the time of coding a source program.

[0002]

2. Description of the Related Art When a program is debugged, the fewer input mistakes that exist in the source program, the more efficient the debugging can be. However, conventionally, the created source program is input and compiled and debugged. When an error occurs in the process, if it can be corrected, it is only corrected (for example, JP-A-3-
No. 263129).

[0003]

As described above, conventionally, the correction is made only for the source program already created, and the operator checks the input error when coding the source program. Since it is performed under the responsibility of, the number of input errors existing in the source program increases, and as a result, there is a problem that debugging cannot be efficiently performed.

An object of the present invention is to provide an input character string correction device at the time of coding, which can reduce input errors occurring at the time of coding a source program.

[0005]

In order to achieve the above object, the present invention provides a grammar of a language used to create a source program, words prepared in the language, and Based on a predetermined grammar from a character string of the source program, a storage device that stores the created source program linked to the source program being created, and a character string input from the input unit. Keyword extraction means for extracting a word satisfying the condition of 1) on the basis of a grammar stored in the storage device, and using the extracted word as a keyword; and a word prepared in the language stored in the storage device, and From the created source program, a word matching the keyword extracted by the keyword extracting means and a similar word can be searched for, and a similar word can be searched for and match. When it is not possible to search, the search means for outputting the search result, the determining means for identifying one word in the search result output from the search means as a correct word corresponding to the keyword, and storing in the storage device Among the character strings in the source program being created, the word corresponding to the keyword is rewritten to the word specified by the determining means.

[0006]

When the character string is input from the input unit, the keyword extracting means extracts a keyword (for example, a function name) from the input character string, and the searching means is prepared according to the language stored in the storage device. Existing words or other source programs linked to the source program currently being created are searched for a word that matches the above keyword and a similar word.

When only the word similar to the keyword is found by the searching means, the determining means identifies one of the words as the correct word corresponding to the keyword and determines the character string corresponding to the keyword in the source program. Rewrite the word specified by the means.

[0008]

Embodiments of the present invention will now be described in detail with reference to the drawings.

FIG. 1 is a block diagram of an embodiment of the present invention, in which a data processing device 1 operated by program control is shown.
And a storage device 2 and an input / output device 3.

The storage device 2 stores a grammar of a language used to create a source program and a language knowledge storage unit 21 in which reserved words are stored, a library storage unit 22 in which function names of library functions are stored, and currently being created. Source program storage unit 23 that stores the source program of the above and other source programs linked with the source program currently being created
Have and.

The input / output device 3 is an input unit 3 such as a keyboard.
1 and an output unit 32 such as a display device.

The data processing device 1 includes a keyword extracting means 11, a searching means 12, a confirming means 13, and a changing means 1.
4 and.

Based on the grammar stored in the language knowledge storage unit 21, the keyword extraction unit 11 selects a word satisfying a predetermined grammatical condition from the character string input from the input unit 31 based on the grammar stored in the language knowledge storage unit 21. It has a function to extract and use as a keyword.

The search means 12 searches the language knowledge storage unit 21, the library storage unit 22, and the source program storage unit 23 to find a word similar to the keyword extracted by the keyword extraction unit 11 and a matching word,
When a similar word can be found and a matching word cannot be found, it has a function of outputting the found word as a search result.

The fixing means 13 has a function of specifying one of the words found by the searching means 12 as the correct word corresponding to the keyword.

The changing means 14 has a function of rewriting a character string corresponding to the keyword in the source program being created stored in the source program storage section 23 into a word specified by the searching means 12 and a screen of the output section 32. It has a function of rewriting the character string corresponding to the above-mentioned keyword in the source program displayed in (1) to the word specified by the searching means 12.

FIG. 2 is a flow chart showing a processing example of the keyword extracting means 11, FIG. 3 is a flow chart showing a processing example of the searching means 12, FIG. 4 is a flow chart showing a processing example of the confirming means 13, and FIG. It is a flow chart showing a processing example, and the operation of the present embodiment will be described below with reference to the drawings.

The character string input by the programmer from the input unit 31 to create the source program is displayed on the screen of the output unit 32 and stored in the source program storage unit 23 in the storage device 2. The above-mentioned character string is also added to the keyword extracting means 11 in the data processing device 1.

When the character string is input from the input unit 31, the keyword extracting means 11 determines the input character string based on the input character string and the grammar stored in the language knowledge storage unit 21, as shown in FIG. Words satisfying a specific grammatical condition are extracted as keywords from the sequence (step S1). Here, the grammatical condition of the word extracted as the keyword can be arbitrary, for example, a function name.

When the keyword extracting means 11 extracts the keyword (YES in step S2), the extracted keyword is passed to the searching means 12 (step S3), and thereafter,
The process returns to step S1.

The keyword extracting means 11 repeats the above-described processing until the input section 31 gives an instruction to end the input of the source program (YES in step S4).

The search means 12 is the keyword extraction means 11
When a keyword is passed from, a reserved word in the language knowledge storage unit 21, a function name in the library storage unit 22, and a source program currently being created in the source program storage unit 23 are linked as shown in FIG. An ambiguous search is performed by using another source program as a search target with the keyword as a key (step S11).

The fuzzy search referred to here means a process of searching for a word including a partial difference in the word comparison, in addition to the completely matched word. Partial differences include replacement (using the wrong character), dropout (there is a missing character), surplus (there is an extra character), before and after (the order of the characters is changed). Being) etc. It should be noted that in the present embodiment, words having up to two non-matching portions are searched.

The searching means 12 can find a word that exactly matches the keyword by the fuzzy search in step S11, that is, if the spelling of the keyword is correct (YES in both steps S12 and S13), and the word is completely matched with the keyword. If neither a matching word nor a partially different word could not be searched (NO in step S12), the confirmation unit 13 is notified that there is no search result (step S16).

Further, when the fuzzy search in step S11 allows the retrieval of only words that are partially different from the keyword (YES in step S12, N in step S13).
O) adds the mismatch count information to the searched word and passes it to the fixing means 13, and also passes the keyword to the fixing means 13.
(Steps S14, S15). Here, the mismatch count information is information indicating the number of mismatched parts between the searched word and keyword.

As shown in FIG. 4, when the decision means 13 is notified by the search means 12 that there is no search result (YES in step S21), the search result is not obtained on the screen of the output unit 32. Is displayed (step S2
2).

Further, when the word and the keyword to which the mismatch count information is added are sent from the search means 12 (NO in step S21), the word having the smallest mismatch count is selected from the sent words. Yes (step S23).

When only one word is selected in step S23 (NO in step S24), the determining means 13 passes the selected word and keyword to the changing means 14 (step S25).

If a plurality of words are selected in step S23 (YES in step S24), the determining means 13
Displays all the selected words as candidates for words to replace the keywords on the screen of the output unit 32 and displays the keywords on the screen of the output unit 32 (step S26).

When the plurality of words and keywords selected in step S23 are displayed on the screen of the output section 32, the programmer selects one of the words displayed as a candidate by, for example, matching the cursor. Give instructions.

When one of the candidates is designated (YES in step S27), the confirming means 13 passes the designated word and keyword to the changing means 14 (step S28).

When a keyword and a word to replace it are sent from the confirming means 13, the changing means 14 receives the relevant part of the source program currently being created stored in the source program storage section 23 as shown in FIG. Rewrite (keyword part) to the sent word (step S
31) Further, the display of the relevant part of the source program displayed on the screen of the output unit 32 is changed to the sent word (step S32).

Next, the specific operation of FIG. 1 will be described by taking the case of coding in C language as an example.

Now, it is assumed that a character string including the function funcTion () is input from the input unit 31.

The function funcT input from the input unit 31
The character string including ion () is added to the keyword extracting means 11. The character string is stored in the source program storage unit 23 and displayed on the screen of the output unit 32.

The keyword extracting means 11 uses funcTi
When a character string including on () is added, a word that meets a predetermined grammatical condition is extracted from the character string (FIG. 2, step S1).

Now, for example, if the predetermined grammatical condition is a function name, the keyword extracting means 11
Is the function name funcTion of the function funcTion ().
Will be extracted.

Function name funcTion as a keyword
When the keyword is extracted, the keyword extracting means 11 passes it to the searching means 12 (step S3).

The search means 12 is the keyword extraction means 11
When the function name funcTion is passed from as a keyword, a word similar to the keyword funcTion is searched (FIG. 3, step S11).

Now, for example, if the function name function is stored in the library storage unit 22, the search means 12 will search for the function name function as a word similar to the function name funcTion.

If only the function name function can be found as a word similar to the function name funcTion (YES in step S12 of FIG. 3, step S1
3 is NO), the search means 12 is the function name f obtained by the search.
The unmatched number information indicating that there is one unmatched point is added to the unction, and the unmatched number information is passed to the confirmation means 13.
The keyword funcTion () is passed to the confirmation means 13 (steps S14 and S15).

When the above-mentioned information is passed from the searching means 12, the determining means 13 selects the word having the smallest number of mismatches with the keyword funcTion, but in this case, only the function name function is sent. It will be selected (FIG. 4, step S23).

After that, the fixing means 13 determines the word function and the keyword funcTi selected in step S23.
and is passed to the changing means 14 (step S25).

The changing means 14 receives the word fu from the determining means 13.
When the nction and the keyword funcTion are passed, the keyword funcion in the source program stored in the source program storage unit 23 is rewritten to the word function sent from the fixing means 13 and displayed on the screen of the output unit 32. The keyword "funcTion" is changed to the word "function" sent from the determining means 13 (FIG. 5, step S3).
1, S32).

[0045]

As described above, according to the present invention, a word satisfying a predetermined grammatical condition is extracted as a keyword from the character string input from the input unit, and the source program Using the words prepared in the language used for creation and the created source program linked to the source program being created as the search range, search for words that match the keyword and similar words, and search for similar words. If only the correct word corresponding to the keyword is searched, the keyword is replaced with the searched word, so that it is possible to reduce typographical errors when coding the source program. As a result, there is an effect that the debugging work can be performed efficiently.

[Brief description of drawings]

FIG. 1 is a block diagram of an embodiment of the present invention.

FIG. 2 is a flowchart showing a processing example of a keyword extracting means 11.

FIG. 3 is a flowchart showing a processing example of a search means 12.

FIG. 4 is a flow chart showing an example of processing of a confirming means 13.

5 is a flowchart showing a processing example of a changing unit 14. FIG.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 ... Data processing apparatus 11 ... Keyword extraction means 12 ... Search means 13 ... Determining means 14 ... Change means 2 ... Storage device 21 ... Language knowledge storage part 22 ... Library storage part 23 ... Source program storage part 3 ... Input / output device 31 ... Input unit 32 ... Output unit

Claims (3)

[Claims] 1. A grammar of a language used to create a source program, a word prepared in the language, a character string of the source program being created input from an input unit, and a source program being created. A storage device that stores a created source program to be linked, and words that satisfy a predetermined grammatical condition among the character strings input from the input unit are stored in the storage device. Extracted by the keyword extraction means from keyword prepared means extracted based on the grammar and using the extracted words as keywords, and words prepared in the language stored in the storage device and the created source program. Search for a word that matches the keyword and a similar word, and if a similar word can be found and a matching word cannot be found, a search result is output. Means, a determining means for identifying one word in the search result output from the searching means as a correct word corresponding to the keyword, and a character string in the source program being created stored in the storage device. An input character string correction device at the time of coding, comprising: a changing unit that rewrites the word corresponding to the keyword to the word specified by the determining unit. 2. The determining means selects a word having the least number of inconsistencies with the keyword from the words in the search result output from the searching means, and when the selected word is one word, selects the word. A word is specified as a correct word corresponding to the keyword, and when a plurality of selected words are selected, the plurality of selected words are displayed as candidates on the display unit, and one word selected from the plurality of displayed candidates is selected. 2. The input character string correction device for coding according to claim 1, wherein is specified as a correct word corresponding to the keyword. 3. The input character string correction device for coding according to claim 2, wherein the keyword is a function name.