Relation-based algorithms for generating SLR(1) and LALR(1) parsers (original) (raw)

1989

Abstract

The authors characterize the lookahead symbols in terms of very simple relations that bring out substantial structural similarities between SLR(1) and LALR(1) lookaheads. They present algorithms for computing SLR(1) and LALR(1) lookahead that are substantially simpler than those currently known. In contrast to existing algorithms which compute a lookahead set for each reduce move, the authors' algorithms compute all reduce

Manuel Bermudez hasn't uploaded this paper.

Let Manuel know you want this paper to be uploaded.

Ask for this paper to be uploaded.