AU607587B2 - Method and device of automatic program generation - Google Patents

Description

MOO6682 16/02f ;57 iti

III

n~j f 6075 7 COMMONWEALTH OF AUSTRALIA PATENTS ACT 1952 COMPLETE SPECIFICAION NAME ADDRESS OF APPLICANT: Sadashiro Sakai 21, Higashinakafuri 1 chome Hirakata-shi Osaka Japan 1. ct fur I g~ I NAME(S) OF INVENTOR(S): Sadashiro SAKAI ADDRESS FOR SERVICE: DAVIES COLLISON Patent Attorneys 1 Little Collins Street, Melbourne, 3000.

COMPLETE SPECIFICATION FOR THE INVENTION ENTITLED: Method and device of automatic program generation

J

B

The following statement is a full description of this invention, including the best method of performing it known to me/us:- Vi If U-1 1A 1 Background of the Invention 2 3 1. Field of the Invention 4 The present invention relates to a method and a device 6 of automatic program generation for generating programs by 7 automating coding work.

9 2. Description of the Related Art 11 12 0 13 14 16 e 0 17 18 19 21 *o o 22 23 004r 24 26 27 28 29 31 32 33 34 36 For generating computer programs by a conventional method, plans of computer programs are proposed, specifications thereof are reviewed, basic and detailed designs are worked out. Proposed computer programs are coded into a specified language and checked for incorrect codings. As shown in Fig. 1, the coded program (Al) is then stored (A2) into a computer by means such as a keyboard so as to generate a source text An operator then checks the syntax of such source text and compiles it or assembles it Incorrect key entries and grammatical errors are then checked Incorrect entries or grammatical errors which are identified are printed corrected, recorded, and the above activities are repeated. After incorrect entries and grammatical errors are eliminated, the operation of the program is evaluated (A7) and the system of control of a desired object is simulated Programs are developed and generated conventionally in such a manner as described above.

However, in conventional program generation, the operator must be fully familiar with a specific language such as a symbolic language, FORTRAN language or C language, and further an enormous amount of statements must be coded sequentially by using such a language, with potential errors in writing, such as mistaking for highly likely to occur.

900706,kx1spe.008.,akai, 1

I

t"

:I

a i 1 I 1 i t -1.

V 4k~ ii"T 2 There have been methods proposed for generating programs without coding for the above reasons but it cannot be said that such methods always successfully overcome the difficulties mentioned.

6 Summary of the Invention 8 9 11 12 13 14 0 15 4 00 0 0 16 00o 0 00 0 00 17 18 19 21 °0 22 23 24 26 27 28 29 31 32 33 34 36 An object of the present invention is to provide a method and a device for automatic program generation which is capable of generating programs and of eliminating manual coding without having to become familiar with a programming language.

According to the present invention there is provided an automatic program generating method comprising steps of: a step where a content of a whole work to be processed is divided into a plurality of tasks, each task thereof is assigned to a row or column of a matrix or a table; a step where a free-setting task element common to each task is assigned to a column if said tasks are assigned to rows, or row if said tasks are assigned to columns, of said matrix or table; a step where a fixed task element mark is assigned to an element of said matrix or table in order to identify a content of one of said tasks with a free-setting task element; a step where the type and position of the fixed task element mark is read; and a step where a previously prepared incomplete program statement corresponding to said type of said fixed task element mark is fetched and completed by utilizing the content of said free-setting task element corresponding to said position of said fixed task element mark.

There is also provided an automatic program generating device according to the present invention comprising:

V

I

900710kxspe.08,sakai.2 i.i .r.

.irLt i i a;-l t 3 i 1 2 3 4 6 7 8 9 11 0 0 12 o o *0 0. 13 o 14 00 16 0 00 17 18 19 000 20 0 0 21 S 22 23 0 0o 24 S. 4 26 27 S0 28 29 31 32 33 34 36 37 J- 38 an information holding frame body which has rows or columns of a matrix or table where a plurality of tasks constituting content of a whole work to be processed is to be assigned, columns or rows of said matrix or table where a freesetting task element common to each task thereof, is to be assigned, and elements of said matrix or table where a fixed task element mark, which is means for identifying content of said task with said free-setting task element, is to be assigned; a mark reading means for reading a type and position of said fixed task element mark of said information holding frame body; a memory means which stores in advance an incomplete program statement corresponding to said type of said fixed task element mark; and a statement generating means for fetching the previously prepared incomplete program statement and for generating a complete program statement by utilizing content of said free-setting task element corresponding to said position.

