Mark D. Anderson
mda at discerning.com
Mon Dec 21 00:18:01 GMT 1998
Suppose I want the "diff" between two xml files.
I can imagine a few approaches:
just use "diff"
first do s/\>/\>\nUNIQUE/g to put the tags on separate lines,
then use "diff", then restore by s/\nUNIQUE//g
surely there must be some CS work on algorithms for finding
the least cost path between two trees, expressed as a sequence
of operations? the simplest is with just the operations of
add/delete of subtrees, but move and copy are interesting too.
xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev at ic.ac.uk
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/
To (un)subscribe, mailto:majordomo at ic.ac.uk the following message;
To subscribe to the digests, mailto:majordomo at ic.ac.uk the following message;
List coordinator, Henry Rzepa (mailto:rzepa at ic.ac.uk)
More information about the Xml-dev