Source Code Scanners for C++ Builder 6
|
|
| Version
|
4.0 Std |
| Date Added
|
2004-7-14 |
| File Size
|
1,169 K |
| Limitation
|
Expiration Unknown |
| License
|
Shareware |
| Platform
|
Windows all versions |
| Price
|
40.00$ |
| Keywords
|
Source, Code, Scanners, high, performance, library, visual, components, C++, Builder, Delphi, intended, creating, analyzers, parsers, source, codes, includes, lexical, analyzers:, Object, Pascal, PHP, HTML, CSS1, preprocessor, but, contains, full, set, base, classes, provides, possibility, create, lexers, any, languages, These, may, used, build, applications, require, code, analyzing, tools, helps, calculators, expessions, designers, interpreters, compilers, etc, uses, DFAs, Deterministic, Finite, Automata, match, tokens, found, on, character, input, stream, are, defined, by, regular, expressions, created, at, runtime, More, than, automaton, class, tree, Actions, attached, executed, when, expression, has, been, matched, switch, TLexTree, maintains, converting, into, DFA, array, support, work, command-line, options, calculating, constant, available, Professional, edition, newfreeware |
| Homepage
|
Source Code Scanners for C++ Builder 6 Home page
|
| Screenshot
|
View Screenshot of Source Code Scanners for C++ Builder 6 |
| Description
|
Source Code Scanners is the high performance library of visual components for C++ Builder and Delphi intended for creating analyzers and parsers of source codes.<br />
It includes components of the lexical analyzers: C++, Object Pascal (Delphi), PHP, HTML, CSS1 and the C++ preprocessor, but also contains the full set of base classes, which provides a possibility to create lexers and parsers of any other languages.<br />
These components may be used to build applications, which require the source code analyzing (tools of helps creating; calculators of expessions; designers of source codes; interpreters and compilers and etc.).<br />
The lexical analyzers uses DFAs (Deterministic Finite Automata) to match tokens found on the character input stream. DFAs are defined by the set of regular expressions in a source code and are created at runtime. More than one automaton (lexical class, lexical tree) may be defined. Actions attached to regular expressions (which are executed when that expression has been matched on the input stream) may switch from one lexical class to another. The TLexTree class maintains converting a set of regular expressions into the DFA array.<br />
Source Code Scanners provides also classes, which support a work with command-line options, calculating of constant expressions and etc.<br />
The full source code of Source Code Scanners is available in Professional edition. |
Download Source Code Scanners for C++ Builder 6
|
Purchase Source Code Scanners for C++ Builder 6
|
|
|
Audio & MP3