Partitioned chain grammars

  • This paper introduces a new class of grammars, the partitioned chain grammars, for which efficient parsers can be automatically generated. Besides being efficiently parsable these grammars possess a number of other properties, which make them very attractive for the use in parser-generators. They for instance form a large grammarclass and describe all deterministic context-free languages. Main advantage of the partitioned chain grammars however is, that given a language it is usually easier to describe it by a partitioned chain grammar than to construct a grammar of some other type commonly used in parser-generators for it.

Download full text files

Export metadata

Additional Services

Search Google Scholar
Author:Peter Schlichtiger
Serie (Series number):Interner Bericht des Fachbereich Informatik (20)
Document Type:Report
Language of publication:English
Publication Date:2017/11/02
Year of Publication:1979
Publishing Institute:Technische Universit├Ąt Kaiserslautern
Date of the Publication (Server):2017/11/02
Number of page:18
Faculties / Organisational entities:Kaiserslautern - Fachbereich Informatik
DDC-Cassification:0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik
Licence (German):Creative Commons 4.0 - Namensnennung, nicht kommerziell, keine Bearbeitung (CC BY-NC-ND 4.0)