JPH03256165A - Document allocating processing system - Google Patents

Document allocating processing system

Info

Publication number
JPH03256165A
JPH03256165A JP2053698A JP5369890A JPH03256165A JP H03256165 A JPH03256165 A JP H03256165A JP 2053698 A JP2053698 A JP 2053698A JP 5369890 A JP5369890 A JP 5369890A JP H03256165 A JPH03256165 A JP H03256165A
Authority
JP
Japan
Prior art keywords
allocation
common
specific
unit
processing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
JP2053698A
Other languages
Japanese (ja)
Inventor
Hideki Matsudaira
松平 秀樹
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hitachi Software Engineering Co Ltd
Hitachi Ltd
Original Assignee
Hitachi Software Engineering Co Ltd
Hitachi Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hitachi Software Engineering Co Ltd, Hitachi Ltd filed Critical Hitachi Software Engineering Co Ltd
Priority to JP2053698A priority Critical patent/JPH03256165A/en
Publication of JPH03256165A publication Critical patent/JPH03256165A/en
Pending legal-status Critical Current

Links

Landscapes

  • Document Processing Apparatus (AREA)

Abstract

PURPOSE:To shorten the allocation time of a document by selecting another allocation structure to retry allocation when an allocation structure selected for allocating a specific logical structure is an error. CONSTITUTION:When the subbordinate generator of a structure unit X in a common allocation structure 61 is evaluated, structure units A, B are obtained as lower structure units and a specific allocation structure 62 is formed. When reexecution preprocessing is accessed at the time of failing allocation, the units A, C are obtained as substitutive means by a substitution evaluation acquiring processing 1,102 and a common part A is found out by common part acquiring processing 1,103. The area C which has a fixed size as the attributes of the areas B, C in the structure 61 and has a larger size than B at the time of changing the B to the C invades the area A. Thereby, a common part reallocation unnecessity decision 1,104 shows NO, the specific logical structure unit is returned to the unit arranged before the initially allocated specific logical structure unit by specific locial structure unit specifying processing 1,105 and all the contents allocated to the areas A, B in the structure 62 are canceled by allocation canceling processing 1,106.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は、文書の割り付けを行うシステムに係り、特に
割り付け時間の短縮に好敵な文書処理方式に関する。
DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a system for allocating documents, and particularly to a document processing method that is advantageous in reducing allocation time.

〔従来の技術〕[Conventional technology]

従来の技術は、利用者が特定割り付け構造を規定してし
まうものであり、割り付け時に割り付け失敗した場合代
替手段によって自動的に処理を継続できなかった。なお
、この種の装置として関連するものには、例えば特開昭
62−284461号公報、開平0f−129352号
公報等が挙げられる。また、割り付け失敗時に代替手段
を用いて自動的に処理を継続する考え方はアイ・ニス・
オー8613−2(I 5O8613−2)において論
じられているが、割り付けの効率に関する記述はない。
In the conventional technology, a user defines a specific layout structure, and if an allocation fails during allocation, it is not possible to automatically continue processing using alternative means. Incidentally, related devices of this type include, for example, Japanese Patent Application Laid-Open No. 62-284461, Japanese Patent Application Laid-Open No. 0F-129352, and the like. In addition, the idea of automatically continuing processing using an alternative method in the event of an allocation failure is
Although discussed in I5O8613-2, there is no mention of allocation efficiency.

・2 〔発明が解決しようとする課題〕 上記従来技術は割り付け構造に選択の余地がなく、論理
構造と割り付け構造との間に矛盾は許されないため、書
式の限られた文書しか扱えなかった。また、誤った割り
付け構造を選択したときは利用者の介在なしに別の割り
付け構造を選択できない問題があった。
・2 [Problem to be solved by the invention] The above-mentioned prior art has no choice in the layout structure and cannot allow any contradiction between the logical structure and the layout structure, so it can only handle documents with a limited number of formats. Furthermore, there is a problem in that when an incorrect layout structure is selected, another layout structure cannot be selected without user intervention.

