Abstract
Text-processing applications often need to match text against patterns (character strings that concisely describe sets of strings that are considered to be matches). For example, an application might need to locate all occurrences of a specific word pattern in a text file so that it can replace those occurrences with another word. NIO includes regular expressions to help text-processing applications perform pattern matching with high performance. This chapter introduces regular expressions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Electronic Supplementary Material
Below is the link to the electronic supplementary material.
Rights and permissions
Copyright information
© 2015 Jeff Friesen
About this chapter
Cite this chapter
Friesen, J. (2015). Regular Expressions. In: Java I/O, NIO and NIO.2. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-1565-4_9
Download citation
DOI: https://doi.org/10.1007/978-1-4842-1565-4_9
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-1566-1
Online ISBN: 978-1-4842-1565-4
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)