JP2947316B2 - Code conversion method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a code conversion method for converting different codes when different codes are used between different models.

[0002]

2. Description of the Related Art As computers are being networked, the exchange of data between computers and the sharing of data are progressing. However, in order to exchange data between different models, especially between models with different character code systems, and to treat the data as a common one, the character code of the data must be converted and converted to the data code of the own model before data processing. However, in code conversion, the length of data varies depending on the code, and there is a problem that data processing becomes very difficult.

FIG. 10 is a diagram showing a conventional character code conversion system. FIG. 10 shows a flowchart of conversion from the kanji code 1 using the shift code α to the kanji code 2 not using the shift code.

FIG. 11 is a diagram showing a specific example of the flowchart of FIG. 10, in which the number of bytes x of the shift code α is 2 bytes and the shift code α is “0AF1” or “0AF0”. Is shown. In this shift code, 0A indicates a kanji shift, and F0 indicates a kanji I.
An N code is shown, and F1 is a kanji OUT code. The figure shows a case where a kanji code having a 2-byte shift code is input and a kanji code without a shift code is output.

The flowchart of FIG. 10 will be described with reference to the example of FIG. First, in S21 of FIG. 10, the data shown in the upper part of FIG. 11 is input to the data read buffer. At this point, the flag is initialized to 0. Next, in S22, 1-byte data is read from the buffer. That is, the character A shown in the first byte of FIG. 11 is read. Next, it is checked in step S23 whether the read character A is the kanji shift code 0A.
Since character A is an alphanumeric code, it is not a kanji shift code. Therefore, the result is “false” in S23, and the process proceeds to S25. At this time, since the flag is still initialized to 0, the flag is set to "false" again, and the process proceeds to S29. In S29, the character A is code-converted and output as a 1-byte character.

Then, the process returns to S22, where the character B in the second byte is input. In S23, it is checked whether it is a kanji shift code. Since the character B is also an alphanumeric symbol code and is not the kanji shift code 0A, it becomes "false" and proceeds to S25. In S25, since the flag is 0, "false"
Then, the process proceeds to S29. In S29, as in the first byte, the character B is also subjected to one-byte code conversion and output as data. Next, in S22, the third code 0
A, that is, the kanji shift code is read. In S23, it is checked whether it is a kanji shift code, and it becomes "true" at this time.

Next, in S24, x-1 bytes are read from the buffer. In this example, the case where the number of bytes x of the shift code α is 2 is described.
One byte becomes one byte. That is, the fourth byte F0 shown in FIG. 11 is read. By examining this F0, it is determined whether it is a kanji IN code or a kanji OUT code. Since F0 is a kanji IN code, the flag is set to 1.

Next, returning to S22, the fifth byte code is read from the buffer. This code is not the kanji shift code because it is the first byte code of the kanji code "kan". Therefore, it becomes “false” in S23 and S25
Proceed to. In S25, it is checked whether the flag is 1 or not. Since the kanji IN code has been read in the previous step S24, the flag is set to 1 and the result is "true" in step S25, and the process proceeds to step S26. S26
In, another byte is read. That is, the code in the sixth byte is read. At this point, the two-byte code “Kan” is completed, and “Kan” is converted using the conversion table from Kanji code 1 to Kanji code 2 prepared in advance.
Is converted. In S28, a new 2-byte code of the kanji code 2 obtained by the conversion is output.

Next, in S22, the data of the seventh byte is read. In S23, since the code in the seventh byte is not the kanji shift code 0A, the result is "false", and the process proceeds to S25. Since the flag remains 1, it becomes "true" in S25, and another byte is read in S26. In this way, by reading the eighth byte, the two-byte codes of the seventh byte and the eighth byte are aligned. Then, in S27, the character "character" is converted using the conversion table from kanji 1 to kanji 2. Then, the 2-byte code obtained in S28 is output.

Next, in step S22, the ninth byte code is read. In S23, it is checked whether the ninth byte code is a kanji shift code. Since the code in the ninth byte is 0A, it becomes "true" and the process proceeds to S24. In S24, one more byte is read, and the flag is turned on / off depending on whether this byte is a kanji IN code or a kanji OUT code. Since the 10th byte is F1, it is a kanji byte code. Therefore, fl
ag is returned to 0 at this point.

