JPS58191057A - Miniature electronic computer with program - Google Patents

Abstract

PURPOSE:To realize the effective use of a small memory region, by making the same memory region possible to designate by plurally arrayed names. CONSTITUTION:A display driver 3 is connected to a CPU2 via a bus line, and a display 4 which performs a dot display by means of a liquid crystal is connected to the driver 3. The driver 3 feeds a liquid crystal driving signal to the display 4 in response to the display data given from a CPU2. Furthermore an array code generator 5, subtractor register 6. A code generator 7, array memory 8 and a program memory 9 are connected to the CPU2. The generator 5 produces the array name codes in accordance with the array data fed from the CPU2.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a small Hiroko computer with a program that allows the same memory area to be specified by an array name of kk. Conventionally, the memory array area of a small M electronic 1tch with a program was Taking a one-dimensional array based on word candy as an example, A(0) ~ A(n), B(0) ~ BCm, -.
...Those that have multiple areas for each array name, such as Z(o) to 2(b), or those that have only one array area, such as A(o) to A(n). There is. Now, for example, if you want to aggregate data for each plotter or aggregate the entire data, in the former case, input data for each block in correspondence with each array name from A to Z, and then enter the aggregate value for each array. By calculating , you can easily obtain the total for each block ◎Moreover, when performing the overall total, you must calculate the total value for each array in advance and then calculate the total of these. As a result, there was a drawback that the number of steps in the putagram increased. In addition, when the number of data in a block is unlimited, there is a drawback that there is a large amount of unused area within the memory area of each array, and the area is left as a waste area. On the other hand, in the latter case, for example, mu(0
) ~ M (4), M (5) ~ A (9)... Divide the memory area into multiple parts, input data for each block into each divided area, and then Data aggregation is easily calculated by calculating the sum of %A(o) to m(n), but when specifying each divided area, each variable in the array is It is necessary to take this into account when creating a program, which has the disadvantage of making the program complicated. In addition, only specific array names such as ``mu'' can be used, and it is not possible to understand the data contents of each block by the array name during preprogramming.

This invention was made against the background of the above-mentioned circumstances, and its purpose is to make it possible to specify the same memory area with multiple array names, thereby effectively using a small memory area, and to allow array specification to be performed using any array name. The object of the present invention is to provide a small electronic computer with a preprogram that allows the user to perform the following tasks.

Hereinafter, the present invention will be specifically described based on an embodiment shown in the drawings. FIG. 1 is a block diagram showing the main parts of a small electronic computer equipped with a program calculation function using the BAS engineering language. In the figure, 1 is the number key on the keyboard,
It is equipped with various function keys. According to the key sampling signal output from the keyboard 1 and the CPU (center 2), a key operation signal corresponding to the operation key is input from the keyboard 1 to 0PU2.
A display driver 3 is connected to the display driver 3 via a pass line, and a display device that displays dots using liquid crystal is also connected to the display driver 3. Display driver 3 is 0PU2
A liquid crystal drive signal is sent to the display device 4 according to display data sent from the display device 4. Furthermore, in 0PU2,
An array name code generator 5, an argument register 6, a mu code generator 7, an array memory 8, and a program memory 9 are connected, respectively. Array name code generator 5 is Q P U 2
Generates and outputs an array name code according to the array data sent from the server. In this case, the above array data is data in which the array names of A to 2 are appended with this argument, such as Mu(5) and Z(o), and the array name code generator 5 is input. Numerical codes "1" to (313) corresponding to the array names "Mu" to rZJ are generated based on the above array name data, read out in synchronization with the timing signal t1 input from 0PU2, and supplied to the subtracter 10. Furthermore, the !1% register 6 temporarily stores the argument of the input array data, and supplies its contents to the adder 11 in synchronization with the timing signal 1 input from the optr 2. Furthermore, the A code generator 7 is a device that permanently generates and outputs the numerical code "1" corresponding to the array name "MU", and 0PU2 is also arrayed in synchronization with the sent timing signal t. The numeric value ``1'' of the name ``mu'' is supplied to the subtracter IO.The subtracter 10 subtracts both input numeric codes and outputs the subtraction result to the adder 11.

The adder 11 adds the input two-value codes and outputs the addition result to the address pointer 12, from which the address data of the array 8 is sent.

