JPH07239772A - Character code conversion device - Google Patents

Abstract

PURPOSE:To enable conversion into correct print data even in an environment of different code system by regarding character data at holding time as of the character code system and converting the character data at the holding time. CONSTITUTION:When a code system decision means 11 decides the character code system of inputted character data, the data are converted into a specific character code, which is sent to a printer 15, and the kind of the decided code system is stored in a storage means 12. An employment means 111 assumes the inputted data to be of the character code system stored in the storage means 12 unless of which character code system the inputted character data is, is specified, and converts the character data by a converting means 13. A holding time processing means 16 judges that the character data at the holding time is of a specific code system when it is decided that the character data is of s specific character code after the start of decision holding, and converts the character data in a buffer means 17 by the converting means.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character code conversion device for converting input character data in a predetermined character code system.

[0002]

2. Description of the Related Art In recent years, a network environment in which a plurality of information processing devices are connected has been used, and a printer connected to the network can be used as a common resource by those who use the information processing devices. It was Furthermore, in recent network systems, for example, UNIX machines (information processing devices that operate with operating systems researched and developed by AT & T Bell Laboratories. UNIX is a trademark) and MSDO are on the same network.
S machine (information processing device that runs on an operating system researched and developed by Microsoft Corporation. MSDO
It is becoming more and more common for S to connect machines operating under different operating systems, such as the trademark. In addition, UNIX machine and MS
Since the DOS machine is widely known in the market and has a well-known name, the above two machine names will be used as an example of an information processing apparatus that operates under different operating systems. In an environment where a UNIX machine and an MSDOS machine are connected, a commonly used printer needs to exchange text file data between different machines. In general, Japanese character data of a text file stored on a UNIX machine adopts an extended Unix code (hereinafter referred to as EUC code) system. In addition, MSDOS
The Japanese character data of the text file stored on the machine adopts the shift JIS code system (hereinafter referred to as SJIS code in the drawings).

FIG. 16 is a diagram for explaining a state in which a UNIX machine and an MSDOS machine are connected to the network. In FIG. 16, a network 161 includes an MSDOS machine 162 and a UNIX machine 163.
And the printers 164 and 165 are connected. In addition, the MSDOS machine 168 is connected to the printer 164.
UNIX machines 169 are connected to the printers 165, respectively. Further, the MSDOS machine 162 has a shift JIS code file 166, and the UNIX machine 163 has an extended Unix code file 167.
Are connected respectively. For example, as shown in FIG. 16, in a network system in which an MSDOS machine 162 and a UNIX machine 163 are connected on the same network 161, the extended Unix code file 167 of the UNIX machine 163 is stored from the MSDOS machine 162. If you try to print the existing file, the file created by the extended Unix code system (EUC code system) on the UNIX machine 163 is judged to be the shift JIS code system, converted with the wrong code system, and sent to the printer. Therefore, there is a problem that printing cannot be performed correctly.

Therefore, when printing a text file, it was necessary to check the character code in the text file with an editor or tool and then send it to the printer using the corresponding character code conversion tool.
An attempt to solve this problem is made in JP-A-4-2735.
It is the "Japanese character code conversion method" in Japanese Patent No. 20. The "Japanese character code conversion method" described in the above publication can automatically determine whether the character code system is a JIS code or an extended Unix code. As a result of the determination, the character code Is converted to.

[0005]

However, even in the conversion method capable of automatically discriminating the character code system, the text data described by either code system such as the shift JIS code system or the extended Unix code system is used. There is a character code that cannot be distinguished. For example,
In hexadecimal notation, "A4A2" is a two-character ", represented by half-width katakana in the shift JIS code system.
"" However, in the extended Unix code system,
It becomes "a" expressed by one full-width hiragana character. The above character code is recognized as a correct character in both code systems. Therefore, there is a problem in that it is not known whether the file consisting of "A4A2" in hexadecimal notation is the shift JIS code system or the extended Unix code system. In addition, "Japanese code system and features" (Nikkei Infobase UNIX 9
2nd edition Nihon Keizai Shimbun, pages 336 to 341
As described in (p.), As the network environment spreads, problems such as the handling of different Japanese codes in e-mails and network file systems due to differences in various Japanese codes have come to the surface.

The present invention is intended to solve the above problems, and automatically determines a file described by a different code system and converts it into correct print data as far as possible regardless of the code system. It is an object of the present invention to provide a character code conversion device that can be transmitted to a printer as a result.

[0007]

[Means for Solving the Problems]

(First Invention) In order to achieve the above object, the character code conversion device of the present invention is a code system discrimination means (FIG. 1) for discriminating which of a plurality of types of character code systems the input character data is. 11) and based on the discrimination result,
Character code conversion means (13 and 14 in FIG. 1) for converting the character data into a predetermined character code, and storage means (12 in FIG. 1) for storing the type of character code system of the discrimination result.
If the type of character code system cannot be specified by the code system determining means (11), the storage means (12)
Adoption means (111 in FIG. 1) that adopts the determination result in
When the adoption means (111) cannot adopt the past discrimination result, the buffer means (17, 18 in FIG. 1) for storing the character data input when the discrimination is suspended, and the code system discrimination means after the discrimination suspension is started. When it is determined by (11) that the character data has a specific character code system, the character data in the buffer means (17, 18) is regarded as the specified character code system and the character data is converted. Means (13, 14) for converting the means on hold (16 in FIG. 1).

(Second Invention) The character code conversion device of the present invention further includes input Japanese character data when determining whether the input Japanese character data belongs to a plurality of types of character code systems. If the character code system of No. is not specified, the character code of the type that is a combination of characters that is not allowed as Japanese is excluded (exclusion means 112 in FIG. 1),
It is characterized in that it is provided with a code system discrimination means (11) that makes the discrimination results of the remaining types of character codes.

[0009]

[Operation] (First invention) The input character data is discriminated by the code system discriminating means as to which of plural types of character code systems. When the character code system of the input character data is determined, the character code conversion means converts the character code system into a predetermined character code, and then the converted character code is sent to the printer. The type of code system determined by the code system determining means is stored in the storage means. If the input character data is not specified as to which character code system, the adoption means causes the conversion means to convert the character data as the character code system stored in the storage means. Further, if the character code system of the input character data is not specified by the code system determining means and the specified character code system adopting means stored in the storage means cannot be used, it is input when the determination is suspended. The character data is stored in the buffer means. If the character system determines that the character data is a specific character code after the determination suspension is started, the on-hold processing unit determines that the character data on hold is the specific character code system. ,
Character data in the buffer means is converted by the conversion means.

(Second Invention) The input Japanese character data is judged by the code system discriminating means to be one of a plurality of types of character code systems. In addition, when the character code system of the input Japanese character data is not specified, the code system determination means refers to, for example, the Kanji code area of the Japanese code, and selects a combination of characters that is not allowed as Japanese. If there is a character code, it is eliminated by the eliminating means in the code system discriminating means, it is discriminated that it is the remaining type of character code, and processing for converting the character data by the converting means is performed. As described above, the character code conversion device of the present invention automatically determines a file described by a different character code system, converts it into the correct print data as much as possible, regardless of the character code system, and prints it in the printer. It becomes possible to send.

[0011]

EXAMPLE FIG. 1 is a schematic block diagram for explaining an example of the present invention. In FIG. 1, the character code conversion device includes a code system discriminating means 11 for discriminating a character code system of input data, and the code system discriminating means 1
The code system storage means 12 in which the type of the code system determined by 1 is stored, and the input data is shifted JI.
Shift JIS code converting means 1 for converting by S code system
3, an extended Unix code converting means 14 for converting the input data in the extended Unix code system, and a printer 15 for printing the unconverted or converted character code.
If the input data cannot be specified and the character code of the type up to that point cannot be adopted in the code system discrimination means 11, the character data is held until the character code system is specified, or the character code system is A holding time processing means 16 for processing the reserved character data according to the character code system when specified, and a ring buffer memory 17 for judging the character code system of the character code and for retaining the character data, And a buffer memory 18 for temporarily saving the character data stored in the ring buffer memory 17. Further, when the type of character code system cannot be specified, the code system determining unit 11 adopts the adopting unit 111 that adopts the determination result that has been determined up to that time and the character code system of the input Japanese character data is not specified. , And an excluding means 112 for excluding characters that are combinations of characters that are not allowed in Japanese.

Next, before describing the operation of the schematic block diagram of FIG. 1, the character code system will be described. Figure 2
FIG. 4 is a diagram for explaining a Kanji code area of a Japanese character code. Japanese character code is 1 like alphanumeric
Some are represented by bytes, while others are represented by two bytes, such as Kanji. FIG. 2 shows the area of each character code system when the first byte is on the vertical axis and the second byte is on the horizontal axis. For example, in FIG. 2, the shift JIS code system and the extended Unix code system (EU
In order to determine the character code of (C code), it is possible to recognize that the bytes less than "80" in hexadecimal notation have the same alphanumeric character code at that time, and it is not necessary to examine the subsequent bytes. However, in order to determine the Japanese character code, it is necessary to check at least the first byte and the second byte of the input byte and check the Kanji code. In the character code system of Japanese characters, when 2 bytes are sequentially read in this way, as shown in FIG. 2, the character code that can be input in each character code system is represented as a code area.

In FIG. 2, in the area surrounded by the broken line indicated by reference numeral 21, the first byte is an alphanumeric character part less than "80" in hexadecimal notation, and it is not necessary to check the second byte. As shown in FIG. 2, areas 22 to 27 that can be represented only by the shift JIS code system (hatched portions flowing from the upper left to the lower right) and an area 28 that can be represented only by the extended Unix code system (from the upper right) And a region 29 and 30 where the both overlap with each other. Areas 29 and 30 are character code areas in which the character code system cannot be determined. However, even if the character data is sequentially read and a character code in such an indistinguishable area is found, it is not always possible to determine all. Since the input character data must have been described in at least one character code system, before the character code in this indeterminate region is reached, the area that is only possible in the shift JIS code system, or If the character code located in the area that is possible only with the extended Unix code system (EUC code) has already been analyzed, naturally this unidentifiable character code must be processed as the already known character code system. Is possible.

For example, as shown in FIG. 1, the code system discriminating means 11 discriminates the code system of the input data.
The character code of the input data is the code system discriminating means 1 described above.
When it is determined by 1 that the first byte is a byte less than 80 in hexadecimal notation, it is determined to be an alphanumeric character code, and therefore it is sent to the printer 15 without conversion.
When determining the character code of the input data, the code system determination means 11 determines that the first byte is 80 or more bytes in hexadecimal notation, and then checks the second byte,
If it can be determined that it is the Shift JIS code system,
It is converted by the shift JIS code conversion means 13. Further, the code system discriminating means 11 examines the character code of the input data in the same manner as above, and when it discriminates that it is the extended Unix code system, it is converted by the extended Unix code (EUC code) converting means 14. Then, the character codes converted by the respective conversion means 13 and 14 are sent to the printer 15 and printed. Then, the code system discriminating means 11 stores the discriminated code system in the code system storing means 12, and subsequent code system discriminating is determined by the value of the code system storing means 12.

Further, when the code system discrimination means 11 examines the character code of the input data, before the character code of the indiscriminate area in FIG. 2 is reached, the area which can be converted by the shift JIS code system, or If the character code located in the convertible area in the extended Unix code system has not been analyzed yet, the on-hold processing means 16 performs a process of sequentially storing the bytes of the input character code in the ring buffer memory 17. And the code system discrimination means 1
1 determines whether the input character is always located in the areas 22 to 27 which can be converted only by the shift JIS code system or the area 28 which can be converted only by the extended Unix code system. The hold processing means 16 converts the character code of the input data string stored in the ring buffer memory 17 at the stage when the code system discriminating means 11 can judge whether it is the shift JIS code system or the extended Unix code system.

According to the above, if there is at least one character code in the input data that can be converted by the shift JIS code system or in the region that can be converted by the extended Unix code system, the character code The character encoding system can be reliably determined and converted. However, in view of saving memory resources, the ring buffer memory 17 cannot be consumed indefinitely for character code conversion. Therefore, the on-hold processing means 16
When the input data exceeds the predetermined size of the ring buffer memory 17, the input data is stored in another buffer memory 18. As described above, the present embodiment does not waste the memory resources of the computer unnecessarily, processes the majority of Japanese character code conversions at high speed, and when it is difficult to determine the character code system, the buffer memory is used. By using 18, it becomes possible to surely convert.

Even if the processing is performed by each of the above means, FIG.
As shown in, the extended Unix code system overlaps with the shift JIS code system in many areas, and it is almost impossible to be discriminated by the code system discriminating means 11. Therefore, the code system discriminating means 11 stores, for example, the characteristics of Japanese characters in addition to the area of the code shown in FIG. 2 of the code system, and referring to these, shifts the character code during scanning JIS. If a character code unique to the code system is found, it is determined to be the shift JIS code system, and if not, it is determined to be undeterminable and conversion is performed using the extended Unix code system. For example, as shown in FIG. 2, a character code having a value from A1 to DF in hexadecimal notation for both the first byte and the second byte is represented by two half-width katakana characters in the shift JIS code. Similarly, both the first and second bytes are in hexadecimal notation from A1 to D.
Character codes having values up to F are represented by one double-byte Kanji character in the extended Unix code system.

However, in the shift JIS code system, even if two half-width katakana characters are not allowed in Japanese, it is determined that the character code system of this character data is the extended Unix code system. It becomes possible to do. For example, in hexadecimal notation "A
4AF "is an extended Unix code system, which is one character of full-width Kanji, but shift JIS code system results in half-width katakana", tsu ". Japanese consonants" tsu " It doesn't appear after the punctuation, so
It is possible to determine that this character code is the extended Unix code system.

FIG. 3 is a block diagram for explaining another embodiment of the present invention. 3 is different from FIG. 1 in that it cannot be held in the buffer memory 18 and the code judgment history information storage means 31 for storing history information indicating the judgment status of the code system of the input data or the holding status of the buffer memory and the like. A temporary file 32 for temporarily storing the input data; and a default code system processing unit 33 for converting into a JIS code in a code system desired by the user when the code system determination unit 11 cannot determine a specific code system. The default code system setting means 34 for the user to set the desired code system is provided.

In FIG. 3, the arrow shown by the solid line shows the flow of print data, and the arrow shown by the broken line shows the control of the operation. The code system of the input data transmitted from the application program is discriminated by the code system discriminating means 11.
The code system discrimination means 11 is the code system discrimination means 1
Refer to the Kanji code area of the Japanese code stored in 1 (Fig. 2), and the code of the input data is 7F in hexadecimal notation.
In the case of the following print data, the JIS code is also Shift J
The IS code and the extended Unix code (EUC) are processed so that they are directly transmitted to the printer without conversion. However, when other input data is input, the code system discrimination means 11 refers to the Kanji code area of the Japanese code until the code system can be discriminated, or the ring buffer memory 17, the buffer memory 18, or It is processed so as to be saved in the temporary file 32.

The code system discriminating means 11 shifts the input data stored in the ring buffer memory 17, the buffer memory 18 or the temporary file 32 when the code system of the input data can be discriminated. 13, or extended Unix code (EU
C) The conversion means 14 processes the data so that it is converted into a JIS code and sent to the printer 15. The code system discriminating means 11 performs processing so that the size of the input data stored in the ring buffer memory 17, the buffer memory 18, or the temporary file 32 is stored in the code discriminating history information storage means 31 as code discriminating history information. The buffer memory 18 and the temporary file 32 are automatically changed to the optimum size by dynamically changing the code discrimination history information created based on the discrimination result of the code system discriminating means 11 so far. You can As an example, in the Japanese character code automatic conversion process up to now, the average of the byte length required after the unidentifiable character was found until the character code was confirmed, and the maximum length were the code identification. The history information is stored in the code determination history information storage means 31, and the character code conversion device can automatically change the size of the buffer memory 18 or the size of the temporary file 32 to an optimum value from the code determination history information. It is possible.

If the code system discriminating means 11 cannot refer to the kanji code area of the Japanese code stored in the code system discriminating means 11 but still cannot discriminate the code system, the default code system processing means 33. The input data is processed so as to be converted into the JIS code under the control of. This default code system can be dynamically changed using the default code system setting means 34. This allows the user to convert to a JIS code in a desired code system. In other words, even if the character code of the input data is discriminated as much as possible, the character code system cannot be discriminated correctly in the case of the text code consisting of only the unrecognizable character code. In this case, code conversion is performed according to one of the code systems registered in the system. However, if this is a character code not intended by the user, the default code system setting means 34 can perform character code conversion in the code system desired by the user.

Next, in the present embodiment, the flow of processing for determining the character code will be described in detail. FIG. 4 is a flowchart of the code discriminating means according to the embodiment of the present invention. FIG. 5 is a flowchart of the code discriminating means according to the embodiment of the present invention.
It is connected by c'and the code d-d '. FIG. 6 is a flowchart of code discrimination according to the embodiment of the present invention. FIG. 7 is a flow chart of the code discrimination according to the embodiment of the present invention, which is connected by the symbols ee ', ff', and gg '.

The code system discrimination means 11 (FIG. 1 or 3) sets the "code system" variable to "undecided" as an initial setting.
(Step 411). Code system discrimination means 11
Initializes the ring buffer memory 17 after setting the "code system" variable to "undecided" as an initial setting (step 412). The code system discrimination means 11 refers to the contents of the code discrimination history information storage means 31 and sets a save size for saving the input data in the buffer memory 18 (step 413). Code system discrimination means 11
Reads the input data byte by byte into the ring buffer memory 17 (step 414). The code system discriminating means 11 checks whether it is the end of the file, and when it is determined that it is the end of the file, terminates the processing (steps 415, 416).

The code system discrimination means 11 executes step 41.
In 4, the read 1 byte is 7F in hexadecimal notation.
It is below (the first byte in the Kanji code area of the Japanese code shown in FIG. 2 is 80 or less in hexadecimal notation) and it is checked whether or not the input data being analyzed is present in the ring buffer memory 17 (step 417). ). When the code system determination means 11 determines that the byte is 7F or less in hexadecimal notation and that the input data being analyzed does not exist in the ring buffer memory 17, the input data is directly transmitted to the printer 15 without being converted. (Step 418). When the code system discriminating means 11 judges that the read bytes are 80 or more in hexadecimal notation, it checks whether or not the code system is "undecided" (step 41).
9).

