JPH0480420B2 - - Google Patents

Description

[Detailed Description of the Invention] [Industrial Field of Application] The present invention provides for continuously inputting newly input consonant data in the same row as the row in which the kana data row is displayed, following the kana data row. This invention relates to a character processing method for displaying characters.

[Prior art] Conventionally, this type of device has been used, for example, in the
As described in Japanese Patent Application No. 38371, input alphanumeric consonant data or vowel data is converted into Romaji/kana in units of phrases.

On the other hand, the applicant has proposed a technique in which an input vowel is used as a trigger for conversion from Roman characters to kana, as disclosed in Japanese Patent Application Laid-open No. 55-49771.

[Problems to be solved by the invention] However, in this case, we believe that there is still plenty of room for improvement regarding what kind of display is displayed on the display, which is one of the interfaces with the operator. It will be done.

[Means for Solving the Problem] In order to solve this problem, the present invention adds newly input consonant data to the kana data string in the same row as the kana data string. It continues to be displayed continuously.

[Embodiment] 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.

Function keys include DECIMAL keys, 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 Japanese sentences 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 to input characters of normal size, and the half-width key is a key that instructs input of characters that are half the normal size (in the horizontal direction) (however, only specific characters such as alphanumeric characters) are used.

One of the character keys and function keys
When you press one key, the control bus CB (described later) is activated to the microprocessor CPU (described later).
Give an interrupt through . Also, keyboard
A microprocessor that converts the code of the pressed key through the encoder provided in the KB.
The CPU can be known through the data bus DB, which will be 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 CPU. 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 interrupt will not be lost. It shall work 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.

Data such as characters stored in the buffer KB BUFFER is 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.

WORD0 KB All data stored in BUFFER
DATA LENGTH WORD1 KB All data stored in BUFFER
All data stored in LENGTH WORD2 KB BUFFER of DATA for which internal and handakuten processing has been completed.
Romaji-kana conversion of DATA has been completed.
All data stored in LENGTH WORD3 KB BUFFER of DATA
DATA inner half-width processing has been completed.
LENGTH WORD4 KB All data stored in BUFFER
DECIMAL processing in DATA has finished
DATA LENGTH WORD5-20 Area where input data is stored from KB The first 5W are filled with the characteristics of the data stored in the buffer KB BUFFER. After the 6th W, input data is actually stored.

Batsuhua KB BUFFER's WORD 0 (1st W)
The LENGTH of the data stored in the buffer KB BUFFER 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 "ga", and when any other key is pressed, it is confirmed that the data is "ka".

Also, for example, when inputting in Roman alphabet mode, the first keystroke, such as "Y", is not confirmed as data, and it is not until the next keystroke, for example, "A", that the keystroke is entered. The data becomes a confirmed “ya”.

Also, for example, when performing half-width input, the first keystroke, such as "1", is not confirmed as data yet, and it is not until the next keystroke, for example, "2", that the data is confirmed, "12". ”
This is the data. This is because, in this embodiment, a processing method is adopted in which half-width characters are always treated in units of two characters.

Further, for example, only after a character that ends a decimal tab is input, the input character string is determined to be valid.

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 HEADER of BUFFER is used.

WORD of KB BUFFER 0 LENGTH KB BUFFER WORD of all data stored in KB BUFFER 1 LENGTH KB BUFFER WORD of all data stored in KB BUFFER with internal and handakuten processed 2 LENGTH KB BUFFER WORD of all data stored in Batsufua KB BUFFER that has been processed with internal dakuten and half-dakuten processing and romaji-kana conversion processing 3 LENGTH KB BUFFER WORD of all data stored in Batsufua KB BUFFER Data that has undergone voiced mark processing, romaji kana conversion processing, and half-width processing
LENGTH KB BUFFER WORD 4 The LENGTH of all data stored in the buffer KB BUFFER that has been processed with internal dakuten, handakuten processing, romaji kana conversion processing, half-width processing, and decimal processing. Batsuhua KB
Of the data stored in BUFFER, the length of data given by WORD4 of KB BUFFER is truly valid data.

In this embodiment, the voiced mark, half-voiced mark processing, Romaji-kana conversion processing, half-width processing, part of the decimal processing, etc. are executed by the keyboard KB input processing routine described later, and the results are stored in the buffer KB BUFFER and transferred 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, such as half-width processing, can be
It is also possible to adopt a configuration in which various processing routines that require input data from the keyboard KB, other than the processing routines, perform half-width processing. Said 4
The same can be said about seed treatment. The gist of the present invention will not be compromised if even 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.

