TWI220035B - XML document editor - Google Patents

Abstract

A DTD-compliant XML document editor is disclosed. The XML document editor generates hints for required elements and required element slots automatically in the process of document creation and edition so as to guide the user to produce a valid document, while syntactic violations are avoided at the same time. The editor also suggests optional elements that may be added into the document to be edited. The user requires no knowledge about XML and DTD to edit DTD-compliant XML documents. The editing process is user-interface-neutral, being able to support user interfaces based on tree views, presentation views and forms. By combining the DTD-compliant editing process with the simplicity of forms, a simple XML document editor with forms as its user interface is developed.

Description

1220035 (1) Description of the invention: [Technical field to which the invention belongs] In particular, it relates to a file editor that can generate files that conform to the file format. The present invention relates to an XML file editor, Document Type Definition (DTD). 2. [Previous Technology] (Γ-ensive Mar, llp LangUage.XML). The prototype (ge warm) representation of the pieces. Recently, XML has become the choice of information exchange on the Internet ^ (D〇cumentType De «〇n-DTD) (schema) ^ χΜΜ ^ (v〇c ^^^) to represent various data and documents in XML for commercial packages Software processing. This also has a significant impact on these "utilization levels". XML is the basic material in the production system, the line is edited on the XML production domain. This only requires that various «use and public fox file editors» have sprung up. Come and open your eyes.

The function of the editor (hereinafter referred to as the "X-paper editor") is for users to generate morphological positive 1 (we, M〇rmed) (syntaxvalld), xml 〇 ^ tXML can usually make-read-read special features M, and financial requirements, provide grammar check; Yes. In the edit tree, Naam please. The right grammar of the compilation of the right tree is necessary to check the mosquito system in the grammar, and to correct the grammatical errors in the grammar, modify the text. When modifying the grammar, the manufacturer must have knowledge of the details or format of the file. Otherwise, correct correction cannot be completed. Another kind of practice is that Qiqi provides a rich-language interface for a specific vocabulary. Users do not need to worry about grammar in response. However, it ’s about sending a specific XML language—a set of «ized producer interface, pure art»