There is further provided an automatic program generating device according to the present invention comprising: an information holding body which has rows or columns of a matrix or table where a plurality of tasks constituting content of a whole work to be processed is assigned, columns or rows of said matrix or table where a freesetting task element common to each task thereof, is assigned, and elements of said matrix or table where a fixed task element mark, which is means for identifying content of said task with said free-setting task element, is assigned; a mark reading means for reading a type and position of said fixed task element mark of said information holding body; 900709,kxlspe.008.sakai.3

I:

I

4', LY:: 1 I L LIC -i i 4 9 11 it 12 13 14 15 f r t 16 17 18 19 21 22 23 24 26 27 S 28 29 31 32 33 34 36 37 4 VIpI program statement corresponding to said type of said fixed task element mark; and a statement generating means for fetching the previously prepared incomplete program statement and for generating a complete program statement by utilizing content of said free-setting task element corresponding to said position.

There is further provided an information holding frame body comprising: rows or columns of a matrix or table where a plurality of tasks constituting content of a whole work to be processed is to be assigned, columns or rows of said matrix or table where a freesetting task element common to each task thereof, is to be assigned, and elements of said matrix or table where a fixed task element mark, which is means for identifying content of said task with said free-setting task element, is to be assigned.

There is still further provided an information holding body comprising: rows or columns of a matrix or table where a plurality of tasks constituting content of a whole work to be processed is assigned, columns or rows of said matrix or table where a freesetting task element common to each task thereof, is assigned, and elements of said matrix or table where a fixed task element mark, which is means for identifying content of said task with said free-setting task element, is assigned.

Brief Description of the Drawings 41; Fig. 1 is a flowchart showing a conventional program generating method.

900706.kxlspe.008,sakai, 4 i i i i i i -capw^ 4 5 Fig. 2 is a block diagram showing an embodiment of an automatic program generating device according to the present invention.

Fig. 3 is a plan view of an information holding frame body used in the above embodiment.

Fig. 4 is a plan view of other information holding frame body used in the above embodiment.

Fig. 5 is a plan view of a pad used for the information holding frame body shown in Fig. 4.

0o 4 00 0o 0 00 4 0 00 0 0 0 0 0 1 S0 oo00 0D0 0 ol

S

0 t Fig. 6 is a block diagram illustrating embodiment of the present invention.

another Figs. are schematic diagrams showing a further embodiment of the automatic program generating device according to the present invention.

Fig. 8 is a construction view showing the kinds of fixed task element marks used in the above embodiment.

Figs. 9 16 are plan views of the information holding body used in the above embodiment.

Fig. 17 is a plan view showing the train running route of the above embodiment.

Fig. 18 is a plan view of the information holding frame body used in the above embodiment.

Figs. 19 and 20 are flowcharts showing the train running of the above embodiment.

j 900706,kxlspe.008.sakai5 -6- Dscription of the Preferred Embodiments The present invention will hereinafter be described further with reference to the drawings which show the embodiments thereof.

Fig. 2 is a block diagram showing an embodiment of the automatic program generating device according to the present invention. Fig. 3 is a plan view of the information holding frame body 1 which is used for the embodiment shown in Fig.

2, and Fig. 4 is a partial plan view showing concrete status of the information holding frame body 1 shown in Fig. 3. The information holding frame body 1 consists of a body which is made from sheet-like material, for example, comprising paper, wood, plastics, metal or other material or made from a screen of, for example, a cathode ray S, tube, liquid crystal screen or other picture displaying device. Such body 1, may also be one which is a thick body such as a blackboard consisting either of the above 4 15 materials or any one which is capable of holding information such as a cube or a drum-like body.

