JPH0784773A - Automatic totalization program generator - Google Patents

Abstract

(57) [Summary] [Purpose] The totalization program is automatically obtained by describing the specifications of the totalization program in a specified format description language and operating the automatic program generation device. [Structure] A specification analysis unit 101 analyzes a data item input as a program specification 2 and a plurality of tabulation operation specifications to obtain a tabulation program specification internal representation 102. The start timing determination unit 103 classifies the analyzed totaling operation specifications based on the respective start timings, and obtains the start timing-specific totaling program specifications 104. The operating condition determination unit 105 checks the totaling operation corresponding to each start timing, determines which operating condition item is the first to be determined for the start timing having a plurality of totaling operations, and starts the start operation. An aggregating program internal representation 106 describing which aggregating operation is performed at each timing is obtained. The tally program output unit 107 outputs the tally program internal representation 106 as the tally program 4.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an apparatus for defining a specification of a counting program using an event-triggered programming language and automatically generating the counting program based on the defined specification.

[0002]

2. Description of the Related Art A tally program is used to receive several pieces of data in sequence, to find out the number of pieces of data that meet certain conditions, the sum of certain values contained in the data, and the specific items in the data. It is a program that calculates the total of the results of the calculations and reports these total results when requested to report the total results.

When developing a totaling program, first, what kind of item is to be totaled, what kind of calculation is required for each totaling item, that is, each time the corresponding data is discovered. Whether to increase the value by 1 or add an appropriate value included in the data, etc.-Do you need statistical data such as the sum and average of multiple aggregation items? What is the name of the item, what kind of formula can be used to calculate them, what type of report is required for each aggregated item, and when is the aggregated program to be cleared to zero? Define as a specification.
Next, the developer develops a tally program based on this tally program specification.

[0004]

However, when there are many items to be aggregated and the conditions to be aggregated are complicated, it is difficult to develop an aggregation program without error, and a long development time is required. It was

In order to solve such a problem, various program generating methods have been conventionally proposed. For example, in the "program conversion processing method by term rewriting" disclosed in Japanese Patent Laid-Open No. 3-138729, when input data defining a program is input to a computer language processing system having a term rewriting unit and a plurality of rewriting rules. The rewriting rules are sequentially applied to this input data, and the rewriting result is output as an executable program. However, the method of generating a program that applies a rewrite rule to such input data is often used to simplify a complicated description, and a program with a complicated specification such as an aggregation program is often used. It was unsuitable for generation because the rewriting rules became huge.

Further, the "program generation method and system" described in Japanese Patent Laid-Open No. 3-286226 discloses a process for manipulating data for a data item to be processed.
The source program is generated by defining the program specifications by the conditions for controlling the data operation, and in particular, the conditions and the processes are defined in a table format. Certainly, according to this conventional technique, the condition of the data item to be processed and the process thereof are entered in the table to determine the program specifications, so that there is no inconsistency in the specification description and the description itself. Since it becomes easy, a program can be easily generated based on the specifications. However, even in this conventional technique, since the program itself is generated by the time-series type programming language that has been conventionally adopted, the required specifications do not always occur in a time-series manner like the aggregation program. Not suitable for generating programs. In addition, in the aggregation program, it is sometimes difficult to describe the conditions and processes that determine the specifications of the program in a tabular format, and this conventional technique based on such a tabular format may not be adopted.

Further, in order to solve the above-mentioned problems of the prior art, recently, as in the "event activation type programming language" described in Japanese Patent Laid-Open No. 3-98127, events are discretely distributed. When it occurs, a programming language suitable for performing each processing for each event has been proposed.
When creating a program using this event-triggered programming language, it is only necessary to enumerate the processes corresponding to events based on events without considering the time sequence. Development work becomes easier when compared to languages.

However, the event-triggered programming language disclosed in the above publication uses events and the processes to be triggered by them as the basic unit of program description, and therefore can be applied to a relatively simple program as it is. However, it was not possible to adopt it for a complicated program such as the totalizing program targeted by the present invention.
That is, since this conventional technique only expresses the event and the process corresponding thereto, in other words, only the condition and the process corresponding thereto as an event-triggered programming language, a certain timing such as an aggregation program is set. In such a case, it was impossible to use it as it is for a complicated program that requires conditions and processing according to the timing.

The present invention has the above-mentioned problems of the prior art,
That is, it is proposed in order to solve two problems that a totaling program to be developed is prone to errors and that it takes a long time to develop the totaling program. That is, the purpose of the present invention is to allow a developer to write an aggregate program specification reflecting a user's request based on a specification description language, so that the developer can write the aggregate program specification without actually performing programming work. It is an object of the present invention to provide a tallying program generation device that can immediately obtain a tallying program that accurately reflects the contents.

[0010]

In order to achieve the above-mentioned object, the present invention is characterized by adopting the following means. The definitions of terms used in the invention of each claim are as follows.

(Program specification) A description of data items and operation specifications (including aggregate operation specifications). It is preferable to describe the specifications by keywords and corresponding descriptions. (Data item) An item of data handled by the aggregation program. Described in the program specifications. (Behavioral specifications) Specifications for the overall behavior of the aggregation program. Includes aggregate behavior specifications and other behavior specifications. Described in the program specification. (Aggregation operation specification) Among the operation specifications, the specification regarding the aggregation operation in particular. The description in the specification includes at least the start timing, the operating condition, and the operation content.

First, the invention of claim 1 is a program in which data items handled by an aggregation program and aggregation operation specifications including start timings, operation conditions and operation contents of a plurality of aggregation operations executed by the aggregation program are described. A specification analysis unit that inputs specifications and analyzes data items and each aggregate operation specification from the input program specifications, and each aggregate operation specification analyzed by the specification analysis unit based on each start timing. The present invention is characterized by including a start timing determination unit that obtains the summation program specifications for each start timing, and a summation program output unit that outputs the summation program specifications for each start timing as an executable summation program.

According to a second aspect of the present invention, a program specification describing the data items handled by the tabulation program and the tabulation operation specifications including the start timing, operation conditions and operation contents for a plurality of tabulation operations executed by the tabulation program. , And the specification analysis unit that obtains the internal representation of the totalization program specifications by analyzing the data items and each totalization operation specification from the input program specifications, and each internal representation of the totalization program specifications analyzed by the specification analysis unit. , A start timing determination unit that obtains an aggregate program specification for each start timing and an aggregate operation corresponding to each start timing in the aggregate program specifications for each start timing, and an aggregate operation If there are multiple start-up timings, determine the operating condition item in which order. The operation condition determination order determination unit that obtains the internal representation of the aggregation program that describes which aggregation operation is performed under each condition at each start timing and the aggregation program internal representation. And a totalization program output unit for outputting as an executable totalization program.

According to a third aspect of the present invention, in the invention according to each of the first and second aspects, a constraint analysis unit that analyzes a constraint in inputting a program, a constraint analyzed by the constraint analysis unit, and the inside of the total program. The present invention is characterized by comprising a totalization program output unit for outputting the expression as an executable totalization program.

The invention of claim 4 is characterized in that the start timing, the operation condition and the operation content included in the data item and each operation specification are composed of a keyword and a description corresponding thereto.

[0016]

According to the invention of claim 1 having the above-mentioned configuration, when the program developer inputs a program specification describing data items and a plurality of tabulation operation specifications into the specification input section, the specification is written in the specification. The start timing of each totaling operation, the operating condition, and the corresponding operation content described are analyzed by the specification analysis unit into a format understandable by the present apparatus. Next, the analyzed totaling operation specifications are classified by the start-timing determining unit based on the respective start-up timings to obtain the timing-specific totaling program specifications. In this timing-specific aggregate program specification, the operation condition classified for each start timing and the operation content corresponding thereto can be described by a conventionally known specification description language for describing the operation condition and operation content. Therefore, if the totalization program specifications to be input to this device are described in advance in the specification description language, even if a complicated totalization program is required for operation timing, the totalization program that can be executed from the timing-specific totalization program specifications It can be easily generated.

In the invention of claim 2, the above-mentioned claim 1
In addition to the invention described above, the operation condition determination order determination unit checks the aggregation operation corresponding to each activation timing in the aggregation program specification by activation timing, and the item of the operation condition for the activation timing having a plurality of aggregation operations. It is determined whether it is optimal to first determine. As a result, it is possible to determine what kind of operation content should be performed under what kind of condition by the minimum condition determining operation, and it is possible to obtain a program excellent in execution efficiency.

According to the third aspect of the invention, in addition to the data items and operation specifications according to the totalization program specification, the restrictions on the program realization can be reflected in the executable totalization program.

