JP2007183785A - Program tree display method, program generation device, and program generation program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To display a program element having a data flow and an external program as one program tree in a program tree display method. <P>SOLUTION: A node storage means 1a stores nodes corresponding to the types of program elements. A tree generation means 1b connects nodes corresponding to program elements having a program element having a data flow showing the flow of processing and a program element having a data flow showing the flow of processing in a low order in a tree-form to generate a program tree showing a hierarchical structure between the program elements. An external program setting means 1c sets the external program as a program element which does not have any data flow as a node for the program tree generated by the tree generation means 1b. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a program tree display method, a program generation device, and a program generation program, and in particular, a program tree display method for representing a program in a tree shape by using program elements as program components as nodes of the tree, and program components The present invention relates to a program generation device that generates a program by combining program elements, and a program generation program.

  Conventionally, as a method of developing a program, a program is described in a text-based language such as C language using a text editor, and converted into a load module in a format that can be processed by a computer using a tool such as a compiler. It has been known.

  In the above-described method, a document is often produced separately at the same time as creating a program, and this separately produced document is often described in a form using many figures so that it can be easily grasped visually.

  The document thus produced has a one-to-one correspondence with the program. Further, there are many mechanical operations for converting a figure-based document into a text-based program such as C language, and human errors are often included during the operation. Therefore, the time and mistakes spent on this operation have been regarded as problems.

  Therefore, systems have been developed that automatically convert figure-based documents into text-based programs and prevent these waste of time and human error. For example, there has been proposed a programming device that expresses a program in a plurality of drawings and generates a source code from the data (see Patent Document 1). A programming method for generating a text-type programming language from a program described using a diagram has been proposed (see Patent Document 2).

  Further, a program device for creating a program from a data flow diagram and a schedule table has been proposed (see Patent Document 3). A software development method for generating a program code described using a data flow diagram has been proposed (see Patent Document 4). A software design / test support apparatus that represents a program in a hierarchical graphical representation has been proposed (see Patent Document 5).

  By the way, although such a diagrammatic program has the merits of the above-described mechanical operation and reduction of human error, it has a demerit that an inconvenience arises when trying to describe an algorithm that is not suitable for description in the figure.

For example, a data flow diagram is very convenient for describing a signal flow and the like, but it is difficult to describe a control structure such as an iterative loop.
Therefore, a method for creating a program by combining programs produced by a plurality of means has been proposed. For example, a program creation support method has been proposed in which a program is created by associating other modules with only input and output (see Patent Document 6).