書式を限らない○DA規格に準拠した文書に対しては、
割り付け可能な部分割り付け構造を自動的に選択し、処
理を進めていく過程で、誤った部分割り付け構造を選択
したとき、自動的に別の割り付け構造を選択する。
For documents that comply with the DA standard, which is not limited to any format,
To automatically select an allocatable partial allocation structure and automatically select another allocation structure when an incorrect partial allocation structure is selected in the process of proceeding with processing.

本発明は上記の別の割り付け構造を選択したときに発生
する再割り付けを極力避は効率のよい割り付け処理を行
うことを目的とする。
An object of the present invention is to avoid as much as possible the reallocation that occurs when the above-mentioned different allocation structure is selected, and to perform efficient allocation processing.

〔課題を解決するための手段〕[Means to solve the problem]

上記目的を達成するために、先に選択した割り付け構造
単位と新たに選択した割り付け構造単位に共通な部分構
造がある場合、共通部分の部分構造が固定の寸法を持つ
領域として定義されているか、あるいは、共通部分以外
の部分構造が内容部がすでに割り付けられている共通部
分の領域を侵すことがないかの判定を行うことによって
、該共通部分の割り付けの再試行を避け、再試行過程で
の処理時間の短縮を可能にしたものである。
To achieve the above purpose, if there is a common substructure between the previously selected allocation structure unit and the newly selected allocation structure unit, whether the substructure of the common part is defined as an area with fixed dimensions, Alternatively, by determining whether a partial structure other than the common part will infringe on the area of the common part to which the content part has already been allocated, retrying the allocation of the common part can be avoided and This makes it possible to shorten processing time.

〔作用〕[Effect]

特定論理構造を割り付けるために選択した割り付け構造
が誤りであることを検出した場合、別の割り付け構造を
選択して再試行する。再試行時に、先に選択した割り付
け構造単位と新たに選択した割り付け構造単位に共通な
部分構造がある場合、共通部分の部分構造が固定の寸法
を持つ領域として定義されていること、あるいは、共通
部分以外の部分構造が、内容部がすでに割り付けられて
いる共通部分の領域を侵さないことを満足することによ
って、割り付け処理は該共通部分の再試行を行わないよ
うに動作する。それによって再試行過程での処理時間が
短縮できる。
If it is detected that the allocation structure selected for allocating a particular logical structure is incorrect, select another allocation structure and try again. When retrying, if the previously selected allocation structure unit and the newly selected allocation structure unit have a common substructure, the substructure of the common part is defined as an area with fixed dimensions, or By satisfying that the non-part structure does not invade the area of the common part to which the content part has already been allocated, the allocation process operates to avoid retrying the common part. This can shorten the processing time during the retry process.

〔実施例〕〔Example〕

以下、本発明の一実施例を第1図から第7図を用いて説
明する。
An embodiment of the present invention will be described below with reference to FIGS. 1 to 7.

第2図は、本発明による文書の割り付け処理システムの
構成を示したものであり、構成要素は割り付けプログラ
ム10を記憶するとともに該プログラムに従って処理を
行う処理装置本体1、特定論理構造及び共通割り付け構
造を保持する外部記憶装置2、割り付け結果を表示する
表示装置31、割り付けプログラム10に対してのオペ
レーションを行うキーボード32である。
FIG. 2 shows the configuration of a document layout processing system according to the present invention, and its components include a processing device body 1 that stores an layout program 10 and performs processing according to the program, a specific logical structure, and a common layout structure. , a display device 31 that displays the allocation results, and a keyboard 32 that performs operations on the allocation program 10.