In the invention of claim 4, since the data item and each operation specification are described in a form including the keyword, it is possible to easily judge the data item and analyze each operation specification. Particularly, by analyzing the operation specification according to the keyword, the start timing determination unit can easily select the specification regarding the start timing from the analyzed specifications.

[0020]

The content of the present invention will be described in detail below based on an embodiment of the present invention.

(1) Overall Configuration of Device--FIG. 1 FIG. 1 is a configuration diagram showing the relationship between the automatic program generation device in this embodiment and the outside thereof. The automatic program generation device 1 receives the totalization program specification 2 and the constraint 3 for realizing the program and generates the totalization program 4. Here, the developer gives the total program specification and the restrictions for realizing the program.

(2) Operation of the device ... FIG. 2 FIG. 2 is a block diagram for explaining how the counting program generated by the automatic program generation device in this embodiment operates. In the aggregation device 10, the aggregation program 4
Receives sequentially the data received by the original data receiving device.
Then, the totaling program 4 examines the data, determines the items to be totaled, and updates the totaling values stored in the totaling data 6 to be updated. Further, the totalization program 4 receives a totalization result report command input from the keyboard 8 via the totalization monitoring device 7. At this time, the tallying program 4 puts together the tallying results in a prepared format based on the tallying results stored in the tallying data 6, and outputs the results to the display device 9 via the tallying monitoring device 7. Further, the totalization program 4 receives a totalization data clear command from the keyboard 8 via the totalization monitoring device. At this time, the counting program 4 clears all the counting items stored in the counting data 6 to zero.

(3) Details of Device Configuration--FIG. 3 Next, the configuration and operation of the automatic program generation device 1 will be described in some detail. FIG. 3 is a block diagram for explaining the inside of the program automatic generation device 1 shown in FIG. The automatic program generation apparatus 1 includes a program specification 2 in which data items handled by a tally program and tally operation specifications including start timings, operation conditions and operation contents of a plurality of tally operations executed by the tally program are described. A specification analysis unit 101 is provided, which analyzes the data items input as the program specification 2 and each totaling operation specification to obtain the totaling program specification internal representation 102. Further, it has a start timing determination unit 103 that classifies each totaling operation specification analyzed by the specification analysis unit 101 based on each start timing and obtains a total program specification 104 for each start timing.

The activation timing determination unit 103 checks the aggregation operation corresponding to each activation timing in the aggregation program specification 104 for each activation timing, and in regard to the activation timing having a plurality of aggregation operations, the operation condition item in which order. The operation condition determination order determination unit 1 which determines whether it is optimal to determine and obtains the aggregation program internal representation 106 that describes which aggregation operation is performed at each activation timing.
05 is connected. Further, the operating condition determination rank determining unit 105 changes the aggregation program internal representation 106 to
A totaling program output unit 107 that outputs the totaling program 4 is provided.

Further, there is provided a constraint analysis unit 110 for inputting the constraint 3 for realizing the totalization program and analyzing the content thereof in a format understandable by the present apparatus. In the present embodiment, since the declaration of data used in the aggregation program, the procedure of message transmission, the procedure of message reception, etc. are given as constraints for program realization without being described in the program specifications, the constraint analysis unit 110 analyzes them. Each constraint on the realized program is accumulated as a transmission / reception message procedure library 111 and a total data internal area creation library 112, and is given to the total program output unit 107 together with the total program internal representation 106.

(4) Specification analysis unit 101 ... FIG. 4 As described in (3) above, the tabulation program specification folding unit 10 constituting the automatic program generation apparatus 1 of this embodiment.
In step 1, a developer reads a totalization program specification 2 created by an event-triggered specification description language, and creates a totalization program internal representation 102 that has the same meaning as this and can be understood by the present apparatus. FIG. 4 is a description example of the tabulation program specification 2 in the specification description language.

The totaling program specification is written here using a list structure, and includes four main specifications: reception message, transmission message, data items used internally, and totaling operation. In each specification, the first atom in the list is the keyword r message, s me
message, data, when, which identifies what the list specifies.

The received message is (r message internal name message receiving means). Here, the internal name is a blank, an appropriate character string that does not include a line feed, and the message receiving means is a procedure name of the program. The substance of the program corresponding to the message receiving means is described in Constraint 3 for realizing the program.
When the same name appears in the summary program specification after that, it means that the message has arrived and can be known by the message receiving means.

