JPS61292186A - Full angle character indentification system - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed Description of the Invention] [Summary] In a method for classifying half-width character codes and full-width character codes in a code string in which half-width character codes and full-width character codes are mixed, A bit string consisting of bits to which different codes are assigned correspondingly is provided, and half-width character codes and full-width character codes in the code string are identified based on the contents of this bit string, reducing the time required to process character information. This also reduces the amount of memory required.

[Industrial application field]

The present invention relates to a method for identifying full-width characters, and more particularly to a full-width character identification method that can easily distinguish between Kanji codes for full-width characters and JIIJ code strings for cow-kaku characters.

When processing information including displaying Japanese on a screen, etc., press i on the screen to display half-width characters and Koreyo-shi! A method is used to make it easier to recognize the information displayed on the screen by mixing full-width characters.

In this case, the character information is a 2-byte kanji code for full-width characters, and a 1-byte JI code for gyu-kaku characters.
Since the S code and S code coexist, it is necessary to separate the two codes by occupation by some means.

The present invention is applied to such a case, and provides an identification method that makes it possible to identify mixed codes in a very simple manner.

[Conventional technology]

Traditionally, Kanji codes for full-width characters and JI for half-width characters were mixed.
Identification with the S code was performed by the following method.

(1) JIB code standard (Jl!i C622B
), as shown in FIG. 5, the part surrounded by a 5-byte escape sequence is made into a full-width character code. In the figure, Kl indicates the inside escape sequence, and KO indicates the out escape sequence.
It shows the sequence.

(2) There is also a method of using a 2-byte escape sequence instead of the fc3-byte escape sequence it is shown in the above-mentioned JIS code standard, and identifying the part surrounded by this as a full-width character code.

(3) Also, as shown in FIG. 6, the half-width JIB code has a 2-byte structure like the full-width one, and the first byte is set to 00 for identification.

[Problem that the invention seeks to solve]

The conventional identification methods described above require a large amount of information for identification, so it is inevitable that the memory and other device configurations required to process such information will become large. I encountered the problem of 1.

[Means for solving problems]

FIG. 1 shows the basic structure of the system of the present invention.

101 is a code string in which half-width character codes and full-width character codes are mixed.

Reference numeral 102 is a bit string in which bits of different codes are assigned to correspond to each of the half-width code and the full-width code in the code string 101.

[Effect]

In a code string where half-width character codes and full-width character codes are mixed, a bit string consisting of bits with different codes assigned corresponding to the half-width character code and the full-width character code is provided, so depending on the contents of this bit string, the code string It is possible to identify the half-width character code and the full-width character code that make up the character code.

〔Example〕

FIG. 2 shows an output order string for half-width characters and full-width characters. In the same figure, 6) indicates the output order column for half-width characters, the order of the start row and start column indicating the row and column where display should start, the order of display attributes indicating the attributes in display, and the attribute 1 in output. ? Following the order of output attributes to be displayed, horizontal data (1kcL), and vertical data length (H), a display code string in which each character is composed of 1 byte is output. Also (6)
indicates the output order string for full-width characters, and after the start line, start column 9 display attribute, output attribute, data length (L), data length CH) order similar to the output order string for half-width characters, each character is An fc display code string consisting of bytes is output.

FIG. 6 shows an embodiment of the present invention, in which 1 is a code string in which full-width characters and half-width characters are mixed, 2 is a bit string provided corresponding to code string 1, and 5 is a code string 1. ．． This is an output ordered string corresponding to bit string 2.

In FIG. 5, 1-Is 1-4 in code string 1
41-5. ... is a 1-byte half-width character code,
1-2・1-s, 1-6. ... is a 2-byte double-byte character =-. Also, in bit string 2, % 2−
112-412-51... are identification bits corresponding to the half-width character codes '-1+ 1-4+ 1-5+..., and "0" has been reassigned.
2-212-1, 2-6+... are full-width character codes 2-2+ 2-! +2-4+... is an identification bit to which lli# is assigned.

In output order sequence 3, b'-1s3-! +...
are the output order strings for half-width characters, and have the gyu-kaku character codes 1-1, 1-4 and 1-5, respectively. In response to...
5-2.14 is an output order string for full-width characters, with full-width character codes 1-2 and L5. Compatible with L6.