S 0 On the body 1 is formed the matrix 5. Each row thereof is designed so that a plurality of tasks aO a1234, which constitutes the content of the whole work to be o 20 processed, are disposed to correspond to each other. When each task aO a1234 is executed respectively, the entire work to be processed will be executed. Each task aO a1234 is collected together as a unit for processing and will normally bring forth an intermediate result or a final result.

5 t25 With reference to Fig. 4, an example of a whole work to be processed may be 'the operation of a double door system having a first door and a second door, wherein the access to and from a place is appropriately controlled by persons entering the place from outside and persons staying inside the place'. The content of this work may be divided into a plurality of individual tasks, for example: 'if something is outside the first door and the weight thereof is over 30 kg, a controlling unit recognises that the thing is not a dog or a cat but a human being 901128,vrsspc.001,salai,6 -7t t 4~ g 4 I 04 00 0400 o o o 0 00 00 0 O 00 0 04 0 @0 0 o o 00044 0044 4@ o 0 0'4 0 0 4 44 .0 0 0 0 0 0440000 0 8 0 oa.-o 0 8 0000 440 00 00

I

which is outside the door, and causes a motor for opening the first door to be driven' (task aO); 'if some thing is outside the first door and the weight thereof is over 30 kg, and someone is between the first door and the second door, the unit drives the motor to open the first door and drives a valve so as to close the second door' (task al); 'if nothing is outside the first door and someone is between the first door and the second door, the unit drives the motor so as to close the first door and drives the valve so as to open the second door' (task a2); and 'if the unit is driving the motor so as to open the first door, the unit drives the valve so as to close the second door' (task a3); and so on.

In order to realize further the contents of the above tasks to be achieved, relations of conditions should further be analysed for addition to the tasks. As shown in Fig. 3, in the columns of the aforementioned matrix 5, it is designed so that a 15 plurality of free-setting task elements bO b9, which are common to each task a0 a1234 of the matrix 5, are disposed to correspond to each column, The free-setting task elements are elements which may be common to the tasks constituting the content of the work to be processed, and can be freely set by a user. For example, in the case of the above mentioned double door control system, each of the tasks aO to a3 involve 20 use of the motor controlling the first door, where the motor corresponds to free-setting task element b4. During program generation, such free-setting task elements correspond with the whole or a part of the operand area of a program statement.

More specifically, in the example of the aforementioned double door system, 25 the free-setting task elements (bO to b4) include: 'the sensorJ1 for detecting the presence of something outside the first door' (task element bO); 'the sensQr 2 for detecting the presence of someone between the first door and the second door' (task element bi); 'the sensor3 for detecting the weight of someone outside the first door' (task element b2); 14 t 901 128,vrsp:A001,sakai,7 di :i ii: :i: i: i:

EI

-8tc tr e

C

C C 'C 4 o tC 401 4' 'C 49 ii 4 9 'the yai for opening and closing the second door' (task element b3); and 'the moWar for opening and closing the first door' (task element b4).

The aforementioned free-setting task elements may have a conditional 5 character, data derivative character, consequential character, operation judging character, or other character. For example, a free-setting task element with conditional character is a task element which relates to a conditional or qualifying portion of a task. In the example relating to Fig. 4, the free-setting task elements bO, bl and b2 represent task elements displaying conditional character: 'sensor 1 for detecting the presence of something outside the first door' (task element bO), 'sensor.2 for detecting the presence of someone between the first door and the second door' (task element bl), and 'sensor 3 for detecting the weight of someone outside the first door' (task element b2) all relate to conditions imposed on tasks aO to a2. A freesetting task element with consequential character is a task element which relates to the portion of a task which brings about some consequence. A free-setting task element with consequential character is represented by the aforementioned 'valve for opening and closing the second door' (task element b3), since this is related to the consequence, in tasks al to a3, of opening and closing the second door.

20 Further, the character of a particular free-setting task element is variable and dependent upon the task. This can be seen, for example, in the case of the 'motor for opening and closing the first door' (task element b4) which has consequential character in relation to tasks aO to a2, but has conditional character in relation to task a3. That is to say, the consequence of a certain task can be the condition or assumptive element 25 of other tasks.

A plurality of the aforementioned free-setting task elements bO b9 are collected together by virtue of their consistent character and arranged in a zone, as shown in Fig. 3. For example, 6 denotes the ON/OFF character zone, 7 denotes the consequential character zone and 8 denotes input/output character zone.

Ioc 9 341 r

I.

i S 0p a 901128,vrsspc.OOl,saka,8 -9- The inside of the matrix 5 is designed so that the fixed task element marks 9 are provided for correlation of the content of the tasks aO a1234 with the freesetting task elements bO b9. The fixed task element mark 9 has a plurality of types, each of which has its content predetermined. During program generation, the fixed task element mark 9 corresponds with the operation portion of a program statement.

The operation part referred to herein does not mean the operation part in public use only but also means the operation part which is further added with a fixed operand in part or whole under certain circumstances. In Fig. 4, o is associated with a conditional character, and this o may, for example, cause the controlling unit to read the data of the free-setting task element of the matrix column to which the mark belongs and check whether the conditional character is ON. The symbol E denotes 0o°o the consequential character and that it drives the free-setting task element (for 4 example, valve or motor) of the matrix column to which the mark belongs. The 0° symbol a denotes that it is the consequential character and that it stops driving the a 0 0 15 free-setting task element of the matrix column to which the mark thereof belongs.

I Further, o in the task a3 represents the conditional character and means that it reads S the free-setting task element to which the conditional character belongs and checks whether the conditional character is ON.

The correlation between the process content of the tasks and the free-setting task elements by virtue of the fixed task element marks means, for example, that the aforementioned operation portion can be combined with the aforementioned operand portion to thereby complete a program statement. Referring to the example mentioned 'above, such identification means to complete a program statement which corresponds aoaG 25 with the concrete contents that 'the output of the sensor 2 for detecting the presence Soo of someone between the first door and the second door' is read to determine whether the sensor 2 is ON.

The fixed task element mark 9 may be any means such as formulae, kanji, numerals, characters, geometrical shapes or patterns or colour marks.

