David Helkowski > XML-Bare > XML::Bare

Download:
XML-Bare-0.53.tar.gz

Dependencies

Annotate this POD

Related Modules

XML::LibXML
XML::Simple
XML::Parser
more...
By perlmonks.org

CPAN RT

New  2
Open  1
View/Report Bugs
Module Version: 0.53   Source  

NAME ^

XML::Bare - Minimal XML parser implemented via a C state engine

VERSION ^

0.53

SYNOPSIS ^

  use XML::Bare;
  
  my $ob = new XML::Bare( text => '<xml><name>Bob</name></xml>' );
  
  # Parse the xml into a hash tree
  my $root = $ob->parse();
  
  # Print the content of the name node
  print $root->{xml}->{name}->{value};
  
  ---
  
  # Load xml from a file ( assume same contents as first example )
  my $ob2 = new XML::Bare( file => 'test.xml' );
  
  my $root2 = $ob2->parse();
  
  $root2->{xml}->{name}->{value} = 'Tim';
  
  # Save the changes back to the file
  $ob2->save();
  
  ---
  
  # Load xml and verify against XBS ( XML Bare Schema )
  my $xml_text = '<xml><item name=bob/></xml>''
  my $schema_text = '<xml><item* name=[a-z]+></item*></xml>'
  my $ob = new XML::Bare( text => $xml_text, schema => { text => $schema_text } );
  $ob->parse(); # this will error out if schema is invalid

DESCRIPTION ^

This module is a 'Bare' XML parser. It is implemented in C. The parser itself is a simple state engine that is less than 500 lines of C. The parser builds a C struct tree from input text. That C struct tree is converted to a Perl hash by a Perl function that makes basic calls back to the C to go through the nodes sequentially.

The parser itself will only cease parsing if it encounters tags that are not closed properly. All other inputs will parse, even invalid inputs. To allowing checking for validity, a schema checker is included in the module as well.

The schema format is custom and is meant to be as simple as possible. It is based loosely around the way multiplicity is handled in Perl regular expressions.

Supported XML

To demonstrate what sort of XML is supported, consider the following examples. Each of the PERL statements evaluates to true.

Schema Checking

Schema checking is done by providing the module with an XBS (XML::Bare Schema) to check the XML against. If the XML checks as valid against the schema, parsing will continue as normal. If the XML is invalid, the parse function will die, providing information about the failure.

The following information is provided in the error message:

XBS ( XML::Bare Schema ) Format

Parsed Hash Structure

The hash structure returned from XML parsing is created in a specific format. Besides as described above, the structure contains some additional nodes in order to preserve information that will allow that structure to be correctly converted back to XML.

Nodes may contain the following 3 additional subnodes:

Parsing Limitations / Features

Module Functions

Functions Used Internally

Controversy

Since the creation of this module there has been a fair amount of controvesy surrounding it. A number of authors of other XML parsers have gone so far as to publicly attack this module and claim that it 'does not parse XML', and 'it is not XML compliant'. Some of the same people seem to be angered by the inclusion of a benchmark, claiming that it is an unfair comparison, and that if the proper options and setup are used, that other XML parsers are better.

The module should parse any XML document that conforms to the standardized XML specifications, there is no need for alarm and fear that the module will corrupt your XML documents on reading.

To be blunt about how the parser works, very little has been done to make the parser follow the specification known as 'XML'. The parser is meant to be flexibile and somewhat resilient, and will parse XML like garbage that would cause other parsers to error out.

As far as I am concerned, as the author of the module, the 'XML' in 'XML::Bare' should be thought of to mean 'eXtremely Mad Language', because the module was written from scratch without referring to the specification known as 'XML'.

In regard to the complaints about the unfairness of the included benchmarks, please make your own intelligent decision as to what module you like by trying multiple modules and/or running the performance tests yourself. If you like some other module, use that module. If you like XML::Bare and think it is the fastest thing on the planet, that is cool too.

If you hate XML::Bare and want to go around on the internet trashing it and telling people to use something else, I think perhaps you may want to seek counseling.

Performance

In comparison to other available perl xml parsers that create trees, XML::Bare is extremely fast. In order to measure the performance of loading and parsing compared to the alternatives, a templated speed comparison mechanism has been created and included with XML::Bare.

The include makebench.pl file runs when you make the module and creates perl files within the bench directory corresponding to the .tmpl contained there.

Currently there are three types of modules that can be tested against, executable parsers ( exe.tmpl ), tree parsers ( tree.tmpl ), and parsers that do not generated trees ( notree.tmpl ).

A full list of modules currently tested against is as follows:

  EzXML (exe)
  Tiny XML (exe)
  XML::Descent (notree)
  XML::DOM
  XML::Fast
  XML::Grove::Builder
  XML::Handler::Trees
  XMLIO (exe)
  XML::LibXML (notree)
  XML::LibXML::Simple
  XML::Parser (notree)
  XML::Parser::EasyTree
  XML::Parser::Expat (notree)
  XML::SAX::Simple
  XML::Simple using XML::Parser
  XML::Simple using XML::SAX::PurePerl
  XML::Simple using XML::LibXML::SAX::Parser
  XML::Simple using XML::Bare::SAX::Parser
  XML::Smart
  XML::Twig
  XML::TreePP
  XML::Trivial
  XML::XPath::XMLParser

To run the comparisons, run the appropriate perl file within the bench directory. ( exe.pl, tree.pl, or notree.pl )

The script measures the milliseconds of loading and parsing, and compares the time against the time of XML::Bare. So a 7 means it takes 7 times as long as XML::Bare.

Here is a combined table of the script run against each alternative using the included test.xml:

  -Module-                   load     parse    total
  XML::Bare                  1        1        1
  XML::TreePP                2.3063   33.1776  6.1598
  XML::Parser::EasyTree      4.9405   25.7278  7.4571
  XML::Handler::Trees        7.2303   26.5688  9.6447
  XML::Trivial               5.0636   12.4715  7.3046
  XML::Smart                 6.8138   78.7939  15.8296
  XML::Simple (XML::Parser)  2.3346   50.4772  10.7455
  XML::Simple (PurePerl)     2.361    261.4571 33.6524
  XML::Simple (LibXML)       2.3187   163.7501 23.1816
  XML::Simple (XML::Bare)    2.3252   59.1254  10.9163
  XML::SAX::Simple           8.7792   170.7313 28.3634
  XML::Twig                  27.8266  56.4476  31.3594
  XML::Grove::Builder        7.1267   26.1672  9.4064
  XML::XPath::XMLParser      9.7783   35.5486  13.0002
  XML::LibXML (notree)       11.0038  4.5758   10.6881
  XML::Parser (notree)       4.4698   17.6448  5.8609
  XML::Parser::Expat(notree) 3.7681   50.0382  6.0069
  XML::Descent (notree)      6.0525   37.0265  11.0322
  Tiny XML (exe)                               1.0095
  EzXML (exe)                                  1.1284
  XMLIO (exe)                                  1.0165

Here is a combined table of the script run against each alternative using the included feed2.xml:

  -Module-                   load     parse    total
  XML::Bare                  1        1        1
  XML::Bare (simple)         1        0.7238   ?
  XML::Bare (unsafe simple)  1       ~0.5538   ?
  XML::Fast                  1.516    0.9733   1.4783
  XML::TreePP                0.6393   30.5951  2.6874
  XML::MyXML                 1.8266   14.2571  2.7113 
  XML::Parser::EasyTree      1.5208   22.8283  2.9748 
  XML::Trivial               2.007    25.742   3.615  
  XML::Tiny                  0.1665   61.4918  4.3234  
  XML::XPath::XMLParser      2.5762   33.2567  4.6742  
  XML::Smart                 1.702    59.4907  5.7566
  XML::Simple (XML::Parser)  0.5838   64.7243  5.0006  
  XML::DOM::Lite             4.5207   17.4617  5.4033
  XML::Simple (LibXML)       0.5904   161.7544 11.5731
  XML::Twig                  8.553    56.9034  11.8805 
  XML::Grove::Builder        7.2021   30.7926  12.9334
  XML::Handler::Trees        6.8545   33.1007  13.0575
  XML::LibXML::Simple        14.0204  11.8482  13.8707
  XML::Simple (PurePerl)     0.6176   321.3422 23.0465 
  XML::Simple                2.7168   90.7203  26.7525
  XML::SAX::Simple           8.7386   94.8276  29.2166
  XML::LibXML (notree)       11.0023  5.022    10.5214
  XML::Parser (notree)       4.3748   25.0213  5.9803
  XML::Parser::Expat(notree) 3.6555   51.6426  7.4316
  XML::Descent (notree)      5.9206   155.0289 18.7767
  Tiny XML (exe)                               1.2212
  EzXML (exe)                                  1.3618
  XMLIO (exe)                                  1.0145

These results show that XML::Bare is, at least on the test machine, running all tests within cygwin, faster at loading and parsing than everything being tested against.

The following things are shown as well: - XML::Bare can parse XML and create a hash tree in less time than it takes LibXML just to parse. - XML::Bare can parse XML and create a tree in less time than all three binary parsers take just to parse. - XML::Fast is theoretically faster at parsing than the default 'full' mode of XML::Bare. Despite that, the 'simple' mode of XML::Bare is even faster.

Note that the executable parsers are not perl modules and are timed using dummy programs that just uses the library to load and parse the example files. The executables are not included with this program. Any source modifications used to generate the shown test results can be found in the bench/src directory of the distribution

LICENSE ^

  Copyright (C) 2008 David Helkowski
  
  This program is free software; you can redistribute it and/or
  modify it under the terms of the GNU General Public License as
  published by the Free Software Foundation; either version 2 of the
  License, or (at your option) any later version.  You may also can
  redistribute it and/or modify it under the terms of the Perl
  Artistic License.
  
  This program is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  GNU General Public License for more details.
syntax highlighting: