JPS63219059A - Character processor - Google Patents

Abstract

PURPOSE:To smoothly input characters without moving his eyes on a display screen by successively displaying inputted first character data after second character data which have previously inputted and converted. CONSTITUTION:Space codes are filled in the position equivalent to eighth line of a CRT REFRESH MEMORY. If data in a KB buffer (KBB) are shifted to the position equivalent to the eighth line of the CRM and if there is a difference between the values of WORD 0 and 4, it is assumed that there is difference between the effective data length and total data length in data in the KBB. Effective data execute normal luminance display and data which have not turned into effective data execute low luminance display. Consequently, data bit 8 in the CRM corresponding to (WORD4+1) numbered data to WORD 0- numbered data is set to '1'. A cursor code is written in the position of (WORD 0+1)-numbered digit in eighth line in the CRM, and the position of data to be inputted from the keyboard is informed to a person for inputting.

Description

Detailed Description of the Invention [Industrial Application Field] The present invention is directed to inputting first character data, displaying the inputted first character data, and displaying the displayed first character data as the first character data. The present invention relates to a character processing device capable of converting into character data of 2 characters and displaying the data.

[Prior Art] Conventionally, in this type of device, input first character data is displayed in a specific area of a display, and data converted into second character data is displayed in a document display area of the display. It was displayed.

[Problems to be Solved by the Invention] However, in this case, when the first character data manually entered is converted into second character data, where in the display area of the display device is displayed is There is no choice but to refer to the cursor, etc., and for this reason it is a display device. There was a problem in that it was necessary to move the line of sight on the display screen, which hindered smooth manual work.

[Means for Solving the Problem] In order to solve this problem, the present invention displays the first character data input from the input means following the second character data displayed on the display means. It comprises display control means.

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.

FIG. 6 shows the keyboard KB in more detail. The arrangement of the letter keys is a slightly modified version of the so-called JIS keyboard. The main change is the configuration of the shift key. That is, the keyboard KB has a hiragana shift key and a hiragana small shift key added to enable hiragana input.

There is a DECIMAL key in the function key group.

There is a food key, a hand key, a romaji key, and a kana key.

Of these, the Romaji key and Kana key are keys that determine the input mode for inputting characters from the group of character keys on the keyboard KB.By pressing the Romaji key, you can input Japanese sentences in the Romaji reading. By pressing the kana key, it becomes possible to input Japanese sentences in kana.

The DECIMAL key is a key for instructing decimal tab input. The food key is a key that instructs you to input characters in normal size, and the hand key is half the normal size (horizontal direction).
This is a key for instructing character input (however, only specific characters such as alphanumeric characters).

When one key from a group of character keys and a group of function keys is pressed, an interactive signal is given to a microprocessor CPU (described later) through a control bus CB (described later). Further, a microprocessor CPU (to be described later) can know the code of a pressed key through an encoder provided in the keyboard KB through a data bus DB (to 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.

The interconnect provided from the keyboard KB to the microprocessor CPU can be masked by the microprocessor CPU. However, depending on the CPU, the keyboard K
Even if the B-interface is masked, if the keyboard KB-interface is unmasked by the microprocessor CPU, the KB-interface that occurred while it was masked will not be lost, and the operation of the KB-interface will function normally. .

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

When a key on the keyboard KB is pressed, the keyboard KB
An input processing routine is activated, and input data from the keyboard KB is stored in the buffer KB BUFFER.

Further, 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 buffer KB BUFFER are shown in FIG. Total 21W (W: Ward, IW-16bi
t). A specific definition of each W is shown below.

All DATA stored in WORDOKB BUFFER LENGTH LENGTH of all DATA stored in WORDI KB BUFFER LENGTH of DATA for which cloudy and semi-dark points have been processed WORD2 To all data stored in KB BUFFER All DATA stored in LENGTH WORD 3 K/B BUFFER of DATA for which Romaji-kana conversion has been completed LENGTH WORD 4 of DATA for which intermediate processing has been completed LENGTH WORD 4 KB All DATA stored in BUFFER LENGTH WORD of DATA for which DECIMAL processing has been completed LENGTH WORD 5 to 20 KB An area where input data is stored.In the first 5W, characteristics of the data stored in the buffer KB BUFFER are written. After the 6th W,
Input data is actually stored.

The LENGTH of the data stored in the buffer KB BUFFER is written in WORDO (first W) of the buffer KB BUFFER. However, these data cannot 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 "ka" data changes depending on the next key pressed.

In other words, the next time the “″” (voiced mark) key is pressed, “ga” 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 Roman alphabet mode, the first keystroke, such as "Y", is not confirmed as data, but the next keystroke, for example, "A".
The data “ya” is confirmed only after the key is pressed.

Also, for example, when performing manual input, the first keystroke, such as "l", is not yet confirmed as data, but the next keystroke, for example, "2", which is confirmed for the first time, is "12". ” is the data. This is because, in this embodiment, a processing method is adopted in which characters of stroke 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, not all of the data specified by DATA LENGTH stored in WORDO of the buffer KB BUFFER is valid data.

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

WORD of buffer KB BUFFER L of all data stored in buffer KB BUFFEH
ENGTH KB BUFFERWORD 1 LE of the data that has been processed for the cloudy point and half-voiced point of all data stored in the buffer KB BUFFER
NGTH KB BUFFERWORD 2 LENGTHKB BUFFERW of data that has been processed with cloudy point, half-voiced point processing, and romaji kana conversion processing for all data stored in buffer KB BUFFER
ORD 3 All data stored in the buffer KB BUFFER G) The cloudy point, half-voiced point processing, Romaji-kana conversion processing, and stroke processing have been completed. t, ) cloudy point, half voiced point processing, romaji kana conversion processing of all data,
Stroke processing, decimal processing power (LE of data being made)
Buffer KB BUFFE of the data stored in the sofa KB BUFFER
If the length of the data given by WORD 4 of R is 1, it is valid data.

