On three types of unambiguity of context-free language

  • A. Ja. Dikovskii
  • Larisa S. Modina
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)


Full Derivation Dependency Tree Derivation Tree Formal Grammar Syntactic Relation 
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.


  1. 1.
    Gladkii A.V., Formal grammars and languages, M., Nauka, 1973 (russ.) — in translation into English by North-Holland P.Co.Google Scholar
  2. 2.
    Modina L.S., On dependency ambiguity of context-free languages, in print (russ.)Google Scholar
  3. 3.
    Modina L.S., On some formal grammars generating dependency trees, Lecture Notes in Computer Sci., 32, Berlin-Heidelberg-New-York, 1975, 326–329.Google Scholar
  4. 4.
    Modina L.S., On degrees of dependency ambiguity, unpublished manuscript.Google Scholar
  5. 5.
    Modina L.S., Dendrogrammars and dendrolanguages, Kibernetika (Kiev), 1975, N5, 86–93 (russ.)Google Scholar
  6. 6.
    Melčuk I.A., Experiment of the theory of linguistic models "Meaning ⇔Text", M., Nauka, 1974 (russ.)Google Scholar
  7. 7.
    Modina L.S., On some formal systems generating dependency trees, Problemy Peredači Informacii, 1976, 12, N2, 83–94 (russ.)Google Scholar
  8. 8.
    Greibach S.A., A new normal-form theorem for context-free phrase structure grammars, J.Assoc.Comput.Mach., 1965, 12, N1, 42–52.Google Scholar
  9. 9.
    Ogden W., A helpfull result for proving inherent ambiguity, Math.Syst.Theory, 1968, 2, N3, 191–194.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • A. Ja. Dikovskii
    • 1
  • Larisa S. Modina
    • 1
  1. 1.Institute of MathematicsNovosibirskUSSR

Personalised recommendations