JPH07261995A - Source program correction device - Google Patents

Abstract

PURPOSE:To correct a source program by using correction image described in a language different from the description language, to preserve images before and after the correction as a history and to restore the original source program. CONSTITUTION:Storage means 7-1 to 7-n hold rules for converting the correction image described in a prescribed correction description language into the description language of the source program. At the time of correcting the source program in the storage means 5, when correction information including the specification of a correction part, the correction image to be applied to the correction part and the specification of the correction description language used for the description of the correction image is inputted from the storage means 6, a program correction part 1 converts the correction image into the description language of the source program by using rules in the pertinent storage means 7-1 to 7-n, corrects a specified correction part of the source program by the converted correction image and outputs the image before and after the correction of the correction part to the storage means 8.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a source program modifying device, and more particularly to a source program modifying device capable of modifying a source program in a language different from the description language of the source program to be modified.

[0002]

2. Description of the Related Art Conventionally, a language (programming language)
When a part of the source program described in 1 is modified, the modification content is described in the same language, and this description replaces the original description of the modified part.

[0003]

By the way, when a part of the source program is to be modified, the logic after the modification is first considered and the source statement for realizing the logic is described. Since the logic after modification can be considered without depending on the language, it is not necessary to be familiar with the language of the source program to be modified. You need to understand the description language. Therefore, even if a person who understands a certain type of language but is not familiar with the description language of the source program to be modified understands what kind of logic should be modified, Since it is not easy to express the logic in the description language of the source program, the modification work may not be progressed.

The present invention has been proposed in view of the above circumstances, and an object thereof is to make it possible to modify a source program by using a modification image described in another language different from its description language. is there.

As a conventional technique related to the present invention,
The technique found in Japanese Patent Laid-Open No. 4-286029, namely,
There is a converter that converts a source program written in a certain language into a source program written in a different language. By using such a converter, it is possible to convert a modified image in which the logic of the modified portion of the source program is written in the operator's favorite language into a modified image written in the language of the source program. Therefore, the modification work of the source program can be completed, but the modification work is complicated because it is necessary to separately perform the operation of the converter and the modification work of the source program.

Therefore, another object of the present invention is to provide a source program modification device which does not require the user to carry out the language conversion work as a separate work.

Furthermore, since the correction image before the language conversion is created by the user himself, an incorrect correction image may be created due to misunderstanding of logic, etc. In this state, the correction work is advanced to correct the source program. This will result in the wrong source program. Since such an error is often found at a later date, it is difficult to restore the original program if the original program before correction is erased at that time.

Therefore, a further object of the present invention is to provide a source having a function of automatically accumulating a modification history so that the source program can be restored to its original state even if the source program before modification does not exist. To provide a program correction device.

[0009]

In order to achieve the above-mentioned object, the present invention describes a source program storing means for storing a source program to be modified, and a modification description language for each different modification description language. Conversion rule storage means for storing a rule for converting the corrected image into the description language of the source program, correction history storage means for storing a correction history, designation of a correction point of the source program, and application to the correction point. Correction information including a correction image to be corrected and a designation of a correction description language used for description of the correction image is input, and the correction image is stored in conversion rule storage means corresponding to the correction description language used for the description. Is converted into the description language of the source program by using the rules described above, and the designated correction point of the source program is specified in the converted image after the conversion. With positive to, and a program correcting section for outputting an image before and after correction of the corrected portion to the modification history storage means.

The present invention also employs the following configurations.

A simple mistake (eg EN
If the source language cannot be converted into the description language of the source program due to the existence of a mistake such as the description of D as EMD), the mistake is corrected by an interactive method to proceed with the source program correction work. For the purpose of enabling the above, the program correction section displays a correction image that cannot be language-converted according to the rule on a display device to prompt an instruction, and re-corrects it after the displayed correction image is corrected. When the conversion is instructed, the language conversion is performed on the corrected image after correction.

By using the images before and after the correction stored in the correction history storage means, it is possible to restore the original program to the state before the correction by hand, but it is possible to do it automatically. For this purpose, a program restoration unit is provided for inputting the revision history stored in the revision history storage means and restoring the source program in the source program storage means to the state before the revision.

[0013]