The XML editors currently on the market are basically all about the so-called "context-sensitive" editing method. When the user is editing the flat ear file%, the editor can provide instructions or prompts according to the context, so that the reader can understand the editing actions that can be performed afterwards, thereby generating a grammatical file. This approach is quite useful for the user. However, in the visible xml editor technology, the instructions or materials provided by ’, Niu _ completed file technology conforms to the syntax. This is the main reason why most XML editors need an extra syntax checker. The main difference is in its user interface. Recently, various XML editors have emerged. XML editors can be divided into four major categories. The editing principles behind them are similar. According to different types of user interfaces: text display (tree), treeview (treeview), presentation (pr_ ^, and f_base). Most editors support more than two users Interface type. Among them, the text display type XML editor 'allows users to edit tags in the same way as using a document (text) editor. ) Is displayed as a tree. Shooting in the tree can increase the ^ riding node (⑽ 手). The presentation editor uses a variety of different conversion technologies, including: .., coffee, and other conversion methods to display the XML file as the user interface of "WYSIWYG" (—, defeated ㈣ 清 ㈣) for the user interface. Make time. Qi_Yu adverbial vocabulary (help — 丨 ㈣ needs to be customized and supported by technical experts. As for the form-based XML editor is equivalent to a form generator, the form is based on a specific data model (— ^ She1) The data pattern is described by a specific} (胤 format scheme (service) or XML file format definition. The existing form-type xml editor is not careful enough, so it is processing _like XML with care + ^ • There are still difficulties, and it is even more difficult to avoid grammatical errors at any time when inputting data. The above-mentioned conventional XML editor did not strictly enforce the grammar requirements during the file creation process. Edit_ Follow-up text_warnings, review guidance information, including correction of grammatical errors, or mention of Qiu Xi '㈣ 常 ㈤ is not rigorous. Each xml editor often only provides users in early editing mode.' Create and edit XML files with normal grammar and correct syntax as required. 2. [Summary of the Invention] The object of the present invention is to provide a novel xml file editor, which can be used to create a DTD that matches the material. XML file. The object of the present invention is also to provide a new XML file editor that can prevent the edited files from being inconsistent. The purpose of the present invention is also to provide a novel The beautiful document editor, which can create and edit the wealth in the user, automatically generate positive materials and prompts. The purpose of the month is also to provide a novel XML document editor to simplify the creation and editing of users Document procedures. Users do not need to have a special document editor to support the purpose of this document. A novel document editor expertise can also be used to create and edit XML documents using this document editor. The object is also to provide a novel user interface for different types of document editors. The object of the present invention is also to provide a novel XML document editor, which can support form-type user interfaces. XML file editor to make files conform to _. The XML file editor automatically generates the necessary components and necessary instructions during the file creation and editing process. In the editing process, the file will not delay the grammar specification. The XML file editor of the present invention can also generate the built-in components according to user requirements, so that the user knows what components can be added. When creating and editing XML documents conforming to], users do not need to have the expertise of a dish or a teacher. The present invention does not depend on a specific user interface, and can support tree-structured, presentation-based or form-based User interface. Combined with the DTD-compliant editing methods and forms of the present invention, the present invention also provides a simple form-based outline file editor. [Implementation method] The purpose of the present invention is to provide a newly created and edited file. It always conforms to the file type description (DTD-complian) XML file editor. In order to achieve this effect, the file editor (hereinafter referred to as "XML editor") of the present invention has the following functions: Baixian, the file editor The editor needs to enable the user to use the editor to build and edit documents, and the working text DT〇 (AD〇cument Defin. I〇n) ^ scheme requirements. Secondly, the editor of the document, during the investigation period, will need to add some elements to the King of Wealth. In order to make the working document comply with the grammatical requirements (valid), it can automatically generate the prompts for necessary components or contain the necessary components for proper selection. Slot (a slot that allows users to add components to the space). In addition, the document editor can generate component turning slots and appropriate selection hints when requested by the user. '1220035 ’Users do n’t need to have a vocabulary. Again, this file editor can generate DTD files, easy to use, professional knowledge, and ready to use. In use, the user only needs to know the application meaning of the components and attributes (attnbute) in a specific job. From the definition of the XML file, it can be known that any Wei file has a nested (cooked multi-level hierarchy) structure. When judging the document M in the county, you can practice it in the language of each component and its subordinates. Generally, 'in an XML file, the content type of a component (⑽㈣ coffee) is a legal appearance order of regular expression ^ 0 subcomponents. The following' will use a symbol made of "⑽" to represent a regular expression. 1 · _ Y-level automaton (such as Gadi ^ Although not willing to limit the scope of the present invention by any theory, the XI editor of the present invention can be an automaton (aut01 ^^^ ... The regular expression Ε is called a simple regular expression. If the symbols ~ in E only show σσ 3 L for one pound, it can be a deterministic finite automaton (this ⑽ 丨 丨 also like fijte aut〇mat〇n) (), Also known by the automaton (automat) known to P 4 and defined as follows: Each symbol of L in E is the state of G. G also contains two states, namely s and f , Each table shows the I state and the end state (if L contains an empty symbol string, s is also the end state). 2. Conversion function δ (Xi, Xj) = Xj For any χ'ς and X | e follow (Xi); that is, X "immediately follows Xι in some symbol strings in l. 5 (s, Xj) = Xj, for any Xj e first (E ); That is, Xj is the first symbol of some symbol strings in L. 5 Ui, $) 2 f, for any Xie last (E); that is, \ is the last symbol of some symbol strings in L 9 1220035 , Where $ is a special ending symbol added for each symbol. Note that the functions fim⑻, lasUE) and fcUow U) can be calculated by traversing the tree structure of ⑴, with-simple normal formula E = (gang * Take, for example, where c} ^ last (E)-{〇}, i〇ll〇w (a) = follow (bh {ai b, c} 〇 ^ 1oi, 〇w (c) = { } 〇E ^ Glushkov automaton (G) is shown in Figure i. The adjacent edges (edgc) in Glushkov automaton G include several types: if E1 and κ are two pre- and sub-expressions of η, that is, (E1 Deleted as a child expression of E, then for each one ... ㈣㈤) first (E2) ^ G (sequence edge) j (l, v) o (^^ The regular expression E has a natural tree representation (treerepresen her claw) The child expression of E corresponds to the tree-like representation of the tree-like slaves of E.) The _ edge from the starting state $ and the adjacent edge that entered the most, winter-like sadness f are collectively referred to as the "forward edge" (f0rwardedge). For example, ^ is a child expression of F. SU (ldSt (El) and mother-v C first (E1) 'G include -1 iteration edge) (u, v). In terms of $, an adjacent edge It may be both sequential adjacent edges and repeated adjacent edges. A repeated adjacent edge such as a sequential adjacent k is called a "backward edge". The DFA G shown in Figure 1 is used as a "backward edge". ('C) and (b, c) are sequential adjacent edges' and are forward adjacent edges; adjacent edges (s, a), (s, b), (s, c), and (C, f) are Adjacent edges; adjacent edges (a, a), (a, b), (b, a), and (b, b) are repeated adjacent edges and backward neighbors. • All—Subexpression E1 'Let A (E1) represents the symbol in Σ that is covered by E1. For example, when E1 is transformed ... 寸 inch 'A (El) II. Let hable (u) table be in G from state (state) u "reach" (reath) ), That is reachable (u) two {the path from u to z exists in z | G}. Defining the direction of the road as a path that includes only the forward neighbors. Let reach (u) table G The set of states that can be reached from u via the neighboring 10 sides forward ', that is, there is a forward path from u to z in Bu G 丨. Month 1J The definition can be observed as follows: _Youli 1: The forward neighbor of the day is not shaped * jj ^ Xeycle > Proof: The symbols in E can be numbered so that each number increases from left to right. The forward neighbor table is not From the lower-numbered symbol to the higher-numbered symbol. Therefore, no loop is formed on the adjacent edges. There must be some uCA such as and V e f-reachable (x) 〇 Prove: such as El As a symbol, the subsidy theorem is self-evident. Therefore, it is only necessary to prove that E1 also conforms to the subsidy theorem based on the sub-disc · Fengshi of m. It may be 3:

Hast (E2) aEl also conforms to the subsidy theorem 2.

3 last (E2) and last (E1) Hast (E2) U iast (E3)] f-reachable (u) a ν ε (Ε3) 3 first (Ε2), El satisfies the subsidy theorem $ (3) El is a sequence The expression 'is El two (E2, E3), where E2 and E3 satisfy the subsidy 1220035 Theorem 2. For any χ G1 A (p 1, a 1), we can go to> e Λ (E2) or x C Λ (F3) 9 and XCA (L2) (X c A (E3) ), Since E2 satisfies the subsidy theorem ^ ^^-UC flrSt (2) ^ ^ ^, ast (E2). Χ C f-reachab.e (u) i f-reachable (x). Since flm is wide and () g iirst (El), L1 f flrst (p j) is obtained. And because E3 meets the subsidy evaluation? Swordsmanship 2, there must be some wefirst (E3) and M ,! call