FIG. 4 shows a processing program for identifying a code from a mixed full-width and half-width code string and a corresponding bit string, and corresponds to the example shown in FIG. 6.

In FIG. 4, first the counter is cleared (step Sfl). Next, it is checked whether the final code (FF) appears in the code string that matches the color/color value (step 92). As the final code, hexadecimal FF, which is a code that does not exist in either the full-width character code or the half-width character code, is used, and when this is detected, the process ends. If the final code does not appear, the bit at the position matching the counter value in bit string 2 is
Check whether it is '1' or not. Step 5f3).
When it is "1"', it shifts to full-width character processing and returns "0".
``If it rarely happens with ν, it will move on to processing Gyukaku characters.

Since the first bit 2-1 in bit string 2 is "0", next the code string 1Vc is used to output the counter value and one byte of the matching code, that is, code 1-1, to half-width output order string 3-1. Step S4 to generate the display code string
), the counter value is updated and +1 (step 95
). Then, in the same manner as step S5, check whether the next code string is a half-width character code (step S6).
If it happens to be half-width, repeat the same process.

In the code string shown in FIG. 5, the next code is a full-width character code, so in this case, after returning to step S2 and determining the final code, the bit that matches the counter value in bit string 2 is It is checked whether it is "1" (step SS).

In this case, the next bit 2-2 must be "1", so 2 bytes of code that matches the code string 10 counter value, that is, code 1-2, is added to the display code string of the full-width output order string 3-2. The counter value is updated and incremented by 2 (step s8).

Then, in the same manner as step S3, it is checked whether or not the 5th order can also be filled with a code string of double-byte characters (step S9).

In this case, the following code is a full-width character code, so
Returning to step S7, 2 bytes of code that match the code string 10 counter value, that is, codes 1-5, are generated at the next position in the display code string of the full-width output order string 3-2, and the counter value is increased by 2 again. (Step, 9B)
. Next, a check is made to see if it is a code string of full-width characters (step S9), but since it is a code string of half-width characters this time, the process returns to step S2 and repeats the process again starting from the final code check.

By performing the above processing until the final code appears in code string 1Fc, the full-width characters and half-width characters in code string 1 are identified and set in the full-width output order string and the half-width output order string, respectively. be able to.

〔Effect of the invention〕

As explained above, according to the full-width character classification system of the present invention, a bit string consisting of bits divided by different codes corresponding to the half-width character code and the full-width character code in the code string is provided. It is possible to identify half-width character codes and full-width character codes that constitute a code string.

According to the method of the present invention, codes can be identified only by bit strings, so processing such as extraction of specific codes, for example, only full-width character codes, separation of half-width character codes and full-width character codes, and detection of the number of characters, etc. The time required to do this is significantly reduced.

Furthermore, the method of the present invention requires less memory area for storing character information than conventional methods. Such an effect becomes more noticeable as the number of characters in a code string in which half-width character codes and full-width character codes are mixed increases.

[Brief explanation of drawings]

Fig. 1 is a diagram showing the basic configuration of the method of the present invention, Fig. 2 is a diagram showing an output order string for half-width characters and full-width characters, Fig. 3 is a diagram showing an embodiment of the method of the present invention, and Fig. 4 FIG. 5 is a diagram showing an example of a conventional mixed half-width and full-width code string. FIG. 6 is a diagram showing another example of a conventional mixed-gyu-kaku and full-width code string. 1...Code string, 1-1+ '-4+ 1-5°°° Half-width character 3-Door 1'
-2+ 1-5+ 1-6...Full-width character code, 2.
... Bit string, 2-1 + 2-4 + 2-5... Identification bits corresponding to half-width characters, 2-2 + 2-3 + 2-6... Identification bits corresponding to full-width characters. 6... Output order string, "1+'-5... Output order string for half-width characters. 3-2 + 3-4... Output order string for full-width characters>
≧

Claims (1)

[Scope of Claims] In a method for identifying half-width character codes and full-width character codes in a code string in which half-width character codes and full-width character codes are mixed, A full-width character identification method comprising: providing a bit string to which bits having codes are assigned; and identifying half-width characters and full-width characters in the code string based on the contents of the bits in the bit string.