Method and apparatus for specifying layout processing of structured documents

Abstract: A method and apparatus are provided for specifying layout processing of structured documents in computer-based document handling systems. The method and apparatus allow the specification of the generic logical structure of the structured document in terms of relational attribute grammars. According to the invention, these relational attributes have a binary relationship. The generic layout structure for a class of structural documents is also represented in terms of relational attribute grammars. Coordination grammars, also represented in terms of relational attribute grammars, link the elements of the generic logical structure to the generic layout structure. By coordinating the layout and logical structures, many solutions are available. Preferential specifications are developed to resolve any potential ambiguities between the many solutions, and to select a preferred solution. The logical structure is then converted to a layout structure using the preferential specifications to resolve any ambiguities occurring as a result of the coordination.

Description: The present invention relates to the specification of layout processing of structured documents in computer-based document handling systems. Specifically, the invention is directed to a method and apparatus for specifying the layout of structured documents using relational attributed grammars and coordination grammars among the relational attribute grammars. In addition, the present invention is directed to a method and apparatus for specifying preferential constraints to resolve the potential ambiguities in layout structures derived from logical structures and coordination grammars, and using these preferential constraints to reject sub-optimal solutions. Computer based document handling systems are generally divided into four broad categories: text editors and word processing systems; formatters; syntax directed editors; and specialized tools. Most systems have features from more than one of these four broad categories. For documents in which presentational considerations are important, the documents must be submitted to a formatter for preparation prior to presentation. Formatters are non-interactive tools that process a document to produce either a display independent or a device dependent layout specification. Documents are submitted to formatters in the form of descriptions on file and they carry out the processing and return the overall results after a certain period of time. Highlevel formatters work on the basis of a logical description of the document. The user is not required to specify the presentation details desired. The user deals with the logical organization of the document, i.e., the different types of elements that appear in the document, such as, for example, section, paragraph, heading, summary, etc. The formatter handles the layout presentation of these elements. Low-level formatters make it possible to include commands within the document description to enable changes in other characteristics of the document, such as, for example, font, spacing, margins and justification. The present invention is directed primarily to high-level formatters. Most interactive systems allow the user to see the layout of a document as it is being prepared. These interactive systems also separate the logical structure of the documents from the specification of the presentation details. Typically, interactive systems, as well as highlevel formatters, use a grammatical notation to describe the logical structure of documents. These logical structures are mostly hierarchial in nature and tree structures are used to represent them. Figure 1 is an illustrative example of a simple tree structure. The structure of a scientific article, for example, could be represented as a following set of grammar rules, or productions: Article → HeaderBody Header → TitleAuthors Title → CHAR* Authors → CHAR* Body → Section* Section → SectionTitle Paragraph* Section Title → STRING CHAR* Paragraph → Entity* Entity → TextltableentitylList Text → CHAR* TableEntity → TABLE Caption Caption → STRING CHAR* List → Item* Item → ItemMark Paragraph* Item Mark → STRING In the above set of productions, the words appearing in upper case, such as, for example, CHAR, TABLE and STRING are terminal symbols. Terminal symbols have no further internal structure. The remaining symbols are nonterminal symbols. Symbols are also referred to as element types. A production specifies the structure of a nonterminal symbol on the left hand side. For example, according to the first production, an article is made up from a header followed by a body. The operator "*" denotes zero or more occurrences of the symbol preceding it. Thus, the non-terminal title is made up of zero or more occurrences of the terminal symbol CHAR. The operator "I" denotes alternative representations. Thus, an entity, according to the above production, is either Text, a TableEntity or a List. Some systems also provide the ability to attach attributes to element types. Thus a section, for example, could have attached to it an attribute called language with values from the set of possible languages that a particular section may be in. Most systems also provide a facility to describe logical structures of documents in the above described manner. A particular document would then correspond to a hierarchial structure, such as, for example, a tree structure, conforming to the productions describing the relationships between the different elements. Referring to Figure 1, a generic tree structure is shown having a root node, internal nodes and children (also known as terminals). The root node is the base node of the tree. It is the parent of all subsequent nodes shown in Figure 1 as internal nodes. The children, or terminals, are the lowest elemental units of the tree and are descendants of internal nodes. Using such a hierarchial tree structure, the grammar described in a logical structure for a class of documents is called a generic logical structure. A document instance, i.e., a tree conforming to the grammar, is then referred to as a specific logical structure and is a description of an instance of the class of documents. For example, a particular article is an instance of the class of all articles. A different grammar from the one described above describing the structure of a form, would be another example of a generic logical structure with a particular form corresponding to a specific logical structure. The image presented on the screen during editing - as well as the image that is printed at the end of processing in batch-oriented systems - is built up automatically from the specific logical structure of the document. Typically, this is based on presentation rules specifying the way in which each element type in a generic document structure is to be displayed or printed. The manner in which presentation rules are specified varies from one system to another. Typically, known systems use the notion of a property sheet or attribute table attached to each document element type. The attribute table contains, for each type of element defined in the generic structure of the class, a set of characteristic formatting attributes of each element type. Using the article example shown above with respect to logical structures, a possible attribute table for some of the element types is set forth below. A question mark is used for attributes whose value can be changed by the user with the value following the question mark being the default value. Article: FontFamily = ? (Times) MainTextFontShape = ? (Roman) MainTextFontSize = ? (10) MainTextLineSpacing = ? (13) MainHeadingFontShape = ? (Bold) HeadingFontShape = ? (Italic) TextAreaWidth = ? (312) TextAreaHeight = ? (528) AbsoluteTopMargin = ? (100) LeftMargin = ? (100) RightMargin = LeftMargin + TextAreaWidth Language = English PAGINATE (AbsoluteTopMargin, TextAreaHeight) Paragraph: ParagraphNumber = COUNTIN (Section) Indentation = IF ParagraphNumber = 0 THEN 0 ELSE em(FontSize) JUSTIFY (LeftMargin, RightMargin, Indentation, Formatting, Mode, LineSpacing, Language) The above example shows an attribute table with the values of the presentation attributes for two logical document element types, article and paragraph. There are two procedure calls in the attribute table above. These procedure calls are shown as PAGINATE, at the end of the table for ARTICLE, and JUSTIFY at the end of the table for paragraph. These procedures break articles into pages, and paragraphs into lines, respectively. The parameters of these procedures (which can be set in the attribute table) determine the results of these procedures. For example, they determine the image of the document, how it is laid out in pages, and how the paragraphs are broken into lines. There are many disadvantages to using the above described prior art approach. The formatting procedures are buried in the implementation of the system and are inaccessible to the user. Any change to these procedures requires a detailed knowledge of the internal data structures and other mechanisms of the system. The only things the user has control over are the attributes that act as parameters to these procedures. It is also difficult to predict the results of formatting by changing the values of one or more of these parameters without being able to see the result. Furthermore, in most systems, the attribute tables for the presentation rules form a part of the logical structure described in the document. This has the disadvantage that it mixes processing information with logical structure information. Therefore, what is needed is a method and apparatus to separate the specification of logical structures from processing information, such as layout structures, a method and apparatus to specify layout structures, a method and apparatus to coordinate two different kinds of structures (i.e., logical and layout) and a method and apparatus to compute a member of the layout structure given a member of the logical structure such that the layout structure is coordinated with the logical structure. In "Document formatting for interchange between word processors", A. Ananda, Computer Communications, December. 1988, UK, vol. 11, no. 6, pages 319-324, specifies. characteristics of word processors in the form of look-up tables. If the specific word processor does not support certain features of the document to be converted (i.e., when output of the look-up tables are not corresponding to grammars of the word processor), those features are treated so that the information loss is minimal and error messages is issued to the user. However, in this document, ambiguities corresponding to those cases where the group of features of the generic logical structure can be linked to a pluralities of layout structures, based on a coordination grammar, are not processed. The present invention provides a method and apparatus according to any one of the appended claims. Embodiments of the present invention provide a method and apparatus that allows the specification of generic logical structures of documents to be represented as relational attributed grammars; a method and apparatus for specifying the layout structure of the class of logically structured documents as a relational attributed grammar; a method and apparatus for specifying a coordination between logical element types and layout element types as coordination grammars in terms of relational attributed grammars; preferential statements to resolve potential ambiguities or choose among competing layouts derived from the logical structure of a document; to compute an optimal layout for a given logically structured document using the constructions described above. In one embodiment there is provided a method and apparatus for determining optimal layout structures of a structured document given a generic logical structure of the structured document comprises: specifying the generic logical structure of the structured document in terms of relational attribute grammars, the relational attributes being specified in terms of binary relationships; specifying a generic layout structure for a class of structured documents in terms of relational attribute grammars; determining coordination grammars for the generic logical structure of the structured document and the generic layout structure of the structured document and expressing the coordination grammars in terms of relational attribute grammars; linking the generic layout structure to the generic logical structure based on the coordination grammars; and converting specific logical structure to an optimal linked specific layout structure using predetermined preference specifications to resolve any ambiguities generated during the linking of the structures. The present invention will be described further, by way of examples, with reference to the accompanying drawings, in which:- Figure 1 is an illustrative diagram of an exemplary tree structure; Fig 2 is an illustrative tree belonging to a grammar describing article; Figure 3 is an illustrative attributed tree representing an exemplary generic logical structure; Figure 4 is an illustrative attributed tree for an exemplary generic layout structure; Figure 5 is an illustrative logical, layout and coordination tree conforming to an exemplary set of grammars; Figure 6 is an exemplary tree structure highlighting inherent ambiguities in coordination trees; Figure 7 is an illustrative representation of an initial stage in the computation of an optimal layout tree given a logical tree according to the present invention; Figure 8 is an illustrative representation of a first intermediate stage in the computation of an optimal layout tree given a logical tree according to the present invention; Figure 9 is an illustrative representation of a second intermediate stage in the computation of an optimal layout tree given a logical tree according to the present invention; and Figure 10 is an illustrative representation of a final stage in the computation of an optimal layout tree given a logical tree according to the present invention. The invention is preferably implemented on a finite state machine based computer document handling system. An example of this type of system is a programmable microprocessor-based, general purpose computer. However, implementation of this invention is not limited to any particular computer-based document handling system. A finite state machine is required due to the processing requirement which will become apparent in view of the following detailed description of the preferred embodiments. Preferably, documents are entered on the general purpose computer by a user via a known word processing package. In future applications, a scanner, having the ability to differentiate and recognize words, can also be used. Specifications of logical and layout structures are generally transparent to the user. The user will specify the type of document desired and the computer-based document handling system will specify the structure or structures from a library of predetermined structures. In addition, for expert users of the system, a user may specify his own structure, if a desired structure is not available in the system library. As discussed herein, the specified layout and logical structures are then coordinated, linked and optimized using derived coordination grammars and preference specifications. Grammars are rules used for specifying structures (i.e., logical and layout structures) within structured documents. Grammars are a very natural means of specifying the logical structures of classes of documents and are used herein to define the structures of the documents discussed. The detailed description will use a simple class of documents to illustrate the characteristics of the invention. However, it is understood that the invention is equally well suited to highly complex structures. Thus, an exemplary grammar for the logical structure of a very simple class of documents such as, for example, articles could be described by the following grammar G: article → paragraph + paragraph → WORD + These rules are also called productions. The grammar G is merely an exemplary grammar representing a very simple and pared down version of the structure of a realistic article. However, for simplicity and illustrative purposes, the above grammar G describing articles will be used. The operator " + " denotes one or more occurrences of the preceding symbol. The grammar G has two non-terminal symbols (article and paragraph) and one terminal symbol (WORD). This grammar conveys that an article is made up of one or more paragraphs which, in turn, are made up from one or more words. The productions above are called production schemas. An instance of the first production scheme could be, for example: article → paragraph paragraph paragraph This production specifies that an article is made up of three paragraphs. Referring to Figure 2, an illustrative example of a tree that belongs or conforms to the exemplary grammar described above is shown. All the nodes of this tree are labeled with symbols from the grammar G. The root node - the node with no parent - is labeled with the symbol article which is also referred to as the start symbol of G. The leaves of the tree - those nodes which do not have any descendants - are labeled with terminal symbols such as, for example, WORD As can be easily seen from Figure 2, every node along with its children (i.e., its immediate descendants), forms an instance of some production scheme, with the node representing the left hand side of the scheme and the children representing the right hand side of the production scheme. Each of these symbols may have various attributes associated with it as described above in the Background of the specification. For example, the non-terminal article could have an attribute called language. The value of this attribute would reflect the language in which the article is written. Paragraph could, for example, have an attribute called number which reflects the number of the paragraph in the article. The terminal symbol WORD could have an attribute such as, for example, content, the value of which would be the string that makes up the word. Existing systems use simple assignments to give values to these attributes. However, the present invention uses a more logical notation for specifying attributes, their values and dependencies among them. For example, in existing systems the fact that an article is in English would be encoded as an assignment to the variable language. article : language = English However, in accordance with the present invention, an attribute is a binary relationship between the symbols and the value of the attribute. The attribute for language as described above with respect to existing systems would be expressed in accordance with the present invention, as: language (article, English) Thus, the logical predicate of language is satisfied between article and English. Such statements in the syntax presented above are called logical facts. In another variation from existing systems, the present invention associates the specification of attributes with the grammar productions themselves. This allows the specification of dependencies among attribute values of different symbols in a single grammar production. In the following exemplary logical fact: number (paragraph [1], 1) number (paragraph [i + 1], x + 1) if number (paragraph (i),x) The first fact specifies that the number of the left most paragraph is 1. The second logical rule specifies that the number of the (i + 1) st paragraph is x + 1 if the number of the i th paragraph is x. Another exemplary attribute dependency among symbols could be an attribute count whose value reflects the number of paragraphs in the article. The value of such an attribute could be specified by the following logical rule: count (article, y) if number (paragraph [last], y) The above rule specifies that the value of the count attribute of the article is y if the value of the number attribute of its right-most paragraph child is y. In this example, last is a special word that refers to the last item in any repeated sequence. Count is, therefore, a synthesized attribute of article since its value is synthesized from the values of attributes of the children of article. Therefore, for exemplary purposes, we denote G log to be the grammar G along with the above-identified attribute specifications. Figure 3 shows an attributed tree that belongs to G log . The tree is syntactically (i.e., structurally) identical to the tree of Figure 2. However, the tree of Figure 3 has been decorated with attribute values described above. These values satisfy the attribute specifications attached to the productions in G log . These attribute grammars are relational, in that the attribute specifications are given in terms of logical facts and rules. Generic layout structures can also be defined in the same manner as above with respect to logical structures. For example, a very simple illustrative grammar G' describes the layout of a document as a sequence of pages, and each page is a sequence of lines: 1 articleLayout → page + 2 page → line + 3 line → UNIT + The non-terminals in G' are articleLayout, page and line. ArticleLayout is the start symbol of G'. UNIT is a terminal symbol. The grammar G' could then be given some exemplary attributes. For example, the terminal symbol UNIT could have an attribute called content whose value would be the text string that is the actual content held by that UNIT. Another attribute could be an attribute called badness that reflects the compromises that are made in fitting all the UNITS on a particular line. For example, the contents of the UNITS may have to be stretched or squeezed to accommodate all the UNITS on a particular line. The details of the specification of badness are exemplary and are fairly standard in the art. Some other exemplary attributes that may be associated with the line are MainTextLineSpacing, MainTextFontSize, LeftMargin, TextAreaWidth, etc. Such attributes are usually specified for the complete layout structure, i.e., specified at the level of articlelayout, and the various sub-structures such as page and line simply inherit these attributes from their parents. Thus, one could have the following attribute rules attached to the first and the second productions above, respectively: TextAreaWidth(page, w) if TextAreaWidth (articleLayout, w) TextAreaWidth(line, w) if TextAreaWidth (page, w) Other inherited attributes are similarly passed down from the start symbol of the grammar to the other symbols. In this example, G lay will denote the grammar G' with the above described attribute specifications. Figure 4 shows a tree that belongs to the grammar G lay . Once the tree structures of G log and G lay are determined, the logical structures must be linked with the layout structures. This is done at the level of the generic structures. To do this, coordination grammars are derived for relating logical and layout structures. Thus, the following constraints must be met. First, there should be a layout structured tree having a root node labeled with articleLayout corresponding to each logical structure tree with the root node labeled with article. Next, there should be a sequence of layout trees with their root nodes labeled with line, corresponding to each logical structure sub-tree with a root node labeled with paragraph, reflecting the fact that a paragraph is laid out as a sequence of lines. Next, every WORD in the logical structure corresponds to a UNIT in the layout structure. Such coordinations (or linkages), as described above, can also be expressed as grammars. For the coordinations set forth above, the following grammars can be used, each having a single production: G c1 : article → articleLayout G c2 : paragraph → Line + G c3 : WORD → UNIT G c1 , G c2 and G c3 are coordination grammars that link logical elements with layout elements. Coordination grammars are also a very natural place to pass information from the logical side to the layout side. Thus, by attaching the following attribute specification to G c3 : content (UNIT, c) if content (WORD, c) The content of every WORD is transferred to the layout side as the content of the UNIT it is coordinated with. Figure 5 shows an exemplary logical tree T log conforming to G log , a layout tree T lay conforming to G lay and coordination trees linking the logical element nodes with the layout element nodes. Note that the following ordering properties are satisfied by the coordination: 1. If paragraph P 1 appears to the left of P 2 in a logical structure, then its layout image (the sequence L 1 , L 2 , L 3 ) appears to the left of the layout image (the sequence L 4 , L 5 ) of P 2 . Thus, left - right ordering is preserved by coordination. 2. Ancestral ordering is also preserved by coordination, i.e., the layout image of article (which is article layout) is above the layout image of the paragraphs which are lines. A feature of logical, layout and coordination grammars is that the specification of the layout is extraordinarily ambiguous. Given a paragraph, the specification can lay it out in lines in many different ways. Figure 6 shows the logical tree T log as in Figure 5. However, in Figure 6, it has been laid out in a different way, i.e., linked to a different layout tree T lay . Note that generic structures (G log , G lay , G c1 , G c2 , G c3 ) remain the same. According to the present invention, these ambiguities are handled in a very novel and unique way. As described above, paragraphs have been coordinated using G c2 with the single production: G c2 : paragraph → line + In addition, the attribute badness was associated with these lines. An attribute cost may also be associated with these paragraphs. The value of this attribute is obtained by taking the sum of the badnesses of all lines to make up the paragraph, for example. Therefore, this cost attribute can be specified by associating the following rule with G c2 : cost (paragraph, c) if Λ i badness (line[i]b i )Λ Σ i b i = c The above attribute rule specifies that the cost of a paragraph is the sum of the badness values of all lines in the paragraph. As is readily apparent, there are many ways in which to handle the laying out of the paragraph using the above-identified attributes. For example, the user can pick the paragraph with the lowest cost attribute. Informally, such preference information is associated with G c2 by the following statement: PREFERENCE STATEMENT: Min(cost) This specification described choosing the layout of a paragraph having the minimum value of cost. G c2 along with the attribute rule and the preference constraint is called G' c2 . The preference specification provides a basis upon which to determine which layouts are better relative to a chosen standard, such as, for example, cost. Note that cost is merely one of many preferential constraints that can be used and that cost is merely used for illustrative purposes. Using preference statements, the user can also reject sub-optimal layouts based on the attributes given to the preference statement. As shown in the above examples, the logical structure of documents can be represented using attributed grammars. Such grammars describe classes of documents, and each document instance corresponds to a tree of that grammar. Semantic information can also be expressed using attributes. Attribute specification can be attached to the productions of the grammar in the form of facts and rules. Such grammars are called relational attribute grammars, because the attributes are specified as binary relations. This kind of attribute specification should be contrasted with those described in the background where attribute specification is basically used to assign values to variables. In addition, processing information should preferably be totally separated from the specification of logical structure. Layout structures can also be specified as relational attribute grammars. The linkage or coordination among the logical and layout grammars can also be expressed as relational attribute grammars. Any ambiguities in the specification are resolved by using preference specifications to choose layouts with the lowest values for certain attributes being the selection criteria (cost in our example). Though the specification technique is illustrated using simple examples of logical structure, these principles are applicable to all structures that can be described using such relational attributed grammars. Given the above description, the problem of laying out a document (or layout processing) is reduced to the following: given a logical structure grammar G 1 , a layout structure grammar G 2 , and coordination grammars G c1 ,...G ck for them, and given a logical document instance (i.e., a specific logical structure or logical tree), T log ; a layout tree T lay must be determined. T lay must belong G 2 , be coordinated with T log according to the coordination given by the coordination grammars, and must be optimal among the many different such layout trees, i.e., have a minimal value for all selected preference attributes, for example. The process of conforming T lay to the above rules uses existing algorithms and techniques for parsing strings in conformance with grammars. Parsing is well known in the art and is described informally below. Informally, a string is a linear sequence of symbols (nonterminal as well as terminal) of a grammar. Given a grammar G, and a string S, the process of parsing is defined as a process of constructing a tree-structure over S such that the root node of this tree is labeled with a start symbol of G, the leaves of the tree are labeled with elements of the string S and the internal nodes of the tree conform to the productions of the grammar. There are well known algorithms that, given a string of symbols S, and a context free grammar G (note that all grammars referred to have been context free grammars), output a parse tree for S if such a tree exists. If such a tree does not exist, these algorithms output a failure message. Given an attribute specification attached to the productions of the grammar G, there are well known algorithms that, given a parse tree T, can decorate it with attribute values, such that these values satisfy the attribute specification and dependency rules of the grammar. These algorithms are called evaluators. Assuming that such a parser and attribute evaluator are known, the construction of the layout tree proceeds in steps from the bottom up. Figures 7, 8, 9 and 10 demonstrate the construction of the layout tree for a given logical tree in stages. There are as many stages as they are coordination grammars (there are three in the examples set forth above). Figure 7 shows the logical structure tree for the exemplary article. Step 1, illustrated in Figure 8, is used to generate a string of UNITs from the WORDs (which are at the lowest level in the logical structure). The UNITs are not given to us explicitly. What is given is a logical structure tree (see Figure 7). Using the coordination grammar for the lowest level logical symbol, as many UNITs as there are WORDs are generated. The evaluator is then called to compute the content attribute of each UNIT. In step 2, illustrated in Figure 9, the parser is invoked as many times as there are paragraphs. For each such call, a grammar (G II ) that is used by the parser has two productions. The first is G' c2 . The second is: line → UNIT + The string input to the parser is a string of UNITs generated from the previous stage (see Figure 8). Thus, for the parser invocation of the first paragraph P 1 , the string passed to it is the sequence of UNITs generated by stage I for all the WORDs in P 1 . Stage II (Figure 9) builds up the lines in the layout structure. Since the grammar G II is ambiguous, more than one such sequence of lines will be produced. In order to make a selection, the evaluator is called to compute the values of all attributes. In this example, the value of cost is computed for each possible parse (i.e., each way of breaking the paragraph into lines). The parse having the lowest value for cost (or the selected "best" value for any specified preferential constraint) is selected. This process is carried out for all paragraphs. In the third stage, the parsing is done for the article symbol on the logical side. The grammar used for this stage is G III which consists of the production G c1 as well as the following production of G lay : articleLayout → page + page → line + The input string to the parser for this grammar is the sequence of lines generated from stage II. What has been described above is a staged process for building an optimal layout tree for a given logical tree, given the grammatical descriptions of the logical, layout and coordination structures. This type of optimization is called stratified optimization. Thus, the output of any stage is fixed before the next stage is invoked. For instance, there could be some notion of cost attached to pages as well. Such a cost could take into consideration how pages are laid out, how paragraphs are broken across pages and so forth. The procedure that has been described will first get the optimal breaking of paragraphs into lines. These lines will then be input to the parser which will perform the optimal division of the lines in the pages. Thus, optimization is accomplished in strata.

