JP2007094922A - Automatic program generation, method, and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To allow an automatic program generator to automatically add exception handling to a program. <P>SOLUTION: A graphic data generation means 111 generates graphic data in receipt of an instruction from a user. A source code generation means 120 generates a compilable program source code from the graphic data. An exception handling reception means 112 receives the source code for exception handling to be carried out when a status is different from any status defined by the graphic data. An exception handling embedding means 130 embeds the exception handling source code in the program source code to output it as a new program source code 200. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to an automatic program generation device, method, and program, and more particularly, to an automatic program generation device, method, and program for generating a program from graphic data that represents the behavior of the program in graphic format.

  Conventionally, it is well known that the behavior of a program is represented by a state transition diagram. The standard notation method of the state transition diagram is also defined as a UML (Unified Modeling Language) state machine diagram. Also, an apparatus for automatically generating a program source code based on a program specification described based on a state transition diagram has been proposed (see, for example, Patent Document 1).

FIG. 9 is a flowchart showing a procedure of automatic generation processing for automatically generating a program by a conventional automatic program generation device.
The conventional automatic program generation device generates a state transition diagram in response to an instruction from the user via an input unit such as a keyboard or a mouse (step S31). Then, the program automatic generation device automatically generates a source code corresponding to the generated state transition diagram (step S32).

FIG. 10 is a flowchart showing the behavior of a program generated by a conventional automatic program generation device.
The generated program is processed to wait for the occurrence of an event (step S41), and when an event occurs, a process for determining the current state is performed (step S42). Then, processing for determining the transition destination state is performed for each determined current state based on the occurrence event and the guard condition (step S43), and processing for updating to the determined transition destination state is performed (step S44).

