Program system using graphic

[0001] The present invention relates to a programming system, and in particular, a program having a function such as arithmetic processing or database processing for executing one set task is made to correspond to one figure on the screen of a display device. The present invention relates to a programming system using a graphic that is displayed on the screen and is programmed by an end user who visually captures the graphic and directly operates it with a mouse or the like.

[0002] Further, the programming system according to the present invention can combine visualized parts, and an end user can easily create or edit an application program. Further, in the computer programming system according to the present invention, an event due to an input operation of an operator who operates each computer or an event due to a change in a figure on the screen displayed and output by each computer can be shared among a plurality of computers. It is possible to build an environment in which each operator works together via a network, and it can be applied to the field of education or the field of games.

[0003] [Conventional Technology] For computer programming up to today, a plurality of libraries are prepared by registering a plurality of programs having functions such as arithmetic processing or database processing for executing one set task. Then, using these libraries, a program that calls a program having a desired function from a predetermined library in a predetermined programming language, an execution order of each library, and a data transfer method are described using an editor to describe a desired application program (. Create a source file), compile the created source file to create a relocatable object file whose address is undecided, and create a library for arithmetic processing, a library for database processing, a library for graphic manipulation, etc. required for the source file. It required a series of operations to link with the object file by the linker, create a program converted into a machine language with a fixed address that can be executed by the computer, and load it on the computer. Alternatively, the interpreter was used to sequentially interpret and execute the source programming instructions.

[0004] Further, when programming is executed using a GUI (Graphical User Interface) for editing a figure, what is to be executed is described, for example, in response to an operation of a button drawn on the screen using the GUI. You will need to create an application program. Furthermore, the function interface for operating each library is also different for each library, that is, each library has a predetermined format such as data call, data format, description order, etc. If you do not have these knowledge, you can use each library. I can't create programming to do.

[0005] [Problems to be Solved by the Invention] Therefore, computer programming by the prior art has poor readability such that links between data are described in a programming language, and can be easily programmed by an end user who is not an expert programmer. There is a problem that the computer cannot be fully utilized by the end user.

[0006] Further, there is a method of programming by connecting figures representing objective functions such as icons with lines by icon programming, but even if the program is visualized, it is difficult to reuse the created program. However, there is a problem that the intellectual assets of the completed program cannot be utilized.

[0007] Further, in programming by the prior art, it is necessary to be aware of the data structure such as numerical type data or character type data, and there is a problem that a programming error occurs when programming a complicated data structure, and the data. There is a problem that the structure is not readable.

[0008] Further, in the collaborative work between a plurality of computers according to the prior art, the system of the entire computer to be used is changed every time the work mode of the collaborative work between the plurality of computers is changed due to the uniqueness of each computer. There is the problem of having to.

[0009] Further, programming by the prior art has poor readability between processing units, and when another sub-processing unit is executed inside between one processing unit, it is executed as a group in a program definition statement. It is necessary to create a meaningful block or to describe and clarify the processing statement one step lower (stepped), and in order to show these relationships on the graphic display device, it is necessary to describe it at the time of processing execution. Similarly, there is a problem that compilation processing and interpretation execution processing are required.

[0010] In view of the above problems, an object of the present invention is to provide a programming system that can be easily programmed not only by a programmer having specialized knowledge but also by an end user.

[0011] Another object of the present invention is to provide a programming system capable of editing and reusing a created visualized program by copying, deleting, compositing, disassembling, etc. on the screen. To do.

[0012] Another object of the present invention is to provide a programming system having good readability of data structures, which can easily program complex data structures visually without programming mistakes.

[0013] Another object of the present invention is to provide a programming system in which the system of the entire computer to be used does not need to be changed even if the work mode of collaborative work between a plurality of computers is changed.

[0014] Further, the present invention makes each function for executing each process correspond to each graphic component, and even when a plurality of functions are combined, it can be realized by a visual operation of pasting a graphic and a graphic, so that readability can be achieved. Another purpose is to provide a programming system that does not require programming operations associated with compile processing and interpretation execution processing as well as at the time of processing execution.

