lower_regex.cpp

Go to the documentation of this file.

#include "thorin/plug/regex/pass/lower_regex.h"
 
#include <automaton/dfa.h>
#include <automaton/dfamin.h>
#include <automaton/nfa2dfa.h>
 
#include <thorin/def.h>
 
#include <thorin/plug/core/core.h>
#include <thorin/plug/direct/direct.h>
#include <thorin/plug/mem/mem.h>
 
#include "thorin/plug/regex/autogen.h"
#include "thorin/plug/regex/dfa2matcher.h"
#include "thorin/plug/regex/regex.h"
#include "thorin/plug/regex/regex2nfa.h"
 
namespace thorin::plug::regex {
 
namespace {
Ref wrap_in_cps2ds(Ref callee) { return direct::op_cps2ds_dep(callee); }
} // namespace
 
Ref LowerRegex::rewrite(Ref def) {
    const Def* new_app = def;
 
    if (auto app = def->isa<App>()) {
        auto callee = app->callee();
        if (match<regex::conj>(callee) || match<regex::disj>(callee) || match<regex::not_>(callee)
            || match<regex::range>(callee) || match<regex::any>(callee) || match<quant>(callee)) {
            const auto n = app->arg();
            auto nfa     = regex2nfa(callee);
            def->world().DLOG("nfa: {}", *nfa);
 
            auto dfa = automaton::nfa2dfa(*nfa);
            def->world().DLOG("dfa: {}", *dfa);
 
            auto min_dfa = automaton::minimize_dfa(*dfa);
            new_app      = wrap_in_cps2ds(dfa2matcher(def->world(), *min_dfa, n));
        }
    }
 
    return new_app;
}
 
} // namespace thorin::plug::regex