Explain Recursive Structure Finding Algorithms

This document explains the top-down and bottom-up recursive structure finding algorithms used in Spec to Algorithm's Context Free Grammar Generator. The top-down algorithm (find_lists3a) recursively decomposes input lists by matching bracket pairs, detecting repeating units, and building nested '&r'-tagged structures, while the bottom-up algorithm (find_lists3_optimized) attempts the smallest repeating patterns first for efficiency. Both algorithms are implemented in Prolog and rely on helper predicates for splitting, checking, and folding list structures.