When the code system is "undecided", shift JI
Since the characters that mean in the S code system or the extended Unix code system are different, code conversion is necessary. In the code system discrimination means 11, the "code system" variable is "undecided".
If it is determined that 1 byte of the input data is stored in the ring buffer memory 17 (steps 420, 42).
1). The code system discrimination means 11 stores the following bytes in the ring buffer memory 17 (step 422). Next, the code system discriminating means 11 refers to the Kanji code area of the Japanese code stored in the code system discriminating means 11 to perform the code discrimination (step 423). The code system discrimination means 11 checks whether or not the code system of the input data can be discriminated (step 424). When the code system discriminating means 11 judges that the code system of the input data can be discriminated, the bytes in the ring buffer memory 17 which have become unnecessary are saved in the buffer memory 18 or the temporary file 32, and then the process returns to step 414. , The next byte is read (step 425).

When the code system discriminating means 11 judges that the code system of the input data cannot be discriminated, it checks whether or not it is the extended Unix code system (step 42).
6). When the code system discrimination means 11 determines that the code system of the input data is the extended Unix code system, it converts the data remaining in the ring buffer memory 17, the buffer memory 18, and the temporary file 32 into the extended Unix code system ( Step 427). The code system discriminating means 11 discriminates the code by changing the "code system" variable to the extended Unix code system when converting the data remaining in the ring buffer memory 17, the buffer memory 18 and the temporary file 32 by the extended Unix code system. It is stored in the history information storage means 31 (step 42).
8). When the code system discriminating means 11 determines that the code system of the input data is not the extended Unix code system, the data remaining in the ring buffer memory 17, the buffer memory 18 and the temporary file 32 is converted by the shift JIS code system (step). 429). The code system discriminating means 11 discriminates the code by changing the "code system" variable to the shift JIS code system when converting the data remaining in the ring buffer memory 17, the buffer memory 18 and the temporary file 32 by the shift JIS code system. It is stored in the history information storage means 31 (step 430). After changing the code system variable, the process returns to step 414, the next byte is read, and the same processing as described above is repeated.