bit0 Half-width = 1, full-width = 0 bit1~7 JIS CODE 1st BYTE bit8 REFRESH In MEMORY, low brightness display = 1, normal brightness display = 0 In KB BUFFER, characters that make up Roman characters = 1, independent characters = 0 DATA BUFFER , in KB READ BUFFER NOT USED bit9~15 JIS CODE 2nd BYTE <Note> When full-width: JIS CODE 1st BYTE and JIS CODE 1st BYTE
Represents JIS Kanji code (14bit) with 2BYTE.
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 CODE 1st BYTE
Two characters of JIS code (7bit) are expressed in 2BYTE.

That is, 1W full width character (normal size character) 1
Represents a letter or two half-width letters. bit0
to distinguish between half-width and full-width characters. For full width, bits 1 to 7 are the 1st BYTE of the JIS Kanji code, bits 9 to 7
The 2nd BYTE of JIS Kanji code is stored in 15.
For half-width, one character of 7bitJIS CODE in bits 1 to 7,
One other character is assigned to bits 9 to 15.

Bit8 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
Request WORD 0 (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
is entered. In reality, the KB BUFFER READ processing routine and KB BUFFER LOOK processing routine process the valid data (specified by KB BUFFER WORD4) stored in the buffer KB BUFFER.
will be moved to the buffer KB READ BUFFER.

Figure 4 shows the format of KB READ BUFFER.

In the same figure, WORD0 READ or LOOK request DATA
LENGTH WORD1 DATA that was actually READ or LOOKed
LENGTH WORD2~4 NOT USED WORD5~20 READ or LOOK data.
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, bit8 is not used.

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

The codes such as characters stored in the memory CRT REFRESH MEMORY are transferred to the CRT patterned by the CRT controller CRT CONT, which will be described later.
displayed on the 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. be. 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. Memory CRT REFRESH MEMORY
The format of the data stored in the buffer is
The only difference from the format of data stored in KB BUFFER is the following points. That is, bit8=
When it is 1, it is displayed in low brightness on CRT, and bit8=0
When , the image is displayed at normal brightness on the CRT. This control is performed by the CRT controller CRT CONT.

The 8th line of CRT REFRESH MEMORY is an area for displaying the contents of the buffer KB BUFFER, and the 1st to 7th 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 CRTC 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. bti1 to bti7 of the output data from the word memory register REG and
bti9 to 15 specify the character and control circuit
The ROW address signal from the CRT causes the character to be
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 input to the half-width character generator CG, respectively, and a horizontal line of each corresponding character pattern is output in the same way as the full-width character generator CG. be done. 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.

Selector SL is controlled by output bit0 of temporary storage register REG. That is, bit0=1
When bit = 0, output data from the half-width character generator CG is selected, and when bit = 0, output data from the full-width character generator CG is selected. 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 bit8 output from 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
By being controlled by CONT,
Displays character information stored in memory CRT REFRESH MEMORY.

display device CRT, CRT controller CRT
Send a partical 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 receives VIDEO from the control circuit CRT.
Outputs information.

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

In this embodiment, the format of data stored in the buffer KB BUFFER is determined as shown in FIG.

RKCT is a romaji-kana conversion table, which is a conversion table for converting romaji character strings into 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 to voiced or handakuten, but includes information on voiced and handakuten in character codes.

RAM is a random access memory used for temporary storage of various data. The memory RAM contains Roman flags FG, half-width flags HWFG, decimal flags DECIMAL FG, which are used by the microprocessor CPU (described later) during processing.
Shift register SR, internal code register IREG,
Includes packing register PREG, 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 theoretical 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, initialization processing shown in FIG. 11 is first executed. The details of each step in this flow are shown below.

0.1 KB INT (abbreviation for INTERRUPT) MASK ON 0.2 KB Put all NULL codes in BUFFER. (Clear all to 0) 0.3 Insert all space codes into CRT REFRESH MEMORY.

0.4 KB INT MASK OFF 0.5 JUMP to MAIN processing 1 or 2 KB INT MASK at step 0.1 as described above
Turn on 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.

Turn KB INT MASK OFF at step 0.4, and jump to MAIN processing 1 or 2 at step 0.5.

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 WORD 0
Set READ request DATA LENGTH.

1.2 KB BUFFER READ processing 1.3 KB READ BUFFER WORD1 (actually
Is READ DATA LENGTH) 0? 1.4 Execution of various processes according to input data As mentioned above, in step 1.1, in order to read the data stored in KB BUFFER,
Read request to WORD 0 of READ BUFFER
Set DATA LENGTH. next step
In 1.2, read the valid data (specified by WORD4 of KB BUFFER) stored in KB BUFFER and move it to the buffer KB READ BUFFER.

DATA LENGTH to be transferred is Batshua KB
Specified by WORD0 of READ BUFFER.
Once the transfer is complete, transfer the data to Batsuhua KB.
Remove from BUFFER.

KB from KB BUFFER in next step 1.3
LENGTH of data moved to READ BUFFER
Check whether is 0 or not. If it is 0, repeat step 1.2; if not, go to step 1.4. In step 1.4, various processes are executed according to the input data.

The specific contents 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 BUFFER READ processing. The contents of each step are shown below.

1.2.1 KB INT MASK ON 1.2.2 KB READ from WORD4 of KB BUFFER (DATA LENGTH after DECIMAL processing)
Is WORD0 of BUFFER larger? 1.2.3 TDL←=WORD4 of BUFFER 1.2.4 TDL←=KB READ BUFFER WORD0 1.2.5 Read the DATA in KB BUFFER by the value of TDL
Move to KB READ BUFFER.

1.2.6 Set the TDL value in KB READ BUFFER WORD1.

1.2.7 KB BUFFER WORD From values 0 to 4
Decrease the value of TDL.

1.2.8 Align all contents of KB BUFFER WORD5 to 20 to the left by the value of TDL. (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 As described above, in step 1.2.1, KB INT
Turn on MASIC and set KB BUFFER WORD4 (enabled) in step 1.2.2.
DATA LENGTH) from KB READ BUFFER
Determine whether WORD0 (request DATA LENGTH) is larger.

If larger, proceed to step 1.2.3 If smaller, proceed to step 1.2.4 KB READ BUFFER in step 1.2.3
Set to the value of WORD0. Proceed to step 1.2.5 Transfer TDL to KB BUFFER in step 1.2.4
Set to the value of WORD0. Proceed to step 1.2.5. KB BUFFER by TDL value in step 1.2.5
Move the data in KB READ BUFFER.

KB READ BUFFER in step 1.2.6
Set the TDL value in WORD1.

In step 1.2.7, subtract the value of TDL from the value of KB BUFFER WORD0~4.

From the DATA area of KB BUFFER in step 1.2.8
Delete the beginning of the TDL value and align the rest to the left.

1.2.9 KB BUFFER DISPLAY processing (3.13)
(Data in KB BUFFER is transferred to CRT)
DISPLAY) 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. On the other hand, 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.1 Set LOOK request DATA LENGTH in KB READ BUFFER WORD1.