Claims: A finite state machine implemented method of determining optimal layout structures of a structured document given a generic logical structure (fig. 2) specifying said structured document in terms of relational attribute grammars (fig. 3), said relational attributes being specified in terms of binary relationships the method including: specifying a generic layout structure (fig. 4) for said structured document in terms of relational attribute grammars; determining coordination grammars for said generic logical structure and said generic layout structure (fig. 6) and expressing said coordination grammars in terms of relational attribute grammars; and, linking said layout structure to said generic logical structure based on said coordination grammars, characterized in that the method further includes: determining preference specifications for use in resolving potential ambiguities in an output layout structure; and converting said logical structure to the linked layout structure (fig. 10) using said preference specifications to resolve any ambiguities generated during said linking step. A method according to claim 1, wherein said step of converting said logical structure to the linked layout structure further comprises a step of parsing a plurality of linked layout structures based on a set of context free grammars. A method according to either one of claims 1 or 2, wherein during said step of determining coordination grammars for said generic logical structure and said generic layout structure, said coordination grammars are based on linking like generic logical elements and like generic layout elements (figs. 8, 9 and 10). A method as claimed in claim 2, wherein said step of parsing includes the steps of: constructing a tree structure over a string, said tree representing a member of a context free grammar, wherein a root node of said tree structure is a start symbol of said context free grammar; determining a plurality of nodes for said tree structure, said nodes conforming to productions of said context free grammar; and outputting a failure signal if a tree structure cannot be constructed based on said contact free grammar. A method according to claim 2, including for each of said layout structures, evaluating said layout structures based on a weighted value of selected attributes, said weighted value being based on a preference specification; and, determining the optimal layout tree based on said weighted values. An apparatus for outputting layout structures of a structured document in terms of: relational attribute grammars, said relational attributes being specified in terms of binary relationships; including: means for specifying a generic layout structure (fig. 4) for a class of structured documents in terms of relational attribute grammars; and means for determining coordination grammars for said generic logical structure of said structured document and said generic layout structure of said structured document (fig. 6), and for expressing said coordination grammars in terms of relational attribute grammars, characterized in that it further includes: means for determining preference specifications to resolve potential ambiguities in said layout structures; and , means for converting said logical structure of said structured document to an output layout structure of said structured document (fig. 10) using said preference specifications to resolve any ambiguities generated by said linking means. An apparatus as claimed in claim 6, wherein said means for converting said logical structure of said structured document comprising means for parsing said structured document into a plurality of output layout structures based on a context free grammar. An apparatus according to claim 7, wherein said step of parsing includes the steps of: constructing a tree structure over a string, said tree structure representing a member of a context free grammar, wherein a root node of said tree structure is a start symbol of said context free grammar (fig. 10); determining a plurality of nodes for said tree structure (fig. 9), said nodes conforming to productions of said context free grammar. An apparatus according to any one of claims 6 to 8, wherein, in terms of relational attribute grammar, logical structure information of said document is separated from processing information of said document. An apparatus according to claim 7, the apparatus including: processing means for evaluating, for each of said layout structures, said layout structures based on a computing weighted value of selected attributes, said weighted value being based on a preference specification; and means for determining the optimal layout tree based on said weighted values.

Inventors: BROWN ALLEN L JR, MANTHA SURYANARAYANA M, WAKAYAMA TOSHIRO, BROWN, ALLEN L., JR., MANTHA, SURYANARAYANA M., WAKAYAMA, TOSHIRO
Applicants: XEROX CORP, XEROX CORPORATION
Application year: 1994
Main classification: G06F17
IPC codes: G06F17, G06K9