Search Results for "nfa dfa c#"
Sort By:
Showing 29 open source projects for "nfa dfa c#"
View related business solutions-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
1
RE2/J
linear time regular expression matching in Java
RE2/J is a high-performance regular expression engine implemented in pure Java as a port of Google’s C++ RE2 library. Unlike traditional regex engines such as Java’s java.util.regex, PCRE, or Perl’s implementation—which rely on backtracking and can suffer from catastrophic exponential runtimes—RE2/J guarantees linear-time matching relative to input size. It achieves this efficiency by simulating all possible matches in a single pass using a nondeterministic finite automaton (NFA), ensuring predictable and safe performance even with complex patterns. ... -
2
An LALR(1) and LALR(*) parser generator. Generates parsers up to 140 times the speed of ANTLR parsers, and 1/10th of the size or smaller. Contains the DFA lexer generator, 80% faster than flex lexers. Works with Visual Studio C++. Contains 27 grammars. Parsers build a symbol table. Parsers construct an abstract-syntax tree (AST). Parser are very fast and small. Reads ANTLR and YACC grammars, after making some changes. Accepts advanced EBNF grammar notation. Includes 4 sample projects. ...
-
3
DIANNA
software for DFA method
DIANNA (Diffraction Analysis of Nanopowders) is a free software developed to simulate atomic models of structures from an ensemble of nanoparticles and to calculate their whole X-ray powder diffraction patterns and the radial distribution function. The main objects of investigation are the particles whose coherent scattering domains do not exceed several nm. DIANNA is based on the ab initio method using the Debye scattering equation. This method makes it possible to obtain information on... -
4
Lexical Analyzer Generator Quex
Generator of lexical analyzers in C and C++. Unicode Supported.
The goal of this project is to provide a generator for lexical analyzers of maximum computational efficiency and maximum range of applications. This includes the support for Unicode (UTF8, UTF16, ...) and a large variety of other encodings directly and via nested converters such as ICU(tm) and IConv. Sophisticated buffer handling allows to operate on plain file streams, on sockets, or manually fed buffer content. 'Ready-to-build' examples explain related concepts and facilitate practical... -
MongoDB Atlas runs apps anywhereMongoDB 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.
-
5
raptor_waf
Raptor - Web application firewall [ Stable version ]
Web application firewall in C using DFA to block attacks. read Docs ! http://funguscodes.blogspot.com.br/2016/08/steps-to-create-your-wafweb-application.html -
6
RegexToNFA
Compiles regular expressions into modular NFA
This program compiles regular expressions (regexes) written in the modified ECMAScript regex grammar into modular nondeterministic finite automata suitable for hardware acceleration. This was originally an extended re-implementation of the "front-end" part in the following paper: https://www.computer.org/csdl/proceedings/reconfig/2008/3474/00/3474a073-abs.html It has since grown to include conversion of a set of NFAs to a DFA; compilation of NFAs to instruction suitable for... -
7
CodeConics
CodeConics is a C# lexer/parser/syntax tree generatior
CodeConics is simple, intuitive, easy to use and debug code-manipulation solution, that is grammar independent and recursion based, as opposed to other DFA(Deterministic Finite-state Automata) based solutions. -
8
AutoSim
A free automata simulator that simulates DFA/NFA/DPDA/NPDA/STM
AutoSim is a free automata simulator for students and educators. Written in Java, it is a command-line based utility that runs on any OS that supports Java. With AutoSim, you can not only determine the final state or stack/tape contents, you can also trace through the execution states as well, from the initial to the final states. The latest version of AutoSim is 1.0, and it currently supports DFAs, NFAs, DPDAs, NPDAs, as well as Standard Turing Machines. -
9
Finite-Automata
convert finite automata
This software can convert epsilon-NFA to NFA to DFA or NFA to DFA and minimization of DFA It works in the windows linux and mac. -
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
10
Sofia Regex
Java Regex API
This API provides an easy way of dealing with regular expressions. It provides DFA and NFA implementations, so if you need performance or group captures and analysis, both solutions are available. -
11
Tautomaton is a C++11 -template library for deterministic (DFA) and non-deterministic finite automata (NFA). It supports regular expressions and efficient input matching of multiple regexps simultaneously. The library comes with a somewhat grep-like command-line tool for showcasing these features.
-
12
visualFSA is a small tool which lets you construct NFAs/DFAs [(non)deterministic finite automata]. It offers some common algorithms which can be applied to that automatons, like converting NFA -> DFA, word problem, accepted language etc.
-
13
GUI application that can be used for generate graph representation for any given DFA or NFA table and check weather strings are accepted or rejected by finite automata.
-
14
Automata editor
automata editor
Automata editor is a vector editor for drawing finite automata according to VauCanSon-G format with tools for working with finite automata such as basic algorithms, exporting transition table to LaTeX format and automata work simulation. -
15
cmptNFA is a tool for automatic construction of compact non-deterministic finite automates from simple regular expression specification.We implemented tool using GNU Bison and Flex .
-
16
DFA library is a regular expression library capable of the classic RE syntax (i.e. - without any perl extension). Unlike many other libraries with similar functionality, a deterministic finite automata (DFA) is used. DFA was formerly called npcre, wh
-
17
SIP.NET is SIP stack .NET library written in C#. SIP message parser realized on Deterministic Finite-state Machine (DFA parse all SIP message for one pass). DFA generates automatically from Augmented Backus–Naur Form from RFC3261.
-
18
The files on this repository are out of date. Please visit http://github.com/justindthomas/flower_as for the current project.
-
19
RexRex is a Regexp matching engine based on Automata Theory Principles (so-called DFA Engine) Implemented in ANSI C . currently it supports (,),*,+,?,Character classes ([],w,s,..etc) and escaping FWIW Rex is king in Latin;so it's RexKing :)
-
20
Finite automation，developed by java and it's open source.input the RE,can produce RG,NFA,DFA,MinDFA,Draw the corresponding transition diagram and show the details of transition.
-
21
A lightweight toolkit for efficient processing of XML data. The tools are analagous to the UNIX command-line text processing tools sort, grep, etc. The infrastructure includes an efficient DFA-based engine for streaming evaluation of XPath expressions.
-
22
A C library, providing comfortable APIs for a wide range of Finite State Abstract Machines (NFA, DFA, FST, Bimachines, etc). Implements most of the classical algorithms in the field.
-
23
This is a set of simple utilities and scripts to collect, aggregate, summarize and analyze NetFlow traffic accounting data from modern routers by Cisco and Juniper.
-
24
KILAVUZ, DFA temelli Türkçe imla denetleyicisi ve düzenleyicisidir. KILAVUZ, is a DFA based spell checker. Its current version works for Turkish but if you have a DFA for another language, it can also work for you.
-
25
DFALib
A DFA capable Regular Expression Library
This project is a fork of RE2, hosted at http://code.google.com/p/re2/. Why a fork? The reason for the fork is to address a need for use cases which conflict with one of RE2's central missions, which is to be lightweight. DFAlib's API's will change to reflect the needs of use cases which require features that have been rejected at RE2. DFAlib retains the New BSD license of RE2 and credit the original authors of RE2 as forming the basis of this new project. The central innovation DFAlib...