In the source program modifying device of the present invention,
The source program storage means holds the source program to be corrected, and the conversion rule storage means converts, for each different correction description language, a correction image described in the correction description language into the description language of the source program. A rule which holds rules and which includes, from the outside when the source program is modified, the designation of the portion of the source program to be modified, the modification image to be applied to this modification portion, and the specification language of the modification description used to describe this modification image. When the information is input, the program correction unit converts the correction image into the description language of the source program using the rule in the conversion rule storage means corresponding to the correction description language used for the description, and this conversion is performed. In the later modification image, the specified modification part of the source program is modified, and the image before and after the modification part is modified. Outputs the stage in the modification history storage means.

[0014]

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

Referring to FIG. 1, an embodiment of a source program modifying device of the present invention includes a processor 4 and a source program storing means 5, a correction information storing means 6, and a plurality of source information storing means 6 connected to the processor 4. Conversion rule storage means 7-1 to 7-
n, history information storage means 8 and user terminal 9.

The source program storing means 5, the correction information storing means 6, the conversion rule storing means 7-1 to 7-n and the history information storing means 8 are composed of, for example, a magnetic disk device, and the source program storing means 5 is a correction target. The modification information storage means 6 stores modification information including a modification image used for modifying the source program. Further, the conversion rule storage means 7-1 to 7
-N is provided for each different predetermined modification description language, and each converts a modification image described in a certain modification description language into the description language of the source program stored in the source program storage means 5. I remember the rules. Further, the correction history storage means 8 is prepared to store a correction history including images before and after the correction of the correction portion of the source program corrected by the processing device 4.

The user terminal 9 is an input device such as a keyboard 9a for inputting various instructions and data to the processing device 4, and a display device for displaying information notified from the processing device 4 to the user. For example, a CRT 9b is provided.

The processing device 4 is a device for executing the correction and restoration of the source program in accordance with the instruction from the user terminal 9, and includes a program correction section 1, a program restoration section 2 and a work area 3.

The program correction section 1 is for correcting the source program according to the correction image, and comprises a correction control means 11, a language conversion means 12, a correction means 13 and a correction history creation means 14. The program restoration unit 2 is for restoring the once-corrected source program to the original state, and includes a restoration control unit 21 and a restoration unit 22. The work area 3 is an area that can be referred to and updated by both the program restoration unit 2 and the program correction unit 1, and is used for temporarily storing various information when the original program is corrected and restored.

FIG. 2 shows an example of the source program stored in the source program storage means 5. The source program of this example is written in the language COBOL / S, and has a program body 52 including a source line (text) as shown in FIG. The name of this source program is A, its description language is COBOL / S, and its version is 0, that is, management information 51 indicating that it is the source program created first is added.

FIG. 3 shows an example of the correction information stored in the correction information storage means 6. The modification information in this example is management information 61 indicating the description language of the modification image of the modification information.
And a correction image 63, and the correction image 63 is added with information 62 of a correction portion to which the correction image is applied. The correction image 63 of this example is created by an operator for correction of the line number 0130 to the line number 0200 of the source program body 52 shown in FIG. 2, and is written in the language COBOL74. , Line number 0130 to line number 0170, which is a total of five lines of text. When two or more correction images are used, the correction image information and the set of correction images are sequentially stored after the correction image 63.

FIG. 4 shows an example of the contents of the conversion rule storage means 7-1. This conversion rule storage means 7-1 is a COBOL
A rule part 71 including a plurality of rules R1, R2, ... For converting the modified image described in S74 into COBOL / S, and a reserved word list 72 of COBOL74 are included. Each rule R1, R2, ... Is IF (conditional part) THE
The format is N (execution part), and the text that matches the condition part indicates that the text should be converted into the format shown in the execution part. Note that # appearing in the condition part and the execution part indicates an arbitrary user word string. The conversion rule storage unit 7-n and the like other than the conversion rule storage unit 7-1 also have the same configuration, but the reserved word list and the contents of each rule differ depending on the type of language conversion that it handles. That is, the language X is COBO
The conversion rule storage means for converting to L / S includes a reserved word list of language X and a plurality of rules for converting a modified image described in language X into COBOL / S.

In this embodiment, since it is premised that the program to be modified is written in COBOL / S, all the conversion rules are for converting the modified image into COBOL / S. However, when the program to be modified is a language other than COBOL / S, a rule is prepared for converting the modified image into the description language of the source program to be modified.

