JP3335372B2 - Character string replacement processing apparatus and method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION The present invention relates to a program,
String replacement processor in documents having the structure
In particular, the present invention is useful for modifying a program that is being created or created, and reusing a created program. Character strings (name tags) are not all replaced uniformly, and the same character string can be distinguished between replacement and non-replacement according to designated conditions.

[0002] The current shortage of the user program created personnel has become a problem, in order to cover the shortage of personnel, rapid programming is required. Therefore, the creation system side
In, should not have to provide a function that allows faster programming by creating a system user. For example, in the programming of the modification work, it has become necessary to create a system, such as modification work load requires only a minimum.

In the process of replacing a name mark in a program,
Users and to replace uniform unintended Name Plate also not easy become a replacement target. Therefore, the replacement operation becomes complicated ,
After the replacement , it is necessary to perform rework such as review and correction. The present invention is to allow the user squeezing finely the Name Plate intended <br/> writing, to simplify the operation at the time of replacement, is intended to eliminate the need for rework.

[0004]

2. Description of the Related Art A conventional mark replacement processing method will be described with reference to FIGS.

FIGS. 9 and 10 show a flow chart of an example of a conventional mark replacement process. In the figure, (1) is a screen before replacement, (2) is a process of inputting a replacement and replacement target label, (3) is a replacement process, and (4) is a screen after replacement. As shown in the figure, if a name mark is defined in various procedures (instructions) in the program, when the replacement is performed, all the same name marks as the target name mark inputted in (2) in the figure are replaced. The structure is such that even if there is a name tag that the user does not want to replace, it will be replaced.

FIG. 11 shows another example of a conventional mark replacement process. In the conventional creation system, even if the name on the definition side is changed, the name of an instruction or the like that refers to the name in the program is not automatically changed. Therefore, if the name "A" of the work area is changed from "A" to "KA", the name is replaced only on the definition side. The replacement process could not be performed, and the mark "A" in the shaded instruction was left as it was, resulting in a definition error.

[0007]

In the conventional replacement, if a target mark to be replaced exists in the program, all the same marks as the name mark specified by the user are replaced.
When creating a program, names of types that the user does not intend are also subject to replacement.On the contrary, the replacement range is limited and the names in the intended range are not replaced, and operations such as avoiding replacement and adding are increased. , also there is a problem that hand return, such as review and correction after the replacement occurs.

[0008] The present invention provides a method for replacing names in a program .
In character string replacement processing such as this,
The purpose is to eliminate the need for rework such as review after replacement and additional correction.

[0009]

Means for Solving the Problems The present invention, together with previously classified character string by its attributes can string replacement
In advance plural kinds setting a type that specifies the group of attributes, by specifying the type upon substitution, attribute range to be replaced character string, the entered category specifying
This is to automatically narrow down to only the character string of the group .

Referring to FIG. 1, the principles of the present invention are illustrated in an exemplary manner.
A more detailed description will be given.

In FIG. 1, reference numeral 1 denotes a processing device, 2 denotes a display device, 3 denotes an input device, 4 denotes a program creation system (or tool), 5 denotes a program to be replaced with a target, and 6 denotes a type and a range to be replaced. A type check table 7 for giving a correspondence is a mark replacement processing unit.

When the user wants to change a certain mark in the program 5, he / she inputs the name of the replacement target (name to be replaced), the desired replacement name, and the type of the replacement target from the input device 3, and executes the replacement process. To instruct. The name replacement processing unit 7 refers to the type check table 6 according to the input type to be replaced, obtains information on the range to be replaced, and changes the name to be replaced to the name in the range to be replaced. Execute the replacement process.

[0013]

According to the present invention, since it is possible for the user to specify the type of the name tag to be replaced, it is necessary in the program creation to replace only the name tag of the type intended by the user with the replacement target. Can be narrowed down. This eliminates the replacement operation (e.g., avoiding or adding replacement), and eliminates rework such as review and correction after replacement.

[0014]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described with reference to FIGS.

FIG. 2 and FIG. 3 are linked to show one flow of the mark replacement process. In the figure, (1) is a screen before replacement, (2) is a processing for inputting replacement, replacement target name, and replacement target type, (3) is replacement processing, and (4) is a screen after replacement. Is shown. Reference numeral 6 denotes a type check table. As shown in the figure, when the name mark is defined in various procedures (commands) in the program, when the replacement is performed, the target type input in the input process (2) in the figure and the type check table 6 are compared. When a user is able to describe a name tag of a specified type, only the same name tag can be replaced, and if there is a name tag of a type that the user does not want to replace, it can be excluded from the replacement target. In the illustrated type check table 6, a procedure that can be replaced with a mark is specified by type A, type B,. For example, when the type A is designated, only the procedures set by the circles, such as conditions and transcription, are selected as replacement targets. Specific examples are shown in FIGS.

FIGS. 4 and 5 are connected to form a flow similar to the flow of FIGS. 2 and 3. The program displayed on the screen before replacement in (1) in the figure is
If the value of the "customer master" is zero, a procedure for posting 125 to the "customer master"; a procedure for setting the random input file to "customer master"; Is displayed. Thus, the name label "customer master" is used in various procedures.

On the other hand, the type check table 6 is provided with types of item names and resource names. In the type of item names, only the labels used for the item names in the conditional command or the transfer command are replaced. It is made possible, and in the type of the resource name, only the mark used for the resource name of the sequential input or the random input can be replaced.

Here, if it is desired to replace only the mark "customer master" belonging to the type of the item name with another mark "customer code", in the input processing of (2), the user is good as the mark to be replaced. Specify the destination master, specify the customer code as the replacement tag, and specify the item name as the replacement target type.