[Means for Solving the Problems] In a programming system using a graphic of the present invention that achieves the above object, operator operation information is input from an input device (12) and displayed on the screen of the display device (11). In a programming system using a figure on which a figure is drawn, a visualization component storage means (3), a processing unit storage means (5), an inclusion relationship instruction means (2), and an inclusion relationship management means (10) , Data linkage means (8)<u style="single">And the representative value changing means (7)</u>The visualization component storage means has an arbitrary figure.<u style="single">of</u>The information of the parts including the information, the program information for specifying the program corresponding to the figure, and the data information obtained by executing the program specified by the program information is stored, and the data of the data linkage means is transferred as an opportunity. , The figure interlocking process is executed, the attribute of the figure is calculated by the processing unit storage means based on the data, and when it is necessary to change the display content of the figure, the display content of the figure is changed.<u style="single">It is provided with a data structure information unit that temporarily stores data for passing data between the component and other components via a plurality of slots and stores data output from the processing unit storage means.</u>The processing unit storage means stores a predetermined program, executes the program based on the data passed by the data linkage means, outputs the data obtained by the execution to the visualization component storage means, and describes the program. The inclusion relationship indicating means causes the operator to specify the inclusion relationship between the plurality of the parts on the screen of the display device via the input device, and the inclusion relationship management means stores the designated inclusion relationship. The data linkage means passes data between the parts based on the inclusion relationship between the parts stored in the inclusion relationship management means.<u style="single">However, the representative value changing means is in the data structure information unit that transfers data via the most frequently used slot among a plurality of slots in which data is transferred between the component and the other component. The value is a representative value,</u>It is characterized by that.

[0016] FIG. 1 is a structural diagram of the principle of the present invention. The graphic programming system of the present invention that achieves the above object is a CPU in which operator operation information is input from an input device 12 consisting of a keyboard, a mouse, etc., and screen information is output to a display device 11 composed of a CRT or the like. In a processing device consisting of a memory or the like, a visualization component that stores information on parts in which a program having functions such as arithmetic processing or database processing corresponds to one figure and displays the information on the parts on the screen of the display device 11. The storage means 3 and the processing unit storage means 5 that stores the program of the function corresponding to the component and outputs the data obtained by executing the program to the visual component storage means 3, and automatically generates the information of the component. The visualization component generation means 6 and the visualization component generation means 6 to be stored in the visualization component storage means 3 are provided.

[0017] The programming system of the present invention is a programming system using a graphic in which operator operation information is input from the input device 12 and the graphic is drawn on the screen of the display device 11, and functions such as arithmetic processing or database processing are performed. The visualization part storage means 3 that stores the information of the parts corresponding to one figure and displays the information of the parts on the screen of the display device 11 and the program of the function corresponding to the parts are stored. Upon receiving the operator's operation information from the processing unit storage means 5 that outputs the data obtained by executing the program to the visualization part storage means 3 and the input means 12 on the screen of the display device 11, the parts are copied, deleted, and deleted. Inclusion relationship instruction means 2 that edits composition, decomposition, etc. to have an inclusion relationship between a figure representing a part and a figure representing another part, and inclusion relationship management means 10 that stores the inclusion relationship between parts. , A data linkage means 8 for passing data between parts based on the inclusion relationship between parts stored in the inclusion relationship management means 10 is provided, and a new part is created and programmed from a plurality of parts.

[0018] In the programming system of the present invention, among a plurality of slots in which data is transferred between a component and another component, data is transferred via the most frequently used slot in the data structure information unit 3b. A representative value changing means 7 having a value of is further provided, and the visualization part storage means 3 temporarily stores and processes data for passing data between a part and another part via a plurality of slots. A data structure information unit 3b for storing data output from the unit storage means 5 is provided.

[0019] The programming system of the present invention further includes a processing structure conversion means 4b for converting a program of the function corresponding to a novel component obtained by having an inclusion relationship between the components.

[0020] The programming system of the present invention further includes data structure conversion means 4a for converting the data structure of a component.

[0021] The data linkage means 8 in the programming system of the present invention further includes an interface for transmitting and receiving data of any format between components.

[0022] When collaborative work is performed between a plurality of programming systems 1 of the present invention, each collaborative work area shared in each display device 11 of each programming system 1 is provided, and inputs generated in each collaborative work area are provided. An event management means 9 for sharing an event by means 12 or due to a change in a figure is further provided.

