On structural similarity of context-free grammars

  • Eljas Soisalon-Soininen
  • Derick Wood
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


Given a grammar for translation or compiling purposes, the structure of the grammar reflects the semantics of the language rather than good parsing properties. Thus the language is often parsed with respect to another grammar, which satisfies the property that the derivation trees of the original grammar can be recovered from those of the parsing grammar. "Undercover" is introduced as a new concept for the formal treatment of such grammatical relations and properties of this relation are explored with an emphasis on decidability results and the relationship to existing concepts such as "cover" and "Reynolds cover". Some decidability questions can be related to language theoretic results on inclusion problems for simple languages.


Inclusion Problem Derivation Tree Grammatical Relation Regular Grammar Deterministic Polynomial Time 
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.


  1. 1.
    Aho, A. V. and Ullman, J. D., The Theory of Parising, Translation and Compiling, Vols 1 and 2. Prentice Hall, Englewood Cliffs, N.J., 1972 and 1973.Google Scholar
  2. 2.
    Greibach, S. A. and Friedman, E. P., Superdeterministic PDAs: a subcase with a decidable inclusion problem. J. ACM, 27 (1980), 675–700.Google Scholar
  3. 3.
    Hunt III, H. B. and Rosenkrantz, D. J., Complexity of grammatical similarity relations. In: Proceedings of a Conference on Theoretical Computer Science, pp. 139–145, University of Waterloo, Waterloo, Ontario, Canada, 1977.Google Scholar
  4. 4.
    Hunt III, H. B. and Rosenkrantz, D. J., Efficient algorithms for structural similarity of grammars. In: Conference Record of the Seventh ACM Symposium on Principles of Programming Languages, pp. 213–219, Association for Computing Machinery, New York, 1980.Google Scholar
  5. 5.
    Hunt III, H. B., Rosenkrantz, D. J. and Szymanski, T. G., The covering problem for linear context-free grammars. Theoretical Computer Science, 2 (1977), 361–382.Google Scholar
  6. 6.
    Hunt III, H. B., Rosenkrantz, D. J. and Szymanski, T. G., On the equivalence, containment and covering problems for the regular and context-free languages. J. Comput. System Sci., 12 (1976), 222–268.Google Scholar
  7. 7.
    Nijholt, A., Context-Free Grammars: Covers, Normal Forms, and Parsing. Lecture Notes in Computer Science 93, Springer-Verlag, Berlin-Heidelberg-New York, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Eljas Soisalon-Soininen
    • 1
  • Derick Wood
    • 2
  1. 1.Department of Computer ScienceUniversity of HelsinkiHelsinki 25Finland
  2. 2.Unit for Computer ScienceMcMaster UniversityHamiltonCanada

Personalised recommendations