O'Reilly logo

Groovy Programming by John Savage, Kenneth Barclay

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

APPENDIX D MORE ON STRINGS AND REGULAR EXPRESSIONS

A regular expression is a formula for matching strings to some pattern. They can provide very powerful mechanisms for describing the pattern, for splitting a string according to the pattern, or for modifying the string around the pattern. At first sight, they can appear daunting because of their complicated construction. However, a little practice can greatly ease matters.

D.1 REGULAR EXPRESSIONS

Regular expressions are essentially a specialized programming language hosted within Groovy. They provide a means of determining whether a string matches some pattern. For example, we might wish to determine whether a string has the pattern of a social security number. We can also use regular expressions ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required