Re: Best way to handle multiple string replacements?

Warren Hedley writes:
 > With longish text nodes, this approach could result in some pretty
 > deep recursion couldn't it? 

Yes, but thats what computers are for :-}

 > that works. If not, you can replace special characters with some
 > really unlikely string, do some more replacement, and then replace
 > the unlikely string with the desired result as the final step.

at least my approach is foolproof in this respect. 

As I say, I'd use dedicated transcoding software myself, if I had
to. But since LaTeX is almost infinitely configurable as regards input
encoding, I still claim you are making a stick to beat yourself with
unnecessarily.

Sebastian


 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list