Syntax » Page 2 » Custom Developer Tools and VCL Components | Developer Team

JP Software CMDebug v34.00.16

JP Software CMDebug v34.00.16
JP Software CMDebug v34.00.16


CMDebug is a stand-alone version of the Take Command IDE and batch debugger. CMDebug is intended to help developers create a batch file to run in CMD (the Windows default command processor) or TCC-RT (the free runtime version of TCC). It provides a comprehensive set of batch debugging features specifically designed for batch file development.
Read more

RegexMagic 2.13.1 Retail

RegexMagic 2.13.1 Retail
RegexMagic 2.13.1 Retail


RegexMagic makes creating regular expressions easier than ever. While other regex tools such as RegexBuddy merely make it easier to work with regular expressions, with RegexMagic you don’t have to deal with the regular expression syntax at all. RegexMagic generates complete regular expressions to your specifications.
Read more

Markdown Monster v3.3.3

Markdown Monster v3.3.3
Markdown Monster v3.3.3


Markdown Monster is a Markdown editor and viewer that lets you edit Markdown with syntax highlighting and fast text entry. A collapsible, synced, live preview lets you see your output as you type or scroll. Easily embed images, links, emojis and code using Markdown text or use our gentle UI helpers that simplify many operations with a couple of keystrokes. Paste images from the clipboard or drag and drop from Explorer or our built-in folder browser. Inline spell-checking and word counts keep your content streamlined unobtrusively.
Read more

YuPcre2 1.22.0 for Delphi 11-12 Athens + Crack

YuPcre2 1.22.0 for Delphi 11-12 Athens + Crack
YuPcre2 1.22.0 for Delphi 11-12 Athens + Crack


YuPcre2 is a library of Delphi components and procedures that implement regular expression pattern matching using the same syntax and semantics as Perl, with just a few differences. There are two matching algorithms, the standard Perl and alternative DFA algorithm:

The Perl algorithm is what you are used to from Perl and j@vascript. It is fast and supports the complete pattern syntax. You will likely be using it most of the time.
DFA is a special purpose algorithm. If finds all possible matches and, in particular, it finds the longest. It never backtracks and supports partial matching better, in particular multi-segment matching of very long subject strings.
Read more