When it is determined in step 419 that the "code system" variable is not "undecided", the code system discrimination means 11 checks whether the character code of the input data is the extended Unix code system (step 431). .
When the code system discriminating means 11 determines that the extended Unix code system is used, the input byte is converted by the extended Unix code converting means 14 (step 43).
2). When the code system discriminating means 11 judges that it is not the extended Unix code system, it shifts the input byte JI.
It is converted by the S code converting means 13 (step 43).
3). The data converted into the JIS code by the shift JIS code conversion unit 13 and the extended Unix code conversion unit 14 is transmitted to the printer 15 and printed, and the process of step 414 is performed in order to process the next byte in the same manner. Return (step 434).

Next, referring to FIGS. 6 and 7, and FIGS.
The method of discriminating the code system will be described with reference to. FIG. 8 is a diagram for explaining the initial state of the ring buffer memory used in the embodiment of the present invention. FIG. 9 is a diagram for explaining a state in which 2-byte data is read into the ring buffer memory used in the embodiment of the present invention. FIG. 10 is a diagram for explaining a state after code discrimination of the ring buffer memory used in the embodiment of the present invention. FIG. 11 is a diagram for explaining a state where 2 bytes of data are read into the ring buffer memory used in the embodiment of the present invention.
FIG. 12 is a diagram for explaining the state after the code discrimination of the ring buffer memory used in the embodiment of the present invention. FIG. 13 is a diagram for explaining a state in which 2 bytes of data are read in the ring buffer memory used in the embodiment of the present invention. FIG. 14 is a diagram for explaining the full state of the ring buffer memory used in the embodiment of the present invention. FIG. 15 is a diagram for explaining the state after saving the ring buffer memory used in the embodiment of the present invention. The code system discrimination means 11 extracts 2 bytes from the shift JIS analysis byte pointer in the ring buffer memory 17 (step 611). The ring buffer memory 17 is
The state shown in FIG. 9 is obtained. Whether the code system discriminating means 11 can interpret the code region by referring to the kanji code region (see FIG. 2) of the Japanese code stored in the code system discriminating device 11 and interpret it only as a shift JIS code system. It is checked whether or not (step 612). For example, the code system discriminating means 11 is a shift JIS code system in which the region which can be discriminated only by the shift JIS code region shown only by the diagonal lines flowing from the upper left to the lower right in the Kanji code region of the Japanese code shown in FIG. (Step 613).

