JPH0298731A - Program code generator - Google Patents

Abstract

PURPOSE:To automatically perform coding based on data corresponding to a tree structure chart by responding to one statement in a program code from the data of the tree structure chart in one to one, taking out a box in sequence of arrangement of the statement, and generating a corresponding program code. CONSTITUTION:A processing means 4 is provided with a tree structure chart generating part 10, and a programmer 1 can generate the tree structure chart on a display 3 via an input means 2. The data of the tree structure chart can be obtained by generating such tree structure chart. In such a case, when the programmer 1 completes the tree structure chart on the display 3, a coding command is supplied via the input means 2. Then, the processing means 4 operates a program code generating part 11 held in the inside of the means, and generates the program code based on the data of the tree structure chart. In such a way, it is possible to automatically perform the coding based on the data of the tree structure chart, and to save time and labor.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a program code generation device, and more specifically, to a program code generation device that automatically generates a program code based on data of a tree structure chart (structured 100-t). The present invention relates to a program code generation device.

[Prior Art] Conventionally, a structured programming method has been promoted in which a program is designed using three basic structures: concatenation, one repetition, and selection.In this structured programming, a tree structure chart is used instead of a conventional flowchart. is used.

Such tree structure charts include PAD, HCP,
There are various types such as SPD and YAC, and computer systems that support the creation of these tree structure charts have also been developed.

Tree-structured charts express control structures more clearly than conventional flowcharts, reducing the coding effort of programmers and making it less likely that errors will occur.

[Problem to be solved by the invention]

Creating a tree structure chart and coding based on it reduces the burden on the programmer and reduces errors compared to coding based on conventional flowcharts.

However, as the size of the program increases, the effort and time required for coding increases, and the number of errors that occur also increases. Therefore, it is desirable to automate the coding.

SUMMARY OF THE INVENTION Therefore, an object of the present invention is to provide a program code generation device that can automatically perform coding based on data corresponding to a tree-structured chart.

[Means to solve the problem]

The program code generation device of the present invention is a device that generates a program code from data of a tree structure chart formed by connecting a large number of boxes in a connection direction and a dependent direction, which can be classified into three basic structures of connection, nine repetitions, and selection. hand;
Start box extraction means takes out the topmost box in the connection direction and the topmost box in the subordinate direction as a start box, and if one box type is a connection box and there is a box in the lower connection direction, it is taken out as the next box, and the box is taken out in the lower connection direction. If there is no box and there is a box in the subordinate downward direction, it is extracted as the next box, and if there is neither a box in the downward direction nor a box in the subordinate upward direction, the connected next box extracting means makes itself the end box; If the box type is a repeat box and there is an unextracted box in the subordinate subordinate direction, it will be taken out as the next box, and if there is no unextracted box in the subordinate subordinate direction and there is a box in the concatenated subordinate direction, it will be taken as the next box. If there is no unextracted box in the subordinate downward direction or a box in the concatenated downward direction, and there is a box in the subordinate upward direction, it is extracted as the next box, and the unextracted box in the subordinate downward direction is also a box in the concatenated downward direction. If there is no box in the subordinate upper direction, iterative next box extraction means uses itself as the end box, and if one box type is a selection box and there is an unextracted box in the subordinate lower direction, a predetermined priority order among them. If there is no unextracted box in the subordinate downward direction and there is a box in the concatenated downward direction, then it is extracted as the next box, and the unextracted box in the subordinate downward direction is also extracted in the concatenated downward direction. If there is no box and there is a box in the subordinate upward direction, extract it as the next box, and if there is no unextracted box in the subordinate downward direction, a box in the concatenated downward direction, or a box in the subordinate upward direction, select the self as the end box. The present invention is characterized in that it comprises a next box extracting means and a program code generating means which sequentially generates a corresponding program code each time a box is sequentially extracted.

Furthermore, when creating a tree structure chart using a computer, the data for the tree structure chart is automatically created and does not require any extra effort, and even when a computer is not used, the data can be easily created manually from the tree structure chart. [Operation] According to the program code generation device of the present invention, boxes are extracted from the data of the tree structure chart in a one-to-one correspondence with one statement of the program code and in the order in which the statements are arranged. is taken out. Since a corresponding program code is created every time one box is taken out, coding can be performed automatically.

[Example] Hereinafter, the present invention will be explained in more detail based on the example shown in the drawings. Here, FIG. 1 is a block diagram of a programming device including a program code generation device according to an embodiment of the present invention, FIGS. 2 to 7 are flowcharts showing processing as the program code generation device, and FIG. FIG. 9 is another example of the generated program code, FIG. 10 is an example of tree-structured chart data, and FIG. 11 is a tree-structured chart.

