Re^2: Need help in xml well formedness checker.

Replies are listed 'Best First'.
Re^3: Need help in xml well formedness checker. by Zaxo (Archbishop) on Feb 21, 2007 at 08:45 UTC
There are PurePerl versions of some XML parsers. You need a parser to check well-formedness even if you don't retain any content. It sounds like you need to find a way to cheat. After Compline, Zaxo	[reply]
Re^3: Need help in xml well formedness checker. by GrandFather (Saint) on Feb 21, 2007 at 08:34 UTC
XML is not trivial to parse so your options are do a lot of work yourself or get someone else to do a lot of work for you. People have actually done that work and provide it in a variety of modules. If your boss won't allow you to use code in the form of existing modules why should he allow you to use equivelent code obtained from somewhere else? Sure, something that validates a trivial subset of XML could be written in reasonable time. But how small a subset is really useful? What can be done with simple code is very trivial indeed! DWIM is Perl's answer to Gödel	[reply]
Re^3: Need help in xml well formedness checker. by Khen1950fx (Canon) on Feb 21, 2007 at 09:54 UTC
I agree with Zaxo---you need to find a way to cheat. The easiest way that I can think of to "cheat" is to use an online "well-formedness" checker like RUWF.	[reply]