割り付け処理を開始すると、割り付けプログラム10は
外部記憶袋M2から特定論理構造及び共通割り付け構造
を読み込み、共通割り付け構造の一実現例としての特定
割り付け構造を作成して割り付けを行う。
When the allocation process is started, the allocation program 10 reads the specific logical structure and the common allocation structure from the external storage bag M2, creates a specific allocation structure as an example of realizing the common allocation structure, and performs allocation.

第3図は共通割り付け構造と特定割り付け構造の一例で
あり、共通割り付け構造から特定割り付け構造を生成す
る過程を第3図を用いて説明する。
FIG. 3 shows an example of a common allocation structure and a specific allocation structure, and the process of generating a specific allocation structure from a common allocation structure will be described with reference to FIG.

共通割り付け構造の各構造単位は下位構造を規定するた
めの従属生成子と呼ばれている属性値を持ち、従属生成
子を評価することによって特定割・5 り付け構造を決定する。従属生成子には下位構造単位の
不定回数の繰り返しく図中ではRFPと表現)や複数の
下位構造単位からの択一(図中ではCHOと表現)や複
数の下位構造単位の並び(図中ではSEQと表現)が記
述できる。
Each structural unit of the common allocation structure has an attribute value called a dependent generator for defining a subordinate structure, and a specific allocation structure is determined by evaluating the dependent generator. Dependent generators include repeating a lower-level structural unit an indefinite number of times (expressed as RFP in the figure), selection from multiple lower-level structural units (expressed as CHO in the figure), and arrangement of multiple lower-level structural units (expressed as CHO in the figure). Then, the expression SEQ) can be written.

例えば、共通割り付け構造の構造単位A401の従属生
成子として(REP  B)と記述されていた場合、あ
る繰り返し回数、ここでは3回を決定し、A411の下
位構造として構造単位B412、B414、B418を
生成する。同様に構造単位B4O2の従属生成子は(C
HOCD)と記述され、B412、B414. B41
8の下位構造として、それぞれC403あるいはD40
4から生成された構造単位C413、D415、C41
9が生成される。構造単位D404の従属生成子(SE
Q E  F)に従い、D415の下位構造はE416
およびF417となる。
For example, if (REP B) is described as a dependent generator of structural unit A401 of a common allocation structure, a certain number of repetitions, in this case 3, is determined, and structural units B412, B414, and B418 are created as subordinate structures of A411. generate. Similarly, the dependent generator of the structural unit B4O2 is (C
HOCD), B412, B414. B41
As a substructure of 8, C403 or D40 respectively.
Structural units C413, D415, C41 generated from 4
9 is generated. Dependent generator (SE) of structural unit D404
According to Q E F), the substructure of D415 is E416
and F417.

従属生成子を持たないF4O5およびF2O3から生成
された構造単位E416およびF417は、割り付ける
内容部のはいった区・画を下位構造として持つことにな
る。
Structural units E416 and F417 generated from F4O5 and F2O3, which do not have dependent generators, have as a lower structure the partition containing the content part to be allocated.

・6 第4図は特定論理構造の例であり、前記の方法で生成さ
れた特定割り付け構造の最下位構造単位と特定論理構造
の内容部との対応づけをする。これが割り付けである。
・6 FIG. 4 is an example of a specific logical structure, and the lowest structural unit of the specific allocation structure generated by the above method is associated with the content part of the specific logical structure. This is the assignment.

特定論理構造42の内容部421を割り付けるために共
通割り付け構造の従属生成子を定められたルールに従っ
て評価して特定割り付け構造を生成し、内容部を割り付
け可能な最下位構造単位を該特定割り付け構造中から選
び、割り付けを行う。
In order to allocate the content part 421 of the specific logical structure 42, a dependent generator of the common allocation structure is evaluated according to a predetermined rule to generate a specific allocation structure, and the lowest structural unit to which the content part can be allocated is assigned to the specific allocation structure. Choose from among them and make the assignment.

