Partitioned chain grammars

  • Peter Schlichtiger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)


A new class of grammars, the partitioned chain grammars, is introduced. It is shown that such grammars are not only efficiently parsable, but also comparatively easy to construct. The combination of these two properties makes them very attractive for use in parsergenerators.


Equivalence Relation Empty Word Input Symbol Manner Node Syntax Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [Aho, Ullman 72]
    A.V.Aho, J.D.Ullman: The Theory of Parsing, Translation and Compiling I,II (1972), Prentice Hall, Inc.Google Scholar
  2. [DeRemer 71]
    F.L. DeRemer: Simple LR(k)-Grammars, CACM 14 (1971), 453–460Google Scholar
  3. [Friede 79]
    D. Friede: Partitioned LL(k)-Grammars, Lecture Notes in Computer Science 71 (1979), 245–255Google Scholar
  4. [Ginsburg,Greibach 66]
    S.Ginsburg,S.A.Greibach: Deterministic Context-Free Languages, Information and Control 9, 620–648Google Scholar
  5. [Harrison,Havel 73]
    M.A. Harrison,I.M. Havel: Strict Deterministic Grammars, JCSS 7 (1973), 237–277Google Scholar
  6. [Mayer 78]
    O.Mayer: Syntaxanalyse, Bibliographisches Institut Mannheim (1978)Google Scholar
  7. [Nijholt 77]
    A. Nijholt: Simple Chain Grammars, Lecture Notes in Computer Science 52 (1977), 352–364Google Scholar
  8. [Nijholt 78]
    A. Nijholt: On the Parsing and Covering of Simple Chain Grammars, Lecture Notes in Computer Science 62 (1978), 330–344Google Scholar
  9. [Nijholt 1 79]
    A. Nijholt: Simple Chain Grammars and Languages,Theoretical Computer Science 9 (1979), 282–309Google Scholar
  10. [Nijholt 2 79]
    A. Nijholt: Structure Preserving Transformation on Non-Left-Recursive Grammars, Lecture Notes in Computer Science 71 (1979), 446–459Google Scholar
  11. [Rosenkranth,Lewis 70]
    D.J.Rosenkrantz,P.M.Lewis II: Deterministic Left Corner Parsing, IEEE Conf. Rec. of the 11'th An. Symp. on Switching and Automata Theory (1970), 139–152Google Scholar
  12. [Schlichtiger 1 79]
    P.Schlichtiger: Kettengrammatiken — ein Konzept zur Definition handhabbarer Grammatikklassen mit effizientem Analyseverhalten, Doctorial Thesis,University of Kaiserslautern (1979)Google Scholar
  13. [Schlichtiger 2 79]
    P.Schlichtiger: On the Parsing of Partitioned Chain Grammars, Interner Bericht 21/79 (1979),University of KaiserslauternGoogle Scholar
  14. [Schlichtiger 3 80]
    P.Schlichtiger: On How to Construct Efficiently Parsable Grammars, Interner Bericht 22/80 (1980), University of KaiserslauternGoogle Scholar
  15. [Soisalon, Ukkonen 76]
    E.Soisalon-Soininen,E.Ukkonen: A A Characterisation of LL(k)-Languages, Proc. of the 3rd Coll. on Automata, Languages and Programming (1976), 20–30Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Peter Schlichtiger
    • 1
  1. 1.Universität Kaiserslautern/FB InformatikKAISERSLAUTERN

Personalised recommendations