JPS62144226A - Input system using reserved word for tabulation processing - Google Patents

Abstract

PURPOSE:To reduce the load of an operator by using the reserved words for tabulation with a simple language for tabulation processing and therefore omitting the time needed for the second input of the same data or the individual investigation of the file names, the date and time, etc. CONSTITUTION:A character string supplied from an input means 10 with operations of character keys is supplied to an input buffer 121 and also displayed on a CRT 28. Here a control key CR is operated to retrieve the input character string via a reserved word table memory means 16. When the coincidence is obtained from said retrieval of the character string, the reserved words are converted into data based on the relevant address and the character length. This data is displayed on the CRT 28. If no coincidence is obtained the characters are shifted one by one to secure the coincidence with these reserved words. In case no coincidence is obtained finally, the next reserved word is read out and processed following the same procedure.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to an input method using reserved words in table creation processing in a table creation processing simple language.

[Prior art and problems to be solved by the invention] Conventionally, in information type computers such as personal computers,
A simplified table creation language is used for creating tables.

In such a simple language for table creation processing, when inputting file name 1 date 2 time etc. into a table as data, for example, the file name 9 date at that time.

It was necessary to check and input the time, etc. Furthermore, in the case of a kanji file name, it was necessary to input the kanji again.

The present invention has been made in view of the above points, and it is possible to input the same data again or to input the file name with two dates.

To provide an input method using reserved words in table creation processing, which eliminates the trouble of individually checking the time, etc., thereby reducing the burden on an operator, and improving input efficiency. The purpose is to

(Means for Solving the Problems) In order to achieve the above objects, the present invention inputs a character string including a reserved word using an input means, and stores the input character string in a character string storage means. and a reservation that stores at least the address of the character string that is the target of the reserved word, which is stored in the conversion data storage means that stores the character string that is the target of the reserved word, in correspondence with the reserved word. From the word table storage means, the address of the conversion data storage means corresponding to the reserved word in the character string stored in the character string storage means read by the reading means is searched by the search means, and the address of the searched It is characterized in that the reserved word stored in the character string storage means is rewritten into the character string of the address of the conversion data storage means by a ternary conversion means.

[Effect]

That is, the reserved word in the stored character string is read from the character string storage means that stores the inputted character string including the reserved word, and the address of the conversion data storage means corresponding to the read reservation 3R is read out. The reserved word table storage means is searched and the stored reserved word is rewritten to the character string of the searched address.

(Example) An embodiment of the present invention will be described below with reference to the drawings.

FIG. 1 shows its configuration, where 10 is an input means equipped with numeric and character keys for inputting character strings including reserved words, and a control (rcRJ) key;
is a character string storage means for storing the input character string. Reference numeral 14 denotes a conversion data storage means that stores character strings to be reserved words, and 16 designates at least the addresses of the character strings to be reserved words stored in the conversion data storage means 14 as reserved words. This is a reserved word table storage means that stores the reserved words in a corresponding manner. Reference numeral 18 denotes a reading means for reading a reserved word in the character string stored in the character string storage means 12, and 20 indicates an address of the conversion data storage means 14 corresponding to the read reserved word. It is a search means for searching from the table storage means 16, and 22
is a rewriting means for rewriting the reserved word stored in the character string storage means 12 to the character string of the searched address of the converted data storage means 14. 24 is a display memory that stores display character strings, and the data in this display memory 24 is converted into dots via a display driver 26 and then transferred to a CRT.
28. These display means are controlled by a display control means (not shown).

The character string storage means 12 is composed of an input buffer 121 and a table data memory 122. The manual buffer 121 is for storing characters input from the input means 10. The tabular data memory 122 is used to transfer and store the converted character string from the input buffer 121.

The reserved word table storage means 16 stores a reserved word (Y), an address (A) of a character string to which the reserved word stored in the conversion data storage means 14 is converted, and its character length (
L) is stored correspondingly.

Here, reserved words include, for example, binder name, page name, 2nd date, 3rd time, etc., and data input and annotation input by using the following symbols.

It enables use in calculation formulas. That is, &B・
...The binder name is input.

&P...Page name is input.

&D...Date is input.

&T...Time is input.

However, the above date &D and time &T change every moment in the system. Furthermore, the binder name, page name 2 date 1 time inputted using reserved words are those at the time of input and calculation execution. Therefore, when changing the binder name, etc., it is necessary to perform calculations or input data again.

