Expand description
This library provides a parser for POSIX Extended Regular Expressions (iregex).
Once parsed into an abstract syntax tree (Ast
), regular expressions can
then be compiled into a finite automaton running on Unicode scalar values
(char
type) using the iregex-automata
library.
Structs§
- Ast
- Abstract syntax tree of an Extended Regular Expression.
- Charset
- Classes
- Classes
Iter - Disjunction
- Regular expression sequence disjunction.
- Repeat
- Sequence
- Regular expression atom sequence.