このとき、割り付ける割り付け構造を指示するため特定
論理構造の部分構造単位が割り付け指示属性を保持して
いることがあり、また、以前に割り付けた内容部がある
割り付け構造単位でも領域に空きがあれば内容部を割り
付けることが可能である。
At this time, the substructure unit of a specific logical structure may hold an allocation instruction attribute to indicate the allocation structure to be allocated, and if there is free space in the allocation structure unit that has a previously allocated content part, It is possible to assign a content part.

割り付けを行っていく過程で、割り付け指示属性を満た
せないこと、あるいは、下位に内容部を持たない構造単
位があることにより割り付けが失敗し、代替手段により
再試行を行う。
During the process of allocation, if the allocation fails due to the inability to satisfy the allocation instruction attribute or the presence of a structural unit that does not have a content section below, the allocation is retried using an alternative method.

第5図は、割り付け処理のアルゴリズムを示したもので
ある。図中101は割り付け処理の開始、図中102は
割り付ける特定論理構造単位として先頭の要素を指定す
ること、及び、特定割り付け構造を最上位割り付け構造
単位のみとすることなどの初期処理、図中103は割り
付けるべき特定論理構造単位がまだ存在するかどうかの
判定、図中104は割りイ」け指示属性が割り付ける論
理構造単位にあるかどうかの判定、図中105はいくつ
かの共通割り付け構造単位の従属生成子を評価して特定
割り付け構造の一部を作成し、割り付け指示を満足する
ための処理、図中106は割り付け指示を満足できたか
どうかの判定、図中107は処理中の特定論理構造単位
の下位構造が内容部かどうかの判定、図中108はいく
つかの共通割り付け構造単位の従属生成子を評価して特
定割り付け構造の一部を作成し、特定論理構造単位を特
定割り付け構造単位に割り付ける処理、図中109は割
り付けに失敗したかどうかの判定、図中110は、図中
105あるいは図中108での従属生成子の評価が妥当
でなかったため、図中106あるいは図中109で割り
付けに失敗したと判定したとき、失敗した部分構造に対
する別の部分構造を代替手段として生成する再試行前処
理、図中111は次の特定論理構造単位に割り付ける対
象を進める処理、図中112は本処理の終了を示す。
FIG. 5 shows an algorithm for allocation processing. 101 in the figure is the start of allocation processing, 102 in the figure is initial processing such as specifying the first element as a specific logical structure unit to be allocated, and setting the specific allocation structure only to the highest level allocation structure unit, 103 in the figure 104 in the figure determines whether a specific logical structure unit to be allocated still exists, 104 in the figure determines whether the allocation instruction attribute exists in the logical structure unit to be allocated, and 105 in the figure determines whether a specific logical structure unit to be allocated still exists. A process for evaluating a dependent generator to create a part of a specific allocation structure and satisfying an allocation instruction, 106 in the figure is a determination whether the allocation instruction has been satisfied, 107 in the figure is a specific logical structure being processed Determining whether the subordinate structure of a unit is a content part, 108 in the figure evaluates dependent generators of several common allocation structure units to create a part of a specific allocation structure, and converts a specific logical structure unit into a specific allocation structure unit. 109 in the figure determines whether the allocation has failed, 110 in the figure indicates that the evaluation of the dependent generator in 105 or 108 in the figure was not valid, so the process in 106 in the figure or 109 in the figure When it is determined that allocation has failed, retry pre-processing generates another partial structure for the failed partial structure as an alternative means. 111 in the figure is a process to advance the target to be allocated to the next specific logical structure unit, 112 in the figure is Indicates the end of this process.

