JPH023212B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a character processing device that inputs character data and converts it into other character data.

[Conventional technology]

Conventionally, when inputting and displaying character data, the typed character was displayed at the cursor position, the cursor was moved one digit, and that position was indicated as the display position of the next character to be input. , there is one that waits for the next character to be input.

[Problem that the invention seeks to solve]

However, in this case, even if the next character to be input and the characters that have already been input are converted to other characters, and the number of characters to be displayed changes, the cursor position does not change, so the conversion is not done. There was a problem in that the display position of a newly input character may not be continuous with the display position of a newly input character.

[Means for solving problems]

In order to solve this problem, the present invention includes a cursor control means for moving the cursor according to the number of characters when the input characters are converted and the number of characters changes.

〔Example〕

FIG. 1 is a block diagram showing an embodiment of a character processing device according to the present invention.

The KB is a keyboard consisting of a group of character keys for inputting text and a group of function keys for realizing various functions of this device.

Figure 6 shows the keyboard KB in more detail. The arrangement of the character keys is a slightly modified version of the so-called JIS keyboard. The main change is the configuration of the shift key. i.e. keyboard
In KB, a hiragana shift key and a hiragana small shift key have been added to enable hiragana input.

The function keys include DECIMAL, full-width keys, half-width keys, Roman keys, and kana keys. Of these, the Romaji key and Kana key are keys that determine the input mode for inputting characters from the character keys of the keyboard KB, and when you press the Romaji key, you can input the main language sentence in the Romaji reading. Also, by pressing the Kana key, it becomes possible to input Japanese sentences in Kana.

The DECIMAL key is a key that instructs digital tab input, the full-width key is a key that instructs input of normal-sized characters, and the half-width key is a key that instructs input of characters that are half the normal size (horizontal direction). (only certain characters such as numbers).

One of the character keys and function keys
When a key is pressed, an interrupt is sent to the microprocessor CPU (described later) through a control bus CB (described later). Also, keyboard
The code of the key pressed through the encoder provided in the KB can be known through the data bus DB described later.

Note that the key code output from the encoder does not directly correspond to a character code, but is a code for identifying each key.

Interrupts given from the keyboard KB to the microprocessor CPU are
Can be masked by CDU. However, CPU
Even if the keyboard KB interrupt is masked by the microprocessor CPU, if the keyboard KB interrupt is unmasked by the microprocessor CPU, the KB interrupt that occurred while it was masked will not be lost, and the operation of the KB interrupt will not be lost. shall function normally.

KB BUFFER is a buffer for converting input data entered from the keyboard KB into character codes and buffering them.

When a key on the keyboard KB is pressed, the keyboard KB input processing routine is activated, and the input data from the keyboard KB is transferred to the keyboard KB.
Stored in BUFFER.

Further, data such as characters stored in the buffer KB and BUFFER are read out and used by various processing routines that require input data from the keyboard KB, such as input processing routines and editing processing routines. Since these processing routines are not directly related to the present invention, detailed explanation thereof will be omitted.

Details of the KB BUFFER are shown in Figure 2. It has a total capacity of 21W (W: Ward, 1W-16bit). A specific definition of each W is shown below.

WORD 0 All DATA stored in KB BUFFER LENGTH WORD 1 All DATA stored in KB BUFFER for which internal and handakuten processing has been completed.
LENGTH WORD 2 LENGTH WORD of the data for which Romaji-kana conversion has been completed among all the data stored in KB BUFFER 3 LENGTH of the data for which half-width processing has been completed for all the data stored in KB BUFFER WORD 4 KB LENGTH of DATA for which DECIMAL processing has been completed among all DATA stored in BUFFER WORD 5 to 20 Area where data input from KB is stored First 5W is stored in buffer KB BUFFER Characteristics of the data are filled in. Actual input data is stored after the 6th W.

WORD0 of Batsuhua KB BUFFER (1st W of tsubo)
is stored in KB BUFFER.
The LENGTH of the data is entered. However, these data have not yet become data that can be immediately processed by the various processing routines described above. For example, assume that the character data "ka" is input from the keyboard KB. However, this data "ka" changes depending on the next key pressed. That is, next “″” (voiced point)
When a key is pressed, the data changes to "ka", and when any other key is pressed, it is confirmed that the data is "ka".

Also, for example, when inputting in the Roman alphabet mode, the first keystroke, such as "Y", is not confirmed as data, and is not confirmed until the next keystroke, for example, "A". It's going to be a "ya" day.

Also, for example, when performing half-width input, the first key press, such as "1", is not confirmed as data yet, but the next keystroke, for example, "2", is the first confirmed "12". It becomes data. This is because this embodiment employs a processing method in which half characters are always handled in units of two characters.

For example, when inputting using a decimal tab, the input character string is secured as valid only after a character that ends the decimal tab is input.

In this way BUFFER KB BUFFER WORD
The data specified by DATA LENGTH stored in 0 is not necessarily all valid data.

Therefore, in order to clarify the characteristics of the data stored in BUFFER,
5W of the HEADER part of BUFFER is used.

WORD0 of Batsuhua KB BUFFER LENGTH of all data stored in Batsuhua KB BUFFER WORD1 of Batsuhua KB BUFFER LENGTH of data that has been processed for internal and handakuten of all data stored in Batsuhua KB BUFFER WORD2 Batsuhua KB BUFFER LENGTH KB BUFFER WORD3 All data stored in KB BUFFER has been processed with internal dakuten, handakuten, and romaji kana conversion. LENGTH KB BUFFER WORD4 of the data that has been processed and half-width processing Data that has been subjected to inner-dakuten and handakuten processing, -maji-kana conversion processing, half-width processing, and decimal processing of all data stored in the buffer KB BUFFER LENGTH. Batsuhua
Of the data stored in the KB BUFFER, the length of data given by WORD4 of the KB BUFFER is truly valid data.