Next, the operation of the source program modifying device of this embodiment having the above-described structure will be described. First of all,
The operation when modifying the source program shown in FIG. 2 will be described with reference to the case where the source program shown in FIG. 2 is modified by the modification information shown in FIG.

When the operator designates the source program name A to be corrected and instructs the start of the correction from the keyboard 9a of the user terminal 9, the program correction unit 1 of the processing device 4 is executed.
The correction control means 11 in 1 starts the operation.

As shown in the flow chart of FIG. 5, the correction control means 11 first reads the correction information storage means 6 from FIG.
Input the management information 61 shown in, and the description language is CO
It is identified as BOL74 (S1). Next, the source program shown in FIG. 2 having the designated source program name A is input from the source program storage means 5 and developed in the work area 3 (S2). Next, the correction history storage means 8 is searched by using the program name A and version 0 in the management information 51 of FIG. 2 as a key, and the correction history corresponding to the source program of this time is expanded in the work area 3 (S3).

In this case, since the version of the source program to be modified is 0, it has never been modified. In this case, only the record of the source program name A and its version 0 as shown in FIG. 6A is registered in the correction history storage means 8 when the source program is registered in the source program storage means 5, Accordingly, the contents of the next version, that is, the contents of version 1 are added to the contents, and the contents as shown in FIG.

Next, the modification control means 11 determines whether or not the modification description language and the description language of the source program are the same (S4). If they are the same, the process proceeds to step S5, and if they are different, the step is executed. The process proceeds to S10. In this case, the modified description language is COBOL74 and the description language of the source program is COBOL / S, which are different from each other.
0, the contents of the conversion rule storage means 7-1 shown in FIG. 4 for converting the modified image described in COBOL74 into COBOL / S are expanded in the work area 3.

Next, the modification control means 11 inputs the first modification image 63 in the modification information shown in FIG. 3 from the modification information storage means 6 together with the modification location information 62 added thereto (S11), The corrected image 63 is notified to the language conversion means 12 to request the language conversion, and the result of the conversion is waited (S12).

FIG. 7 is a flowchart showing a processing example of the language converting means 12. The language conversion means 12 firstly, the first text in the notified correction image, that is, the text “IF A> B” of the line number 0130 shown in FIG.
Pay attention to (S31). Then, with reference to the reserved word list 72 of FIG. 4 expanded in the work area 3, the text is classified into a reserved word and a user-defined word other than the reserved word. An "IF #" is generated by writing it as it is, and replacing the user-defined word portion with # (S32). Next, a rule having the content of the search text in the condition part is searched from the rules R1, R2 ... In FIG. 4 which are expanded in the work area 3 (S33).

In this case, since the rule Ri shown in FIG. 4 is found, the search is successful (YES in S34), and the language-converted text is generated according to the searched rule Ri (S35). In this case, the execution part of the rule Ri is "IF:
"#", Where # is "A>" in the text before conversion.
Since it corresponds to "B", as the language-converted text,
"IF: A>B" is generated.

When the language conversion means 12 completes the language conversion of one text, the language conversion means 12 shifts attention to the next text (S3).
6) If the next text exists (NO in S37), the process returns to step S32 and the same processing as described above is repeated for the text. Therefore, in the case of the modified image 63 of FIG. 3, the text at line number 0140 is next, the text at line number 0150 is next, and then the line number 016.
The text at 0 is processed, and finally the text at line number 0170 is processed. Then, when the language conversion of all the texts is completed (YES in S37), the correction image after the language conversion is notified to the correction control means 11 (S38), and the language conversion process for the current correction image ends.

FIG. 8 shows the result of language conversion of the modified image 63 of FIG. Here, the line number 0130 indicates the text that has been language-converted by the rule Ri of FIG. 4 as described above, and the line numbers 0140, 0150, 0160, 01.
Reference numeral 70 indicates texts that have undergone language conversion according to rules R1, Rj, R1, and Rk.