第1図は再試行前処理のアルゴリズムを示したものであ
る。図中1101は再試行前処理の開始、図中1102
は、割り付けに失敗した特定割り付け構造と該特定割り
付け構造の基となった共通割り付け構造の従属生成子か
ら別の部分構造を代替手段として生成する代替評価取得
処理、図中1103は割り付けに失敗した元の部分構造
と新たに生成した部分構造との共通部分の構造を抽出す
る共通部取得処理、図中1104は共通部分の構造が固
定の寸法を持つ領域として定義されているか、あるいは
、新たに生成された部分構造の共通部分以外が、内容部
をすでに割り付けた共通部分中の領域を侵すことがない
かの判定、図中1105は、従属生成子を評価して特定
割り付け構造の部分構造を生成する基となった特定論理
構造単位を、再割り付けを行う・ 9 特定論理構造単位として指定する特定論理構造単位指定
処理、図中1106は割り付けに失敗した元の部分構造
に割り付けられている内容部を全て取り消し、新たに生
成された部分構造と元の部分構造を置き換える割り付け
キャンセル処理、図中1107は共通部分以外に割り付
けられた最初の特定論理構造単位を、再割り付けを行う
特定論理構造単位として指定する特定論理構造単位指定
処理、図中1108は割り付けに失敗した部分構造の中
で前記共通部分以外に割り付けられている内容部を取り
消し、新たに生成された部分構造の共通部分以外と元の
部分構造の共通部分以外を置き換える非共通部割り付け
キャンセル処理を示す。
FIG. 1 shows an algorithm for retry preprocessing. 1101 in the figure is the start of retry preprocessing, 1102 in the figure
1103 in the figure is an alternative evaluation acquisition process that generates another partial structure as an alternative from the specific allocation structure whose allocation has failed and the dependent generator of the common allocation structure that is the basis of the specific allocation structure. Common part acquisition processing that extracts the structure of the common part between the original partial structure and the newly generated partial structure, 1104 in the figure indicates whether the structure of the common part is defined as a region with fixed dimensions, or whether the structure of the common part is defined as a region with fixed dimensions or Determining whether a non-common part of the generated substructure will infringe on the area in the common part to which the content part has already been allocated. 1105 in the figure evaluates the dependent generator to determine the substructure of the specific allocation structure. The specific logical structure unit that was the basis for generation is reallocated. 9 Specific logical structure unit designation process for specifying as a specific logical structure unit, 1106 in the figure is the content allocated to the original substructure that failed in allocation. In the figure, 1107 is a specific logical structure unit that reallocates the first specific logical structure unit allocated to a part other than the common part. 1108 in the figure cancels the content area allocated to areas other than the common area in the partial structure that failed allocation, and separates the original area from the area other than the common area of the newly generated partial structure. This shows non-common part allocation cancellation processing that replaces non-common parts of substructures.

再割り付けの例を第1図、第6図、第7図を用いて説明
する。
An example of reallocation will be explained using FIGS. 1, 6, and 7.