[Action] The programming system using the graphic of the present invention stores the library of each function corresponding to the graphic, and more specifically,<u style="single">Stores component information including arbitrary graphic information, program information that identifies a program corresponding to the graphic, and data information obtained by executing the program specified by the program information.</u>The memorized figures can be pasted together to create a new figure and memorized, and these figures can be visually captured on the screen of the display means and operated by the input means to be displayed on the screen for programming.

[0024] In the programming system using the graphic of the present invention, collaborative work between a plurality of computers can be realized in a shared area on each screen of each computer, and in an area other than the shared area, tasks unique to each computer can be performed. Can be executed.

[Example] FIG. 1 is a structural diagram of the principle of the present invention. The graphic programming system of the present invention is a process consisting of a CPU, a memory, etc., in which operator operation information is input from an input device 12 consisting of a keyboard, a mouse, etc., and screen information is output to a display device 11 consisting of a CRT, etc. In the device 1, the processing device 1 includes inclusion-related instruction means 2, visualization component information storage means 3, data structure conversion means 4a, processing structure conversion means 4b, processing unit storage means 5, visualization component generation means 6, representative value. It is composed of change means 7, data linkage means 8, event management means 9, and inclusion relationship management means 10.

[0026] The inclusion-related instruction means 2 receives an operation input by the operator via the input device 12, and moves and places the child figure on the parent figure drawn on the screen of the display device 11. Is a means of instructing the parent figure and the child figure to have an inclusive relationship. The inclusion-related instruction means is a means for editing by copying, deleting, synthesizing, disassembling, and the like. Here, the inclusion relationship refers to a parent-child relationship defined in which the lower figure drawn on the screen of the display device as a parent and the upper figure as a child.

[0027] FIG. 2 is a detailed explanatory view of the visualization component information storage means and the processing unit storage means according to the present invention. In this figure, on the screen of the display device 11, the component of the meter B is displayed on the component of the mount A, and the cursor of the component of the slider C moves in conjunction with the needle of the meter B. The information stored in the inclusion relationship management means 10 is only the information that the parent of the component B is the component A.

[0028] The visualization component information storage means 3 is composed of three types of information for each component: visualization component information 3a, data structure information 3b, and graphic interlocking processing information 3c. In the visualization part information 3a, each information of the figure area size, the figure interlocking process, the corresponding processing unit, the corresponding data structure, the representative value data identifier, and the data combination destination data identifier is stored for each part, and the data structure information. In 3b, the data identifier of the slot that is the input / output coupling part of each part with other parts and its value are stored, and in the figure interlocking processing information 3c, the figure of each part is displayed on the screen of the display device 11. Information for drawing is stored.

[0029] Next, a method of creating a component corresponding to a library (individual program such as arithmetic processing or RDB processing) that can be visually operated as a figure will be described below. The parts definition file is automatically generated from the parts slot definition file, which is made by pasting numerical type and character type data, and individual program files such as arithmetic processing or RDB processing corresponding to the library. An object file is created from the automatically generated part definition file via a language processor, and the graphic manipulation library to be used, the arithmetic processing library, and the RDB processing library are linked by a linker to create a dynamic rib library in the execution format of the computer. Then, by loading this into the processing device, visually catchable parts can be called up on the screen of the display device. An instruction to generate a component in this way is called a component generation instruction.

[0030] The data structure conversion means 4a receives input from the inclusion relation instruction means 2 and the visualization component storage means 3, converts the data structure, and outputs the data structure to the visualization component storage means 3.

Similarly, the processing structure conversion means 4b receives input from the inclusion relationship indicating means 2 and the visualization component storage means 3, converts the processing structure, and outputs the input to the visualization component storage means 3.

[0032] The processing unit storage means 5 is program information composed of an instruction sequence describing the processing function of each component and data values obtained by executing the program, and is a data structure in the visualization component information storage means 3. It consists of data value information that updates the value corresponding to the data identifier stored in information 3b.

[0033] The visual component generating means 6 is a means for automatically generating each information of the visual component information 3a, the data structure information 3b, and the graphic interlocking processing information 3c in the visual component information storage means 3 of the component in advance. Instead of this means, each of the above-mentioned information in the component visualization component information storage means 3 may be input by coding.

