JP2636720B2 - Input character string correction device for coding - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

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

[0002]

2. Description of the Related Art When a program is debugged, debugging can be performed more efficiently as the number of input errors existing in the source program is smaller. However, conventionally, compilation and debugging are performed by inputting a created source program. And if an error occurs in the process, it is only necessary to correct it if possible (for example, see
263129).

[0003]

As described above, conventionally, only correction has been performed for a source program that has already been created, and checking for input errors when coding the source program is performed by the operator. Therefore, there is a problem that the number of input errors existing in the source program increases, and as a result, debugging cannot be performed efficiently.

An object of the present invention is to provide an input character string correction apparatus at the time of coding that can reduce input errors that occur at the time of coding a source program.

[0005]

According to the present invention, in order to achieve the above object, the grammar of a language used for creating a source program, words prepared in the language, and a grammar being created input from an input unit are input. A storage device for storing a character string of a source program, a created source program linked to the source program being created, and a character string input from the input unit, wherein a predetermined grammatical A keyword that is extracted based on the grammar stored in the storage device and that uses the extracted word as a keyword, and a word prepared in the language stored in the storage device. The source program being created and
From the created source program to be linked, a word that matches the keyword extracted by the keyword extracting means and a similar word can be searched, and a similar word can be searched.
A search unit that outputs a search result when a matching word cannot be searched; a determination unit that specifies one word in the search result output from the search unit as a correct word corresponding to the keyword; among the string in the source program of the work <br/> Naruchu stored in the storage device, a word corresponding to the keyword, which has a changing means for rewriting the word in which the determining means has identified is there.

[0006]

When a character string is input from an input unit, a keyword extracting means extracts a keyword (for example, a function name) from the input character string, and a search means is prepared in a language stored in a storage device. A search is made for words that are present and other source programs linked to the source program currently being created, to find words that match the keywords and similar words.

When only words similar to the keyword are found by the search means, the determination means specifies one of the words as a correct word corresponding to the keyword, and determines a character string corresponding to the keyword in the source program. Rewrite with the word specified by the means.

[0008]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, embodiments of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a block diagram of an embodiment of the present invention.
, A storage device 2 and an input / output device 3.

The storage device 2 includes a language knowledge storage unit 21 for storing a grammar and a reserved word of a language used for creating a source program, a library storage unit 22 for storing a function name of a library function, Source program storage unit 23 in which a source program of the present invention and another source program linked with the source program currently being created are stored.
And

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

The data processing apparatus 1 includes a keyword extracting unit 11, a searching unit 12, a determining unit 13, and a changing unit 1.
And 4.

The keyword extracting means 11 extracts words satisfying predetermined grammatical conditions from the character strings input from the input unit 31 based on the grammar stored in the linguistic knowledge storage unit 21. It has a function to extract and use as keywords.

The search means 12 searches the linguistic knowledge storage section 21, the library storage section 22, and the source program storage section 23 to find words similar and coincident with the keywords extracted by the keyword extraction means 11,
When a similar word cannot be found and a matching word cannot be found, a function of outputting the found word as a search result is provided.

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

The changing unit 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 unit 23 with the word specified by the search unit 12 and a screen of the output unit 32. Has a function of rewriting a character string corresponding to the keyword in the source program displayed in the search program 12 with the word specified by the search means 12.

FIG. 2 is a flowchart showing a processing example of the keyword extracting means 11, FIG. 3 is a flowchart showing a processing example of the searching means 12, FIG. 4 is a flowchart showing a processing example of the deciding means 13, and FIG. 5 is a flowchart illustrating a processing example, and the operation of the present exemplary embodiment will be described below with reference to the drawings.

A character string input by the programmer from the input unit 31 to create a 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 character string described above is also added to the keyword extracting means 11 in the data processing device 1.

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

When the keyword is extracted (step S2: YES), the keyword extracting unit 11 passes the extracted keyword to the search unit 12 (step S3).
It returns to the process of step S1.

The keyword extracting means 11 repeats the above processing until the input section 31 instructs the end of the input of the source program (YES in step S4).

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

The term "ambiguous search" as used herein means a process of searching for a word including a partial difference in addition to a completely matching word in the comparison of words. Also, the partial differences are substitution (the wrong character is used), omission (there is a missing character), surplus (there is an extra character), and before and after (the order of the characters is changed. Be). In the present embodiment, the search is performed for words having up to two unmatched portions.

The search means 12 searches for a word that completely matches the keyword by the fuzzy search in step S11, that is, when the spelling of the keyword is correct (both steps S12 and S13 are YES) and when the keyword is completely matched. If neither a matching word nor a partially different word can be searched (step S12: NO), the determination unit 13 is notified that there is no search result (step S16).