In this embodiment, part of the voiced-tone, half-voiced-tone processing, romaji-kana conversion processing, stroke processing, decimal processing, etc. will be executed in the keyboard KB input processing routine described later, and the results will be stored in the buffer KB BUFFER.
Various processing routines that require input data from the computer are configured to utilize data resulting from the execution of the four types of processing.

Therefore, in other embodiments, for example, stroke processing may be removed from the KB processing routine, and various processing routines that require input data from the keyboard KB may perform the stroke processing. The same can be said of the four types of processing described above. The present invention provides K even if one of the four types of processing
If it is executed in the B input processing routine, it does not deviate from the spirit of the invention.

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

bito half-width = 1. Full-width = Obit 1-7
JIS C0DE 1st BYTEb it 8
In REFRESH MEMORY, low brightness display = 1. Normal brightness display = 0 In KB BUFFER, characters that make up the Roman alphabet = 1° Independent characters = 0, DATA BUFFER, KB READ BUFF
NOT USED in ER bits 9 to 15 JIS C0DE 2nd BYTE (Note) When full-width: JIS C0DE 1st BYTE and JIS
JIS Kanji code (14bit) in C0DE 2nd BYTE
) to express. It is assumed that the FUNCTION code is also assigned an empty area in the JIS Kanji code table.

Half-width: JIS C0DE 1st BYTE and JIS
C0DE 2nd BYTE is JIS code (7bit) 2
characters are expressed.

That is, lW represents one character in the eclipse (normal size characters) or two characters in the stroke. Bito distinguishes between stroke characters and Zenchu characters. In the case of full width, the first BYTE of the JIS Kanji code is stored in bits 1 to 7, and the second BYTE of the JIS Kanji code is stored in bits 9 to 15.

In case of stroke, 7 bit JIS C0DE for bits 1 to 7
One other character is assigned to bits 9 to 15.

Bit 8 indicates that the code is a Roman alphabet component, for example “T
” (component of the Roman alphabet “TA”), it becomes 1 to identify it.

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 21 W (I W -16 bit). The various processing routines are in the buffer KB READ
D to request WORD of BUFFER (1st W)
Set ATA LENGTH and KB BU (described later)
FFERREAD processing routine or KB BU
If you want to start the FFERLOOK processing routine, KB
The requested data can be obtained from WORDs 5 to 20 of the READ BUFFER. At that time, buffer KB
Actually write W in WORDI of READ BUFFER
DATA LENGT written in ORD5-20
H is entered. In fact, the KBBUFFERREAD and KB BUFFERLOOK processing routines will move the valid data (defined by KB BUFFERWORD4) stored in the buffer KB BUFFER to the buffer KB READ BUFFER.

FIG. 4 shows the format of KB READ BUFFER.

In the same figure, WORDORED or LOOK request DATAENGT
H WORD 1 Actual READ or LOOKL/DATAENGTH WORD 2~4 NOT US E DWO
RD 5~20 READ or LOOK L/data, buffer KB READ BUFFER W
The format of the data stored in ORD5-20 differs from the format of data stored in WORD5-20 of the buffer KB BUFFER only in the following points.

That is, bit8 is not used.

CRT REFRESH MEMORY is 8X1 memory
It has a capacity of 6W (l W −16bit).

Memo! , I CRT REFRESH MEMORY are patterned by a CRT controller CRT CONT, which will be described later, and displayed on the CRT screen.

The format of the memory CRT REFRESH MEMORY consists of 8 rows 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 a K
This is the area for monitor display of B BUFFER. This memory can store a character code of 8 vertical lines and 16 horizontal digits corresponding to a CRT screen to be described later. memory CRT
The format of data stored in REFRESH MEMORY differs from the format of data stored in buffer KBBUFER only in the following points.

That is, when bit8=1, it is displayed on the CRT with low brightness, and when bit8=o, it is displayed on the CRT with normal brightness. This control is a CRT controller CRT
This is done by C0NT.

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 example,
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 C0NT is memory CRT REFRESH
This is a CRT controller that controls character and other code information stored in MEMORY to be patterned and displayed on the CRT screen. CRT controller CRT
A detailed diagram of C0NT is shown in FIG. The area surrounded by the dashed line in FIG. 10 is the CRT C0NT. The control circuit CRTC is the memory CRT REFRESHMEMO
The address of the character code to be displayed is given to RY, and the character code is extracted. The retrieved character code information is temporarily stored in the register REG, and then sent to the character generator CG while eating and the character generator C in hand.
GII, access the stroke character generator CGm. Kanayama's character patterns are stored in the Zenchu character generator CG. Temporary memory register REG
Bits 1 to 7 and bits 9 to 15 of the output data from
The character is specified and the RO from the control circuit CRTC is
The W address signal specifies the ROW address of the character, and outputs a horizontal row pattern of the corresponding ROW of the corresponding character.

