regex_dfa
| Crates.io | regex_dfa |
| lib.rs | regex_dfa |
| version | 0.5.0 |
| source | src |
| created_at | 2015-08-16 19:32:33.198792 |
| updated_at | 2016-08-08 12:56:12.835454 |
| description | A crate for turning regexes into DFAs. |
| homepage | http://jneem.github.io/regex-dfa |
| repository | http://github.com/jneem/regex-dfa |
| max_upload_size | |
| id | 2855 |
| size | 247,506 |
(jneem)
documentation
http://jneem.github.io/regex-dfa
README
regex_dfa
A crate for compiling regular expressions down to deterministic finite automata.
Why?
Some regular expression implementations (e.g. rust's regex
library) are based on simulating
non-deterministic finite automata (NFAs). By turning NFAs into DFAs, we can
get a speed boost, at the cost of some compilation time and memory usage.
Preliminary benchmarks
show a substantial speed improvement over rust's default regex crate.
Limitations
- Turning an NFA into a DFA can take a lot of memory, especially when unicode character classes are involved.
- Subgroup captures are a bit tricky, and this crate does not handle them.
regex_dfacurrently only works on nightly rust.
License
regex_dfa is distributed under the MIT license and the Apache license (version 2.0).
See LICENSE-APACHE and LICENSE-MIT for details.