Automatic sustained-use discounts. One free VM per month. No negotiation needed.
Run batch jobs at 60-91% off with Spot VMs. Long-running workloads get automatic discounts with sustained use.
Start Free
Secure File Transfer for Windows with Cerberus by Redwood
Protect and share files over FTP/S, SFTP, HTTPS and SCP with the #1 rated Windows file transfer server.
Cerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
Re2c is a tool for writing very fast and very flexible scanners. Unlike any other such tool, re2c focuses on generating high efficient code for regularexpression matching. As a result this allows a much broader range of use than any traditional lexer.
A Mac application (written in MacRuby) that will allow users to write in english a definition for a regularexpression, which will then be converted into a ruby regularexpression, which can also be used in other languages with minimal modification.
PET is a C++ library that implements generic regular path expressions. It provides a set of classes and overloaded operators that allow the programmer to define regular path expressions over user-defined data structures using solely the GCC compiler
Provides a Java programmable only text file editor. No gui is available. It supplies most of the features you expect from an editor including selections.
Already Paying for an RMM? Get 50% Off Splashtop AEM
Switch to Splashtop AEM and save up to 50% in your first year
Automated OS and third-party patching for Windows and macOS, CVE prioritization with AI patch summaries, and built-in remote control that also supports Linux. Qualifying organizations switching from another RMM get up to 50% off year one.
RExASTor is a code generator for tree like structures. The user gives it a set of expressions that look a lot like regularexpression but for trees and the tool generates Java data-structures for the described trees.
This program allows you to specify a Deterministic Finite Automata, Nondeterministic Finite Automata, or Generalized NFA and will return a regularexpression which recognizes the same language as the FA you described.