Making Programs Faster

`parse_text`

At this point I built a test case

     This is a small stress test of the B<pod delimiter> mechanism.  You
     are allowed to have X<< double >> and even Y<<< triple >>> delimiters.
     Ordinary Z<single I<delimiters> may be> nested or may contain A<funny
     < characters>.  C<< Double D<delimiters> may >> E<< also F<<< nest >>>
     if desired >>.

Old tokenization:

     (This is a small stress test of the )
     (B<)
     (pod delimiter> mechanism.  You\nare allowed to have )
     (X<< )
     (double >> and even )
     (Y<<< )
     (triple >>> delimiters.\nOrdinary )
     (Z<)
     (single )
     (I<)
     (delimiters> may be> nested or may contain )
     (A<)
     (funny \n< characters>.  )
     (C<< )
     (Double )
     (D<)
     (delimiters> may >> )
     (E<< )
     (also )
     (F<<< )
     (nest >>>\nif desired >>.\n)