The transmitted message is (s message internal name message sending means). Here, the internal name is a blank, an appropriate character string that does not include a line feed, and the message transmission means is a procedure name of the program. The substance of the program corresponding to the message transmitting means is described in Constraint 3 for implementing the program.
When the same name appears in the tabulation program specification thereafter, it is interpreted as meaning a message transmission command achieved by the message transmission means.

Data items used internally are written in the format (data internal name size data format). Here, the internal name is blank, an appropriate character string that does not include a line feed, the size is either number + byte or number + bit, and the data format is binary, bc.
d, time Write one of the forms. When a data item of this format is specified, the totaling program 4 creates a description area of the size specified here in the totaling data 6 of FIG. And the inside is used in the format specified by the data format. Further, when this internal name appears in the tabulation program specification after that, it is interpreted as meaning the created description area.

The totaling operation is written in a format of (where start timing if operating condition then operating content). Where, if, then
Indicates that each is a keyword, which is followed by activation timing, operation conditions, and operation contents. However, when it is desired to always perform the operation described in the operation content with respect to the activation timing, the keyword if and the operation condition are omitted. For the activation timing, write the internal name of the received message. The operation conditions and how to write the operation contents will be described later. The tabulation specification means that when the received message corresponding to the activation timing is received, the operation condition is judged, and if the result is true, all the operations described in the operation content are performed in the order described.

The operating condition is to write one or more items of the form (data name value) or (data name value 1 value 2) side by side. Here, the data name describes the internal name of the data item used internally. Also, value, value1, and value2 are all decimal numbers or 1
The hexadecimal number or the data format of the corresponding data name is t
ime In the case of form, time format data such as 0:00 or 12:00 is written. When the operating condition is evaluated, the operating condition of the form (data name value) is true when the numerical values of the data items pointed to by the data name are equal, and is false otherwise. In addition, the operation condition of the format (data name value 1 value 2) is true if the numerical value of the data item pointed to by the data name is greater than or equal to the numerical value of 1 and less than or equal to the numerical value of 2, and false otherwise. Become. When there is one item of operating condition, the item is true, and when there are two or more items, when all items are true, this operating condition is true.

As the operation content, one or more items of the form (data name operation) or (message) are arranged and written. Here, the data name describes the internal name of the data item used internally. The message also describes the internal designation of the outgoing message.

The operation is selected from + value, = value, and (expression). The value is decimal or hexadecimal, or the data format of the data name of the operation content is time. fo
In case of rm, write the time format numerical value. These mean adding a numerical value indicated by a value, substituting a numerical value indicated by a value, and substituting the operation result of an expression into the storage area of the aggregated data 6 referred to by each data name. Further, the operation content in the form of (message) means that the corresponding message is transmitted.

The expression is selected from the following: expression + data name or value expression-data name or value expression * data name or value expression / data name or value data name or value. The data name is an internal name of a data item used internally, and its value is a decimal or hexadecimal number, or the data format of the data name of the operation content is time.
In case of form, write the time format numerical value. It means adding, subtracting, multiplying, and dividing the calculation result of the expression on the left side of each operator and the evaluation result of the data name or value, and using the evaluation result of the data name or value as the calculation result of the expression. You cannot specify multiplication or division for the time format data format.

There is a method in which the reception message and the transmission message are not described in the totalization program specification 2 but are described in the constraint 3 for program realization, but the same totalization program 4 can be derived by this method. .
However, in the case of such a specification, the constraint solving unit 110 for implementing the program needs a function for solving received messages and transmitted messages. Moreover, the internal representation of the received message and the transmitted message obtained as a result of the solution is necessary for the operation of the activation timing determination unit 103.

(5) Startup Timing Judgment Unit 103 ... FIG. 5, FIG. 6 Based on the specifications regarding the aggregation operation of the aggregation program specification internal representation 102 analyzed by the specification analysis unit 101 described in (4) above, particularly regarding the aggregation operation. Then, the summing program specification 104 for each start timing is created.

FIG. 5 is a block diagram for explaining an example of the data structure of the start-up timing-specific aggregate program specification 104. The start-up timing-specific aggregate program specification 104 is a summary of the specifications related to the aggregate operation of the aggregate program specification internal representation 102 for each startup timing, and the presence of a corresponding received message is confirmed.

