If you're doing it moduleless, why not:

• read all "(marker) associated text" blocks into a hash
• parse hash keys with rules to work out placement
• create new node hash to show parentage

ie

# use this in your rule tests for position
my %structure = (
  1 => {qw(a b c d e f g h i etc...)},
  2 => {qw(1 2 3 4 5 6 7 8 9 10 11 12 13 etc...)},
  3 => {qw(A B C D E F G H I etc...)},
  4 => {qw(i ii iii iv v vi vii viii ix x xi etc...)}
  );

my %legalese; # hash to store text/markers
my $key = 2;  # key marker to keep order ('1' is tree root)

# read into hash
while (s/\((\w+)\)(.*?)(\(\w+\))/$3/s) {
  $legalese{$key}{'list_id'} = $1;
  $legalese{$key}{'content'} = $2;
  $key++;
}

my %node = ( 1 => ''); # node structure tree
                       # initialise with single node
                       # to denote top of page
# now work on rules for tree depth
my $last_node;

# go through markers in order parsed in
for (sort {$a <=> $b;} keys %legalese) {
   # too tired to try to create rule set :)
   # but set nodes as follows
   $node{$_}{'parent'} = 'whatever parent node is'
   # either '1', $last_node, or somewhere in between
   # using %structure as your guide
   $last_node = $_;
}
[download]

The above is in no way final code, but that's the sort of approach I'd take.

Hope that's enough pointers. By knowing what type the previous node was, you can create a valid rule for the next node by asking:

• is it of the child type expected?
• is it of the same type, incremented one?
• is it of parent type, incremented one?
• is it of grandparent type, incremented one?
• if out of structure expected, append to previous node (ie, embedded list)

etc, etc...

cLive ;-)