In addition, a software development support system has been proposed that handles a first area where a program is automatically generated and a second area that is another program (see Patent Document 7). There has been proposed a sequence program generation method in which a program produced by a plurality of means is converted into an intermediate object of a unified format and then combined into one program (see Patent Document 8).
JP-A-10-307716 JP-A-8-55019 Japanese Patent No. 3007248 JP 63-219036 A Japanese Patent Laid-Open No. 10-171641 Japanese Patent Laid-Open No. 4-102919 JP 2000-89945 A JP 2000-227854 A

  However, in the program creation support method described in Patent Document 6 described above, it is related only by the input / output interface, and other information such as variables of other modules is used in the same manner as the program inside the schematic program production apparatus. I couldn't. Therefore, the program could not be produced according to the unified program production method.

  Further, in the sequence program generation method described in Patent Document 8 above, since it can be combined at the intermediate object stage, at the stage where the programmer is creating the program, the program is produced according to a unified program production technique. I could not.

  Further, in the software development support system described in Patent Document 7, the automatic generation result from the existing program and the schematic program is combined into one file, and the existing program can be reused without modification. Therefore, the merit of reducing the test process by reuse could not be obtained.

  The present invention has been made in view of these points, and an object thereof is to provide a program tree display method capable of displaying a program element having a data flow and an external program in a single program tree. .

  Another object of the present invention is to provide a program generation device capable of programming together with program elements having a data flow without converting the external program into the data flow.

  Another object of the present invention is to provide a program generation program capable of programming together with program elements having a data flow without converting the external program into the data flow.

  In the present invention, in order to solve the above-mentioned problem, in a program tree display method for representing the program in a tree shape with each program element being a program component as a node of the tree, the node storage means is adapted to the type of the program element. The step of storing the node and the tree generation means correspond to the program element having a data flow representing a processing flow or the program element having a data flow representing a processing flow at a lower level. A step of generating a program tree representing a hierarchical structure between the program elements by connecting nodes in a tree shape; and an external program setting means for the data flow with respect to the program tree generated by the tree generation means The program element does not have Program tree display method characterized by the part program and a step of setting as the node is provided.

  Thereby, the node storage means stores a node corresponding to the type of program element. The tree generation means connects program elements having a data flow representing a processing flow or nodes corresponding to a program element having a data flow representing a processing flow at a lower level in the form of a tree. A program tree representing the hierarchical structure between them is generated. The external program setting means sets an external program, which is a program element having no data flow, as a node for the program tree generated by the tree generation means.

  According to the present invention, in a program generation device that generates the program by combining program elements that are constituent elements of a program, a node storage unit that stores a node corresponding to the program element, and a processing flow By connecting the nodes corresponding to the program elements having the data flow representing the processing flow or the program elements having the data flow representing the processing flow at a lower level in a tree shape, the hierarchical structure between the program elements is represented. A tree generation unit that generates a program tree to be represented; an external program setting unit that sets, as the node, an external program that is the program element that does not have the data flow with respect to the program tree generated by the tree generation unit; The data flow; Program generating device is provided, characterized in that it comprises a program generating unit that generates the program from the Kigaibu program.

  Thereby, the node storage means stores the node corresponding to the program element. The tree generation means connects program elements having a data flow representing a processing flow or nodes corresponding to a program element having a data flow representing a processing flow at a lower level in the form of a tree. A program tree representing the hierarchical structure between them is generated. The external program setting means sets an external program, which is a program element having no data flow, as a node for the program tree generated by the tree generation means. Program generation means generates a program from the data flow and the external program.

  Further, according to the present invention, in a program generation program that generates the program by combining program elements that are constituent elements of the program, the computer includes a node storage unit in which a node corresponding to the program element is stored, A hierarchy between the program elements by connecting nodes corresponding to the program elements having a data flow representing a flow, or nodes corresponding to the program elements having a data flow representing a processing flow at a lower level. Tree generating means for generating a program tree representing a structure, external program setting means for setting, as the node, an external program that is the program element having no data flow for the program tree generated by the tree generating means; Above And Tafuro, the program generation program for causing to function as a program generation means for generating the program from the external program is provided.

  Thereby, the node storage means stores the node corresponding to the program element. The tree generation means connects program elements having a data flow representing a processing flow or nodes corresponding to a program element having a data flow representing a processing flow at a lower level in the form of a tree. A program tree representing the hierarchical structure between them is generated. The external program setting means sets an external program, which is a program element having no data flow, as a node for the program tree generated by the tree generation means. Program generation means generates a program from the data flow and the external program.

  According to the program tree display method of the present invention, since a program element having a data flow and an external program can be displayed in one program tree, a program element having a data flow and a program element not having a data flow are displayed. It becomes possible to see the hierarchical structure between program elements of the program included in the constituent elements.

  In addition, according to the program generation device of the present invention, a program can be generated with a program element having a data flow without converting the external program into a data flow. Therefore, work associated with converting an external program into a data flow Man-hours can be reduced. Therefore, the cost for generating the program can be reduced. In addition, since it is possible to eliminate errors associated with work that occurs when an external program is converted into a data flow, the reliability of the generated program can be improved.

  In addition, according to the program generation program of the present invention, a program can be generated together with program elements having a data flow without converting the external program into a data flow. Therefore, work associated with converting an external program into a data flow Man-hours can be reduced. Therefore, the cost for generating the program can be reduced. In addition, since it is possible to eliminate errors associated with work that occurs when an external program is converted into a data flow, the reliability of the generated program can be 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 computer 1 includes a node storage unit 1a, a tree generation unit 1b, and an external program setting unit 1c. The computer 1 is connected with an input unit 2 and a display unit 3.

  The computer 1 receives the instruction signal input from the input unit 2, generates a program tree representing the entire program in a tree shape, and outputs the program tree to the display unit 3. The nodes of the program tree are associated with program elements that are program components.

  In addition, the computer 1 generates a partial program from a data flow indicating a functional unit process flow which is one of program elements, and generates a desired program by combining the generated partial programs.

  In addition, when generating a program using a partial program prepared in advance separately from the generated partial program, a desired program can be obtained by combining the partial program generated from the data flow with the partial program prepared in advance. Generate.

  For example, a partial program prepared in advance is a partial program prepared in advance so that it can be used during programming for frequent use during programming. This is a partial program that does not need to be modified anymore and therefore has no merit of recreating the data flow.

  The node storage means 1a stores an icon indicating a node of the program tree used when displaying the program tree. This icon is prepared for each type of program element. For example, when a program is composed of one or more compilation units and one or more functional units, the node storage unit 1a stores icons indicating the entire program, the compilation units, and the functional units.

  Therefore, when the program tree is displayed, it is possible to determine at a glance which type of program element each node is associated with by looking at the type of icon displayed as a node of the program tree. It becomes possible.

  When the tree generation unit 1b performs an operation to set a program element to be set as a child node on a node that is a parent node of the program element to be set in the program tree, a child node is formed one level lower than the parent node. Then, the connection relationship between the parent and child nodes is set.

  Then, an icon is acquired from the node storage unit 1 a according to the type of program element set as a child node, and displayed on the display unit 3. If necessary, the attribute information of the program element is received in association with the node and stored.

  By repeating this process, a tree structure having nodes representing the entire program as vertices is formed. By displaying this program tree on the display means 3, the relationship between program elements of the entire program can be understood at a glance.

  The external program setting unit 1c receives the program tree generated by the tree generation unit 1b from the tree generation unit 1b, and sets an external program which is a program element that does not have the merit of recreating the data flow at a desired position in the program tree.

  Specifically, when the external program setting unit 1c performs an operation for setting a program element to be set as a child node on a node that is a parent node of the external program, the external program setting unit 1c sets the child node one level below the parent node. Create and set the connection relationship between parent and child nodes.

  Then, an icon is acquired from the node storage unit 1 a according to the type of program element set as a child node, and displayed on the display unit 3. If necessary, external program attribute information is received in association with the node and stored.

  At this time, in addition to the icon indicating the compilation unit of the partial program having the data flow, the node storage unit 1a stores an icon indicating the compilation unit of the partial program that does not have the merit of being converted into the data flow.

  As a result, a node corresponding to the external program can be set for the program tree generated by the tree generation means 1b, so that a program element having a data flow and a program element having no data flow are used as constituent elements. It becomes possible to see the hierarchical structure between the program elements of the containing program.

  It has been described that the external program setting unit 1c acquires a program tree from the tree generation unit 1b and sets a node corresponding to the external program for the program tree. However, the node corresponding to the external program is set. Later, the tree generation unit 1b acquires a program tree in which a node corresponding to the external program is set, and further sets a program element having a data flow. For example, the external program setting unit 1c and the tree generation unit 1b You may add.

Next, an embodiment when the program tree display method of the present invention is applied to a program generation device will be described in detail with reference to the drawings.
FIG. 2 is a diagram illustrating a hardware configuration example of the program generation apparatus used in the present embodiment. The entire program generating 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 part of an OS (Operating System) program 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 and application programs.

  A monitor 13 is connected to the graphic processing device 104. The graphic processing device 104 displays an image on the screen of the monitor 13 in accordance with a command from the CPU 101. A keyboard 12 and a mouse 11 are connected to the input interface 105. The input interface 105 transmits a signal sent from the keyboard 12 or the mouse 11 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.
Next, processing functions of the program generation device 100 will be described.

  FIG. 3 is a diagram illustrating processing functions of the program generation device. As shown in FIG. 3, the program generation apparatus 100 includes a schematic program management unit 110, a positional relationship information storage unit 120, a library 130, an attribute information storage unit 140, an external program setting unit 150, and an automatic program generation unit 160. Yes. The graphical program management unit 110 includes a data flow generation unit 111 and a program tree generation unit 112.

  Upon receiving a data flow generation instruction from the user, the data flow generation unit 111 generates a data flow indicating a processing flow of functional units constituting the program according to the instruction signal. Specifically, based on an instruction signal from the user, various unit blocks that are constituent elements of the data flow are read from the library 130, and a data flow is generated by arranging the various unit blocks.

  Then, the connection relationship between the various unit blocks of the generated data flow is stored in the positional relationship information storage unit 120. Also, attribute information set for the functional unit and various unit blocks is stored in the attribute information storage unit 140.

  When receiving a program tree instruction from the user, the program tree generation unit 112 generates a program tree that represents a program element of the program in a tree shape according to the instruction signal. Specifically, based on an instruction signal from the user, a program tree is generated by reading out the node icons of the program tree from the library 130 and arranging various icons in the instructed order.

  Then, the connection relationship between the various nodes of the generated program tree is stored in the positional relationship information storage unit 120. Further, the attribute information set in the various nodes is stored in the attribute information storage unit 140.

