SR(s, k) parsers: A class of shift-reduce bounded-context parsers
作者:
Highlights:
•
摘要
We introduce a class of bottom-up parsers called SR(s, k) parsers, where s denotes a stack bound and k the lookahead bound. The importance of this class of parsers is the fact that states are formed by the union of item-sets associated with a canonical LR(k) parser. One of our major results states that the class of SR(s, k) grammars properly includes the (s, k)-weak precedence grammars but is properly included within the class of (s, k)-bounded right-context grammars.
论文关键词:
论文评审过程:Received 16 May 1978, Revised 7 November 1979, Available online 2 December 2003.
论文官网地址:https://doi.org/10.1016/0022-0000(81)90026-X