JP5812878B2 - Source code generation apparatus, source code generation method, and source code generation program - Google Patents

Description

  The present invention relates to a source code generation device and the like.

  In recent years, decision tables have been used to express program processing conditions and policies in an easy-to-understand manner. FIG. 16 is a diagram illustrating an example of a decision table. As shown in FIG. 16, the decision table 10 has a condition description area 10a, a condition designation area 10b, an action description area 10c, and an action designation area 10d.

  The condition description area 10a is a part for describing conditions. The condition designation area 10b is a part for designating whether or not the condition of the condition description area 10a is satisfied. If the condition is satisfied, “y” is specified in the condition description area 10a, and if the condition is not satisfied, “n” is specified.

  The behavior description area 10c is a portion describing behavior. The operation designation area 10d is a part for designating whether or not to execute an operation. When the operation is executed, “x” is specified in the operation specifying area 10d, and when the operation is not executed, “−” is specified.

  For example, in the decision table 10 of FIG. 16, when the condition “product code <000” is satisfied and the condition “product code> 999” is not satisfied, “lower limit error processing” is executed. If the condition “product code <000” is not satisfied and the condition “product code> 999” is satisfied, the “upper limit error process” is executed. If the conditions of “product code <000” and “product code> 999” are not satisfied, “master file registration” is executed.

  A user creates a decision table 10 and arranges processing conditions, policies, and the like, and then creates source code that causes a computer to execute an operation based on the conditions defined in the decision table 10 using an editor.

  Here, a conventional technique for converting information defined in a decision table into an arbitrary processing language is disclosed in order to reduce a burden on a user who creates a source code. This prior art generates an IF statement from the relationship of information set in a condition description area, a condition designation area, an action description area, and an action designation area. FIG. 17 is a diagram illustrating an example of source code generated by the conventional technique. As shown in FIG. 17, the decision table 10 shown in FIG. 16 is converted into source code 20 including an IF statement.

JP 7-152543 A

  However, the above-described prior art has a problem that a decision table including repetitive operations cannot be converted into source code.

  The general decision table is not limited to the simple one shown in FIG. 16, but may be a decision table including repeated operations. In the prior art, a decision table including such repeated operations cannot be converted into source code. For this reason, when the decision table includes repeated operations, the user himself / herself creates the source code with the editor.

  The disclosed technique has been made in view of the above, and provides a source code generation device, a source code generation method, and a source code generation program capable of converting a decision table including repetitive operations into source code. With the goal.

  The disclosed source code generation device includes a storage unit, a recursion detection unit, and an output unit. The storage unit includes a condition description area that divides a plurality of conditions into each line, a condition designation area that specifies information about whether or not the conditions of the condition description area are satisfied in a cell determined by a row and a column, a plurality of conditions An operation description area that describes the operation divided into each line, and an operation specification area that specifies whether or not the operation is executed depending on whether or not the conditions in the condition description area are satisfied, in a cell determined by each row and each column And a decision table having The recursion detection unit sequentially scans the cells of the decision table, and detects cells in which information for performing the recursion operation is specified in the last row of the decision table. The output unit outputs a code for executing repetition based on the detection result of the recursion detection unit.

  According to the disclosed source code generation device, it is possible to convert the decision table 130a including repetitive operations into the source code 130b.