The positional relationship information storage unit 120 stores the positional relationship of each component of the data flow. Also, the positional relationship of each node in the program tree is stored.
The library 130 stores information on all functional units necessary when the data flow generation unit 111 generates a data flow. In addition, icons of all nodes necessary for the program tree generating unit 112 to generate the program tree are stored. Note that the information on all functional units is the type of graphic, name, attribute of parameter required by the functional unit, and algorithm for realizing the function of the functional unit.

The attribute information storage unit 140 stores attribute information of attributes required by the functional unit.
When receiving an external program setting instruction from the user, the external program setting unit 150 sets an external program in the program tree according to the instruction signal. Specifically, based on an instruction signal from the user, an external program to be set in the program tree is read from the library 130, and the external program is set at a designated location in the program tree. This external program may be added by the user.

  The program automatic generation unit 160 generates a program from the data flow, the external program, and the attribute information of the data flow and the external program. Specifically, the data flow generated by the data flow generation unit 111 is acquired together with the positional relationship information stored in the positional relationship information storage unit 120 and the attribute information stored in the attribute information storage unit 140. A program element corresponding to the data flow is generated from all the information.

  Also, an external program is acquired from the library 130. Then, the program is generated by linking the program element generated from the data flow and the external program with a linker.

The following processing is performed by the program generation device 100 having the above functions.
FIG. 4 is a flowchart showing a procedure of processing for generating a program by the program generating apparatus 100. In the following, the process illustrated in FIG. 4 will be described in order of step number.

  [Step S11] The program tree generation unit 112 receives a program tree generation instruction from the user so as to generate a program tree via the mouse 11 or the keyboard 12.

[Step S12] The program tree generator 112 generates a program tree based on a program tree generation instruction.
[Step S13] The diagrammatic program management unit 110 determines whether or not the generation of a program tree in which relations between program elements having data flows are represented in a tree shape is completed. If it is determined that the generation of the program tree has been completed, the process proceeds to step S14. If it is determined that the generation of the program tree has not been completed, the process proceeds to step S11.