(E3) g lasf (El) such that S is in v t i-reachable (w). Because Ei II (pulling F3) and w form a sequential adjacent edge. P ′ 'find a forward path from X to z, Z to w, and finally to veiast (E1). Prove the subsidy theorem 2. Positive subsidy theorem 3: If ΕΓ is E Xiziqi: Too v l_y e reachable (u) and ue regj ^ ahkl ^) 〇, 'Prove · From the auxiliary theorem 2, we can know that in A, in xl, x2 C first (El ) And zl, Z2 C last (ρι), such that ue f-reachable (xl), zl e ^ ', c hable (u), v (? L-reachable (x2), and 7: 2 (;, f-reachable (v). On the other hand, it also exists—the child is allowed to overlap adjacent edges from z2 to xl, and one is repeated adjacent edges from zi to χ2. Therefore, from χ1 to u, Table 7 is connected to j zl, and χ2 , Connected to v, connected to z2, and returned to χ! To form a cycle. Prove the auxiliary theorem 3. χ, The above is the proof for simple expressions. If it is multiple (General regular expression of __ (in the expression When at least one of the expressions σ ^ and ~ I appears twice or more), similar formulas can also be used. For example, for a multiple expression = Canton, α;), the second Each a, in the form of c and c, c or a, is not significant in the plan. Only when this state appears in the messenger interface, it is necessary to distinguish. Ben Qiming's XML The editor can indeed use Glushkov automaton's calculations to find the components that are related to specific components. Let e be composed of the symbols in the symbol set Σ: {yi, y2, ....., ym} The normal expression 逵 々 is its corresponding simple expression, which is composed of the symbols of the symbol set z X η ^ '2' χη}. Eight G h are not Glushkov automata of E and E, such as U. Fan Mi E 'is a component type — pattern, then it shows that M symbolizes her shirt and follows her 彳 -_ s to the heart valley of zhongzhong. That is to say, find a s to 丨, 〇— " 5. Path, you can create a valid file that conforms to the language g. Σ / Although an XML editor produces a file of 0 in the final result, it does not mean that during the file creation and editing process, the files must be inconsistent. The ancient state of sorrow. According to the design of the XML editor of the present invention, the M XML editing in the process of document creation and editing always depends on the working document to maintain the status of "compliant with DTD". The so-called "compliant with dtd, iU", 疋Refers to the formation of child elements of a mother element-a sequence of child elements that fit into the law ◦ sequences to build a positive brother clothing style d, for example, a

The element string acdde does not conform to the syntax, but it is compatible with D and DTD, because acdde is a subsequence of the element string abcdcde which is syntactic. When the XML file editor of the present invention compiles a DTD-compliant file, the user starts editing with a blank file 'and manages the property in Wen Lai's "Wen Shooting" to make sure that the red file matches the user. r to delete the arbitrary element in the working file, and the deleted file obviously still conforms to D DTD. The user repeats the steps of adding and deleting, and can create or edit the required xml file in accordance with the syntax.

A DTD-compliant file should correspond to the state sequence {Z |, z2, ·· .., zp} in a G, where 13 1220035 z! Two s, Zp two ί 'Zj + ie reachable (Zj)' 1 $ i Sp-l. From the perspective of the user, the file that the user sees is the sequence {〇n㈣Z2_ iginal (ZH)}. Here, the main issue is how to find a set of candidate components when the user wants to insert a component in the connected two states ... (for example, between & and u). The required components are selected and added to the editing file so that the file corresponds to DT [). In this case, in the process of editing the XML file, the present invention mainly aims at how to add a DTD-compliant component between the two connected users. Carry out judgement review.x treatment. Asia does not mean that during the file editing process, all components in the file are continuously checked for compliance with DTD. Η Pisces does not mean that during the editing process or the result of editing, all components in the file must comply with Ding ^. 3. Determine the status menu ^ Let C be a set of candidate states that can be inserted between states u and ν, v re reac_u). The candidate states represent "possible" routes from U to V. And, the necessary condition for the state z to exist between u and v is zereachable⑻ and vereachable⑵. However, this condition is not sufficient. Suppose that ⑽⑽aut⑽G represents the regular expression E =, as shown in Figure 2. Due to the external iteration of e (〇Utei. ItemiGn) 'any-state is the delay of any other-state (except s and "). If the state in C only needs to provide the necessary condition, c will always contain all State. This necessary condition is too loose to produce a correct prompt. In the present invention, a thin "minimum candidate state set" technique is used to exclude loops (⑽) and detours (d_.) (Such as unnecessary Backward neighbors) to get meaningful shape_single. In the present invention, the minimum __combination from u to v _ "direct path" (dircCtpath (S)) 'is only allowed to appear in the money selection state set in a few cases. Brother finds the direct way fe as follows: 14 1220035 ⑻. Suppose v g ^ 幽 处 响 面 ^ 补助 subsidy theorem 4 to establish a non- 彳 ❿ ❿ connection_. (If the subexpression is selected as the least subexpression that includes ♦, the path p is called the least backward path.) Prove · ′ Let E2 be the least subexpression in B that contains u and v. And suppose that E2 and all of its superiors ⑽ce_ «state the good money t hold the material and money and the core riding time table. Let E3 be E2 above E2 and correct the left sub-expression to its right forward neighbor. However, _v is included in one of its subexpressions. Therefore, the E expression does not matter whether V is U (forward) reachable. In other words, the direction of V is Hao Bian's state, which is determined by E2. Think of U (forward) -le If E2 is a selective subexpression, then u and v are included in the subexpression of L2

