JPS6350731B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a computer with a program editing function, such as a programmable electronic desktop calculator or a personal computer (hereinafter simply referred to as a computer).

Conventionally, when putting multiple programs into a computer that uses BASIC as the programming language, it has been considered to program them together into one program. As a result, there is a possibility that the same line may exist multiple times in the program, causing problems in program execution.

In addition, in a computer that has a renumbering function that automatically changes the line number of a program, if the jump instruction specifies a line number, when the line number is specified by an expression, the contents of this expression cannot be changed. However, there was a problem in that working memory was required for renumbering.

An object of the present invention is to provide a computer with a program editing function that allows one program and another program added to it to be collectively executed as one program.

Therefore, the present invention provides a computer with a program editing function, such as a program electronic desktop calculator or a personal computer, which can execute a first program and a second program added to the first program. The present invention is characterized in that a jump from a second program is specified by a label name, and a jump within the same program being executed is specified by a line number.

Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.

In Figure 1, 1 is a CPU (central processing unit),
2 is a ROM (read only memory), 3 is a RAM (random access memory), 4 is a key, 5 is a display memory and buffer, and 6 is a display body. CPU1
reads the keys 4, writes data to be displayed on the display 6 to the display memory and buffer 5, according to the procedure written in advance in the ROM 2,
If necessary, the key input contents can be written to RAM 3, or the contents of RAM 3 can be written to display 6.
to be displayed. ROM2 contains the procedure (monitor) and RAM for reading and displaying key 4.
A procedure (interpreter) that operates according to the program written in 3 is written in advance.
RAM3 is an area for storing programs and data. The keys 4 are a matrix of strobe signals S and key signals K from the CPU 1, and are comprised of alphanumeric, symbol, etc. keys. When data to be displayed on the display 6 is written into the display memory and buffer 5, it is converted into a signal suitable for the display 6 and output. A is address bus, D is data bus,
R/W is a read/write signal, S _IN is a serial input signal, and S _OUT is a serial output signal.

A block diagram of a portion of the CPU 1 mentioned above is shown in FIG.

In FIG. 2 above, 7 is an instruction decoder, 8 is an instruction register, 10 is a register and flag, and 11 is an instruction decoder.
is the address buffer, 12 is the accumulator, 1
3 is a temporary register, 14 is an ALU (arithmetic circuit), 15 is a carry, 16 is an S buffer, 17
is K buttuhua, 18 is S _OUT butfua, 19 is S _IN
Buffer 20 is an internal data bus.

Taking Basic as an example of a programming language,
Furthermore, consider a tape recorder as a peripheral device. CLOAD is an instruction that transfers a program from the magnetic tape on which it is recorded to a computer.
There is a statement, CLOAD1 statement. The CLOAD statement transfers the program on the magnetic tape from the beginning of the program memory, whereas the CLOAD1 statement transfers the program following the program stored in the program memory. Note that the program is stored on magnetic tape.
It is assumed that a reproduced signal obtained from the S _OUT signal and reproduced from the magnetic tape is input to S _IN , and is converted into a desired signal through an interface between the tape recorder and the computer.

Figure 3 shows a flowchart of the CLOAD statement and CLOAD1 statement. OBTM is a pointer that indicates where the program is located in program memory.
PAD is a pointer indicating the program address, FLG
1 is a flag indicating whether it is a CLOAD1 statement or a CLOAD statement,
Er is an error flag, CA is a flag indicating to interrupt transfer, and ACC is a register that handles data.

Since this is a CLOAD statement, it clears the pointer PAD in the program memory of the transfer destination.

resets flag FLG1 indicating the CLOAD1 statement.

clears the PAD.

compares the pointer OBTM, which indicates how far the program is in program memory, with PAD (which is cleared). If they match, the data will be transferred from the beginning of the program memory, which is the same as the CLOAD statement, so proceed.

If they do not match, OBTM is transferred to PAD and PAD is incremented by 1 in order to transfer from the next address indicated by OBTM.

At this time, when the PAD exceeds the area of the program memory, it is no longer possible to transfer it to the program memory, so the process proceeds to error processing.

If PAD points to an address in program memory, set FLG1 to point to the CLOAD1 statement.

Reset the CA flag and error flag.

It receives the signal reproduced from the magnetic tape from S _IN , converts it into a parallel signal, and transfers it to ACC. Here, when an error occurs while reading the reproduced signal, the Er flag is set, and when the CA key is input, the CA flag is set.

If an error occurs during reading (Er = 1) or if the transfer is interrupted using the CA key (CA = 1), proceed to immediately to interrupt the transfer.

Determine whether the reproduced content indicates the end of the transfer. If not, transfer ACC to program memory and increment PAD by 1.

Then, it is determined whether the PAD exceeds the address of the program memory. When it exceeds, proceed to error handling. If not, return to obtain the next transfer content.

When ACC indicates the end of transfer, PAD is decremented by 1 and PAD is transferred to OBTM. By this,
You can see how far the program is included by referring to OBTM.

The computer then indicates that the transfer is complete and proceeds to the key 4 lead-in where it reads key 4 in order to receive a new command.

To set the OBTM that indicates how far the program is stored in the program memory when an error occurs or a command is given to interrupt the transfer, or when the PAD exceeds the address of the program memory. When FLG1 is set, CLOAD1 is determined.
Since the statement was being executed, the program that was entered before the transfer was valid, so OBTM was left as is, and when FLG1 was reset, the program needed to be cleared, so
Clear OBTM.

Here, whether an error occurred during the transfer or
The CA flag is checked to see if the transfer was interrupted, and if the CA flag is reset, an error occurred during the transfer, so proceed to error handling indicating that an error has occurred.

〓〓 When the CA flag is set, the CA
Proceed to processing.

FIG. 4 shows a flowchart of program editing. LINE is a register that stores the line number of the input program, and LINE' is a register that stores the line number of the program line obtained when searching for a program.

is the line number of the program to be inserted or deleted.
Store it in LINE, clear PAD, and compare PAD and OBTM to find out whether the program is already stored in the computer.

If the program is already stored,
Since PAD and OBTM do not match, the last address of the program stored in program memory is used to find the insertion position of the program to be inserted or the position of the program line to be deleted.
Transfer OBTM to PAD. This is because the search position starts from the final position.

Find the line number of the program line closest to the PAD toward the beginning of the program memory from the position indicated by the PAD, and select this.
Transfer to LINE′. And PAD shows this position. If, when finding a program line, PAD indicates the beginning address of program memory, the search position is the beginning of program memory, so proceed.

Compare the line numbers of the found program line and the program line to be inserted or deleted. If LINE<LINE′, the insertion/deletion position is earlier than the previous one, so go back.

If LINE=LINE′, to insert a new program line,
Delete already stored program lines and update OBTM.

Check whether the program to be inserted will fit in the program memory, and if it does not fit, proceed to error handling.

Since the program to be inserted fits within the program memory, the program is inserted at the program memory address indicated by PAD and OBTM is updated.
However, when the inserted program is a line number, nothing is done (this is an operation for deleting a program line).

After insertion/deletion, proceed to key lead-in to proceed to the next operation.

With this, when a plurality of programs are stored in the computer, it is possible to insert or delete the last program. What is possible for the last program means that after loading the program from the magnetic tape, it is possible to edit the program immediately after loading.

For example, as shown in Figure 5, if two programs are stored in the program memory,
When "15:'ABC'GOTO10" is added, it is inserted into the last program as shown in Figure 6.

Next, jumps in program execution will be explained. FIG. 7 shows a flowchart of the jump command GOTO statement. PAD′ is the auxiliary register of PAD,
LINE” is a register that stores the line number of the program line during program execution.
LABEL is a register that stores the label specified by the GOTO statement, and LABEL' is a register that stores the label of the program line.

transfers the program address PAD being executed to PAD′ to indicate where the error occurred, in order to generate an error when there is no jump destination.
When an error occurs, the position indicated by PAD' is the error position.

Determine whether the jump specification in the GOTO statement is a label. When specifying a label, use '' as in ``20GOTO'ABC''' in Figure 6.

Transfers the jump destination label to LABEL, and clears PAD to search for a program line with the same label as this label from the beginning of program memory.

The program line label is placed next to the line number with ', like ``15'ABC'GOTO10'' in Figure 6. From the position indicated by PAD
Look for labels in the direction of OBTM. If the label is not found, there is no place to jump to, so proceed. If a label is found, use the label
LABEL′ and its position to PAD.

Then, it is determined whether this LABEL' is a specified label or not, and if they match, the program proceeds to execute the instruction from the program line having this label. If there is no match, go back to continue finding the label.

When the jump designation is not a label, it is determined whether the designation is a line number. If it is not a line number, proceed to .

