Canonical forms of context-free grammars and position restricted grammar forms

  • Meera Blattner
Section A Algebraic & Constructive Theory of Machines, Computations and Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)


This paper deals with the question of canonical forms, or canonical types, for both grammar forms and context-free grammars. Certain canonical types are position restricted if they depend only upon the positions of terminals and nonterminals. We show that with a few very minor restrictions every possible production-type may be specified as a canonical type for arbitrary context free grammars. The result does not hold for grammar forms where a certain restriction must be made.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Cremers, A. and S. Ginsburg, "Context-free grammar forms." JCSS 11:1, 86–115.Google Scholar
  2. [2]
    Greibach, S., "A new normal form theorem for context-free phase structure grammars." JACM 12:1, 42–52.Google Scholar
  3. [3]
    Greibach, S.A., "Chains of full AFL's." Math. Systems Theory 4:3, 231–242.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Meera Blattner
    • 1
    • 2
  1. 1.Mathematical Sciences DepartmentRice UniversityHouston
  2. 2.Seymour Ginsburg Computer Science DepartmentUniversity of Southern CaliforniaLos Angeles

Personalised recommendations