The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dalam reka bentuk dan pembangunan perisian, gambar rajah program sering digunakan untuk visualisasi yang baik. Pelbagai jenis rajah atur cara telah dicadangkan dan digunakan. Untuk memproses rajah tersebut secara automatik dan cekap, struktur rajah atur cara perlu diformalkan. Kami berhasrat untuk membina sistem pemprosesan gambar rajah dengan penghurai yang cekap untuk gambar rajah program kami Hichart. Dalam kertas ini, kami memberikan tatabahasa graf keutamaan untuk Hichart yang boleh menghuraikan dalam masa linear. Kami juga menerangkan kaedah penghuraian dan sistem pemprosesan yang menggabungkan editor grafik Hichart yang berdasarkan tatabahasa graf keutamaan.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Takaaki GOTO, Kenji RUISE, Takeo YAKU, Kensei TSUCHIDA, "Visual Software Development Environment Based on Graph Grammars" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 3, pp. 401-412, March 2009, doi: 10.1587/transinf.E92.D.401.
Abstract: In software design and development, program diagrams are often used for good visualization. Many kinds of program diagrams have been proposed and used. To process such diagrams automatically and efficiently, the program diagram structure needs to be formalized. We aim to construct a diagram processing system with an efficient parser for our program diagram Hichart. In this paper, we give a precedence graph grammar for Hichart that can parse in linear time. We also describe a parsing method and processing system incorporating the Hichart graphical editor that is based on the precedence graph grammar.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.401/_p
Salinan
@ARTICLE{e92-d_3_401,
author={Takaaki GOTO, Kenji RUISE, Takeo YAKU, Kensei TSUCHIDA, },
journal={IEICE TRANSACTIONS on Information},
title={Visual Software Development Environment Based on Graph Grammars},
year={2009},
volume={E92-D},
number={3},
pages={401-412},
abstract={In software design and development, program diagrams are often used for good visualization. Many kinds of program diagrams have been proposed and used. To process such diagrams automatically and efficiently, the program diagram structure needs to be formalized. We aim to construct a diagram processing system with an efficient parser for our program diagram Hichart. In this paper, we give a precedence graph grammar for Hichart that can parse in linear time. We also describe a parsing method and processing system incorporating the Hichart graphical editor that is based on the precedence graph grammar.},
keywords={},
doi={10.1587/transinf.E92.D.401},
ISSN={1745-1361},
month={March},}
Salinan
TY - JOUR
TI - Visual Software Development Environment Based on Graph Grammars
T2 - IEICE TRANSACTIONS on Information
SP - 401
EP - 412
AU - Takaaki GOTO
AU - Kenji RUISE
AU - Takeo YAKU
AU - Kensei TSUCHIDA
PY - 2009
DO - 10.1587/transinf.E92.D.401
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2009
AB - In software design and development, program diagrams are often used for good visualization. Many kinds of program diagrams have been proposed and used. To process such diagrams automatically and efficiently, the program diagram structure needs to be formalized. We aim to construct a diagram processing system with an efficient parser for our program diagram Hichart. In this paper, we give a precedence graph grammar for Hichart that can parse in linear time. We also describe a parsing method and processing system incorporating the Hichart graphical editor that is based on the precedence graph grammar.
ER -