Lar(m, c, l) grammars (original) (raw)
International Journal of Computer Mathematics, 1989
Abstract
We present the class of LAR(M,C,L) context-free grammars: a generalization of several classes of fixed and arbitrary lookahead LR grammars that appear in the literature. The parser construction is based on three parameters M,C and L; M and C determine the type of parser, and L is the amount of lookahead. Specific settings of these parameters yield fixed-lookahead grammar classes
Manuel Bermudez hasn't uploaded this paper.
Let Manuel know you want this paper to be uploaded.
Ask for this paper to be uploaded.