Search Results for "regular expression"
Sort By:
Showing 7 open source projects for "regular expression"
View related business solutions-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
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 regular expression matching. As a result this allows a much broader range of use than any traditional lexer.
-
2
A Mac application (written in MacRuby) that will allow users to write in english a definition for a regular expression, which will then be converted into a ruby regular expression, which can also be used in other languages with minimal modification.
-
3
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
-
4
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.
-
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
RExASTor is a code generator for tree like structures. The user gives it a set of expressions that look a lot like regular expression but for trees and the tool generates Java data-structures for the described trees.
-
6
This program allows you to specify a Deterministic Finite Automata, Nondeterministic Finite Automata, or Generalized NFA and will return a regular expression which recognizes the same language as the FA you described.
-
7
- Previous
- You're on page 1
- Next