Anchors are zero-width matches. They don’t match any actual characters in the search string, and they don’t consume any of the search string during parsing. Instead, an anchor dictates a particular location in the search string where a match must occur.
^ \A
Anchor a match to the start of <string>.When the regex parser encounters ^ or \A, the parser’s current position must be at the beginning of the search string for it to find a match.
Whatever follows ^ or \A must constitute the end of the search string.
$ \Z
Anchor a match to the end of <string>.When the regex parser encounters $ or \Z, the parser’s current position must be at the end of the search string for it to find a match.
Whatever precedes $ or \Z must constitute the end of the search string.
\b
Anchor a match to a word boundary.\b asserts that the regex parser’s current position must be at the beginning or end of a word. A word consists of a sequence of alphanumeric characters or underscores ([a-zA-Z0-9_]), the same as for the \w character class.
\B
Anchor a match to a location that isn't a word.\B does the opposite of \b. It asserts that the regex parser's current position must not be at the start or end of a word.
Save the python.txt into a variable text. Then do the following:
Split all the words
Split all the words in the text (by whitespace) and save it into a variable splitted_text.
Find all the words started with 're'
In splitted_text, find all instances of words that started with 're'. Print the length of it.
Find all the words ended with 'ing'
In splitted_text, find all instances of words that ended with '-ing'. Print the length of it.
Find all 'to', 'of', 'in'
Using original text, find all instances of the words 'to', 'of', and 'in'. Print the length of each.