A Fast General Parser for Automatic Code Generation
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
39 | en_US |
dc.citation.spage |
30 | en_US |
dc.citation.volume |
6083 | en_US |
dc.contributor.author |
Yang, Wuu | en_US |
dc.contributor.department |
交大名義發表 | zh_TW |
dc.contributor.department |
National Chiao Tung University | en_US |
dc.date.accessioned |
2014-12-08T15:26:07Z | |
dc.date.available |
2014-12-08T15:26:07Z | |
dc.date.issued |
2010 | en_US |
dc.description.abstract |
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.(1) | en_US |
dc.identifier.isbn |
978-3-642-14821-7 | en_US |
dc.identifier.issn |
0302-9743 | en_US |
dc.identifier.journal |
METHODS AND TOOLS OF PARALLEL PROGRAMMING MULTICOMPUTERS | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/18517 | |
dc.identifier.wosnumber |
WOS:000283768600004 | |
dc.language.iso |
en_US | en_US |
dc.subject |
ambiguous grammar | en_US |
dc.subject |
code generator | en_US |
dc.subject |
compiler | en_US |
dc.subject |
context-free grammar | en_US |
dc.subject |
parsing | en_US |
dc.subject |
general parsing | en_US |
dc.subject |
pattern matching | en_US |
dc.subject |
tree pattern | en_US |
dc.subject |
tree-pattern matching | en_US |
dc.title |
A Fast General Parser for Automatic Code Generation | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文