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. © Springer-Verlag Berlin Heidelberg 2008.
Author supplied keywords
Cite
CITATION STYLE
Hirzel, M., Nystrom, N., Bloom, B., & Vitek, J. (2007). Matchete: Paths through the pattern matching jungle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4902 LNCS, pp. 150–166). https://doi.org/10.1007/978-3-540-77442-6_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
