CS 211 Regular Expressions

Transcription

1 CS 211 Regular Expressions 2-1

2 REGULAR EXPRESSIONS 2

3 Processing Input If we know how to read in a line of input, what else might we want to do with it? Analyze it in some way, based on some pattern Extract certain values out of it, based on some pattern We can create regular expressions to identify patterns, and then use them to extract the relevant info out of the pattern. A regular expression represents a pattern Can be used to "match" a particular string e.g., with Scanner s findinline() method Java represents a regular expression with a String literal Regular Expressions: appendix H in the text.

4

5 CREATING REGULAR EXPRESSIONS 5

6 Special Symbols: Repetition symbol meaning. any single character * zero or more of the previous thing + one or more of the previous thing? zero or one of the previous thing {n} n of the previous thing {n,m} n-to-m of the previous thing {n,} n-or-more of the previous thing any non-special char matches itself Each of these determines how many of the one thing on its left to repeat. a* matches zero or more a's. xyz+ matches an x, a y, and then one or more z's. 6

7 A Simple Method for TesBng Regular Expressions public stabc void main (String[] args) { Scanner sc = new Scanner(System.in); String str = ""; String regex = "k.t+y"; System.out.println("\nPaRern: "+regex+"\n"); while (!str.equals("quit")) { System.out.println("next input please: "); str = sc.nextline(); System.out.println("\n\nstring: \""+str+"\"\nparern: " +regex+"\nmatches: "+str.matches(regex)+"\n"); } } 7

8 Prac=ce Problems What are some strings that each parern would match, and would not match? Test them out in live code. 1. k.ry 2. a* 3. b+c* 4. ba{2,5} 5. go{1,}al! 6. a+b?c*d 8

9 Special Symbols: grouping grouping (pa/ern) a b meaning parentheses group things matches parern a, or parern b, exactly Parentheses are useful for grouping things to be repeated with our repetition symbols. 9

10 Prac=ce Problems What are some strings that each parern would match, and would not match? Test them out in live code. 1. ba(na)* 2. b(a e i o u)t 3. (un)?sure 4. d(o i)*t 5. ((c l r d)(o a))+ How would you represent the following regular expressions? 1. "tweedledee" or "tweedledum" 2. "I like you", "I like like you", "I like like like you", etc. 3. An accusabon in the game "Clue" ("it was Col. Mustard in the Library with the Wrench!") 10

11 Special Symbols: "character classes" "character class" [chars] [a-z] [^a-z] [abc[def]] [aeiou&&[a-m]] meaning any single char between []'s any single char from a-to-z. any single char not from a-to-z. union of [abc], [def] (one char from either) intersecbon of [aeiou], [a-m] (one char, that must be in both) Many more character classes can be found at: hrp://docs.oracle.com/javase/1.4.2/docs/api/java/ubl/regex/parern.html 11

12 Prac=ce Problems What are some strings that each parern would match, and would not match? Test them out in live code. 1. b[aeiou]t 2. a[^aeiou]e 3. 5[a-z[A-Z]]8 4. [aeiou&&[a-m]] 5. [a-za-z] 6. [0-9]+ How would you represent the following regular expressions? 1. a posibve odd integer consonants 3. three lerers that are not in your inibals 12

13 Special Symbols: Boundaries boundary representa=on ^ meaning beginning of line* $ end of input/line. \b word boundary (between chars: one is lerer, one is not) \B not a word boundary * note: second usage of the ^ symbol! This one is always outside []'s. to use $ with a scanner's findinline method, we need an embedded flag, (?m), in order for it to behave as we'd expect. (see next slide). It instructs Java to consider the end of a line as the "end of input", allowing $ to match not just the end of the stream but the end of any line. example: (?m)the\send$ instead of the\send$ 13

14 Embedded Flag Expressions Different modes can be used in regular expressions. Different languages indicate them for regular exprs in different ways Java: we can add embedded flag expressions at parern beginning: flag name meaning (?d) unix lines only \n means newline (for., ^, $) (?i) case insensibve case insensibve (?x) comments allow embedded comments/whitespace in parern (?m) mulb-line let ^, $ match at newline, not just end of enbre input (?s) dotall toggle whether. matches \n or not (?u) unicode case make 'case-insensibve' unicode-consistent (?i)hello matches hello (?m)the end$ can be found within "the end\n or is it?" 2-14

15 Prac=ce Problems What are some strings that would contain each given parern? Test them out in live code. 1. \ban\b 2. \Bable\b 3. \bpre\b 4. \BaB\B How would you represent the following regular expressions? 1. a string containing a word with prefix "sub" 2. a string containing an integer 3. a string containing a real number 15