[0034] The representative value changing means 7 sets the value of the data identifier of the data structure information 3b corresponding to the representative value data identifier of the visualization component information 3a as a value output from the main slot of the component. The change of the representative value is made when the visualization part information 3a is updated.

[0035] The data linkage means 8 is a means for processing the transfer of data between the parent and child based on the information of the parent-child relationship between the parts displayed on the screen of the display device 11 stored in the inclusion relationship management means 10. is there. When data is transferred between parts having a parent-child relationship by this data linkage means 8, since a unified interface is provided, it is possible to transfer data between all parts.

[0036] The event management means 9 copies a part as a common work place among a plurality of display devices from a master display device to a slave display device, and causes an event or a change in a figure due to a mouse operation generated in each display device. Event information is shared by a server-and-client communication method.

[0037] The inclusion relationship management means 10 stores information on the parent-child relationship between the parts displayed on the screen of the display device 11, and the data linkage means 8 transmits the data via the main slot between the parts having the parent-child relationship. Propagate.

[0038] FIG. 3 is a flowchart of processing of the visualization component generating means. In this figure and thereafter, the numbers following S in the figure indicate the step numbers in each process. The processing of the visualization component generating means will be described below in step order. First, component visualization Part information is created, the address of the corresponding processing unit is set (step S1), and the number of data values input / output to the processing unit is read from the generator definition statement described later (step S2). ), Create a data structure corresponding to the number of visualization parts information (step S3), write data sequentially to the data identifier in the data structure of all the data written in the processing unit (step S4), and data. Set the data identifier of the join destination to Nil (step S5), set the address of the corresponding figure interlocking process, generate the figure interlocking process, that is, the programming to draw the figure written by the generator is loaded (step S6). ), Set the figure area size to the standard value or the specified value (step S7), execute the figure interlocking process, that is, execute the program for displaying the figure, display the figure by the display means (step S8), and end. ..

[0039] FIG. 4 is a first half flowchart of the processing of the data linkage means, and FIG. 5 is a second half flowchart of the processing of the data linkage means. The processing of the data linkage means will be described below in step order. First, the specified part is set to the update symmetric part (step S1), the specified data identifier is set to the update data (step S2), the specified value is set to the update value (step S3), and so on. The component update process is executed (step S4), and it is determined whether or not the data identifier list whose value has changed includes the data identifier of the representative value. If the determination result is YES, the process proceeds to step S6, and the determination result is NO. If, the process proceeds to step S13 (step S5), it is determined whether or not the value of the data identifier of the data combination destination is Nil, and if the determination result is not Nil, the process proceeds to step S7, and when the determination result is Nil. Moves to step S13 (step S6), searches for the parent part from the inclusion relationship management information (step S7), determines whether the parent part is in the inclusion relationship management information, and if there is a determination result, proceeds to step S9. Proceed, when there is no judgment result, the process proceeds to step S13 (step S8), the data identifier of the data combination destination of the current part is set as the update data (step S9), and the data of the representative value of the parent part is set as the update value. Set (step S10), set the parent part as the update representative part (step S11), set the parent part as the current part, and return to step S4 (step S12).

[0040] After the completion of steps S5, S6 or S8, the child parts are searched from the inclusion relationship management information, written to the propagation destination parts list (step S13), it is determined whether or not the propagation destination parts list is empty, and the determination result is obtained. If is YES, the process ends, and if the determination result is NO, the process proceeds to step S15 (step S14), one component is extracted from the propagation destination component list, set as the update target component (step S15), and the representative value. Set the data identifier of (step S16) to the update data, set the value of the data indicated by the data identifier of the data combination destination of the part to be updated as the update value (step S17), and execute the part update process (step S18). ), Set the part to be updated as the current part, and return to step S13 (step S19).

FIG. 6 is a detailed flowchart of the component update process in the data linkage means. The parts update process will be described below in step order. First, the value corresponding to the data identifier of the part to be updated is updated (step S1), the data value of the corresponding processing unit is set to the value of the corresponding data identifier, the instruction sequence is executed (step S2), and the instruction is issued. It is determined whether or not there is a change in the data value after the column is executed, and if the determination result is YES, the process proceeds to step S4, and if the determination result is NO, the process ends (step S3), and the data of the data identifier is input. Update (step S4), execute and display the figure interlocking process (step S5), store the data identifier whose value has changed (step S6), and end.

