Delphi32.com - Home!
| Home/News | Downloads | Forums | D32 Magazine | Resources | Info and Facts |  
 
 Components: Miscellaneous: Miscellaneous


Name: TParserALL 1.2 Date: 3/10/04 9:28:00 PM
Environment:
C++ Builder 4.0, C++ Builder 5.0, Delphi 4.0, Delphi 5.0, Delphi 6.0, Delphi 7.0
Download
Type: Freeware Size: 450Kb (all package)
Price: FREE
Source: $35 US
Online Registration: Link Not Available
Description:
Takes parsing one step further by a using a generic approach of a Backus Naur-Form grammar to parse anything you can think about. This component is ideal for data validation, data interpretation and also as a find/replace tool. Works on text and binary data. This non-visual component is designed especially for programmers that need parsing power without having to understand parsing theory or deal with code generators. It requires a Backus-Naur Form grammar to work. Since you can define a grammar for all situations, TParserAll can parse all you can imagine. The grammar is a TStrings object accessible at run-time and design-time through the BNF property. In design-time, the grammar is supported by a powerfull property editor with color syntax highlighting and real time grammar validation. Also allows the programmer to test the grammar and to debug it, in order to find out why a specific non-terminal did or did not recognized the data.


Additional Information: 
  • Total downloads between 3/15/04 and 11/22/08: 702
Author: Jose Rui Santos Home Page
  
Components: Miscellaneous: Miscellaneous <<  Browse  >> Freeware



 
 Hits/month  2,500,000+ 
 Downloads
 (Since May 2000)
 7,393,709 
 Total Files  6,023 
 Forum msgs  7,670 
 Articles/FAQs  70+/900+ 
Kylix
Tips n Tricks
FAQs
Knowledge Base
Bug Listings
Articles
Books
Newsgroups
Links
Submissions
Testimonials
Advertising
Contact Us
About Us
Search Amazon:
Top Selling Software at Amazon

| Home/News | Downloads | Forums | Resources | Info and Facts | Testimonials |
  Site Search:
 


Comments/Problems: Webmaster@delphi32.com
Copyright © 1998-2006, Delphi32.com. All rights reserved.
Terms of Use