When the code system discriminating means 11 discriminates that the retrieved code is not a code that can be interpreted only as a shift JIS code, it is placed in a code area which is not permitted as a shift JIS code (area having a diagonal line flowing from upper left to lower right). It is checked whether there is any (step 614). If the code is not permitted as shift JIS, the preceding 2 bytes are extracted from the extended Unix code analysis byte pointer in the ring buffer memory 17 (step 623), and it is checked whether or not the extended Unix code system is used (step 624). . Code system discrimination means 11
If it is determined that the input data does not have the extended Unix code system, it can be determined that an illegal code has been determined (step 625). When it is determined that the input data is the extended Unix code system, the code system determination unit 11 can determine that the input data is the extended Unix code. (Step 626). Code system discrimination means 11
If it can be determined that the input data is also allowed as the shift JIS code system, the shift JIS code in the ring buffer memory 17 is terminated to end the shift JIS code analysis.
The S pointer is advanced by the analyzed character. At this time, referring to the Kanji code area of the Japanese code stored in the code system discrimination means 11, it is checked whether or not it is in the area indicated by reference numeral 30 in FIG. 2 (step 615).

When the code system discriminating means 11 discriminates that the code system of the input data is in the area 30, it becomes the first byte of half-width katakana and full-width kanji in the shift JIS code system. The shift JIS pointer is advanced by one (step 616). The ring buffer memory 17 is in the state shown in FIG. When the code system discriminating means 11 discriminates that the code system of the input data is not in the area 30, the shift JIS pointer is set to 2
Advance the byte (step 617). The ring buffer memory 17 is in the state shown in FIG. Next, a code system discriminating means 1 for discriminating whether the character is an extended Unix code.
1 retrieves the preceding 2 bytes from the extended Unix code pointer of the ring buffer memory 17 (step 61).
8).