16 Special Symbols: Pre-defined groups boundary representa=on meaning \d [0-9] any single digit char \D [^0-9] any single non-digit char \s [ \t\n\f\r] any whitespace char * \S [^ \t\n\f\r] any non-whitespace char* \w [a-za-z0-9_] any idenbfier char (any 'word' char) \W [^a-za-z0-9_] any non-idenbfier char * note: there is a space char in this. Other whitespace chars also, but their unicode representations were omitted here. 16

17 Prac=ce Problems What are some strings that would contain each given parern? Test them out in live code. 1. \d+ 2. \d\d\d\s+\w+\sstreet 3. [1-9]\d+ How would you represent the following regular expressions? 1. a phone number of the form (123) an even number 3. a legal Java idenbfier 4. a Java idenbfier without uppercase lerers 17

18 Special Symbols: everything else boundary representation meaning \ represents instead of its special meaning any non-special char matches itself the backslash is used to escape any special character, so that we can match the character itself. a* matches zero or more a's a\* matches an a followed by a star \b "matches" the gap between characters, instead of a particular character. \bhe\b would match within "if he is" wouldn't match within "if she is" or "anthem". here, could be [,],*,+,?,{,},and so on. It's a placeholder for the special symbols, and would not show up in a regular expression itself. 18

19 Representing Regular Expressions in Java We use a String literal to represent a regular expression in Java. This means that " must be escaped: \" This also means the \ must also be escaped! \\" (represents ") Suggested conversion: write the regexp on paper, carefully represent each character correctly inside the String, one at a Bme: regular expression Java String representa=on an example matching String (without the surrounding quotes) \(\d{3}\) "\\(\\d{3}\\)" (456) I "hate" airquotes "I \"hate\" airquotes" I "hate" airquotes \\d means digits "\\\\d means digits" \d means digits abc\n123 "abc\\n123" abc\n123 19

20 Extracting Strings via Scanner // getting to each of the pattern from the standard input Scanner sc = new Scanner (System.in); // define the regular expression. String regex = "kit{2,4}y"; // test with "here, kitty kitty kitty! // try to get the first line. String temp = sc.findinline(regex); // keep using and getting lines. // null is returned upon failure to match while (temp!= null){ System.out.println(temp); } temp = sc.findinline(regex); 20

21 Using Regular Expressions in Java We could mostly use a few methods from the String class: public boolean matches (String regex) does this String contain a match of the regex parameter? public String replace (String target, String replacement) in this String, replace all occurrences of target with replacement. No actual regex here, just a straight-up substring search. (replaceall allows for finding a regex and replacing with other string). public String[] split (String regex) {..} in this String, using regex as a delimiter, return all substrings that weren't part of the regex matches as an array of Strings. 21

22 Java Pattern class contains a few classes and useful methods. public static boolean matches(string regex,charsequence input{..} tells us if regex can be found within input. public String[] split (CharSequence input) {..} returns String array of things "between" the input. public static Pattern compile (String regex) {..} stores the compiled version of a parern from a regex String. can significantly speed up PaRern usage within a loop CharSequence is an interface that sort of represents Strings. Pretend it says String. 2-22

23 Using the PaRern and Matcher classes going from String to calculabons on regular expressions is costly, so we can save that "regex compilabon" in a PaRern object: PaRern pat = PaRern.compile(regExpString); We can then get a Matcher from a PaRern: Matcher mat = pat.matcher(stringtolookthrough); Finally, we can check for a match: if (mat.matches()) { 2-23

24 Capture Groups Ayer a match is performed, each parenthesized porbon from a successful match can be individually grabbed: Pattern pat = Pattern.compile("(\\d),(\\d),(\\d)"); Matcher mat = pat.matcher("3,4,5"); if (mat.matches()){ int first = Integer.parseInt(mat.group(1)); int second = Integer.parseInt(mat.group(2)); int third = Integer.parseInt(mat.group(3)); //always the whole thing String wholematch = mat.group(0); System.out.println(wholeMatch+" -> " + (first*2)+","+(second*2)+","+(third*2)); } else { System.out.println("no match."); } 2-24

25 Capture Groups, Back-references A regular expression can have a back-reference to a capture group. Just escape the group number: Pattern pat = Pattern.compile("(\\d) is \\1"); String regexp = "9 is 9"; Matcher mat = pat.matcher(regexp); if (mat.matches()){ int first = Integer.parseInt(mat.group(1)); //always the whole thing String wholematch = mat.group(0); System.out.println(wholeMatch+".first(only grp):" +first); } else { System.out.println("no match."); }

26 Capture Groups (summary) Note that the method group(int g) always returns a String. Capture groups let us access the parts of a match for quick use of all the parts of our match. back-references let us have different parts of one parern that must match each other while sbll being as expressive as any other regular expression. PreRy cool! 2-26