A Fast General Parser for Automatic Code Generation

檔案

本條目沒有附加檔案。

日期

2010

作者

類型

期刊名稱

METHODS AND TOOLS OF PARALLEL PROGRAMMING MULTICOMPUTERS

卷期與頁次

第 6083 卷,頁 30–39

ISSN

0302-9743

ISBN

978-3-642-14821-7

語言

英文

摘要

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)

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Yang, W. (2010). A Fast General Parser for Automatic Code Generation. METHODS AND TOOLS OF PARALLEL PROGRAMMING MULTICOMPUTERS, 6083, 30–39. https://ir.lib.nycu.edu.tw/handle/11536/18517

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/18517