Explain Recursive Structure Finding Algorithms

Courtesy ChatGPT: Explain Spec to Algorithm’s Context Free Grammar Generator’s top-down and bottom-up recursive structure finding algorithms. The top down algorithm is: find_lists3a(L1,L32,Rest) :- find_lists3(L1,[],L91,_Rest_a), (fail ->(L4=_L92,Flag=true); (L4=L91,Flag=false)), (L4=[]->L4=L3; (L4=[_L2]->L4=L3; (L4=[L2|L31], check14(L31,L2,[],L5,Rest), (L5=[['&r'|_]|_]->L5=L3; ((L5=[L51]->true;L51=L5), L3=[['&r',L51]])) ))), (Flag=true->L32=[['&r',L3]];L32=L3), !. find_lists3([],L,L,_) :- !. find_lists3(L1,L2,L3,Rest) :- repeating_unit(L1,U,Rest), (U=['&r',U1]-> try(U1,U2); U2=U), append(L2,[['&r',U2]],L3). match_char("[","]"). match_char("(",")"). match_char("{","}"). match_char(A,A). find_lists3(L1,L2,L3,Rest) :- L1=[L4|L5], match_char(L4,L41), find_lists4(L2,L5,L4,L41,L3,Rest). find_lists4(L2,L5,L4,L41,L3,Rest) :- member(L4,L5), sub_l