[Step S14] The data flow generation unit 111 receives a data flow generation instruction so as to generate a data flow from the user via the mouse 11 or the keyboard 12.
[Step S15] The data flow generation unit 111 generates a data flow based on the data flow generation instruction.

  [Step S16] The graphical program management unit 110 determines whether or not generation of a data flow necessary for generating a program has been completed. If it is determined that the data flow generation has been completed, the process proceeds to step S17. If it is determined that the data flow has not been completed, the process proceeds to step S14.

  [Step S17] The external program setting unit 150 receives an external program setting instruction from the user so as to set an external program for the program tree generated by the program tree generation unit 112 via the mouse 11 or the keyboard 12.

  [Step S18] The external program setting unit 150 sets an external program in the program tree generated by the program tree generation unit 112 based on the external program setting instruction.

  [Step S19] The automatic program generation unit 160 receives an automatic program generation instruction from the user via the mouse 11 or the keyboard 12 so as to automatically generate a program from the data flow generated by the data flow generation unit 111 and an external program.

  [Step S20] The automatic program generation unit 160 receives the data flow from the data flow generation unit 111. At that time, along with the data flow, attribute information associated with the data flow is received. Then, a program element is generated from the data flow. For example, C language source code is generated from the data flow. Then, the source code generated from the data flow is compiled, and a desired program is generated by combining the external program with a tool called a linker or a linkage editor. In this case, when the external program is in the C language format, it is also necessary to compile the external program.

  The processing from step S11 to step S13 is called program tree generation processing, the processing from step S14 to step S16 is called data flow generation processing, and the processing from steps S17 and S18 is called external program setting processing. Shall.

  The order of the processing shown in the flowchart of FIG. 4 is merely an example. For example, when it is desired to generate a program tree again during data flow generation, the data flow generation processing The program tree generation process may be performed again later.

  If it is desired to add a node to the program tree after setting the external program in the program tree, the program tree generation process may be performed again after the external program setting process.

Next, a screen display example displayed on the monitor 13 by the program generation device 100 will be described.
FIG. 5 is a diagram showing a screen display example when a program is automatically generated. As shown in FIG. 5, the screen display example 200 includes a program tree display unit 210 and a data flow display unit 220.

  The program tree display unit 210 displays a node 211 indicating the entire program, a node 212 indicating that a program element having a data flow is a compile unit, and a node 213 indicating that a compile unit of an external program. . In the present embodiment, the compilation unit is regarded as a module that is a separable software component.

  The program tree display unit 210 shows a hierarchical structure of program elements of a program that performs inverter control processing, and indicates that the inverter control program is composed of compilation units for input control, fault detection, and power supply synchronization. ing.

  A character 211 a displayed as “inverter control” on the right side of the node 211 indicates that the node 211 represents a whole program of inverter control. A character 212 a displayed as “input control” on the right side of the node 212 is a node representing a module on which the node 212 performs input control processing, and “power supply synchronization” is displayed on the right side of the node 213. The character 213a indicates that the node 213 represents an external program that performs power supply synchronization processing.

  In this way, by displaying characters representing the contents of a node on the right side of each node, it is possible to determine at a glance what function the program element is associated with.

  A character 211 a displayed on the right side of the node 211 is associated with the node 211, and is set as a file name of a program finally generated by the automatic program generation unit 160.

  The character 212 a displayed on the right side of the node 212 is associated with the node 212 and is set as the file name of the program generated from the module by the automatic program generation unit 160.

  However, if characters are associated with nodes in this way, data may not be accepted depending on the tool such as the C compiler used. For example, when a 2-byte character for representing Japanese cannot be used, a file name further associated with the character set in association with the node is set separately. Such attribute information is stored in the attribute information storage unit 140.

  Further, attribute information used when generating a program is associated with these nodes 211 and 212. The attribute information including the characters 211a and 212a displayed to the right of these nodes 211 and 212, for example, calls an input window for inputting attribute information from the corresponding node, and inputs the attribute information to the input window. By doing. Hereinafter, an example of an input window for inputting attribute information stored in association with a node will be described.

  FIG. 6 is a diagram illustrating an example of an input window for inputting attribute information stored in association with a node. As shown in FIG. 6, the input window 300 is obtained by, for example, right-clicking a node 212 representing an input control module and calling an input window associated with the node 212. , An input button 330 for confirming the input, and a cancel button 340 for canceling the input.

  The input window 300 displays an input field 311 for inputting the name of a compilation unit and an input field 312 for inputting a generated C language program name. When the input is confirmed by selecting the input button 330, the character string input in the input field 311 is stored in the attribute information storage unit 140 in association with the node 212 as the name of the compilation unit. A character string input from the input field 311 is displayed to the right of the node 212 in the program tree display unit 210.

  When the input of the character string input in the input field 312 is confirmed by selecting the input button 330, the module associated with the node 212 is generated by the automatic program generation unit 160. In order to be set as the program name of the format program, it is stored in the attribute information storage unit 140 in association with the node 212.