Note that the present invention is not limited to the embodiments shown in the figures.

The programming device 1 shown in FIG. It has become.

The processing means 4 has a tree structure chart creation section IO, which allows the programmer to create a tree structure chart on the display 3 via the human power means 2. 1st
Figure 1 shows a tree structure chart created in this way.

By creating such a tree-structured chart 1, data of the tree-structured chart 1 as shown in FIG. 1O is obtained. Here, the boxes fIltJT AB and C represent 5 processing boxes, 5 repetition boxes, and 5 selection boxes, respectively, and each corresponds to the basic structure of 1 repetition and 5 selection boxes. The vertical direction of the tree structure chart corresponds to the connection direction, with the top being the top and the bottom being the bottom. In addition, the left and right direction of the tree structure chart is the subordinate direction, and for the 6 selection boxes where the left is upper and the right is lower, there is a connection in the upper right and lower right subordinate directions, -j
In i19, the upper right represents a true connection and the lower right represents a false connection.

Coding characters are strings of characters written inside each box.

Now, when the programmer completes the tree structure chart on the display 3, he gives a coding command via the input means 2.

Then, the processing means 4 operates the internal program code generation section 11 and generates the data of the tree structure chart (first
Program code (see Figure 8) based on the program code (see Figure 8)
generate. The operation of generating the program code will be described in detail below with reference to FIGS. 2 to 7. However, it is assumed that the data of the tree structure chart is as illustrated in FIG.

First, as shown in FIG. 2, the registers corresponding to the boxes (1) to (2) are set, and the contents of each register are all set to 0.Then, the row number N=l is set as the initial value. Then, take out the top-0 and left-○ boxes of the connection information. Here it is box ■. Upper = 0 indicates that there is no connection in the upper direction of the connection (therefore, it is the highest in the connection direction).

Left = 0 indicates that there is no connection in the subordinate direction (therefore, it is the highest subordinate direction). This will be your starting box for coding.

When the box ■ is taken out as the start box,
The type determination shown in FIG. 3 is performed to determine whether the box is a processing box, a 1-repetition box, or 1AIf<box. Box ■ is a processing box.

Therefore, the processing of the processing box shown in FIG. 4 is performed, that is, N(
-1) The coding characters in the box ■ are adopted as they are as the statement in line 1.

In this way, the statement in the first line shown in FIG. 8 is generated.

When the processing of the processing box is completed, the process shifts to the continuous processing shown in FIG. 5.

In continuous processing, the line number N is incremented, and then it is checked whether there is a connection in the continuous downward direction (bottom = O
? ), in box ■, lower==2, and box ■ exists as a box in the downward direction. Therefore, the box in the lower order direction is taken out and the process returns to the type determination process.

Box ■ is the same processing box as box ■, so the same processing as described above is performed. As a result, 2
The statement on line is generated.

In the same way, the box ■ is taken out and the box 3 shown in FIG.
The statement on line is generated. Note that these are actually the 3rd and 4th lines, but they are inseparable from the − body, so
Think of it as the third line in total.

Box ■ is extracted next as a box in the downward direction of box ■, but since box ■ is a repeating box, the repeating box processing shown in FIG. 6 is performed. That is, the contents of the register in box ■ are checked, and since it is 0 at this point, the N(-4)th line statement is Do and the automatically issued statement number m (here it is lO). ) and the coding characters in the box ■ are arranged in this order to generate a code. In this way, the statement on the fourth line shown in FIG. 8 is generated.

Next, the register of box ■ is set to 1, the statement number N is incremented, and the box in the subordinate direction is taken out, which is box ■. Then, to clearly express the hierarchical structure of the statements, move the beginning position of the statement two characters to the right.

Since the box (2) is a selection box, the processing shifts to the selection box shown in FIG. Finchi, the contents of the register in box ■ are checked, and since it is O at this point, N is
As the statement on the (-5)th line, a code is generated in which IF, (coding characters in box ■), and THEN are arranged in this order. However, the symbol < in the coding characters is replaced with the symbol LT. Thus, the eighth
The statement on the fifth line shown in the figure is generated.

Next, the contents of the register of box (2) are set to 1, the statement number N is incremented, and it is checked whether there is a box to be connected to the upper right.

This checks whether there is a box that has a true relationship in the subordinate direction. In box ■, the upper right = 8, so next, take out box ■, and for the same reason as above, move the start position of the statement two characters to the right.