Next, in S22, the data of the eleventh byte is read. In S23, it is checked whether the 11th byte code is a kanji shift code. Since the character in the eleventh byte is character C, it is not a kanji shift code. Therefore, S23 becomes "false" and the process proceeds to S25. Since the flag is 0, S25 becomes “false” and S2
At 9, one-byte code conversion is performed and output. As described above, using the flowchart of FIG.
When the data shown in 1 is converted, 7-byte data is output for 11-byte input data.

Next, as a conventional code conversion method, conversion from a kanji code 1 without a shift code to a kanji code 2 having a shift code β will be described with reference to FIG. FIG. 13 is a diagram showing an example of performing code conversion using the flowchart of FIG.
Is y = 2 and the shift code β is “0AF
1 ”or“ 0AF0. ”First, in S31 shown in FIG. 12, the 7 shown in the upper part of FIG.
Byte data is input to the data read buffer. At this point, flag is initialized to zero.

Next, in S32, the character A in the first byte is read. In S33, since the character A is not a kanji code, it becomes "false" and the process proceeds to S36. In S36, f
If the flag is 1, the shift code β is output by 2 bytes and the flag is set to 0.
Since g remains 0, S36 does nothing. Next, in S37, the read character A of the first byte is regarded as a one-byte character and is converted and output.

Next, in S32, the character B in the second byte is read. Since the character B in the second byte is not a kanji code, S33 becomes "false" and the process proceeds to S36. Since the flag is still 0 at this point, the process proceeds to S37. S37
Is converted to a 1-byte code and output.

Next, in S32, the third byte is input. In S33, it is checked whether the third byte is a kanji code. In the case of the kanji code 1 without the shift code, it can be determined whether or not the kanji code is a kanji code by looking at a special bit of the kanji code in the first byte of the two-byte kanji code. In this example, since the first byte of "Han" is input, S33 becomes "true" and the process proceeds to S34. In S34, if the flag is 0, two bytes of the shift code β are output. And fla
Set g to 1. That is, at this time, the shift code β “0A
F0 "is output. At S35, the fourth byte is read from the buffer, and the third byte and the fourth byte are read.
The conversion is performed by referring to the conversion table from Kanji 1 to Kanji 2 using the Kanji code of the byte. Then, the converted data is output as a 2-byte code.

Next, in S32, the fifth byte is input. In S33, it is checked whether the fifth byte is a kanji code. The 5th byte is 1 of "character"
Since it is the byte, it is determined to be a Kanji code. Therefore, the process proceeds to S34. In S34, since the flag has already been set to 1, no shift code is output again.
Next, in S35, the sixth byte is input, the conversion is performed using the conversion table from Kanji 1 to Kanji 2 using the fifth and sixth bytes, and the result is output.

Next, in S32, the seventh byte is input. In S33, it is determined whether or not the seventh byte is a kanji code. In this case, since the character C has been input, "false" is determined in S33, and the process proceeds to S36. In S36, since the flag is already 1, 2 bytes of the shift code β are output. At this point, “0AF
1 "is output. Then, the flag is returned to 0. Next, S
At 37, the 7th byte of the read character C is subjected to 1-byte code conversion and output.

As described above, the kanji code 1 without the shift code can be converted into the kanji code 2 using the shift code β by using FIG. When this conversion method is used, the number of input bytes differs from the number of output bytes as shown in the specific example of FIG.

[0019]

Various character codes include:
Many consist of two-byte kanji codes and one-byte alphanumeric code, and a shift code is added between one-byte and two-byte characters to distinguish between two-byte characters and one-byte characters. Code exists. On the other hand, a shift JIS code often used in a personal computer does not require a shift code for identifying a code between a two-byte character and a one-byte character. If code conversion is performed between a code system that requires such a shift code and a code system that does not require a shift code, the length of the data before and after the code conversion is different. However, there is a problem that a program created with consideration for the length of an item cannot be processed.

The present invention has been made in order to solve the above-described problems, and is conscious of the length of a code and the length of an item regardless of data before or after code conversion. It is an object of the present invention to provide a code conversion method that can operate a created program.

[0021]

According to a first aspect of the present invention, there is provided a code conversion system in which a 1-byte code and a 2-byte code are mixed.
Data of a first code system identified by a shift code of a predetermined number of bytes placed between both codes is input, and 1
In a code conversion method for converting and outputting data of a second code system in which byte codes and 2-byte codes are mixed, a shift code is detected by inputting data of the first code system, and the number of bytes of the detected shift code And outputting an alternative shift code (redundant code) having the same number of bytes as data of the second code system.