FIG. 6 is a flow chart showing the operation of the start timing determination unit 103 to obtain the start timing summary program specification 104 as shown in FIG. The operation of the activation timing determination unit 103 will be described below with reference to FIG. The activation timing determination unit 103 first fetches the specifications of the aggregation program specification internal representation 102 one by one (step 601). Then, it is determined whether the specification is related to the aggregation operation or not (step 60
2) If the specification is not for totaling operation, the following specification is taken out. On the other hand, if it is a specification related to the tabulation operation, the activation timing is checked (step 603). If the timing is not yet registered in the activation timing determination unit, it is registered (step 604). And
In any case, the specification relating to the totaling operation is registered in relation to the registered activation timing (step 605). When all the specifications have been checked, it is then checked whether the startup timing registered in the startup timing determination unit has the specifications for the corresponding received message. First, the registered origins are taken out one by one (step 606). Then, it is checked whether there is a specification of a received message having an internal name corresponding to the activation timing. If there is no corresponding received message specification, an error message is output (step 607) and the processing is stopped. When it is found that there are specifications of the received message corresponding to all registered activation timings, the activation timing determination unit 103 ends normally (step 60).
8) (6) Operating condition determination ranking determination unit 105 ... FIGS. 7 and 8
10 to 10 In the aggregation program specification 104 for each start timing obtained by the start timing determination unit 103 in (5) above, various operation contents and conditions for executing the operation are provided for each start timing as shown in FIG. It is classified and described. The operating condition determination order determination unit 105 includes a startup timing determination unit 103.
For each timing determined in step 1, the operation content performed at that timing and the conditions for executing the operation content are analyzed, and the totalization program internal representation 106 described in a format that can be converted into the totalization program is obtained. It is a thing. In particular, in the present embodiment, the operation condition determination order determination unit 105 considers under what kind of conditions and what kind of operation contents should be performed by the minimum condition determination operation. Has become.

FIG. 7 illustrates an example of the data structure of the aggregation program internal representation 106 obtained by the operation condition determination rank determining unit 105 with reference to a block diagram.
When the data arrival message is received, the totaling program internal representation 106 first checks whether the entry / exit flag is 0, and changes the next condition determination operation depending on whether the result is true or false. . By determining the data in this order, 2
It is possible to determine the operation content to be totaled by performing the condition determination operation once.

FIGS. 8 to 10 are for explaining the operation of the above-mentioned operation condition judging order determining section 105 by using a flow chart. Hereinafter, the operation of the operation condition determination order determination unit 105 will be described with reference to FIGS.

First, as shown in FIG. 8, the operating condition determination ranking determination unit 105 sequentially extracts the activation timings one by one from the aggregation program specifications 104 for each activation timing (step 801). This start timing is accompanied by a counting operation that starts at that timing. Next, all of the attached counting operations are extracted (step 802),
The processing unit A is called with this as an argument (step 80).
3). This processing unit A returns the optimum judgment program for judging the necessity / unnecessity of the operation for the given totalizing operation, and the blocks of the program corresponding to the contents of those operations. The blocks of this program are combined with the activation timing (step 804) to create an internal representation of the program to be executed at the activation timing. An internal representation of a program to be executed for all start timings is created and is used as the totalization program internal representation 106.

Next, the processing performed by the processing section A will be described with reference to FIGS. 9 and 10. The processing unit A receives, as an argument, a description corresponding to if operation conditions and then operation contents of one or a plurality of totaling operations. Then, the operation content to be executed in the totaling operation is judged, and the program for executing the operation is returned.

First, as shown in FIG. 9, the processing unit A determines whether the totalizing operation is one or more (step 805). When there is only one totaling operation, the operation condition and the operation content are returned as they are because they are the same regardless of which operation condition item is evaluated (step 823). Next, when there are a plurality of tabulation operations, it is considered which operation condition item is best to judge first. First, items of all operating conditions included in the corresponding totalizing operation are listed up and duplicates are removed (step 806). After that, the items of the operation condition are selected one by one (step 807), and when the item is judged, the number of totalizing operations targeted is narrowed down, that is, the totaling operation in which the item is included in the operating condition, and the operating condition is exactly the same as the item. The number of totaling operations including items having a negative relationship is counted (step 808). Then, the item of the operating condition having the largest number is selected (steps 809 and 810).