Box ■ is a selection box, and performs the selection box processing shown in Figure 7. Since the register of box ■ is O, the same processing as above is performed, and the statement in the 6th line shown in Figure 8 is generated. However, the symbol 〉 in the coding characters is replaced with the symbol GT.

Box ■ is taken out as the upper right box of box ■, and since this is a processing box, the coding character of box ■ is taken as the statement on the Nth (=7)th line. In this way, the statement on the seventh line shown in FIG. 8 is generated.

In the continuous processing regarding box ■ (Figure 5), since the bottom is -0, it is checked whether the left = 0 (that is, whether there is a connection in the subordinate upper direction), and since the left of box O is -8. , box ■ is taken out. In order to clarify the hierarchical structure, the starting position of the statement is moved two characters to the left.

Box ■ is a selection box, and the selection box processing in Figure 7 is performed, but at this time, since it is register l of box ■, ELSE is entered as the statement on line N (=8).
is generated. Thus, the statement on line 8 shown in FIG. 8 is generated.

Next, set the register in box (3) to 2, increment the statement number N, and check whether it is -0 in the lower right corner. This is to check whether there is a box with a false relationship in the subordinate/lower direction.

In box ■, the bottom right is −0, so END IF is generated as the Nth (=9)th line statement. In this way, the statement on the 9th line shown in FIG. 8 is generated.

Next, the register in box (2) is set to O, and the process shifts to the continuous process shown in FIG.

In continuous processing, in box ■, bottom - ○, left -7
Therefore, the box ■ is taken out.

Then, for the same reason as above, the starting position of the statement is moved two characters to the left.

Box ■ is a selection box, and selection box processing (Figure 7)
to move to.

Since the register in box (■) is 1, ELSE is generated as the statement on the N (-10)th line. In this way, the statement on the 10th line shown in FIG. 8 is generated.

Next, the register in box (2) is set to 2, the statement number N is incremented, and it is checked whether the lower right=0. Since the position is -9 at the bottom right of box ■, box ■ is taken out. Then, for the same reason as above, the starting position of the statement is moved two characters to the right.

Box ■ is a processing box, and its coding character becomes the statement on the N (-11)th line. That is, the eighth
The statement on the 11th line shown in the figure is generated.

The bottom of the box ■ = 10, the box [phase] is taken out next, and the box [phase] is a processing box, so its coding character is taken as the statement on the N (= 12)th line, and it is shown in Figure 8. The statement shown on the 12th line is generated.

In the box [phase], the bottom is -0 and the left is 7, so the box ■ is taken out. Also, the starting position of the statement is moved two characters to the left.

The box ■ is a selection box, and the process of the selection box in Figure 7 is performed, but at this point the register of the box ■ is 2, so the statement in the N (= 13) line is
A DIF is generated. 13 shown in FIG.
The statement on line is generated.

Next, the register of box (2) is set to 0, and the process moves to the continuous process shown in FIG. 5, and since in box (2) it is lower - 0 and left = 4, box (2) is taken out. Also, the starting position of the statement is moved two characters to the left.

Box ■ is a repeat box, and the process of the repeat box shown in FIG. 6 is performed. At this point, the register of box ■ is 1, and the starting position of the statement is moved three characters to the left. Then, as the statement on the N(-14)th line,
m C0NTINUE is generated. Thus, the eighth
The statement on the 14th line shown in the figure is generated.

Next, the start position of the statement is moved three characters to the right and placed in register O of box 2, and the process proceeds to the continuous process shown in FIG.

In continuous processing, since it is -5 below the box ■,
Box ■ is taken out. Box ■ is a processing box, and its coding character is taken as the statement on the N (=1.5) line, and the statement on the 15th line shown in FIG. 8 is generated.

Next, the bottom of the box ■=6, the box ■ is taken out, and since the box ■ is a processing box, its coding character is taken as a statement.

In this way, the statement on the 16th line shown in FIG. 8 is generated.

Next, we move on to the continuous processing shown in Figure 5, but the box ■
is lower - 0 and left - 0, so N (= 17)
END is generated by the statement in line 1. Thus, the statement on the 17th line shown in FIG. 8 is generated.

Then, the coding operation ends.

As described above, coding is automatically performed from the data of the tree structure chart (FIG. 10).

The program code generated in this way is output to the output means 5.

Another example is one in which the hierarchy clarification process of moving the start position of the statement two characters to the right or moving it five characters to the left is omitted. In this case, a program code as shown in FIG. 9 will be generated.

For convenience of explanation, we have explained using only three types of boxes: processing box, repetition box, and selection box. Needless to say, the present invention can be applied to any case.

〔Effect of the invention〕

According to the present invention, there is provided a device for generating a program code from data of a tree-structured chart formed by connecting a large number of boxes classified into three basic structures of concatenation, repetition, and selection in a concatenation direction and a subordinate direction; A start box extraction means takes out the topmost box in the direction and the topmost box in the subordinate direction as a start box, and if one box type is a linked box and there is a box in the lower linked direction, it is taken out as the next box, and the box in the lower linked direction is extracted. If there is no box and there is a box in the subordinate upper direction, it is taken out as the next box.If there is neither a box in the lower direction nor a box in the subordinate upper direction, a means for taking out a connected box that makes itself an end box, and one box. If the type is repeat box and there is an unextracted box in the dependent downward direction, it is extracted as the next box, and if there is no unextracted box in the dependent downward direction and there is a box in the concatenated downward direction, it is taken as the next box. Retrieve, if there is no unextracted box in the subordinate downward direction or a box in the concatenated downward direction, and there is a box in the subordinate upward direction, extract it as the next box, and remove any unextracted boxes in the subordinate downward direction or boxes in the concatenated downward direction. If there is no box in the subordinate upper direction, there is an iterative next box extraction means that uses itself as the end box, and if one box type is a selection box and there are unextracted boxes in the subordinate lower direction, it is possible to use a predetermined priority order among them. The higher one is taken out as the next box, and if there is no unextracted box in the subordinate lower direction and there is a box in the concatenated lower direction, it is extracted as the next box, and the unextracted box in the subordinate lower direction is also a box in the concatenated lower direction. If there is no box in the subordinate upward direction, extract it as the next box, and if there is no unextracted box in the subordinate downward direction, or a box in the concatenated downward direction, or a box in the subordinate upward direction, select the self as the end box.Next There is provided a program code generation device characterized by comprising a box extraction means and a program code generation means for sequentially generating a corresponding program code each time a box is extracted, and which enables a tree structure chart to be generated. Coding can be done automatically based on data, which saves labor and time, eliminates errors, and eliminates the possibility of individual differences between programmers.

[Brief explanation of drawings]

FIG. 1 is a block diagram of a programming device including a program code generation device according to an embodiment of the present invention, and FIGS.
The figure is a flowchart showing the processing as a program code generation device, Figure 8 is an example diagram of the generated program code, Figure 9 is another example diagram of the generated program code, and Figure 1O is a tree structure chart. An example diagram of data, FIG. 11 is an example diagram of a tree structure chart. [Explanation of symbols] 1...Programming device 2...Manual means 3...Display 4...Processing means 5...Output means 10...Tree structure chart creation unit 11...Program code generation Department.

Claims (1)

[Claims] 1. A device for generating a program code from data of a tree structure chart in which a large number of boxes that can be classified into three basic structures of connection, repetition, and selection are connected in a connection direction and a subordinate direction; A start box extraction means takes out the top box in the subordinate direction as a start box, and if one box type is a linked box and there is a box in the lower linked direction, it is taken out as the next box, and if there is no box in the lower linked direction, If there is a box in the subordinate upper direction, it is extracted as the next box, and if there is no linked lower box or subordinate upper direction box, it becomes the end box, and one type of box is repeated. If there is an unextracted box in the subordinate subordinate direction, take it out as the next box, and if there is no unextracted box in the subordinate subordinate direction and there is a box in the concatenated subordinate direction, take it out as the next box, and If there is no unextracted box in the direction or a box in the connected lower direction, and there is a box in the subordinate upper direction, it will be extracted as the next box, and both unextracted boxes in the subordinate lower direction and boxes in the connected lower direction will be extracted in the subordinate upper direction. If there is no box, the repeating next box extraction means uses itself as the end box, and if one box type is a selection box and there are unextracted boxes in the subordinate downward direction, one of them with a predetermined higher priority is selected as the next box. If there is no unextracted box in the subordinate subordinate direction and there is a box in the concatenated subordinate direction, extract it as the next box, and if there is no unextracted box in the subordinate subordinate direction or box in the concatenated subordinate direction, it is extracted as a subordinate box. If there is a box in the upward direction, it is extracted as the next box, and if there is no unextracted box in the subordinate downward direction, a box in the connected downward direction, or a box in the subordinate upward direction, the selection next box extracting means sets itself as the end box. , and program code generation means for generating corresponding program codes in order each time a box is taken out.