Search Results for "regular expression"
Sort By:
Showing 5 open source projects for "regular expression"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
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
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
-
3
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.
-
4
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.
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
5
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.
- Previous
- You're on page 1
- Next
