GXPARSE comprises
- A generic XML push parser API that will reduce the cost of application development and maintenance for event-based parsers like the SAX parser
- A toolkit for implementing the API on event-based XML parsers.
- An implementation on the SAX parser.
- A pattern-matching scanner that can use regular expressions, and that can do recursive pattern matching, like the recognition of nested pairs of parentheses
- A toolkit for implementing the scanner
- An implementation that uses regular expression matching from the Java package java.util.regex

GXPARSE is not a new parser, it is an additional layer of processing to be used over an existing event-based parser like David Megginson's SAX parser. GXPARSE maintains most of the advantages (reliability, compliance to standards, etc.) of the event-based parser and adds the advantage of much lower cost for application development and maintenance. The one disadvantage of GXPARSE is a somewhat reduced processing speed, because the API adds another layer of processing between the application and the event-based XML parser, and because GXPARSE provides enhanced services that won't be needed in some applications.

GXPARSE includes an XML parser implementation based on the SAX parser, along with examples of use. XML examples include processing documents with ID and IDREF attributes very easily in a stream-oriented way.

GXPARSE also includes a powerful pattern-matching API. The reference implementation is based on java.util.regex but is powerful enough to build simple recursive-descent parsers. The examples include recognition of nested parentheses and a simple four-function calculator.