As for the determination of the item of the operation condition selected in this way, the totalizing operation that can be executed when the result is true, the totalizing operation that can be executed when the result is false, and the execution regardless of the item. There are generally three types of tallying operations to obtain. Therefore, the programs corresponding to these are named B, C, and D, and then they are obtained. That is, as shown in FIG. 10, the totaling operation including the operating condition item in the operating condition is listed from the original totaling operation (step 811), and the operating condition item is removed from these operating conditions. (Step 812) Then, the processing unit A is recursively called with the obtained specification as an argument (step 813). The execution result is B (step 814).

Similarly, a totaling operation including an item having a logical negation relationship with the item of the operating condition in the operating condition is listed (step 815), the item of the operating condition is removed (step 816), and the obtained value is obtained. The processing unit A is recursively called with the specified specifications as an argument (step 817). The execution result is C (step 818). Further, the operation condition is listed as a totaling operation that does not include the item of the operation condition or the item having the logical negation relationship with it (step 819), and the processing unit A is recursively activated with this as an argument ( Step 820). The execution result is D (step 821). Finally, they are combined into the form of the program (step 822) to obtain the internal representation of the program.

(7) Restriction on program realization ... FIG. 3 Based on the internal representation 106 of the totalizing program obtained as described in (6) above, an equivalent totalizing program 4 is generated. However, in this embodiment, since the aggregation program internal representation 106 is generated based on the aggregation operation specification described in the program specification, the data declaration used in the program, the message transmission procedure, and the message reception procedure are Not included. Therefore, the declaration of the data to be used is created by extracting the necessary procedure from the aggregated data internal area creation library 112 based on the data items used inside the aggregated program specification internal representation 103. The message transmission procedure is required from the transmission / reception message procedure library 111 by referring to the transmission message of the aggregation program specification internal representation 102 to obtain the procedure name based on the name of the transmission message used in the aggregation program internal representation. Create by extracting procedures. The message receiving procedure is required from the procedure library 111 for sending and receiving messages by obtaining the procedure name by referring to the received message in the tabulation program specification internal representation 102 based on the name of the received message used in the tabulation program internal representation. Create by extracting procedures.

(8) Effects of the Embodiment As described above, the program generating apparatus according to the present embodiment classifies a plurality of totaling operation specifications described in the program specifications for each start timing to generate the totalizing program specifications for each start timing. After the acquisition, the condition and the processing corresponding thereto are analyzed at each start timing to generate a program to be executed. Therefore, according to this embodiment,
Even if it is a complicated program that has operation contents and various conditions for executing them, and even if the timing is different even under the same conditions, the timing and operation of a complicated program By simply describing the conditions and operation contents in the program specifications, it is possible to automatically generate an aggregation program in consideration of all of these specifications. Moreover, in this embodiment, the timing activation determination unit 10
Since each operation specification is classified by timing according to 3,
For other items in the operation specification, that is, the operation condition and the operation content corresponding thereto, the program specification can be easily executed into a program by using a conventionally known event-triggered specification description language. .

In particular, the present embodiment not only classifies a plurality of tabulation operation specifications according to start timings, but also when the operation condition determination order determination unit 105 has a plurality of operation contents at the same timing, the operation contents Since the operation condition corresponding to can be judged by the minimum condition judgment operation, the totaling program internal representation 106 described
Is simplified, and the aggregation program 4 based on it can be easily generated. Also, the obtained totalizing program 4 has a simple structure and has an advantage of high execution speed.

Further, in this embodiment, since the keyword is used when describing the data item and the operation specification, the data item and each operation specification can be identified very easily, and the start timing judging section can classify the start timings. It becomes easy to create a totaling program specification and to determine from which operating condition the operating condition determination order determination unit determines.

(9) Other Embodiments In the illustrated embodiment, when the operation condition determination order determination unit 105 has a plurality of operation contents at one timing,
We have determined that it is best to first determine which operation condition applies to which operation condition. However, if one timing has few operation contents and most timings have only one operation condition and operation content, or If there is no particular limitation on the program execution speed or complication, the totalization program 4 according to the totalization program specification 104 obtained by the start timing determination unit 103.
Can also be generated.

In the illustrated embodiment, the data item and each operation specification are described by the keyword and the content corresponding to the keyword. However, if the data item and each operation specification can be identified from the description content, the keyword is not always used. do not have to.

Although the illustrated embodiment has been described focusing on the specifications relating to the totalizing operation in the totalizing program, it goes without saying that the actual totaling program often requires specifications relating to operations other than the totalizing operation. With respect to such general operation specifications, it is possible to automatically generate a program by the same method as the above-mentioned specification regarding the total operation. In many cases, it is simpler than the aggregation program because the timing is not required. Therefore, such a part of the totalization program is described as a constraint for program realization as shown in FIG. 3 of the present embodiment, or the program is directly described by using a conventionally known event-triggered programming language. It is also possible to combine or use methods such as term rewriting.

