%0 Journal Article
%T Parsing Algorithm of Context-Sensitive Graph Grammar: Overview and Experience<br>上下文相关图文法分析及其应用初探
%A RAN Ping
%A SHI Bing
%A MA Xiao-Xing
%A LU Jian
%A <br>冉平
%A 石兵
%A 马晓星
%A 吕建
%J 计算机科学
%D 2006
%I 
%X Graph grammars are natural and efficient in formally specifying visual programming languages, which are often the keys to the end user programming. Parsing based on graph grammars, especially more expressive context-sensitive grammars, is increasingly becoming important and prominent in the industrial applications. Existing references either focus only on theoretical aspects or limit to particular uses of some self-defined grammars. In this paper, we over view the general parsing process with concise notations, and abstract the step of selecting rules as a CSP problem in or der to use existing optimization methods for CSP to optimize the parsing algorithm. In addition, we present our experience on the development of an architecture-oriented Web services integration system in which a context-sensitive attributed graph grammar is used to describe and check software architectures.
%K Graph grammar
%K Content-sensitive
%K Parsing algorithm
%K Software architecture<br>图文法
%K 上下文相关
%K 分析算法
%K 软件体系结构
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=EE14A8B2186CDDB8&yid=37904DC365DD7266&vid=27746BCEEE58E9DC&iid=38B194292C032A66&sid=627456E7977439A4&eid=89AC6B0ADBEA2741&journal_id=1002-137X&journal_name=计算机科学&referenced_num=1&reference_num=19