// A_DFA: ¿el DFA B acepta la cadena w? Uso: a_dfa B.dfa CADENA...
// Decidir es simular: |w| pasos y una respuesta. La cadena vacía se pasa como ''.
#include <cstddef>
#include <iostream>
#include <stdexcept>
#include <string>
#include <vector>

#include "decide.h"
#include "dfa.h"

int main(int argc, char** argv) {
    if (argc < 3) {
        std::cerr << "uso: a_dfa B.dfa CADENA...\n";
        return 2;
    }
    try {
        Dfa b = load_dfa(argv[1]);
        std::cout << "B = " << argv[1] << ", " << b.states.size() << " estados\n";
        for (int i = 2; i < argc; i++) {
            std::string w = argv[i];
            std::vector<std::string> sequence = run(b, w);
            std::cout << "w = " << show(w) << "\n  " << sequence[0];
            for (std::size_t k = 0; k < w.size(); k++) {
                std::cout << " -" << w[k] << "-> " << sequence[k + 1];
            }
            bool ok = b.accept.count(sequence.back()) > 0;
            std::cout << "\n  " << w.size() << " pasos; termina en " << sequence.back()
                      << (ok ? ", que está en F: ⟨B, w⟩ ∈ A_DFA" : ", que no está en F: ⟨B, w⟩ ∉ A_DFA") << '\n';
        }
    } catch (const std::runtime_error& error) {
        std::cerr << "error: " << error.what() << '\n';
        return 1;
    }
}