[0054]

As described above, according to the present invention,
The developer can accurately describe the specifications of the totaling program in the specified format specification language, and by simply operating the automatic program generation device by combining the restrictions for realizing the program prepared in advance, the totaling program It is possible to quickly obtain an aggregation program that accurately reflects the specifications. As a result, it is possible to suppress errors that often occur due to the developer's own development, and it is possible to shorten the program development time.

[Brief description of drawings]

FIG. 1 is a configuration diagram schematically showing the configuration of an aggregate program automatic generation device of the present invention.

FIG. 2 is a configuration diagram showing a usage state of a tallying program obtained by the tallying program automatic generation device of the present invention.

FIG. 3 is a block diagram showing the configuration of the totalization program automatic generation device of the present invention in more detail.

FIG. 4 is a diagram showing a description example of a totalization program specification that is input to the totalization program automatic generation device of the present invention.

FIG. 5 is a diagram showing an example of the structure of a start-up timing-based totalization program obtained by the totalization program automatic generation device of the present invention.

FIG. 6 is a flowchart showing an operation example of a start timing determination unit that constitutes the totalization program automatic generation device of the present invention.

FIG. 7 is a diagram showing an example of the structure of an internal representation of an aggregate program obtained by the aggregate program automatic generation device of the present invention.

FIG. 8 is a flowchart showing the operation of an operation condition determination order determination unit that constitutes the totalization program automatic generation device of the present invention.

9 is a flowchart showing the operation of an operation condition determination order determination unit that constitutes the totalization program automatic generation device of the present invention, and is step 80 in the flowchart of FIG.
The figure which shows the detail of 3 parts.

10 is a flow chart showing the operation of an operation condition determination order determination unit that constitutes the totalization program automatic generation device of the present invention, and is a diagram continued to the part marked with * in the flow chart of FIG.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 ... Automatic program generation device 2 ... Aggregation program specification 3 ... Restriction on program implementation 4 ... Aggregation program 101 ... Specification analysis unit 102 ... Aggregation program specification internal representation 103 ... Activation timing determination unit 104 ... Aggregation program specification by activation timing 105 ... Operating condition determination order determination unit 106 ... Aggregation program internal representation 107 ... Aggregation program output unit 110 ... Constraint analysis unit 111 ... Send / receive message procedure library 112 ... Aggregation data internal area creation library

Claims (4)

[Claims] 1. Data items handled by an aggregation program,
Enter the program specifications that describe the start timing, operation conditions, and aggregate operation specifications including the operation contents for multiple aggregate operations executed by the aggregate program, and enter the data items and each aggregate operation specification from the input program specifications. And a start timing determination unit that classifies the totaling operation specifications analyzed by the specification analyzing unit based on their respective start timings to obtain the total program specifications for each start timing, and the start An aggregate program automatic generation device comprising: an aggregate program output unit that outputs an aggregate program specification for each timing as an executable aggregate program. 2. A data item handled by a counting program,
Enter the program specifications that describe the start timing, operation conditions, and aggregate operation specifications including the operation contents for multiple aggregate operations executed by the aggregate program, and enter the data items and each aggregate operation specification from the input program specifications. And a specification analysis unit that obtains an internal representation of the aggregation program specification by analyzing each of the aggregation program specification internal representations analyzed by the specification analysis unit based on each activation timing, and aggregation program specifications by activation timing And a start timing determination unit that obtains
For startup timings with multiple aggregation operations, it is determined in what order it is best to determine the items of the operation conditions, and the aggregation that describes under which conditions each aggregation operation is performed An automatic totalization program generation device comprising: an operating condition determination order determination unit that obtains a program internal expression; and a totalization program output unit that outputs the totalization program internal expression as an executable totalization program. 3. A constraint analysis section for analyzing the constraints on the input program realization, and a totalization program output section for outputting the constraints analyzed by the constraint analysis section as an executable totalization program. 3. The totalization program automatic generation device according to claim 1 or 2. 4. A data item and an activation timing, an operation condition and an operation content included in each operation specification are composed of a keyword and a description corresponding to the keyword.
An aggregate program automatic generation device according to claim 2 or claim 3.