Not reaching V, obviously contradictory. On the other hand, if the expression in II ^ order, E2 two (E3.E4), then the right

One possibility: if u e E4 and v e E3, u cannot reach v and I π. Conversely, if UGE3 9 is contradictory in all cases, it must exist-the reciprocal expression EΓ, the human shield. As can be seen from the subsidy theorem 2, existence ... ㈣㈤) makes state 1 ′ included. Then #rvrf 1 Kl reachabMu) and Z e first (p 丨 make z) a back-adjacent edge, so a connection can be found. And it is clear that P is non-cyclical: Suppose that the number of times of path p dullness P is greater than the path of p and the sub path connecting w to z are forward paths, and the road surface from u to the scale of the path connecting u · is formed. Occurs once in 4 sub-paths. The result of the path from u to V is inconsistent with the previous 15 assumptions M keaehable⑻. Therefore p is acyclic. When searching for a possible path between two components conforming to the DTD file, the method used by the present invention for XML editing includes two methods:

Ull V) gH) A.i Tsuchiya method ^ " U ^ V C f-reaChable (^ ^ V) 'H 4 0 r, Chinese, ^. Calculating by the subsidy theorem 4 is composed of all states on the "non-circular" path from u to v. The status contained in C indicates components that can be inserted in between. (Such as user two. The state on the bribe path, first find the non-circular path, and then use the following circular path method to calculate as follows: 1) If ve Γ-team secret le (L0, then let c = {xe ΣΙ xe Γ 术 hable⑻ and π f-reachable (x)}.!) If not 'Let El * be the minimum iterator expression of the included expression mind, 八 ^ {XGA ^ E1) I-e f-reachable (u) ve f_reachable (x)} 〇 ^ In order to make the document a secretable element for a minimum of eight years, ^ 〇 ... ~, e) satisfies 6 a £ ⑻. Because "" pain 2 picture., Say, a is not a valid test of the forward path; by ^ ,. For the state pair (with) and a), c = {d, e}. Or- . Therefore, (c,