FIG. 11 is a diagram showing an outline of the contents of a program source code generated by a conventional automatic program generation device.
The program source code 400 shows an outline of the contents of the program source code generated by the conventional automatic program generation device. The program source code 400 indicates a source code when the program source code is generated in the C language format. The contents described in the program source code 400 correspond to each process of the flowchart shown in FIG.

  The third line starting from “if” from the top corresponds to the process in step S41 of the flowchart shown in FIG. That is, a process of waiting for the occurrence of an event is performed. The line starting from “switch” on the fourth line from the top corresponds to the processing in step S42 in the flowchart shown in FIG. That is, the current state is determined, and a transition destination is determined according to the occurrence event and the guard condition for each determined current state. The transition destination process is each process enclosed in parentheses starting from “{” at the end of this line.

When the state of the program is from state 0 to 1, 2, 3,..., N−1, n, the “break state” including the line “case state 0;” in the fifth line from the top is included. ; ”Is a code that is executed when it is determined that the three lines up to the line written as“ 0 ”are in the state 0, and corresponds to the process of step S43a in the flowchart shown in FIG. Similarly, the code that is executed when three lines up to the line written as “break;” including the line written as “case state 1;” on the eighth line from the top are determined to be in state 1 3 corresponding to the processing of step S43b in the flowchart shown in FIG. 10, including the line “case state n;” on the 12th line from the top to the line “break;”. This code is executed when it is determined that the line is in the state n, and corresponds to the process of step S43d in the flowchart shown in FIG. The third line starting from “current” from the bottom corresponds to the process in step S44 of the flowchart shown in FIG.
JP 7-78076 A

  However, in the source code generated by the conventional automatic program generation device, the memory area that holds the current state is rewritten for some reason other than the processing indicated by the source code, and all the current states assumed In the above example, there is no exception handling when the state does not apply to any state defined from state 0 to 1, 2, 3,..., N−1, n. . The fact that the current state does not apply to all states clearly means that the program is operating abnormally, and depending on the target system, leaving the abnormal state may lead to a fatal failure. For this reason, it is necessary to take measures such as issuing a warning or stopping the function of the system in some cases. In other words, when this program is executed as a part of an actual system, the reliability of the source code is low. For this reason, there has conventionally been a problem that automatic generation can be applied only to a portion where it can be determined that there is no problem even if there is no exception handling. There is also a problem that if it is determined that there is a problem without exception handling, exception handling must be manually added to the automatically generated source code. That is, the merit of automatically generating a program has been lost.

  The present invention has been made in view of these points, and an object thereof is to provide an automatic program generation apparatus, method, and program capable of automatically adding exception processing to a program.

  In the present invention, in order to solve the above-described problem, a diagram of generating the diagram format data in response to an instruction from a user in an automatic program generation device that generates a program from diagram format data expressing the behavior of the program in a diagram format Format data generation means, source code generation means for generating compilable program source code from the diagram format data, and source code for exception processing that is performed when any state defined by the diagram format data is different There is provided an automatic program generation apparatus comprising: an exception process accepting unit; and an exception process embedding unit that embeds the exception process source code in the program source code and outputs the program as a new program source code.

  According to such an automatic program generation device, the graphic data generation means generates graphic data in response to an instruction from the user. Source code generation means generates compilable program source code from graphic data. The exception process accepting unit accepts a source code of exception process to be performed when different from any state defined by the graphic data. The exception processing embedding means embeds the exception processing source code in the program source code and outputs it as a new program source code.

  Further, in the present invention, in a program automatic generation method for generating a program from diagram format data representing the behavior of the program in diagram format, diagram format data generation means generates the diagram format data in response to an instruction from a user. And a step in which the source code generating means generates a program source code that can be compiled from the graphic data, and an exception processing accepting means is performed when it is different from any state defined in the graphic data. Receiving a source code of exception processing; and an exception processing embedding unit that embeds the source code of exception processing in the program source code and outputs the program as a new program source code. A generation method is provided.

  According to such a program automatic generation method, the graphic data generation means generates graphic data in response to an instruction from the user. Source code generation means generates compilable program source code from graphic data. The exception process accepting unit accepts a source code of exception process to be performed when different from any state defined by the graphic data. The exception processing embedding means embeds the exception processing source code in the program source code and outputs it as a new program source code.

  Further, in the present invention, in a program automatic generation program for generating a program from diagram format data expressing the behavior of the program in diagram format, diagram format data for generating the diagram format data in response to an instruction from a user to a computer Generating means, source code generating means for generating compilable program source code from the diagram format data, exception processing acceptance for receiving source code of exception processing performed when different from any state defined in the diagram format data And an automatic program generation program characterized by functioning as an exception processing embedding means for embedding the source code of the exception processing in the program source code and outputting it as a new program source code.

  According to such a program automatic generation program, the graphic data generation means generates graphic data in response to an instruction from the user. Source code generation means generates compilable program source code from graphic data. The exception process accepting unit accepts a source code of exception process to be performed when different from any state defined by the graphic data. The exception processing embedding means embeds the exception processing source code in the program source code and outputs it as a new program source code.

  According to the program automatic generation apparatus, method, and program of the present invention, exception processing can be automatically added to the program, so that the program is automatically generated regardless of whether there is a problem if there is no exception processing. be able to. Also, it is not necessary to add exception handling manually. Therefore, the merit of automatically generating the program is improved.

Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.
FIG. 1 is a conceptual diagram of the invention applied to this embodiment. As shown in FIG. 1, the automatic program generation device 100 includes a data reception unit 110, a source code generation unit 120, and an exception process embedding unit 130. The data receiving unit 110 includes a diagram format data generating unit 111 and an exception process receiving unit 112. The data receiving unit 110 receives a user instruction via the input unit 12 and generates graphic data and receives exception processing. The generated graphic data and the accepted exception process are sequentially displayed on the monitor 11. The figure format data generation unit 111 receives an instruction from the user via the input unit 12 and generates figure format data representing a program that the user wants to generate. The exception processing accepting unit 112 accepts exception processing source code for performing exception processing from the user via the input unit 12.

  When the source code generation unit 120 receives the diagram format data from the diagram format data generation unit 111, the source code generation unit 120 generates a source code for realizing the program expressed as the diagram format data based on the diagram format data. The exception processing embedding unit 130 receives the exception processing source code received by the exception processing receiving unit 112. Further, the source code generated by the source code generation means 120 (hereinafter referred to as generated source code) is received. Then, the exception processing source code is embedded at a predetermined position of the generated source code. And it outputs as the new program source code 200 which can perform exception processing.

  As described above, the automatic program generation apparatus 100 can automatically embed the exception processing source code in the generated source code by the exception processing embedding unit 130 and output it as the program source code 200 that can newly perform the exception processing. Regardless of whether exception processing is necessary or not, the automatic program generation apparatus 100 can be used to automatically generate a program. In addition, since exception processing can be automatically embedded in a necessary place, a program including an exception processing function can be easily generated automatically.

  FIG. 2 is a diagram illustrating a hardware configuration example of the automatic program generation device used in the present embodiment. The entire automatic program generation apparatus 100 is controlled by a CPU (Central Processing Unit) 101. A random access memory (RAM) 102, a hard disk drive (HDD) 103, a graphics processing device 104, and an input interface 105 are connected to the CPU 101 via a bus 106.

  The RAM 102 temporarily stores at least a part of OS programs and application programs to be executed by the CPU 101. The RAM 102 stores various data necessary for processing by the CPU 101. The HDD 103 stores an OS (Operating System) and application programs.

  A monitor 11 is connected to the graphic processing device 104. The graphic processing device 104 displays an image on the screen of the monitor 11 in accordance with a command from the CPU 101. A keyboard 12a and a mouse 12b are connected to the input interface 105. The input interface 105 transmits a signal transmitted from the keyboard 12 a and the mouse 12 b to the CPU 101 via the bus 106. With the hardware configuration as described above, the processing functions of the present embodiment can be realized.

  FIG. 3 is a flowchart showing a procedure of automatic generation processing for automatically generating a program by the automatic program generation device of the present embodiment. Hereinafter, the process illustrated in FIG. 3 will be described in order of step number.

  [Step S11] The graphic data generation unit 111 receives an instruction from the user input via the input unit 12. Based on this instruction, a state transition diagram representing diagram behavior and representing the behavior of the program is generated.

[Step S12] The exception process accepting unit 112 accepts an exception process source code input via the input unit 12.
[Step S13] The source code generation unit 120 receives a state transition diagram from the diagram data generation unit 111. Then, based on the received state transition diagram, the source code of the program that performs the process represented by the state transition diagram is automatically generated.

  [Step S14] The exception processing embedding unit 130 receives the generated source code from the source code generating unit 120. Also, the exception processing source code is received from the exception processing receiving means 112. Then, the exception processing source code is embedded at a predetermined position of the generated source code and output as a new program source code 200.

FIG. 4 is a flowchart showing the behavior of the program generated by the automatic program generation device of this embodiment. In the following, the process illustrated in FIG. 4 will be described in order of step number.
[Step S21] The occurrence of an event is determined. If an event occurs, the process proceeds to step S22.

  [Step S22] The current state is determined. If it is determined that the state is 0, the process proceeds to step S23a. If it is determined that the state is 1, the process proceeds to step S23b. If it is determined that the state is n-1, the process proceeds to step S23c. If it is determined that the state is n, the process proceeds to step S23d. If it is determined that states 0 to n are not applicable, the process proceeds to step S25.

[Step S23] The transition destination state is determined according to the occurrence event and the guard condition for each current state.
[Step S24] The state is updated to the determined transition destination state, and the process proceeds to Step S21.

[Step S25] Exception processing Exception processing represented by source code is performed, and the processing proceeds to step S21.
FIG. 5 is a diagram showing an outline of the program source code generated by the automatic program generation device of the present embodiment.

  A program source code 201 shows an outline of the program source code 200 generated by the automatic program generation device 100. A program source code 201 indicates a source code when the program source code 200 is generated in the C language format. The contents described in the program source code 201 correspond to each process of the flowchart shown in FIG.

  The third line starting from “if” from the top corresponds to the process of step S21 in the flowchart shown in FIG. That is, a process of waiting for the occurrence of an event is performed. The line starting from “switch” on the fourth line from the top corresponds to the processing in step S22 of the flowchart shown in FIG. That is, the current state is determined. Further, the process of determining the transition destination by the occurrence event and the guard condition for each determined current state is each process enclosed in parentheses starting from “{” at the back of this line.

  When the state of the program is from state 0 to 1, 2, 3,..., N−1, n, the “break state” including the line “case state 0;” in the fifth line from the top is included. ; ”Is a code executed when three lines up to a line written as“ ”are determined to be in the state 0, and corresponds to the process of step S23a of the flowchart shown in FIG. Similarly, the code that is executed when three lines up to the line written as “break;” including the line written as “case state 1;” on the eighth line from the top are determined to be in state 1 4 corresponding to the processing in step S23b in the flowchart shown in FIG. 4, including the line “case state n;” on the 12th line from the top to the line “break;” 3 This code is executed when it is determined that the line is in the state n, and corresponds to the process of step S23d in the flowchart shown in FIG.

  This is a process that is performed when three lines from the bottom to the line written “break;” including the line written “default;” on the seventh line change from the above state 0 to a state other than n. . That is, the code in the portion surrounded by the dotted line in the program source code 201 shown in FIG. 5 is the exception processing source code 210, and corresponds to the processing in step S25 of the flowchart shown in FIG. The third line starting from “current” from the bottom corresponds to the process in step S24 of the flowchart shown in FIG. That is, the state is updated to the determined transition destination state.

FIG. 6 is a diagram illustrating an example of display of data received by the data receiving unit.
The display example 300 is a display example when the data receiving unit 110 receives data input via the input unit 12 and outputs the data to the monitor 11. The display example 300 shows a state transition diagram and an exception activity, and states 311, 312, 313, transitions 321, 322, 323, 324, 325, labels 331, 332, 333, 334, 335, and exception activity. 370 represents the behavior of the program. The label 331 includes an event 341, a guard condition 351, and an action expression 361. Similarly, the label 332 includes an event 342, a guard condition 352, and an action expression 362. The label 333 includes an event 343, a guard condition 353, and an action expression 363, and the label 334 includes the event 342. 344, a guard condition 354, and an action expression 364. The label 335 includes an event 345, a guard condition 355, and an action expression 365.

  A transition 321 indicates a transition from the state 311 to the state 312 and is associated with the label 331. That is, in the state 311, when “event1” shown in the event 341 occurs and the condition of “x == 1” shown in the guard condition 351 is satisfied, it is shown in the action expression 361. “A = x + 1” is executed, and the state transitions to the state 312.

  Similarly, transition 322 indicates a transition from state 312 to state 311 and is associated with label 332. That is, in the state 312, when “event2_1” shown in the event 342 occurs and the condition of “x == 2” shown in the guard condition 352 is satisfied, it is shown in the action expression 362. “A = x + 2” is executed, the state transitions to the state 311, and the transition 323 indicates that the state 312 is advanced to the state 313, and the label 333 is associated therewith. That is, in the state 312, when “event2_2” shown in the event 343 occurs and the condition “x == 3” shown in the guard condition 353 is satisfied, it is shown in the action expression 363. “A = x + 3” is executed, and the state transitions to the state 313.

  A transition 324 indicates that the state 313 is advanced to the state 312, and the label 334 is associated with the transition 324. That is, in the state 313, when “event3_1” shown in the event 344 occurs and the condition of “x == 4” shown in the guard condition 354 is satisfied, it is shown in the action expression 364. “A = x−3” is executed, the state transitions to the state 312, and the transition 325 indicates that the state 313 proceeds to the state 311, and the label 335 is associated therewith. That is, in the state 313, when “event3_2” shown in the event 345 occurs and the condition of “x == 5” shown in the guard condition 355 is satisfied, it is shown in the action expression 365. “A = 0” is executed, and the state transitions to the state 311.

  In addition, the exception activity 370 describes, as an attribute, a code for exception processing, which is processing executed when a state not defined in the state transition diagram is entered. The exception activity 370 can be input with exception processing source code via the input means 12.

FIG. 7 is a diagram showing an example of the contents of the program source code generated by the automatic program generation device of the present embodiment.
The program source code 202 shows the contents of the program source code automatically generated from the contents of the display example 300 shown in FIG. The third line starting from “if” from the top is a process of waiting for the occurrence of an event, and corresponds to the process of step S21 in the flowchart shown in FIG. As shown in FIG. 6, in the state transition diagram shown in the display example 300, “event1”, “event2_1”, “event2_2”, “event3_1”, and “event3_2” are defined as events, and an example of program source code In 202, the fact that a transition is made when each event occurs is described in the line starting from “next_state” on the fourth line from the top.

  The line starting from “switch” on the fifth line from the top corresponds to the process in step S22 of the flowchart shown in FIG. That is, the current state is determined. Further, the process of determining the transition destination based on the occurrence event and the guard condition for each determined current state is each process enclosed in parentheses starting from “{” at the end of this line. In the automatic program generation device 100 of the present embodiment, as shown in the states 311, 312, and 313 in FIG. 6, the program states are defined as “STATE1”, “STATE2”, and “STATE3”, respectively.

  At this time, six lines from the top to the line written as “break;” including the line written as “case STATE1;” on the sixth line are executed when the state is determined as “STATE1”. For example, it corresponds to the processing of step S23a in the flowchart shown in FIG. In the same manner, 10 lines including “break STATE 2;” on the 12th line from the top to the line written “break;” are executed when the state is determined as “STATE 2”. For example, it corresponds to the process of step S23b in the flowchart shown in FIG. 4, and “break;” is written including the line “case STATE3;” on the 22nd line from the top. Ten lines up to the line are codes executed when the state is determined to be “STATE3”, and corresponds to the process of step S23d of the flowchart shown in FIG.

  In addition, the four lines up to the line written “break;” including the line written “default;” on the eighth line from the bottom are other than the above states “STATE1,” “STATE2,” and “STATE3”. This process is performed when a state is reached. That is, the four lines of code are the exception processing source code 210, which corresponds to the processing in step S25 of the flowchart shown in FIG. Further, the line starting from “now_state” in the third line from the bottom corresponds to the process in step S24 of the flowchart shown in FIG. Hereinafter, how the source code generation unit 120 generates source code using the state transition diagram shown in the display example 300 will be described.

  First, the code executed when the state is determined as “STATE 1” will be described. The source code generation unit 120 searches for which state the arrow extending from the state 311 in the state transition diagram shown in FIG. 6 extends. In the display example 300, the transition 321 is displayed only from the state 311 to the state 312. That is, the state 311 only transits to the state 312. Further, the source code generation unit 120 reads the label 331 associated with the transition 321. Then, an event 341 and a guard condition 351 are inserted at predetermined positions in a line starting from “if” as in the seventh line from the top of the program source code 202. Also, an action expression 361 is inserted in the eighth line from the top. Also, “STATE2” corresponding to the state 312 that is the transition destination of the transition 321 is inserted after “next_state =” on the ninth line from the top.

  A code executed when the state is determined to be “STATE2” will be described. The source code generation unit 120 searches for the state in which the arrow extending from the state 312 extends. In the display example 300, transitions 322 and 323 are displayed from the state 312 to the states 311 and 313. That is, the state 312 transitions to the state 311 and the state 313. In addition, the source code generation unit 120 reads the label 332 associated with the transition 322. Then, an event 342 and a guard condition 352 are inserted at predetermined positions in a line starting from “if” as shown in the 13th line from the top of the program source code 202. Also, an action expression 362 is inserted in the 14th line from the top. Also, “STATE 1” corresponding to the state 311 that is the transition destination of the transition 322 is inserted after “next_state =” on the 15th line from the top. Further, the source code generating unit 120 reads the label 333 associated with the transition 323. Then, the event 343 and the guard condition 353 are inserted at predetermined positions on the line starting from “else if” as shown in the 17th line from the top. Also, an action expression 363 is inserted in the 18th line from the top. Also, “STATE3” corresponding to the state 313 that is the transition destination of the transition 323 is inserted after “next_state =” on the 19th line from the top.

  A code executed when the state is determined to be “STATE 3” will be described. The source code generation means 120 searches for which state the arrow extending from the state 313 extends. In the display example 300, transitions 324 and 325 are displayed from the state 313 to the states 311 and 312. That is, the state 313 transits to the state 311 and the state 312. In addition, the source code generation unit 120 reads the label 334 associated with the transition 324. Then, an event 344 and a guard condition 354 are inserted at predetermined positions in the line starting from “if” as shown in the 23rd line from the top of the program source code 202. Also, an action expression 364 is inserted in the 24th line from the top. Also, “STATE 2” corresponding to the state 312 that is the transition destination of the transition 324 is inserted after “next_state =” on the 25th line from the top. Further, the source code generation unit 120 reads the label 335 associated with the transition 325. Then, an event 345 and a guard condition 355 are inserted at predetermined positions on the line starting from “else if” as shown in the 27th line from the top. Also, an action expression 365 is inserted in the 28th line from the top. Also, “STATE 1” corresponding to the state 311 that is the transition destination of the transition 325 is inserted after “next_state =” on the 29th line from the top.

  In addition, a code that is executed when it is determined that the state is other than “STATE 1”, “STATE 2”, and “STATE 3” will be described. The exception processing embedding unit 130 reads the exception processing source code described in the exception activity 370 received by the exception processing receiving unit 112. Then, a “default statement” is inserted at the end of the so-called “switch statement” in the generated source code generated by the source code generation unit 120. In this way, when a state other than “STATE1”, “STATE2”, and “STATE3” defined in the “case statement” is entered, the “default statement” from the eighth line from the bottom is executed. It will be. That is, exception handling is performed when a state other than the defined state is entered.

  By using the automatic program generation device 100 as described above, the exception processing source code described in the exception activity 370 is automatically inserted into the generated source code generated by the source code generating unit 120, so that it is newly generated. Even if the program source code 200 enters a state other than the assumed state, exception processing is performed. That is, the program can be automatically generated regardless of whether there is a problem if there is no exception handling. Also, it is not necessary to add exception handling manually. Therefore, the merit of automatically generating the program is improved.

  In FIG. 6, a display example is shown as a display example 300 when the data receiving unit 110 receives data input via the input unit 12 and outputs the data to the monitor 11. However, unlike the display example 300, the exception activity 370 is not necessarily handled as a part of the graphic data. Therefore, FIG. 8 shows a display example in the case of handling it as an attribute of diagram format data.

FIG. 8 is a diagram illustrating another example of the display of data received by the data receiving unit.
In the display example 301, a graphic data display unit 302 and a drawing attribute display unit 303 are displayed. Further, an exceptional activity 371 is displayed in the drawing attribute display unit 303. The graphic data display unit 302 displays a state transition diagram that is graphic data. The drawing attribute display unit 303 displays the attributes of the state transition diagram displayed on the graphic data display unit 302. An exception activity 371 is displayed as the attribute. By inputting an exception processing source code to the exception activity 371, exception processing of the state transition diagram displayed on the graphic data display unit 302 may be performed.

  As described above, by handling the exception processing source code as the attribute data of the state transition diagram, the exception processing source code input to the exception activity 371 may be used as the exception processing source code for exception processing of another state transition diagram. it can. Therefore, it is possible to generate the program source code 200 including the exception processing without inputting the exception processing source code every time the state transition diagram is generated, and further improve the merit of automatically generating the program.

  Also, the exception processing source code is input from the exception activity via the input means. However, the exception processing source code is created separately from the program automatic generation device, and the resulting exception processing source code is, for example, The exception processing source code may be received by being stored in a recording device or the like, and the automatic program generation device reading the recording medium. Also, exception processing source code may be received via a network. In that case, a network interface or the like is provided in the hardware shown in FIG.

It is a conceptual diagram of the invention applied to this Embodiment. It is a figure which shows the hardware structural example of the program automatic generation apparatus used for this Embodiment. It is a flowchart which shows the procedure of the automatic generation process which automatically produces | generates the program by the program automatic generation apparatus of this Embodiment. It is a flowchart which shows the behavior of the program which the program automatic generation apparatus of this Embodiment produced | generated. It is a figure which shows the outline of the program source code which the program automatic generation apparatus of this Embodiment produced | generated. It is a figure which shows an example of the display of the data which the data reception means received. It is a figure which shows an example of the content of the program source code which the program automatic generation apparatus of this Embodiment produced | generated. It is a figure which shows another example of the display of the data which the data reception means received. It is a flowchart which shows the procedure of the automatic generation process which automatically generates the program by the conventional program automatic generation apparatus. It is a flowchart which shows the behavior of the program produced | generated by the conventional program automatic generation apparatus. It is a figure which shows the outline of the content of the program source code which the conventional program automatic generation apparatus produced | generated.

Explanation of symbols

DESCRIPTION OF SYMBOLS 11 Monitor 12 Input means 100 Program automatic generation apparatus 110 Data reception means 111 Diagram format data generation means 112 Exception processing reception means 120 Source code generation means 130 Exception processing embedding means 200 Program source code

Claims (8)

In an automatic program generation device that generates a program from diagram data representing the behavior of the program in diagram format,
In response to an instruction from the user, graphic data generation means for generating the graphic data,
Source code generation means for generating a compilable program source code from the graphic data;
Exception processing receiving means for receiving source code of exception processing to be performed when different from any state defined in the diagram format data;
Exception processing embedding means for embedding the exception processing source code in the program source code and outputting as a new program source code;
An apparatus for automatically generating a program, comprising:   2. The automatic program generation apparatus according to claim 1, wherein the exception process accepting unit handles the source code of the exception process as an element of the graphic data.   2. The automatic program generation apparatus according to claim 1, wherein the exception process accepting unit handles the source code of the exception process as an attribute of the graphic data.   The automatic program generation apparatus according to claim 1, wherein the exception process accepting unit accepts a source code of the exception process manually input by a user.   2. The automatic program generation apparatus according to claim 1, wherein the exception process accepting unit accepts a source code of the exception process created in advance.   2. The automatic program generation apparatus according to claim 1, wherein the exception process accepting unit accepts a source code of the exception process recorded on a recording medium. In an automatic program generation method for generating a program from diagram data representing the behavior of the program in diagram format,
A step of generating graphic data in response to an instruction from a user;
Source code generation means for generating compilable program source code from the diagram data;
A step of receiving an exception processing source code when the exception processing receiving means is different from any state defined in the graphic data;
An exception processing embedding unit embeds the source code of the exception processing in the program source code and outputs it as a new program source code;
A method for automatically generating a program, comprising: In an automatic program generation program that generates a program from diagram format data that represents the behavior of the program in diagram format,
On the computer,
In response to an instruction from the user, graphic data generation means for generating the graphic data,
Source code generating means for generating compilable program source code from the diagram format data;
Exception processing receiving means for receiving source code of exception processing performed when different from any state defined in the diagram format data,
Exception processing embedding means for embedding the exception processing source code in the program source code and outputting as a new program source code;
An automatic program generation program characterized in that it functions as a program.

Images