%0 Journal Article
%T Dependency Graphs Embedding Confluent Graph Grammars<br>嵌入一致图语法的依赖图
%A LI Guo-Dong
%A ZHANG De-Fu
%A <br>李国东
%A 张德富
%J 软件学报
%D 2004
%I 
%X Graph grammars have been developed as an extension of the formal grammars on strings to grammars on graphs, and provide a mechanism in which transformations on graphs can be modeled in a mathematically precise way. In this paper, based on confluent graph grammars, the authors present a novel representation for data-flow graphs, control-flow graphs, combined control-data-graphs, bipartite graphs and hyperedge graphs. How to extract parallelism is specified automatically at different levels by graph rewriting, thus facilitating the design and implementation of parallel compilers and parallel languages.
%K graph grammar
%K graph rewriting
%K dependency graph
%K hypergraph
%K compiling<br>框架图语法
%K 图重写
%K 依赖图
%K 超图
%K 编译
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=C9A19E6568E207DC&yid=D0E58B75BFD8E51C&vid=23CCDDCD68FFCC2F&iid=DF92D298D3FF1E6E&sid=7A7A8B1000B9FF84&eid=20154CF366EC08B1&journal_id=1000-9825&journal_name=软件学报&referenced_num=2&reference_num=16