Stroke character generators CGI and II store stroke character patterns. The stroke character generator CGI and IF are temporarily stored and registered in the register REG.
bits 1 to 7. Bits 9 to 15 are input, and a horizontal row of character patterns corresponding to each character pattern is outputted in the same manner as the Zenchu character generator CG. The selection between the output data from the full-time character generator CG and the output data from the stroke character generators CGI and If is performed by the selector SL.

The selector SL is controlled by the temporarily stored register REG output bito! ::evening. That is, bito=1
When , the output data from the stroke character generators CGI and II are selected, and when bitO=o, the output data from the stroke character generator CG is selected. The data output from the selected selector SL is converted into serial data via a parallel-to-serial converter PS and output to a display device CRT. Data bjt8 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 a particle timing signal and a horizontal timing signal from the display device CRT, and sequentially controls the memory CRT REFRESH MEMOR.
Change the access address to Y, and also change the Zenchu character generator CG, stroke character generator CGI, n
Change the ROW address signal for the display device CRT.
Displays characters in .

CRTl as a display device CRT controller CRT C
Under the control of 0NT, the memory CRT REFRESHMEMORY1 displays stored character information.

The display device CRT sends a particle timing signal and a horizontal timing signal to the CRT controller C0NT.
Adjust the RTCONT timing. Also, display device C
RT outputs VIDEO information from the control circuit CRTC.

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, the buffer DATA BUFFER
The format of the data stored in the system was determined as shown in Figure 5.

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 a KB code/internal code conversion table, which is a table for converting output data from the keyboard KB into an internal code (FIG. 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/handakuten table, as shown in Figure 8 (,
Give one code to voiced or handakuten.

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. In the memory RAM, a Roman flag FG and a hand flag HWFG are used by a microprocessor CPU (described later) during processing.

Decimal flag DECIMAL FG, shift register SR, internal code register IREG, backing register PREG, register DF, register TDL.

Includes 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 logical judgments.

address bus AB and data bus DB, which will be described later.

Keyboard KB via control bus CB.

Buffer KB BUFFER, memory CRT RE
FRESH MEMORY, buffer DATA BUF
FER, buffer KB READ BUFFER,
Data can be read and written to the Romaji-kana conversion table, RKCT, KB code internal code conversion table ICT, memory RAM, and control memory ROM.

AB is an address bus that transfers a signal indicating a control target. CB is a control bus that applies control signals to various control targets. The DB transfers various DATA via 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, I KB I・NT (abbreviation for INTERRUPT) MASKN O, 2KB Put all NULL codes in BUFFER. (Clear all to 0) 0.3 CRT REFRESHMEMORYi:
Enter the space code.

0.4 KB INT MASK 0FF0.
5 JUMP to MAIN processing 1 or 2 K B I N T M A S in step 0.1 as described above
KONL clears 13 BUFFER in step 0.2. (Set to ALLO) Next, in step 0.3, memory CRT REFRESH
Enter all space codes in MEMORY.

KB INT MASK 0F in step 0.4
FL, go to MAIN processing 1 or 2 at step 0.5 J U
MP.

IN processing 1 or 2 to M shows 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, the M a i process 1 shown in FIG. 12. The contents of each step of the flow shown in FIG. 12 are shown below.

1, l KB READ BUFFER WOR
Set READ request DATA LENGTH in DO.

1, 2 K B B U F F E RRE
A n processing 1.3 KB READ BUFFE
R's WORDI (Actually READL, DATA L
Is ENGTH) 0? 1.4 Execution of various processes according to human data As mentioned above, in step 1.1 K B B
WORD of KB READBUFFER to read data stored in UFFER
Set read request DATALENGTH to O.

In the next step 1.2, read the valid data (defined by WORD4 of KB BUFFER) stored in KBBUFFEH and write it to the buffer KBREAD BUFF.
Transfer to ER.

DATA LENGTH to be transferred is buffer KB R
It is specified by WORDO of EADBUFFER. Once the data has been transferred, save the data to the buffer KB BUFFE.
Remove from R.

In the next step 1.3, from KB BUFFER to KB R
Check whether LENGTH of the data transferred to EADBUFFER is O. If 0, step 1
．． Repeat step 2. If not O, proceed 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 a detailed flow of the above-mentioned KB BUFFERREAD process. The contents of each step are shown below.

1.2. IKB INT MASK ONl
, 2.2 KB BUFFER's WORD4 (DEC
KBR from DATA LENGTH after IMAL processing
Is the EAD BUFFER WORDO larger? 1.2.3 TDL:BUFFER WORD41.
2.4 TDL”:KB READ BUFFERW
ORDOl, 2.5 TDL value only KB BUFF
KB READ BUFFER of DATA in ER
Move to.

1.2.6 KB READ BUFFERWORD
Set the TDL value to I.

1.2.7 Subtract the value of TDL from the value of KB BUFFERWORDO~4.

1.2.8 KB BUFFERWORD5~20
Align all contents 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 KB INT MASK OFF in step 1.2.1 as above
ASICONL, KB BUFFERWORD4 in step 1.2.2
KB READ from (effective DATA LENGTH)
BUFFERWORDO (request DATA LENGTH
) is larger.

If larger, proceed to step 1.2.3 If smaller, proceed to step 1.2.4 TDL in step 1.2.3 KB READ B
Set to the value of UFERWORDO. Step l.

Proceed to 2.5 Step 1.2.4 TDL to KB BUFFERW
Set to the value of ORDO. Proceed to steps 1, 2.5. KBBUFFE by the value of TDL in step 1.2.5
Move the data in H to KB READ BUFFER.

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

KB BUFFERWORD in step 1.2.7
Subtract the value of TDL from the value of O~4.

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

1.2.9 KB BUFFER DISPLAY processing (3, 13) (Data in KB BUFFER is
DISPLAY on RT) 1, 2.10 K B I N T M A S
K OF F.

Figure 15 shows the buffer KB BUFFER and buffer KB R in the KB BUFFERREAD process.
This is an example of EADBUFFER. Buffer KB BU
Buffer KB for 3 character DAT・A READ request from FFER Buffer KB R from BUFFER
You can see that three characters are moved to EAD BUFFER.

Also, buffer KB BUFFER and buffer KB
It can be seen that the HEADER section parameters of READBUFFER also change accordingly.

MAINI processing is performed as described above. MAI on the other hand
The processing of N2 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. Set LOOK request DATA LENGTH in I KB READ BUFFERWORDI.

2.2 KB BUFFERLOOK processing 2.3
Is it possible to process the LOOK data? Is it ATA? 2.4
KB BUFFERREAD processing (1, 2)2.
5 Execution of various processes according to human data As shown in the flow above, use KBREAD to know the contents of the data stored in KB
LENG of data you want to know in WORD of BUFFER
Enter TH.

In step 2.2, the valid data stored in KB BUFFER is transferred to the buffer KB READ BUF.
DATA LENGTH to be transferred to FER is K
Specified in WORDO of B READBUFFER. Even after the transfer is completed, the data is not removed from the buffer KB BUFFER. In the next step 2.3,
The data entered in KB READBUFFER is checked to see if it can be processed.

If processing is possible, proceed to step 2.4.

If processing is not possible, repeat step 2.2.

In step 2.4, KB BUFFERREAD processing (1
, 2) 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, it is checked whether the input of the - clause from the KB has been completed, and if it has been completed, step 2.
．． In step 5, kana-kanji conversion processing is performed.

KB BUFFERLOOK from step 2.2 above
Details of the processing are shown in FIG. The contents of this flow are shown below.

2.2. IKB INT MASK OH2
,2,2KB BUFFERWORD4(DECIMA
KBREAD from DATA LENGTH after L processing
Is BUFFERWORDO larger? 2.2.3 TDL,,=KB BUFFERWO
RD42.2.4 KB BUFFE only for TDL value
Move DATA in R to KB READ BUFFER 2.2.6 KB READ BUFFER
Set the value of TDL in WORDI of 2, 2.7 KB INT MASK OFF
Each of the above steps is as shown below.
Roughly the same as RREAD processing, KB BUFFE
The difference from RREAD processing is KB BUFFERLOO
The point is that the K processing has no effect on the buffer KB BUFFEH.

Step 2.2 of KB BUFFERLOOK processing.
1 is the same as 1.2.1, step 2.2.2 is the same as 1.2.
2, step 2.2.3 is the same as 1.2.3, step 2,2゜4 is the same as 1.2.4, step 2.2
．． 5 is the same as 1.2.5, step 2.2.6 is 1.2
．． Step 2.2.7 is the same as 1.2.10.

The MAIN2 process 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, I KB INT MASK OH3,2
Input DATA from KB.

3.3 FG processing (setting flags, etc.) 3.4
Is it valid data? 3.5 Is human power data a BS code? 3.6 B
S processing (processing to remove data from KB BUFFER) 3.7 Code conversion processing 3.8 KB BUFFER writing processing 3.9 Voiced and half-voiced sound processing 3.10 Romaji kana conversion processing 3.11 Stroke processing 3.12 DECIMAL Processing 3.13 DISPLAY Processing 3.14 KB INT MASK OFF KB INT MAS in step 3.1 as described above
KON, and in step 3.2 manually input the data from the KB. In the next step 3.3, FG processing (input mode).

(set shifts, etc.) Determine whether the data input in step 3.4 is valid data for the change in KB BUFFER, and if it is valid, proceed to step 3.5; if invalid, proceed to step 3.5. Proceed to 3.14.

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

In step 3.6, BS processing (remove one data item from KB BUFFER) is performed, and the process proceeds to step 3.14.゛In step 3.7, code conversion processing (KBBU
KB in preparation for loading one piece of data into FFEH
Convert the KB code of the data input from BU into an internal code for internal processing) In the next step 3.8
Perform FFER write processing (write the converted internal code to the buffer KB BUFFER) and proceed to step 3.
．． 9, the data in KB BUFFER is processed with voiced and half-voiced points, and the DATA LENGTH that has been processed with voiced and half-voiced points, that is, KBBUFER.
(Determine WORDI).

Step 3. Romaji-kana conversion processing with lO (K BBU
Perform Romaji-kana conversion processing on the data in FFER, and create DATA LE that has undergone Romaji-kana conversion processing.
NGTH, that is, determine KB BUFFERWORD2), and in step 3.11, process the stroke (KBBUFF
Stroke processing is performed on DATA in ER, and DATA LENGTH, that is, KBBUFFE, for which stroke processing has been completed.
(Determine the value of WORD3 of R).

In step 3.12, DECIMAL processing (KB BU
DATA LENGTH i.e. KB BUFFE where DECIMAL processing has been performed on the data in FFER
determine the value of RWORD4) and set KB BUFF
KB BUFFERWO of data stored in ER
If the value DATA LENGTH stored in RD4 is truly valid, it becomes ATA. DISP in step 3.13
Perform LAY processing (DISPLAY the DATA in KBBUFFER on the CR7 screen). Next step 3.
At step 14, KB INTMASK is turned OFF and the process ends.

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 manually generated 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 manually generated data a width specified key code? [Width specification key: Kaneko key, Stroke key] 3.3.4 Set or reset Kaneko AWFG 3.
3.5 Is the manually generated DATA a shift key code? 3.3.7 Is the manually generated data a DECIMAL key? 3.3.8 Is DECIMAL FG already set? 3.3.9 DECIMAL FG 5ET3.
3.10 Determine that manually generated data is valid data.

3.3.11 Determine that manually generated data is invalid data.

As shown above, if the data input in step 3.3.1.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゜3.3.
If the data input in step 4 is a width designation key, the full width flag AWFG is set or reset depending on whether it is a Kanayama key or a Kana key.

Step 3.3.5. 3. If the data input in 3.6 is a shift key, enter the corresponding shift code in the shift register SR depending on whether it is an English shift key, an alphanumeric shift key, a katakana shift key, a katakana small shift key, a hiragana shift key, or a hiragana small shift key. Set.

The data entered in steps 3.3.7 to 3.3.9 is
If it is an ECIMAL key, it is a digital flag DEC.
Set IMAL FG.

If the data input in step 3.3.10.3.3.11 was a mode key, width specification key, shift key, or DECIMAL key when the digital flag DECIMAL FG was set, the input data will be invalidated. If it is other data, it is determined to be valid data and the FG processing is terminated.

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. I KB BUFFER WORDO≠0?
3.6.2 KB BUFFER WORD Decrement 3.6.3 KB BUFFER WORDO≧WORDl? 3.6,4 KB BUFFER WORDI decrement 3.6.5 KB BUFFER WORDO≧WORD2? 3.6.6 KB BUFFER WORD2 decrement 3.6,7 KB BUFFER WORDO≧WORD3? 3.6.8 KB BUFFER WORD3 decrement 3.6.9 KB BUFFER WORDO≧WORD4? 3.6,10 WORD4 decrement of KB BUFFER 3.6.11 DISPLAY processing 3.13 Steps 3.6.1 to 3.6.10 as described above
Remove one piece of data stored in UFFER. To do this, KB BUFFER's WORDO is decremented. Also other W ORD 1- W OR
Even up to D4, if there is a word greater than WORD, 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 of data input from KB
Refers to the B 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 English-decimal shift? 3.7.4 Bit 8 of internal code register IRFG
Set to 1.

As described above, convert the KB code of the data input from the KB in steps 3.7.1 to 3.7.4 into an internal code using the KB code internal code conversion table, and write the result to the internal code register IREG. .

At that time, when in Roman alphabet input mode and in Katakana shift, Katakana small shift, or Hiragana small shift, bit 8 of the data written to internal code register IREG
is set to 1 to indicate that the data is a character constituting the Roman alphabet, and the code conversion process ends.

Next, 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 (WORDO+1); Write the value of the internal code register to the DATA location indicated by the address [WORDO value + 1] of the internal code register, that is, KB BUFFER. 3.8.2 Increment KB BUFFERWORDO.

As mentioned above, the character code in the internal code register is added to the end of the DATA column in the DATA area of KB BUFFER, and the WORDI (DAT
ALENGTH) and increment KB BUF
Finish the FER write process.

Next, details of the voiced and handakuten 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 WORDO>WORDI? 3.9
．． 3 Is KB BUFFER (WORDO) a voiced mark code (゛) or a handakuten code? 3.9.4 KB BUFFER WORDO≧WORD1+27 3.9.5 WORDI::WORDO-13,9,
6KB BUFFER (hereinafter referred to as KBB)' (WORDO
) is a voiced or handakuten code? 3.9.7 WORDI = WORDO3,9,
8WORDO≧WORD1+2'? 3.9.9 KBB (WORDO-
1), Change the two codes of KBB (WORDO) to JIS Kanji code, and convert the result to KBB (WORDO-
1).

3.9. IOWORDO:WORDO-13,9,11
WORD! ': WORDO as described above (step 3.9
．． 1, when Romaji FG=1, proceed to step 3.9.11, when FG=O, proceed to step 3.9.2, that is, when in kana input mode, the process from step 3.9.2 onwards is executed. .

KB BUFFERWORDO in step 3.9.2
>WORDI, there is a character string to be processed, so proceed to step 3.9.3. That is, WORDO and WORD
The character string sandwiched between I and I is the character string to be processed.

In other words, the DATA in KB BUFFER
DATA LENGT of the value shown in WORDI
Since the voiced and handakuten processing for H has been completed, proceed to step 3.9 to process the other data.
．． Proceed to step 3.

In step 3.9.3, KBB (woRDo) checks whether it is a voiced mark code or a handakuten code. KBB(WORD
If O) is a voiced or handakuten code, proceed to step 3.9.8. Otherwise step 3.9.
Proceed to step 4.

(Here, KBB (WORDO) means KB BU
Indicates the white data RDO-th data in the FFER data. (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, WORDO is the first word of KB BUFFER.
Point to W. (Similarly below) Here, WORDO≧WORD1+2 corresponds to checking whether or not data that has not been subjected to voiced-tone or hand-voiced point processing exists in the KB BUFFER before inputting data from the KB.

In step 3.9.5 WORDll, :WORDO-1
Set the value of In other words, since KBB (WORDO) was not a voiced or handakuten code, KBB (WO
For all codes up to RDO=1), there is no code change due to voiced or handakuten, and these codes are excluded from characters subject to voiced or handakuten.

In step 3.9.6, if KBB (WORDO) is a code that can be voiced or half-voiced, the process returns without changing the value of WORDI. In other words, there is a possibility that the code may change depending on the data input from the KB next.
B (WORDO) remains a voiced and handakuten character. KBB (WORDO) is a voiced mark.

If it is not possible to use a half-voiced mark, use a half-voiced mark for KBB (WORDO).

Proceed to step 3.9.7 to remove it from the handakuten target chord.

In step 3.9.7, set WORDI to the value of WORDO. Then return.

In step 3.9.8, if WORDO≧WORDI+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 the voiced or handakuten code is input from KB, the process proceeds to 3.9.9.

Step 3.9.9 Te, KBB (WORDO-1)
, refer to the 2 codes of KBB (WORDO) for voiced and half-voiced points table DHT and select 16 bits of voiced and half-voiced points.
Change the value to KBB (WORDO-
1) (7) Value.

In step 3.9.10, WORDO is decremented.

Step 3.9.11: Set WORDI to the same value as WORDO, and end 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
WORDI>WORD2?3.10.3 KBB
(WORD1) bit8=1?3.10.4 KB
B (WORDI) (7) bit8=03.10.
5 KBB (WORD2+1) KBB (WOR
Can the Romaji code string up to DI be converted to a Kana code string? (Check by referring to Romaji-kana conversion table RKCT) 3.10.6
KBB(WORDZ+1) to KBB(WORDI
) to convert Romaji code strings to Kana code strings, refer to the Romaji Kana conversion table), and convert the converted results from KBB (WORD2+1) to KBB (WORD
Write in positions up to I).

3.10.7 LEN: Length of Roman code string -
Kana code string length 3.10.8 WORDO:WORDO-LEN3,
lO,9WORDI:WORDI-LEN3.10.1
0 WORD2': WORDI As mentioned above, in step 3.10.1, when Roman FG=1, step 3
, proceed to 10.2. Step 3 when Romaji FG=0
．． Proceed to IQ, IO.

Step 3.10.2 “I?, WORDl>WORD
2, 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, b of KBB (WORDI)
If it8 is 1, KBB (WORDI) is a character to be processed for Romaji-kana conversion processing, and step 3.10.
Proceed to step 4. Otherwise, step 3. Proceed to lO, lO.

In step 3, 10.4, b of KBB (WORDI)
Let it8=0.

In step 3.10.5, Romaji-kana conversion table R
Refer to KCT and from KBB (WORD2+1) to KB
Check whether the Roman code string up to B (WORDI) can be converted into a Kana code string. If the conversion is possible, proceed to step 3.10.6; otherwise, return.

In step 3.10.6, KBB (WORD2+1)
Convert the Romaji code string from
ORD2+1) to KBB (WORDI).

In step 3, 10.7, the difference between the length of the Roman alphabet code string and the length of the Kana code string is set as LEN.

In step 3.10.8, set the value of WORDO to register L.
Decrease by the value of EN.

In step 3.10.9, set the value of WORDI to register L.
Decrease by the value of EN.

In step 3.10.10, set the value of WORD2 to WORD
The value of I is set and the Romaji-kana conversion process ends.

Next, the details of the stroke processing in step 3.11 are shown in Figure 24 (a
) and (b), the contents of each step are shown below.

3.11.1 Stroke flag HW FG=1?3.1
1.2 WORD2>WORD3?3.11.3
DECIMAL FG=1?3.11.4 KBB
Is (WORD2) a character code that can be backed? 3.11.5 WORD2≧WORD3+273.1
1.6 KBB (WORD2-1) and KBB (WOR
D2) and backing, KBB (WORD2-1)
Write the result to .

3.11.7 WORD (1:WORDO-1WOR
DI": WORDl-1 WORD2": WORD2-1 WORD3: WORD2 3.11.8 WORD2≧wORD3+273
．． 11.9 Backing KBB (WORD2-1) and space code and converting the result to KBB (WORD2-1)
D2-1).

3.11. IOWORD3 :WORD23.11.1
1 KBB (WORD2) is DECIMAL TA
B exit code? 3.11.12 Is the value of (WORD2-WORD3) an odd number? 3:11.13 KBB (WORD3+1) ~KB
The codes up to B (WORD2-1) are backed up two codes at a time, and as a result, the values after KBB (WORD3+1) are set again.

3.11.15 Space code and KBB (WO
ml from RD3+1) to KBB (WORD2-1)
- backing the chord two chords at a time, and repeating the result with the K
The value shall be after BB (WORD3+1).

3.11.17 WORD3::WORD3+DF
3.11.18 DF REG:WORD2-WO
RD3-13.11.19 WORDO! :WOR
DO-DFWORDI WORDI-DF WORD2': WORD2-DF As shown above, if the stroke flag HW FG=1 in step 3.11.1, proceed to step 3.11.2. Stroke flag HW If FG=O, step 3.11
．． Proceed to step 10.

In step 3.11.2, if WORD2>WORD3, there is a character string to be manually processed, so step 3.11
．． Proceed to step 3. Otherwise, return.

In step 3.11.3, DECIMAL FG=1
If so, proceed to step 3.11.11 (DECIMAL half-width processing).

If CIMAL in hand FG=O, step 3.11.4
Proceed to (DECIMAL Kanayama processing).

Step 3.11.4 Check whether KBB (WORD2) is a backing-capable character. Backing here refers to converting a character code (one character IW) that should be a stroke character code into a stroke internal code (two characters IW) by combining two characters. In this embodiment, the character codes that can cause strokes are space codes, alphabet codes, numeric codes, and period codes.

If KBB (WORD2) is a backable character code, proceed to step 3.11.5. If no, 3.11
Proceed to °8.

In step 3.11.5, WORD2≧WORD3+2
If so, other than KBB (WORD2), there is already K
If there is a column to be processed in hand in BBUFFER, the process advances to step 3.11.6. If not, return and wait for the next input from KB.

In step 3.11.6, KBB (WORD2) and K
Backing BB (WORD3) and KBB (WO
RD2-1) and its results are written.

The backing method will be described later.

In step 3.11.7, WORDO, WORDI, W
WORD the value of WORD3 that subtracts 1 from the value of ORD2
Set the value to 2. After that, I will return.

In step 3.11.8, WORD2≧WORD3+2
If so, that is, if the stroke 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, KBB (WORD2-1)
and space code, and convert the result to KBB
(WORD2-1).

In step 3.11.10, set the value of WORD3 to WORD
Set to a value of 2.

Step 3.11. l If KBB (WORD2) is the DECIMALTAB exit code, step 3
, 11. Proceed to 12. If not, return. That is, steps 3.11 and 12 are performed after the DECIMAL TAB mode is completed. Here DECIMAL T
The AB 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.

In step 3, 11.13, KBB (WORDa+1
) to KBB (WORD2-1) are backed by two chords at a time, and as a result, KBB (WOR
D3+1) onwards.

In step 3, 11.14, (WORD2-WORD3
-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 (WORDa+1) to KBB (WORD2-1) are backed by two codes at a time, and the resulting codes are set 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, DF the value of WORD3
Increase by the value of REG.

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

In step 3.11.19, WORDO, WORDI.

The value of DF REG is subtracted from each value of WORD2, and the stroke processing is completed. , then step 3.11.6.3.11.9.3 above.
The backing process performed at 11.13 and 3.11.15 will be explained using FIG. 25. This process is for backing 2 units (2W) of the character code to be processed for stroke into an internal code (IW), and the contents of each step are shown below.

4.1 Is the 1st W subject to backing a space code or a period code during an eclipse? 4.2 Set bitl to bit7 of the backing register to 0100000 or 0101110.

4.3 Bitl Nb1t7 of the backing register is set to the value of bits 9 to 15 of the first W to be packed.

4.4 Is the second W subject to backing a space code or a period code during an eclipse? 4.5 Bits 9 to 15 of backing register
is 0100000 or 0101110.

4.6 Bits 9 to 15 of backing register
are the values of bits 9 to 15 of the second W to be backed.

As shown above, in steps 4.1 to 4.6, bits 9 to 15 of the 1st W of the stroke target character are placed in bits 1 to 7 of the backing register, and the second bit of the stroke target character is
Put W no bit 9 to bit 15 into bits 9 to bit 15 of the backing register. After that, bitO of the backing register is set to 1.

However, when the backing target character code is a space code or period code, bit9 to bit1
“0100000” or “010111” instead of 5
0''. Thus, we can obtain the internal code backed in the backing register.

FIGS. 26 and 27 show examples of backing processing, with FIG. 26 showing an example of backing due to stroke, and FIG. 27 also showing an example of backing in hand.

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 (WORDO) is DECIM
Is it an AL TAB exit code? 3.12.3 DECIMAL FG reset 3.
12.4 WORD4: WORD3 As mentioned above, in step 3.12.1, if DECIMALFG=1, proceed to step 3.12.2. If no, step 3.12.
Proceed to step 4.

In step 3.12.2 KBB (WORDO) is converted to DEC
If IMALTAB exit code, step 3.1
Proceed to 2.3. If no, return. That is, DECIMA
KB until L TAB end code is pressed from KB
Data input into the BUFFER in DECIMAL TAB mode cannot be valid data. Here, the DECIMALTAB end code is a non-numeric code.

In step 3.12.3, set DECIMAL FG to O
Make it.

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

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

In (a), an example of processing for the BS (backspace) key is shown.
The last data “D” in R is deleted and the KB
BUFFER) IEADER section parameter DATA
It can be seen that LENGTH is partially reduced.

However, this effect does not extend to WORD2 and later.

In (b), an example of processing for a voiced-tone key is shown. There is no change in the value of WORDO, but WORD2
increases, and subtracts the effective DA of KB BUFFER.
An increase in WORD4 indicating TA LENGTH is also seen.

In (c), KBBUFF in Romaji input
You can see what's going on inside the ER. In this case as well, all DATA
It can be seen that the value of WORD4, which indicates LENGTH, does not change, but the value of WORD4, which indicates effective DATA LENGTH)I, increases.

(d) shows the state of KB BUFFEH when the "F" key is input in the stroke input mode.

(e) shows the state of DECIMAL processing in the meal mode.

(f) shows the DECIMAL processing in the stroke mode. Next, the DISPLAY processing in step 3.13 will be explained with reference to FIG.

The contents of each step are shown below.

3.13. I CRT REFRESH MEMOR
Fill in space codes in all positions corresponding to the 8th line of Y.

3.13.2 KBB (1) ~ KBB (WORD
CRT REFRESHMEMO the code up to O)
Write in order starting from the 8th row, 1st digit of RY, at which time K
BB (WORD4+1) to KBB (WORDO) are converted to bit8=1 and written. (However, WORD4=
(Unnecessary when using WORDO) 3.13.3 CRT cursor code REFR
Write to the [WORDO+1] digit position of the 8th row of ESHMEMORY.

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

In step 3.13.2, the data in KB BUFFER (its length is specified by WORDO) is sent to CRTR.
Move it to the position corresponding to the 8th line of EFRESHMEMORY. At this time, if there is a difference between the values of WORDO and WORD4, the DATA in the buffer KB BUFFER
Valid DATA LENGTH and total (DATAL) in
There will be a difference between ENGTH. Valid data is displayed with normal brightness on the display device CRT. Data that is not yet valid data will be displayed with low brightness. Therefore, from the (WORD4+1Eth data to the (WORD4+1Eth data)
RDO)-th data corresponding to the memory CRT RE
Set bit 8 of the data in FRESH MEMORY to 1.

In step 3.13.3, on the 8th line, next the keyboard K
In order to inform the inputter of the position of the data to be input from B, the cursor code is stored in the memory CRT REFRESHM.
Write in the 8th row of EMORY at the [WORDO+1] digit position. The cursor code is a code attached to correspond to a cursor pattern.

The DISPLAY process ends as described above.

In this embodiment described above, DECIMA of stroke
In the L processing, it was decided that the period is backed with the value below the decimal point, but it may be configured so that the period is backed with the number of the first digit.

In this embodiment, valid data and data that is not yet valid are distinguished by changing the display brightness, but other methods such as inverted display, blinking display, high-intensity display, etc. are also conceivable.

In this embodiment, the input data is displayed in order (although the input motor device has been described, the present 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 above, according to the present invention, the input first character data is displayed following the second character data that has already been manually converted, so the operator can You can input text smoothly without moving your eyes.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing one embodiment of the present invention;
The figure is a diagram explaining the buffer KB BUFFER, the third
The figure is a diagram explaining the memory LRY REFRESH MEMORY, and Figure 4 is the buffer KB READBUFF.
A diagram explaining ER, 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. FIG. 9 is a diagram showing a romaji-kana conversion table, FIG. 10 is a diagram explaining a CRT controller, FIG. 11 is a diagram explaining initialization processing, and FIG. 12 is a diagram showing MAIN processing (1). Figure, Figure 13 is MA
A diagram showing IN processing (2), Figure 14 is KB BUFF
FIG. 15 is a diagram showing data changes; FIG. 16 is a diagram showing KB BUFFERLOOK processing; FIG. 17 is a diagram showing KB input processing; FIG. 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 a diagram showing KB BUFFER writing processing, and Figure 22 is a diagram showing KB BUFFER writing processing.
The figure shows voiced and half-voiced sound processing, Fig. 23 shows Romaji-kana conversion processing, Fig. 24 (a) and (b) show techu processing, and Fig. 25 shows backing processing.
Figure 26 is a diagram explaining stroke backing, Figure 27 is a diagram explaining stroke backing (when there is space), Figure 28 is a diagram showing DECIMAL processing, Figure 29 (a)
~(f) is a diagram showing data movement, and FIG. 30 is DISPL
It is a figure which shows AY processing. RAM・・・・・・・・・・・・・・・・・・・・・
・・・・・・・・・・・・・・・Memory ROM・・・・
・・・・・・・・・・・・・・・・・・・・・・・・
・・・・・・・・・Control memory CPU・・・・・・・・・
・・・・・・・・・・・・・・・・・・・・・・・・
・・・・・・Microprocessor CRT・・・・・・・
・・・・・・・・・・・・・・・・・・・・・・・・
・・・・・・Display device Figure 2, Ward 3, Rome 877, irregular table, Figure 76, bullet () (ゝhehehezu 9 + hand thread sale neyu sho 7) (method) % formula %. Display of case Patent application No. 247594 of 1988, title of invention character processing device, person making amendment

Claims (1)

[Scope of Claims] 1) An input means for inputting first character data, a storage means for storing the first character data input from the input means, and a first character stored in the storage means. character conversion means for converting data into second character data; display means for displaying the second character data converted by the character conversion means; and first first character data input from the input means. A character processing device comprising: a display control means for displaying the second character data subsequent to the second character data displayed on the display means. 2) The character processing device according to claim 1, wherein the display control means displays the first character data in a display format different from that of the second character data. . 3) Erasing means for erasing the first character data and second character data displayed on the display means one character at a time, the erasing means erases the first character data input later, and then . The character processing device according to claim 1, wherein the second character data inputted first is sequentially erased.