In the above operation example, the language conversion of each text in the modified image 63 was successfully performed. For example, the text at the line number 0170 in the modified image 63 is described as "EMD." By the operator's mistake. And then "EM
D. Since it is not in the reserved word list, it is determined to be a user-defined word, and since “#” is generated as the search text, the applicable rule is not searched. That is, the result of step S34 is NO. In such a case, the language conversion unit 12 displays the entire corrected image 63 and a message indicating that the line number 0170 cannot be converted on the CRT 9b to prompt an instruction (S39). Then, on the CRT 9b, the operator selects "END."
D. When the re-conversion is instructed from the keyboard 9a (YES in S40), the process proceeds to step S32 to try the conversion operation on the corrected text. This allows
It becomes possible to proceed while correcting a simple mistake in the correction image in a conversational manner. When the operator designates the correction stop instead of the reconversion from the keyboard 9a (NO in S40), the language conversion unit 12 stops the language conversion of the correction image and cancels the correction for the correction control unit 11. Is notified (S41).

The correction control means 11 which has requested the language conversion means 12 to perform the language conversion and is waiting for the result, receives the notification of the correction cancellation from the language conversion means 12 (YES in S13 of FIG. 5). , The correction by the correction image is stopped, and the process proceeds to the correction by the next correction image. On the other hand, when the language-converted correction image is received from the language conversion means 12 (NO in S13), the correction image after the language conversion and its application portion are notified and the correction means 13 is requested to correct (S14). ). Therefore, in the case of the correction image 63 in FIG. 3, the correction means 13 is notified of the correction image as shown in FIG. 8 and the information on the correction portion in FIG. 3, and the correction is requested.

As shown in FIG. 9, the correction means 13 first reads line numbers 0130 to 020 indicated by the information of the correction point from the source program to be corrected developed in the work area 3.
0 is searched and the image before correction is held inside (S51), and then the searched part on the work area 3 is updated with the corrected image shown in FIG. 8 after language conversion (S5).
2). As a result, the modified image 63 described in COBOL74 is language-converted into COBOL / S and applied to the modified part. And the correction means 13
The pre-correction image and the post-correction image held inside are notified to the correction control means 11 (S53), and the processing is ended.

When the correction control means 11 finishes the correction by the correction means 13, the correction history generation means 14 sets the image before correction and the image after correction notified from the correction means 13.
And the correction history creating means 14 adds the notified image before correction and image after correction to the correction history developed in the work area 3 as the correction history for one correction point (S15). . As a result, when the above-described correction image 63 is used for correction, the correction history of the work area 3 becomes as shown in FIG. 6C. Here, the part of line numbers 0130 to 0200 of the source program of FIG. 2 is set in the before-correction image of the correction (1), and the corrected image after language conversion of FIG. 8 is set in the after-correction image.

When the correction control means 11 finishes the processing of the first correction image 63, the next correction image is input from the correction information storage means 6 (S16), and if there is a next correction image (NO in S17). Then, the procedure returns to step S12, and the same operation as the previous correction image 63 is repeated based on the correction image. If there is no next correction image (S17).
YES), the modified source program existing in the work area 3 is output to replace the original version 0 source program in the source program storage means 5 with the modified version 1 source program (S18). Finally, the correction history existing in the work area 3 is stored in the correction history storage means 8
And the original correction history is replaced (S19), and the current program correction processing is terminated.

The above is the operation when the modification description language is different from the language of the source program. When the languages are the same, the modification control means 11 proceeds from step S4 to step S5 of FIG. 5 as described above. . In this step S5, the first correction image is input from the correction information storage means 6, and the correction image and the information on the correction location are input to the correction means 13.
To the revision history creating means 14 to let the revision history creating means 14 create the history (S7). Then, the next correction image is input (S8), and if there is a next correction image (NO in S9), the process returns to step S6 to repeat the above-described processing, and if not, steps S18 and S1.
The process of 9 is performed and the program correction process of this time is ended.

Next, as an example, a version 1 source program modified by the modification information shown in FIG. 3 and stored in the source program storage device 5 is restored to the original version 0 source program. The operation of restoring the source program will be described. In this case, it is assumed that the correction history storage unit 8 stores the correction history as shown in FIG.

When the operator designates the source program name A to be corrected and the version 0 to be restored from the keyboard 9a of the user terminal 9 and gives an instruction to start the restoration, the restoration control in the program restoration unit 2 of the processing device 4 is performed. Means 2
1 starts operation.