Next, a display example when displaying functional units in a compilation unit as a program tree is shown.
FIG. 7 is a diagram illustrating a screen display example that also displays functional units in a compilation unit. As illustrated in FIG. 7, the screen display example 201 includes a data flow display unit 220 and a program tree display unit 230.

  The program tree display section 230 shows a node 211 indicating the entire program, a node 212 indicating that a program element having a data flow is a compilation unit, a node 213 indicating a compilation unit of an external program, and a functional unit. Nodes 214 and 215 are displayed.

  By the way, the functional unit of current control belongs to the compile unit of input control. Therefore, in order to clarify the dependency, the node 214 representing the current control functional unit is displayed so as to be subordinate to the node 212 representing the input control compilation unit. In addition, since the compile unit is considered as a container for inserting a functional unit, there is no processing function that directly belongs to the compile unit, and the processing function always belongs to the functional unit.

  Further, the functional unit may include a finer functional unit. This is an idea corresponding to the detailed division of the function accompanying the structuring of the program in the idea of the structured programming.

  On the program tree displayed in the program tree display section 230, the situation is shown in the relationship between a node 214 representing a functional unit for current control and a node 215 representing a functional unit for current command calculation.

  That is, the functional unit of the current command calculation is a partial function belonging to the functional unit of current control, and the node 215 is subordinate to the lower level of the node 214 in order to improve the visibility of the dependency relationship between the functional units. To display.

  This can be the same in subordinate functional units, and in this case, recursively subordinate nodes representing subordinate functional units to subordinate functional units to which they belong. indicate.

  The form of functional unit implementation corresponds to a subprogram which is called a function in the C language and sometimes called a subroutine or a procedure in other programming languages.

  Functions have attributes such as function name, argument list, and return value, but since the program associated with the functional unit is displayed in the data flow, these attributes are described in the figure. be able to. If it is desired to set an attribute such as a function name separately, it may be set by inputting the attribute from an input window as shown in FIG.

  By the way, the compile unit outputs one file as a result of compilation. More specifically, in a C language format program, the compilation unit is a C language source file whose extension is usually represented by “c”. An object file represented by “obj” is generated.

  This output file may be a binary file that can be directly interpreted and executed by the CPU. However, if a binary file is output, it is not easy to produce medium- or large-scale programs and to reuse programs. When the compilation is completed, the absolute position in the memory is not determined, and a relocatable object in which an address is described at a relative position from the top of the module is generated.

  After producing one or more such relocatable objects as required, information such as a memory map command for a link that matches the memory environment of the execution environment is given. These are combined with a tool called a linker or a language editor to form a final executable program.

  By the way, the external program associated with the node 213 is a partial program in a format that cannot be displayed on the data flow display unit 220 because it has no data flow. For example, it refers to a prepared program when a C language program is prepared in a complete form in advance.

  For example, in this C language file, assuming that a synchronous operation function and a synchronous abnormality detection function are implemented as functional units in the form of functions, the function name, argument list, and return value type are set in the program tree. If it is stored as an attribute of a functional unit on the program tree displayed on the display unit 230, it can be handled in the same manner as a functional unit belonging to a module of a format that can be displayed by the data flow display unit 220.

  In other words, if you write a program that calls the functional unit of another module in the data flow, the function name, argument list, and return value type that are attributes are stored in association with the functional unit of the program tree. Therefore, it is possible to describe a program by connecting programs with data flows.

  Similarly, by storing the attribute of the functional unit belonging to the external program in association with the node, the functional unit can be similarly called from the data flow.

  However, since the function unit attribute of the external program is not associated when the node is set in the program tree, the attribute is stored in association with the node by inputting it separately from the input window as described above, or in the C language. Information needs to be picked up using a parser and stored in association with the node.

  The program represented as the program tree displayed in the program tree display section 230 has three compilation units. The purpose is to produce a final executable program using a linkage editor after compilation. Therefore, it is useful to provide a concept that represents the units to be combined in the linkage editor.

  Therefore, a unit corresponding to a load module including one or more compilation units and combining outputs generated from the respective compilation units is defined as a project. The project is represented by a symbol shown as a node 211 on the program tree displayed in the program tree display unit 230.

  From the above, it can be said that the program tree displayed in the program tree display unit 230 is divided into modules constituting the inverter control project and is graphically represented in a tree shape.

  As described above, according to the program generation device 100, the program tree is displayed in the screen display example, and the structure of the program can be easily read. Therefore, the program can be easily produced by the structured programming.

  The user can see the hierarchical structure between the program elements of the program generated from the program generation device 100 by looking at the program tree displayed on the program tree display unit 210.

  The data flow displayed on the data flow display unit 220 is associated with a node of the program tree displayed on the program tree display unit 210, and the data flow associated with which node of the program tree is viewed. Moreover, it is possible to know easily.

  Further, since the data flow is associated with the node of the program tree, the data flow for each node is displayed on the data flow display unit 220, so that programming can be performed for each node of the program tree.

  Further, by enabling the partial program that cannot be displayed on the data flow display unit 220 to be displayed on the program tree display unit 230, for example, the input control module associated with the node 212 and the power supply associated with the node 213 are displayed. Different programs in the form of synchronous programs are displayed on one program tree and can be handled by similar operations.

  Note that there are two possible ways to import external programs. There are a case where the entity of the compilation unit of the external program is fetched as a part of the program and a case where only the attribute information is registered without fetching the entity of the compilation unit of the external program as a part of the program.

  Each of the two patterns may be distinguished by using icons with different displays. The following shows a program tree in which an icon different from the external program node shown in the program tree display section 210 or 230 is displayed.

  FIG. 8 is a diagram illustrating a display example of the program tree display unit. As shown in FIG. 8, the program tree display unit 231 includes a node 211 indicating the entire program, a node 212 indicating that a program element having a data flow is a compilation unit, nodes 214 and 215 indicating functional units, and an external program. A node 216 indicating that this is a compilation unit is displayed.

  In order to distinguish the node 216 from the program tree display unit 210 and the node 213 of the program tree shown by the program tree display unit 230, the periphery of the node is a thick line.

  Assuming that the above-described two patterns of how to load an external program are the first method and the second method, the first method also copies the external program to the disk area for storing the data of the schematic program, and the second method. Does not copy the file.

  Also, at the time of compiling, in the case of the second method, when the program generation apparatus 100 has written a program tree using information on functional units belonging to a compiling unit in a format having no data flow, When the C language format program is generated from the program tree, it is only generated using the function unit information of the external program. In the case of the first method, in addition to this, the same result as the output result of the program tree is added. The operation of copying the registered C language file is also added.

  Although it has been described that a C language file prepared in advance is used as an external program, the external program is not limited to a file prepared in advance. For example, a C language format program that is directly input to the program generation device 100 may be used. The external program setting unit 150 may directly receive the C language file generated from the data flow by the automatic program generation unit 160 and set the received file as an external program in the program tree.

  In addition, a node indicating a functional unit belonging to an external program is distinguished by using an icon together with a node indicating a functional unit of a module having a data flow, and changing only the icon of a node of a compile unit at a higher level. Although described, the icon of the node of the functional unit may be changed.

  The above processing functions can be realized by a computer. In that case, a program generation program describing the processing contents of the functions that the program generation apparatus should have is provided. The processing function is realized on the computer by executing the program generation program on the computer. The program generation program describing the processing contents can be recorded on a computer-readable recording medium. Examples of the computer-readable recording medium include a magnetic recording device, an optical disk, a magneto-optical recording medium, and a semiconductor memory. Magnetic recording devices include HDDs, flexible disks, magnetic tapes, and the like. Optical discs include DVD (Digital Versatile Disc), DVD-RAM, CD-ROM (Read Only Memory), CD-R (Recordable) / RW (ReWritable), and the like. Examples of the magneto-optical recording device include an MO (Magneto Optical disk).

  When distributing the program generation program, for example, a portable recording medium such as a DVD or a CD-ROM in which the program generation program is recorded is sold. It is also possible to store the program in a storage device of a server computer and transfer the program generation program from the server computer to another computer via a network.

  The computer that executes the program generation program stores, for example, the program generation program recorded on the portable recording medium or the program generation program transferred from the server computer in its own storage device. Then, the computer reads the program generation program from its own storage device and executes processing according to the program generation program. The computer can also read the program generation program directly from the portable recording medium and execute processing according to the program generation program. Further, each time the program generation program is transferred from the server computer, the computer can sequentially execute processing according to the received program generation program.

