Matchete: Paths through the Pattern Matching Jungle

  • Martin Hirzel
  • Nathaniel Nystrom
  • Bard Bloom
  • Jan Vitek
Conference paper

DOI: 10.1007/978-3-540-77442-6_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4902)
Cite this paper as:
Hirzel M., Nystrom N., Bloom B., Vitek J. (2007) Matchete: Paths through the Pattern Matching Jungle. In: Hudak P., Warren D.S. (eds) Practical Aspects of Declarative Languages. PADL 2008. Lecture Notes in Computer Science, vol 4902. Springer, Berlin, Heidelberg

Abstract

Pattern matching is a programming language feature for selecting a handler based on the structure of data while binding names to sub-structures. By combining selection and binding, pattern matching facilitates many common tasks such as date normalization, red-black tree manipulation, conversion of XML documents, or decoding TCP/IP packets. Matchete is a language extension to Java that unifies different approaches to pattern matching: regular expressions, structured term patterns, XPath, and bit-level patterns. Matchete naturally allows nesting of these different patterns to form composite patterns. We present the Matchete syntax and describe a prototype implementation.

Keywords

Pattern matching regular expressions XPath binary data formats Java 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Martin Hirzel
    • 1
  • Nathaniel Nystrom
    • 1
  • Bard Bloom
    • 1
  • Jan Vitek
    • 1
    • 2
  1. 1.IBM Watson Research Center, 19 Skyline Drive, Hawthorne, NY 10532USA
  2. 2.Dpt. of Computer SciencePurdue UniversityWest LafayetteUSA

Personalised recommendations