In this embodiment, part of the voiced mark processing, romaji kana conversion processing, half width processing, decimal processing, etc. is executed in the keyboard KB input processing routine described later, and the results are stored in the buffer KB BUFFER and input from the keyboard KB. Various processing routines that require input data are configured to utilize data resulting from execution of the four types of processing described above. Therefore, other embodiments may be adopted, for example, in which half-width processing is excluded from the KB processing routine, and various processing routines that require input data from the keyboard KB perform half-width processing. The same can be said of the four types of processing described above. The gist of the present invention will not be compromised if at least one of the four types of processing is executed in the KB input processing routine.

The structure of the data stored in WORDs 5 to 20 of the KB BUFFER is as shown in Figure 5.

bit 0 Half-width = 1, full-width = 0 bit 1 to 7 JIS CODE 1st BYTH bit 8 In REFRESH MEMORY, low brightness display = 1, normal brightness display = 0 In KB BUFFER, characters making up the Roman alphabet =
1. Independent character = 0 NOT USED bit in DATA BUFFER, KB READ BUFFER 9 to 15 JIS CODE 2nd BYTE <Note> Full-width: JIS CODE 2nd YTE and JIS CODE 2BTE
to express JIS Kanji code (14bit). It is assumed that the FUNCTION code is also assigned an empty area in the JIS Kanji code table.

Half-width: JIS CODE 1st BYTE and JIS
JIS code (7bit) with CODE2BYTE
Two characters are expressed.

In other words, 1W represents one wide character (normal size character) or two half-width characters. bit 0
to distinguish between half-width and full-width characters. For full width
Bits 1 to 7 are the 1st BYTE of JIS Kanji code, bit 9
The 2nd BYTE of JIS Kanji code is stored in ~15.
For half-width, bit 1-7 is 1 character of 7bit JIS CODE
One other character is assigned to bits 9-15.

Bit 8 becomes 1 to identify when the code is a component of the Roman alphabet, such as "T" (a component of the Roman alphabet "TA").

The KB READ BUFFER is a buffer used when various processing routines that require input data from the keyboard KB request the data, and has a capacity of 21W (1W-16bit).
The various processing routines are available in Batsufua KB READ
Required for WORD0 (1st W) of BUFFER
Set the DATA LENGTH and use the KB described below.
BUFFER READ processing routine or KB
If you start the BUFFER LOOK processing routine, you can obtain the requested data in WORD5-20 of KB READ BUFFER. At that time, Batsuhua
Actually in WORD1 of KB READ BUFFER
DATA LENGTH written in WORD5~20
Filled out. In reality, the KB BUFFER READ processing routine and the KB BUFFER LOOK processing routine move the valid data (defined by KB BUFFER WORD4) stored in the buffer KB BUFFER to the buffer KB READ BUFFER.

Figure 4 shows the format of KB READ BUFFER.

In the same figure, WORD 0 READ or LOOK request
DATA LENGTH WORD 1 Actual READ or LOOK
DATA LENGTH WORD 2~4 NOT USED WORD 5~20 READ or LOOK data Please note that the KB READ BUFFER
The format of data stored in WORD5-20 differs from the format of data stored in WORD5-20 of the KB BUFFER only in the following points. That is, bit 8 is not used.

CRT REFRESH MEMORY is 8x memory
It has a quantity of 16W (1W−16bit).

Memory CRT REFRESH MEMORY Stored characters and other codes are stored in the CRT controller (described later).
It is patterned by CRT CONT and displayed on the CRT screen.

The format of the memory CRT REFRESH MEMORY consists of 8 lines and 16 digits as shown in Figure 3, the 1st to 7th lines are areas for displaying various character processing, and the 8th line is an area for displaying the KB BUFFER monitor. . This memory can store a character code of 8 lines vertically and 16 digits horizontally in correspondence with a CRT screen to be described later. The format of data stored in memory CRT REFRESH MEMORY is buffer KB.
The only difference from the format of data stored in BUFFER is the following points. That is, bit 8=1
When bit 8 = 0, it is displayed on the CRT with low brightness, and when bit 8 = 0, it is displayed on the CRT with normal brightness. This control is performed by the CRT controller CRT CONT.

Also, the 8th line of CRT REFRESH EMORY is
This is an area for displaying the contents of the buffer KB NUFFER, and the first to seventh lines are areas used by various processing routines. In this embodiment, the handling of the display from the first line to the seventh line is omitted because it has no direct relation to the present invention.

CRT CONT is memory CRT REFRESH
This is a CRT controller that controls the patterning of character code information stored in MEMORY and displaying it on the CRT screen. Figure 10 shows a detailed diagram of the CRT controller CRT CONT. The area surrounded by the dashed line in Figure 10 is the CRT
CONT. Control circuit CRT is memory CRT
Give the address of the character code to be displayed to REFRESH MEMORY and extract the character code.
The retrieved character code information is stored in the temporary storage register REG, and then transferred to the full-width character generator CG and the half-width character generator CG.
, access half-width character generator CG. The full-width character generator CG includes
Full-width character patterns are stored. Bits 1 to 7 of the output data from the temporary storage register REG and
Bits 9 to 15 specify the character and control circuit
The character is specified by the ROW address signal from the CRTC.
A ROW address is specified, and a horizontal row pattern of the corresponding ROW of the corresponding character is output.

Half-width character patterns are stored in the half-width character generator CG. Bits 1 to 7 and bits 9 to 15 of the temporary storage register REG are respectively input to the half-width character generator CG, and the horizontal line pattern of each corresponding character pattern is stored in the same way as the full-width character generator CG. Output. Full width character generator CG
Output data from and half-width character generator
Use the selector to select the output data from CG.
It will be held in SL.

The selector SL is controlled by bit 0 of the output of the temporary storage register REG. That is, bit
When 0=1, half-width character generator CG,
When bit 0=0, select the output data from the full width character generator CG. The data output from the selected selector SL is converted into serial data via the parallel-to-serial converter PS, and is output to the display device CRT. Data bit 8 output from the temporary storage register REG is output to the display device CRT in order to perform brightness control on the display device CRT.

The control circuit CRTC receives vertical timing signals and horizontal timing signals from the display device CRT, and sequentially controls the memory CRT REFRESH.
The access address to MEMORY is changed, and the ROW address signal for the full-width character generator CG and half-width character generator CG is changed to display characters on the display device CRT.

CRT is a display device and CRT controller CRT
Displays the character information stored in the memory CRT REFRESH MEMORY under the control of CONT.