The code system discriminating means 11 discriminates whether or not the code system of the input data is the extended Unix code system (step 619). Code system discrimination means 1
In No. 1, when it is determined that the code system of the input data is the extended Unix code system, it cannot be determined which code system. Therefore, in order to end the extended Unix code analysis, the extended Unix code pointer is advanced by 2 bytes from the ring buffer memory 17 (step 62).
0). Further, since the code system discriminating means 11 cannot discriminate the code system, the input data of the ring buffer memory 17 shown in FIG. 14 is saved as shown in FIG. 15, for example, the buffer shown in FIG. It is temporarily saved in the memory 18 (step 621). On the other hand, when it is determined in step 619 that the input data is not the extended Unix code system, the code system determining means 11 can determine that the input data is the shift JIS code system (step 622).

Next, the ring buffer memory 17 will be described in detail with reference to FIGS. As described above, the shift JIS code system and the extended Unix code system do not always have the same character code delimiter. Therefore, it is necessary to temporarily buffer the parsed byte string in the memory for management. In this embodiment, the ring buffer memory 17 is used to solve these problems. FIG. 8 shows the initial state of the ring buffer memory 17,
The start pointer, end pointer, extended Unix code pointer, and shift JIS pointer are shown in fixed positions. Next, FIG. 9 shows a state where 2 bytes of input data are read into the ring buffer memory 17. Then, the input data A1 and A2 are stored in the ring buffer memory 17, and the end pointer is moved by two.

