1 / 58

Syntactic Methods for Diagrams

Syntactic Methods for Diagrams. Tomokazu ARITA. 1. Introduction. Background. Motivation. In mechanical documentation, it is necessary to formally define tabular forms and the drawing conditions. Purpose. To propose a model for forming tabular forms efficiently.

maleah
Download Presentation

Syntactic Methods for Diagrams

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Syntactic Methods for Diagrams Tomokazu ARITA WAAP

  2. 1. Introduction WAAP

  3. Background WAAP

  4. Motivation In mechanical documentation, it is necessary to formally define tabular forms and the drawing conditions. WAAP

  5. Purpose • To propose a model for forming tabular forms efficiently. • To formalize tabular forms based on this model. • To investigate properties of this model for tabular forms. • To propose an analyzing method. • To formalize editing by graph grammars WAAP

  6. Results • To define an attribute NCE graph grammar. • To formalize tabular forms based on an attribute NCE graph grammar. context-free,280 productions, 2504 attribute rules • To show properties of the grammar for tabular forms. precedence graph grammar • To propose a parsing method by this grammar. • To construct a parsing system. WAAP

  7. 2. Preliminaries WAAP

  8. A program specification language Hiform • 17 types of Forms based on ISO6592 • A collection of tabular forms WAAP

  9. Nested Diagram and Its Corresponding Marked Graph WAAP

  10. Constraints for Tables Definition A form graph : Fg = (Σ, Γ, V, E, φ) where Σ: alphabets of items Γ = {in, ov, lf}: alphabets of edges V: sets of nodes E: sets of edges φ: V → Σ WAAP

  11. Constraints for Tables Definition A tabular form: T = (Fg, π) where Fg = (Σ，Γ, V, E, φ): a form graph π: V → N4 WAAP

  12. Constraints for Tables ConstraintsC1 For vi, vj ∈ V, πx(vj) = πx(vi) + πw(vi) if there is (vi, lf, vj)∈ E. ConstraintsC2 For vi, vj ∈ V, πy(vj) = πy(vi) if there is (vi, lf, vj) ∈ E. WAAP

  13. Constraints for Tables Constraints C3 For vi, vj ∈ V, πx(vj) = πx(vi) if there is (vi, ov, vj)∈ E. ConstraintsC4 For vi, vj ∈ V, πy(vj) = πy(vi) + πh(vi) if there is (vi, ov, vj) ∈ E. WAAP

  14. Constraints for Tables ConstraintsC5 Items do not pile up on each other. WAAP

  15. Constraints for Tables Definition A tabular form T = (Fg, π) is consistent if and only if π satisfies C1, C2, C3, C4, and C5 WAAP

  16. REVIEW [7] [Rozenberg et al.] WAAP

  17. REVIEW (continued) WAAP

  18. Rewrite a graph by production WAAP

  19. WAAP

  20. Production with Attribute Rules Production ‘H5’ sub-derivation tree WAAP

  21. Modify precedence relations WAAP

  22. Modify precedence relations WAAP

  23. Modify precedence relations WAAP

  24. 3. An Attribute Graph Grammar for Program Documents WAAP

  25. Our Result 1 WAAP

  26. Productions of HNGG WAAP

  27. Features of HNGG WAAP

  28. Our Result 2. Syntactic Analysis • The syntactic analysis is done by parsing of precedence graph language. • use a precedence property. WAAP

  29. How to use precedence rule • Input Graph • Derivation Tree WAAP

  30. Attribute Evaluation WAAP

  31. Proposition Attributes in HNGG are evaluated in linear time. WAAP

  32. Our Result 3 Proposition HNGG is a precedence graph grammar. Proof. We construct 5376 precedence relations. The relations are shown to be pairwise disjoint. Fig. A part of precedence relations of HNGG WAAP

  33. Proposition For graph G with n nodes and m edges, the parsing based on HNGG perform in linear times depended on n and m. WAAP

  34. Proposition For graph G with n nodes and m edges, the attribute evaluation for G based on HNGG perform in linear times depended on n and m. WAAP

  35. 4. A system of Processing Program Documents WAAP

  36. Diagrams WAAP

  37. Tessellation Diagram • Tessellation Diagram and Its • Corresponding Graph

  38. Tessellation Diagram Production Example of HTGG • Grammar HTGG HTGG ( Hiform Tessellation Graph Grammar ) is an attribute context-sensitive NCE graph grammar for the tessellation diagrams such as:

  39. Tessellation Diagram Features of HTGG

  40. Tessellation Diagram Derivation of HTGG

  41. Diagram Processing System KEYAKI – CASE2000 Concept 1.HichartED Hichart program diagram editing component 2. HiformED Hiform diagram component WAAP

  42. KEYAKI-CASE2000 Inside WAAP

  43. HichartED • The Hichart program diagram editing component • Syntax-directed diagram editor • Editor-Commands defined by productions WAAP

  44. HiformED • Hiform Diagram Processing Component • A Java application WAAP

  45. An Execution Screen ofParsing Engine (Arita 2001) Input : Marked Graph Output : Derivation Tree

  46. 5. FXL WAAP

  47. File Structures Browser (IE etc.) XML Style Files XML Files Other Systems Editor Viewer Other Systems Parsing Engine Marked Graph Class Derivation Tree Class File Converter Tabular Form Processing System FXL Files

  48. 3.3 MGC and DTC MGC • Data structure of marked graph (edNCE GG) • Java Class • Bidirectional List • Used for Syntax Analysis WAAP

  49. 3.3 MGC and DTC DTC • Data structure for derivation tree • Java Class • Bidirectional List • Generated by Syntax Analysis • Used for attribute evaluation and drawing of a table WAAP

  50. 4.1 FXL(A Form Exchange Language) • Syntax of FXL is defined by extended BNF. • Codes of FXL are text-based codes. • FXL can describe several attributes for tabular forms. WAAP

More Related