In the code conversion method according to the second invention, for example, a 1-byte code and a 2-byte code are mixed, and a first byte is identified by a predetermined number of bytes of a first shift code placed between the two codes. The data of the coding system is input, and the 1-byte code and the 2-byte code are mixed and identified by the second shift code having a smaller number of bytes than the number of the first shift code interposed between both codes. In a code conversion system for converting data into data of the second code system and outputting the data, data of the first code system is input and the first data is input.
And generates a redundant shift code in which a redundant code is added to the second shift code so as to have the same number of bytes as the detected number of bytes of the first shift code. It is characterized by outputting to data.

In the code conversion method according to the third invention, data of the first code system in which one-byte code and two-byte code are mixed is input, and one-byte code and two-byte code are mixed, and between the two codes. In a code conversion system for converting and outputting data of a second code system identified by a predetermined shift code placed therein, data of the first code system has a predetermined number of bytes between one byte code and two byte code. Inputting data according to the first code system, detecting the redundant code, and outputting a shift code having the same number of bytes as the detected redundant code to data of the second code system. It is characterized by the following.

In the code conversion method according to the fourth invention, the redundant code used in the first to third inventions does not affect a computer or a system that operates using the second code system. It is characterized by being a code.

The code conversion method according to the fifth invention uses the one-byte code having a code length of one byte and the two-byte code having a code length of two bytes in the first to third inventions. It is characterized by the following.

The code conversion method according to the sixth invention is characterized in that it is a conversion method of a code system in which an alphanumeric code and a kanji code are mixed.

[0027]

In the code conversion method according to the first invention, the shift code used in the first code system and the alternative shift code (redundant code) are replaced. At this time, since the shift code is replaced by a substitute shift code (redundant code) having the same number of bytes as the shift code according to the first code system, the number of bytes of input data and the number of bytes of output data do not change.

In the code conversion method according to the second invention, a shift code is used for both the first code system and the second code system, but the code conversion method when the number of bytes of the shift code is different is shown. I have. That is, the first
The first shift code used in the coding system of the second type is detected, and the second shift code is set so as to have the same byte length as the byte length.
, A redundant code is added to the shift code, and the redundant shift code is generated and output, so that the byte length of the input data is equal to the byte length of the output data.

In the code conversion method according to the third invention, the redundant code or the redundant shift code output in the first invention or the second invention is inserted into the first code system. In this case, a case is shown in which this is converted to the second code system having the original shift code. That is, a redundant code of a predetermined number of bytes is placed in the data of the first code system. This redundant code is detected, and a shift code used in the second code system is output instead of the detected redundant code. Thus, the byte lengths of the input data and the output data can be made equal.

In the code conversion method according to the fourth invention, since the redundant code has no effect on the environment of the computer or the system in which the converted data is used, the redundant code is added. The same state can be created as if it had not been added. Here, having no influence on the environment means, for example, a case where it is ignored during display or printing.

In the code conversion method according to the fifth invention, a one-byte code having a code length of one byte is provided.
It is possible to convert a code system in which 2-byte codes having a code length of 2 bytes are mixed.

In the code conversion method according to the sixth invention, since alphanumeric code and kanji code are handled as codes, conversion in Japanese processing becomes possible.

[0033]

【Example】

Embodiment 1 FIG. FIG. 1 is a flowchart showing one embodiment of the code conversion method according to the present invention. FIG. 1 shows a conversion method for converting a kanji code 1 having a shift code α to a kanji code 2 having no shift code. Kanji code 1 uses a shift code α to identify a 1-byte code and a 2-byte code.
Assuming that the number of bytes of the shift code α is x, in this embodiment, when converting to the kanji code 2 having no shift code, an example of inserting an alternative shift code γ having the number of bytes x as an alternative shift code is shown. Is shown.

