Skip to main content
SpringerLink
Log in

Grammars without erasing rules. the OI case

  • Contributed Papers
  • Conference paper
  • First Online:
Book cover CAAP '81 (CAAP 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 112))

Included in the following conference series:

Abstract

The problem of ε-rules in context-free languages is generalized to the tree-case. For context-free tree grammars, we distinguish three classes of erasing rules : incomplete rules, ε-rules and monadic ε-rules (i.e. rules like X(x2)→x1). For grammars with erasing rules of just the third class, erasing-free grammars can be obtained and a construction is provided. Other results are negative and we prove that generally erasing rules cannot be avoided.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. ARNOLD, M. DAUCHET, "Un théorème de duplication pour les fonēts algébriques", J. Comput. System Sci. 13 (1976), pp. 223–244.

    Google Scholar 

  2. A. ARNOLD, M. DAUCHET, "Foréts algébriques et homomorphismes inverses", Information and Control. 37 (1978), pp. 182–196.

    Google Scholar 

  3. A. ARNOLD, M. DAUCHET, "Théorie des magmoïdes", RAIRO inf. th. 12 (1978), no 3, pp. 235–257 et 13 (1979), no 2, pp. 135–154.

    Google Scholar 

  4. A. ARNOLD, M. NIVAT, "Non deterministic recursive program schemes", In "Fundamentals of computation theory", (1977), Poznam-Lectures Notes in Computer Sciences no 56, Springer-Verlag, pp. 12–21.

    Google Scholar 

  5. G. BOUDOL, "Langages polyadiques algébriques. Théorie des schémas de programme: Sémantique de l'appel par valeur", Thèse de 3 ème cycle, Paris VII (1975).

    Google Scholar 

  6. B. COURCELLE, "A representation of trees by languages", Th. Comput. Sci. 6 (1978), pp. 255–279 and 7 (1978) pp. 25–55.

    Google Scholar 

  7. J. ENGELFRIET and E.M. SCHMIDT, "Io and OI", J. Comput. System Sci. 15 (1977), pp. 328–353 and 16 pp. 67–99.

    Google Scholar 

  8. M.J. FISCHER, "Grammars with macro-like productions", 9 th IEE Symp. On switching and automata theory (1968), pp. 131–142.

    Google Scholar 

  9. I. GUESSARIAN, "Program transformation and algebraic semantics", Publication interne LITP 78/21 (1978), A paraître dans TCS.

    Google Scholar 

  10. B. LEGUY, "Réductions, transformations et classification des grammaines algébiques d'arbres". Thèse de 3 ème cycle, Lille (1980).

    Google Scholar 

  11. W.C. ROUNDS, "Mappings and grammars on trees", Math. Systems theory. 4 (1968), pp. 257–287.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Lille I, France

    Bernard Leguy

Authors
  1. Bernard Leguy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egidio Astesiano Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leguy, B. (1981). Grammars without erasing rules. the OI case. In: Astesiano, E., Böhm, C. (eds) CAAP '81. CAAP 1981. Lecture Notes in Computer Science, vol 112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10828-9_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-10828-9_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10828-3

  • Online ISBN: 978-3-540-38716-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation