Cart
[Home] [By Thread] [By Date] [Recent Entries]
Vincent,
Mike's solution, however, assumes that the <br/> elements all appear at the same level. If you ever have <p> line1<br/> line2<br/> line3 <green>more line3<br/> but no! line4</green> more line4 <br/> linen </p> ....things get even trickier. See the thread "extracting a verse" from December 2002 for more on this. Cheers, Wendell At 05:47 AM 3/28/2003, you wrote: A more efficient solution is to treat it as a grouping problem. The sibling elements between two br elements constitute a group, the grouping key for this group is the generate-id() of the most recent br (or p) element. So you can use Muenchian grouping with the grouping key: ====================================================================== Wendell Piez mailto:wapiez@xxxxxxxxxxxxxxxx Mulberry Technologies, Inc. http://www.mulberrytech.com 17 West Jefferson Street Direct Phone: 301/315-9635 Suite 207 Phone: 301/315-9631 Rockville, MD 20850 Fax: 301/315-8285 ---------------------------------------------------------------------- Mulberry Technologies: A Consultancy Specializing in SGML and XML ====================================================================== XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
|
