mirror of
https://github.com/Z3Prover/z3
synced 2025-06-04 05:11:21 +00:00
overhaul of regular expression membership solving. Use iterative deepening and propagation, coallesce intersections
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
d61d9d4ce3
commit
6ddbc9cd38
5 changed files with 200 additions and 252 deletions
|
@ -146,6 +146,7 @@ class seq_decl_plugin : public decl_plugin {
|
|||
sort* m_string;
|
||||
sort* m_char;
|
||||
sort* m_re;
|
||||
bool m_has_re;
|
||||
|
||||
void match(psig& sig, unsigned dsz, sort* const* dom, sort* range, sort_ref& rng);
|
||||
|
||||
|
@ -197,6 +198,8 @@ public:
|
|||
app* mk_string(symbol const& s);
|
||||
app* mk_string(zstring const& s);
|
||||
|
||||
bool has_re() const { return m_has_re; }
|
||||
|
||||
};
|
||||
|
||||
class seq_util {
|
||||
|
@ -221,6 +224,8 @@ public:
|
|||
app* mk_skolem(symbol const& name, unsigned n, expr* const* args, sort* range);
|
||||
bool is_skolem(expr const* e) const { return is_app_of(e, m_fid, _OP_SEQ_SKOLEM); }
|
||||
|
||||
bool has_re() const { return seq.has_re(); }
|
||||
|
||||
class str {
|
||||
seq_util& u;
|
||||
ast_manager& m;
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue