JPS6019236A - Recorder - Google Patents

Abstract

PURPOSE:To rearrange automatically character string data in response to a prescribed rule by specifying the character string data contained in the record information data given from a record information data generating source. CONSTITUTION:The document data and a control command for index are stored to an input buffer 2 from a record information generator 1, and a CPU3 reads a character code out of the buffer 2. In this case, the character pattern corresponding to the read-out input character code is stored repetitively in an output page buffer memory 7 until said control command is read out as long as the absence of a branch command is decided. Then a key word table production routine is called out when the control command is read out, and an index production routine is called out and processed with an index production command. If a record end code or an end code of record information data is discriminated during the process of said production routines, the dot signals equivalent to a page of the memory 7 are converted successively into video signals every scan line and printed out by a page printer 9.

Description

[Detailed Description of the Invention] (Technical Field) The present invention relates to a recording device, and particularly to a recording device for recording documents arranged according to predetermined rules, such as technical manuals, indexes of reports, reference materials, etc., or @ words. Regarding ξ.

(Prior Art) This type of recording device, for example, a printer, has traditionally been widely used as an output device in data processing such as scientific and technical calculations and office processing calculations. With the introduction of the Japanese language, it came to be extremely commonly used as an output device when creating. Therefore, at the end of each Jip-format document, as shown in Figure 1, particularly noteworthy terms are written.
It includes documents that require a so-called index that indicates the corresponding pages of the same initials, etc., and includes so-called manuals, technical manuals, reports, etc.

Conventionally, when indexing and printing this type of document, it was necessary to perform a number of cumbersome tasks when creating the manuscript and when creating print information data to be supplied to the printing device. Ta. That is, first, after creating the main text of the document, extract +fn as a keyword that requires an index, determine which page the keyword is located on, and then extract a large number of keywords, for example, It is necessary to perform work such as determining the configuration layout for each page of the index by sorting according to some rules such as I had to.

Furthermore, you can add the text of the document, etc. to the print information data once created as described above! If J11 or deletion is performed, the page numbers of the pages on which each keyword in the index is located will be misaligned, so the index itself and related data must be corrected to create the entire print information data! This method has the drawback that it requires extremely complicated work.

(Object r19) An object of the present invention is to eliminate the above-mentioned conventional drawbacks and to convert character string data contained in recorded information data from a recorded information data source into 44. Once specified, the specified character string data will be automatically converted according to the specified rules j11].
An object of the present invention is to provide a recording device that can be rearranged.

(Example) The present invention will be described in detail below with reference to the drawings.

First, an example of the configuration of the control system in the recording apparatus of the present invention is shown in FIG. The control system with the illustrated configuration is an example in which character code data and control commands sent from a recording information generation source are input and printed by a recording mechanism such as a laser beam printer that records documents page by page. It shows.

In the illustrated configuration, 1 is a record information generating device consisting of a computer that generates character code data and control commands, 2 is a manual buffer memory that temporarily stores the character code data and control commands, and 3 is a general-purpose microcontroller. It is a central processing unit consisting of a processor, etc.
is a character pattern generator that generates a character pattern from character code data, and 5 is the central 1iiT3
'll A page printer that sequentially sets page numbers of a document being created according to recorded information from the processing device 3,
Reference numeral 6 is a keyword table memory consisting of a random access memory, etc., which sequentially stores keywords consisting of terms necessary for creating an index, and reference numeral 7 is an output terminal which sequentially temporarily stores one page's worth of recorded information. 8 is a printer interface unit that converts the dont signal from the output page buffer memory 7 into a video signal and supplies it to the printer; 9 is a page printer that actually prints character portraits using the video signal. It is.

Depends on the composition to the north; 1. II Prior to explaining the operation of the iJy system, an example of the structure of 11 control commands used for its control operation will be explained with reference to FIG.

First, the control commands include a control command for specifying a keyword consisting of river 1i/i that should be recorded in the index in character string data, and a control command for actually recording the keyword specified by the control command as an index. There are control commands that support this, and there are control commands that support
The control command with the configuration shown in FIG. 3(C) is the former, and the control command with the configuration shown in FIG. 3(D) is the latter.

Therefore, as in the example shown in the first figure, the index does not depend on the order in which the target keywords appear in the text of the document, but rather on some suitable rule, such as the alphabetical order or alphabetical order. )"1, etc., and therefore, when specifying terms that are keywords in the text of a document, the control information and control information required to record the keywords in a single reference page are used. , sort the keywords according to a predetermined rule,
It is necessary to clarify the control information +V required to enable so-called sorting. For example, fN
Considering keywords consisting of letters, the index contains
Although the kanji characters themselves should be printed as keywords, arranging kanji codes, for example, JrS codes, does not serve as an index, and it is suitable for the actual situation to construct an index based on the reading kana of kanji characters. Therefore, when specifying a keyword, it is necessary to clearly indicate the ``printing character J'' necessary for printing the keyword and the ``sort character'' necessary for sorting the keywords, and the control for keyword identification. The command is configured as shown in FIG. 3(B).

That is, following the keyword start command 11, the so I character 12 consisting of kana and the printed character 15 consisting of kanji are divided by the dividing symbol 14 consisting of a shoulder line and arranged i? #
Add keyword end command 13 to L, end j (.In the illustrated example, what is actually printed for keywords with this structure is ``Large'', and when sorting, ``Dog J Naru I 1)'' is printed. However, if we treat hiragana and katakana in the same way as the algorithm for '.