2.2 KB BUFFER LOOK processing 2.3 Is the LOOK data data that can be processed? 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 step 2.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 step 2.2, move the valid data stored in KB BUFFER to buffer KB READ BUFFER.The DATA LENGHT to be moved is KB READ.
Specified in WORD0 of BUFFER. Even after the transfer is complete, the data is not removed from the KB BUFFER. In the next step 2.3, KB
Check whether the data entered in READ BUFFER can be processed.

If it can be processed, proceed to step 2.4.

If processing is not possible, repeat step 2.2.

KB BUFFER READ processing (1.2) in step 2.4
and remove the data to be processed from the buffer KB BUFFER.

Various processes are executed according to the data read into the KB READ BUFFER in step 2.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 step 2.3, we will
Check whether input from KB is finished,
Once completed, kana-kanji conversion processing is performed in step 2.5.

FIG. 16 shows details of the KB BUFFER LOOK process in step 2.2 above. The contents of this flow are shown below.

2.2.1 KB INT MASK ON 2.2.2 KB READ from KB BUFFER WORD4 (DATA LENGTH after DECIMAL processing)
Is BUFFER WORD0 larger? 2.2.3 TDL=KB BUFFER WORD4 2.2.4 DATA in KB BUFFER by TDL value
Move to KB READ BUFFER2.2.6 TDL to WORD1 of KB READ BUFFER
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.