As shown in the flow chart of FIG. 10, the restoration control means 21 first retrieves the correction history shown in FIG. 6 (c) from the correction history storage means 8 using the source program name A as a key to search the work area. 3 (S61). Next, the source program having the source program name A is retrieved from the source program 5 and expanded in the work area 3 (S62). This expanded source program is version 1. Then, the restoration is performed by the restoration means 22 (S63).

FIG. 11 is a flow chart showing a processing example of the restoring means 22. First, the restoration means 22 substitutes a value "1" obtained by subtracting the specified restoration target version 0 from the version 1 of the source program expanded in the work area 3 into the variable N (S71), and sets the variable N = 1. To do. And the variable N
It is determined whether the value of is positive or negative (S72). In this case, since it is positive, the processes of steps S73 to S80 are executed.

First, the variable i is initialized to 0 (S73),
In the correction history of FIG. 6C expanded in the work area 3,
Attention is paid to the version 1-i version of the source program, that is, the revision history of version 1 (S74). Then, pay attention to the first correction location in the version 1 correction history (S75).

As described above, the line numbers 0130 to 02 in FIG. 2 are added to the image before correction of the first correction point in FIG. 6C.
The image of 00 is set, and the images of line numbers 0130 to 0170 of FIG. 3 are set as the corrected image. Therefore, the restoration unit 3 replaces the positions of the line numbers 0130 to 0170, which are the images after correction, in the source program of version 1 expanded in the work area 3, with the images of the line numbers 0130 to 0200, which is the image before correction. Change (S76). As a result, the corrected portion is restored to the version 0 state.

Next, the restoration means 22 pays attention to the next correction location of the revision history of version 1 in the work area 3 (S7).
7) If there is a next correction point (NO in S78), return to step S76 and repeat the above-described processing. If there is no next correction point (YES in S78), increment the variable i by 1,
It is determined whether i has become equal to N (S79, S8).
0). In this case, if i is incremented by 1, it is 1 and N is 1. Therefore, i = N and the result of step S80 is YES. Therefore, the restoration unit 22 ends the program restoration process.

On the other hand, if i = N is not satisfied, step S74.
Then, the process described above is repeated. Such a case occurs when the version of the source program stored in the source program storage unit 5 is 2, and the version to be restored is 0, for example, and the difference between the versions is 2 or more.

Now, the restoration control means 21 which has started the restoration means 22, when the processing of the restoration means 22 is completed, is made into the work area 3
The restored source program existing in the above is output to the source program storage means 5 to replace the original version 1 source program with the restored version 0 source program (S64). This completes the restoration of the version 0 source program.

The above is the operation for restoring a source program having a small version number from a source program having a large version number. However, there is a case where the source program once restored may be restored to its original state. Then, the reverse restoration is also possible. For example,
The source program of version 1 stored in the source program storage means 5 as described above is converted to version 0.
When restoring to the original program of version 1 again after restoring to the original program of
Then, when you specify the source program name A to be modified and the version 1 you want to restore and instruct to start the restoration,
The restoration control means 21 in the program restoration unit 2 of the processing device 4 starts operation.

As shown in the flowchart of FIG. 10, the restoration control means 21 has the correction history storage means 8 in the same manner as described above.
6C, the correction history shown in FIG. 6C is searched and expanded in the work area 3 (S61), and then the source program having the source program name A is searched from the source program storage means 5 and expanded in the work area 3. (S62). This expanded source program is of version 0. And the restoration means 2
The restoration by 2 is performed (S63).

The restoring means 22 substitutes a value "-1" obtained by subtracting the specified version 1 to be restored from the version 0 of the source program expanded in the work area 3 into the variable N (S71). = -1. Then, it is determined whether the value of the variable N is positive or negative (S72), and since it is negative in this case, the processes of steps S81 to S88 are executed.

First, the variable i is initialized to 1 (S81),
In the correction history of FIG. 6C expanded in the work area 3,
Attention is paid to the version 0 + i version of the source program, that is, the revision history of version 1 (S82). Then, pay attention to the first correction location in the revision history of this version 1 (S83).

As described above, the line numbers 0130 to 02 in FIG. 2 are added to the image before correction of the first correction point in FIG. 6C.
The image of 00 is set, and the images of line numbers 0130 to 0170 of FIG. 3 are set as the corrected image. Therefore, the restoration unit 22 changes the line numbers 0130 to 0200, which is the image before correction, in the source program of version 0 expanded in the work area 3 to the line numbers 0130 to 0170, which is the image after correction (S84). ). As a result, the modified part is version 1
Is restored to its original state.