As shown in FIG. 2 (4), the array map 8 has a configuration having 26 address areas corresponding to the array names of M~2, and each address area has addresses "O" to "25". , and data is sent and received between the specified address area and 0PU2.

The program memory 9 stores the knee program, and the knee program is sent to the 0Ptlr2 and executed.

Next, the operation of the above-mentioned embodiment will be explained, taking as an example a case where the program memory 9 stores a program that performs the following processing. In this example, 15 students are divided into groups of 5, and each group is given a test in a different subject, for example, Japanese, mathematics, and physics. It performs aggregation, and each student is assigned a letter from M to 0, A-1 is Japanese, E"": r is Mathematics, and K to O.
It is assumed that you have answered the physics test. If the test scores of all students are to be entered, the program shown below can be used.

10 D Engineering M Mu (25) 20 'VORX=OTo 14 30 Engineering NPUT Y 40 A (3) = Y! When the 10th statement is executed in the program of 50 111xr x 60 1ND, the array memory 8 is
is A(0) to Mu(i->” represented by the array name “mu”)
)'s -dimensional array table is secured.Next, when the 20th to 50th disclaimers are executed, "0" is first assigned to the variable name X, and the value of X is incremented by one. Steps 30 and 40 are repeated until the value of The address area table (where the person's score is
0) to 'Mu 4p. That is, first, C
According to the array data “Aco)J” output from PU2,
From the array name code generator 5, the numerical value ' code Fr1J, and
The numerical value code "0" is set to [7] from the argument register 6, respectively. As a result, each of the vfm codes input to the subtracter 10 becomes "1", so the operation result becomes "0", and the output of the adder 11 becomes "0", so the pointer 12 outputs address data "0" and specifies the Ov location of the array memory 8, that is, the address area table 0 of the variable A. Next, OP u Z tp & array f-ta r A
co) J rAti4) 2J When the number is applied sequentially, the output of the subtracter 10 remains constant and outputs "0" (b), so the result of the operation in the adder 11 is the one in the argument register 6. The value corresponds to the output, and the pointer 12 sequentially outputs address data "1" to "14". As a result, addresses 1#r to 14 of the array memory 8, that is, variables B to 0
Address areas A1 to M1. is specified. In this way, each address area is sequentially specified, so that the scores of each person input sequentially from the keyboard 1 are stored in the corresponding address area.

In this case, the variable A-1 is the Japanese language score, 1 to J are the math scores, and I to 0 are the #J salt scores.

Therefore, if you want to calculate the total score for each subject of Japanese language, mathematics, and physics and the total score of the whole based on the data written to the array memory 8 as described above, and output it, please do the following. This can be done with a pre-dullam as shown.

10 Q=o:R=o:8=o:U-.

