mirror of
https://github.com/Jaxan/hybrid-ads.git
synced 2025-04-27 23:17:44 +02:00
65 lines
1.6 KiB
C++
65 lines
1.6 KiB
C++
#include "read_mealy_from_dot.hpp"
|
|
#include "mealy.hpp"
|
|
|
|
#include <fstream>
|
|
#include <sstream>
|
|
#include <string>
|
|
|
|
using namespace std;
|
|
|
|
template <typename T>
|
|
T get(istream& in){
|
|
T t;
|
|
in >> t;
|
|
return t;
|
|
}
|
|
|
|
mealy read_mealy_from_dot(istream& in){
|
|
mealy m;
|
|
|
|
string line;
|
|
stringstream ss;
|
|
while(getline(in, line)){
|
|
if(line.find("}") != string::npos) return m;
|
|
|
|
const auto i = line.find("->");
|
|
if(i == string::npos) continue;
|
|
|
|
// get from and to state
|
|
ss.str(line);
|
|
ss.seekg(0);
|
|
const auto lh = get<string>(ss);
|
|
const auto arrow = get<string>(ss);
|
|
const auto rh = get<string>(ss);
|
|
|
|
// get label
|
|
const auto l1 = line.find('\"');
|
|
const auto l2 = line.find('\"', l1+1);
|
|
if(l1 == string::npos || l2 == string::npos) continue;
|
|
ss.str(line.substr(l1+1, l2-(l1+1)));
|
|
ss.seekg(0);
|
|
|
|
const auto input = get<string>(ss);
|
|
const auto slash = get<string>(ss);
|
|
const auto output = get<string>(ss);
|
|
|
|
// make fresh indices, if needed
|
|
if(m.nodes_indices.count(lh) < 1) m.nodes_indices[lh] = m.graph_size++;
|
|
if(m.nodes_indices.count(rh) < 1) m.nodes_indices[rh] = m.graph_size++;
|
|
if(m.input_indices.count(input) < 1) m.input_indices[input] = m.input_size++;
|
|
if(m.output_indices.count(output) < 1) m.output_indices[output] = m.output_size++;
|
|
|
|
// add edge
|
|
m.graph.resize(m.graph_size);
|
|
auto & v = m.graph[m.nodes_indices[lh].base()];
|
|
v.resize(m.input_size);
|
|
v[m.input_indices[input].base()] = {m.nodes_indices[rh], m.output_indices[output]};
|
|
}
|
|
|
|
return m;
|
|
}
|
|
|
|
mealy read_mealy_from_dot(const string& filename){
|
|
ifstream file(filename);
|
|
return read_mealy_from_dot(file);
|
|
}
|