第6図は再割り付けを行なわない例であり、図中51は
共通割り付け構造、図中52は生成された特定割り付け
tIt造、図中53は特定割り付け構造52のレイアラ
1〜イメージ、図中54は代替手段の特定割り付け構造
、図中55は特定割り付け構造54のレイ・ 10 ・ アウトイメージ、図中56は各構造単位の寸法属性を表
す属性表である。  − 共通割り付け構造単位Xの従属生成子を評価することに
より、下位構造として(AB)が得られ、特定割り付け
構造52が生成される。割り付けに失敗して再試行前処
理が呼び出されたとき、代替評価取得処理1102によ
り代替手段として(AC)が得られ、共通部取得処理1
103により、共通部Aが求まる。共通割り付け構造5
1中のAの属性として固定の寸法を持つ領域であると定
義されているので共通部再割り付け不要判定1104は
YESとなり、特定論理構造単位指定処理1107で、
特定割り付け構造52中のBに割り付けた最初の特定論
理構造単位を再割り付けを行う特定論理構造単位として
指定する。非共通部割り付けキャンセル処理1108で
特定割り付け構造52中OBに割り付けた特定論理構造
単位の割り付けを取り消し、特定割り付け構造52を特
定割り付け構造54に置換して再試行前処理を終了する
。このとき、特定論理構造単位指定処理1107て指示
された構造単位から割り付け処理を再開するので、特定
割り付け構造52中のAに割り付けられた特定論理構造
は再試行しない。
FIG. 6 is an example in which reallocation is not performed, 51 in the figure is a common allocation structure, 52 in the figure is a generated specific allocation tIt structure, 53 in the figure is a layerer 1 to image of the specific allocation structure 52, 54 in the figure 55 is a layout image of the specific layout structure 54, and 56 is an attribute table representing the dimensional attributes of each structural unit. - By evaluating the dependent generators of the common allocation structure unit X, (AB) is obtained as a substructure, and the specific allocation structure 52 is generated. When allocation fails and the retry preprocessing is called, the alternative evaluation acquisition process 1102 obtains (AC) as an alternative, and the common part acquisition process 1
103, the common part A is found. Common allocation structure 5
Since the attribute of A in 1 is defined as an area with fixed dimensions, the common part reallocation unnecessary determination 1104 is YES, and in the specific logical structure unit designation process 1107,
The first specific logical structure unit allocated to B in the specific allocation structure 52 is designated as the specific logical structure unit to be reallocated. In the non-common part allocation cancel processing 1108, the allocation of the specific logical structure unit allocated to the OB in the specific allocation structure 52 is canceled, the specific allocation structure 52 is replaced with the specific allocation structure 54, and the retry preprocessing is ended. At this time, since the allocation process is restarted from the structure unit specified in the specific logical structure unit designation process 1107, the specific logical structure allocated to A in the specific allocation structures 52 is not retried.

第7図は再割り付けを行う例であり、図中61は共通割
り付け構造、図中62は共通割り付け構造61より生成
された特定割り付け構造、図中63は特定割り付け構造
62のレイアウトイメージ、図中64は代替手段の特定
割り付け構造、図中65は特定割り付け構造64のレイ
アラ1−イメージ、図中66は各構造単位の寸法属性を
表す属性表である。
FIG. 7 shows an example of reallocation, where 61 in the figure is a common allocation structure, 62 in the figure is a specific allocation structure generated from the common allocation structure 61, and 63 in the figure is a layout image of the specific allocation structure 62. 64 is a specific layout structure of the alternative means, 65 in the figure is a layerer 1-image of the specific layout structure 64, and 66 in the figure is an attribute table showing the dimensional attributes of each structural unit.

共通割り付け構造61中の構造単位Xの従属生成子を評
価することにより、下位構造として(AB)が得られ、
特定割り付け構造62が生成される。
By evaluating the dependent generator of the structure unit X in the common allocation structure 61, (AB) is obtained as a lower structure,
A specific allocation structure 62 is generated.

割り付けに失敗して再実行前処理が呼び出されたとき、
代替評価取得処理1102により代替手段として(A 
 C)が得られ、共通部取得処理1103により共通部
Aが求まる。共通割り付け構造61中のBおよびCの属
性として固定の寸法を持つ領域であると定義され、Bを
Cに変更したとき、Bより大きい寸法を持つCはAの領
域を侵すことになる。
When allocation fails and pre-rerun processing is called,
As an alternative method (A
C) is obtained, and common part A is found by common part acquisition processing 1103. The attributes of B and C in the common allocation structure 61 are defined as areas having fixed dimensions, and when B is changed to C, C, which has a larger dimension than B, will invade the area of A.