FIG. 1 is a functional block diagram illustrating the configuration of the source code generation device according to the first embodiment. FIG. 2 is a diagram illustrating an example of the data structure of the decision table. FIG. 3 is a diagram illustrating a decision table that defines the operation of “put (“} ”)”. FIG. 4 is a diagram (1) illustrating an example of the data structure of the source code according to the first embodiment. FIG. 5 is a diagram (2) illustrating an example of the data structure of the source code according to the first embodiment. FIG. 6 is a flowchart (1) illustrating the processing procedure of the source code generation unit according to the first embodiment. FIG. 7 is a flowchart (2) illustrating the processing procedure of the source code generation unit according to the first embodiment. FIG. 8 is a flowchart showing a processing procedure of the closing bracket output process. FIG. 9 is a flowchart of the process procedure of the tail recursion determination process according to the first embodiment. FIG. 10 is a functional block diagram illustrating the configuration of the source code generation device according to the second embodiment. FIG. 11 is a diagram illustrating an example of the data structure of the source code according to the second embodiment. FIG. 12 is a diagram illustrating an example of a data structure of a decision table to which a break statement line is added. FIG. 13 is a flowchart (1) illustrating the processing procedure of the source code generation unit according to the second embodiment. FIG. 14 is a flowchart (2) illustrating the processing procedure of the source code generation unit according to the second embodiment. FIG. 15 is a flowchart of the process procedure of the tail recursion determination process according to the second embodiment. FIG. 16 is a diagram illustrating an example of a decision table. FIG. 17 is a diagram illustrating an example of source code generated by the conventional technique.

  Embodiments of a source code generation device, a source code generation method, and a source code generation program disclosed in the present application will be described below in detail with reference to the drawings. Note that the present invention is not limited to the embodiments.

  A configuration of the source code generation device according to the first embodiment will be described. FIG. 1 is a functional block diagram illustrating the configuration of the source code generation device according to the first embodiment. As illustrated in FIG. 1, the source code generation device 100 includes an input unit 110, a display unit 120, a storage unit 130, and a control unit 140.

  The input unit 110 is an input device for inputting various types of information to the source code generation device 100. For example, the input unit 110 corresponds to a keyboard, a mouse, a touch panel, or the like. For example, the user operates the input unit 110 to generate the decision table 130a, modify the source code 130b, and the like.

  The display unit 120 is a display device that displays various types of information. For example, the display unit 120 displays a decision table 130a, source code 130b, and the like which will be described later. The display unit 120 corresponds to a liquid crystal monitor, a touch panel, or the like.

  The storage unit 130 stores a decision table 130a and source code 130b. The storage unit 130 corresponds to, for example, a semiconductor memory device such as a random access memory (RAM), a read only memory (ROM), and a flash memory, or a storage device such as a hard disk or an optical disk.

  The decision table 130a is a table that defines what operation is performed under what conditions. FIG. 2 is a diagram illustrating an example of the data structure of the decision table. As shown in FIG. 2, the decision table 130 a includes a condition description area 131, a condition designation area 132, an action description area 133, and an action designation area 134. In the following, the condition description area 131, the condition designation area 132, the behavior description area 133, and the behavior designation area 134 will be described in order.

  The condition description area 131 will be described. The condition description area 131 is an area in which a plurality of conditions are described on each line. In the example shown in FIG. 2, conditions are described from the 0th line to the 6th line of the decision table 130a. The meaning of the conditions described from the 0th line to the 6th line will be described.

  The condition “t [-1] [j] ==" "" on the 0th line will be described. The condition “t [-1] [j] ==“ ”” is a condition that information is not included in the cell in the −1st row and jth column of the decision table 130a. j is a variable, and a predetermined initial value is set. The same applies to j shown below. The -1 line corresponds to the line immediately above the 0 line.

  The condition “t [i] [− 1] ==“ ”” on the first line will be described. The condition “t [i] [− 1] ==“ ”” is a condition that information is not included in the cell in the i-th row and the −1-th column of the decision table 130a. i is a variable, and a predetermined initial value is set. The same applies to i shown below. Note that the -1 column corresponds to the 1 left column of the 0 column.

  The condition “j = 0” on the second line will be described. The condition “j = 0” is a condition that the value of the variable j is 0.

  The condition “t [i] [j−1] == t [i] [j]” on the third line will be described. The condition “t [i] [j-1] == t [i] [j]” is that information on the cell in the i-th row and j−1-th column of the decision table 130a and the i-th row and j-th column The condition is that the cell information is equal.

  The condition “t [i] [j] ==" y "" on the fourth line will be described. The condition “t [i] [j] ==“ y ”” is a condition that the information of the cell in the i-th row and the j-th column of the decision table 130a is “y”.

  The condition “t [i] [j] ==" n "" on the fifth line will be described. The condition “t [i] [j] ==“ n ”” is a condition that the information of the cell in the i-th row and j-th column of the decision table 130a is “n”.

  The condition “t [i] [j] ==" x "" on the sixth line will be described. The condition “t [i] [j] ==“ x ”” is a condition that the information of the cell in the i-th row and the j-th column of the decision table 130a is “x”.

  The condition designation area 132 will be described. The condition designation area 132 is an area for describing information as to whether or not each condition of the condition description area 131 is satisfied. If the condition of the corresponding row is satisfied, “y” is described in the cell. When the condition of the corresponding row is not satisfied, “n” is described in the cell.

  The behavior description area 133 will be described. The behavior description area 133 is an area in which the behavior is described on each line. In the example shown in FIG. 2, the operations are described from the seventh line to the 17th line of the decision table 130a. An example of the operations described in the 7th to 17th lines will be described.

  The operation “put (“ if ”)” on the seventh line will be described. The operation “put (“ if ”)” is an operation for outputting “if”.

  The operation “put (“ else ”)” on the eighth line will be described. The operation “put (“ else ”)” is an operation for outputting “else”.

  The operation “put (x)” on the ninth line will be described. The operation “put (x)” is an operation for outputting “x”.

  The operation “l ++” on the 10th line will be described. The operation “l ++” is an operation of updating the value of l with a value obtained by adding 1 to the value of the variable l.

  The operation “i ++” on the eleventh line will be described. The operation “i ++” is an operation for updating the value of i with a value obtained by adding 1 to the value of the variable i.

  The operation “i--” on the 12th line will be described. The operation “i--” is an operation in which the value of i is updated by a value obtained by subtracting 1 from the value of the variable i.

  The operation “put (“} ”)” on the 13th line will be described. The operation “put (“} ”)” performs processing corresponding to the decision table shown in FIG. FIG. 3 is a diagram illustrating a decision table that defines the operation of “put (“} ”)”.

  As shown in the 0th column in FIG. 3, when the value of i is less than 0, the operation “put (“} ”)” does not operate. As shown in the first column of FIG. 3, when the value of i is 0 or more and the i-th row and j-th column of the decision table 130a are “y”, the operation “put (“} ”” ) "Does nothing.

  As shown in the second column of FIG. 3, when the value of i is 0 or more and the i-th row and j-th column of the decision table 130a are “n”, the operation “put (“} ”)” The value of l is updated by the value obtained by subtracting 1 from the value of l. Also, the operation “put (“} ”)” outputs “}”. Further, the operation “put (“} ”)” updates the value of i by a value obtained by subtracting 1 from the value of i.

  As shown in the third column of FIG. 3, when the value of i is 0 or more and the i-th row and j-th column of the decision table 130a are neither “y” nor “n”, the operation “put (” } ")" Updates the value of i with a value obtained by subtracting 1 from the value of i.

  Returning to FIG. 2, the operation “j ++” on the 14th line will be described. The operation “j ++” is an operation of updating the value of j with a value obtained by adding 1 to the value of the variable j.

  The operation “i = 0” on the 15th line will be described. The operation “i = 0” is an operation for setting 0 to the value of the variable i.

  The operation “l = 0” on the 16th line will be described. The operation “l = 0” is an operation for setting 0 to the value of the variable l.

  The operation “dt ()” on the 17th line will be described. The operation “dt ()” is a recursive operation. The operation “dt ()” calls the decision table 130a again, and performs the same process as the decision table 130a again. In FIG. 2, the operation “dt ()” is taken as an example, but the operation “call dt ()” may be used.

  The operation designation area 134 will be described. The operation designation area 134 is an area for describing information on whether or not to execute the operation of the corresponding line. When executing the operation of the corresponding row, “x” is described. Hereinafter, the conditions and operations defined in the decision table 130a will be described for each column.

  The 0th column of the decision table 130a will be described. When the condition of the 0th row is satisfied, the processing defined by the decision table 130a is finished.

  The first column of the decision table 130a will be described. When the condition of the 0th line is not satisfied and the condition of the 1st line is satisfied, the operations from the 12th line to the 17th line are performed.

  The second column of the decision table 130a will be described. When the conditions of the 0th and 1st lines are not satisfied and the conditions of the 2nd and 4th lines are satisfied, the operations of the 7, 10, 11, and 17th lines are performed.

  The third column of the decision table 130a will be described. If the conditions of the 0th, 1st, and 4th lines are not satisfied and the conditions of the 2nd and 5th lines are satisfied, the operations of the 8th, 10th, 11th, and 17th lines are performed.

  The fourth column of the decision table 130a will be described. If the conditions of the 0th, 1st, 4th, and 5th lines are not satisfied and the conditions for the 2nd and 6th lines are satisfied, the operations of the 9th, 11th, and 17th lines are performed.

  The fifth column of the decision table 130a will be described. If the conditions of the 0th, 1st, 4th, 5th and 6th lines are not satisfied and the condition for the 2nd line is satisfied, the operations of the 11th and 17th lines are performed.

  The sixth column of the decision table 130a will be described. If the conditions of the 0th, 1st, and 2nd lines are not satisfied and the conditions of the 3rd and 4th lines are satisfied, the operations of the 10th, 11th, and 17th lines are performed.

  The seventh line of the decision table 130a will be described. If the conditions of the 0th, 1st, 2nd, and 4th lines are not satisfied and the condition of the 3rd and 5th lines is satisfied, the operations of the 10th, 11th, and 17th lines are performed.

  The eighth line of the decision table 130a will be described. When the conditions of the 0th, 1st, 2nd, 4th, and 5th lines are not satisfied and the conditions for the 3rd and 6th lines are satisfied, the operations of the 9th, 11th, and 17th lines are performed.

  The ninth line of the decision table 130a will be described. If the conditions of the 0th, 1st, 2nd, 4th, 5th, and 6th lines are not satisfied and the condition for the 3rd line is satisfied, the operations of the 11th and 17th lines are performed.

  The 10th line of the decision table 130a will be described. If the conditions of the 0th, 1st, 3rd and 3rd rows are not satisfied, and the condition of the 4th row is satisfied, the operations of the 7th, 10th, 11th and 17th rows are performed.

  The eleventh line of the decision table 130a will be described. If the conditions of the 0th, 1st, 3rd, 4th lines are not satisfied and the condition for the 5th line is satisfied, the operations of the 8th, 10th, 11th and 17th lines are performed.

  The twelfth line of the decision table 130a will be described. If the conditions of the 0th, 1st, 3rd, 4th, and 5th lines are not satisfied and the condition for the 6th line is satisfied, the operations of the 9th, 11th, and 17th lines are performed.

  The 13th line of the decision table 130a will be described. When the conditions of the 0th, 1st, 2nd, 3rd, 4th, 5th and 6th rows are not satisfied, the operations of the 11th and 17th rows are performed.

  The source code 130b is source code for causing a computer to execute an operation according to each condition defined in the decision table 130a. 4 and 5 are diagrams illustrating an example of the data structure of the source code according to the first embodiment. From the decision table 130a, the source code shown in the first line of FIG. 4 to the 83rd line of FIG. 5 is generated.

  The control unit 140 includes a management unit 140a and a source code generation unit 140b. The control unit 140 corresponds to an integrated device such as an ASIC (Application Specific Integrated Circuit) or an FPGA (Field Programmable Gate Array). The control unit 140 corresponds to an electronic circuit such as a CPU or MPU (Micro Processing Unit).

  The management unit 140 a is a processing unit that manages information stored in the storage unit 130. For example, the management unit 140a causes the storage unit 130 to store a decision table 130a input by the user operating the input unit 110. Further, the management unit 140a causes the display unit 120 to display the decision table 130a and the source code 130b in response to various requests.

  The source code generation unit 140b is a processing unit that generates the source code 130b based on the decision table 130a. The source code generation unit 140b includes a recursion detection unit 141 and an output unit 142.

  The recursion detection unit 141 is a processing unit that sequentially scans cells of the decision table 130a from the 0th row and the 0th column, and detects cells in which information for performing recursion is specified in the last row of the decision table 130a. .

  The output unit 142 is a processing unit that outputs a code for executing repetition based on the detection result of the recursion detection unit 141.

  Here, a processing procedure in which the recursion detection unit 141 and the output unit 142 included in the source code generation unit 140b cooperate to generate the source code 130b from the decision table 130a will be specifically described. 6 and 7 are flowcharts illustrating the processing procedure of the source code generation unit according to the first embodiment. The source code generation unit 140b starts scanning from the cell in the 0th row and the 0th column of the decision table 130a.

  As illustrated in FIG. 6, the source code generation unit 140b outputs a code that is a destination of recursion at the end (step S101). In step S101, for example, the source code generation unit 140b outputs the code “dt:” shown in the first line of the source code 130b shown in FIG. Such a code corresponds to the code of the -1st row and the -1th column of the decision table 130a shown in FIG.

  The source code generation unit 140b determines whether it is the end of the sequence (step S102). Taking the decision table 130a shown in FIG. 2 as an example, the end of the column corresponds to the 14th row.

  The source code generation unit 140b ends the process when it is the end of the column (step S102, Yes). On the other hand, if it is not the end of the column (step S102, No), it is determined whether or not it is the end of the row (step S103). Taking the decision table 130a shown in FIG. 2 as an example, the end of the line corresponds to the 18th line.

  When it is the end of the line (step S103, Yes), the source code generation unit 140b returns one line (step S104). The source code generation unit 140b executes a closing bracket output process (step S105).

  The source code generation unit 140b advances the column by 1 (step S106) and returns the row to the 0th row (step S107). The source code generation unit 140b returns the indent to 0 (step S108), and proceeds to step S102. Here, the indent indicates a position on the source code 130b. Returning the indent to 0 means that the position of the indent of the source code 130b is at the left end.

  If it is not the end of the line (step S103, No), the source code generation unit 140b determines whether the column is the leftmost column (step S109). The leftmost column of the decision table 130a corresponds to the 0th column.

  If the source code generation unit 140b is not the leftmost column (step S109, No), the source code generation unit 140b proceeds to step S118 in FIG. On the other hand, when it is the leftmost column (step S109, Yes), the source code generation unit 140b determines whether the cell is y (step S110).

  When the cell is y (step S110, Yes), the source code generation unit 140b outputs “if” and the character in the condition description area corresponding to the row of the current cell (step S111). For example, the cell in the 0th row and the 0th column of the decision table 130a in FIG. 2 is y. When the current cell is the cell in the 0th row and the 0th column, the source code generation unit 140b performs “if (t [-1] [i] ==” as shown in the second row in FIG. ") {" Is output.

  The source code generation unit 140b advances the indent by one (step S112). To advance the indent by one means to advance the indent on the source code by one to the right. The source code generation unit 140b advances one line (step S113), and proceeds to step S102.

  If the cell is not y (step S110, No), the source code generation unit 140b determines whether the cell is n (step S114). When the number of cells is n (Yes at Step S114), the source code generation unit 140b outputs “else” (Step S115), and proceeds to Step S112. For example, the cell in the 0th row and the 1st column of the decision table 130a in FIG. When the current cell is the cell in the 0th row and the 1st column, the source code generation unit 140b outputs “} else {” shown in the second row in FIG.

  When the cell is not n (step S114, No), the source code generation unit 140b determines whether the cell is x (step S116). If the cell is x (step S116, Yes), the source code generation unit 140b executes tail recursion determination processing (step S117), and proceeds to step S113. On the other hand, when the cell is not x (step S116, No), the source code generation unit 140b proceeds to step S113.

  Shifting to the description of FIG. The source code generation unit 140b determines whether the information on the current cell is the same as the information on the left adjacent cell (step S118). For example, the information of the cell in the 0th row and the 2nd column of the decision table 130a in FIG. 2 is the same as the information of the cell on the left side.

  When the source code generation unit 140b is the same as the information on the left adjacent cell (step S118, Yes), the source code generation unit 140b determines whether the cell is y (step S119). When the cell is y (step S119, Yes), the source code generation unit 140b advances the indent by one (step S120). The source code generation unit 140b advances one line (step S121), and proceeds to step S102 in FIG.

  On the other hand, when the cell is not y (step S119, No), the source code generation unit 140b determines whether the cell is n (step S122). If the number of cells is n (step S122, Yes), the source code generation unit 140b proceeds to step S120.

  On the other hand, if the cell is not n (step S122, No), the source code generation unit 140b determines whether the cell is x (step S123). When the cell is not x (step S123, No), the source code generation unit 140b proceeds to step S121.

  On the other hand, when the cell is x (step S123, Yes), the source code generation unit 140b executes tail recursion determination processing (step S124), and proceeds to step S121.

  Returning to the description of step S118 in FIG. If the source code generation unit 140b is different from the information of the cell on the left (No at Step S118), the source code generation unit 140b determines whether the cell is y (Step S125).

  If the cell is y (step S125, Yes), the source code generation unit 140b outputs “if” and the character in the condition description area corresponding to the current cell row (step S126). The source code generation unit 140b advances the indent by one (step S127), and proceeds to step S121.

  On the other hand, when the cell is not y (step S125, No), the source code generation unit 140b determines whether the cell is n (step S128). When the number of cells is n (Yes at Step S128), the source code generation unit 140b outputs “else” (Step S129), and proceeds to Step S127.

  On the other hand, when the cell is not n (step S128, No), the source code generation unit 140b determines whether the cell is x (step S130). If the cell is not x (step S130, No), the source code generation unit 140b proceeds to step S121.

  On the other hand, when the cell is x (step S130, Yes), the source code generation unit 140b outputs the characters in the behavior description area corresponding to the current cell row (step S131), and proceeds to step S121. For example, the cell in the 12th row and the 1st column of the decision table 130a in FIG. 2 is n. If the current cell is the cell in the 12th row and the 1st column, "i--;" is output as shown in the 5th row in FIG.

  Next, the closing parenthesis output process shown in step S105 of FIG. 6 will be described. The closing bracket output process is a process of outputting “}” according to a condition. FIG. 8 is a flowchart showing a processing procedure of the closing bracket output process.

  As shown in FIG. 8, the source code generation unit 140b determines whether or not the line is the head (step S151). Taking the decision table 130a of FIG. 2 as an example, the top of the line corresponds to the 0th line.

  When the line is not at the head (No at Step S151), the source code generation unit 140b ends the closing bracket output process.

  When the line is at the head (Yes in step S151), the source code generation unit 140b determines whether the cell is y (step S152). When the cell is y (step S152, Yes), the source code generation unit 140b ends the closing bracket output process.

  If the cell is not y (step S152, No), the source code generation unit 140b determines whether the cell is n (step S153). If the number of cells is n (step S153, Yes), the source code generation unit 140b returns one indent (step S154). Returning one indent means returning one indent on the source code to the left.

  The source code generation unit 140b outputs “}” (step S155), advances one line (step S156), and proceeds to step S151.

  On the other hand, when the cell is not n (step S153, No), the source code generation unit 140b returns one row (step S157), and proceeds to step S151.

  Next, the tail recursion determination process shown in steps S117 and S124 of FIGS. 6 and 7 will be described. The tail recursion determination process according to the first embodiment is a process for outputting a code “goto statement” for performing repetition when a cell in which information for performing recursion is specified in the last row of the decision table 130a is detected. . FIG. 9 is a flowchart of the process procedure of the tail recursion determination process according to the first embodiment.

  As illustrated in FIG. 9, the source code generation unit 140b determines whether or not the current cell row is the end (step S181). Taking the decision table 130a shown in FIG. 2 as an example, the last line is the 17th line.

  If the current cell row is at the end (Yes in step S181), the source code generation unit 140b determines whether or not the operation in the behavior description area corresponding to the current cell row is recursive ( Step S182).

  An example of processing for determining whether or not the source code generation unit 140b is recursive in step S182 will be described. The source code generation unit 140b performs syntax analysis on the character string indicating the operation in the operation description area corresponding to the current cell row. The source code generation unit 140b determines that the operation is a recursive operation when the parsed character string is equal to the character string in the -1st row and the 1st column of the decision table 130a.

  For example, the character string “dt ()” on the 17th line of the decision table 130a and the character string “dt ()” on the −1st line−column of the decision table 130a are the same character. Therefore, the operation of the character string “dt ()” on the 17th line of the decision table 130a indicates recursion.

  The source code generation unit 140b may determine whether the operation is recursive using any other conventional technique. For example, even when a call statement or the like is given to the corresponding operation and a decision table is called, it may be determined that the operation is a recursive operation.

  Returning to the description of step S182 in FIG. If it is recursive (Yes in step S182), the source code generating unit 140b outputs a goto statement (step S183), and ends the tail recursive determination process.

  For example, in the decision table 130a of FIG. 2, the cell in the 17th row and the first column has the corresponding row at the end, and the operation corresponding to the row is recursion “dt ()”. Therefore, when the current cell is the 17th row and the 1st column of the decision table 130a, the source code generation unit 140b outputs “goto dt;” as shown in the 10th row of FIG.

  By the way, when the current cell row is not the end in step S181 (step S181, No), the source code generation unit 140b outputs the character in the operation description area (step S184), and performs the end recursion determination process. finish.

  If the source code generation unit 140b is not recursive in step S182 (step S182, No), the source code generation unit 140b proceeds to step S184.

  Next, effects of the source code generation device 100 according to the first embodiment will be described. When the source code generation device 100 generates the source code 130b from the decision table 130a, the cell that sequentially scans the cells of the decision table 130a and the information that performs the recursive operation in the last row of the decision table 130a is designated. Is detected. The source code generation device 100 outputs a code for executing repetition based on the recursion detection result. By executing such processing by the source code generation device 100, the decision table 130a including repeated operations can be converted into the source code 130b.

  The source code generation device 100 according to the first embodiment generates the source code 130b corresponding to C, C ++, and the like from the decision table 130a. The source code generation device 200 according to the second embodiment generates a source code corresponding to Java (registered trademark) or the like.

  A source code generation apparatus according to the second embodiment will be described. FIG. 10 is a functional block diagram illustrating the configuration of the source code generation device according to the second embodiment. As illustrated in FIG. 10, the source code generation device 200 includes an input unit 210, a display unit 220, a storage unit 230, and a control unit 240. The description about the input unit 210 and the display unit 220 is the same as the description about the input unit 110 and the display unit 120 shown in FIG.

  The storage unit 230 stores a decision table 230a and source code 230b. The storage unit 230 corresponds to, for example, a semiconductor memory device such as a RAM, a ROM, or a flash memory, or a storage device such as a hard disk or an optical disk.

  The decision table 230a is a table that defines what kind of operation is performed under what conditions. The data structure of the decision table 230a is the same as that shown in FIG.

  The source code 230b is source code for causing a computer to execute an operation according to each condition defined in the decision table 230a. FIG. 11 is a diagram illustrating an example of the data structure of the source code according to the second embodiment. Source codes from the first line to the 72nd line in FIG. 11 are generated from the decision table 230a.

  The control unit 240 includes a management unit 240a and a source code generation unit 240b. The control unit 240 corresponds to, for example, an integrated device such as an ASIC or FPGA. Moreover, the control part 240 respond | corresponds to electronic circuits, such as CPU and MPU, for example.

  The description regarding the management unit 240a is the same as the description regarding the management unit 140a illustrated in the first embodiment.

  The source code generation unit 240b is a processing unit that generates the source code 230b based on the decision table 230a. The source code generation unit 240b includes a setting unit 241, a recursion detection unit 242, a change unit 243, and an output unit 244.

  The setting unit 241 is a processing unit that performs initial setting at the stage of generating the source code 230b from the decision table 230a. The setting unit 241 executes processing for adding a break statement line to the decision table 230a and processing for outputting an infinite loop code to the source code 230b.

  A process in which the setting unit 241 adds a break statement line to the decision table 230a will be described. The setting unit 241 sets “break” in the behavior description area corresponding to the end of the line of the decision table 230a. The break statement is an operation for interrupting the infinite loop. In addition, the setting unit 241 sets “x” in the operation designation area corresponding to the end of the line of the decision table 230a.

  FIG. 12 is a diagram illustrating an example of a data structure of a decision table to which a break statement line is added. As shown in FIG. 12, “break” is set in the action description area on the 18th line of the decision table 230a. In addition, “x” is set from the first column to the 14th column of the 18th row of the decision table 230a.

  The recursion detection unit 242 is a processing unit that sequentially scans cells of the decision table 230a from the 0th row and the 0th column, and detects cells in which information for performing recursion is specified in the last row of the decision table 230a. . In the second embodiment, the 17th line of the decision table 230a shown in FIG.

  Based on the detection result of the recursion detection unit 242, the change unit 243 changes the cell information in the operation designation area corresponding to the row in which the break statement is set to information indicating that the break operation is not executed. For example, the changing unit 243 deletes “x” from the corresponding cell based on the detection result of the recursive detection unit 242.

  The output unit 244 sequentially scans the cells of the decision table, and outputs information corresponding to the row of the cell when information indicating that the operation in the operation description area is executed is included in the cell.

  Here, a processing procedure for generating the source code 230b from the decision table 230a in cooperation with the setting unit 241, the recursion detection unit 242, the changing unit 243, and the output unit 244 included in the source code generation unit 240b will be specifically described. To do. 13 and 14 are flowcharts illustrating a processing procedure of the source code generation unit according to the second embodiment. The source code generation unit 240b starts scanning from the cell at row 0 and column 0 of the decision table 230a.

  As illustrated in FIG. 13, the source code generation unit 240b outputs an infinite loop code (step S201). In step S201, for example, the source code generation unit 240b outputs “for (;;) {” shown in the first line of FIG. 11 and “}” shown in the 72nd line as an infinite loop code.

  The source code generation unit 240b sets break in the behavior description area and sets all corresponding action designation areas to “x” (step S202). The source code generation unit 240b determines whether it is the end of the sequence (step S203). Taking the decision table 230a shown in FIG. 12 as an example, the end of the column corresponds to the 14th row.

  The source code generation unit 240b ends the process when it is the end of the column (step S203, Yes). On the other hand, if it is not the end of the column (step S203, No), it is determined whether or not it is the end of the row (step S204). Taking the decision table 230a shown in FIG. 12 as an example, the end of the line corresponds to the 19th line.

  When it is the end of the line (step S204, Yes), the source code generation unit 240b returns one line (step S205) and executes the closing parenthesis output process (step S206). The source code generation unit 240b advances the column by 1 (step S207) and returns the row to 0 (step S208). The source code generation unit 240b returns the indent to 0 (step S209), and proceeds to step S203.

  On the other hand, when it is not the end of the line (step S204, No), the source code generation unit 240b determines whether the column is the leftmost column (step S210). If the source code generation unit 240b is not the leftmost column (step S210, No), the source code generation unit 240b proceeds to step S219 in FIG.

  On the other hand, if the source code generation unit 240b is the leftmost column (step S210, Yes), the source code generation unit 240b determines whether the cell is y (step S211). When the cell is y (step S211, Yes), the source code generation unit 240b outputs “if” and the character in the condition description area corresponding to the row of the current cell (step S212).

  The source code generation unit 240b advances the indent by one (step S213). To advance the indent by one means to advance the indent on the source code by one to the right. The source code generation unit 240b advances one line (step S214), and proceeds to step S203.

  If the cell is not y (step S211, No), the source code generation unit 240b determines whether the cell is n (step S215). If the cell is n (step S215, Yes), the source code generation unit 240b outputs “else” (step S216), and proceeds to step S213.

  If the cell is not n (step S215, No), the source code generation unit 240b determines whether the cell is x (step S217). When the cell is x (step S217, Yes), the source code generation unit 240b executes tail recursion determination processing (step S218), and proceeds to step S214. On the other hand, when the cell is not x (No in step S217), the source code generation unit 240b proceeds to step S214.

  The description shifts to the description of FIG. The source code generation unit 240b determines whether the information on the current cell is the same as the information on the left adjacent cell (step S219). For example, the information of the cell in the 0th row and the 2nd column of the decision table 230a in FIG. 12 is the same as the information of the cell on the left.

  When the information is the same as the information on the left adjacent cell (step S219, Yes), the source code generating unit 240b determines whether the cell is y (step S220). If the cell is y (step S220, Yes), the source code generation unit 240b advances the indent by one (step S221). The source code generation unit 240b advances one line (step S222), and proceeds to step S203 in FIG.

  On the other hand, when the cell is not y (step S220, No), the source code generation unit 240b determines whether the cell is n (step S223). If the number of cells is n (step S223, Yes), the source code generation unit 240b proceeds to step S221.

  On the other hand, if the cell is not n (step S223, No), the source code generation unit 240b determines whether the cell is x (step S224). If the cell is not x (step S224, No), the source code generation unit 240b proceeds to step S222.

  On the other hand, when the cell is x (step S224, Yes), the source code generation unit 240b executes tail recursion determination processing (step S225), and proceeds to step S222.

  Returning to the description of step S219 in FIG. When the source code generation unit 240b is different from the information of the cell on the left (No at Step S219), the source code generation unit 240b determines whether the cell is y (Step S226).

  When the cell is y (step S226, Yes), the source code generation unit 240b outputs “if” and the character in the condition description area corresponding to the row of the current cell (step S227). The source code generation unit 240b advances the indent by one (step S228), and proceeds to step S222.

  On the other hand, when the cell is not y (step S226, No), the source code generation unit 240b determines whether the cell is n (step S229). When the number of cells is n (step S229, Yes), the source code generation unit 240b outputs “else” (step S230), and proceeds to step S228.

  On the other hand, when the cell is not n (No at Step S229), the source code generation unit 240b determines whether the cell is x (Step S231). If the cell is not x (step S231, No), the source code generation unit 240b proceeds to step S222.

  On the other hand, when the cell is x (step S231, Yes), the source code generation unit 240b outputs the characters in the behavior description area corresponding to the current cell row (step S232), and proceeds to step S222.

  Here, the closing bracket output process shown in step S206 of FIG. 13 is the same as the closing bracket output process described in FIG.

  Next, the tail recursion determination process shown in steps S218 and S225 of FIGS. 13 and 14 will be described. FIG. 15 is a flowchart of the process procedure of the tail recursion determination process according to the second embodiment. In the end recursion determination process according to the second embodiment, when a cell in which information for performing recursion is specified in the last row of the decision table 230a is detected, a cell in the operation specification area corresponding to the row in which the break statement is set Is changed to information indicating that the operation of the break is not executed, so that the recursive operation can be executed. As described above, in the second embodiment, the last line is the 17th line in the decision table 230a of FIG.

  As illustrated in FIG. 15, the source code generation unit 240b determines whether or not the row of the current cell is the end (step S241). If the current cell row is the end (Yes in step S241), the source code generation unit 240b determines whether or not the operation in the behavior description area corresponding to the current cell row is recursive ( Step S242).

  In the case of recursion (Yes in step S242), the source code generation unit 240b sets the corresponding x in the break line to blank (step S243), and ends the end recursion determination process.

  For example, if it is determined in step S242 that the current cell is in the 17th row and the first column and the recursive operation is determined in step S242, the source code generation unit 240b sets “x” set in the cell in the 18th row and the first column. Set to blank. Also, the source code generation unit 240b sets “x” set in the cell in the 18th row and the 2nd column to be blank when the current cell is in the 17th row and the 2nd column and the recursive operation is determined. To do. Similarly, in other cases, the source code generation unit 240b sets x to be blank. As described above, when recursion is detected, by setting x in the break line to blank, the break sentence is not output to the source code, and repetition can be expressed in the source code.

  Returning to the description of FIG. If the current cell row is not the end in step S241 (step S241, No), the source code generation unit 240b outputs the characters in the behavior description area (step S244), and ends the end recursion determination process. .

  If the source code generation unit 240b is not recursive in step S242 (step S242, No), the source code generation unit 240b proceeds to step S244.

  Next, effects of the source code generation unit 240b according to the second embodiment will be described. When generating the source code 230b from the decision table 230a, the source code generation unit 240b outputs an infinite loop code, sets a break statement in the operation description area, and operates corresponding to the line in which the break statement is set Information indicating that the break operation is to be executed is set in each cell in the designated area. Based on the detection result of the recursive operation, the source code generation unit 240b changes the cell information in the operation designation area corresponding to the row in which the break statement is set to information indicating that the break operation is not executed. Then, the cells in the decision table are sequentially scanned, and if the information to execute the operation in the operation description area is included in the cell, the operation corresponding to the row of the cell is output. By executing such processing by the source code generation device 200, it is possible to generate the source code 230b corresponding to Java (registered trademark) or the like from the decision table 230a including the repetitive operation.

  By the way, the processing of the source code generation devices 100 and 200 described in the first and second embodiments is an example. For example, the source code generation devices 100 and 200 may have a server function. The source code generation devices 100 and 200 may receive the data of the decision table from the terminal device via the network, execute the above processing based on the received decision table, and generate the source code. The source code generation device 200 transmits the generated source code to the terminal device.

  Of the processes described in the first and second embodiments, all or part of the processes described as being performed automatically can be performed manually, or the processes described as being performed manually. All or a part of the above can be automatically performed by a known method. In addition, the processing procedure, control procedure, specific name, and information including various data and parameters shown in the above-described document and drawings can be arbitrarily changed unless otherwise specified.

  The constituent elements of the source code generation devices 100 and 200 shown in FIGS. 1 and 10 are functionally conceptual, and need not be physically configured as illustrated. The various processing procedures described in this embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. The various processes described in the first and second embodiments can be realized by executing a prepared program on a computer.