FIGS. 2 and 3 are for explaining the operation, respectively, with (a) showing an example of the operation, and (b) showing an example of the display at that time. That is, (1) If you operate the character keys from the input means 10 and input "Showa &D" as shown in FIG. ), this character is input to the manual buffer 121, read out from the manual buffer 121, and displayed on the CRT 28 as shown in FIG.

(2) Here, as shown in FIG. 2(a), when the control key (FCRJ) of the input means 10 is operated, the reserved word table storage means 16 is searched for the input character string and a matching string is searched. In this case, the reserved word is converted into data according to the address and character length, and "It is 1986-10-25" is displayed as shown in FIG.

Further, FIG. 3 shows the case of a binder name. That is, (1) operate the character keys from the input means 10,
As shown in FIG. 3(a), when "&B" is input, this character is input into the manual buffer 121, and
The data is read from the manual buffer 121 and the CRT 2
8 as shown in FIG. 8(b).

(2) Here, as shown in FIG. 3(a), when the control key (CRj) of the input means 10 is operated, the input character string is retrieved from the reserved word table storage means 16. If there is a match, the reserved word is converted into data based on the address and character length, and is displayed as "Information Equipment Comparison" as shown in FIG. 4(b).

The above operation will be roughly explained in detail below with reference to the flow chart of FIG. That is, when the fcRJ key is operated after a reserved word is input, the counter (hereinafter referred to as reserved word counter) in the reserved word table storage means 16 is first cleared (step 5T401). If the reserved word counter does not indicate the end (step 5T402>), the reserved word for two characters from the reserved word table memory 16 (for example, in the example of FIG. 2 above, first read [&BJ). Then, the reserved word counter is counted up (Step 5T404), and the search counter is roughly cleared (Step 5T405).

If the search counter does not indicate completion (step 5T406), the search counter reads two characters from the human buffer 7121 (step 5T407). For example, in the example shown in FIG. 2 above, first the two characters "Showa" are read out. After counting up the search counter (step 5T408, above step 5T403)
Reservation 9 (&B) read in and step 5T407 above
The two characters read out ("Showa") are matched (step 5T409).

If they do not match, repeat from step 5T406 above.
Read the next two characters ("sum &") and find a match. In this manner, by counting up the search counter, two characters are sequentially shifted by one character and read out to match the reserved word.

Here, if there is no match even if the search counter indicates the end, the process returns to step 5T402 and the next reservation 8
Read L (r&DJ in the case of FIG. 2). Then, in the same manner as above, a match is made with the two characters read out by the search counter.

If they match, the address (A) and character length (L) of the reserved word stored in the reserved word table storage means 16 are
The data stored in the converted data storage means 14 is retrieved (step 5T410). After storing the retrieved data in the manual buffer 121 (step 5T411), step 5T406
Return to

After converting all reserved words in this way,
That is, if the reserved word counter indicates the end in step 5T402, they are displayed (step 5T412).
).

〔Effect of the invention〕

As detailed above, according to the present invention, by inputting the reservation 5M, it is possible to eliminate the need to input the same data again or to individually check the file name, date, time, etc., thereby reducing the burden on the operator. It is possible to provide an input method using reserved words in table creation processing, which makes it possible to improve input efficiency.

[Brief explanation of drawings]

FIG. 1 is a diagram showing the configuration of an input method using reserved words in table creation processing according to an embodiment of the present invention, FIG. 2(a),
(b) and Figures 3 (a) and (b) are for explaining the operation, respectively. <8) in each figure is an operation example, (
b) is a diagram showing an example of the display at that time, and FIG. 4 is a flow chart for explaining the operation. 10... Input means, 12... Character string storage means, 1
4... Conversion data storage means, 16... Reserved word table storage means, 18... Reading means, 20... Searching means, 22... Rewriting means, 24... Display memory, 26...・Display driver, 28...CRT1
121...Input buffer, 122...Table data
memory. Applicant's agent Patent attorney Takehiko Suzue (1)
&BJ Ward [ ] " (a) Figure 3 (b)

Claims (1)

[Claims] an input means for inputting a character string including a reserved word; a character string storage means for storing the input character string;
A conversion data storage means storing a character string to be a reserved word, and at least an address of a character string to be a reserved word stored in the conversion data storage means in association with the reserved word. reserved word table storage means;
A reading means for reading a reserved word in a character string stored in the character string storing means and an address of the conversion data storing means corresponding to the read reserved word are searched from the reserved word table storing means. and a rewriting means for rewriting the reserved word stored in the character string storage means into the character string of the searched address of the conversion data storage means. An input method using reserved words in table creation processing.