The longest multi-word palindrome in any language (idea)

The transformation

foo => foo sides reversed is oof

can be applied to any English palindrome (see longest English palindrome; commonly used English palindromes) of n letters to produce a palindrome of 2n + 15 letters. Applying this recursively can produce palindromes of unbounded length.