[Similar to the above, for keywords consisting of English letters, for example, as shown in FIG. I will do it. Note that the keyword itself is (
In the case of an I* name, as shown in FIG. 3(A), only the sort character 12 consisting of kana also serves as the print character 15, and the one-division symbol 14 is omitted.

Regarding the structure of the control command for keyword specification such as "-", the control command for indexing and I is shown in Fig. 3 (D).
If a code format that can be easily identified is determined as shown in the following, it is sufficient to provide the index creation command 16, and the code of the index creation command 16 can be placed at an appropriate place in the document text.
For example, by inserting it at the end of a document, it is possible to create an index of the keywords specified so far.

On the premise that the aforementioned control commands are appropriately inserted into the document data, an example of the process of processing recorded information data in an uninvented recording device will be explained with reference to FIGS. 4 to 7. In addition, FIG. 4 is a configuration diagram of the memory area in the keyword table memory 6 for storing keywords, and FIGS. 5 to 7 are flowcharts showing examples of the main control processes of the central processing unit 3. be.

In the control system having the configuration shown in FIG. 2, document data and indexing control commands from the record information generating device 1 are once stored in the input buffer memory 2 and then supplied to the central processing unit 3. The central processing unit 3 performs step S1 in the main flow shown in FIG.
At , the page counter 5 for setting the page number to be added to the character data for one page being created in the output page panzer memory 7 is initialized. Note that it is preferable that the initial value is usually set to "l"°, or that it is appropriately changed by a control command of a separate system. Next, the processing device 3 of the central processing unit 30 inputs/reads a one-character code from the shifter memory 2 in step S2, and if the result determined in step S3 is that the character data is finished, index control is performed in steps S4 and S5. The presence or absence of commands, ie, keyword start command 11 and index creation command 18, is determined. If those control commands have not been read out, the process moves to step S6, and it is determined whether or not the output page buffer memory 7 is filled with character data for one page by 4:tl. If it is not full, the process directly proceeds to step S8, and the character pattern corresponding to the read input character code is fit J71 into the output page buffer memory 7. That is, using the input character code as an address, the character dot pattern corresponding to the input character code is read out from the character pattern generator 4, which is a random access memory or read-only memory that stores dot patterns corresponding to each character code. Te, Chuoen/i? Character dot patterns are stored in the blade page buffer memory 7 under memory position control by the processing device R3. After that, step s2 is performed to read the next one-character code from the human buffer memory 2.
and repeats this process until the above-mentioned index control command is read out.

During this iterative process, when it is determined in step s6 that the blade page buffer memory 7 is filled with one page's worth of character string data, in step S7, the blade I-frA is filled with one page's worth of character string data. The number is sequentially supplied one scan line at a time to the printer interface unit 8, converted into a video signal, and then recorded by the page printer 9. Next, the page counter 5 is incremented by the step S8. Then, the process moves to step S8. Also, during the repetition of the process from step s2 to step S8, step s
4 and step s5, when it is determined that the index control command has been read, if it is the keyword start command 11, the process moves to step s10, calls the keyword table creation routine and processes it, and then returns to step S2.
If the index creation command is 16, the process moves to step Sll, calls the index creation routine and processes it, and then returns to step S2. The keyword creation routine and index creation routine will be described later with reference to FIG. 6 and the i'' Schiff diagram, respectively.

During the main recording process as described above, in step S3, a code indicating the end of recorded information data, such as a code indicating the end of recording work or a code indicating the end of a file, is separated. Sometimes, the process moves to step S12 to determine whether or not character string data remains in the output page buffer memory 7. If the character string data does not remain, the above processing process is completed. After the remaining character data is recorded in step S12, the process is completed.

Next, in the keyword table creation routine shown in FIG. 6, in step S21, the page number storage area 23 in the keyword table memory 6 to J in FIG.
Set the page number and month in Make Counter 5 to 10.
After converting it into a base code and storing it, steps S22 and S
In step S23, counters (not shown) that count the number of sorted characters and the number of printed characters of the keyword being processed are cleared and initialized, and then, in step S24, it is determined that the printed characters exist separately from the sorted characters. [Clear the separate character printing flag J. Then, in step S25, the next one-character code is read, and while the character string data before reading the out-of-date symbol 14, ie, the sorted character string 12, is read, step S28. The process moves to step 528 via S27, and it is determined that the "separate character printing flag" is off, so in step S31, one sort character is stored in the sort character storage area 21 in the keyword table memory 6. After that, in step S32, a sort character storage counter (not shown) indicating the character storage position difference in the same area 21 is incremented, and then in step S25
Next, read the next one-letter code. vJ3 diagram (B)
For an example of reducing the number to ``dog'', the above processing is 2
After repeating the division number 14? times, in step S27 the division symbol 14? If it is determined that the text has been read, the "separate character printing flag" is turned on in step 533, and the process immediately returns to step S25.

1- After reading the next one-character code using the step 5254 that has returned in two consecutive steps, the process moves to step S28 via steps S26 and S27, and the "separate character printing flag" is turned on. If it is determined that the print character storage area 22 in the keyword table memory 6 is
After storing one character's worth of printed characters in , step S30
After incrementing a printed character storage counter (not shown) that indicates the storage position in the area 22, the process returns to step S25, and in the example shown in FIG. 3(B), Storing "dog" in the printed character storage area 22 is completed. Next, if it is determined in step S26 that one keyword end command 13 has been sold after lj&, the process moves to step S34, and after advancing the pointer of the keyword table memory 6 to the position where the next keyword is stored, the keyword table is created. The routine completes all steps and returns to the original main processing step.

As shown in FIG. 3(A), when the sort character and the print character match and consist of the same character string, the character string is stored only in the sort character storage area 21 in the keyword table memory 6, The print character storage area 22 remains blank at the time of initialization.

As described above, each time the keyword start phase <l is read, the process moves to the keyword table creation routine and the keyword table creation process progresses, but the keywords already stored in the keyword table memory 6 are read again. Sometimes, signal processing to determine that the keywords are the same and omit the keyword table creation routine is performed in the accompanying index creation routine.

In the index creation routine shown in FIG. 7, when the index creation routine is called in step S11 in response to the index creation command 1G read in step S5 of the tamadaru processing process, first, in step S4] , the character dot patterns accumulated in the output page buffer memory 7 up to that point are recorded in the page counter 5 in step S42.
is stored in the sorting character storage area 21 in the keyword table memory 6, and sorting is performed in step S43 using the sorting character as a key. At that time, if there are identical keywords, they are grouped as unit keywords, and the page is sorted. A page number is added and stored in the number one storage area 23. Furthermore, if the sorted characters have the same sound, it is necessary to treat katakana and hiragana as the same sorted character, so that the katakana sorted characters are not lined up after all the hiragana sort I characters are lined up. It is also necessary to consider how to handle -1 points, half-18 points, etc.

Next, in step S44, the p+th character in step S9 is processed to 1, and the character dot pattern of the header character "・index" as in the example shown in i l 11 is stored in the output page panzer memory 7. do. Next, Ste.
In step S45, the pointer of the keyword table memory 6 is initialized to point to the already sorted start position, and then each key is processed one word at a time, and in step S45, when all keywords have been processed, the key is 11 Until we part,
The keyword processing described below is performed in reverse 1υ to create an index.

That is, first, in step 347, it is determined whether the first character of the sorted character storage area 21 is the same as the first character of the keyword processed immediately before. Therefore, if it is determined that the first character 1+ has occurred, step S48
In step S51, the heading part of the first right character such as "A" in the example shown in the first diagram is stored in the output page buffer memory 7 while maintaining a 1δ relationship of about 100 yen, and in step S5
Move to 2 and do 4i. At this time, as a result of determining whether the memory area of the output page buffer memory 7 is full in step S48, if necessary, the stored character string data is printed to set the page counter 5. is the same as that performed in steps S8 and S8.

However, as a result of the determination in step S47, if the first literature department has not occurred, the interview will be performed in step S47.
52 and as mentioned above? t l The header part of the @ character is not stored. Further, if necessary, after recording the accumulated data of the output page buffer memory 7 in steps S52 to S54, step S52 is performed.
At step 55, the character string data stored in the print character storage area 22 and the page number storage area 23 in the keyword table memory 6 is transferred to the output page buffer memory 7.
Accumulate in. At that time, if the print character storage area 22 is blank, it is determined that the print character is the same as the sort character, and the character string data stored in the sort I/character storage area 21 is transferred to the output image and to the buffer memory 7. accumulate. In addition, it is necessary to maintain an appropriate positional relationship between the keyword and the page number, as shown in the column 7 in Figure 1.
A dotted line connects the two to make it easier to see.

When the processing of one keyword is completed as described above, the pointer of the keyword table memory 6 is incremented at step 55f (for the next keyword processing), and then the process returns to step 94B. [“bj
Step 8
If it is determined in step S46, the process moves to step S57, and after printing the dot-patterned index character string data stored in the buffer memory 7 to the output page, the process proceeds to step S55.
In step S8, the page counter 5 is incremented, and in step S58, the memory area of the keyword table memory 6 is blanked and initialized, and the process returns to the original main processing process.

In the above explanation, the index was created using kana characters, but it is also possible to easily create an index using kana characters or other foreign characters. The format of the creation command 16 is also, for example,
・You can specify whether the key should be a name, an alphabet, or both, and whether the two-column index in the example shown in the first figure should be made into one or two columns, etc. , or specifying whether the heading section for the Department of Literature should be in the middle of characters, or whether it should be in line units, such as "A" line, "KA" line, etc., can be added as a parameter.

Various extensions can be made to widen the range of index configurations.

Furthermore, the present invention is not only useful for creating indexes, but also for listing references! It can also be used to create .

Further, the recording apparatus of the present invention is LBP, inkjet ".
The present invention can be applied not only to a single link but also to a recording device such as a CRT.

(Effects) As is clear from the above description, according to the present invention, a control command for specifying a keyword in a simple format is included in document data to be recorded by a recording device, and an index is added at an arbitrary point. By embedding the control command to create the statement, 1
) can be extremely easily processed to record information that adds an index to it, and therefore sentences that require indexes such as instruction manuals, +4, technical manuals, etc. 1! Not only is the work of editing documents and creating recorded information data extremely frustrating, but when editing a document, you only have to pay attention to the 11th correction, and you can directly recreate the index itself. There is no need to do this, and the burden of work such as revisions is also reduced, which is a great advantage.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing an example of the configuration and arrangement of an index, FIG. 2 is a Pronk diagram showing an example of the configuration of a control system in the recording apparatus of the present invention, and FIGS. 3(A) to 3(I) ) are line segments each showing an example of the configuration of control commands used in the control system of the recording apparatus of the present invention, and FIG.
FIG. 5 is a flowchart showing an example of the recording information data processing process in the recording apparatus of the present invention, and FIG. 6 is a flowchart showing an example of the keyword table creation process in the processing process.
0-Chart, FIG. 7 is a flow chart showing an example of the index creation process in the process. l...Record information generator, 2...Input buffer memory, 3...Central processing unit, 4...Character pattern generator, 5...Page counter, 6...Keyword table memory , 7... Output page para 2 memory, 8... Printer ink face section, 9... Page printer. Patent applicant Canon Co., Ltd.

Claims (1)

[Claims] A means for identifying character string data in recorded information data generated from a data source, a means for storing character string data identified by the means, and arranging and recording the identified character string data according to a predetermined rule. A recording device comprising: means.