Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rewriting Techniques and Applications

RTA 1993: Rewriting Techniques and Applications pp 274–288Cite as

Generating tables for bottom-up matching

  • Conference paper

  • 192 Accesses

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

Abstract

Matching forms a bottle-neck in most implementations of rewrite systems. Bottom-up matching is a very fast form of matching. This paper presents a new approach to bottom-up matching that replaces match-sets by their unifiers. In this way it is possible to define a subsumption ordering on the states. A new algorithm is presented that uses the subsumption graph to compute the bottom-up tables. Its time complexity per table entry is O(rank × wd) where rank is the maximum arity of a function symbol and wd is the maximum number of immediate predecessors in the subsumption graph.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. David Chase. An improvement to bottom-up tree pattern matching. In Proceedings Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 168–177, January 1987.

    Google Scholar 

  2. J. Cai, R. Paige, and R. Tarjan. More efficient bottom-up tree pattern matching. In CAAP '90, pages 72–86. Springer LNCS 431, 1990.

    Google Scholar 

  3. Christoph M. Hoffmann and Michael J. O'Donnel. Pattern matching in trees. Journal of the ACM, 29(1):68–95, January 1982.

    Article  MATH  Google Scholar 

  4. Paul Walton Purdom and Cynthia A. Brown. Fast many-to-one matching algorithms. In Proceedings Rewriting Techniques and Applications. Springer LNCS 202, 1985.

    Google Scholar 

  5. Humphrey Robert Walters. On Equal Terms: Implementing Algebraic Specifications. PhD thesis, University of Amsterdam, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Engineering Research Centre, Postbus 424, 3500, AK Utrecht, The Netherlands

    Ernst Lippe

Authors
  1. Ernst Lippe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA Lorraine and CRIN, 615 Rue du Jardin Botanique, F-54602, Villers les Nancy Cedex, France

    Claude Kirchner

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lippe, E. (1993). Generating tables for bottom-up matching. In: Kirchner, C. (eds) Rewriting Techniques and Applications. RTA 1993. Lecture Notes in Computer Science, vol 690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21551-7_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21551-7_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56868-1

  • Online ISBN: 978-3-662-21551-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation