Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: XML::Parser Tutorial

by Anonymous Monk
on Sep 20, 2001 at 22:51 UTC ( #113668=note: print w/replies, xml ) Need Help??

in reply to XML::Parser Tutorial

When we use Xml::parser for parsing how to check the well formedness of the xml tag ,ie to check all the tags are closed and given tags are in pairs like that .......Is there is any method for that?Please let me know. Thanxz, Prabu

Replies are listed 'Best First'.
Re: Re: XML::Parser Tutorial
by ajt (Prior) on Sep 30, 2001 at 21:13 UTC
    There is a rule regarding XML (you may hate it), if the XML is not well-formed (all the tags matching up and correctly nested), then the parser should stop fatally.

    So if you try and parse a file that isn't well-formed XML you will discover this very quickly as the parser will die. (This is incientally a quick way of figuring out if a file is XML.)

    Davorg gives a good example here: Re: Is a file XML?. Basically you eval the parse call to trap the die, then do what you want afterwards.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://113668]
and the questions are moot...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (5)
As of 2017-12-11 17:25 GMT
Find Nodes?
    Voting Booth?
    What programming language do you hate the most?

    Results (309 votes). Check out past polls.