Β · _ | ^ £ Method "u, v) eH 1220035 纥 疋 2 states u and V, where v (, rcachablc (u) and (u, v) c 丨 丨. The circular path method is in Ll and " " To find all possible paths and the states contained in the path, forming a set. If C is not an empty set, the table cannot add an element between 1 and v, r 'here, (u, v) can be a forward neighbor Edges, repeated adjacent edges, or both. If (u, v) is a forward adjacent edge, then the "least candidate state set method" is used to calculate it. On the other hand, if u is an iterati (n) The final state or v is a repeated initial state, or (w when W is a backward neighbor, a new iteration can be inserted between u and v, that is, the symbol contained in it is added to c. The method is as follows: ,) If (u, v) is a neighbor edge, then let C = {X € Σ | X e f-reachable (u) and vf f-reachable (x)}, and i) as for some E Iterative sub-expression Γ, u C last (El *), letting El be the largest one, then let Cl be {X e A (E1) | V e r-reachable (x)}, and let c = c UC. ii) If E2 *, vefirst (E2 *) is an iterative expression for some E, let E2 be Are the largest, then let C2 = {x e A (E2) | X e f-reachable (u)}, and let c = c 1] C2. Π} If no ((u, v) is the backward neighbor), then let E3 * be the largest iterative subexpression in C, and satisfy u C last (E3) and ve first (E3), let C two A ( E3). Glushkov automaton illustrated in Figure 2 is still used. For the state pair (a, b), c = j means that no element can be inserted between a and b. For the state pair (b, d), we get C: = {c}. Paired state ~ paired (’C) because c e firsi (c), so C = {c} ′ means that the user can repeat c. For the pair of pairs of su (c c), since it is the back neighbor, we can get C 2 丨. The user can add another iteration C ° between the two iterations. For the status column (e, f), because ee last (e) and e C last (E) and E is an external anti-fungal expression 17 1220035, This gives C = {a, b ^ e}. Here, the user can add the internal iteration ^ join-external iteration. This post ^ XML Zip can be a fine-tuned component. In order to reduce the user's workload when adding components, the editor of the present invention, after the user adds a component, is Eta running-"Bina", and the user chooses to join. Here's the "must-correct" technique: Gu Baoshou takes the elements that are present in the grammar file. The definition also applies to blank documents at the initial stage. Take the -regular expression Ύ_ w as an example. Fine, one must be fine. C (or b) becomes a necessary element after the object is conscious. As stated, "essential components" are components that are present 'in all documents containing the currently edited document. Therefore, a necessary element existing between ♦ corresponds to the state z, which will satisfy the condition that "all paths from U to V pass z". This state element is generally called a wearing point (~ tlonpojn〇〇a ^^ p1 ^^^, Γ, ^: two states. The method of finding nodes is a known technology to those in the industry. Any suitable method The computer calculates the difference, finds a job, and forwards the day. For example: Che-Lion "maximum flow ^^ (maximumflow, ikealgorithm), a necessary element between u and v. If there is more than one joint point, you can repeat this Calculated to get correct results. Β View of the invention [The editor not only generates prompts for adding components, but also generates "component slots" that are never 'for users to fill in components. For example, if there are two Adjacent (auxiliary) elements_ ^ All valid (syntactically) documents including this working paper # contain at least one time between the two adjacent elements' XML editing of the present invention _ automatic generation-prompt , Display—component slot, 1220035 ί, the user fills in a component that can be filled in. This component slot is called a "essential component slot". Because the document being edited now conforms to the grammar, the user must be in the component In the space of the slot, enter the appropriate component. When the component slot is created, the editor of the present invention also generates a corresponding component menu. Therefore, the user can select the required component from the menu, fill it in the component slot, and complete the process of adding components. Another regular expression ( a, (b / c)) as an example. When the system generates the necessary component a, it also generates the ik square, the necessary component slot after a ', and a menu showing b & c. Therefore, the user can choose between & and You can choose one of them and fill in the necessary component slots. The value editor, the XML editor of the present invention generates the necessary component slots only when the working file does not conform to the grammar. When all the necessary components that are missing are When it is filled in, and the system no longer generates the necessary component slots, the file will comply with the syntax. In addition to the above-mentioned necessary component prompts and necessary component slots are automatically generated, the editor of the present invention can generate _component readings when the user wants them "Stop slot". In the design of this editor, when an individual wants to add a component, it must be marked to the exact position where the component must be recognized. Users only need to create existing components. Lin Kao (for example, highlighting), and Ask the system to generate components that are close to the wealth, and you can add mosquito components. «Ming Dish Editor is Xie Shanger. Touch" ㈣㈣turn the component slot ", and you can add components in _, It is called "optional components". The editor of the present invention also generates a selection of Z Chen Pei. The element is added to the element in the slot. The method is the same as necessary. Define a regular «style㈣ |. At the beginning of the year, the fox is necessary to produce a class 19 1220035 7 'The file is sab. After calculation using the circular path method, a set of candidate states c' pair ,, ') and S 'C- ()' For the state of sadness, "For the state of (b 0, cu). Therefore, the XML editor of the present invention is between states s and a, and between b and" An optional component slot can be created between them, but not between a and b. The idea of port 9 is that the component slot is just the frame of the component, not the real component. In other words, the element hate is just a small piece of presents. The View Editor can remove component slots from the user interface at the user's request. The XML editor of the present invention generates prompts for necessary components and a method for selecting component slots, as shown in FIG. 3. FIG. 3 shows a method for generating necessary component prompts and selecting component slots by an XML editor according to the present invention, and a flowchart. As shown in _, at ⑽), the XML editor gets stored in the working file-paired states ^ u and V. Calculate at (302) to get the adjacent relationship (u, v) of uAv. (3) After comparing the obtained adjacent relationship (u, v) with Η '(a set of adjacent relationships in HM), decide whether (u ^ is an element in Η. If (U, V), H, then Find the existing node in the path formed by (304), and display the status represented by the node in (305), and become a menu. In (306), make the user display Select in the status menu and input the necessary components, and in ⑽) the XML editor adds 2 necessary components to the file, and in the corresponding G | ushkavava coffee, add the gas state 'back Step ⑽). Conversely, if the result in u) is u v) e h, then the _ editor 1 is expected to find __yuanlai. If the producer has this request, the editor is presumably looking for possible optional components. If a possible component is found, it is displayed in ⑶g) = using the component slot and possible components for the user to fill in. If the individual shows ^ 20 1220035 on the (Sichuan) surface to fill the optional component with the file slot, the editor fills the component in the appropriate position in the working file at (312). At (313), the XML editor judges again whether the user has requested to display other optional component slots. If yes, it returns to step (309), otherwise it completes the operation at (314). If the user rejects all suggested components at (311), the operation moves to (313). If the optional file cannot be found in step (309), then "No optional component" or the corresponding prompt is displayed in (3 15), and go to (313). However, if there is no request for the user to select a component in step (308), the operation moves to (314), and the operation ends. In the above process, if the expression E is a multiple expression, that is, the states contained in E repeatedly appear in the order, then the states appearing later can be replaced by other states. In the process of editing the XMl g of the present invention to generate a component slot between states, it is also calculated-the state set c, ^ Σ can be compared to a candidate component row C, £ Z, which is replaced by the component shot, and its towel Σ | y origmal (x) 'For some xe c, that is, y replaces X, and exists in c ,. When the user selects a component in c, such as y, the XML editor of the present invention compares 乂 π to π. And add X to the working file. The 4 σ DTD XML Document Editor II of this July can be used as a document for a variety of user interfaces [placed in the lower layer of Shishijie_, not subject to user_Wei restrictions. Because the first manufacturers can design a variety of user interfaces on the XML file editor of the present invention, whether they are tree-like Wei, presenting cranes, and silk bills. The following interface is used as an example to illustrate the application of the XML file editor in the present invention. It is needless to say that the patent scope of the present invention is not limited to the method of this example. In the embodiment of the present invention, a case of a medical CDA can be taken as an example. Utilizing the fox 21 of the present invention and its form-type user interface, a document conforming to Ding [) is generated. Figure 4 is the diagram of the top-level form of the user interface when the XML file is created and created in this month. As shown in the figure, two layers of elements are shown in the form. Levekne contains 2 necessary sub-elements dinica, headu, and body. The cimiCaj —d〇cument_header contains 5 required child elements. The body is 3 _ 1 necessary element slot ′ as its sublayer, and users can add components to the slot. The necessary components mentioned above mentioned necessary element slots are automatically generated by the editor. Used in the system-parameter lFh-ΜΠ practice ~ when shouting no-form number of component layers that should be displayed. In the—form, the bottom-most element of the HyperMk (hypedmk) is presented to link to its child components (such as sub-components are magic. When the user selects the component, it can be displayed—the sub-form , On which the components of its child layer (and grandchildren's components, below_) are displayed. However, the child form may still have its child form, so the child form can be infinitely extended. It should be noted that 'such as LEVEL —LIMIT value is larger At the same time, the displayed form basically forms a tree-like structure. Right-to-time, distorted „pulse__, without comprehending the position of the input or viewing components' also seems confusing visually. Therefore it is generally recommended to LEVELUMi Ding is set to a small value 'to make the picture closer to the form, rather than a tree structure. Of course, anyone who is a Siyi can set the value of LEVEL-L Xie to an appropriate value, and break the form The number of layers in the age. The job document type Wei file editor is very important, because the form type is not easy at the same time. The full picture of the xml file. In order to show all the buttons of the optional component slot, as shown in Figure 4, each form is attached Two buttons,-to hide the displayed element In addition to the slot. Another way is to display only the selected component slot located near the selected component. When the producer moves the cursor to—the component, the XML editing window appears—the small “⑽Talk from” icon (_) displays After the thank you (same column), as shown in Figure 4. If the user presses the icon, "22 1220035" will appear in the remote component slot near the component, as shown in Figure 5. Here The proximity range is set to 2 so the maximum number of optional component slots displayed before and after the specified component is 2. Conversely, if the user moves the pointer to another position without pressing the "OPTIONAL" icon, the "〇pTI〇NAL "The icon disappears. As shown in Figure 5, the user can select the-component to fill in the Tt piece in the candidate form automatically generated by the XMU editor. Suppose the user selects one of the" _㈤ "·, a section component is generated, and the" secti0n "component is clicked to generate a subform, and the user can edit the subcomponents and grandchild components of the" section "in this subform. Figure 6 shows User adds some attributes to this subform Schematic diagram of the form after the child component. The attributes are displayed before the child component. As shown in Figure 6, "When my user moves the pointer to a component or an attribute, three small icons" C) P ™ NAL " "DELETE" $ "C_GE" is generated in a row and displayed in the same row as the item or attribute. Among them, "DE DE" (deleted) and "CHA position" (modified) only appear when the component is allowed to be deleted or modified. This month's XML document editor provides a form-based user interface that supports the adjustable, dynamic structure of tree-shaped, simple, and flat files with a limited number of layers. The XML · document editor of the present invention can worry about the grammatical problems of the file, and generates component slots when the user needs it, so that the user can fill in the ^^ files. As a form generator based on XML data model. The invention; XML to support a variety of non-dependent

The document editor 'is neutral to the type of user interface, so it can arrange the type of interface of the document structure. 23 The XML file editor of the present invention enables users to create and compile files that are compatible with DTDs without worrying about grammatical violations. In the document creation and editing process, the document editing of the present invention can automatically generate the necessary children's prompts and necessary component slots' for the user to generate valid documents suitable for grammar history. The editor can also generate optional component slots at the request of the user. As a result, the user's main task is to select the components of the coffee in the menu generated by the player, and fill in the components to shoot. Users not only have the specialized knowledge of _, but also do not need to know the details of the files, they can create and edit the files matching _. The XML editor of the present invention is not limited by the type of the user interface, and can support various types of user interfaces 'including tree type, presentation type and form type', especially in combination with the conformance_processing method and form of the present invention. Simple, can provide-a simple state knife editor with a form-based user interface. The form-type XML file editor of the present invention can also be used as a form generator based on the xml data model. When using the XML file editor of the present invention, the user's behavior is basically controlled by the system, but the system has recorded the use of the studio. Manufacturers can read the menu caps about the components and add the components. "Meet the coffee" ㈣ and Na paste Qing. On the other hand, since the user's operation is under control, the files edited by the user will not violate the grammar. Seven users do not need to worry about any file violation of syntax. The above is the description of the XML file editor of the present invention. It is not difficult for those who are accustomed to Siyi to understand the spirit of the present invention and make different changes and changes. As long as it does not exceed the ascension of the present invention, it should include Within the scope of its patent application. V. [Brief Description of the Schema] 24 1220035 Figure 1 shows a Glushkov automaton of a regular expression (expression) E,) *, c). The second graph is not a regular expression) ε, ‘ε = ~, Giushkov automaton of 〆〆 力 *. The Le 3 chart is not a flowchart of the "essential component" prompt and "select component slot" generated by the XML file editor of the present invention. The first diagram is a top-level form screen of the user interface in an example of the XML document editor of the present invention. Fig. 5 shows the day face of the component slot. Fig. 6 shows the daylight display of its multilayer nested form. Scope of patent application: This kind of XML file editing is to provide users with the ability to add or delete file elements in a working file, and to save the σ Hai working file as an XML file. It is characterized in that the file editor can comply with The adjacent two components defined in the file format ㉔ ^ generate a third component menu as a user's prompt; the third component 2 included in the component menu, if added between the two component reading, the sparse component will be Z The relationship between | and z and the component pair z and Zι + 丨 conform to the file format definition. 2. The XML file editor as shown in the W of the patent application scope, wherein the Li file editor judges whether the relationship between the two adjacent components meets the defined file format definition by the following formula: Let G be the-component of the working file Corresponding regular automaton of the regular expression E, z2, ..., zp} indicates that the sub-elements of this element correspond to the sequence of states in G, where s is the initial state in g, ζρ-ί, f is G The end state in the middle; for the two adjacent states, 丄 janb p CN; if:

Zl + 1 G reachable (z,), reachable (z,) ^^ G t ^, ^ 〇 25

Claims (1)

1220035 Figure 1 shows a Glushkov automaton of a regular expression E,) *, c). The second graph is not a regular expression) ε, ‘ε = ~, Giushkov automaton of 〆〆 力 *. The Le 3 chart is not a flowchart of the "essential component" prompt and "select component slot" generated by the XML file editor of the present invention. The first diagram is a top-level form screen of the user interface in an example of the XML document editor of the present invention. Fig. 5 shows the day face of the component slot. Fig. 6 shows the daylight display of its multilayer nested form. Scope of patent application: This kind of XML file editing is to provide users with the ability to add or delete file elements in a working file, and to save the σ Hai working file as an XML file. It is characterized in that the file editor can comply with The adjacent two components defined in the file format ㉔ ^ generate a third component menu as a user's prompt; the third component 2 included in the component menu, if added between the two component reading, the sparse component will be Z The relationship between | and z and the component pair z and Zι + 丨 conform to the file format definition. 2. The XML file editor as shown in the W of the patent application scope, wherein the Li file editor judges whether the relationship between the two adjacent components meets the defined file format definition by the following formula: Let G be the-component of the working file Corresponding regular automaton of the regular expression E, z2, ..., zp} indicates that the sub-elements of this element correspond to the sequence of states in G, where s is the initial state in g, ζρ-ί, f is G The end state in the middle; for the two adjacent states, 丄 丄 卜 p CN; if: Zl + 1 G reachable (z,), reachable (z,) ^^ G t ^, ^ 〇25 1220035 reach (reach) The set of states; is the relationship between the 7G edge confrontation and Z | —I in accordance with the defined file format definition. 3. The XML · document editor shown in Item 1 of the Patent Scope, wherein the XML · file editor can generate a set C containing the third element z and express it as a menu:. '1 + 1) $ Η, Η is the set of all adjacent edges in <3, G is the Glushkov automaton of the regular expression E of C for one element of the working file; Let Σ table G correspond to all The set of states of the component; the state contained in the subexpression ei of the A (E1) table is also a 'i leachable (Zj), which is the set of states in G that can be reached by the state z, according to the forward neighbor, then Lu Ru e f-reachable (Zj), then let C {z € Σ 丨 z G f-reachable (Zi) and zi + 1 e f-reachable (z)}; such as z1 + 丨 g f-reachabie (Zi), let丨 * is the minimum expression of iterative subexpressions and contains &amp; and &amp;, let c— {ze A (E1) | zcf: reachable (z,) or zi fiei: reachable⑵ j. 4. The XML file editor as shown in item 1 of the scope of patent application, wherein the XML file editor can generate a set C containing the third element z as follows, and is expressed by a menu: φ 当 (心 21+ 1) ^: 11, Η is the set of all neighboring edges in G, G is the Glushkov automaton of the regular expression E corresponding to one element of the working file; Let Σ table G be the set of states corresponding to all elements ; A (E1) is a set of states contained in the subexpression £ 1; Reachable (z,) is a set of states in G that can be reached by state 2 | according to the forward neighbor, then: as (4, zi + 1 ) Is the forward neighboring edge, then let C = {z C Σ | z C f-reachable (z〇i ζ, + ι £ f-reachable (z)}, and 26 as the iterator expression for some E El *, z, C last (El *). Let El be the largest one, then let Cl be {zC A (E1) | zi +! Ei: reachable (z)}, and let C = CU Cl; U) as For some E sub-expressions E2 *, zlH C first (E2 *), let E2 be the largest one, then let C2 {ze A (E2) | ze f-reachable (Zi)}, and let C = CUC2; (ζι'ζΗ) is the backward neighbor, then let E3 * be the largest repeater expression in E And satisfy Zie laSt (E3) and Z1 + 1 e first (E3), let C = A0S3). For example, the XML file editor shown in item 丨 of the patent application scope, wherein when a third element z is added between a pair Z1 and Zμι, the XM1 ^ file editor can be in the element pair ζ; and z Necessary components between z and ζ1 + ι are automatically generated, so that the working document conforms to the applicable grammar; the necessary components between Ψ ^ Zι Λ z (z and Zi + 1) include the Glushkov automaton G, 7. The joint point with z (z and 4 + 1), that is, the state where all paths from z, to z (from 2 to Zi +!) Pass. The working file is stored as an Xml file for the user to read the file and add the compensation element to the ML file. The feature is that the XML file editing method 27 1220035 includes when the user edits the file. Can read / correct the adjacent two elements that meet the definition of the file format to generate a list of 12 elements as a user's prompt; the third element 7 "included in the suspect list, right or two elements 4 and? Between the examples, the relationship between the element pair &amp; and z and the element pair z and ~ 1 can all conform to the file format definition. 8. The document editing method as shown in item 7 of the scope of the patent application, wherein the method for judging that the relationship between the two adjacent elements conforms to the defined file format definition includes: "G is the corresponding one of the cylinder-made documents. The regular expression £ の ㈣⑽automaton 卞 Up} indicates that the child element of this element corresponds to the sequence of states in G, z 丨 two s, 5 the starting state in table 0; zp = f, f represents the ending state in G ; Z | and Zμι are two adjacent states, ρ εΝ, if: Z, + I ereachable (Z |) 'reachaWe㈤ table can be reached from state Zι in G, according to the neighbor relationship in G集合 is the set; the relationship between the component pair and Zj + 1 meets the defined file format definition. 9. The XML · document editing method as shown in item 7 of the scope of patent application, wherein the set C of the third element z is generated according to the following formula, and is expressed by a menu: When (z ,, zi + 丨) g Η, Η is the set of all neighboring edges in G, and G is the Glushkov automaton of the regular expression E corresponding to one element of the working file; Let Σ table G be the set of states corresponding to all elements; Α (Ει) table The subexpression ρ] is a set of states. The f-reachable (Zi) table in G can be reached by state 4 in the direction of the neighboring neighbors, and then, as in zi + 1 € f-reachable (Zi ), Then let C {z G Σ | ze i-reachable (Zj) and Zj + i C f-reachable (z)}; 28 For example, ~ ❿ach 敌 ⑹ 'sets w as an iterator expression of expression E and contains … The smallest, let, 1 C = {ze A (E1) I ze f-reachable (z,) ^ z, + I e f-reachable (z)} 〇 The third element z 10. If applying for a patent The XML file editing method shown in the seventh item of the scope, in which the set C is generated according to the following formula, and is represented by a menu: beware + l) eη 'η is the combination of all adjacent edges in G, and g is the reading of the file —Regular table corresponding to components Glushkov automaton of Darwin E; Let Σ table G correspond to all the element-shaped bear-shaped heart woods, and the set of states contained in the expression E1 of the A (E1) table, such as _call, is shown in G The set of states that are broken forward, then:, P ^ C = izGl | zCf, eacl ^ f-reachable (z)}, and U1) As for the reciprocal expression of some E, ζ (: peak Γ ), Set the most of them to 々Cl —tzeACElVhCf-reachablea)}, and order. two〔. C1; For some E's iterative expressions E2 *, ~ e resistant, let e2 be the largest one of them, then let C2 {ze A (E2) | ze f_reachable (Z |)}, and let pc uC2; (...) is the edge towards the object, then let F3 be the maximal iterative expression of E towel, and satisfy e laSt (E3) and Ζί + 1 e flrst (E3), let C = A (E3). The method for editing an XML file as described in item 7 of the article specifically includes-steps, that is, after adding-a <Z-square, 7L piece pair between Zi and Zi + 1, and then in the component pair. And Z and component pairs z 29 11. 1220035 people] automatically generate the necessary components so that the working document conforms to the applicable grammar; among them, the necessary components between d, 2 (2 and 4+!) Include Giushk In the v automaton G, the "point of connection with the heart 1)" is the state in which all paths from the sample Z to zl + 1) pass. 12. The method for editing a fox file as shown in item i of the patent claim includes an additional step, that is, after adding a second ordinary piece Z between the component pair 4 and zl + 丨, if the component pair Zι and z Between (z and Z | + ι), ,, and essential elements' and (zi, z) 0 Η ((乙 ζιΗ) ί Η), Η is the set of all adjacent edges in G, then in the element pair Zl A component slot is automatically generated between Z and Z (Z and 7) for users to add components. The necessary components between them (z 舁 zi + 丨) include Giushkov automaton G, &amp; and z &amp; And Xin Z, + 丨), that is, a state where all paths from z′z (from z to know |) pass. 13. —A kind of XML text file &amp; 叩 ^, 扁, 扁, includes a user interface to provide users to add or delete document elements in a work document, and save the work document as an XML Document mark; It is characterized in that the XML file editor can generate a first element solution for the two adjacent elements that conform to the definition of the file format ^ and "I as a user's prompt; the element included in the element menu If three components z are added between ㈣Z and +1, the relationship between the component pair 々 and z and the component pair z and Zlfl are in accordance with the definition of the file format. An XML file editor, where the XML file editor judges whether the relationship between two adjacent components is consistent with the defined file format definition: Let G be the one that produces one after another-the component corresponding The Glushk0v automaton of the regular expression '&amp; &quot; t, z, s, s' pl i is the end state in Table G; M 0z ... is the two adjacent states, ⑸, p CN; : 30 1220035 h eteachableh) 'reachable' table in G can be state &amp; According to the collection of the state of reach in g, it is considered that the relationship between the element pair Z and Z μ | is in accordance with the defined file format definition. 15 · If you apply for a patent, the file editor of the ship shown in Figure 13, where, the Viewing document editor Jie can generate a set c containing the third element z, and express it as a menu. When (Z ,, Zl + |) g η, η is the set of all adjacent edges in G, G is the The Glushkov automaton of the regular expression E corresponding to one element of the working file; Let the set of states corresponding to all elements in the Σ table G; The eighth table subexpression f be the Lu set with state 'f-reachable (Zi The set of states in G that can be reached by the state Zi according to the forward neighbor, then: If zi + 1 e f-reachable (Zi), then let C- {ze Σ I zei: reachable (z〇 and zw ei : reachable (z)}; If zi + 1 d, -reachabie (Z | ·), let Ei * be the iterative subexpression of the expression £ and include the smallest of &amp; and &amp;, let C == {Z e A (E1) | Z e f-reachable (Zi) or zi + | e f-reachable (z)}. 16. An XML file editor as shown in item η of the patent application scope, wherein the file is edited _ Can generate a set C containing the third element z, and use the menu to represent: When (zi, Z1 + 1) e Η, Η is the set of all adjacent edges in G, and () is the working file Glushkov automaton of the regular expression E corresponding to one element; Let Σ table G be the set of states corresponding to all elements; a (E1) the set of states contained in the subexpression E1; f-reachable (z〇 The list of states in G that can be reached by the state Zi according to the forward neighbor, then: If (4, Zn μ) is the forward neighbor, then let C: {z C Σ | z C f-reachable (Zj) And ζ · — c 31