JPH0451834B2 - - Google Patents

Description

[Detailed description of the invention]

[Technical Field] The present invention relates to a character processing device that performs editing processing of characters such as characters. [Prior Art] Conventionally, there have been printers that create consecutive characters (Logotype, hereinafter referred to as LOGO) composed of multiple characters, symbols, etc. Specifically, an enlarged dot matrix that includes character spacing and line spacing that is larger than the dot matrix used to represent characters such as characters is provided, and the patterns expressed therein are used as graphic partial patterns that are continuous in the horizontal direction, for example. By outputting the LOGO pattern as a whole, the LOGO pattern was created. However, by sequentially outputting a specially enlarged dot matrix, only a LOGO pattern consisting of a plurality of partial patterns was output. Therefore, there was a drawback that a specially enlarged dot matrix had to be processed. Furthermore, since it requires processing that is completely independent of normal character editing, there is a drawback that compatibility with normal character editing processing is not considered at all. It is also possible to consider a technique of specifying output intervals for each character and setting any variable output interval. However, the operation for setting is complicated, and it also lacks versatility. In other words, it ends up being something that is handled by experts or something that involves batch processing, as seen in computerized phototypesetting devices. Therefore, using the front screen, it is possible to easily and interactively specify that a plurality of desired character patterns are to be made into one continuous character pattern, and moreover, it can be displayed on the front screen to distinguish it from the others. There was a drawback in that the concept of the present invention of outputting the continuous character pattern as dots without affecting the output position of other character patterns did not exist at all. [Objective] In view of the above points, an object of the present invention is to easily and interactively designate a plurality of desired character patterns as one continuous character pattern using a display screen, and to To provide a character processing device that can display a character pattern on a display screen to distinguish it from others, and can also output a continuous character pattern as dots without affecting the output position of other character patterns. It is in. Other objects of the present invention will become clear from the following description of embodiments with reference to the drawings. [Example] Before specifically explaining the example according to the present invention,
First, terms used to describe this embodiment will be explained. 1 Equal allocation code It can be incorporated into this device by pressing the equal allocation key. When the character strings sandwiched between the equal division codes are printed, they are evenly allocated to the area defined by the equal division codes and output. 2 LOGO (Logotype) code This code can be imported into this device by pressing the LOGO key. When a character string between LOGO codes is printed, the horizontal character pitch is 0. 3. Line-inhibition processing Characters that are unnatural to be placed at the beginning of a line due to the characteristics of the Japanese language are sometimes placed at the beginning of a line during the character processing process. At times like this,
By pressing the Kinsoku key, character strings are automatically rearranged. Non-first-line characters include the following: . ,),． ,,, 『,』, ], }, A, I,
C, E,
O, ya, yu, yo, tsu, ka, ke, ah, y, uh, eh.
O, ya, yu, yo, tsu 4 Line-end prohibition processing Characters that are unnatural to be placed at the end of a line due to the characteristics of Japanese are sometimes placed at the end of a line during the character processing process. In such a case, by pressing the prohibited key, the character strings are automatically rearranged. Characters that cannot end a line include the following: (, ",", [, {, ¥, $$ Next, an outline of an embodiment according to the present invention will be described. In addition to character information, various function information is input from the keyboard. The character information input from the keyboard is displayed on the display. It is displayed on the device, and editing processing such as insertion, overwriting, and deletion can be performed.
Further, the desired input position on the display device can be freely selected by moving the cursor using the cursor keys.
When attempting to print a LOGO, encode a partial pattern of the LOGO and sandwich that code string between LOGO codes. The LOGO code can be input by inputting the LOGO key, and the partial pattern code can be input by providing a key corresponding to the code on the KB. When printing, the character pitch is 0, and as a result, the partial patterns are composited.
A LOGO pattern is output. When attempting to perform equal division printing, the area to be equally divided is specified by an equal division code, and a character string is input between the areas. Here, it is assumed that the space code that precedes and follows the character string does not become a character string to be divided evenly even if it is sandwiched between equal division codes. The equal division code can be input by pressing the equal division key. In order to automatically perform the prohibition process on the character string input in this manner, the prohibition key is pressed. When the prohibition key is pressed, all prohibition characters existing at the end or beginning of a line are removed from that position, as shown in FIG. 9b. As a result, a prohibition code (indicated by a prohibition mark) is inserted as shown in FIG. 9b. Once an attempt is made to insert or delete a character string that is in this form, special processing is performed for the prohibited code. That is, in the case of insertion, the prohibited code is eaten by the character string that exists before it, as shown in FIG. 7b. In deletion, the number of prohibited codes increases as shown in FIG. 8b. By performing such processing, it is possible to minimize the possibility that a character string that has been subjected to prohibition processing once again becomes arranged in violation of prohibition due to editing processing. The CRT string created in this way is
By pressing the PRINT key, it is printed out on printing paper. When printing, equal distribution is specified, and character strings specified as LOGO are printed in the specified layout. When printing a line in which a prohibition mark exists, the prohibition mark is removed and the remaining character strings are printed evenly distributed within the left and right margins. [Block Diagram] FIG. 1 is a block diagram showing one embodiment of the present invention. The CPU is a microprocessor that performs calculations, logical judgments, etc. AB is an address bus that transfers signals indicating the control target. DB is a data bus that transfers various data and is a multidirectional bus. CB is a control bus that applies control signals to various control targets. The KB is a keyboard consisting of keys for inputting character information and keys for inputting functions. In addition to alphanumeric characters, kana characters, and symbols, it is also possible to input codes corresponding to special patterns defined by the user from the character input keys. Function input keys include the following: That is, there are seven types: initialize key, overwrite key, insert key, cursor key, delete key, prohibition key, and print key. CRTC is CRT controller. A data buffer (described later) is displayed on the CRT screen of the display device (described later).
Characters (including symbols) DATA stored in DBuF
is converted into a character pattern and displayed in the form of 8 digits x 4 lines. In addition, a cursor is displayed at a corresponding position on the CRT screen of the display device according to DATA stored in a CR (cursor register), which will be described later. CR is a cursor register, which stores the position of the cursor to be displayed on the CRT screen of the display device. The data buffer DBuF is a data buffer for storing DATA input from the keyboard KB. The capacity is large enough to store character information of 8 columns x 4 lines.> A CRT is a display device that displays character information and a cursor. CG is a character generator for displaying characters on a CRT display device. When printing out character information, the microprocessor CPU is used to convert character codes into character patterns. A character pattern of a 9x7 dot matrix is stored. PRT is a dot printer. Controlled by PRT controller PRTC. 9×1
A thermal printer with a dot (9 dots vertically and 1 dot horizontally) thermal head. PRTC is a PRT controller for controlling printer PRT. The head position of the printer can be freely moved left and right based on the head feed information from the microprocessor CPU, and at the same time, according to the character pattern information from the microprocessor CPU,
You can control the printing of printer PRT. It also controls the carriage return CR and line feed LF of the printer PRT according to the carriage return CR and line feed LF commands from the microprocessor CPU. PRT controller, PRTC
Assume that the lateral position of the thermal head of the printer PRT can be freely controlled in dot units. When printing a character pattern, shift the 9 x 1 dot thermal head horizontally one dot at a time, then vertically move it one dot at a time.
While printing the character part pattern of the column, the entire 9
Assume that characters of ×7 dots are to be printed. RAM is random access memory and is used for temporary storage of various data. Memory RAM includes, for example, LN, CN, AP, RP, which are used by the microprocessor CPU during processing.
This includes registers such as NUM, CNS, CNE, SC, and EC, overwrite flags, OWFG, and other current parameters. The ROM is a control memory in which the control procedures shown in FIG. 2 and subsequent figures are stored. PPB is a print pitch buffer, and the horizontal absolute address of the DATA to be printed (stored in the data buffer DBuF) to be actually printed is written in dot units. Next, the operation of this embodiment will be specifically explained with reference to FIGS. 2 to 19. Here, various parameters and symbols used below will be explained. Each of these is also used as the name of a register. LN: Current parameter that specifies the number of lines CN: Current parameter that specifies the number of digits C _LN,CN : LN line, CN digit data buffer DBuF
Inner code A _LN,CN : Value in PPB of LN line, CN digit, i.e.
C The horizontal position where _{LN and CN} should be printed, expressed in dots. NUM: Parameter indicating the number of character strings CNS: First digit number of the area to be divided evenly CNE: 〃 Last digit number SC: First digit number of the character string to be divided evenly EC: 〃 Last digit number AP: Quotient RP: Remainder [KB Processing] When a key on the keyboard KB is operated, the KB processing shown in FIG. 2 is performed. The control of each step is shown below. Did you have input from 1 KB? 2 DATA input from KB 3 to 10 Execute each process according to the input DATA. To explain each step in more detail, the KB processing starts when the power is turned on. First, in step 1, input data from KB
Wait to see if it exists. If input is received, proceed to the next step. In step 2, input DATA from KB. Input from KB in steps 3 to 10
Execute each process according to DATA. When the input is from the initialize key, initialize key input processing 3 shown in FIG. 3 is executed. When the input is from the overwrite key, overwrite key input processing 4 shown in FIG. 4 is executed. When the input is from the insert key, insert key input processing 5 shown in FIG. 5 is executed. When the input is from the cursor keys, cursor key input processing 6 shown in FIG. 6 is executed. Character key, LOGO
When the input is from a key or a split key, character key input processing 7 shown in FIG. 7a is executed. If the input is from the delete key, delete key input processing 8 shown in FIG. 8a is executed. When the input is from a prohibited key, prohibited key input processing 9 shown in FIG. 9a is executed. When the input is from the print key, print key input processing 10 shown in FIG.
is executed. [Initialize key input processing] If the initialize key is operated now,
After the processing in step 2, an initialization key input process, the details of which are shown in FIG. 3, is performed. First, each step will be explained. 3.1 Set 1 to the cursor register. 3.2 Write all space codes to the data buffer DBuF. 3.3 Overwrite Flag OWFG Set The contents of each of the above steps are further explained below. 3.1 First, before starting input, be sure to press the initialize key and execute the initialize key input process. First, set the cursor register CR to 1, and then
Move the cursor on the screen to the top left. 3.2 Fill in all space codes in the data buffer DBuF and clear the CRT screen. 3.3 Overwrite Flag Set After the above process is completed, it returns to the original state. [Overwrite key, insert key input processing] If the overwrite key is operated,
Set the overwrite flag OWFG to 1,
Return to waiting for key. If the insert key is operated, the overwrite flag OWFG is reset and the process returns to waiting for a key. [Cursor key input processing] If the operated key is a cursor key, the 6th
Each step shown in the figure is executed. 6.1 Cursor register CR increment 6.2 Is the value of cursor register CR 33 or more? 6.3 Set the value of cursor register CR to 1. Advance the cursor one by one according to steps 6.1 to 6.3 above. If the cursor is at the top right corner of the CRT screen, then move it to the top left corner of the CRT screen. [Character key input processing] If a character key is operated, Fig. 7a
The processing shown in is performed. 7.1 Is it overwrite mode (OWFG=1)? 7.2 Is there a Kinsoku code after the cursor position? 7.3 Shifts all the contents from the cursor position to the position before the Kinsoku code one by one. 7.4 Shift all content after the cursor position one step at a time. 7.5 Overwriting input DATA to the cursor location. 7.6 Cursor Key Input Processing 6 The above steps will be further explained. 7.1 Processing differs depending on whether you are in overwrite mode or insert mode. When in overwrite mode (overwrite flag is set) proceed to step 7.5. When in insert mode (overwrite flag is reset) proceed to step 7.2. 7.2 If a Kinsoku code exists after the cursor position, proceed to step 7.3; otherwise proceed to step 7.4. 7.3 The character string after the cursor position must be advanced because characters are inserted, but the character string that is advanced must be after the cursor and up to the Kinsoku code closest to the cursor. Therefore, the prohibition code will disappear. Proceed to step 7.5. 7.4 Send all strings after the cursor one by one. Discard the last character. 7.5 Write input DATA to the cursor location. 7.6 Execute cursor key input process 6 to advance the cursor one step. FIG. 7b is an example of character insertion. In the drawing shown in 7.4, the prohibition mark has been removed, and it can be seen that the influence of the insertion does not spread beyond that position.
Note that the numbers given in Figure 7b are number 7.
This corresponds to the step in Figure a. (All the same below) [Delete key input process] If the delete key is operated, the following steps are executed. 8.1 Is there a Kinsoku code after the cursor position? 8.2 Shift all the contents of the data buffer from the position where the cursor is located to the position where the relevant prohibition code exists one by one. 8.3 Replace the contents of the data buffer at the location where the Kinsoku code existed with the Kinsoku code. 8.4 Shift all contents of the data buffer forward one by one starting from the cursor position. 8.5 Fill the final position of the data buffer with a space code. Each of the above steps will be further explained. 8.1 If a Kinsoku code exists after the cursor position, proceed to step 8.2.
If it does not exist, proceed to step 8.4. 8.2 Move everything from the position where the cursor is located to the position where the Kinsoku code exists one by one. The character where the cursor is located disappears. 8.3 Rewrite the contents of the data buffer at the location where the Kinsoku code exists to the Kinsoku code.
For this reason, a plurality of prohibited codes are lined up at the position. Return. 8.4 Shift all contents of the data buffer forward one by one starting from the cursor position. The character where the cursor is located disappears. 8.5 Fill space code at the end of DATA BUFFER. FIG. 8b shows an example of deletion key input processing. 8.3
In the diagram shown, it can be seen that multiple Kinsoku codes are lined up. [Prohibited Key Input Process] When the prohibited key is operated, the processing steps shown in FIG. 9a are executed. 9.1 Set the line number where the cursor exists to LN. 9.2 Is there a non-end-of-line character at the end of the line? 9.3 For characters that cannot end a line, check how many consecutive characters appear at the end of a line, and set that number as NUM. 9.4 If NUM is greater than 4, set NUM = 3. 9.5 Insert [NUM] Kinsoku codes at the digit number [9-NUM] position (for the LN line). 9.6 LN≧4? 9.7 [LN+1] Is there a non-starting character on the line? 9.8 Find out how many consecutive non-first-line characters exist at the end of the LN line, and calculate the number.
Let it be NUM. 9.9 NUM increment 9.10 LN increment 9.11 LN>4? The contents of each of the above steps will be explained below. 9.1, 9.10, 9.11 Repeat steps 9.2 to 9.10 in order from the line where the cursor exists to the last line. 9.2 Check whether there is a non-end-of-line character at the end of a line. If it exists, proceed to step 9.3 to execute line-end prohibition processing. 9.3 Find out how many consecutive characters that cannot end a line,
Let that value be NUM. 9.4 If NUM is greater than 4, set NUM = 3.
That is, it is assumed that the prohibition process is executed for up to three characters. 9.5 NUM in the digit position represented by the value 9-NUM
Insert the number of Kinsoku codes represented by the value of . (The insertion process is exactly the same as the insertion process shown in FIG. 7a.) Here, 9 is the value of the number of characters in one line+1. Proceed to step 9.10. 9.6 Check if next line exists. if,
If it exists, there is a possibility that first-of-line processing will be performed. If it does not exist, there is no need to perform no-first-of-line processing. Step 9.10
Proceed to. 9.7 Check whether a non-first line character exists on the next line. If it exists, proceed to step 9.8 to perform the no-first-of-line processing. If it does not exist, proceed to 9.10. 9.8 Check whether there are no-start characters at the end of the current line and set the number to NUM. 9.9 Increment NUM. Proceed to step 9.4. (NUM is the number of characters that should be subjected to the prohibition process.) The middle diagram in Figure 9b is a diagram in which the line-end prohibition process is applied to the first line, and the bottom figure is the figure in which the line-inhibition process is applied to the second line. It is a drawing. [Print key input processing] If the print key is operated, the first
The process shown in Figure 0 is performed. 10.1 Pitch Determination Process 10.2 Print Process The above steps will be further explained. 10.1 Determine the horizontal pitch of information to be printed. (Pitch determination process) 10.2 DATA according to the determined pitch
Prints the information stored in BUFFER. (Print Processing) [Pitch Determination Processing] Step 10.1 shown in FIG. 10 will be further explained using FIG. 11a. Each step performs the following processing. 10.1.1 Register LN (line number) = 1 10.1.2 Standard pitch determination processing 10.1.3 Equal division pitch determination processing 10.1.4 LOGO pitch determination processing 10.1.5 Inhibited pitch determination processing 10.1.6 Register LN increment 10.1.7 All Has the processing of the row been completed? Each of the above steps will be further explained. 10.1.1, 10.1.6, 10.1.7 Determine the horizontal pitch for each line from the first line to the last line. 10.1.2 Standard Pitch Determination Process 10.1.3 Equal Pitch Determination Process 10.1.4 LOGO Pitch Determination Process 10.1.5 Inhibited Pitch Determination Process [Example of Pitch Determination Process] Figure 11b shows an example of the pitch determination process. 10.1.0 stored in the data buffer
DATA. The figure shown in 10.1.2 shows the values in the PPB (print pitch buffer) as a result of standard pitch determination processing. The values in PPB are respectively
Indicates the horizontal absolute address at which each character code in the DATA BUFFER will be printed.
In this embodiment, it is assumed that the character pattern consists of a 9×7 dot matrix, and the standard horizontal character pitch is set to 10 dots to print. Therefore, the inside of PPB is as shown in Figure 11b.
It will take the value shown in 10.1.2. In the diagram shown in 10.1.3, the PPB is corrected for the second row by the effect of equal division. This corrects the position where each character of KLM on the second line should be printed. Here, the character code expressed as 99 in the PPB means that printing is not required. That is, there is no need to print the equal division mark. Since the character K is to be printed out at the starting position of the evenly divided area, the print position of the character (the horizontal absolute address of the position to be printed expressed in dots) is 20. Since the letter M will be printed out at the end of the equally divided area, the printing position of the letter will be
It will be 70. Since the letter L will be printed at a position intermediate between the letters K and M, the printing position will be 45. The figure shown in 10.1.4 shows the PPB correction for the third row due to the LOGO printing effect.
The position where the letter R should be printed remains unchanged. Since the letter S must be printed adjacent to the letter R, the printing position is changed to 47. The figure shown in 10.1.5 shows the correction in the PPB due to the forbidden printing effect on the 4th line.
The printing position of the character string character U remains unchanged, and the printing position of the character Z becomes 70. The string of characters sandwiched between the letters U and Z will be evenly distributed between them. [Standard Pitch Determination Process] Step 10.1.2 of the standard pitch determination process shown in FIG. 11a will be further explained with reference to FIG. 12. 10.1.2.1 A _LN,CN = 10 x (CN - 1) (CN = 1, 2, 3..., 8) Using the above steps, determine the horizontal direction to be printed for each character based on the standard character pitch (10 dots). Calculate the address in dots and write it in the PPB. That is, ALN, _CN = 10 x (CN - 1) _CN = 1, 2, 3..., 8. [Equal division pitch determination process] Details of step 10.1.3 of the aforementioned equal division pitch determination process will be explained using FIG. 13. 10.1.3.1 CN=1 10.1.3.2 C Are _{LN and CN} equal division codes? 10.1.3.3 CN increment 10.1.3.4 Is CN>9? 10.1.3.5 CNS=CN 10.1.3.6 CN increment 10.1.3.7 Is CN>9? 10.1.3.8 Are C _{LN and CN} equal division codes? 10.1.3.9 CNE=CN 10.1.3.10 Equal division character count determination processing 10.1.3.11 Equal division processing <Note> C _LN,CN : DATA when the value of LN is the line number and the value of CN is the digit number
Code in BUFFER CN: Digit number The above steps will be further explained. 10.1.3.1 to 10.1.3.5 First, find the beginning position of the area to be evenly divided, that is, the position of the first appearing evenly divided code, and
Set to . Returns if no equal division code is found. (10.1.3.4) 10.1.3.6 to 10.1.3.9 Find the end position of the area to be equally divided, that is, the position of the equal division code that appears corresponding to the position of CNS, and set it to CNE. Return if the equal division code is not found (10.1.3.7) 10.1.3.10 Find the first digit SC, last digit EC, and number of characters NUM of the character string to be divided evenly. Equal division character count determination process 10.1.3.11 Equal division processing to correct the value in PPB Execute the above process from the beginning to the end of one line. [Processing for determining the number of evenly distributed characters] Details of the equally divided character number determining process 10.1.3.10 in FIG. 13 are shown in FIG. 10.13.10.1 CN=CNS+1 10.13.10.2 C Is _LN,CN a character code? 10.13.10.3 CN increment 10.13.10.4 CN≧CNE 10.13.10.5 SC=CN 10.13.10.6 CN=CNE−1 10.13.10.7 C Are _{LN and CN} character codes? 10.13.10.8 CN Decrement 10.13.10.9 CN≦CNS 10.13.10.10 EC=CN 10.13.10.11 SC=EC=CNS 10.13.10.12 NUM=EC−SC+1 Each of the above steps will be explained below. 10.1.3.10.1 to 10.1.3.10.5 Find the beginning of the character string to be evenly divided within the area to be equally divided, that is, the area defined by CNS and CNE (10.1.3.10.2) and set to SC. (10.1.3.10.5) The beginning of the string to be divided evenly shall be defined by the position of the first code other than the space code. If the character string does not exist, proceed to step 10.1.3.10.11. 10.1.3.10.6 to 10.1.3.10.10 Find the end of the string to be equally divided within the area to be equally divided (10.1.3.10.7) and set it to EC.
(10.1.3.10.10) The end of the character string to be evenly divided is defined by the position of the first code other than the space code that appears upwards from the end of the evenly divided area. If the string does not exist, step
Proceed to 10.1.3.10.11. Other time steps
Proceed to 10.1.3.10.12. 10.1.3.10.11 This step comes when there is nothing other than a space code in the equally divided area. Although it does not originally have the meaning of equal division, let us temporarily set SC=EC=CNS. 10.1.3.10.12 Calculate the number NUM of character strings to be equally divided in the evenly divided area. NUM=EC−SC+1 [Equal division processing] The equal division processing (10.1.3.1) shown in FIG. 13 will be further explained using FIG. 15. 10.1.3.11.1 NUM=1? 10.1.3.11.2 A _LN,CNE −A _LN,CNS is divided by NUM−1 and the quotient is AP and the remainder is RP. 10.1.3.11.3 Is RP≠0? 10.1.3.11.4 A _LN,CN = A _LN,CNS + (AP+1) x (CN−
SC) (CN=SC,SC+1,...,SC+RP) 10.1.3.11.5 A _LN,CN =A _LN,SC + _RP +AP×(CN−SC
−RP) (CN=SC+RP+1, SC+RP+2,
…, EC) 10.1.3.11.6 A _LN,CN =A _LN,CNS +AP×(CN−SC) (CN=SC,SC+1,…,EC) 10.1.3.11.7 A _LN,CNE +A _LN,CNS Divide by 2 and get the quotient
Let AP and remainder be RP. 10.1.3.11.8 A _LN,CN = AP (CN = SC) 10.1.3.11.9 Is CNS = SC? 10.1.3.11.10 A _LN,CN =99 (CN=CNS,…,SC−1) 10.1.3.11.11 Is CNE=EC? 10.1.3.11.12 A _LN,CN = 99 CN = EC+1, EC+2,...CNE The above steps will be further explained. 10.1.3.11.1 If the number of characters subject to equal division is 1, proceed to 10.1.3.11.7, otherwise proceed to 10.1.3.11.2. 10.1.3.11.2 Divide the size of the equal division area (A _LN,CNE −A _LN,CNS ) by the number of characters subject to equal division minus 1 (NUM−1), and calculate the quotient by AP.
Let the remainder be RP. 10.1.3.11.3 If RP≠0, proceed to step 10.1.3.11.4. If RP=0, proceed to step 10.1.3.11.6. 10.1.3.11.4 The first RP character in the character string to be equally divided shall have a character pitch of AP+1. That is, A _LN,CN = A _LN,CNS + (AP+1) x (CN-SC) (CN=SC, SC+1,..., SC+RP) 10.1.3.11.5 Let AP be the character pitch of the remaining character string. That is, A _LN,CN = A _LN,SC + _RP +AP×(CN-SC-RP) (CN=SC+RP+1, SC+RP+2,...,
EC) Proceed to step 10.1.3.11.9. 10.1.3.11.6 All character pitches of characters subject to equal division are AP. That is, A _LN,CN = A _LN,CNS + AP) x (CN - SC) (CN = SC, SC + 1,..., EC) Proceed to step 10.1.3.11.9. 10.1.3.11.7 When the number of characters to be evenly divided (NUM) is 1, the character shall be printed in the center of the evenly divided area. Therefore, to find the center position, perform the following calculation. A _LN,CNE +A _LN,CNS divided by 2, quotient AP remainder RP
shall be. 10.1.3.11.8 AP is the printing position of the character. That is, A _LN,CN = AP (CN = SC) 10.1.3.11.9 The steps from 10.1.3.11.9 to 10.1.3.11.12 are print positions other than the character strings subject to equal division that exist in the equal division area. Set all to 99. First, it is checked whether or not there is a character that is not subject to equal division at the beginning of the equal division area. That is, if CNS=SC, it does not exist, and the process proceeds to step 10.1.3.11.11. If CNS≠SC, it exists and the step
Proceed to 10.1.3.11.10. 10.1.3.11.10 Set the print position of all non-equal distribution characters at the beginning of the equal distribution area to 99. That is, A _LN,CN = 99 (CN=CNS,...,SC-1) 10.1.3.11.11 Check whether there is a character not subject to equal division at the end of the equal division area. That is, if CNE=EC, it does not exist and returns. If CNE≠EC, it exists, so proceed to step 10.1.3.11.12. 10.1.3.11.12 Set the print position of all non-equal distribution characters at the end of the equal distribution area to 99. That is, A _LN,CN =99 (CN=EC+1, EC+2, . . . , CNE) At this step, the equal division process ends. [LOGO Pitch determination process] Furthermore, LOGO Pitch determination process shown in FIG.
10.1.4 will be explained based on Figure 16. 10.1.4.1 CN=1 10.1.4.2 C Is _LN,CN a LOGO code? 10.1.4.3 CN increment 10.1.4.4 CN>9? 10.1.4.5 CNS=CN 10.1.4.6 CN increment 10.1.4.7 CN>9? 10.1.4.8 Are C _LN,CN LOGO codes? 10.1.4.9 CNE=CN 10.1.4.10 LOGO Processing Each of the above steps will be further explained. 10.1.4.1 to 10.1.4.5 Search for the beginning of the LOGO area from the beginning of the LN line. If it does not exist until the end, return (10.1.4.4). If the beginning of the LOGO area is found (10.1.4.2), set the first digit number in the CNS (10.1.4.5). 10.1.4.6 to 10.1.4.9 Search for the ending digit number of the LOGO area. If not found by the end of the line (10.1.4.7), return. If the end digit of the LOGO area is found (10.1.4.8), set the end digit number to CNE. (10.1.4.9) 10.1.4.10 Determine the printing position of the LOGO target character string.
(LOGO Processing) Next, proceed to step 10.1.4.3 to search for another LOGO area in the row. [LOGO Processing] The above-mentioned LOGO processing 10.1.4.10 (FIG. 16) will be further explained using FIG. 17. Such processing steps consist of the following steps. 10.1.4.10.1 A _LN,CN = A _LN,CNS +1+7×(CN−
CNS−1) 10.1.4.10.2 CN=CNS+1, CNS+2,…,
CNE-1 10.1.4.10.3 A _LN,CNS = 99 10.1.4.10.4 A _LN,CNE = 99 The steps described above do the following: LOGO processing 10.1.4.10 (Figure 17) 10.1.4.10.1 LOGO target character strings shall be all characters sandwiched between LOGO codes. The printing position of the first character of the LOGO target string does not change. Characters following the first character are printed in close contact with the first character. That is, the characters after the first character are printed at a character pitch of 7 (character width). That is, A _LN,CN = A _LN,CNS +1+7×(CN−CNS−
1) (CN=CNS+1, CNS+2,...,CNE−
1) 10.1.4.10.2, 10.1.4.10.2 Set the print position of the first and last LOGO codes that define the LOGO area to 99. [Kinpitch determination process] Kinpitch determination process shown in Figure 11a (10.1.5)
will be explained using FIG. 10.1.5.1 Is C _LN,8 a forbidden code? 10.1.5.2 CN=6 10.1.5.3 C Are _{LN and CN} prohibited codes? 10.1.5.4 CN Decrement 10.1.5.5 CN<1 10.1.5.6 EC=CN 10.1.5.7 CN=1, SC=1 10.1.5.8 C Are _LN,CN equal division codes or LOGO codes? 10.1.5.9 SC=CN+1 10.1.5.10 CN increment 10.1.5.11 CN>9? 10.1.5.12 SC＞EC? 10.1.5.13 CNS = SC 10.1.5.14 CNE = 8 10.1.5.15 NUM = EC - SC + 1 10.1.5.16 Equal division processing (10.1.3.11) The above processing will be specifically explained. 10.1.5.1 Check whether a Kinsoku code exists at the end of a line.
Returns if it does not exist. If it exists, proceed to step 10.1.5.2. 10.1.5.2 - 10.1.5.6 If a prohibited code exists at the end of a line, the position excluding the prohibited code (there may be multiple consecutive codes) is the end of the character string to be equally divided. Therefore, find the position where a character other than the forbidden code that appears starting from the end of the line exists (10.1.5.3) and use that digit number as the value of EC. (10.1.5.6) 10.1.5.7 to 10.1.5.11 The beginning of the character string subject to equal division is generally the beginning of the line, but if there is an equal division code or
If a LOGO code exists, the position is to the right of that position. Therefore, in order to find the beginning of the character string to be equally divided from the beginning of the line, a code check is performed for each character (10.1.5.8). The first digit number SC of the character string to be equally divided is initially set to 1, but if it becomes necessary to change it (10.1.5.8), the SC value is updated (10.1.5.9). In this way, SC is determined. 10.1.5.12 Compare SC and EC, and if SC≦EC, equal division processing can be executed, so proceed to step 10.1.5.13.
Returns when SC>EC. 10.1.5.13 Set the leading digit number of the evenly divided area. That is, CNS=SC 10.1.5.14 Set the last digit of the evenly divided area. That is, CNE=8 10.1.5.15 Calculate the number of characters in the character string to be divided evenly. That is, NUM=EC-SC+1 10.1.5.16 Determine the printing position of each character. (Equal division process 10.1.3.11) The prohibited pitch determination process is performed using the steps described above. [Print processing] The print processing (10.2) shown in Figure 10 is
This will be further explained using figures. 10.2.1 LN=1 10.2.2 CN=1 10.2.3 A _LN,CN =99? 10.2.4 A Advance the printer head to the position indicated by _LN,CN . 10.2.5 OG figure pattern with C _LN,CN as code
Insert it from there and output it to the printer. 10.2.6 CN increment 10.2.7 CN>9? 10.2.8 Give CR and LF commands to the printer. 10.2.9 LN increment 10.2.10 LN>5? Further explanation of each step 10.2.1, 10.2.9, 10.2.10 Print each line sequentially from the first line to the last line. 10.2.2, 10.2.6, 10.2.7 Print each character from the first digit to the last digit. 10.2.3 When the print position is 99, the corresponding character will not be printed. Therefore proceed to step 10.2.5. Otherwise proceed to step 10.2.3. 10.2.4 Feed the print head to the position to be printed. (Gives head feed instructions to PRTC) 10.2.5 Prints the corresponding characters. Printing is performed by referring to the CG for a character pattern corresponding to the character code (C _{CN, CN} ) of the relevant character, and outputting the pattern to the PRTC. Proceed to step 10.2.6. 10.2.8 Command CR and LF to the printer. (Command CR and LF to PRTC) Print processing is performed using the steps described above. Character processing is performed as described above. [Effect] In view of the above points, an object of the present invention is to easily and interactively designate a plurality of desired character patterns as one continuous character pattern using a display screen, and to To provide a character processing device that can display a continuous character pattern on a display screen, distinguishing it from others, and can output a continuous character pattern as dots without affecting the output position of other character patterns. became possible.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing one embodiment of the present invention, FIG. 2 is a diagram showing a control procedure for keyboard processing, FIG. 3 is a diagram showing initialization key input processing, and FIG. 4 is a diagram showing an overwrite key input process. FIG. 5 is a diagram showing the input process of the insert key,
Figure 6 is a diagram showing cursor key input processing, Figure 7
Figure a is a diagram showing character key input processing, Figure 7 b is a diagram showing data movement, Figure 8 a is a diagram showing deletion key input processing, Figure 8 b is a diagram showing data movement, FIG. 9a is a diagram showing prohibited key input processing;
Figure b shows the data movement, Figure 10 shows the print key input process, and Figure 11a shows the data movement.
Figure 11b is a diagram showing the data movement; Figure 12 is a diagram showing standard pitch determination processing; Figure 13 is a diagram showing equal pitch determination processing; Figure 14 is a diagram showing equal pitch determination processing; Figure 15 is a diagram showing the division character count determination process, Figure 15 is a diagram showing the equal division process, and Figure 16 is a diagram showing the division character number determination process.
Figure 17 is a diagram showing the LOGOPitch determination process.
FIG. 18 is a diagram showing the LOGO process, FIG. 18 is a diagram showing the prohibited pitch determination process, and FIG. 19 is a diagram showing the print process. RAM...memory, ROM...control memory,
DBUF...Data buffer, CPU...Microprocessor, CRT...Display device, PRT...Printer.

Claims (1)

[Scope of Claims] 1. Storage means for storing a character pattern, display means for displaying the character pattern stored in the storage means, and an instruction to form a plurality of desired character patterns into one continuous character pattern. controlling the display means to display the plurality of desired character patterns instructed by the consecutive character designation means in a different display manner in order to distinguish them from other character patterns; display control means for printing the character pattern stored in the storage means as dots; printing means for printing the character pattern stored in the storage means in the form of dots; and a print control means for controlling the printing means so as to output the plurality of desired character patterns by aligning them to the left with an output interval of approximately 0, based on Device. 2. The character processing device according to claim 1, wherein the consecutive character instruction means includes means for specifying the beginning and end of a desired character pattern among the character patterns. 3. The display control means controls the display means so as to display a mark on the same line as the plurality of desired character patterns to indicate that the character patterns are designated by the continuous character designation means. A character processing device according to claim 1, characterized in that: 4. The print control means outputs the following previous desired character pattern as dots at the dot output position of the first character pattern of the plurality of desired character patterns with an output interval of approximately 0. 2. The character processing device according to claim 1, wherein the character processing device controls printing means.