Matchete: paths through the pattern matching jungle

  • Authors:
  • Martin Hirzel;Nathaniel Nystrom;Bard Bloom;Jan Vitek

  • Affiliations:
  • IBM Watson Research Center, Hawthorne, NY;IBM Watson Research Center, Hawthorne, NY;IBM Watson Research Center, Hawthorne, NY;IBM Watson Research Center, Hawthorne, NY and Purdue University, Dpt. of Computer Science, West Lafayette, IN

  • Venue:
  • PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.