LALR(1) : LL(1) = LR(0) : LL(0)

Research output: Chapter in Book/Report/Conference proceedingChapterProfessional

Abstract

It is shown that LL(l) and LALR(l) acceptors can be obtained by restricting the action tables of the corresponding LL(O) and LR(O) acceptors to those entries that are accessed in at least one accepting sequence (of a sentence from the language). It follows that a number of properties that are easily proven in the context of LL(O) and LR(O) acceptors immediately carry over to LL(l) and LALR(l) acceptors, where a direct proof is often more laborious. The paper provides some examples of this phenomenon. Another advantage of the approach is the clarification of the existence of accepting schemes 'in between' LL(O) and LL(l) or LR(O) and LALR(l) (e.g. SLR(l)). Again some examples are given.
Original languageEnglish
Title of host publicationIs er nog nieuws? (Aangeboden aan prof.dr. Th.J. Dekker)
EditorsP. Emde Boas, van, P.W. Hemker, W. Hoffman, P.J. Houwen, van der, P.R. Pfluger
Place of PublicationAmsterdam
PublisherUniversiteit van Amsterdam
Pages1-16
Publication statusPublished - 1992

Fingerprint Dive into the research topics of 'LALR(1) : LL(1) = LR(0) : LL(0)'. Together they form a unique fingerprint.

  • Cite this

    Kruseman Aretz, F. E. J. (1992). LALR(1) : LL(1) = LR(0) : LL(0). In P. Emde Boas, van, P. W. Hemker, W. Hoffman, P. J. Houwen, van der, & P. R. Pfluger (Eds.), Is er nog nieuws? (Aangeboden aan prof.dr. Th.J. Dekker) (pp. 1-16). Universiteit van Amsterdam.