FIG. 2 is a diagram showing a specific example for explaining the flowchart of FIG. FIG. 2 shows a case where the number of bytes x of the shift code α is 2, and the shift code α is “0AF1” or “0AF0”. Also, the case where the substitute shift code γ is “0E0F” is shown. 0A of the shift code α indicates a kanji shift code. F0 of shift code α is Kanji IN
The code is shown. F1 of the shift code α indicates the kanji OUT. Further, 0E used for the substitute shift code γ indicates the shift IN. Further, 0F of the alternative shift code γ indicates the shift OUT. The use of a 2-byte continuous code “0E0F” as the substitute shift code γ indicates that the shift IN and the shift OUT are continuously performed. As described above, the shift IN and the shift OUT are executed successively, indicating that the system has no change before and after the execution. The shift IN code and shift OUT code are not displayed when displayed on the monitor screen, and are not printed when printed on a printer.

Next, the operation of this embodiment will be described with reference to FIGS. First, in S1 of FIG. 1, the upper data shown in FIG. 2 is input to the data read buffer. At this point, flag is initialized to zero. Next, S
In step 2, the first byte of data is read. Then S
It is checked whether the data of the first byte read in 3 is a kanji shift code. Since the first byte is character A, the process proceeds to S6. Fla in S6
Although g is checked, it is “false” because the initial value remains 0. Next, in step S10, the input character A in the first byte is determined to be 1-byte data, and is subjected to 1-byte code conversion and output.

Next, the character B of the second byte is similarly read from the buffer. Next, at S3,
It is checked whether the character B at the byte is a kanji shift code. S6 because character B is not a kanji shift code
Proceed to. Since the flag remains 0 in S6, the flag becomes "false", and the process proceeds to S10. In S10, the character B
Is converted and output as a first byte code.

Next, the data of the third byte is input in S2. In S3, it is checked whether the third byte data is a kanji shift code. The third byte is 0A, which is a kanji shift code, which is "true", and proceeds to S4. In S4, x-1 bytes of data are further read from the buffer. That is, in this example, since x = 2, data of one byte, that is, data F0 of the fourth byte is further read. Since F0 is a kanji IN code, the flag is set to 1. Next, in S5, x
A byte alternative shift code is output. In this example, a 2-byte alternative shift code γ, that is, “0E0
An alternative shift code F "is output.

Next, in S2, the data of the fifth byte is input. In S3, it is checked whether or not this code is a kanji shift code. However, since it is the first byte data of "kan", it is not a kanji shift code but "false", and the process proceeds to S6. In S6, since the flag is 1, it becomes "true" and the process proceeds to S7. One more at S7
Reads bytes of data from the buffer. At this point 5
The data of the byte and the data of the sixth byte are aligned, and the conversion is performed using the 2-byte data and using a conversion table prepared in advance from Kanji 1 to Kanji 2. In S9, the converted 2-byte data is output.

Next, in S2, the data of the seventh byte is input. In S3, it is checked whether the seventh byte data is a kanji shift code. In this example, the code is the first byte of the character, so it is false
And the process proceeds to S6. In S6, since the flag is 1, it becomes "true" and the process proceeds to S7. In S7, the code in the eighth byte is read. In S8, conversion using a conversion table from Kanji 1 to Kanji 2 is performed using 2-byte data of the seventh and eighth bytes. S
In step 9, these two bytes are output.

Next, the ninth byte of data is input in S2. In S3, it is checked whether the ninth byte data is a kanji shift code. 9th byte is 0
A is true because it is A and a kanji shift code. Therefore, the process proceeds to S4. In S4, x-1 byte data is newly read from the buffer. In this example, the data F1 of the other byte, that is, the tenth byte is read. Since F1 is a kanji OUT code, flag
Is set to 0. Next, in S5, a 2-byte alternative shift code is output. That is, “0E0F” is output as the substitute shift code γ.

Next, in S2, the data of the eleventh byte,
That is, the character C is input. In S3, it is checked whether this code is a kanji shift code. The character C is "false" and the process proceeds to S6. Since the flag is set to 0, it becomes "false" in S6, and the process proceeds to S10.
In S10, the character C is subjected to one-byte code conversion and output.

As described above, when the flowchart shown in FIG. 1 is used, the lengths of input data and output data become the same. Also, the shift code “0AF1” or “0A
An alternative shift code of “0E0F” is placed instead of “F0”, but this alternative shift code only executes shift IN and shift OUT in a system using the converted data, and is used for display printing and other cases. Does not affect the system at all, only the fact that a 2-byte alternative shift code is inserted.

