A Fixed-Length Approach to the Design and Construction of Bypassed LR(k) Parsers
スポンサーリンク
概要
- 論文の詳細を見る
A fixed-length approach to the design and construction of bypassed LR(k) parsers is presented. A bypassed LR(k) parser is an LR(k) parser which performs syntactic analysis without reducing semantically meaningless productions. First we show that consistent reduction contexts for bypassed LR(k) parsing always exist for any Knuth LR(k) parser and any set of semantically meaningless productions. Second we present algorithms to construct a bypassed LR(k) parser when the set of semantically meaningless productions satisfies some restriction. These algorithms handle relatively general cases as well as the traditional cases where semantically meaningless productions consist of unit productions only.
- 一般社団法人情報処理学会の論文
- 1983-03-20
著者
-
Tokuda Takehiro
Department Of Information Science Tokyo Institute Of Technology
-
Tokuda Takehiro
Department Of Computer Science Tokyo Inst. Of Tech.
関連論文
- Two Methods for Eliminating Redundant Copy Operations from the Evaluation of Attribute Grammars
- Eliminating Unnecessary Items from the One-Pass Evaluation of Attribute Grammars
- Code Improvement Techniques in the Transformation of Attribute Grammars into Efficient Action Routines
- An Attribute Assignment View of Non-procedural Computing Systems
- A Fixed-Length Approach to the Design and Construction of Bypassed LR(k) Parsers
- An Exercise in Transforming Wijngaarden Grammars into Knuthian Grammars (Mathematical Methods in Software Science and Engineering : Second Conference)