20 FORP=o TO4 30Q-Q+A(P) 40 R-R+F (P) so It-8+K (P) 60 NEXT P 70 FORT=o To 1480 U-U
+A(T) 90 NEXT T 100 PRINT”KOKUGO=’;Qllo
PRINT″8UGAKU=” 1R120PRIN
T″door UTURI=";5130 PRINT"Z]
1CNTAI=";U14G END In this program, when the statement number 10' is executed, "
Then, when statements 20 to 60 are executed, the value of "0" is assigned to the variable P, and the initialization process is performed.・
Increase by 1 until the value of P reaches "4" by 30
Statements 50 through 50 are repeated, and Q is asked to tally up Japanese language scores, R is asked to tally up math scores, and S is asked to tally up physics scores. In other words, when the value of P increases from "0" to "4" during the execution of statement No. 30, the array data "MU(IIIJ~"MU(4)
" is output. Therefore, as in the case described above, since "0" is fixedly output from the subtracter 10, the output of the adder 11 varies from "0" to "0" depending on the output of the argument register 6.
4, and addresses 0 to 4 of the array memory 8 are sequentially addressed. As a result, variables M to E are read out and totaled, respectively, so that variable 4 becomes the total Japanese score. Also, in executing statement number 40,
As the value of P increases from "0" to "4", the CPU 2 outputs array data "F", ... "F(4-") sequentially. Therefore, the array name code generator 5 outputs the array data NamerFJ
Since the numerical code "6" corresponding to is output, the subtracter 10 constantly outputs the numerical code "5". Then, the adder 11 outputs the output rOJyr4 of the argument register 6.
Add "5" to J, and as a result, the output of the pointer 12 becomes "5" to "9". Therefore, addresses 5 to 9 of array page 8 are sequentially addressed, variables F to J are read, and each one is totaled, so that the variable &R becomes a math score total. Furthermore, in the execution of statement number 150, as the value of P increases from "0" to "4",
CPU2 may be array data “K(ol” ~ rK (4)J
are output sequentially. Therefore, since the array name code generator 5 outputs the numerical code "11" corresponding to the array name rKJ, the subtracter 10 outputs the numerical suit "10" in an identifying manner.

And 1 addition story 11 is the output rOJ of argument register 6 ~ "
As a result, the output of the pointer 12 becomes "10" to "14". Therefore, addresses 10 to 14 of the array memory 8 are sequentially addressed and 0 is read to the variable. Therefore, when the next steps 70 to 90 are executed, the variable T is first
While substituting rOJ into and increasing the value of T by one,
Statement F of number 80 is repeated until the value of becomes "14". As a result, addresses O to 14 of the array memory 8 are addressed, variables M to 0 are read out, and each is totaled, so that the variable U becomes the total score of the whole. Next, when statements 100 to 130 are executed, KOKUGO.

! 1lUGAKU, BUTUBI, zEN DINGMU! The character data and the corresponding calculation results, that is, the Japanese score tally 91, the math score tally 8, the physics score tally 8, and the overall score tally are respectively sent to the display device 4 and displayed.

According to the small computer with a program configured in this manner, when the address area of the array memory 8 is designated by an arbitrary array name, the address area Jj1 corresponding to the array name is specified.
．． Since the configuration is such that the - area is used as the address area of the specified array name, the same address area of the array memory 8 can be specified by the array name of the arbiter.

In other words, FIG. 2 (m) shows the structure of a one-dimensional array table specified by the array name rAJ, and 0 to flit
The location is associated with the address area table (1>~mu0.), and the corresponding variable mu~2 is stored. Also, the second
Figure (B) shows the configuration of a one-dimensional array diple designated by the array name rFJ, where addresses 5 to 2s are associated with address areas F(・) to r(!・), and the corresponding The change liF~2 is stored. Furthermore, FIG. 2(C) shows
This shows the configuration of a one-dimensional array table specified by the array name rKJ. Addresses 1011 to 2s are associated with 4・) to K(□・) in the address area, and the corresponding variable @ is -.
Z is memorized. In this way, the same address area of the array memory 8 is, for example, X mim. . ) mini F < s Since array names can be arbitrarily associated, it is possible to use array names that can be associated with the contents of variables. In the above example, the total tally is calculated by the array memory 8.
It can be obtained by aggregating the address specification area A (@) ~ A (14), which reduces the number of steps in the program compared to the conventional method of aggregating each block and then aggregating the whole using U = Q + B + 8. This is especially effective when there are many groups. Also, for example, you can reduce arguments that would otherwise take two digits, such as MU(,0)MIU(11), to one digit, so use an array name that reduces the number of arguments for the array. Therefore, memory can be used effectively. Further, when the array memory 8 is expanded by attaching another memory package to two or less of the array memory 8, an identity such as '5A(tt)3FQt)' can be used for the expanded portion as well.

Note that in the above example, a one-dimensional array was explained, but for example, an n-dimensional (
31'; z 2), it is of course applicable to the arrangement without departing from the gist of the present invention. According to the compact electronic computer, since the same memory area can be specified by an am array name, a small memory area can be used effectively and one array can be specified by any array name.

[Brief explanation of drawings]

The drawings show an embodiment of the present invention;
FIGS. 3A and 4B are diagrams illustrating the configuration of a one-dimensional array table specified by the array operator F s K. FIGS. 2---CPU,! ”'...Array name code generator,
6...Argument register, 7...-Mucode occurrence-18...-Array message, 9...-6-791 date memory, 10...-Subtractor, 11・・・・・・
Adder, 12"...pointer. Patent applicant: Casio Computer Co., Ltd. No. 2 (A) CB) (C) j"-'-"------I in column V

Claims (1)

[Claims] An array memory that has an address area of the number of poles corresponding to a preset array name, and when the address area of this array memory is specified with an arbitrary array name, calculates the address of the area corresponding to that array name. and addressing means for setting an area after the calculated address in each address area of the array memory as an address area of the designated array person, A small electronic TI calculator with a program that allows you to specify it by name.