Japanese | English

トップページへ戻る

詳細

   
フルテキストURLフルテキストリンクなし
タイトルOn Module Arrangement in Generating Assemble Programs via Directed Graph
作成者Ge, Qi-Wei
Wu, Ren
Yanagida, Hidenori
作成者ヨミヤナギダ, ヒデノリ
作成者別表記Yamaguchi, Satoru
作成者所属山口大学教育学部
内容記述(抄録等)In order to support automatically generating an assemble program by combining prepared assemble program modules, we propose in this paper a general way to create multiple arranging patterns of modules obeying given arrange order relations that represent the relative arranging position of modules in a program. It is carried out with time complexity O(1 V I Z) by transforming the arrange order relations into a directed graph AOR-G and then on AOR-G giving multiple sequences of nodes, equivalent to arranging patterns of modules, through constructing a layer graph. Furthermore, to improve the search time costed in constructing the layer graph, we propose two algorithms respectively to delete extra edges from AOR-Ca whose information has been included in other arrange order relations, and to extract a related graph G r (a minimum subgraph of AOR-G) to a given node set r, representing the modules required to be used in a generating program. Finally we give three operations to reduce the related graph G r by deleting unnecessary nodes for the generating program, trying to further improve the time complexity O(1 V I 2 ).
本文言語eng
資料タイプtext
出版者山口大学教育学部
出版者ヨミヤマグチ ダイガク キョウイク ガクブ
NII資料タイプ紀要論文
ISSN0513-1693
NCIDAN00243950
学内刊行物(紀要等)山口大学教育学部研究論叢(第2部)
掲載誌名研究論叢. 自然科学
掲載誌名別表記Bulletin of the Faculty of Education, Yamaguchi University. Natural science
45
2
開始ページ53
終了ページ64
発行日1995-10
著者版/出版社版その他
リポジトリIDC020045000205
地域区分山口大学
URIhttp://www.lib.yamaguchi-u.ac.jp/yunoca/handle/C020045000205