The present invention is not limited to the above-described embodiment, and various modifications can be made without departing from the gist of the present invention.
The above merely illustrates the principle of the present invention. In addition, many modifications and changes can be made by those skilled in the art, and the present invention is not limited to the precise configuration and application shown and described above, and all corresponding modifications and equivalents may be And the equivalents thereof are considered to be within the scope of the invention.

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 generation apparatus used for this Embodiment. It is a figure which shows the processing function of a program production | generation apparatus. It is a flowchart which shows the procedure of the process which produces | generates the program by a program production | generation apparatus. It is a figure which shows the example of a screen display when producing | generating a program automatically. It is a figure which shows an example of the input window for inputting the attribute information memorize | stored in association with a node. It is a figure which shows the example of a screen display which also displays the functional unit in a compilation unit. It is a figure which shows the example of a display of a program tree display part.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Computer 1a Node memory | storage means 1b Tree production | generation means 1c External program setting means 2 Input means 3 Display means

Claims (10)

In a program tree display method for representing the program in a tree shape with each program element being a program component as a node of the tree,
Node storage means for storing the node according to the type of the program element;
The tree generation means connects the program elements having a data flow representing a processing flow or nodes corresponding to the program elements having the program element having a data flow representing a processing flow in a tree form. Generating a program tree representing a hierarchical structure between the program elements;
An external program setting means for setting, as the node, an external program that is the program element having no data flow for the program tree generated by the tree generation means;
A program tree display method comprising:   2. The program tree display method according to claim 1, wherein the external program setting unit sets, in the program tree, a node whose display is different from the node of the program tree generated by the tree generation unit.   2. The program tree display method according to claim 1, wherein the external program setting means sets the node in the program tree in accordance with a method of setting the external program. In a program generation device that generates the program by combining program elements that are constituent elements of the program,
Node storage means for storing nodes according to the program elements;
By connecting the program elements having a data flow representing a processing flow, or nodes corresponding to the program elements having the data flow representing a processing flow at a lower level, in a tree shape, the program elements Tree generating means for generating a program tree representing the hierarchical structure of
External program setting means for setting, as the node, an external program that is the program element that does not have the data flow for the program tree generated by the tree generation means;
Program generation means for generating the program from the data flow and the external program;
A program generation apparatus comprising:   5. The program generation apparatus according to claim 4, further comprising attribute storage means for receiving and storing an attribute of the corresponding program element in association with the node of the program tree.   6. The program generation apparatus according to claim 5, wherein the program generation unit generates the program with reference to the attribute.   5. The program generation apparatus according to claim 4, wherein the program generation means takes the entity of the external program into the program and generates the program.   5. The program generation apparatus according to claim 4, wherein the program generation means generates the program by taking in the attributes of the external program without taking the entity of the external program into the program.   5. The program generation apparatus according to claim 4, wherein the program element includes a project, a compilation unit, and a functional unit. In a program generation program that generates the program by combining program elements that are constituent elements of the program,
Computer
Node storage means in which nodes corresponding to the program elements are stored;
By connecting the program elements having a data flow representing a processing flow or nodes corresponding to the program elements having a data flow representing a processing flow at a lower level in a tree shape, the program elements are connected to each other. A tree generating means for generating a program tree representing the hierarchical structure of
External program setting means for setting, as the node, an external program that is the program element that does not have the data flow with respect to the program tree generated by the tree generation means;
Program generation means for generating the program from the data flow and the external program;
A program generation program characterized by functioning as

Images