This software offers a library of visual components for analyzing and parsing source codes in C++ Builder and Delphi. It includes lexical analyzer components for C++, Object Pascal, PHP, HTML, CSS1, and C++ preprocessors.
If you are looking for a high-performance library of visual components to create analyzers and parsers of source codes, then look no further than Source Code Scanners. This tool is designed specifically for use with C++ Builder and Delphi and includes components of lexical analyzers such as C++, Object Pascal (Delphi), PHP, HTML, CSS1, and the C++ preprocessor. Furthermore, it contains a complete set of base classes that can be used to create lexers and parsers of any other languages as well.
With Source Code Scanners, you can create applications that require source code analysis, including tools for creating, calculators of expressions, source code designers, interpreters, compilers, and more. The lexical analyzers use 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.
Moreover, more than one automaton (lexical class, lexical tree) may be defined, and actions attached to regular expressions may switch from one lexical class to another. The TLexTree class maintains converting a set of regular expressions into the DFA array. Additionally, Source Code Scanners provides classes that support a work with command-line options, calculating constant expressions, and more.
The Professional edition of Source Code Scanners even provides the full source code so you can customize it to your needs. Overall, this software is an excellent tool for anyone who needs to work with source code and wants a reliable and efficient solution.
With Source Code Scanners, you can create applications that require source code analysis, including tools for creating, calculators of expressions, source code designers, interpreters, compilers, and more. The lexical analyzers use 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.
Moreover, more than one automaton (lexical class, lexical tree) may be defined, and actions attached to regular expressions may switch from one lexical class to another. The TLexTree class maintains converting a set of regular expressions into the DFA array. Additionally, Source Code Scanners provides classes that support a work with command-line options, calculating constant expressions, and more.
The Professional edition of Source Code Scanners even provides the full source code so you can customize it to your needs. Overall, this software is an excellent tool for anyone who needs to work with source code and wants a reliable and efficient solution.
What's New
Version 4.0 Std: N/A