[0042] FIG. 7 is a flowchart of a graphic interlocking process at the time of drawing. The event management means is called from the data linkage means when the data value in the data structure changes, and the figure linkage process for drawing the figure will be described in step order. First, attributes such as the position, size, shape, and color of the figure are calculated based on the data values (step S1), and it is determined whether or not it is necessary to change the display content of the figure, and the determination result is If YES, proceed to step S3, if the discrimination result is NO, end (step S2), calculate the figure area size and set it in the visualization part information (step S3), and display the figure on the screen of the display device. (Step S4), call the event management means to notify that the state of the figure has changed (step S5), and end. By this figure interlocking process, for example, a figure editing program for moving the needle of the meter is executed.

[0043] FIG. 8 is a flowchart of the graphic interlocking process when an event occurs. The graphic interlocking process that is called from the event management means when an event occurs and rewrites the data when the display changes will be described below in step order. First, it is determined whether or not the event needs to change the display of the figure, and if the determination result is YES, the process proceeds to step S2, and if the determination result is NO, the process proceeds to step S5 (step S1). Calculate attributes such as the position, size, shape, etc. of the figure according to the event (step S2), calculate the figure area size and set it in the visualization part information (step S3), and draw the figure on the screen of the display device. Then (step S4), it is determined whether or not the event needs to change the data value in the data structure, and if the determination result is YES, the process proceeds to step S6, and if the determination result is NO, the process ends (step S4). Step S5), determine the data identifier of the data to be changed, calculate the changed value (step S6), call the data linkage means and change the data in the data structure of the part to the specified value (step S5). S7), finish.

[0044] FIG. 9 is a flowchart of a process for generating a new process structure from the bonded structure. The process of generating a new processing structure from the bonded structure will be described below in step order. First, a part A with an empty processing unit is generated (step S1), the highest parent is registered in the temporary storage unit (step S2), the temporary storage unit is determined whether it is empty or not, and it is determined to be empty. If it is, it ends, and if it is determined that it is not empty, it proceeds to step S4 (step S3), selects one part P from the temporary storage unit (step S4), and sets the corresponding processing unit of part P to part A. Add to the corresponding processing unit of (step S5), delete the part P from the temporary storage (step S6), determine whether the part P has children, and if it is determined to have children, step Proceed to S8, and when it is determined that the child does not have a child, the process returns to step S3 (step S7), and all the children of the part P are registered in the temporary storage unit (step S8).

[0045] FIG. 10 is a flowchart of a process for generating a new data structure from the bonded structure. The process of generating a new data structure from the bonded structure will be described below in step order. First, a part A with an empty data structure is generated (step S1), the highest parent is registered in the temporary storage unit (step S2), the temporary storage unit is determined whether it is empty or not, and it is determined to be empty. If it is, it ends, and if it is determined that it is not empty, it proceeds to step S4 (step S3), selects one part P from the temporary storage part (step S4), and sets the corresponding data structure of part P to part A. Add to the corresponding data structure of (step S5), delete part P from the temporary storage (step S6), determine if part P has children, and if so, step Proceed to S8, and when it is determined that the child does not have a child, the process returns to step S3 (step S7), and all the children of the part P are registered in the temporary storage unit (step S8).

[0046] FIG. 11 is a flowchart of the event delivery process. The event delivery process will be described in step order below. First, it is determined whether or not the state change has occurred inside the area, and if the determination result is YES, the process proceeds to step S2, and if the determination result is NO, the process ends (step S1) and shares the area. It is determined whether or not there is a partner, and if the determination result is YES, the process proceeds to step S3, and if the determination result is NO, the process ends (step S2), and the event is delivered to all the partners who share the area. (Step S3), finish.