Thus, in the replacement process (3), the type check table 6 is referred to to narrow down the order input, random input, and call procedures out of the replacement target and the condition and the transcription procedure as replacement targets. Then, only the narrowed targets are replaced with the target.

As a result, on the screen after replacement in (4),
Only the "customer master" on the third line of the screen of (1) is replaced with the "customer code" and displayed.

Next, with reference to FIGS. 6 to 8, a name replacement process according to another embodiment of the present invention will be described. FIG. 6 is a conceptual explanatory diagram, and FIG. 7 is a flowchart. In FIG. 6, is a name tag on the definition side displayed on the creation system screen.
Is the data of the name reference of the name reference side displayed on the creation system screen, the data of the definition side and the name mark of the name reference side, and the type of the definition side that performs automatic replacement after the name change. The type of the target name reference side is a table. ,, Are internal data of the creation system.

The processing operation will be described with reference to the flowchart of FIG. 7. When the name on the definition side is changed (a), it is determined whether or not the type () of the changed name exists (b). . Next, the name mark on the name reference side is fetched (c), and it is searched whether the type () of the fetched name mark exists in the target type (d). When the retrieved name mark is applicable as a target, it is determined whether the name mark before the change of a and the name mark of c match (e), and if they match, the name mark of c is changed to the name after change of a. (F).

FIG. 8 shows a specific example. In this example, the work area “2” in which the type of the internal data on the definition side is B is changed to the work area “A”. At this time, since B is present in the table for automatic replacement, automatic replacement processing after the change is performed.
First, the name reference (the work area “1” of the instruction 1) on the name reference side is extracted. The type (C) of the internal data of the retrieved name mark (work area “1”) is compared with the type of the reference side name mark that is the target of the table. Since C in the work area “1” does not correspond to the type of the reference side mark, the name (work area “2”) of the next instruction (instruction 2) is extracted. Since the work area “2” corresponds to both the type and the name tag, the name tag is changed. Thus, the automatic replacement is completed by performing the replacement while taking out all the names on the name reference side.

[0024]

According to the present invention, it is not necessary to perform a related correction (search / replace operation) at the time of program correction / change.
Improve program productivity. The amount of program description,
The greater the number of parts referring to the name tag on the defining side and the number of correction operations in the MMI, the greater the effect.

[Brief description of the drawings]

FIG. 1 is a principle diagram of the present invention.

FIG. 2 is a flowchart (No. 1) of a mark replacement process according to the embodiment of the present invention.

FIG. 3 is a flow chart (No. 2) of a mark replacement process according to the embodiment of the present invention.

FIG. 4 is a flowchart (part 1) of a specific example of a name place replacement process according to the embodiment of the present invention;

FIG. 5 is a flowchart (part 2) of a specific example of the mark replacement process according to the embodiment of the present invention;

FIG. 6 is an explanatory diagram of a mark replacement process according to another embodiment of the present invention.

FIG. 7 is a flowchart of a name conversion process according to another embodiment of the present invention.

FIG. 8 is an explanatory diagram of a specific example of a name mark conversion process according to another embodiment of the present invention.

FIG. 9 is a flowchart (part 1) of a mark replacement process in a conventional example.

FIG. 10 is a flowchart (No. 2) of a mark replacement process in a conventional example.

FIG. 11 is an explanatory diagram of a mark replacement process according to another conventional example.

[Explanation of symbols]

 Reference Signs List 1 processing device 2 display device 3 input device 4 program creation system 5 created program 6 type check table 7 mark replacement unit

──────────────────────────────────────────────────続 き Continued on the front page (72) Inventor Yuko Hara 1015 Ueodanaka, Nakahara-ku, Kawasaki City, Kanagawa Prefecture Inside Fujitsu Limited (72) Inventor Akiko Miyamoto 3-4-30 Masuizumi, Kanazawa City, Ishikawa Prefecture Fujitsu Hokuriku Co., Ltd. Within Systems (72) Inventor Masayoshi Akaike 98-2 Unoki-nu, Unoki-cho, Kawakita-gun, Ishikawa Prefecture Inside PFU Co., Ltd. (72) Inventor Hajime Mikihara 1015 Kamodanaka, Nakahara-ku, Kawasaki City, Kanagawa Prefecture Fujitsu Limited Judge Masatoshi Nishikawa Judge Takashi Nagashima Judge Nobuaki Yoshimi (56) References JP-A-3-250220 (JP, A) JP-A-2-109133 (JP, A) JP-A 63-82541 (JP, A) JP-A-4-74269 (JP, A) JP-A-61-48065 (JP, A) JP-A-2-129760 (JP, A) (58) Fields investigated (Int. . ^7, DB name) G06F 9/06 530 G06F 17/24 554

Claims (2)

(57) [Claims] 1. A character string replacement processing apparatus for a document having a structure, wherein a character string replacement target range is set for each of a plurality of types.
A type check card that manages one or more
And the replacement string, the replacement string, and the type of the replacement
The type check table according to the type of the replacement target.
The range to be replaced is specified with reference to the
Performs replacement with the replacement character string using the replacement target character string
String substitution processing apparatus characterized by comprising a string substitution processing unit. 2. Targeting a document having a structure
This is a character string replacement processing method, which accepts the replacement target character string, the replacement character string, and the type of the replacement target.
For each of the multiple types , one
Or, based on the correspondence relationship that linked multiple
A replacement target range is specified from the type , and the replacement target character in the narrowed replacement target range is specified.
Characterized by executing the substitution of the replacement string by string
Character string replacement processing method.