display device CRT, CRT controller CRT
Send a vertical timing signal and a horizontal timing signal to CONT to match the timing of the CRT controller CRT CONT.
In addition, the display device CRT is connected to the control circuit CRTC.
Receives VIDEO information and brightness information, and outputs VIDEO information with the specified brightness.

DATA BUFFER is a buffer that stores data used by various processing routines. It is not directly related to the present invention.

In this example, buffer DATA
The format of the data stored in BUFFER was determined as shown in Figure 5.

RKCT is a romaji-kana conversion table, which is a conversion table for converting romaji character strings to kana character strings. As shown in FIG. 9, Roman character strings and kana character strings correspond.

ICT is KB code, internal code conversion table,
This is a table for converting output data from the keyboard KB into internal code (Figure 5). When converting, it must be noted that the code to be converted differs depending on the shift state and input mode state. Figure 7 shows details of this table.

DHT is a dakuten and handakuten table, which assigns one code to a dakuten or a handakuten, as shown in Figure 8. This is a conversion table for converting from a code system to a code system that does not give a single code for voiced or handakuten, but includes information on voiced and handakuten in the character code.

RAM is a random access memory used for temporary storage of various data. The memory RAM contains Roman flag FG, half-width flag HWFG, and decimal flag DECI MAL FG, which are used by the microprocessor CPU (described later) during processing.
Shift register SR, internal code register IREG
Packing register PREG Includes register DF, register TDL, register LEN, etc.

The ROM is a control memory in which the control procedures shown in FIG. 11 and subsequent figures are stored.

The CPU is a microprocessor that performs calculations and makes logical decisions.

Address bus AB, data bus DB, which will be described later
via control bus CB, keyboard KB,
KB BUFFER, memory CRT
REFRESH MEMORY, buffer DATA
Data can be read and written to BUFFER, BUFFER KB READ BUFFER, Romaji-kana conversion table, RKCT KB code internal code conversion table ICT, memory RAM, and control memory ROM. AB is the address bus,
Transfers signals that indicate the control target. CB is a control bus that applies control signals to various control targets. DB transfers various data using a data bus.

Based on the above configuration, the operation of this embodiment will be explained.

When the power is turned on, the initialization process shown in FIG. 11 is first executed.The contents of each step in this flow are shown below.

0, 1 KB INT (abbreviation for UNTERRUPT)
MASK ON 0, 2 KB Insert all NULL codes into BUFFER. (Clear all to 0) 0, 3 Insert all space codes in CRTREFRESH MEMORY 0, 4 KB INT MASK OFF 0, 5 JUMP to MAIN processing 1 or 2 KB INT in steps 0 and 1 as described above
Turn on MASK and clear KB BUFFER in step 0.2. (Set ALL 0) Next, in step 0.3, memory CRT REFRESH
Enter all space codes in MEMORY.

KB INT MASK OFF in steps 0 and 4
Then go to MAIN processing 1 or 2 in steps 0 and 5.
JIMP.

MAIN processing 1 or 2 represents two types of application examples of the present invention.

At step 0.5 of the above-mentioned initialization process, the process moves to, for example, Main process 1 shown in FIG. 12. 12th
The contents of each step in the flow shown in the figure are shown below.

1, 1 KB READ BUFFER WORD0
Set READ request DATA LENGTH.

1, 2 KB BUFFER READ processing 1, 3 Is WORD1 of KB READ BUFFER (DATA LEN GTH that was actually read) 0? 1, 4 Execute various processes according to input data As mentioned above, in steps 1 and 1, KB BUFFER
KB to read data stored in
Read request to WORD0 of READ BUFFER
Set DATA LENGTH. Valid data stored in KB BUFFER in the next steps 1 and 2 (specified by WORD 4 of KB BUFFER)
Read and move to KB READ BUFFER. ) DATA LENGTH to be transferred is Batsufua KB
Specified by WORD0 of READ BUFFER.
Once the transfer is complete, transfer the data to Batsuhua KB.
Remove from BUFFER Next steps 1 and 3 remove KB from BUFFER
LENGTH of data moved to READ BUFFER
Check whether is 0 or not. If it is 0, repeat steps 1 and 2; if not, go to steps 1 and 4. In steps 1 and 4, various processes are executed according to the input data.

The specific details of the various processes are omitted because they are not directly related to the present invention, but include, for example, character input processing.

FIG. 14 shows the detailed flow of the above-mentioned KB BUFFR READ processing. The contents of each step are shown below.