FIG. 12 is a diagram showing a first embodiment of the present invention. On the screen of the display means 30, at the upper part of the screen, there are a component 31 having a four-rule calculation function, a component 32 having an input function, a component 33 having an output display function in a band graph, and a component 34 having an image output display function. Is displayed. As described above, these parts are parts stored in advance in the system, are displayed in a menu on the screen, and can be displayed on the screen by operating a mouse as an input means. At the bottom of the screen, the four rules calculation function component 31 is moved first, and the input function component 32, the output display function component 33, and the image output display function component 34 are pasted on the four rules calculation function component 31 by the movement. Is shown. When the numerical data to be written on the input function component 32 is input to the four-rule calculation function component 31 and the addition of the four-rule calculation function component is selected as the representative value, the addition is executed and the data of the addition result is output and displayed. Input to the component 33 and the image output display function component 34, the state of the band of the output display function component 33 changes, and the image output display function component 34 is said to be the state of the image to be displayed, for example, the running state or the sleeping state. It changes like.<u style="single">In this way, according to the representative value changing means, the most frequently used value among the plurality of values (slots) of one component can be changed (set) as the representative value (main slot). For example, by selecting any one of addition, subtraction, multiplication, or division of the four-rule calculation function component as a representative value, one component can be used according to the function, and the versatility of the component is enhanced. In addition, even if parts have the same function, the data that changes most frequently differs depending on the situation (situation or purpose of use) in which they are used. By making it possible to change (set) the representative value (main slot) by means 7, one component can be used for various purposes. This representative value can be changed (set) by the representative value changing means 7, when handling a decoding component as in the present invention, that is, a figure having an inclusion relationship between a parent figure and a child figure. It is particularly effective for making each decrypted component usable for various purposes and improving reusability.</u>It should be noted that the input function component 32 and the output display function component 33 are GUI components, and the figures standardized by the GUI can also be used as components. This is because, as an intellectual asset, even an end user can perform, for example, arithmetic processing as described above simply by visually manipulating a figure without requiring complicated programming. It is also possible to save the new figure created in this way and use it as a new intellectual asset.

[0048] FIG. 13 is a diagram showing a second embodiment of the present invention, (A) is a diagram showing an RDB cooperation component, and (B) is a diagram showing a bonding of a graph display component and a table display component. is there. This figure shows an example of reading RDB (relational database) data, writing data to table rows and columns, and drawing a graph. The RDB linkage part is a component that has the function for that purpose, and when the graph display component and the table display component are pasted on the RDB linkage component, the data is automatically read from the RDB and the table row on the table display component is displayed. Data is written to the columns and a graph is drawn on the graph display component. When the graph display component and the table display component are pasted on the RDB linkage component, the slot corresponding to each display component is determined from the plurality of slots (ports to be connected to the bonded component) of the RDB linkage component. In addition, the RDB linkage component is combined with the RDB in a slot for searching the data required for the graph display component and the table display component from the RDB.

FIG. 14 is a diagram showing a third embodiment of the present invention. This figure shows an example in which an event is shared in a collaborative workshop between computers when collaborative work is performed between computers A, B, and C. The area of the component 44 shared by the event is displayed on the screens 41, 42, and 43 of the display means of each of the computers A, B, and C. Areas other than the area occupied by the event-shared component 44 on the screens 41, 42, and 43 can be used by each computer A, B, and C for unique processing independently of other computers. Therefore, assuming that the teacher operates Calculator A and the students operate Calculator B and Calculator C respectively, the student does not know the area on the screen other than the area of part 44 where the event is shared. You can operate the computer freely with. Of course, when a student generates an event due to mouse operation or a change in a figure on the screen in the area of the event shared part 44, the teacher can immediately know the change of the event shared part 44 due to the event. it can.

[0050] FIG. 15 is a diagram showing a fourth embodiment of the present invention. In this figure, the graphic display means 51 manages the parts displayed on the screen, the position and display form of the parts, and the inclusion relationship between the other parts. The inclusion relationship indicating means 52 is a means for establishing an inclusion relationship between the parts displayed on the screen of the display means 51, and the visualization part information storage means 53 has a function corresponding to the parts displayed on the screen of the display means 51. It is a means of mainly storing information about. The structural conversion means 54 is a means for converting the data structure or processing structure of a part to create a part having a new structure. The inclusion relationship management means 51'manages the inclusion relationship (parent-child relationship) between the parts displayed on the screen of the display means 51. In the illustrated inclusion relationship management means 51', the inclusion relationship of the parts A, B, and C displayed on the screen of the display means 51 indicates that A is the parent of B and B is the parent of C. The table shown in the visualization component information storage means 53 in this figure shows the relationship between components A, B, and C. Part A processes the input data from the input device, and component B processes the input data and outputs the result. It is shown that the component C is associated with the output processing to the output device for some kind of filtering processing. The structural conversion means 54 converts the process so that the side including the component (parent) is input and the side (child) included in the component is output. In the associative process, the inclusion relation instruction means 52 that receives the operation input of the mouse executes the process of placing the part B on the part A and moving the figure so as to place the part C on the part B. , Will be executed. As a result, a series of processes for filtering the data from the input device and outputting it to the output device is defined.

