Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
Start Free
AI-powered service management for IT and enterprise teams
Enterprise-grade ITSM, for every business
Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
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.
Stop Cyber Threats with VM-Series Next-Gen Firewall on Azure
Native application identity and user-based security for your Azure cloud
Gain integrated visibility across all traffic in a single pass. Deploy Palo Alto Networks VM-Series to determine application identity and content while automating security policy updates via rich APIs.
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.