Skip to main content
SpringerLink
Log in

Formal grammars which take account of external terminal contexts

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. V. N. Red'ko, “Parametric grammars and the parametrization problem,” in: Automation of Programming, No. 1, Izd. Inst. Kibernetika Akad. Nauk Ukr. SSR, Kiev (1969).

    Google Scholar 

  2. V. N. Red'ko, “Parametric grammars and the problem of syntactic analysis of languages,” in: Transactions of the Second All-Union Conference on Programming [in Russian], Novosibirsk (1970).

  3. V. A. Trakhtenbrot, “Turing calculations with logarithmic retardation,” Algebra i Logika,3, No. 4 (1964).

  4. V. A. Trakhtenbrot, Complexity of Algorithms and Calculations [in Russian], Izd. NGU, Novosibirsk (1967).

    Google Scholar 

  5. Ya. M. Bardzin', “Complexity of symmetry recognition on a Turing machine,” in: Problems of Cybernetics [in Russian], Vol. 15, Moscow (1965).

  6. J. Feldman and D. Gries, “Systems for constructing translators,” Algoritmy i Algoritmicheskie Kyzaki, No. 5 (1971).

  7. S. Ginsburg, Mathematical Theory of Languages [Russian translation], Mir, Moscow (1970).

    Google Scholar 

  8. D. H. Yanger, “Recognition and analysis of context-free languages in a time n3,” in: Problems of Mathematical Logic [Russian translation], Izd. Mir, Moscow (1970).

    Google Scholar 

  9. R. Floyd, “On the nonexistence of a phrase structure grammar for ALGOL 60,” Commun. of the ACM, No. 5 (1962).

  10. R. Kurki-Suonio, “Notes on top-down languages,” BIT, Nordisk Tidskrift for Information Behandling, Kobenhavn,9 (1969).

  11. D. Rosenkrantz and R. E. Stearns, “Properties of deterministic top-down grammars,” Inf. Control,17, No. 3 (1970).

    Google Scholar 

  12. K. Culik, II, “Contribution to deterministic top-down analysis of context-free languages,” Kybernetika, C.5, R. 4 (1968).

    Google Scholar 

  13. S. Greibach, “A new normal form theorem for context-free phrase structure grammars,” J. ACM,12 (1965).

  14. S. Kuroda, “Classes of languages and linearly constrained automata,” in: Cybernetics Collection, New Series, No. 9 [Russian translation], Izd. Mir, Moscow (1972).

    Google Scholar 

  15. S. Henney, “Calculations on a one-tape Turing machine with writing on a tape,” in: Problems of Mathematical Logic [Russian translation], Mir, Moscow (1970).

    Google Scholar 

Download references

Authors
  1. A. V. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 81–88, May–June, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anisimov, A.V. Formal grammars which take account of external terminal contexts. Cybern Syst Anal 10, 468–476 (1974). https://doi.org/10.1007/BF01068715

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01068715

Keywords

Search

Navigation