[0051] FIG. 16 is a diagram showing an operation example of a graphic according to the present invention, (A) is a diagram showing a copy of the graphic, and (B) is a diagram showing peeling of the graphic. In FIG. 16A, parts A, B, and C are represented by corresponding figures A, B, and C, which consist of parts A, B, and C, where A is the parent of B and B is the parent of C. Right button with mouse<u style="single">click</u>And left button COPY of the menu shown on the screen<u style="single">click</u>Then, point the handle rubber 60 displayed on the part 61 with the mouse, drag it to move it, and press the left button at the desired position.<u style="single">click</u>It is shown that the part 62 is copied by the above. As a result of copying, the same part 62 as the part 61 is newly created, and the part 61 and the part 62 can be used independently thereafter. The illustrated component 62 shows a state in which the components A, B, and C immediately after copying the component 61 are changed to the components A', B', and C'by independent processing. The upper part of (B) in FIG. 16 is from part 63, which consists of part A, part B, and part C, to part C.<u style="single">click</u>The state in which the part C is peeled off and moved by dragging and moving and dropping at a desired position is shown. Part 63 is a part that gives only input and performs only processing. The lower part of (B) in FIG. 16 is the part 65 to the part B'consisting of the part A', the part B'and the part C'.<u style="single">click</u>It shows a state in which part B'and part C'are peeled off and moved together by dragging and moving and dropping at a desired position. Part 66 is a part that is processed and only outputs.

[0052] FIG. 17 is a diagram showing pasting of figures according to the present invention, (A) is a diagram before bonding, and (B) is a diagram after bonding. FIG. 17 (A) is a diagram before attaching the component 67 composed of the component B'and the component C'to the component 68 composed of the component A and the component B, and FIG. 17 (B) shows the component 67 as the component 68. It is the figure after the part 69 was made by sticking together. The component 69 is a component in which the input data to the component A is repeatedly processed twice by the component B and the component B'and output to the component C'.

[0053] Fig. 18 is a diagram showing an example of creating a figure for executing a branching process according to the present invention, (A) is a diagram before creation, and (B) is a diagram after creation. The branch processing component 73 determines the input data, and determines the execution of the processing according to the determination result. The input processing component 74 executes the input processing from the input device, and the output processing component 75 executes the output processing to the output device. Part 74<u style="single">click</u>Drag and drop it to the right side of the IF on part 73 and drop part 75 in the same way<u style="single">click</u>By dragging and dropping the part 74 and the part 75 onto the part 73 by dropping them on the part 73 to the right side of THEN, it is possible to create a part to be executed according to the conditions.

FIG. 19 is a diagram showing an example of moving two figures having different data structures according to the present invention to create one figure having a different data structure, and FIG. 19A is a diagram before creation, and ( B) is the figure after creation. FIG. 19 (A) shows a state in which the component 77 composed of numerical data and the component 78 composed of character data are moved and attached to the empty component 79. FIG. 19 (B) shows a state in which a part 77 and a part 78 are bonded together on a part 79 to create a new part 79. Note that component 79 is a component for creating a data structure.

[0055] FIG. 20 is a diagram showing a copy of a single figure having a different data structure. The state where the same part 83 is created by moving the part 77 composed of the numerical type data and the part 78 consisting of the character type data onto the dictionary part and copying the created part 79 is shown. After copying, the two identical parts 79 and 83 can be operated independently, and the data of the parts 81 and 82 forming the part 83 can be changed independently of the part 79. Parts 79 and 83 can be applied to RDB records.