Next, the restoration means 22 pays attention to the next correction portion of the version 1 correction history in the work area 3 (S8).
5) If there is a next correction point (NO in S86), return to step S84 and repeat the above-described processing. If there is no next correction point (YES in S86), increment the variable i to i.
Is determined to be greater than the absolute value of N (S8).
7, S88). In this case, if i is incremented by 1, the result is 2.
Since the absolute value of is 1, the absolute value of i> N, and the result of step S88 is YES, so that the restoring unit 22 ends the program restoring process.

On the other hand, if i> N is not an absolute value, the process returns to step S82 and the above-described processing is repeated. Such a case occurs when the version of the source program stored in the source program storage means 5 is 0 and the version to be restored is 2, for example, and when the difference between the versions is 2 or more.

The embodiment of the present invention has been described above.
The present invention is not limited to the above embodiments, and various other additions and changes can be made. For example, the correction information is stored in the program correction unit 1 from the correction information storage means 6 such as a magnetic disk device.
However, it is also possible to input to the program correction section 1 from another input means such as a keyboard.

[0057]

As described above, according to the source program modifying device of the present invention, the following effects can be obtained.

The modification of the source program can be carried out by using a modification image described in another language different from the description language, and it is not necessary to carry out the language conversion work as a separate work. Since the images before and after the modification are automatically saved as the modification history, the original program can be restored from the modified source program even if the unmodified source program does not exist.

The program correction section displays a correction image which could not be converted into a language on the display device to prompt an instruction, and after the displayed correction image is corrected, an instruction for re-conversion is made. Since the language conversion is performed on the image, it is possible to interactively correct a simple mistake in the corrected image and continue the correction work of the source program.

Since the correction history stored in the correction history storage means is input to restore the source program in the source program storage means to the state before the correction, a program restoring section is provided. It can be done automatically.

[Brief description of drawings]

FIG. 1 is a block diagram of an embodiment of a source program modifying device of the present invention.

FIG. 2 is a diagram showing an example of a source program to be modified.

FIG. 3 is a diagram showing an example of correction information including a correction image.

FIG. 4 is a diagram showing an example of contents of a language conversion rule storage unit.

FIG. 5 is a flowchart showing a processing example of a correction control means.

FIG. 6 is an explanatory diagram of correction history information.

FIG. 7 is a flowchart showing a processing example of a language conversion unit.

FIG. 8 is a diagram showing an example of a language-converted modified image.

FIG. 9 is a flowchart showing a processing example of a correction unit.

FIG. 10 is a flowchart showing a processing example of the restoration control means.

FIG. 11 is a flowchart showing a processing example of a restoring unit.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 ... Program correction part 11 ... Correction control means 12 ... Language conversion means 13 ... Correction means 14 ... Correction history creation means 2 ... Program restoration part 21 ... Restoration control means 22 ... Restoration means 3 ... Work area 4 ... Processing device 5 ... Primitive Program storage means 6 ... Correction information storage means 7-1 to 7-n ... Conversion rule storage means 8 ... Correction history storage means 9 ... User terminal 9a ... Keyboard 9b ... CRT

Claims (3)

[Claims] 1. A source program storage means for storing a source program to be modified, and a rule for converting a modified image described in the modified description language into a description language of the source program for each different modified description language. Conversion rule storage means for storing, correction history storage means for storing a correction history, specification of a correction point of the source program, a correction image to be applied to the correction point, and a correction description language used for description of the correction image Enter the correction information including the designation of
The modified image is converted into the description language of the source program by using a rule in the conversion rule storage unit corresponding to the modified description language used for the description, and the source program is designated by the converted modified image. And a program correction section for correcting the correction points and outputting images before and after the correction points to the correction history storage means. 2. The program correction unit displays a correction image, which has not been language-converted according to the rule, on a display device to prompt an instruction, and after the displayed correction image is corrected, an instruction for re-conversion is given. 3. The source program modifying device according to claim 1, further comprising a structure for performing language conversion on the modified image after modification. 3. A program restoration unit for inputting the revision history stored in the revision history storage means and restoring the original program in the original program storage means to the state before the revision. The described primitive program correction device.