1, 2, 1 KB MASK ON 1, 2, 2KB BUFFER WORD4
(DATA after DECIMAL processing
Is WORD0 of KB READ BUFFER larger than KB READ BUFFER (LENGTH)? 1, 2, 3 TDL←=BUFFER WORD4 1, 2, 4 TDL←=KB READ BUFFER
WORD0 1, 2, 5 Only the TDL value Moves DATA in KB BUFFER to KB READ BUFFER.

1, 2, 6 KB READ BUFFER WORD1
Set the TDL value to .

1, 2, 7 KB BUFFER Subtract the TDL value from the WORD0 to 4 values.

1, 2, 8 KB BUFFER Align all contents of WORD5 to 20 to the left by the TDL value.

(Delete the beginning of the TDL value and align the rest to the left) 1, 2, 9 DISPLAY processing (3.13) 1, 2, 10 KB INT MASK OFF KB INT in steps 1, 2, and 1 as described above
Turn on MASIC and use steps 1, 2, and 2 to KB BUFFER WORD4
(effective DATA LENGTH) more KB
FEAD BUFFER WORD0 (request
DATA LENGTH) is larger.

If it is large, proceed to steps 1, 2, and 3. If it is small, proceed to steps 1, 2, and 4. Read the TDL in KB in steps 1, 2, and 3.
Set to the value of BUFEER WORD0. Proceed to steps 1, 2, and 5 KB BUFFER TDL in steps 1, 2, and 4
Set to the value of WORD0. Proceed to steps 1, 2, and 5. Steps 1, 2,
In step 5, move the data in KB BUFFER by the value of TDL to KB READ BUFFER.

KB READ BUFFER in steps 1, 2 and 6
Set the TDL value in WORD1.

KB BUFFER WORD0 in steps 1, 2, and 7
Subtract the TDL value from the value of ~4.

KB BUFFER DATA in steps 1, 2, and 8
Delete the beginning of the area by the value of TDL,
Align the rest to the left.

1, 2, 9KB BUFFER DISPLAY processing (3, 13) (DATA in KB BUFFER
DISPLDY on CRT) 1, 2, 10 KB INT MASK OFF.

Figure 15 shows buffer KB BUFFER and buffer KB READ in KB BUFFER READ processing.
This is an example of BUFFER. In response to a 3-character DATA READ request from KB BUFFER,
KB BUFFER to BUFFER KB READ
You can see that three characters are moved to BUFFER. It can also be seen that the HEADER section parameters of buffer KB BUFFER and buffer KB READ BUFFER also change accordingly.

Perform MAIN1 processing as described above. Next, the processing of MAIN2 will be explained in detail. When the MAIN2 process is executed at step 0.5 of the initialization process, each step of the flow shown in FIG. 13 is executed. Each step of the flow is shown below.

2. 1KB READ BUFFER WORD1
Set LOOK request DATA LENGTH.

2, 2 KB BUFFER LOOK processing 2, 3 LOOKed data can be processed
Is it DATA? 2, 4 KB BUFFER READ processing (1, 2) 2, 5 Execution of various processes according to input data As shown in the flow above, KB is read in steps 2 and 1.
To know the contents of the data stored in BUFFER, enter the LENGTH of the data you want to know in WORD0 of KB READ BUFFER.

In steps 2 and 2, the valid data stored in KB BUFFER is read from KB BUFFER.
The DATA LENGTH to be moved to BUFFER is
Specified in WORD0 of KB READ BUFFER. Even after the transfer is complete, the data is not removed from the KB BUFFER. Next steps 2 and 3
Then, the data put in the KB READ BUFFER is checked to see if there is any data that can be processed.

If processing is possible, proceed to steps 2 and 4.

If processing is not possible, repeat steps 2 and 2.

In steps 2 and 4, perform KB BUFFER READ processing (1, 2) and read from the buffer KB BUFFER.
Remove the data that will be processed.

Various processes are executed according to the data read into the KB READ BUFFER in steps 2 and 5.
The specific contents of the various treatments are omitted because they have no direct relation to the present invention. For example, in the kana-kanji conversion process, the conversion process cannot be executed until the input of one phrase is completed. Therefore, in steps 2 and 3, it is checked whether the input of one phrase from the KB has been completed, and if it has been completed, the kana-kanji conversion process is performed in steps 2 and 5.

KB BUFFER LOOK in steps 2 and 2 above
Details of the processing are shown in FIG. The contents of this flow are shown below.

2, 2, 1 KB INT MASK ON 2, 2, 2 KB BUFFER WORD 4
(DATA after DECIMAL processing
LENGTH) from KB READ BUFFER WORD0
Is it bigger? 2, 2, 3 TDL = WORD4 of KB BUFFER 2, 2, 4 TDL value only in KB BUFFER
DATA in KB READ BUFFER
Move to 2, 2, 6KB READ BUFFER WORD1
Set the value of TDL 2, 2, 7 KB INT MASK OFF
Roughly the same as BUFFER READ processing, KB
The difference from BUFFER READ processing is KB BUFFER
The point is that LOOK processing has no effect on the buffer KB BUFFER.

KB BUFFER LOOK processing steps 2, 2,
1 is the same step as 1, 2, 2 2, 2, 2 is 1,
Steps 2, 2, 3 are the same as 1, 2, 3 Steps 2, 2, 4 are the same as 1, 2, 4 Steps 2, 2, 5 are the same as 1, 2, 5
Steps 2 and 6 are the same as steps 1, 2, and 6. Steps 2, 2, and 7 are the same as steps 1, 2, and 10.

MAIB2 processing is performed as described above.

Next, the processing when the keyboard KB is operated will be explained. FIG. 17 shows the flow of KB input processing. The contents of each step are shown below.

3.1.KB INT MASK ON 3. Input DATA from 2 KB.

3, 3 FG processing (setting flags, etc.) 3, 4 Is the data valid? 3.5 Is the input data a BS code? 3, 6 BS processing (processing to remove data from KB BUFFER) 3, 7 Code conversion processing 3, 8 KB BUFFER writing processing 3, 9 Dakuten, handakuten processing 3, 10 Romaji kana conversion processing 3, 11 Half-width processing 3, 12 DECIMAL processing 3, 13 DISPLAY processing 3, 14 KB INT MASK OFF KB INT in steps 3 and 1 as described above
Turn on MASK and input data from KB in steps 3 and 2. In the next steps 3 and 3, FG processing (sets the input mode, shift, etc.) determines whether the data input in steps 3 and 4 is valid data for changes in KB BUFFER, and confirms that it is valid. If yes, proceed to steps 3 and 5; if invalid, proceed to steps 3 and 14.

Is the data entered in steps 3 and 5 a BS code? If it is a BS code, proceed to steps 3 and 6.
If not, proceed to steps 3 and 7.

Perform BS processing (remove one piece of data from KB BUFFER) in steps 3 and 6, and proceed to steps 3 and 14.

In steps 3 and 7, code conversion processing (converting the KB code of the data input from the KB into an internal code for internal processing in preparation for loading one piece of data into the KB BUFFER).In the next steps 3 and 8, Perform KB BUFFER write processing (write the converted internal code to the buffer KB BUFFER), and in steps 3 and 9 perform voiced and handakuten processing (dakuten and handakuten processing is performed on the data in KB BUFFER, and the voiced and handakuten processing is completed. DATA
(Determine LENG TH, that is, WORD 1 of KB BUFFER).

Romaji-kana conversion processing in steps 3 and 10 (KB
Romaji-kana conversion processing is performed on the data in BUFFER, and Romaji-kana transformation processing is completed.
DATA LENGTH i.e. KB BUFFER WORD2
In steps 3 and 11, half-width processing (half-width processing is performed on the DATA in KB BUFFER, and the DATA LENGTH for which half-width processing has been performed, that is, the value of WORD 3 of KB BUFFER BUFFER is determined). In steps 3 and 12, DECIMAL processing (for data in KB BUFFFER)
(determines the DATA LENGTH, that is, the value of KB BUFFER WORD4) for which DECIMAL processing has been performed.
KB of data stored in KB BUFFER
DATA of the value stored in BUFFER WORD4
LENGTH becomes truly valid DATA. In steps 3 and 13, DISPLAY processing (in KB BUFFER)
DISPLAY DATA on the CRT screen).
Next, in steps 3 and 14, KB INT MASK is turned OFF to end the process.

The FG processing shown in the above flow will be further explained. FIG. 18 is a flow showing the details, and each step will be shown below.

3, 3, 1 Is the input data a mode key code? [Mode key: Roman character key, Kana key] 3, 3, 2 Set or reset Roman character input FG 3, 3, 3 Is the input data a width specified key code? [Width specification key: full width key,
Half-width key] 3, 3, 4 Set or reset full-width AWFG 3, 3, 5 Is the input DATA a shift key code? [Shift keys: English shift key Alphabetic decimal shift key Katakana shift key Katakana small shift key Hiragana shift key Hiragana small shift key 3, 3, 6 Save shift status in shift register SR 3, 3, 7 Is the input data a DECIMAL key? 3, 3, 8 Is DECMAL FG already set? 3, 3, 9 DECMAL FG SET 3, 3, 10 Judge the input data as valid data.

3, 3, 11 Determine the input data as invalid data.

Steps 3, 3, 1, 3, as shown above.
3. If the data input in 2 is a mode key, set or reset the Roman alphabet flag FG depending on whether it is a Roman alphabet or a Kana key. If the data input in the next step 3, 3, 3, 3, 3, 4 is a width designation key, the full width flag AWFG is set or reset depending on whether it is a full width key or a Japanese key.

If the data entered in steps 3, 3, 5, 3, 3, and 6 is a shift key, it depends on whether it is an English Daiji shift key, an Alphabetic decimal shift key, a Katakana shift key, a Katakana small shift key, a Hiragana shift key, or a Hiragana shift key. Then set the corresponding shift code in shift register SR.

If the data input in steps 3, 3, 7 to 3, 3, and 9 is a DECIMAL key, set the digital flag DECIMAL FG.

If the data entered in steps 3, 3, 10, 3, 3, and 11 was the mode key, width specification key, shift key, or DECIMAC key when the digital flag DECIMA FG was set, the input data is determined to be invalid data, and any other data is determined to be valid data, and FG processing is terminated.

Next, the BS processing in steps 3 and 6 will be explained with reference to FIG. The contents of each step are shown below.

3, 6, 1 KB BUFFER WORD0≠0? 3, 6, 1 KB BUFFER WORD0 decrement 3, 6, 3 KB BUFFER WORD 0≧WORD1? 3, 6, 4 KB BUFFER WORD1 decrement 3, 6, 5 KB BUFFER WORD 0≧WORD2? 3, 6, 6 KB BUFFER WORD2 decrement 3, 6, 7 KB BUFFER WORD 0≧WORD 3? 3, 6, 8 KB BUFFER WORD3 decrement 3, 6, 9 KB BUFFER WORD 0≧WORD4? 3, 6, 10 KB BUFER WORD4 decrement 3, 6, 11 DISPLAY processing 3, 13 Steps 3, 6, 1 to 3, 6, 10 as described above
Removes one data stored in KB BUFFER from KB BUFFER. For that reason, KB BUFFERQ
Decrement WORD 0. Another word
If there is a word greater than WORD 0 from 1 to WORD 4, only that WORD is decremented. K in next steps 3, 6, 11
DISPLA the BUFFER to the display device CRT and end the BS processing.

Next, the code conversion processing in steps 3 and 7 will be further explained. FIG. 20 shows the flow, and its contents are shown below.

Refers to the KB code/internal code conversion table, converts the code of data input from 3, 7, and 1 KB into an internal code, and enters the internal code register.

3, 7, 2 Is the Romaji input FG set? 3, 7, 3 Is the current shift status Eiji Daiki Shift or Eiji Minori Shift? 3, 7, 4 Bits of internal code register IRFG
Set 8 to 1.

Steps 3, 7, 1-3, 7, 4 as described above
Converts the KB code of the data input from the KB to an internal code using the KB code internal code conversion table, and stores the result in the internal code register IREG.
write to. At that time, when in Roman character input mode and in Katakana shift, Katakana small shift, or Hiragana small shift, bit 8 of the data written to the internal code register IREG is set to 1 to indicate that the data is a character forming Roman characters. , the code conversion process ends.

Next, the details of the KB BUFFER write processing in steps 3 and 8 will be explained. FIG. 21 shows the flow, and the contents of each step are shown below.

3, 8, 1 KBB (WORD 0 + 1) ← = Write the value of the internal code register to the DATA location indicated by the address of [WORD0 value + 1] of the internal code register, KB BUFFER. 3, 8, 2 KB BUFFER WORD 0 Increment.

As mentioned above, the DATA area of KB BUFFER
Adds the character code in the internal code register to the end of the DATA column. WORD1 of KB BUFFER (DATA
LENGTH) and increment KB
BUFFER write processing ends.

Next, the details of the voiced and half-voiced point processing in step 3.9 will be explained. FIG. 22 shows the flow, and the contents of each step are shown below.

3.9.1 Roman alphabet FG=1? 3.9.2 WORD 0>WORD1? 3.9.3 Is KBBUFFER (WORD0) a dakuten code (〓) or a handakuten code? 3.9.4 KB BUFFER WORD0>WORD1+2? 3.9.5 WORD 1←=WORD0−1 3.9.6 Is KB BUFFER (KBS) (WORD0) a voiced or handakuten code? 3.9.7 WORD1←=WORD0 3.9.8 WORD 0≧WORD1+2? 3.9.9 Dakuten, handakuten table DHT and KBB
(WORD0−1), KBB (WORD0)
Change the 2 codes to JIS Kanji code and convert the result to KBB (WORD0-
1).

3.9.10 WORD0←=WORD0−1 3.9.11 WORD1←=WORD0 As mentioned above, Roman FG=1 in step 3.9.1
Proceed to step 3.9.11 when FG = 0, proceed to step 3.9.2 when FG = 0, that is, proceed to step 3.9.2 when in kana input mode
Processing after 3.9.2 is executed.

KB BUFFER WORD 0> in step 3.9.2
If it is WORD1, there is a character string to be processed, so proceed to step 3.9.3. i.e. WORD0 and WORD1
The string sandwiched between is the string to be processed.
In other words, for the DATA LENGTH of the value shown in WORD1 of the DATA in KB BUFFER, voiced and handakuten processing has been completed, so
Proceed to step 3.9.3 to process other data.

In step 3.9.3, KBB (WORD0) checks whether it is a voiced mark code or a handakuten code. KBB
If (WORD0) is a voiced mark code or a handakuten code, proceed to step 3.9.8. Otherwise, proceed to step 3.9.4.

(Here, KBB(WORD0) means KB
Indicates the 0th WORD of data in BUFFER. (Similarly below) If WORD0≧WORD1+2 in step 3.9.4, proceed to step 3.9.5. If not, proceed to step 3.9.6.

(Here, WORD0 refers to the 1st W of KB BUFFER. The same applies hereafter.) Here, WORD0≧WORD1+2 means that there is data in KB BUFFER that has not been processed for voiced and handakuten before inputting data from KB. This corresponds to checking whether the

In step 3.9.5, set WORD1 to the value of WORD0-1. In other words, KBB(WORD0) is not a voiced or handakuten code.
For all codes up to -1), there will be no code change due to voiced or handakuten, and these codes will be removed from the characters subject to voiced and handakuten.

In step 3.9.6, if KBB (WORD0) is a code that can be voiced or handakuten, return without changing the value of WORD1. That is, there is a possibility that the code will change depending on the data input next from KB, and KBB (WORD0) remains a character subject to dakuten and handakuten. If KBB (WORD0) is not possible for voiced and handakuten, proceed to step 3.9.7 to remove KBB (WORD0) from the code for voiced and handakuten.

In step 3.9.7, set WORD1 to the value of WRD0. Then return.

In step 3.9.8, if WORD0≧WORD1+2, proceed to step 3.7.9. Otherwise, proceed to step 3.9.10.

That is, if a character subject to voiced mark or handakuten code exists in the buffer KB BUFFER before the voiced mark or handakuten code is input from the KB, proceed to 3.9.9.

In step 3.9.9, KBB (WORD0-1), KBB
(WORD0) 2 codes as dakuten and handakuten table
Refer to DHT and change to 16bit internal code with voiced or half voiced mark, and change the value to KBB (WORD0-1)
be the value of

In step 3.9.10, WORD0 is decremented.

In step 3.9.11, set WORD1 to the same value as WORD0, and finish the voiced and handakuten processing.

Next, the details of the romaji-kana conversion process in step 3.10 are shown in FIG. The contents of each step shown in FIG. 23 are shown below.

3.10.1 Roman alphabet FG=1? 3.10.2 WORD1＞WORD2? 3.10.3 KBB (WORD1) bit8=1? 3.10.4 bit8 of KBB (WORD1) = 0 3.10.5 KBB (WORD2+1) to KBB
Can the Romaji code string up to (WORD1) be converted to a Kana code string?
(Romaji kana conversion table RKCT
3.10.6 KBB (WORD2+1) to KBB
Convert the Romaji code string up to (WORD1) into a Kana code string (refer to the Romaji-Kana conversion table) and convert the conversion result back to KBB (WORD 2+
Write to the positions from 1) to KBB (WORD1).

3.10.7 LEN←=Length of Romaji code string - Length of Kana code string 3.10.8 WORD0←=WORD0−LEN 3.10.9 WORD1←=WORD1−LEN 3.10.10 WORD2←=WORD1 Step 3.10 as described above .1, romaji FG
When = 1, proceed to step 3.10.2. Romaji FG＝
If it is 0, proceed to step 3.10.10.

In step 3.10.2, if WORD1>WORD2, the character string to be processed for Romaji-kana conversion is KB.
Since it exists in BUFFER, proceed to step 3.10.3. Return at other times In step 3.10.3, bit8 of (KBB (WORD1) is 1
If so, KBB (WORD 1) is the character to be processed for Romaji-kana conversion processing, and proceed to step 3.10.4.

Otherwise, proceed to step 3.10.10.

In step 1.10.4, bit 8 of KBB (WORD 1)
=0.

In step 3.10.5, Romaji-kana conversion table
Refer to RKCT and from KBB (WORD2+1)
Check whether the Romaji code string up to KBB (WORD1) can be converted to a Kana code string. If it can be converted, proceed to step 3.10.6, otherwise return.

In step 3.10.6, from KBB (WORD2+1)
Convert the Romaji code string up to KBB (WORD1) to Kana code string, and convert the converted result back to KBB.
The value shall be from (WORD2+1) to KBB(WORD1).

In step 3.10.7, the difference between the length of the Roman character code string and the length of the Kana code string is set as LEN.

In step 3.10.8, register the value of WORD0
Decreased by the value of LEN.

In step 3.10.9, register the value of WORD1
Decreased by the value of LEN.

In step 3.10.10, the value of WORD2 is changed to the value of WORD1 and the Romanji-kana conversion process is completed.

Next, details of the half-width processing in step 3.11 are shown in FIGS. 24a and 24b. The contents of each step are shown below.

3.11.1 Half width flag HW FG=1? 3.11.2 WORD2＞WORD3? 3.11.3 DECIMAL FG=1? 3.11.4 Is KBB (WORD2) a packable character code? 3.11.5 WORD2≧WORD3+2? 3.11.6 KBB(WORD2−1), and KBB(WORD2)
and KBB (WORD2
-1), write the result.

3.11.7 WORD0←=WORD0−1 WORD1←=WORD1−1 WORD2←=WORD2−1 WORD3←=WORD2 3.11.8 WORD2≧WORD3+2? 3.11.9 Pack KBB (WORD2-1) and space code, and send the result to KBB
(WORD2-1) value.

3.11.10 WORD3←=WORD2 3.11.11 Is KBB (WORD2) the DECIMAL TAB exit code? 3.11.12 Is the value of [WORD2−WORD3] an odd number? 3.11.13 KBB (WORD3+1) ~ KBB (WORD2
−1) is packed code by code, and the result is KBB again.
The value shall be after (WORD3+1).

3.11.4 DF REG←=WORD2−WORD3−1/2 3.11.15 Space code and KBB (WORD3+
1) Pack the codes from 1) to KBB (WORD2-1), 2 codes at a time, and then repack the results to KBB (WOR3+
1) The following values shall be used.

3.11.16 DF REG=WORD2−WORD3/2 3.11.17 WORD3←=WORD3+DF 3.11.18 DF REG←=WORD2−WORD3−1 3.11.19 WORD0←=WORD0−DF WORD1←=WORD1−DF WORD2←=WORD2−DF As shown above, in step 3.11.1, if the half-width flag HW FG=1, proceed to step 3.11.2.
If half-width flag HW FG = 0, proceed to step 3.11.10.

In step 3.11.2, if WORD2>WORD3, there is a character string to be processed in half width, so step
Proceed to 3.11.3. Otherwise, return.

In step 3.11.3, if DECIMAL FG=1, proceed to step 3.11.11. (DECIMAL half-width processing)
If DECIMAL FG=0, proceed to step 3.11.4.
(DECIMAL full width processing) In step 3.11.4, check whether KBB (WORD2) is a packable character. Packing here refers to converting a character code that should be made into a half-width character code (1W per character) into a half-width internal code (1W per 2 characters) by combining two characters. In this embodiment, character codes that can be half-width are space codes, alphanumeric codes, numeric codes, and period codes.

If KBB (WORD2) is a packable character code, proceed to step 3.11.5. If no, 3.11.8
Proceed to.

In step 3.11.5, if WORD2≧WORD3+2, that is, there is already KB in addition to KBB (WORD2).
If a half-width processing target column exists in BUFFER, proceed to step 3.11.6. If not, return and wait for the next input from KB.

In step 3.11.6, KBB (WORD2) and KBB
(WORD3) and KBB (WORD2−)
Write the result in 1).

The packing method will be described later.

In step 3.11.7, WORD0, WORD1,
Subtract 1 from the value of WORD2.
Set it to the value of WORD2. I will return after that.

In step 3.11.8, if WORD2≧WORD3+2, that is, if the half-width target character exists alone in the KB BUFFER, proceed to step 3.11.9.
If not, proceed to 3.11.10.

In step 3.11.9, pack KBB (WORD2-1) and space code, and use the result.
The value is KBB (WORD2-1).

In step 3.11.10, set the value of WORD3 to the value of WORD2.

In step 3.11.11, KBB (WORD2)
Step if DECIMAL TAB exit code
Proceed to 3.11.12, otherwise return. In other words, step. From 11.12 onwards, do this after exiting DECIMAL TAB mode. Here, the DECIMAL TAB end code is a non-numeric code.

In step 3.11.12, if the value of WORD2-WORD3 is an odd number, proceed to step 33.11.13. If not, proceed to step 3.11.15.

At step 3.11.13, KBB (WORD3+1) ~
The code string up to KBB (WORD2-1) is packed two codes at a time, and as a result, KBB (WORD3
+) or later values.

In step 3.11.14, (WORD2−WORD3−
Calculate the value of 1/2 and put the result in DF REG. Then proceed to step 3.11.17.

In step 3.11.15, space code and KBB
The codes from (WORD3+1) to KBB(WORD2-1) are packed two codes at a time, and the resulting codes are used as the values after KBB(WORD3+1).

In step 3.11.16, (WORD2−WORD3)/
Calculate 2 and put the value in DF REG.

In step 3.11.17, increase the value of WORD3 by the value of DF REG.

In step 3.11.18, calculate WORD2-WORD3-1 and put the value in DF REG.

In step 3.11.19, WORD0, WORD1,
Subtract the value of DF REG from each value of WORD2 and end the half-width processing.

Then step 3.11.6, 3.11.9, 3.11.13, as described above.
The packing process performed in 3.11.15 will be explained using FIG. 25. This process is for packing two units (2W) of the half-width processing target character code into a half-width internal code (1W), and the contents of each step are shown below.

4.1 Is the 1st W to be packed a full-width space code or period code? 4.2 Set bits 1 to 7 of the packing register to 0100000
Or 0101110.

4.3 Set bits 1 to 7 of the packing register to the values of bits 9 to 15 of the 1st W to be packed.

4.4 Is the 2nd W to be packed a full-width space code or period code? 4.5 Set bit9 to bit15 of packing register to 0100000
Or 0101110.

4.6 Set bits 9 to 15 of the packing register to the values of bits 9 to 15 of the 2nd W to be packed.

As shown above, in steps 4.1 to 4.6, bits 9 to 15 of the 1st W of the half-width target character are placed in bits 1 to 7 of the packing register, and the 2nd W of the half-width target character is
Packing bit9 to bit15 bit9 to bit15 of register
Put it in. Then set bit 0 of the packing register to 1
Make it.

However, when the character code to be packed is a space code or a period, use "0100000" or "0101110" instead of tit9 to bit15. In this way, a half-width internal code packed into a packing register can be obtained.

Figures 26 and 27 are examples of packing processing,
Fig. 26 shows an example of half-width packing, and Fig. 27 also shows an example of half-width packing.

Next, the details of the DECIMAL processing in step 3.12 are shown in FIG. The contents of each step are shown below.

3.12.1 DECIMAL FG=1? 3.12.2 KBB (WORD0) is DECIMAL TAB
Is it an exit code? 3.12.3 DECIMAL FG reset 3.12.4 WORD4←=WORD3 As mentioned above, in step 3.12.1, DECIMAL
When FG=1, proceed to step 3.12.2. If no, proceed to step 3.12.4.

In step 3.12.2, KBB (WORD0)
If it is a DECIMAM TAB exit code, proceed to step 3.12.3. If no, return. That is,
Data entered in DECIMAL TAB mode in the KB BUFFER cannot be valid data until the DECIMAL TAB end code is pressed from the KB.

Here, the DECIMAL TMB end code is a non-numeric code.

In step 3.12.3, set DECIMAL FG to 0.

In step 3.12.4, set the value of WORD4 to the value of WORD3 and end the DECIMAL processing.

Next, the state of the data in the buffer KB BUFFER described above will be explained using FIGS. 29a to 29F.

A shows an example of processing for the BS (backspace) key, in which the last data in KB BUFFER, "D", is deleted and the KB BUFFER is
It can be seen that a part of the DATA LENGTH of the TEADER section parameter has been reduced. however
This effect does not extend to WORD2 or later.

In b, an example of processing for a voiced-tone key is shown. There is no change in the value of VORD0, but
WORD2 increases, and by extension WORD4, which indicates the effective DATA LENGTH of KB BUFFER, also increases.

KB in romaji input in c
You can see the inside of BUFFER. In this case as well, all
The value of WORD0 indicating DATA LENGTH does not change, but WORD4 indicating effective DATA LENGTH
It can be seen that the value of is increasing.

d shows the state of the KB BUFFER when the "F" key is input in the half-width input mode.

e shows the state of DECIMAL processing in full-width mode.

f shows the state of DECIMAL processing in half-width mode.

Next, the DISPLAY process in step 3.13 will be explained with reference to FIG.

The contents of each step are shown below.

3.13.1 Fill in space codes in all positions corresponding to the 8th line of CRT REFRESH MEMORY.

3.13.2 CRT REFRESH code from KBB(1) to KBB(WORD0)
Write in order from the 8th row, 1st digit of MEMORY, then KBB (WORD4+1) ~
bit8 = up to KBB (WORD0)
Convert to 1 and write. (however
(Unnecessary when WORD4=WORD0) 3.13.3 CRT REFRESH cursor code
Write to the 8th row [VORD0+1] digit position of MEMORY.

In step 3.13.1 as mentioned above, the CRT
Fill in space codes in all positions corresponding to the 8th line of REFRESH MEMORY.

In step 3.13.2, data in KB BUFFER (its length is specified by WORD0) is transferred to CRT.
Move to the position corresponding to the 8th line of REFRESH MEMORY. At this time, if there is a difference between the values of WORD4 and WORD4, the
Effective PATA LENGTH and total DATA in DATA
There will be a difference between LENGTH. Valid data will be displayed with normal brightness on the display position CRT, and data that has not yet become valid data will be displayed with low brightness. Therefore, No. [WORD4+1]
Set bit 8 of the data in the memory CRT REFRESH MEMORY corresponding to the data from the th data to the [WORD0] th data to 1.

In step 3.13.3, on the 8th line, next the keyboard
The cursor code is stored in the memory CRT to inform the inputter of the location of the data to be input from the KB.
REFRESH MEMORY 8th line [WORD0
+1] Write in the digit position. The cursor code is a code attached to correspond to a cursor pattern.

DISPLAY processing ends as described above.

In this implementation sequence explained above, half-width
In the DECIMAL processing, periods are packed with numbers below the decimal point, but it is also possible to pack periods with numbers in the first digit.

In this embodiment, valid data is distinguished from data that is not yet valid by changing the display brightness, but other methods of differentiation such as reverse display, blinking display, high brightness display, etc. are also considered. It will be done.

In this embodiment, an input motor device that sequentially displays input data has been described, but the invention is not limited to the input motor device, but can be applied to any character processing device having an input means and an output means.

As described above, according to the present invention, it is possible to prevent the cursor position from being interrupted due to the difference in the number of characters that occurs when converting a first character to a second character, and to input the first character following the second character. You can see it on the display screen.

[Brief explanation of drawings]

Figure 1 is a block diagram showing one embodiment of the present invention, Figure 2 is a diagram explaining the buffer KB BUFFER,
Figure 3 is a diagram explaining the memory LRY REFRESH MEMORY, Figure 4 is the buffer KB READ
A diagram explaining BUFFER, Figure 5 is a diagram explaining the data structure, Figure 6 is a detailed diagram of the keyboard KB, Figure 7 is a diagram showing the KB code internal code conversion table, Figure 8 is a diagram showing voiced and handakuten. Figure 9 is a diagram showing a table, Figure 9 is a diagram showing a Romanji-kana conversion table, Figure 10 is a diagram explaining a CRT controller,
Figure 11 is a diagram explaining initialization processing, Figure 12 is a diagram showing MAIN processing 1, and Figure 13 is a diagram explaining initialization processing.
Diagram showing MAIN processing 2, Figure 14 is KB
Figure 15 shows the BUFFER READ process, Figure 15 shows the data changes, Figure 16 shows the KB BUFFER
Figure 17 shows KB input processing, Figure 18 shows FG processing, Figure 19 shows BS processing, Figure 20 shows code conversion processing, Figure 17 shows KB input processing, Figure 19 shows BS processing, Figure 20 shows code conversion processing, Figure 21 is KB BUFFER
Figure 22 is a diagram showing the writing process, Figure 22 is a diagram showing the voiced and handakuten processing, Figure 23 is a diagram showing the Romaji-kana conversion process, Figures 24a and b are diagrams showing the half-width processing,
Fig. 25 is a diagram showing packing processing, Fig. 26 is a diagram explaining half-width packing, Fig. 27 is a diagram explaining half-width packing (if there is space), Fig. 28 is a diagram showing DECIMAL processing, Fig. 29 a~
f is a diagram showing data movement, Figure 30 is DISPLAY
It is a figure which shows a process. RAM……Memory, ROM……Control memory,
CPU: Microprocessor, CRT: Display device.

Claims (1)

[Scope of Claims] 1. An input means for inputting kana character data and a voiced mark; a display means for displaying first kana character data input from the input means; cursor means for indicating a position to display kana character data; character conversion means for converting the first kana character data displayed on the display means into a second kana character when the voiced mark is input; Each time the first kana character data is input from the input means, the position indicated by the cursor means is moved by one kana character, and when the voiced mark following the first kana character is input, the voiced mark is cursor control means for positioning a cursor at a position determined based on input of a first kana character before input.