compile python3 online

Language: Layout:

import re

def search_words( regex, target):
    result = []
    for m in re.finditer( regex, target):
        #check if there is a capture
        if m.lastindex:
            result.append(m.group())
    
    return result

p = re.compile(r"""
        \b(?:\w+\W+){0,20}           # in the next 20 words
        (?:BADWORD1|BAD2)            # find a BADWORD
        \b(?:\W+\w+){0,20}           # and consume 20 more words avoiding a match there

|\b(PRIMARY1|P2|P3)\b        # else, succeed if it matches a PRIMARY

|\b(SECONDARY1|S2|S3)        # else, find a SECONDARY
           \W+(?:\w+\W+){0,20}       # nearly followed by
           (TERTIARY1|T2|T3)\b       # a TERTIARY
   
        |\b(TERTIARY1|T2|T3)         # or else, find a TERTIARY
           \W+(?:\w+\W+){0,20}       # nearly followed by
           (SECONDARY1|S2|S3)\b      # a SECONDARY
        """, re.IGNORECASE | re.VERBOSE)

text_list = [
             "PRIMARY1 word word SECONDARY1 word TERTIARY1",
             "word word word word word word word word word word word word word word word word word word word word word BADWORD1 word word word word word word word word word word PRIMARY1 . . . . . . . . . . . . . . . .",
             "word word word word word word word word word word word word word word word word word word word word word BADWORD1 word word word word word word word word word word word <MORE THAN 20 WORDS AWAY FROM BAD> word word word TERTIARY1 word word word word word word word word SECONDARY1. . . . . . . . . . . . . . . . . . . . . . . . . . . ."
             ]

for text in text_list:
    match_result = search_words( p, text)
    
    print("\nTEXT = %s" % text)
    print("MATCHES = %s" % (match_result if match_result else 'No'))

[ + ] Show input
Absolute running time: 0.15 sec, cpu time: 0.03 sec, memory peak: 8 Mb, absolute service time: 0.16 sec