As described above, in the first embodiment, when converting from a character code system having a kanji shift code to a character code that does not require a kanji shift code, the terminal system is used in a code system that does not require a kanji shift. A case has been described in which a code for invalidating the screen display / printing is used, and the code conversion is performed by regarding this as a kanji shift code. And for the shift code, by using the same number of bytes as the kanji shift,
The case where the input data and the output data have the same number of bytes has been described.

Embodiment 2 FIG. In the first embodiment, the case where the character code system having the kanji shift code is converted to the character code that does not require the kanji shift code has been described. However, the case where both the two character code systems have the kanji shift code is used. In the following, a description will be given of a case where the code conversion method according to the present invention can be applied even when each character code system uses a kanji shift code having a different number of bytes.

FIG. 3 is a diagram for explaining this embodiment, and FIG. 4 is a diagram showing a specific example thereof. First, in this embodiment, a case will be described in which a kanji code 1 using a shift code α is converted into a kanji code 2 using a shift code β as shown in FIG. Here, a special feature is that the byte number x of the shift code α is different from the byte number y of the shift code β, and a case where x is larger than y will be described. FIG. 3B shows a modification of S5 of FIG. 1 used in the first embodiment described above according to this embodiment. Other than S5, S1 to S10 perform the same operation as that of the first embodiment shown in FIG. Only the part of S5 shown in FIG. 3B is different from the first embodiment.

Next, the operation of S5 shown in FIG. 3B will be described with reference to a specific example of FIG. FIG. 4 shows a case where the number of bytes x of the shift code α is 4, which is 4, and the shift code α is “0AF1” as the kanji IN code.
F2F3 ”or“ 0AF0F1 ”as the kanji OUT code
F2 ". The case where the byte number y of the shift code β is 2 is shown, and the shift code β is" 0AF0 "or the kanji OUT as the kanji IN code.
The case where "0AF1" is used as the code is shown.

As shown in FIG. 4, the character A in the first byte
For the character B in the second byte,
Similarly, 1-byte code conversion is performed and output. Next, when the data of the third byte is input, the data of “0AF1F2F3” from the third byte to the sixth byte is regarded as a kanji IN code, and this kanji IN
The code is replaced according to the flow of S5 shown in FIG. First, a shift code of y bytes is output in S51. That is, a 2-byte shift code of the shift code β is output. That is, "0AF0" is output. Next, in S52, an xy byte alternative shift code is output. If a null code of 00 is used as an alternative shift code, xy, ie, 4-2 =
A 2-byte null code is output as an alternative shift code.

Next, the kanji code "kan" is converted and output. Further, when 0A at the 9th byte is input, "0AF0F1F2" from the 9th byte to the 12th byte is a Kanji OUT code, and this Kanji OUT code is substituted based on S5 in FIG. 3B. That is, a 2-byte shift code "0AF1" is output in S51, and then a 2-byte alternative shift code 0 is output in S52.
000 is output.

As described above, in this embodiment, even when the two kanji code systems use shift codes having different numbers of bytes, code conversion in which the number of bytes of input data and the number of bytes of output data are the same is performed. It indicates that it can be done.

Embodiment 3 FIG. Next, another embodiment will be described with reference to FIG. In the second embodiment, the case where the alternative shift code is output in S52 as shown in FIG. 3B is described. In this embodiment, a case where a plurality of shift codes are used instead of the alternative shift code will be described.

FIG. 5 is a diagram showing an example of this embodiment.
The input data is the same as the input data shown in FIG. 4 and differs in that a kanji IN code or a kanji OUT code is used for the substitute shift code portion of the output data. That is, in the fifth and sixth bytes of the output data, the same kanji IN code as the third and fourth bytes is inserted in duplicate. Similarly, the 11th and 12th bytes of the output data are the 9th and 1st bytes.
The kanji OUT code in the 0th byte is inserted redundantly. Even if the kanji IN code is used in duplicate or the kanji OUT code is used in duplicate, there is no effect on the operating environment of the system. No, Kanji I
In the case of N code, the environment of Kanji IN continues,
In the case of the kanji OUT code, the environment of kanji OUT only continues, and only the kanji IN code or the kanji OUT
It merely demonstrates the fact that the code exists continuously. The kanji IN code or kanji OUT code is not displayed or printed on a display device or a printing device as described above.

Embodiment 4 FIG. Next, another embodiment will be described with reference to FIGS. FIG. 6 substitutes for S5 in the flowchart shown in FIG. 1, and S1 to S10 other than S5 are the same as the flow shown in FIG. In the first to third embodiments, the case where the shift code has an even number of bytes has been described. In this embodiment, an example in which the shift code has an odd number will be described. Here, a case where the number of bytes x of the shift code α is 2 and the shift code α is “0AF1” or “0AF0” is shown, and the number of bytes y of the shift code β is 1 and the shift β is 01 or 02. A case will be described. 01 of the shift code β indicates the kanji IN code, and 02 of the shift code β indicates the kanji OUT.

Next, the operation of this embodiment will be described.
The characters A and B in the first byte and the second byte shown in FIG. 7A are subjected to one-byte code conversion and output in the same manner as in the above-described embodiment. Next, when 0A in the third byte is input, it is determined that the data is a kanji IN code together with the data F0 in the fourth byte. At this point, S5 shown in FIG. 6 operates, but in S5, if the input code is a kanji IN code, an xy-byte alternative shift code is output first, and then a y-byte shift code is output. That is, in this example, an alternative shift code of xy = 2-1 = 1 byte is output first. In this example, the substitute shift code is null code 00. Then, since a y-byte shift code is output, a 1-byte shift code 01 is output in this example.

Next, two characters "kan" and "kanji" are converted as kanji codes. Next, when 0A at the ninth byte is input, it is determined that it is a kanji OUT code together with F1 at the tenth byte. At this point, S5 shown in FIG.
Works. In this case, since the kanji OUT code is detected, a shift code of y bytes is output first, and then an alternative shift code of xy bytes is output. That is, FIG.
In the specific example, the 1-byte shift code 02 is output first, and the xy = 2-1-byte alternative shift code 00 is further output.

As described above, when the shift code is odd, a flow different from that of the above-described embodiment is used in FIG.
This is because inconvenience occurs when the kanji IN code 01 of the shift code β is placed first in the third byte as shown in FIG. If the kanji IN code 01 is output in the third byte, the alternative shift code 00 output in the fourth byte and the two bytes of the first byte of "kan" in the fifth byte are one kanji code This is because there is an inconvenience of being treated as indicating the FIG. 7 (a)
As shown in (1), the kanji code can be correctly understood by placing the substitute shift code 00 before the kanji IN code 01 in the fourth byte. By using a code that is not affected by the system environment, the substitute shift code 00 is not displayed or printed, has no adverse effect on the system, and is simply replaced with the second byte. There is only the fact that it exists.

Embodiment 5 FIG. Embodiment 1 to Embodiment 4
In the above, a case has been described where, when performing code conversion from a kanji code using a shift code to another kanji code, the shift code is replaced with another alternative code, but in this embodiment, for example, as described above, A case will be described in which a kanji code including an alternative shift code generated by performing the conversion as described in the first to fourth embodiments is converted to a kanji code using the original shift code.

FIG. 8 is a flowchart for explaining this embodiment. In this embodiment, it is assumed that the substitute shift code γ has already been used in the kanji code, and the number of bytes y is one or more bytes. From the kanji code using this alternative shift code γ, the shift code α
The case of converting to a kanji code using is described below.

FIG. 9 is a diagram showing a specific example of this embodiment. In this example, the number of bytes y of the alternative shift code γ
Is 2, and the alternative shift code γ uses a shift IN code and a shift OUT code of “0E0F”. The byte number y of the shift code α is also 2 bytes, and the shift code α is “0AF1”,
Alternatively, the case of a 2-byte shift code “0AF0” will be described. First, in S11, the data shown in the upper part of FIG. 9 is input to the data read buffer. At this point, flag is initialized to zero.

Next, in S12, the character A of the first byte
Is entered. In S13, it is checked whether or not the input first-byte character A is an alternative shift code. In this case, since it is the character A, "false" is performed in S13.
And the process proceeds to S16. In S16, the flag is checked. At this point, the flag is still "0" because the initial value is 0.
Then, the process proceeds to S20. In S20, the character A is converted and output as a one-byte code.

Next, in S12, the character B of the second byte
Is entered. In S13, it is determined that the character B is not the substitute shift code, and the process proceeds to S16. Even at this point, since the flag is 0, it is determined to be "false" and the process proceeds to S20. In S20, the character B is subjected to one-byte code conversion and output.

Next, the data of the third byte is input in S12. In S13, it is checked whether the data of the third byte is an alternative shift code. Since 0E is a shift IN and is an alternative shift code in this embodiment, it is determined as "true" in S13 and the process proceeds to S14. In S14, y-1 bytes are further read from the buffer. In this example, y-1 = 2-1 = 1
More bytes are entered. That is, the substitute shift code “0E0F” in the third and fourth bytes is read here. Further, in S14, the exclusive value (XOR) of the current flag value and 1 is taken, and the new flag value is obtained. Since the value of the flag up to the present time is 0, as a result of exclusive OR with 1, the value of the new flag becomes 1. Next, in S15, y
The byte shift code α is output. In this embodiment, a 2-byte shift code "0AF0" is output.

Next, in S12, the data of the fifth byte is input. In S13, it is checked whether the fifth byte data is an alternative shift code. The fifth byte data is determined to be “false” because it is the first-byte kanji code of “kan”. Next, in S16, the value of the flag is checked. At this point, the flag is 1
Is determined as “true” and the process proceeds to S17. S1
In step 7, one more byte is read from the buffer. At this point, the two-byte code for "Han" is complete. Then, in S18, conversion is performed using a conversion table from Kanji 1 to Kanji 2 prepared in advance.
In S19, the converted data is output.

Next, in S12, the data of the seventh byte is input, and in S13, it is checked whether or not this data is an alternative shift code. Since the seventh byte is the code of the first byte of the "character", it is determined to be "false" and the process proceeds to S16. At this time, since the flag is 1, it is determined to be "true" and the process proceeds to S17. In S17, another one byte is read from the buffer. Next, in S18, conversion is performed using the conversion table from Kanji 1 to Kanji 2. In S19, the converted data is output.

In step S12, the ninth byte of data is input. In S13, it is checked whether the data of the ninth byte is an alternative shift code. 9
Since the data in the byte is 0E, it is determined that the data is the substitute shift code, and the process proceeds to S14. In S14, one more byte is read. And the current flag value and 1
Is exclusive-ORed, and the value of the new flag becomes 0. Next, in S15, a 2-byte shift code "0AF1" is output.

Further, in S12, the character C of the 11th byte
Is entered. In S13, it is determined that the character C is not the substitute shift code, and the process proceeds to S16. Since the flag is 0 in S16, the process proceeds to S20. At 20, the number of characters is converted and output as a 1-byte code.

By the above operation, the code conversion from the code system not requiring the kanji shift code to the code system requiring the kanji shift can be performed without changing the record length after the conversion.

Embodiment 6 FIG. In the fifth embodiment, the case where the input data is created using the conversion method of the first to fourth embodiments is described. However, the input data is the same as that of the first to fourth embodiments. Not only when the data is created using the conversion method described above, but also when data is created in a computer or a system, data such as an alternative shift code is inserted in advance to create the data. May be entered and converted. For example, in a case where a word processor that creates a sentence inserts an alternative shift code “0E0F” of shift IN / shift OUT in advance to create a sentence, a code system in which the shift code is determined by inputting this data It becomes possible to convert to.

Embodiment 7 FIG. In the fifth and sixth embodiments, the conversion from the code system not requiring the shift code to the code system requiring the shift code has been described. Therefore, the present invention can be applied to the case where the number of bytes of the shift code is different.

Embodiment 8 FIG. In the above embodiment, the code conversion of the code system using the one-byte code and the two-byte code has been described. However, the present invention is not limited to the conversion method of the code system using the one-byte code and the two-byte code. It can also be used in a code system using a code consisting of the number of bytes.

Embodiment 9 FIG. In the above embodiment, the case where the code is formed in byte units is shown, but the code is formed in bit units regardless of the case where the code is formed in byte units.
Alternatively, it may be formed in word units or other units.

Embodiment 10 FIG. In the above embodiment, the case of a one-byte code consisting of an alphanumeric code and a two-byte code consisting of a kanji code has been described. Instead, it can be used for conversion of a code system having codes other than the alphanumeric code and the kanji code.

Embodiment 11 FIG. In the above embodiment, the case where the character code is converted has been described. However, the present invention is not limited to the case where the character code is converted, but may be a case where a code other than a character code such as a symbol code or a graphic code is converted.

Embodiment 12 FIG. In the above embodiment, the Japanese code conversion has been described. However, the present invention is not limited to the Japanese code conversion, but may be a code conversion in Chinese, Korean, or other European or American languages.

Embodiment 13 FIG. In the above embodiment, the case where the shift IN code, the shift OUT code, or the null code is used as the substitute shift code, or the case where the shift code is used repeatedly, has been described. If you use
Alternatively, any other code that does not affect the system environment may be used.

[0075]

As described above, according to the present invention, the data length before code conversion and the data length after code conversion can be made the same, and the application program depending on the data length can be compared with the code length before code conversion. Even when operating on the converted data, without changing the application program or minimizing the change,
It becomes possible to operate.

[Brief description of the drawings]

FIG. 1 is a flowchart showing one embodiment of a code conversion method according to the present invention.

FIG. 2 is a diagram showing a specific example of the code conversion system of the present invention.

FIG. 3 is a diagram showing another embodiment of the code conversion system according to the present invention.

FIG. 4 is a diagram showing a specific example of a code conversion method according to the present invention.

FIG. 5 is a diagram showing a specific example of a code conversion method according to the present invention.

FIG. 6 is a diagram showing another embodiment of the code conversion system according to the present invention.

FIG. 7 is a diagram showing a specific example of a code conversion method according to the present invention.

FIG. 8 is a diagram showing another embodiment of the code conversion system according to the present invention.

FIG. 9 is a diagram showing a specific example of the code conversion method of the present invention.

FIG. 10 is a flowchart showing a conventional code conversion method.

FIG. 11 is a diagram showing a specific example of a conventional code conversion method.

FIG. 12 is a flowchart showing a conventional code conversion method.

FIG. 13 is a diagram showing a specific example of a conventional code conversion method.

[Explanation of symbols]

 α, β shift code γ alternative shift code x, y number of shift code bytes

──────────────────────────────────────────────────続 き Continuing on the front page (72) Eiji Fujita, Inventor 5-1-1, Ofuna, Kamakura City Mitsubishi Electric Corporation In-house Research Institute of Information and Electronics (72) Inventor, Yoshinori Kondo 5-1-1, Ofuna, Kamakura City Mitsubishi Electric (56) References JP-A-4-241621 (JP, A) JP-A-5-334039 (JP, A) (58) Fields investigated (Int. Cl. ⁶ , DB name) G06F 5/00 G06F 17/21

Claims (6)

(57) [Claims] A data of a first code system in which a first type code and a second type code having different code lengths are mixed, and both codes are identified by a shift code having a predetermined code length placed between the two codes. In a second code system in which the first type code and the second type code are mixed, and in the code conversion system for outputting the data, the shift code is input by inputting the data in the first code system. A code conversion method comprising: detecting and outputting a redundant code having the same code length as the detected shift code to data of a second code system. 2. A first type code and a second type code having different code lengths are mixed, and both codes are identified by a first shift code having a predetermined code length between the two codes.
The first type code and the second type code are mixed, and both codes are placed between the two codes.
In a code conversion method for converting data into a second code system identified by a second shift code having a code length shorter than the code length of the first shift code and outputting the converted data,
The data of the first code system is input, the first shift code is detected, and the redundant code is added to the second shift code so that the code length becomes the same as the detected code length of the first shift code. Generate the added redundant shift code and
A code conversion method characterized in that the data is output to data of the above-mentioned code system. 3. Inputting data of a first code system in which a first type code and a second type code having different code lengths are mixed,
In a code conversion method for converting and outputting data of a second code system in which a first type code and a second type code are mixed and both codes are identified by a predetermined shift code placed between the two codes, The data of coding system 1 is
A redundant code having a predetermined code length is provided between the type code and the second type code. Data according to the first code system is input, the redundant code is detected, and the same code length as the detected redundant code is used. Wherein the shift code is output as data of a second code system. 4. The code conversion method according to claim 1, wherein the redundant code is a code having no influence on an operating environment operating using the second code system. Code conversion method. 5. In the code conversion method, the first type code is a one-byte type code having a code length of one byte, and the second type code is a two-byte type code having a code length of two bytes. The code conversion method according to claim 1, 2 or 3, wherein: 6. The code conversion system according to claim 1, wherein the first type code is an alphanumeric code and the second type code is a kanji code. .