By Topic

A Run-time Adaptive and Code-size Efficient XML Parser

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

This paper proposes a new method for designing and implementing a manual XML parser named BNFParser, which is based on the mechanism of XML document matching against a BNF tree that built on XML formal grammar represented by extended Backus-Naur form (EBNF) notation. Compared with generic XML parsers, e.g. top-down Xerces/LibXML parser and bottom-up YACC-assisted parser, BNFParser is designed to be used under the circumstance of storage limitation and memory restriction, e.g. embedded devices. Another advantage of BNFParser is more flexible to be tailored and upgraded through only updating plain text BNF syntax rules instead of reediting and recompiling source code. Furthermore, we investigate the architectures of the generic XML parsers, and present the performance evaluation. Experiment shows that applicable scenario of BNFParser is parsing an XML document with size less than 100 KB

Published in:

Computer Software and Applications Conference, 2006. COMPSAC '06. 30th Annual International  (Volume:2 )

Date of Conference:

17-21 Sept. 2006