Expand description
Regular expressions as defined in the SMT-LIB QF_S Theory The alphabet is the set of u32 between 0 and 0x2FFFF.
Functionsยง
- re_all
- Full language
- re_
allchar - All strings of length 1
- re_comp
- Complement
- re_
concat - Concatenation of two regular expressions
- re_
concat_ list - Concatenation of several regular expressions
- re_diff
- Difference of two regular expressions
- re_
diff_ list - Difference of several languages
- re_
inter - Intersection of two regular expressions
- re_
inter_ list - Intersection of several regular expressions
- re_loop
- Loop
- re_none
- Empty language
- re_opt
- Option
- re_plus
- Kleene cross
- re_
power - Power
- re_
range - Range
- re_star
- Kleene closure
- re_
union - Union of two regular expressions
- re_
union_ list - Union of several regular expressions
- str_
in_ re - Check whether a string is in a regular expression
- str_
replace_ re - Replace the first and shortest occurrence of r by s2 in s1
- str_
replace_ re_ all - Replace all non-empty matches of r by s2 in s1
- str_
to_ re - Singleton language