[0056] FIG. 21 is a diagram showing a figure in which two identical figures having different data structures are bonded on a dictionary figure. This figure is a copy of part 79 and part 83 on dictionary part 84, and includes part 77 consisting of numerical data and part 78 consisting of character data, and part 81 consisting of numerical data and part 82 consisting of character data. It is shown that the component 84 in which the numerical type data and the character type data are mixed can be created. It can be seen that parts containing similarly complex data structures are created. Note that part 84 can be applied to the return table of RDB.

[Effects of the Invention] As described above, according to the programming system using the graphic of the present invention, the end user can easily create or edit a computer application program limited to the programmer.

[0058] A newly created component obtained by combining the components according to the present invention can be stored and reused, and can be utilized in an end user's application program. Moreover, the created parts can visually capture the functions and the functions are easy to understand.<u style="single">In particular, according to the representative value changing means, the most frequently used value among the plurality of values (slots) of one component can be changed (set) as the representative value (main slot). When dealing with a decoding part, that is, a figure that has an inclusive relationship between a parent figure and a child figure, it is possible to use one part according to its function and increase the versatility of the part. The component can be used for various purposes, and the reusability of the decrypted component can be improved.</u>[0059] The links between the data are not described in the program language, and can be visually captured as a graphic, and the readability is good. Since the data structure can be easily manipulated by visualization, programming mistakes are eliminated even in a complicated data structure, the readability and editability of the data structure are improved, and the data structure can be used or reused.

[0060] According to the present invention, since a figure and a process can be edited in association with each other, programming can be easily performed with an operation feeling like editing a figure. The function of the newly created parts represented by the graphic can be visually grasped, and the readability of the processed contents is good. In addition, the processing procedure can be easily used or reused.

BRIEF DESCRIPTION OF THE DRAWINGS [Fig. 1] Fig. 1 is a structural diagram of the principle of the present invention.

FIG. 2 is a detailed explanatory view of a visualization component information storage means and a processing unit storage means according to the present invention.

FIG. 3 is a flowchart of processing of a visual component generating means.

FIG. 4 is a flowchart of the first half of the process of the data linkage means.

FIG. 5 is a flowchart of the latter half of the process of the data linkage means.

FIG. 6 is a detailed flowchart of a component update process in the data linkage means.

FIG. 7 is a flowchart of a graphic interlocking process at the time of drawing.

FIG. 8 is a flowchart of a graphic interlocking process when an event occurs.

FIG. 9 is a flowchart of a process for generating a new process structure from the bonded structure.

FIG. 10 is a flowchart of a process for generating a new data structure from a bonded structure.

FIG. 11 is a flowchart of event delivery processing.

FIG. 12 is a diagram showing a first embodiment of the present invention.

13A and 13B are diagrams showing a second embodiment of the present invention, in which FIG. 13A is a diagram showing an RDB cooperation component, and FIG. 13B is a diagram showing a bonding of a graph display component and a table display component.

FIG. 14 is a diagram showing a third embodiment of the present invention.

FIG. 15 is a diagram showing a fourth embodiment of the present invention.

16A and 16B are diagrams showing an operation example of a graphic according to the present invention, FIG. 16A is a diagram showing a copy of the graphic, and FIG. 16B is a diagram showing peeling of the graphic.

17A and 17B are views showing pasting of figures according to the present invention, FIG. 17A is a diagram before bonding, and FIG. 17B is a diagram after bonding.

FIG. 18 is a diagram showing an example of creating a figure for executing branch processing according to the present invention, (A) is a diagram before creation, and (B) is a diagram after creation.

FIG. 19 is a diagram showing an example of moving two figures having different data structures according to the present invention to create one figure having different data structures, (A) is a diagram before creation, and (B) is a diagram. Is the figure after creation.

FIG. 20 is a diagram showing a copy of one figure having a different data structure.

FIG. 21 is a diagram showing a figure in which two identical figures having different data structures are bonded on a dictionary figure.

[Explanation of Codes] 1 ... Processing device 2 ... Inclusion relationship indicating means 3 ... Visualization component information storage means 4a ... Data structure conversion means 4b ... Processing structure conversion means 5 ... Processing Unit storage means 6 ... Visualization component generation means 7 ... Representative value changing means 8 ... Data linkage means 9 ... Event management means 10 ... Inclusion relationship management means 11 ... Display device 12. .. input device