Post #2955785

Tiny algorithm to find palindromes or anacyclics (with Regular Expressions) in a given text to compose a poem, a bit like this (on the right) by Bob Cobbing, 1966. The appeal is that it’s not so strict. \b(\w)(\w)(\w)\w?\s\3\2\1\b — capturing groups and backreferences