したがって、共通部再割り付け不要判定1104はNo
となり、特定論理構造単位指定処理1105でAへ最初
に割り(4けた特定論理構造単位より前に、割り付けを
行う特定論理構造単位が戻され、割り伺はキャンセル処
理1106で特定割り付け構造62中のAおよびBに割
すイ・」けた内容部は全てキャンセルされる。このとき
、特定論理構造単位指定処理1105で指示さ汎た構造
単位から割り付け処理を再開するので、特定割り付け構
造62中のAに割り付けられた特定論理構造は割り付け
をやり直す。
Therefore, the common part reallocation unnecessary determination 1104 is No.
Then, in the specific logical structure unit designation process 1105, the specific logical structure unit to be allocated is first allocated to A (before the 4-digit specific logical structure unit, the specific logical structure unit to be allocated is returned, and the allocation is canceled in the cancellation process 1106). All the contents of the A and B digits are canceled. At this time, the allocation process is restarted from the structure unit specified in the specific logical structure unit designation process 1105, so A in the specific allocation structure 62 The specific logical structure allocated to is re-allocated.

〔発明の効果〕〔Effect of the invention〕

本発明によれば、割り付けを進めていく過程で発生する
割り付け失敗のとき、再割り付けを避けるように動作す
るので割り付け時間の短縮が図れる効果がある。
According to the present invention, when an allocation failure occurs in the process of proceeding with allocation, the operation is performed to avoid reallocation, so that the allocation time can be reduced.

【図面の簡単な説明】[Brief explanation of drawings]

第1図は本発明による文書の割り付けの再試行のための
処理アルゴリズムを示した図、第2図は第1図のアルゴ
リズムを適用した割り付け処理システムの構成図、第3
図は共通割り付け構造及び・ 13゛・ 特定割り付け構造の−・例を示す図、第4図は特定論理
構造の一例を示す図、第5図は割り付け処理全体の流れ
を丞した図、第6図及び第7図はそれぞれ再割りイ」け
を行わない−・例及び行う一例を示す図である。 1101・再試行前処理の開始、 1102・・代替評価取得処理、 1103・共通部取得処理、 1104・共通部再割り付け不要の真偽判定、1105
・・特定論理構造単位指定処理、1106・・・割り(
=Jけキャンセル処理、1107・・特定論理構造単位
指定処理、1108・・非共通部割り付けキャンセル処
理。 ・14 ・
FIG. 1 is a diagram showing a processing algorithm for retrying document layout according to the present invention, FIG. 2 is a block diagram of an layout processing system to which the algorithm of FIG. 1 is applied, and FIG.
The figure shows an example of a common allocation structure and a specific allocation structure, FIG. 4 shows an example of a specific logical structure, FIG. 5 shows an overview of the overall flow of allocation processing, and FIG. FIG. 7 and FIG. 7 are diagrams showing an example in which reallocation is not performed and an example in which reallocation is performed, respectively. 1101.Start of retry pre-processing, 1102.Alternative evaluation acquisition processing, 1103.Common part acquisition processing, 1104.Truth/false determination that does not require common part reallocation, 1105
・Specific logical structure unit specification processing, 1106...
= J-key cancellation processing, 1107...Specific logical structure unit designation processing, 1108...Uncommon part allocation cancellation processing.・14 ・

Claims (1)

【特許請求の範囲】[Claims] 1、特定の文書に固有な特定論理構造と複数の文書に共
通な共通割付構造を保持し、文書の割り付け処理に際し
て該特定論理構造及び該共通割付構造に従って割り付け
を行う文書処理において、該共通割付構造の部分が、あ
る構造単位の繰り返し、あるいは、複数の構造単位から
の択一を指定したのに対し、ある繰り返し回数、あるい
は、構造単位の1つを選択して処理を進め、以降の処理
で、特定論理構造の部分構造単位を割り付ける割付構造
を指示したのに対して割付指示を満たせない条件、ある
いは、割付構造単位が持つ領域の大きさが不足して内容
の割り付けが行えずに該構造単位下に全く内容が割り付
けられない条件を検出することによって、先に選択した
のとは異なる代替構造単位を選択し処理を再試行すると
き、代替手段となる構造単位と元の構造単位に共通な部
分構造がある場合、特定条件を満足することによって該
共通部分の再試行を行わずに処理時間の短縮を図ること
を特徴とする文書の割り付け処理方式。
1. In document processing that maintains a specific logical structure unique to a specific document and a common layout structure common to multiple documents, and performs layout according to the specific logical structure and the common layout structure during document layout processing, the common layout When the structure part specifies the repetition of a certain structural unit or a selection from multiple structural units, the process is performed by selecting a certain number of repetitions or one of the structural units, and then proceeding with the subsequent processing. , an allocation structure that allocates a substructure unit of a specific logical structure is specified, but the allocation instruction cannot be satisfied, or the area of the allocation structure unit is insufficient and the contents cannot be allocated. By detecting a condition in which no content is allocated under a structural unit, when selecting an alternative structural unit different from the previously selected one and retrying the process, the alternative structural unit and the original structural unit are A document layout processing method characterized in that when there is a common partial structure, processing time is shortened without retrying the common portion by satisfying a specific condition.
JP2053698A 1990-03-07 1990-03-07 Document allocating processing system Pending JPH03256165A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2053698A JPH03256165A (en) 1990-03-07 1990-03-07 Document allocating processing system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2053698A JPH03256165A (en) 1990-03-07 1990-03-07 Document allocating processing system

Publications (1)

Publication Number Publication Date
JPH03256165A true JPH03256165A (en) 1991-11-14

Family

ID=12950037

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2053698A Pending JPH03256165A (en) 1990-03-07 1990-03-07 Document allocating processing system

Country Status (1)

Country Link
JP (1) JPH03256165A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0452855A (en) * 1990-06-15 1992-02-20 Fuji Xerox Co Ltd Method and device for allocating processing of document
JPH0452856A (en) * 1990-06-15 1992-02-20 Fuji Xerox Co Ltd Method and device for allocating processing of document
JPH0492960A (en) * 1990-08-06 1992-03-25 Fuji Xerox Co Ltd Document processor
JPH04105167A (en) * 1990-08-24 1992-04-07 Fuji Xerox Co Ltd Document processor

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0452855A (en) * 1990-06-15 1992-02-20 Fuji Xerox Co Ltd Method and device for allocating processing of document
JPH0452856A (en) * 1990-06-15 1992-02-20 Fuji Xerox Co Ltd Method and device for allocating processing of document
JPH0492960A (en) * 1990-08-06 1992-03-25 Fuji Xerox Co Ltd Document processor
JPH04105167A (en) * 1990-08-24 1992-04-07 Fuji Xerox Co Ltd Document processor

Similar Documents

Publication Publication Date Title
JP2745794B2 (en) Document processing device
JP3023690B2 (en) Document processing apparatus and method
JP3325168B2 (en) Knit design method and knit design equipment
JPH0594433A (en) Document processor
US5550714A (en) Schematic generator and schematic generating method
EP0579174A1 (en) Storage region assignment method
JPH03256165A (en) Document allocating processing system
JPH08305672A (en) Calculation division optimizing method
JP2019106031A (en) Data processing system and data analysis/processing method
Leverenz et al. Using interactive graphics for the preparation and management of finite element data
JP3395347B2 (en) Document processing device
EP0315172B1 (en) Automatic program generation method with a visual data structure display
JP2831717B2 (en) Data path display device
JP2007272565A (en) Database information display, terminal, and program
JP3048433B2 (en) Programming device for programmable controller
JP2747130B2 (en) Schedule automatic creation processing method
JP3023696B2 (en) Document processing device
JP2527055B2 (en) Shared variable detection processing method in task
JPH06251111A (en) Automatic mesh dividing system being suitable for structure containing perforated part
JP2815588B2 (en) Forgetting return method of virtual memory
JPH0588862A (en) Control program preparing device
JPH02273828A (en) Internal sorting system
Embrechts et al. A parallel Euclidean distance transformation algorithms
JPH01290080A (en) Solid modeling system
JPH04182782A (en) Connection information extracting device