Skip to main content
SpringerLink
Log in

Parameter-reduction of higher level grammars

  • Complexity
  • Conference paper
  • First Online:
CAAP '88 (CAAP 1988)

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

Included in the following conference series:

  • 137 Accesses

Abstract

A higher level (OI-)grammar is called terminating, if for every accessible term t there is at least one terminal term which can be derived from t. A grammar is called parameter-reduced, if it is terminating and has no superfluous parameters.

For every grammar G of level n>0 which generates at least one term we construct grammars R(G) and P(G) such that R(G) and P(G) generate the same language as G but are terminating and paramter-reduced, respectively.

We introduce a hierarchy of restrictions to the deletion capability of the grammars which allow a gradual decrease in the complexity of the algorithms from n-iterated exponential time to polynomial time.

Extended abstract

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. S. Abramsky: Strictness analysis and polymorphic invariance. Programs as Data Objects, Proc. of a Workshop Copenhagen, Denmark, 1985, Lecture Notes in Comp. Sci. 217 pp. 1–23

    Google Scholar 

  2. A.V. Aho, J.E. Hopcroft, J.D. Ullman: The Design and Analysis of Computer Algorithms. Addison Wesley, Reading, MA, 1974

    Google Scholar 

  3. A. Arnold, M Dauchet: Un theoreme de duplication pour les forets algebriques. JCSS 13, 1976, pp. 223–244

    Google Scholar 

  4. A. Arnold, M. Dauchet: Forets algebriques et homomorphismes inverses. Inf. and Control 37, 1978, pp. 182–196

    Google Scholar 

  5. A. Arnold, B. Leguy: Une propriete des forets algebriques "de Greibach". Inf. and Control 46, 1980, pp. 108–134

    Google Scholar 

  6. H.P. Barendregt: The Lambda-Calculus. North Holland, Amsterdam, 1981

    Google Scholar 

  7. G.L. Burn, C.L. Hankin, S. Abramsky: The theory of strictness analysis for higher order functions. Programs as Data Objects, Proc. of a Workshop, Copenhagen, Denmark 1985, Lecture Notes in Comp. Sci. 217, pp. 46–66

    Google Scholar 

  8. C. Clack, S.L.P. Jones: Strictness analysis — a practical approach. Functional Programming Languages and Computer Architecture, Lecture Notes in Comp. Sci. 201, 1985, pp. 35–49

    Google Scholar 

  9. B. Courcelle: A representation of trees by languages. TCS 6, 1978, pp. 255–279 and TCS 7, 1978, pp. 25–55

    Google Scholar 

  10. B. Courcelle: Equivalences and transformations of regular systems — applications to recursive program schemes and grammars. TCS 42, 1986, pp. 1–122

    Google Scholar 

  11. W. Damm: Higer type program schemes and their tree languages. Proc. 3. GI-Conf. on Th. Comp. Sci. Lecture Notes in Comp. Sci. 48, 1977, S. 51–72

    Google Scholar 

  12. W. Damm: Languages defined by higher type program schemes. Proc. 4th Int. Coll. on Automata, Languages and Programming Lecture Notes in Comp. Sci. 52, 1977, pp. 164–179

    Google Scholar 

  13. W. Damm: An algebraic extension of the Chomsky-hierarchy. Proc. Conf. on Math. Foundations of Comp. Sci. Lecture Notes in Comp. Sci. 74, 1979, pp. 266–276

    Google Scholar 

  14. W. Damm: The IO-and OI-hierarchies. TCS 20, 1982, pp. 95–205

    Google Scholar 

  15. W. Damm, E. Fehr: A schematological approach to the analysis of the procedure concept in ALGOL-languages. Proc. 5ieme Colloque sur les Arbres en Algebre et en Programmation, 1980, pp. 130–134

    Google Scholar 

  16. W. Damm, E. Fehr, K. Indermark: Higher type recursion and self-application as control structures. In: E. Neuhold (ed.): Formal Description of Programming Concepts, North Holland, Amsterdam, 1978, pp. 461–487

    Google Scholar 

  17. W. Damm, A. Goerdt: An automata-theoretical characterization of the OI-hierarchy. Inf. and Comp. 71, 1986, pp. 1–32

    Google Scholar 

  18. W. Damm, I. Guessarian: Combining T and level N. Tech. Report Laboratoire Informatique Theorique et Programmation 81–11, 1981

    Google Scholar 

  19. W. Damm, I. Guessarian: Implementation techniques for recursive tree transducers on higher order data types. Tech. Report Laboratoire Informatique Theorique et Programmation 83–16, 1983

    Google Scholar 

  20. J. Engelfriet, E.M. Schmidt; IO and OI. JCSS 15, 1977, pp. 328–353, and JCSS 16, 1978, pp. 67–99

    Google Scholar 

  21. J. Engelfriet: Iterated pushdown automata and complexity classes. Proc. 15th STOC, 1983, pp. 365–373

    Google Scholar 

  22. M.J. Fischer: Grammars with macro-like productions. Proc. 9th IEEE Conf. on Switching and Automata Theory, 1968, pp. 131–141

    Google Scholar 

  23. S. Fortune, D. Leivant, M. o'Donnell: The expressiveness of simple and second order type structures. JACM 30, 1983, pp. 151–185

    Google Scholar 

  24. J.H. Gallier: n-Rational algebras. SIAM J. of Computing 13, 1984, pp. 750–794

    Google Scholar 

  25. I. Guessarian: Program transformations and algebraic semantics. TCS 9, 1979, pp. 39–65

    Google Scholar 

  26. P. Hudak, J. Young: Higher-order strictness analysis in untyped lambda calculus. Proc. of the 13th Ann. Symp. on Principles of Programming Languages, 1986, pp. 97–109

    Google Scholar 

  27. B. Leguy: Reductions, transformations et classification des grammairs algebriques d'arbres. These de 3ieme cycle Lille, 1980

    Google Scholar 

  28. B. Leguy: Grammars without erasing rules, the OI-case. Proc. 6ieme Colloque sur les Arbres en Algebre et on Progammation, 1981, Lecture Notes in Comp. Sci. 112, pp. 268–273

    Google Scholar 

  29. T.S.E. Maibaum: A generalized approach to formal languages. JCSS 8, 1974, pp. 409–439

    Google Scholar 

  30. A.N. Maslov: The hierarchy of indexed languages of an arbitrary level. Soviet. Math. Dokt. 15(14), 1974, pp. 1170–1174

    Google Scholar 

  31. R. Milner: Fully abstract models of typed lambda-calculus. TCS 4, 1977, pp. 1–22

    Google Scholar 

  32. A. Mycroft: The theory and practice of transforming call-by-need into call-by-value. Proc.4th Colloque International sur la Programmation Paris, 1980, pp. 269–281

    Google Scholar 

  33. W.J. Paul: Kompexitätstheorie. Teubner Stuttgart, 1978

    Google Scholar 

  34. E.M. Schmidt: Succinctness of description of contextfree, regular and finite languages. Datalogisk Afdelning Report DAIMI PB-84, Aarhus Univ., 1978

    Google Scholar 

  35. H. Seidl: Regularität bei Grammatiken höherer Stufe. Diss. Thesis, Frankfurt/Main, 1986

    Google Scholar 

  36. H. Seidl: Parameter-reduction of Higher Level Grammars. To appear in TCS

    Google Scholar 

  37. M. Wand: An algebraic formulation of the Chomsky-hierarchy. Category Theory Applications to Computation and Control, Lecture Notes in Comp. Sci. 25, 1975, pp. 209–219.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Johann Wolfgang Goethe-Universität, Postfach 111 932, D-6000, Frankfurt/Main

    Helmut Seidl

Authors
  1. Helmut Seidl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Dauchet M. Nivat

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seidl, H. (1988). Parameter-reduction of higher level grammars. In: Dauchet, M., Nivat, M. (eds) CAAP '88. CAAP 1988. Lecture Notes in Computer Science, vol 299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026096

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19021-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation