On This Page

• Features & Benefits
• New Features
• Technology
• System Requirements
• Pricing
• Order

Additional Info

• ClearParse Alert
  Mailing List
• Frequently Asked
  Questions
• License Agreement
• Return Policy

Download

• Demos
• Documentation
• Grammars
• Updates

ClearParseTM Standard & Professional

Put the power of a true parsing system into your applications without having to understand parsing theory or deal with code generators.

ClearParse makes your product robust by using proven parsing techniques and providing error recovery capability. It's a flexible parser engine that can be used for any parsing task including interpreting or compiling programming languages, analyzing or converting data files, processing command line parameters and user input, implementing markup languages and scripts, natural language processing (NLP), and more. Weighing in at about 70 KB (only 35 KB with the new Nucleus parser engine), there's no reason not to take advantage of ClearParse's streamlined code to enable your application to do more faster and with less overhead.

ClearParse Standard includes the ClearParse Standard and Nucleus parser engines, ActiveX parser component, C/C++ header files, sample programs, and documentation. It's everything you need to put ClearParse to work for you. If you also need the source code for the parser engine, ClearParse Professional is for you. With the Professional version, you'll have access to the full ClearParse parser engine source code for debugging, recompiling and even incorporating directly into your project.

Features and benefits

• Dynamic grammar handling
  Saves development time and makes your product more flexible because there's no need to rebuild your application or recompile generated parser code whenever your grammar or parsing task changes. The engine doesn't have to change; you just load a new grammar. Grammars can also be dynamically linked, downloaded from the Internet at run time, or completely created on the fly at run time.
• Modular grammars
  Faster grammar development by reusing grammar code and combining existing grammars.
• Descriptive grammar specification language
  No need to understand and decipher cryptic grammar definition notation. Unlike mathematical notations, the Grammar Definition Markup Language (GDML) uses descriptive tags similar to HTML/XML that are easy to remember, understand, and read.
• Intelligent error recovery
  Have full control over the processing of files and easily design grammars that recover from error situations.
• Parse many sources simultaneously
  Take advantage of multi-tasking for large parsing tasks that involve many files.
• Source code available (ClearParse Professional)
  Reduce debugging time by viewing and tracing through the actual source of the engine. Embed ClearParse Professional into your code base or port it to other platforms.
• Platform-independent implementation
  Although the ClearParse parser is compiled for a particular platform, it's written so that it can be easily ported to other platforms to fit your needs.

New features

• Nucleus parser engine
  Add parsing capability to embedded devices and other memory-constrained applications. The Nucleus parser engine (a 35 KB DLL) is the smallest ClearParse engine ever!
• Grammar compiler
  Create pre-compiled binary grammar files that are smaller and faster to load than text-based grammar files.
• Binary grammar support
  Load pre-compiled binary grammar files using the Standard parser engine, Nucleus parser engine, or ActiveX parser component.
• ActiveX parser component
  Use ClearParse in Visual Basic or any other development environment that supports ActiveX interfaces.
• Grammar enhancements
  Sequence tag, count attribute: Specify the maximum number of matches required to complete a sequence. (e.g. count=1-3 for a sequence of one to three occurences)
  
  Character tag, type attribute: Define a range of characters to be matched (e.g. type=0-Z includes all digits and uppercase characters)
  
  Reference tag, lookahead attribute: The referenced symbol will be matched without moving the input pointer. This feature is particularly useful for error recovery to match errors without interrupting the normal parsing operation.

Technology

ClearParse is an efficient, general-purpose, top-down parsing engine with practically unlimited backtracking capability. Since ClearParse is an engine rather than a code generator, you simply load your grammar into it and make calls to the engine from your application to produce a parsing tree for the source material.

Unlike many other parsers, ClearParse doesn't require that its grammar be LL(1) compliant and you don't have to make left-factoring adjustments. However, because it is a top-down parser, ClearParse doesn't support left recursions. Instead, ClearParse can find and warn you of both immediate and hidden left recursions in your grammar so that they can be easily rectified.

With the ClearParse engine you can also process multiple sources simultaneously, monitor, control and debug the parser's progress with callback functions, define your own error recovery rules directly in the grammar, and much more.

System requirements

• Windows 95, 98, NT 4, 2000, XP or higher
• ANSI-compliant C/C++ or any other programming language that can call standard Windows DLL functions
• To use the project files included with the sample applications, Visual C++ 5 or higher

Pricing

ClearParse redistributables have no distribution royalty fees. All prices are in US Dollars. Prices do not include taxes and/or shipping where applicable.

Note: One license per development system is required. For example, if two PCs will have the ClearParse SDK installed, you must purchase two licenses (i.e. two copies of ClearParse). For volume pricing and site licenses, contact sales.