901128,vrsspc.001,slkt9 S- 10 Contents of the fixed task element marks 9 include, for example, various types of operation parts as described above which contain a command for setting bits (93 in Fig. a command for clearing bits (92 in Fig. a command for comparing data with a constant value dl (94 in Fig. a command for comparing data with constant values d4 and d5 (95 in Fig. a command for setting data of absolute value to a variable d2 (96 in Fig, and a command for setting data of relative value (97 in Fig.

3).

In Fig. 2, the mark reading means 2 is means for reading the type and the position of the aforementioned fixed task element mark 9 of the aforementioned information holding frame body 1. An information holding body 1' comprises the information frame holding body 1 and the information. The mark reading means can, for example, be means such as an optical reading device if the aforementioned information holding frame body 1 is a sheet-like body or a CPU (Central Processing Unit) for reading information such as the fixed task element mark 9 generated on the :4 screen thereof if the frame body 1 is the screen of the CRT. Further other means such as the mark reading means of magnetic types and air pressure types are also possible.

In addition, the aforementioned mark reading means 2 can be equipped with a pattern recognition function.

The memory means 3 is means such as a ROM (Read Only Memory) which stores in advance various incomplete program statements that correspond with the aforementioned fixed task element marks 9.

The statement generating means 4 fetches the incomplete program statement, prepared in advance and stored in the aforementioned memory means 3, based on the type and position of the fixed task element mark, which is read by the mark reading means 2. Each incomplete program statement is thereafter completed by the statement generating means 4 by combining the fetched incomplete program statement with the content of the free-setting task element identified with the said fixed task element mark.

901128,vrsspe.01,szki L- 0 0 00 0 00 0 00 0 0 o o p 00.94 o 0 0 0 00 0004 o 0 0 0 0 0 00 00 0 0 00 0 09 4000 0000 0 0 0 00 0 000001 @0090 1 9*00 0044 *0 01 9* 0 0 11 A second automatic program gencrating device of the present invention is only different from the first automatic program generating device of the present invention as far as the information holding frame body 1 is concerned. In other words, in the second automatic program generating device, instead of the aforementioned information holding frame body 1, the information holding body 1' stored with the tasks aO a1234, free-setting task elements bO b9, and fixed task element marks 9 described above, are the components.

The following describes operations of the embodiment of the aforementioned first automatic program generating device of the present invention and an embodiment of the method of the present invention.

Initially the memory means 3 is pre-stored with a number of incomplete program statements such as machine language, symbolic language or a higher 15 language which corresponds with the type of many operation parts (command) so as to allow processing of diversified tasks. The memory means 3 is further stored such that each incomplete program statement corresponds with a symbol or numeral such as 0, 0, 0, and which make up the set of aforementioned fixed task elements 9.

The maker then causes each matrix column of the aforementioned matrix 5 to 20 correspond with a port for external input and output of the controlling computer on a one-to-one basis.

A user divides the content of the work to be processed into a plurality of tasks AG a1234. Each task aO a1234 is to correspond with a row of the matrix 5 of the 25 aforementioned information holding frame body 1 on one-to-one basis and arranged accordingly. In the example described above, the tasks are arranged in such order as: 'if someone is outside the first door and the weight of such person is over kg, the task recognises that the object is not a dog or a cat but a human being is outside the door and causes the motor to open the first door' (task aG); 'if someone is outside the first door and the weight of such person is over kg and someone is between the first door and the second door, the task acts to drive 901 128,vrssp.0X31,sakai,1 11 12 0 *1 *1 o o 0* o o, OGQt 4 0 0004 0 00 00 00 0 the motor so as to open the first door and drive the valve so as to close the second door' (task al); 'if no one is outside the first door and somcone is between thc first door and the second door, the task acts to drive the motor so as to close the first door and drive the valve so as to open the second door' (task a2); and 'if the motor is being driven so as to open the first door, the task acts to drive the valve so as to close the second door' (task a3).

The free-setting task elements bO b9 which arc common to tasks aO a1234 are arranged to correspond with the columns of the matrix 5. In the examples of above, the tasks are reliant upon the 'sensorI for detecting the presence of someone outside the first door' (task element b0), 'sensor2 for detecting the presence of someone between the first door and the second door' (task element bi), 'sensor3 for dtetecting the weight of the person outside the first door' (task element b2), '-vaLve for 15 opening and closing the second door' (task element b3), and 'moto. for opening and closing the first door' (task element b4). The ports for external input and output of the controlling computer are connected to the aforementioned sensor sensor 2, sensor 3, valve, and motor.

20 Then, the fixed task element marks 9 which identify the content of the tasks with the free-setting task elements bO b9, are provided at the specified positions of the matrix 5 or table in correspondence with the content of the processed task. In the task aO shown in Fig. 4, the mark 0 is provided in the column of the sensor 1 and sensor 3 and the mark El is provided in the column of the motor. Such arrangement 25 will process the task that 'if something is outside the first door and the weight of such object is over 30 kg, the task recognises that an object is outside the door which is not a dog or a cat but a human being, and drives the motor to open the first door'. In other tasks, the sensors, valve and motor are marked in the same manner according to the content of the task. In such a way as above, the information holding body 1' is completed from the information holding frame body 1.

000 0441 00 a. ao~ 44 4:, 4: 901 128,visspr.001,sabi,12 I r i i L 'vnwi i- i ft It 13 Then, the mark reading means 2 reads the type and the position on the matrix of this mark on the information holding body 1' stored with various information.

The statement generating means 4 of the automatic program generating device of the present invention fetches from the memory means 3 an incomplete program statement which corresponds with the type of the mark read by the aforementioned mark reading means 2, combines the fetched incomplete program statement with the content of the free-setting task element corresponding to the position of the read mark, and completes a program statement. If an incomplete statement of machine language, for example, is prepared in the memory means 2 during program statement completion, there is a merit that the program comprising machine language can be generated directly, rather than compiled from some high-level language.

In such manner as above, when the programming of the task aO is completed, the program statement is then completed for the task al in like manner.

The previously prepared incomplete program statement may comprise a conditional character portion and a consequential character portion. For example, an incomplete program statement could be: [if is then is conditional portion consequential portion Then, with reference to Fig. 4, the conditional character portion [if is_ of the fetched incomplete program statement can be completed by combining the free-setting task elements [sensor 1 and ensor 3 in Fig. 4] with conditional character, with said fixed task element mark [for example, in Fig. 4] belonging to said free-setting task elements [sensor 1 and sensor thereby to complete the conditional portion of the program statement [if sensor is o and sensor 3 is o].

The consequential character portion [then is_ of said fetched 901128,vrsspc.001,sakai,13 _i-1 14incomplete program statement is completed by combining the free-setting task element [motor 1] of a consequential character, with said fixed task element mark [0] belonging to said free-setting task element [motor thereby to complete the consequential portion of the program statement [then motor 1 is D].

Thus complete program statement for the task aO can therefore be generated [if sensor 1 is o and sensor is 0 then motor 1 is Fig. 5 is a plan view showing a specified area (hereafter called pad) of the aforementioned matrix 5. The user encloses a constant area with predetermined lines, I' causes the reading means 2 to read such enclosed constant area, and can cause the output to be issued to any free-setting task element when the condition within the enclosed constant area satisfies certain conditions. In other words, one of such pad is the pad 111, and an incomplete program statement which can issue in advance as a warning for the memory means 3 is to be prepared. The statement generating co means 4 combines the aforementioned read area with the incomplete statement, checks all conditions in connection with the fixed task element mark 9 in such a status as shown in Fig. 5, and completes the statement which issues after such conditions are satisfied. The pad 115 is also a similar pad as above. The pad 124 means that it issues when the aforementioned pads 111 and 115 both issue simultaneously.

As stated above, what is called hierarchical structure is realised. When assigning the i pad, a read mark can be added to the side of each mark instead of enclosing with a ,a line, or the pad can be assigned by adding a mark to the side of each mark.

In this manner, the user can generate a program by allocating tasks and freea*t a setting task elements to the lines (rows) and columns of the matrix 5 and by adding the fixed task element marks.

The user sets the program generated in such manner into the aforementioned controlling computer, which in turn controls the object to be controlled by repeated execution of the program.

901128,vspc.001,salki,14 14a The aforementioned matrix 5 may be what is called a 4 #4 0 0 014 08 0 -r 901 128,vrospo.cEI,sakoi i 15 q 0 1 00 0 0 00 0 O f 040 o 4 a 4 18 19 20 00 0 0 1 21 Q 22 23 0 0 a 24 26 27 28 29 30 table and further the rows and columns stated above may be reversed.

Also, the aforementioned information holding frame body 1 may be divided into some number of mark sheets.

As shown in Fig. 6, the information from the information holding body 1' is not read directly from the sheet like body but may be generated by a remote terminal device 55 and caused to be applied utilizing a communication line. The information may be stored in the paper tape 56 or the magnetic recording medium 57 and caused to be entered.

Figs. 7 20 show another embodiment of the present invention with regard to a train service, the details of which are further explained below.

Fig. 17 is a train service route. Designation 171 is a house have a crane and coal stand, designation 172 is a station house, and designation 173 is a platform.

Designation 174 is a rail forming a loop. The rail 174 has a side track 176 at a point (junction) 175. A bumping post 177 is provided at an end of the side track. A sensor 3 for detecting arrival of the train is provided in front of the platform 173. A sensor 1 for detecting arrival of the train is provided at the bumping post 177. Further a sensor 2 for detecting arrival of the train is provided at an intermediate point of the loop rail 174 as shown in Fig. 17.

An uncoupler 178 for uncoupling the trains is provided in front of the house 171. The trains move on such rail.

Fig. 7 shows the train service examples. Train organization A comprising 5 cars including an engine car, passenger cars x, y and goods cars x, y is shown in Fig.

Train organization B comprises 3 cars, an engine car and passenger cars x, y. A right-handed rotation is a positive drive and a left-handed rotation is a reverse 900706, kxlspe.008, sakai i j 1

S-

16 1 drive. A switch SW is means for a train electric source.

2 a il t 3 4 6 7 8 9 11 12 13 14 16 17 -o 18 19 21 22 23 24 26 27 28 29 The A train runs as shown Fig. That is, the A train is of 5 cars and starts from the house 171 and runs on the side track 176 and runs by positive drive on the rail 174 through the junction 175. The A train temporarily stops at the platform 173 (Q Q route). Further the A train starts again from the platform 173 by positive drive and passes the junction 175 and stops at the place of the sensor 2 route). Further the A train runs to the junction 175 by reverse drive and runs into the side track 176 and stops at the bumping post 177 route).

On the other hand the B train runs as shown in Fig.

That is, the rear 2 goods cars x, y of the 5 cars of the A train are uncoupled by the uncoupler 178. The remaining 3 cars, namely, the B train starts from the house 171 and runs on the side track 176 and runs by positive drive on the rail 174 through the junction 175 and further runs without temporarily stopping at the platform 173 and stops at the place of the sensor 2 0 route).

Further the B train starts from the place of the sensor 2 by reverse drive and runs to the junction 175 and stops at the bumping post 177 through the side track 176 route).

On the premise of the above-mentioned train running algorithm, the fixed task element marks are written in as shown in Figs. 8 16 to the information holding frame body as shown in Fig. 18.

Fig. 8 shows the kinds of fixed task element marks.

The marks ON, OFF are for condition collation, DO, BRK are marks for output control mark showing power-on and poweroff. TMS is a mark to indicate the timer setting and TMR is a mark to indicate the timer re-setting. The incomplete program statement corresponding to these ON TMR marks are 900706,kx1pe.008,sakai.15 il;i 17 1 prepared beforehand.

2 3 The way the marks are written to the information 4 holding frame body is hereinafter described taking the case of B train.

S7 i 9 11 12 Li 13 I- 14 1 15 16 17 I 18 i 19 21 22 23 24 26 27 28 29 31 32 33 34 36 37 38 First, are assigned to the column of the free-setting task element of the sheets of each figure, the train drive electric source switch SW, the sensors 1, 2, 3, the forward switch (FRD), the backward switch (BAK), the pointer (junction) coupling the timer 10 (of 10 seconds), the timer 3 (of 3 seconds), element for selecting the train (TRN 4 means A train and TRN 2 means B train), a pass flag (PAS) at the place of the sensor 2, and so on. To the input/output ports of a computer, and corresponding to the number of the assigned column, these switches, timers, memory flag etc are connected.

Then, with regard to the task 1, ON is written in the free-setting task element column of the SW of the train drive electric source since the SW is to be ON. Since the sensor 1, sensor 2, sensor 3 are not to be ON, ON is not written in (Fig. Since the train is to be started, DO is written in FRD column and not in BAK column and the pointer column is not written in since the pointer (P) is at the side of the side track and DO is written in the UC column (Fig. 10). Since the train is B, ON is written in the TRN2 (Fig. 12). With regard to the task 2, B train starts and passes the pointer 175, and when the B train arrives at the sensor 3 (sensor 3 is ON), DO is written in P column, thereby to exchange the pointer 175. Since B train, TRN 2 is ON and the flag PAS is DO (Fig. 12).

Next with regard to task 3, when the train arrives at the place of the sensor 2 (ON is written in (Fig. the train stops (BRK), and the pointer 175 is exchanged (BRK) (Fig. 10). PAS flag is ON (Fig. 12).

900706,kxlspe.008. sakai17 ;i ii 18 Next with regard to task 4, because of non-forward motion (FRD is off), backward (BRK) is executed (DO is written in backward column). Thus the train starts by reverse drive and runs into side track 176 and finally arrives at the bumping post 177. Next with regard to task sensor 1 is ON (Fig. and the reverse drive is stopped. The timer S3 is set (Fig. 11).

Next with regard to task 6, when the sensor 1 is ON and the timer S3 is ON, B train organization is finished (BRK is written in the TRN2 column of Fig. 12). Pass flag PAS is taken down (Fig. 12).

Finally with regard to task 7, the timer 3 is set (Fig.

11) and it is confirmed that TRN2 is off.

Thus the information holding body for B train running is completed.

The information holding body for the A train organization running, is similarly completed as shown in Figs. 13 16.

Because of the construction described above, the automatic program generating device according to the present invention does not require the operator to know the programming language nor does it require the user to perform an enormous amount of coding work. Therefore, programs can be easily generated without having to correct erroneous coding.

It is further understood by those skilled-in the art that the foregoing description is a preferred embodiment and that various changes and modifications may be made in the invention without departing from the spirit and scope thereof.

900706.kxlspe.008,sakai,18 24 26 27 28 29 31 32 33 34 36 4 *4~

Claims (4)

1. Ani automatic program generating method comprising the steps of: a step where a whole work to be processed is divided into a plurality of tasks, and said tasks are assigned to rows or columns of a matrix or a table, said rows and columns of said mnatrix or table intersecting to form a plurality of cross-points; a step where free-setting task elements, each corresponding to an icomplete program portion and each being associated with said tasks, are assigned to the columns or rows of said matrix or table, said free-setting task elements including a conditional character free-setting task element and a consequential character free-setting task element, and said free- setting task elements being collected together by their character and assigned to a different zone respectively; a step where at least one fixed task element mark, each corresponding to an incomplete program portion, is assigned to at least one of said cross-points of said matrix or table in order to identify one of said tasks with one of said free-setting task elements; a step where the type and position of the fixed task element marks are read for every task; a step where a previously prepared incomplete program statement which comprises a conditional character portion and a consequential character portion is manner whereby said conditional character portion of said fetched incomplete program statement is completed by combining said free-setting task element of a conditional character with said fixed task element mark corresponding on said matrix or table to said free-setting task element of a conditional character, and said consequential P character portion of said fetched incomplete program statement is completed by combining said free-setting task element of a consequential character with said fixed task element mark corresponding on said matrix or table to said free-setting task element of a consequential character; and 901128,vrsspc.00,s"319 1 r 1i 20 a step where said completed program statements are compiled or assembled to generate a machine language program.

2. An automatic program generating device according to the present invention comprising: an information holding frame body which has a matrix or table comprising rows and columns which intersect to form a plurality of cross-points; ii a plurality of tasks which together constitute a whole work to be processed, said plurality of tasks being assigned to columns or rows of said matrix or table; a plurality of free-setting task elements associated with said tasks, each of said S| plurality of free-setting task elements being assigned to rows or columns of said matrix or table, and each corresponding to an incomplete program portion; said free-setting task elements including a conditional character free-setting task element and a consequential character free-setting task element, and said free- setting task elements being collected together by their character and assigned to a i different zone respectively; S fixed task element marks of predetermined types, each corresponding to an incomplete program portion, wherein each said fixed task element mark is positioned at least one of said cross-points so as to identify a task to be processed with a free- setting task element aligned on said matrix or table with said fixed task element mark; t mark reading means for reading the type and position of the fixed task element marks; memory means which stores in advance a plurality of incomplete program statements which comprise a conditional character portion and a consequential I 25 character portion; lh 'statement generating means for fetching from said memory means a previously r St prepared incomplete program statement for each task, and generating complete program statements in a manner whereby said conditional character portion of said fetched incomplete program statement is completed by combining said free-setting j task element of a conditional character with said fixed task element mark i corresponding on said matrix or table to said free-setting task element of a conditional 90112S,vrspc.001,« r .1 r 21 character, and said consequential character portion of said fetched incomplete program statement is completed by combining said free-setting task clement of a consequential character with said fixed task element mark corresponding on said matrix or table to said free-setting task element of a consequential character; and compiling means for compiling or assembling said completed program statements to generate a machine language program.

3. An automatic program generating device according to claim 2, wherein, the information holding frame body is a sheet-like body formed of a material selected from the group of paper, wood, plastics, metal, or any combination thereof.

4. An automatic program generating device according to claim 2, wherein, the information holding frame body is a cathode ray tube, liquid-crystal screen, or a screen of some other picture displaying device. An automatic program generating method substantially as hereinbefore described with reference to the accompanying drawings. DATED this 28th day of November, 1990 i SADASHIRO SAKAI By its Patent Attorneys DAVIES COLLISON 1, j i 'al. V_ 901128,vrsspc.001,sakai,21