On constructing LL(k) parsers: Extended abstract

Seppo Sippu, Eljas Soisalon-Soininen

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Sammanfattning

A method for constructing canonical LL(k) parsers for context-free grammars is presented. This method can be regarded as a dual of the well-known LR(k) parser construction technique involving so-called LR(k) items and viable prefixes. The counterparts of LR(k) items and viable prefixes are called LL(k) items and viable suffixes, respectively. Modifications of the basic method give rise to subclasses of the canonical LL(k) grammars corresponding to the LALR(k) and SLR(k) grammars. The duals of LALR(k) grammars are called LALL(k) grammars and they form a proper subclass of the canonical LL(k) grammars when k>1. The duals of SLR(k) grammars, called SLL(k) grammars, in turn coincide with the so-called strong LL(k) grammars and form a proper subclass of the LALL(k) grammars when k>1.
Originalspråkengelska
Titel på gästpublikationAutomata, Languages and Programming : Sixth Colloquium, Graz, Austria, July 16-20, 1979
RedaktörerHermann A. Maurer
Antal sidor11
UtgivningsortBerlin-Heidelberg-New York
FörlagSpringer-Verlag
Utgivningsdatum1979
Sidor585-595
ISBN (tryckt)3-540-09510-1
DOI
StatusPublicerad - 1979
MoE-publikationstypA4 Artikel i en konferenspublikation
EvenemangInternational Colloquium on Automata, Languages and Programming - Graz, Österrike
Varaktighet: 16 jul 197920 jul 1979
Konferensnummer: 6 (ICALP)

Publikationsserier

NamnLecture Notes in Computer Science
FörlagSpringer-Verlag
Volym71

Vetenskapsgrenar

  • 113 Data- och informationsvetenskap

Citera det här