• From: "Mark D. Anderson" <mda@d...>
• To: <xml-dev@i...>
• Date: Sun, 20 Dec 1998 16:08:37 -0800

Suppose I want the "diff" between two xml files.

I can imagine a few approaches:

- very-cheasy:
just use "diff"

- almost-as-cheasy:
first do s/\>/\>\nUNIQUE/g to put the tags on separate lines,
then use "diff", then restore by s/\nUNIQUE//g

- graph-theoretic:
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.

-mda




xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev@i...
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/
To (un)subscribe, mailto:majordomo@i... the following message;
(un)subscribe xml-dev
To subscribe to the digests, mailto:majordomo@i... the following message;
subscribe xml-dev-digest
List coordinator, Henry Rzepa (mailto:rzepa@i...)

• Follow-Ups:
  • Re: xml diff?
    • From: Ken MacLeod <ken@b...>

• Prev by Date: Re: External DTD & namespaces
• Next by Date: parallelism in presentation?
• Previous by thread: PEReferences in ElementDecls (Parsing of DTDs)
• Next by thread: Re: xml diff?
• Index(es):
  • Date
  • Thread