Transfer the jump destination line number to LINE, determine whether the jump destination is before or after the currently executing line, and if the jump destination is after the currently executing line, select the line number that is closest to the OBTM direction from the PAD. Line number of the nearest program line
Transfer to LINE′ and move PAD to this position.
If there is no program after PAD, proceed to .

The obtained program line number LINE′ and
Compare the LINEs, and if LINE is greater than LINE′, the jump destination is further back, so return to the previous step. If LINE is not greater than LINE′, proceed to .

Determine whether LINE and LINE' are equal. If they are equal, this program line is the jump destination, so proceed to move the execution to this line; if they are not equal, there is no specified jump destination, so proceed.

If LINE is not larger than LINE'', the jump destination is before the execution line that includes the line that is being executed, so search for the line number of the nearest program line in the opposite direction from the beginning of the program from the position indicated by PAD. , put this on LINE
and move the PAD to this position at the same time. if,
If there is no program line in the head direction from PAD, proceed to .

Compare LINE and LINE′, and if LINE is smaller than LINE′, the jump destination is further forward, so return to the previous point. If LINE is not smaller than LINE′, proceed to .

An example of the above jump is shown in FIG.

Next, we will discuss how to run the program. Figure 8 shows a flowchart of the RUN statement that runs the program.

clears PAD and compares PAD and OBTM to determine whether the program is stored in the computer. P.A.D.
When and OBTM are equal, the program has not been memorized, so it immediately proceeds and waits for the next command.

After RUN, there is no specified start line,
When it is ENTER, execution starts from the beginning of the program, so it is determined whether ENTER occurs after RUN. When you press ENTER, proceed to .

If it is not ENTER, determine whether the start specification is a label.

If there is no label, transfer the label to LABEL, move from the position indicated by PAD in the direction of OBTM, search for a program line with a label, and if found, move the label to LABEL' and move that position to PAD. If it is not found, there is no jump destination, so proceed.

The obtained LABEL' and LABEL are compared, and if they match, proceed to start execution from that line, and if they do not match, return to find the next label.

If the specified start is not a label, it is determined whether the specified start is a line number. If there is no line number, proceed to .

Move the specified line number to LINE, move from the position indicated by PAD in the direction of OBTM, find the line number of the nearest program line, move it to LINE, and move PAD to this position. If the line number of the program line is not found after PAD, there is no place to jump to, so proceed.

Compare LINE and LINE′, and if LINE is greater than LINE′, the program line to start execution is at the back of the line, so return to LINE′.

Determine whether LINE and LINE′ are equal or not. If they are equal, proceed to start execution from this line; if they are not equal, proceed to the specified line because there is no such line.

As a result, if there are multiple programs on the computer, you can start execution from any line by labeling the lines of the program, and if you specify a line number, the first program with the same line number. Execution will start from the line with the line number.

As described above, according to the present invention, in a computer that processes programs between a first program and a second program added thereto, Jumps between lines are performed using label names, and jumps due to line number specifications are performed within the running program, so the same line number as the line number specified in one program exists in another program. For example, when you want to use some programs that have already been stored in a peripheral device in your computer, you can transfer the program from the peripheral device to the program that has already been stored. If you do it like this,
You can select only the programs you need, transfer them to your computer, and run them. Also, if you want to jump to another program in mutually related programs, you can jump by label name, and when jumping within that program, you can do it by line number, so that multiple unrelated programs can be processed individually on each computer. The second program added at that time may use the same line number as the first program, which has the advantage of making the program easier to create.

[Brief explanation of drawings]

Figure 1 is a block diagram showing the configuration of the computer, Figure 2 is a block diagram showing the configuration of the computer.
The figure is a block diagram of a part of the CPU, and the third figure is CLOAD.
Flowchart of the statement and CLOAD1 statement, Figure 4 is a flowchart of program editing, Figure 5 is an explanatory diagram of the program stored in the program memory, and Figure 6 is an explanatory diagram of the program after editing the program in Figure 5. , Figure 7 is a flowchart of the GOTO statement, and Figure 8 is a flowchart of the RUN statement. 1...CPU, 2...ROM, 3...RAM, 4
...Key, 5...Display memory and buffer, 6...
...Display body, 7...Instruction decoder, 8...Instruction register, 10...Register and flag.

Claims (1)

[Scope of Claims] 1. A computer with a program editing function, such as a program electronic desktop calculator or a personal computer, capable of executing a first program and a second program added to the first program, A computer with a program editing function characterized in that a jump between a second program and a second program is specified by a label name, and a jump within the same program being executed is specified by a line number.