Hi, On Python website, it says that the following match can reach 'abcb' in 6 steps:
............. A step-by-step example will make this more obvious. Let's consider the expression a[bcd]*b. This matches the letter 'a', zero or more letters from the class [bcd], and finally ends with a 'b'. Now imagine matching this RE against the string abcbd. The end of the RE has now been reached, and it has matched abcb. This demonstrates how the matching engine goes as far as it can at first, and if no match is found it will then progressively back up and retry the rest of the RE again and again. It will back up until it has tried zero matches for [bcd]*, and if that subsequently fails, the engine will conclude that the string doesn't match the RE at all. ............. I write the following code: ....... import re line = "abcdb" matchObj = re.match( 'a[bcd]*b', line) if matchObj: print "matchObj.group() : ", matchObj.group() print "matchObj.group(0) : ", matchObj.group() print "matchObj.group(1) : ", matchObj.group(1) print "matchObj.group(2) : ", matchObj.group(2) else: print "No match!!" ......... In which I have used its match pattern, but the result is not 'abcb' Only matchObj.group(0): abcdb displays. All other group(s) have no content. How to write this greedy search? Thanks, -- https://mail.python.org/mailman/listinfo/python-list