100, 200 Source code generation device 110, 210 Input unit 120, 220 Display unit 130, 230 Storage unit 140, 240 Control unit

Claims (6)

A condition description area that divides a plurality of conditions into each line, a condition designation area that specifies information about whether or not the conditions of the condition description area are satisfied in a cell determined by a row and a column, and a plurality of operations for each line A behavior description area that is described separately, and a behavior designation area that designates information about whether or not to execute the behavior depending on whether or not the condition description area condition is satisfied in a cell determined by each row and each column; A storage unit for storing a decision table having
An infinite loop code is output, a break statement is set in the operation description area, and information indicating that the operation of the break statement is executed in each cell of the operation designation area corresponding to the line in which the break statement is set. A setting section to be set;
A recursion detection unit that sequentially scans the cells of the decision table and detects cells in which information for performing a recursion operation is specified in the last row of the decision table;
Based on the detection result of the recursion detection unit, a change unit that changes the information of the cell in the operation designation area corresponding to the row in which the break statement is set to information indicating that the operation of the break statement is not executed;
Based on the detection result of the recursion detection unit, a code for executing repetition is output , the cells in the decision table are sequentially scanned, and information indicating that the operation in the operation description area is executed is included in the cell. A source code generation device comprising: an output unit that outputs an operation corresponding to the row of the cell . And the output unit, the recursive detection result of the detection unit based on the source code generating device according to claim 1, characterized in that for outputting a goto statement to migrate to the top of the source Sukodo. A source code generation method executed by a computer,
A condition description area that divides a plurality of conditions into each line, a condition designation area that specifies information about whether or not the conditions of the condition description area are satisfied in a cell determined by a row and a column, and a plurality of operations for each line A behavior description area that is described separately, and a behavior designation area that designates information about whether or not to execute the behavior depending on whether or not the condition description area condition is satisfied in a cell determined by each row and each column; A decision table having
An infinite loop code is output, a break statement is set in the operation description area, and information indicating that the operation of the break statement is executed in each cell of the operation designation area corresponding to the line in which the break statement is set. Set,
The cells of the decision table are sequentially scanned to detect cells in which information for performing a recursive operation is specified in the last row of the decision table,
Based on the detection result, the cell information of the operation designation area corresponding to the row where the break statement is set is changed to information indicating that the operation of the break statement is not executed,
Based on the detection result, output the code to execute the iteration ,
The cells in the decision table are sequentially scanned, and when the information to execute the operation in the operation description area is included in the cell, each process for outputting the operation corresponding to the row of the cell is executed. A source code generation method characterized by Processing of the output source of claim 3, characterized in that for outputting a goto statement based on the detection result of the process of detecting the operation of recursion in the end of the line, the process proceeds to the beginning of the source Sukodo Code generation method. On the computer,
A condition description area that divides a plurality of conditions into each line, a condition designation area that specifies information about whether or not the conditions of the condition description area are satisfied in a cell determined by a row and a column, and a plurality of operations for each line A behavior description area that is described separately, and a behavior designation area that designates information about whether or not to execute the behavior depending on whether or not the condition description area condition is satisfied in a cell determined by each row and each column; A decision table having
An infinite loop code is output, a break statement is set in the operation description area, and information indicating that the operation of the break statement is executed in each cell of the operation designation area corresponding to the line in which the break statement is set. Set,
The cells of the decision table are sequentially scanned to detect cells in which information for performing a recursive operation is specified in the last row of the decision table,
Based on the detection result, the cell information of the operation designation area corresponding to the row where the break statement is set is changed to information indicating that the operation of the break statement is not executed,
Based on the detection result, output the code to execute the iteration ,
The cells of the decision table are sequentially scanned, and if the information to execute the operation in the operation description area is included in the cell, each process for outputting the operation corresponding to the row of the cell is executed. A source code generation program characterized by Processing of the output source of claim 5, characterized in that for outputting a goto statement based on the detection result of the process of detecting the operation of recursion in the end of the line, the process proceeds to the beginning of the source Sukodo Code generator.

Images