Also, when only words that differ only in part from the keyword can be searched by the fuzzy search in step S11 (YES in step S12, N in step S13)
O) adds the mismatched number information to the searched word and passes it to the deciding means 13 and passes the keyword to the deciding means 13
(Steps S14 and S15). Here, the mismatch number information is information indicating the number of mismatched portions between the searched word and the keyword.

As shown in FIG. 4, when the determination unit 13 is notified that there is no search result from the search unit 12 (YES in step S21), the determination unit 13 determines that the search result is not obtained on the screen of the output unit 32. (Step S2)
2).

When a word and a keyword to which the information on the number of inconsistencies is added are sent from the search means 12 (NO in step S21), a word having the least number of inconsistencies is selected from the sent words. Yes (step S23).

If only one word is selected in step S23 (NO in step S24), the determination means 13 passes the selected word and keyword to the change means 14 (step S25).

When a plurality of words are selected in step S23 (step S24 is YES),
Displays the selected words on the screen of the output unit 32 as candidates for replacing all the words with the keywords, 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 unit 32, the programmer places one of the words displayed as candidates, for example, by moving a cursor or the like. To instruct.

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

When the keyword and the word to be replaced with the keyword are sent from the determining unit 13, the changing unit 14 changes the corresponding part of the currently created source program stored in the source program storage unit 23 as shown in FIG. (Keyword part) is rewritten to the sent word (step S
31) Further, the display of the corresponding 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 as an example the case of coding in C language.

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 containing 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 determines whether the funcTi
When a character string containing on () is added, a word that meets predetermined grammatical conditions is extracted from the character string (FIG. 2, step S1).

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
Is extracted, the keyword extracting means 11 passes it to the searching means 12 (step S3).

The search means 12 includes a keyword extracting means 11
When the function name funcTion is passed as a keyword from, 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 is found as a word similar to the function name funcTion (FIG. 3, step S12 is YES, step S1
3 is NO), the search means 12 searches the function name f obtained by the search.
While adding unmatched number information indicating that there is only one unmatched portion to the union, the unmatched number information is passed to the determination means 13 and
The keyword funcTion () is passed to the determination means 13 (steps S14 and S15).

When the above-mentioned information is passed from the search means 12, the determination means 13 selects the word having the least number of mismatches with the keyword funcTion. In this case, since only the function name function has been sent, It will be selected (FIG. 4, step S23).

Thereafter, the deciding means 13 sets the word function and the keyword funcTi selected in step S23.
and "on" to the changing means 14 (step S25).

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

[0045]

As described above, according to the present invention, a word that satisfies a predetermined grammatical condition is extracted as a keyword from a character string input from an input unit. Search for words that match the keyword and similar words, using the words prepared in the language used for the creation and the created source program linked to the source program being created as a search range, and search for similar words When only the word is searched, that is, when the correct word corresponding to the keyword is searched, the keyword is replaced with the searched word. Therefore, input errors that occur when coding the source program can be reduced. As a result, there is an effect that the debugging operation can be performed efficiently.

[Brief description of the 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 illustrating a processing example of a search unit 12;

FIG. 4 is a flowchart showing a processing example of a determination unit 13;

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

[Explanation of symbols]

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

Claims (3)

(57) [Claims] 1. A grammar of a language used for creating a source program, words prepared in the language, a character string of a 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 a word that satisfies a predetermined grammatical condition is stored in the storage device from a character string input from the input unit. Keyword extraction means for extracting the extracted words based on the grammar and using the extracted words as keywords, words linked to the words prepared in the language stored in the storage device and the source program being created
The created source program is searched for a word that matches the keyword extracted by the keyword extracting means and a similar word, and when a similar word can be searched, and a matching word cannot be searched, the search result is changed. search means for outputting, one word in the output search results from said search means, and determining means for identifying the correct word corresponding to the keyword, in the creation in the source program stored in the storage device An input character string correction device at the time of coding, comprising: a change unit that rewrites a word corresponding to the keyword to a word specified by the determination unit in the character string. 2. The method according to claim 1, wherein the determining unit selects a word having the least number of mismatches with the keyword from the words in the search result output from the searching unit, and when the selected word is one, the word is selected. A word is specified as a correct word corresponding to the keyword, and when there are a plurality of selected words, the plurality of selected words are displayed as candidates on a display unit, and a selected one of the displayed plurality of candidates is displayed. 2. The apparatus according to claim 1, wherein the character string is specified as a correct word corresponding to the keyword. 3. The apparatus according to claim 2, wherein the keyword is a function name.