Step 2.2.1 of the KB BUFFER LOOK process is
Same as 1.2.1, Step 2.2.2 same as 1.2.2, Step 2.2.3 same as 1.2.3, Step 2.2.4 same as 1.2.4, Step 2.2.5 same as 1.2.5, step
Step 2.2.6 is the same as 1.2.6 and step 2.2.7 is the same as 1.2.10.

MAIN2 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 Input DATA from 3.2 KB.

3.3 FG processing (setting flags, etc.) 3.4 Is it valid data? 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 write processing 3.9 Dakuten, handakuten processing 3.10 Roman time kana conversion processing 3.11 Half width processing 3.12 DECIMAL processing 3.13 DISPLAY processing 3.14 KB INT MASK OFF KB INT MASK in step 3.1 as above
Turn on and enter data from KB in step 3.2. In the next step 3.3, FG processing (input mode,
It is determined whether the data input in step 3.4 is valid for the change in KB BUFFER (setting shifts, etc.), and if it is valid, proceed to step 3.5, and if invalid, proceed to step 3.14.

Is the data entered in step 3.5 a BS code?
If it is a BS code, proceed to step 3.6. If not, proceed to step 3.7.

Perform BS processing (remove one piece of data from KB BUFFER) in step 3.6, and proceed to step 3.14.

Code conversion processing in step 3.7 (KB
The next step is to convert 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 BUFFER.
KB BUFFER write processing in 3.8 (write converted internal code to buffer KB BUFFER)
Then, in step 3.9, add voiced and semi-voiced marks (KB
Data in BUFFER is processed with voiced and half-voiced marks, and the data is processed with voiced and half-voiced marks.
(Determine LENGHT, ie, KB BUFFER WORD1).

Romaji-kana conversion processing in step 3.10 (KB
Romaji-kana conversion processing is performed on the data in BUFFER, and Romaji-kana conversion processing is completed.
DATA LENGTH i.e. KB BUFFER WORD2
Then, in step 3.11, perform half-width processing (perform half-width processing on the DATA in KB BUFFER, and determine the DATA LENGTH after half-width processing, that is, the value of WORD3 of KB BUFFER). DECIMAL processing (KB
DATA LENGTH i.e. KB BUFFER where DECIMAL processing is performed on the data in BUFFER
determine the value of WORD4) and KB BUFFER
Of the data stored in KB BUFFER WORD4
The DATA LENGTH of the value stored in is truly valid DATA. In step 3.13, DISPLAY processing (displays DATA in KB BUFFER on CRT screen)
DISPLAY). Then in step 3.14
Turn KB INT MASK OFF and 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: Romaji key, Kana key] 3.3.2 Set or reset Romaji input FG 3.3.3 Is the input data a width specification 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: Eidaiki 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 DECIMAL FG already set? 3.3.9 DECIMAL FG SET 3.3.10 Determine input data as valid data.

3.3.11 Determine input data as invalid data.

As mentioned above, if the data input in steps 3.3.1 and 3.3.2 is a mode key, the Roman character flag FG is set or reset depending on whether it is a Roman character key or a Kana key. Next step 3.3.3,
If the data entered in 3.3.4 is a width specification key, the full width flag will be set depending on whether it is a full width key or a kana key.
Set or reset AWFG.

If the data entered in steps 3.3.5 and 3.3.6 is a shift key, the shift register will be changed depending on whether it is an English Daiji shift key, an English decimal number shift key, a Katakana shift key, a Katakana small shift key, a Hiragana shift key, or a Hiragana small shift key. Set the corresponding shift code in SR.

If the data entered in steps 3.3.7 to 3.3.9
If it is a DECIML key, it is a digital flag.
Set DECIMAL FG.

When the data entered in steps 3.3.10 and 3.3.11 is set to the mode key, width specification key, shift key, or digital flag DECIMAL FG.
If the DECIMAL key is pressed, the input data is determined to be invalid data, and if it is any other data, it is determined to be valid data, and the FG processing ends.

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

3.6.1 WORD0≠0 of KB BUFFER? 3.6.2 WORD0 decrement of KB BUFFER 3.6.3 KB BUFFER WORD0≧WORD1? 3.6.4 Decrement WORD1 of KB BUFFER 3.6.5 KB BUFFER WORD0≧WORD2? 3.6.6 WORD decrement of KB BUFFER 3.6.7 KB BUFFER WORD0≧WORD3? 3.6.8 WORD3 decrement of KB BUFFER 3.6.9 KB BUFFER WORD0≧WORD4? 3.6.10 WORD4 decrement of KB BUFFER 3.6.11 DISPLAY processing 3.13 KB in steps 3.6.1 to 3.6.10 as described above
1 data stored there from BUFFER
remove one. For that purpose, KB BUFFER
Decrement WORD0. Also other WORD1~
Even up to WORD4, if there is something greater than WORD0, only that WORD is decremented. In the next step 3.6.11, the KB BUFFER is displayed on the display device CRT and the BS processing is completed.

Next, the code conversion process in step 3.7 will be further explained. FIG. 20 shows the flow, and its contents are shown below.

3.7.1 Code for data input from KB to KB
Refers to the code/internal code conversion table, converts it to an internal code, and stores it in the internal code register.

3.7.2 Is the Romaji input FG set? 3.7.3 Is the current shift state an English Daiji shift or an Alphabetic decimal shift? 3.7.4 Set bit8 of internal code register IRFG to 1.

As mentioned above, convert the KB code of the data input from KB in steps 3.7.1 to 3.7.4 into an internal code using the KB code internal code conversion table,
Write the result to internal code register IREG. 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 process in step 3.8 will be explained. FIG. 21 shows the flow, and the contents of each step are shown below.

3.8.1 KBB (WORD0+1) ← = Internal code register, KB BUFFER [WORD0 value + 1]
Write the value of the internal code register to the DATA location indicated by the address of 3.8.2 KB BUFFER Increment WORD0.

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 WORD0>WORD1? 3.9.3 Is KB BUFFER (WORD0) a voiced mark code (〓) or a handakuten code? 3.9.4 KB BUFFER WROD0≧WORD1+2? 3.9.5 WROD1←=WORD0−1 3.9.6 Is KB BUFFER (KBB) (WORD0) a voiced or handakuten code? 3.9.7 WORD1←=WORD0 3.9.8 WORD0≧WORD1+2? 3.9.9 Dakuten, handakuten table DHT and KBB
(WORD0-1), KBB (WORD0) are changed to JIS Kanji code, and the result is KBB
The value shall be (WORD0-1).

3.9.10 WORD0←=WORD0−1 3.9.11 WORD1←=WORD0 As mentioned above, Roman FG=1 in step 3.9.1
When FG=0, the process advances to step 3.9.2. In other words, when the kana input mode is selected, the process from step 3.9.2 onwards is executed.

KB BUFFER WORD0> 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, the voiced and handakuten processing has been completed for the DATA LENGTH of the value shown in WORD1 of the DATA in the KB BUFFER, 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 data in the data in BUFFER. (Similarly below) If WORD0≧WORD1+2 in step 3.9.4, proceed to step 3.9.5, otherwise proceed to step 3.9.6.

(Here, WORD0 is the 1st W of KB BUFFER.
Point to the eyes. (Similarly below) Here, WORD0≧WORD1+2 corresponds to checking whether there is data in the KB BUFFER that has not been subjected to voiced or semi-voiced mark processing before inputting data from the KB.

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 or 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, the code may change depending on the data input next from KB, and KBB (WORD0) remains a character subject to voiced 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 WORD0. 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 voiced or handakuten target character exists in the buffer KB BUFFER before a voiced 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 are voiced 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 Can the Roman code string up to KBB (WORD2 + 1) KBB (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 (WORD2+
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. Returns at other times.

In step 3.10.3, bit8 of KBB (WORD1) is 1
If so, KBB (WORD1) is the character to be processed for romaji-kana conversion processing, and the process proceeds to step 3.10.4.
Otherwise, proceed to step 3.10.10.

In step 3.10.4, bit8 of KBB (WORD1) = 0
shall be.

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 Romaji 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)
Packing and to KBB (WORD2-1),
Write the result.

3.11.7 WORD0←=WORD0−1 WORD1←=WORD1−1 WORD2←=WORD2−1 WORD3←=WORD2 3.11.8 WORD2≧WORD2 3.11.9 Packing KBB (WORD2−1) and space code and the result KBB (WORD2
−1).

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
The codes up to -1) are packed two codes at a time, and the result is again set to values after KBB (WORD3+1).

3.11.14 DF REG←=WORD2−WORD3−1/2 3.11.15 Space code and KBB (WORD3+
1) - 2 codes from KBB (WORD2-1)
Pack the code one by one and re-pack the results.
The value shall be KBB (WORD3+1) or later.

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.

If DECIMAL FG=1 in step 3.11.3, 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 if 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 no, return.
Next, wait for input from KB.

In step 3.11.6, KBB (WORD2) and KBB
(WORD3) and KBB (WORD2−
1) and write the results.

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. That is, steps 3.11.12 and subsequent steps are performed after the DECIMAL TAB mode ends. 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 3.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
+1) or later.

In step 3.11.14, (WORD2−WORD3−
1) Calculate the value of /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)/
2 and put that 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.

Following the above steps 3.11.6, 3.11.9, 3.11.13,
The packing process performed in 3.11.15 is the second
This will be explained using Figure 5. 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, if the character code to be packed is a space code or period code, bit9
~ “0100000” or “0101110” instead of bit15
use. 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 Is KBB (WORD0) a DECIMAL TAB 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.

KBB (WORD0) in step 3.12.2
If it is a DECIMAL 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 TAB 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. 29 a to 29 f.

A shows an example of processing for the BS (backspace) key, in which the last data “D” in KB BUFFER is deleted, and the KB
BUFFER HEADER section parameter DATA
It can be seen that a portion of LENGTH has been reduced. However, this effect does not extend to WORD2 and beyond.

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

In c, KB in Romaji input
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 Code from KBB(1) to KBB(WORD0) to 8th line 1st of CRT REFRESH MEMORY
Write in order from the digit position, then KBB
(WORD4+1) to KBB (WORD0) is bit8
= 1 and write. (However, WORD4=
3.13.3 CRT REFRESH cursor code
Write to the 8th row [WORD0+1] column 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 WORD0 and WORD4, the values in the buffer KB BUFFER
Effective DATA LENGTH in DATA and exactly
There will be a difference between DATA LENGTH.
Valid data is displayed with normal brightness on the display device CRT. Data that has not yet become valid data will be displayed with low brightness. Therefore, No. 〔WORD4
Memory CRT REFRESH corresponding to data from +1]th data to [WORD0]th data
Set bit8 of data in MEMORY 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 embodiment explained above, the 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 and data that has not yet become valid data were distinguished by changing the display brightness, but other methods of differentiation such as inverted display, blinking display, high-intensity display, etc. are also possible. .

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.

[Effect] As described in detail above, according to the present invention, newly input consonant data is continuously displayed following the kana data string in the same row as the kana data string. It has become possible to provide a character processing method that can be displayed.

[Brief explanation of the drawing]

Figure 1 is a block diagram showing one embodiment of the present invention, Figure 2 is a diagram explaining the buffer KB BUFFER, and Figure 3 is a diagram explaining the memory LRY REFRESH.
Diagram explaining MEMORY, Figure 4 is Batshua KB
A diagram explaining READ 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, and Figure 8 is a diagram explaining the dakuten and half-tone. Figure 9 is a diagram showing a dakuten table, Figure 9 is a diagram showing a Romaji-kana conversion table, Figure 10 is a diagram explaining a CRT controller, Figure 11 is a diagram explaining initialization processing, and Figure 12 is a diagram showing MAIN processing 1. , 13th
The figure shows 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 is a diagram showing KB input processing; Figure 18 is a diagram showing FG processing; Figure 19 is a diagram showing BS processing; Figure 20 is a diagram showing 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 the packing process, Fig. 26 is a diagram explaining half-width packing, Fig. 27 is a diagram explaining half-width packing (if there is space),
Figure 28 is a diagram showing DECIMAL processing, Figure 29a
~f is a diagram showing data movement, and Figure 30 is
FIG. 3 is a diagram showing DISPLAY processing. RAM...memory, ROM...control memory,
CPU...microprocessor, CRT...display device.

Claims (1)

[Scope of Claims] 1. In a Roman character input state in which a Japanese sentence is input by inputting English characters (representing consonants or vowels) forming Roman characters, consonant data and vowels of the English character data that are sequentially input. Immediately converting the data set into kana data corresponding to the Roman alphabet spelling based on the input of the vowel data, and displaying the kana data string while the converted kana data is displayed as a kana data string. In the same line as the row in which the newly input consonant data is not converted to kana data corresponding to the Roman alphabet spelling, and continues from the displayed kana data string, Display it continuously, and then based on the newly input vowel data,
Immediately convert it into kana data corresponding to the romaji spelling, and add the kana data obtained by the conversion to the newly input consonant data at the position where the newly input consonant data is displayed. A character processing method characterized by performing control so that a substitute display is performed.