-
Updated
Jan 21, 2021 - Rust
#
nfa
Here are 146 public repositories matching this topic...
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
rust
automata
regex
regexp
nfa
automaton
regular-expressions
dfa
regex-engine
regex-syntax
regex-parser
DFA regular expression library & friends
automata
regexes
fsm
compiler
regex
regexp
lex
finite-state-machine
lexer
lexical-analysis
compilers
lexing
compiler-principles
lexer-generator
nfa
regex-validator
finite-state-automata
finite-state-machines
dfa
-
Updated
Feb 4, 2021 - C
The fast scanner generator for Java™ with full Unicode support
java
flex
parsing
cup
scanner
regexp
tokenizer
grammar
antlr
maven-plugin
bazel-rules
lexer
yacc
lexer-generator
nfa
dfa
lexical-analyzer
dfa-minimization
scanner-generator
lalr-grammar
-
Updated
Feb 4, 2021 - Java
A low level regular expression library that uses deterministic finite automata.
-
Updated
Jan 20, 2021 - Rust
Match tens of thousands of regular expressions within milliseconds - Java bindings for Intel's hyperscan 5
-
Updated
Feb 3, 2021 - Java
non-backtracking NFA-based regular expression library, for C and Python
parser
regexes
patterns
parsing
compiler
pattern-matching
regex
regexp
compilers
regex-pattern
nfa
hacktoberfest
parsers
compiler-design
-
Updated
Oct 4, 2020 - C
OCaml code to construct an NFA from a regular expression
-
Updated
Aug 5, 2020 - OCaml
An implementation of regular expressions for Python that uses a finite state automaton(正则引擎的Python实现,包括从NFA到DFA和DFA的最小化)
-
Updated
Sep 25, 2019 - Python
A Python package for automata theory.
automata
symbolic
nfa
automaton
dfa
automata-theory
dfa-minimization
deterministic-finite-automata
determinizer
dfa-construction
nfa2dfa
dfa-minimizer
nondeterministic-finite-automata
languages-and-automata
symbolic-automata
-
Updated
May 24, 2020 - Python
These are my programs for compiler design lab work in my sixth semester
python
regex
regular-expression
lexical-analysis
python-3
nfa
compiler-design
theory-of-computation
lexical-analyzer
left-recursion-elimination
eliminate-left-recursion
regular-expression-to-nfa
-
Updated
Jan 23, 2021 - Python
-
Updated
Jan 12, 2017 - Java
MadhavJivrajani
commented
Jul 13, 2020
It'd be great to have DFA implementations in more languages, a few of which could be as follows:
- Rust (taken)
- Scala
- Julia
- C
- Ruby
- Kotlin
- Java (taken)
If you would like to contribute in another language that is not mentioned in the above list, then please feel free to do so! Leave a comment mentioning the language you would like to contribute in!
states is a utility for working with NFA, DFA and regular expressions
-
Updated
Sep 16, 2014 - C++
根据正则表达式生成其对应 DFA 的状态转移图
-
Updated
Nov 20, 2018 - Python
Theory of machines and languages course project.
-
Updated
Aug 3, 2020 - Python
Business Rule Engine Hardware Accelerator
-
Updated
Jun 18, 2020 - VHDL
A program to convert the given regular expression to Non Definite Automata (NFA)
-
Updated
Feb 3, 2019 - C++
SEU CS Compiler Course Design: Python Implementation of LEX & YACC for Cminus
-
Updated
Dec 5, 2017 - Python
A Web Application to convert NFA to DFA.
-
Updated
Oct 7, 2020 - JavaScript
Biçimsel Diller ve Otomata dersi dönem projesi.
-
Updated
Sep 17, 2020 - C#
Convert NFA to DFA (json output) from (json input, .nfa file)
-
Updated
Feb 16, 2016 - JavaScript
The Python script uses to convert the E-NFA to DFA and show the result in the web browser
-
Updated
Jan 18, 2018 - Python
regular language tools - automata-based tokenizer, LL(1) parser
-
Updated
Dec 17, 2016 - Python
Improve this page
Add a description, image, and links to the nfa topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the nfa topic, visit your repo's landing page and select "manage topics."
Would it be possible to have the regex parser support character classes like
\wwithin other character classes? I had a regex pattern earlier that used the character class[0-9a-zA-Z_\.-], and I attempted to simplify it with[\w\.\-]. I didn't notice this library doesn't support doing that, and was wondering just how difficult that would be to implement. For the time being i'm just expanding