SR(s, k) parsers: A class of shift-reduce bounded-context parsers

Abstract

AbstractWe 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