A fast general parser for automatic code generation

Wuu Yang*

*此作品的通信作者

研究成果: Conference contribution同行評審

1 引文 斯高帕斯(Scopus)

摘要

The code generator in a compiler attempts to match a subject tree against a collection of tree-shaped patterns for generating instructions. Tree-pattern matching may be considered as a generalization of string parsing. We propose a new generalized LR (GLR) parser, which extends the LR parser stack with a parser cactus. GLR explores all plausible parsing steps to find the least-cost matching. GLR is fast due to two properties: (1) duplicate parsing steps are eliminated and (2) partial parse trees that will not lead to a least-cost matching are discarded as early as possible.

原文English
主出版物標題Methods and Tools of Parallel Programming Multicomputers - Second Russia-Taiwan Symposium, MTPP 2010, Revised Selected Papers
頁面30-39
頁數10
DOIs
出版狀態Published - 13 十二月 2010
事件2nd Russia-Taiwan Symposium on Methods and Tools of Parallel Programming Multicomputers, MTPP 2010 - Vladivostok, Russian Federation
持續時間: 16 五月 201019 五月 2010

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
6083 LNCS
ISSN(列印)0302-9743
ISSN(電子)1611-3349

Conference

Conference2nd Russia-Taiwan Symposium on Methods and Tools of Parallel Programming Multicomputers, MTPP 2010
國家/地區Russian Federation
城市Vladivostok
期間16/05/1019/05/10

指紋

深入研究「A fast general parser for automatic code generation」主題。共同形成了獨特的指紋。

引用此