Title

Sr(S,K) Parsers: A Class Of Shift-Reduce Bounded-Context Parsers

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

J. Comput. Syst. Sci.

Keywords

Computer Science; Hardware & Architecture; Computer Scienc; Theory &; Methods

Abstract

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.

Journal Title

Journal of Computer and System Sciences

Volume

22

Issue/Number

2

Publication Date

1-1-1981

Document Type

Article

Language

English

First Page

178

Last Page

197

WOS Identifier

WOS:A1981LX29000003

ISSN

0022-0000

Share

COinS