FIG. 10 shows a state after the code system of A1 and A2 bytes is discriminated. For example, A
If the code system of 1 and A2 bytes does not exist in the area indicated by the reference numeral 30 in FIG. 2, since the character delimiter is formed by these 2 bytes, both the extended Unix code pointer and the shift JIS pointer move. FIG. 11 shows a state in which the input data is further read by 2 bytes.
Following A1 and A2, A3 and A4 are stored in the ring buffer memory 17, and the end pointer moves by two. Figure 1
2 is an extended Unix code pointer and shift JI
The state after this A3 and A4 byte code system is discriminated using the S pointer is shown.

In the code judgment shown in FIG. 12, A3, A4
The case where the byte is in the area indicated by the reference numeral 30 shown in FIG. 2 is shown. That is, the extended Unix code pointer moves by two, but the shift JIS pointer
Only A3 bytes are recognized as character delimiters, so only one is moved. FIG. 13 shows a case in which 2 bytes of input data are read, and the bytes analyzed from the shift JIS pointer are A4 and A5 bytes. When the input data is buffered in the ring buffer memory 17 in this way, the buffer memory 18 becomes full as shown in FIG. At this time, as shown in FIG. 15, the contents of the ring buffer memory 17 are saved in the buffer memory 18 or the temporary file 32 until the position of the shift JIS pointer or the extended Unix code pointer is reached.

Although this embodiment has been described in detail above, it is not limited to this embodiment. Various design changes can be made without departing from the present invention described in the claims. For example, the ring buffer memory may be any memory as long as it does not depart from the gist of the present embodiment, and the input data 8
There is no need to limit to individual pieces. Further, each means of the present invention is
Although not specifically shown in the embodiment, it is configured by a known or well-known logic circuit. In the present embodiment, a control circuit for controlling the character code conversion device,
Circuits or devices included in a typical printer are omitted. Further, although the present embodiment has been described in the case of the shift JIS code system and the extended Unix code system, it goes without saying that any code system may be used. Further, in the present embodiment, the Kanji code area of the Japanese character code shown in FIG. 2 is used when the code system is discriminated. However, the present invention is not limited to this, and the character code can be searched or each character code can be searched. It is also possible to prepare a table such as a code system and perform processing based on this.

[0037]

According to the present invention, when the character code system of the input character data cannot be specified by the code system discriminating means or the character code system up to that time cannot be adopted, the character code system of the character data is If the character data is judged to have a specific character code system after the conversion is suspended until it is specified, the character data at the time of suspension is regarded as the character code system and the character data at the time of suspension is converted. Therefore, even in environments with different code systems, the print data can be converted to the correct print data as much as possible regardless of the code system.
Further, according to the present invention, when distinguishing the code system, paying attention to a combination of characters that is not allowed as Japanese, eliminating such types of character codes, and determining the remaining types of character codes, Even in environments with different code systems, it is possible to convert print data with few errors.

[Brief description of drawings]

FIG. 1 is a schematic block configuration diagram for explaining an embodiment of the present invention.

FIG. 2 is a diagram for explaining a Kanji code area of a Japanese character code.

FIG. 3 is a block diagram for explaining another embodiment of the present invention.

FIG. 4 is a flowchart of a code discriminating means that is an embodiment of the present invention.

FIG. 5 is a flowchart of a code discriminating means that is an embodiment of the present invention, in which a symbol aa ′, a symbol bb ′, and a symbol c−.
It is connected by c'and the code d-d '.

FIG. 6 is a flowchart of code determination according to the embodiment of the present invention.

FIG. 7 is a flow chart of code discrimination according to the embodiment of the present invention, in which a code ee ′, a code ff ′, and a code g.
Connected by -g '.

FIG. 8 is a diagram for explaining an initial state of the ring buffer memory used in the embodiment of the present invention.

FIG. 9 is a diagram for explaining a state where 2-byte data is read into the ring buffer memory used in the embodiment of the present invention.

FIG. 10 is a diagram for explaining a state after code discrimination of the ring buffer memory used in the embodiment of the present invention.

FIG. 11 is a diagram for explaining a state in which 2-byte data is read into the ring buffer memory used in the embodiment of the present invention.

FIG. 12 is a diagram for explaining a state after code discrimination of the ring buffer memory used in the embodiment of the present invention.

FIG. 13 is a diagram for explaining a state in which 2-byte data is read into the ring buffer memory used in the embodiment of the present invention.

FIG. 14 is a diagram for explaining a full state of the ring buffer memory used in the example of the present invention.

FIG. 15 is a diagram for explaining a state after saving the ring buffer memory used in the embodiment of the present invention.

FIG. 16: UNIX machine and MSDO in network
It is a figure for explaining the state where S machine is connected.

[Explanation of symbols]

 11 ... Code system discriminating means 12 ... Code system storing means 13 ... Shift JIS code converting means 14 ... Extended Unix code converting means 15 ... Printer 16 ... Pending processing means 17 ... Ring buffer memory 18 ... Buffer memory 31 ... Code discrimination history information storage means 32 ... Temporary file 33 ... Default code system processing means 34 ... Default code system setting means 111 ... Adopting means 112 ... Elimination means

Claims (2)

[Claims] 1. A code system discriminating means for discriminating which of a plurality of types of character code systems the input character data is, and a character for converting the character data into a predetermined character code based on the discrimination result. In a character code conversion device including a code conversion unit, a storage unit that stores the type of the character code system of the determination result; If the adoption means that adopts the result and the adoption result cannot adopt the past determination result,
Buffer means for storing the character data input when the discrimination is suspended, and, after the discrimination suspension is started, when the character system discriminates the character data to be a specific character encoding system, the character data in the buffer means is stored. And an on-hold processing unit for converting the character data to the conversion unit as a specified character code system. 2. When determining whether the input Japanese character data is one of a plurality of types of character code systems, if the character code system of the input Japanese character data is not specified, it is determined as Japanese. 2. The character code conversion device according to claim 1, further comprising a code system discriminating means for excluding character codes of a type that is a combination of unacceptable characters and making the remaining type of character codes a discrimination result.