Awesome Open Source
Search
Programming Languages
Languages
All Categories
Categories
About
Search results for regular expression automaton
automaton
x
regular-expression
x
21 search results found
Regex
⭐
3,250
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
Regex2fat
⭐
978
Turn your favourite regex into FAT32
Lexmachine
⭐
370
Lex machinary for go.
Regex Automata
⭐
349
A low level regular expression library that uses deterministic finite automata.
Automata.js
⭐
215
A regular expression converter
Noam
⭐
194
JavaScript library for working with automata and grammars for regular and context-free languages
Dk.brics.automaton
⭐
193
dk.brics.automaton - finite-state automata and regular expressions for Java
Wayeb
⭐
145
Wayeb is a Complex Event Processing and Forecasting (CEP/F) engine written in Scala.
Fare
⭐
144
Port of Java dk.brics.automaton and xeger, mostly used for generating strings that match a specific regular expression.
Notes
⭐
137
let me know if my notes help you :D (it's a mess, I know)
Automata From Regex
⭐
71
A python program to build nfa, dfa and minimised DFA from given regular expression. Uses Tkinter for GUI and GraphViz for graphs.
Multiregexp
⭐
60
Java library to check for multiple regexp with a single deterministic automaton. Just a wrapper around dk.brics.automaton really.
Re2rnn
⭐
57
Source code for the EMNLP 2020 paper "Cold-Start and Interpretability: Turning Regular Expressions intoTrainable Recurrent Neural Networks"
Solregex
⭐
51
Regex compilation to Solidity
Redone
⭐
46
A *correct* implementation of regular expression matching (using finite state automata).
Dregex
⭐
41
dregex is a Java library that implements a regular expression engine using deterministic finite automata (DFA). It supports some Perl-style features and yet retains linear matching time, and also offers set operations.
Fauton
⭐
37
An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
Reglang
⭐
37
Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]
Pyformlang
⭐
30
A python library to manipulate formal languages
Regex
⭐
30
An implementation of regular expressions for Python that uses a finite state automaton(正则引擎的Python实现,包括从NFA到DFA和DFA的最小化)
Regex Dfa
⭐
29
Proof of concept for fast regexes in rust
Formaltheory
⭐
28
Regular Expression (Regex), Nondeterministic finite automaton (NFA) and Deterministic finite automaton (DFA) implement in PHP.
Byteseek
⭐
26
A Java library for byte pattern matching and searching
Gorp
⭐
24
Library for building efficient regular-expression based extractors by combining multiple REs into single automaton
Re2.net
⭐
20
A .NET wrapper for Google's RE2 regular expression library
Reviz
⭐
19
Visualize NFA and DFA constructed from regular exrepssion
Refa
⭐
16
A library for finite automata and regular expressions in the context of JS RegExp
Automaton
⭐
16
Rust library for parsing regular languages
Aerie
⭐
13
Aerie: a regex-like engine nested word grammars
Regex Type
⭐
13
Regular expression matching of Haskell types
Libfa
⭐
10
C automata library to build, determinize, minimize, translate regexp etc
Duzzt
⭐
9
Duzzt - Annotation-based Embedded DSL Generator for Java
Rexlex
⭐
9
Regular Expressions and Lexing with DFAs
Regular
⭐
8
Finite Automata and Regular Expressions for Regular Languages in Haskell
Halex
⭐
8
Simone
⭐
7
Grammars, automata and regular expressions editor
States
⭐
7
states is a utility for working with NFA, DFA and regular expressions
Monaa
⭐
7
A Tool for Timed Patten Matching with Automata-Based Acceleration
Autorex
⭐
7
A dk.brics FSM to regular-expression-string converter
Re Dfa Pm
⭐
7
Perl module re::DFA
Div Regex
⭐
6
Computing regular expressions to test divisibility
Finite Automata
⭐
6
CMP3004 - Formal Languages and Automata Theory Course Project
Regexp
⭐
5
Finite automatons and grep-like tools
Regextodfaconverter
⭐
5
C++ application that converts regular expressions into Deterministic Finite Automata.
Regex Engine 2
⭐
5
A regex engine based on formal automata parsing techniques.
Regexmap
⭐
5
A Map containing Regular Expressions as keys.
Libreg
⭐
5
Regular expressions library implemented as non-deterministic finite-state automata.
Regex To Dfa
⭐
5
Implementation of algorithm to convert Regular Expression directly to a DFA.
At Regexp Machine
⭐
5
Automata Theory. Building a RegExp machine
Reggie The Regex Parser
⭐
5
A attempt to learn C and Automata Theory at the same time. Reggie is an attempt to create an executable NFA structure, in hopes that it can be used to power a regular expression evaluator.
Related Searches
Javascript Regular Expression (2,399)
Python Regular Expression (889)
Java Regular Expression (530)
Automaton Cellular Automata (378)
Python Automaton (354)
Javascript Automaton (260)
C Plus Plus Automaton (214)
Java Automaton (207)
Rust Regular Expression (180)
Golang Regular Expression (137)
1-21 of 21 search results
Privacy
|
About
|
Terms
|
Follow Us On Twitter
Copyright 2018-2024 Awesome Open Source. All rights reserved.