Skip to content

GitLab

Commit e93c1925 authored by Hiba Ouni's avatar Hiba Ouni
Browse files

parser

parent 2952aa66
Expand all Show whitespace changes
Inline Side-by-side
Net.cpp 0 → 100755
View file @ e93c1925
#include <string>
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <ext/hash_map>
#include <algorithm>
#include "Net.h"
#define TAILLEBUFF 500
/***********************************************************/
/* class Node */
/***********************************************************/
void Node::addPre(int node,int valuation){
pair<int,int> x(node,valuation);
pre.push_back(x);
}
void Node::addPost(int node,int valuation){
pair<int,int> x(node,valuation);
post.push_back(x);
}
void Node::addInhibitor(int node,int valuation){
pair<int,int> x(node,valuation);
inhibitor.push_back(x);
}
void Node::addPreAuto(int node,int valuation){
pair<int,int> x(node,valuation);
preAuto.push_back(x);
}
void Node::addPostAuto(int node,int valuation){
pair<int,int> x(node,valuation);
postAuto.push_back(x);
}
void Node::addReset(int node){
reset.push_back(node);
}
/***********************************************************/
/* class RdPE */
/***********************************************************/
net::net(const char *f,const char*Formula_trans, const char* Int_trans){
cout<<"CREATION D'UN NOUVEAU SOUS-RESEAU \n";
if(create(f)){
for (vector<class Place>::iterator p=places.begin();p!=places.end();p++){
sort(p->pre.begin(),p->pre.end());
sort(p->post.begin(),p->post.end());
}
for (vector<class Transition>::iterator p=transitions.begin();p!=transitions.end();p++){
sort(p->pre.begin(),p->pre.end());
sort(p->post.begin(),p->post.end());
}
}
else{
places.clear();
transitions.clear();
placeName.clear();
transitionName.clear();
}
if(strlen(Formula_trans)>0)
{
// cout<<"transitions de la formule non vide \n";
Set_Formula_Trans(Formula_trans);
if(strlen(Int_trans)>0)
{
Set_Interface_Trans(Int_trans);
//cout<<"transitions de l'interface non vide \n";
}
cout<<"______________66666666666666666666666______________________\n";
set_union(InterfaceTrans.begin(), InterfaceTrans.end(),Formula_Trans.begin(),Formula_Trans.end(), inserter(Observable, Observable.begin()));
Set_Non_Observables();
}
else
for(unsigned int i=0;i<transitions.size();i++)
Observable.insert(i);
cout<<"FIN CREATION \n";
}
/*---------------------------------Init Set of transitions ------------------------------*/
/*---------------------------------Set_formula_trans()------------------*/
bool net::Set_Formula_Trans(const char * f)
{
FILE *in;
int i,nb;
// cout<<"ici set formula transitions \n";
int pos_trans (TRANSITIONS, string);
char Buff[TAILLEBUFF], *z;
in = fopen(f,"r");
if (in == NULL)
{
cout << "file " << f << " doesn't exist" << endl;
exit(1);
}
int nb_formula_trans;
fscanf(in,"%d\n",&nb_formula_trans);
nb = fread(Buff,1,TAILLEBUFF-1,in);
Buff[nb] = '\0';
z = strtok(Buff, " \t\n");
cout<<"taille "<<TAILLEBUFF<<" buff "<<Buff<<" z: "<<z<<endl;
for(i= 0;i<nb_formula_trans;i++)
{
cout<<" z: "<<z<<endl;
if(z == NULL)
{
cout << "error in formula trans format "<< endl;
return false;
}
string tmp(z);
int pos=pos_trans(transitions,tmp);
if(pos==-1)
{
cout<<z<<" Error??? : observale transition "<<tmp<<" doesn't exist \n";
//return false;
}
else
Formula_Trans.insert(pos);
/*cout<<"insertion de :"<<transitions[pos].name<<endl;*/
z = strtok(NULL, " \t\n");
if (z == NULL)
{
nb = fread(Buff,1,TAILLEBUFF-1,in);
Buff[nb] = '\0';
z = strtok(Buff, " \t\n");
}
}
fclose(in);
return true;
}
/*---------------------------------Set_Interface_trans()------------------*/
bool net::Set_Interface_Trans(const char * f)
{
FILE *in;
int i,nb;
int pos_trans (TRANSITIONS, string);
char Buff[TAILLEBUFF],* z;
in = fopen(f,"r");
if (in == NULL)
{
cout << "file " << f << " doesn't exist" << endl;
exit(1);
}
int int_trans;
fscanf(in,"%d\n",&int_trans);
nb = fread(Buff,1,TAILLEBUFF-1,in);
Buff[nb] = '\0';
z = strtok(Buff, " \t\n");
cout<<"taille "<<TAILLEBUFF<<" buff "<<Buff<<" z: "<<z<<endl;
for(i= 0;i<int_trans;i++)
{
cout<<" z: "<<z<<endl;
if(z == NULL)
{
cout << "error in interface format "<< endl;
return false;
}
string tmp(z);
int pos=pos_trans(transitions,tmp);
//if(Formula_Trans.find(pos)==Formula_Trans.end())
if(pos==-1)
{
cout<<z<<" Error??? : interface transition doesn't exist \n";
// return false;
}
else
InterfaceTrans.insert(pos);
z = strtok(NULL, " \t\n");
if (z == NULL)
{
nb = fread(Buff,1,TAILLEBUFF-1,in);
Buff[nb] = '\0';
z = strtok(Buff, " \t\n");
}
}
fclose(in);
return true;
}
/*---------------------------------Set_Non_Observables()------------------*/
void net::Set_Non_Observables()
{
NonObservable.clear();
for(unsigned int i=0;i<transitions.size();i++)
if(Observable.find(i)==Observable.end())
{
NonObservable.insert(i);
}
}
/*-----------------------pos_trans()--------------------*/
int pos_trans(TRANSITIONS T, string trans)
{
int pos=0;
// cout<<"on cherche "<<trans<<" dans :\n";
for(TRANSITIONS::const_iterator i=T.begin();!(i==T.end());i++,pos++)
{
// cout<<i->name<<" ";
if(i->name==trans)
return pos;
}
//cout<<"Non trouve :\n";
return -1;
}
/* ------------------------------ operator<< -------------------------------- */
ostream& operator<<(ostream& os, const Set& s)
{
bool b = false;
if (s.size())
{
for (Set::const_iterator i=s.begin(); !(i==s.end()); i++)
{
if (b)
os << ", ";
else
os << "{";
os << *i<<" ";
b = true;
}
os << "}";
}
else
os << "empty set";
return os;
}
/*----------------------------------------------------------------------*/
bool net::addPlace(const string &place,int marking,int capacity){
map<string,int>::const_iterator pi=placeName.find(place);
if(pi==placeName.end()){
placeName[place]=places.size();
Place p(place,marking, capacity);
places.push_back(p);
return true;
}
else
return false;
}
bool net::addQueue(const string &place,int capacity){
map<string,int>::const_iterator pi=placeName.find(place);
if(pi==placeName.end()){
placeName[place]=places.size();
Place p(place,-1, capacity);
places.push_back(p);
return true;
}
else
return false;
}
bool net::addLossQueue(const string &place,int capacity){
map<string,int>::const_iterator pi=placeName.find(place);
if(pi==placeName.end()){
placeName[place]=places.size();
Place p(place,-2, capacity);
places.push_back(p);
return true;
}
else
return false;
}
bool net::addTrans(const string &trans){
map<string,int>::const_iterator ti=transitionName.find(trans);
if(ti==transitionName.end()){
transitionName[trans]=transitions.size();
Transition t(trans);
transitions.push_back(t);
return true;
}
else
return false;
}
bool net::addPre(const string &place,const string &trans,int valuation){
int p,t;
map<string,int>::const_iterator pi=placeName.find(place);
if(pi==placeName.end() || places[pi->second].isQueue())
return false;
else
p=pi->second;
map<string,int>::const_iterator ti=transitionName.find(trans);
if(ti==transitionName.end())
return false;
else
t=ti->second;
transitions[t].addPre(p,valuation);
places[p].addPost(t,valuation);
return true;
}
bool net::addPost(const string &place,const string &trans,int valuation){
int p,t;
map<string,int>::const_iterator pi=placeName.find(place);
if(pi==placeName.end() || places[pi->second].isQueue())
return false;
else
p=pi->second;
map<string,int>::const_iterator ti=transitionName.find(trans);
if(ti==transitionName.end())
return false;
else
t=ti->second;
transitions[t].addPost(p,valuation);
places[p].addPre(t,valuation);
return true;
}
bool net::addPreQueue(const string &place,const string &trans,int valuation){
int p,t;
map<string,int>::const_iterator pi=placeName.find(place);
if(pi==placeName.end() || !places[pi->second].isQueue())
return false;
else
p=pi->second;
map<string,int>::const_iterator ti=transitionName.find(trans);
if(ti==transitionName.end())
return false;
else
t=ti->second;
transitions[t].addPre(p,valuation);
places[p].addPost(t,valuation);
return true;
}
bool net::addPostQueue(const string &place,const string &trans,int valuation){
int p,t;
map<string,int>::const_iterator pi=placeName.find(place);
if(pi==placeName.end() || !places[pi->second].isQueue())
return false;
else
p=pi->second;
map<string,int>::const_iterator ti=transitionName.find(trans);
if(ti==transitionName.end())
return false;
else
t=ti->second;
transitions[t].addPost(p,valuation);
places[p].addPre(t,valuation);
return true;
}
bool net::addInhibitor(const string &place,const string &trans,int valuation){
int p,t;
map<string,int>::const_iterator pi=placeName.find(place);
if(pi==placeName.end())
return false;
else
p=pi->second;
map<string,int>::const_iterator ti=transitionName.find(trans);
if(ti==transitionName.end())
return false;
else
t=ti->second;
transitions[t].addInhibitor(p,valuation);
places[p].addInhibitor(t,valuation);
return true;
}
bool net::addPreAuto(const string &place,const string &trans,const string &valuation){
int p,t,v;
map<string,int>::const_iterator pi=placeName.find(place);
if(pi==placeName.end() || places[pi->second].isQueue())
return false;
else
p=pi->second;
map<string,int>::const_iterator ti=transitionName.find(trans);
if(ti==transitionName.end())
return false;
else
t=ti->second;
map<string,int>::const_iterator pv=placeName.find(valuation);
if(pv==placeName.end() || places[pv->second].isQueue())
return false;
else
v=pv->second;
transitions[t].addPreAuto(p,v);
places[p].addPostAuto(t,v);
return true;
}
bool net::addPostAuto(const string &place,const string &trans,const string &valuation){
int p,t,v;
map<string,int>::const_iterator pi=placeName.find(place);
if(pi==placeName.end() || places[pi->second].isQueue())
return false;
else
p=pi->second;
map<string,int>::const_iterator ti=transitionName.find(trans);
if(ti==transitionName.end())
return false;
else
t=ti->second;
map<string,int>::const_iterator pv=placeName.find(valuation);
if(pv==placeName.end() || places[pi->second].isQueue())
return false;
else
v=pv->second;
transitions[t].addPostAuto(p,v);
places[p].addPreAuto(t,v);
return true;
}
bool net::addReset(const string &place,const string &trans){
int p,t;
map<string,int>::const_iterator pi=placeName.find(place);
if(pi==placeName.end())
return false;
else
p=pi->second;
map<string,int>::const_iterator ti=transitionName.find(trans);
if(ti==transitionName.end())
return false;
else
t=ti->second;
transitions[t].addReset(p);
places[p].addReset(t);
return true;
}
/* Visualisation */
ostream& operator<<(ostream &os,const net &R){
/* affichage nombre de places et de transitions */
os<<"***************************"<<endl;
os<<"Nombre de places :"<<R.nbPlace()<<endl;
os<<"Nombre de transitions:"<<R.nbTransition()<<endl;
/* affichage de la liste des places */
os<<"********** places **********"<<endl;
int i=0;
for (vector<class Place>::const_iterator p=R.places.begin();p!=R.places.end();p++,i++){
if (p->isQueue()) {
os<<"queue " << setw(4)<<i<<":"<<p->name<<", cp("<<p->capacity<<")";
if (p->isLossQueue())
cout << " loss";
cout << endl;
}
else
os<<"place " << setw(4)<<i<<":"<<p->name<<":"<<p->marking<<" <..>, cp(" << p->capacity<<")"<<endl;
}
os<<"********** transitions de la formule **********"<<endl;
for(Set::const_iterator h=R.Formula_Trans.begin();!(h==R.Formula_Trans.end());h++)
cout<<R.transitions[*h].name<<endl;
os<<"********** transitions de l'interface **********"<<endl;
for(Set::const_iterator h=R.InterfaceTrans.begin();!(h==R.InterfaceTrans.end());h++)
cout<<R.transitions[*h].name<<endl;
os<<"Nombre de transitions observable:"<<R.Observable.size()<<endl;
os<<"********** transitions observables **********"<<endl;
for(Set::const_iterator h=R.Observable.begin();!(h==R.Observable.end());h++)
cout<<R.transitions[*h].name<<endl;
os<<"Nombre de transitions non observees:"<<R.NonObservable.size()<<endl;
os<<"********** transitions non observees **********"<<endl;
for(Set::const_iterator h=R.NonObservable.begin();!(h==R.NonObservable.end());h++)
cout<<R.transitions[*h].name<<endl;
i=0;
os<<"Nombre global de transitions :"<<R.nbTransition()<<endl;
os<<"********** transitions **********"<<endl;
for (TRANSITIONS::const_iterator t=R.transitions.begin();t!=R.transitions.end();t++,i++)
{
os<<setw(4)<<i<<":"<<t->name<<endl;
// os<<" IN { ";
//for (vector< pair<int,int> >::const_iterator a=p->pre.begin();a!=p->pre.end();a++)
// if (R.places[a->first].isQueue())
// os<<R.places[a->first].name<<":<"<<a->second<<">;";
// else
// os<<R.places[a->first].name<<":"<<a->second<<";";
// for (vector< pair<int,int> >::const_iterator a=p->inhibitor.begin();a!=p->inhibitor.end();a++)
//os<<R.places[a->first].name<<"<"<<a->second<<";";
//for (vector< pair<int,int> >::const_iterator a=p->preAuto.begin();a!=p->preAuto.end();a++)
//os<<R.places[a->first].name<<":"<<R.places[a->second].name<<";";
//for (vector<int>::const_iterator a=p->reset.begin();a!=p->reset.end();a++)
//os<<R.places[*a].name<<": reset;";
//os<<" }"<<endl;
//os<<" OUT { ";
//for (vector< pair<int,int> >::const_iterator a=p->post.begin();a!=p->post.end();a++)
// if (R.places[a->first].isQueue())
// os<<R.places[a->first].name<<":<"<<a->second<<">;";
// else
// os<<R.places[a->first].name<<":"<<a->second<<";";
//for (vector< pair<int,int> >::const_iterator a=p->postAuto.begin();a!=p->postAuto.end();a++)
//os<<R.places[a->first].name<<":"<<R.places[a->second].name<<";";
//os<<" }"<<endl;
}
return(os);
}
Net.h 0 → 100755
View file @ e93c1925
/* -*- C++ -*- */
#ifndef NET_H
#define NET_H
#include <string>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <ext/hash_map>
#include <cstring>
#include "RdPMonteur.h"
typedef set<int> Set;
class Node{
public:
Node(){};
~Node(){};
vector< pair<int,int> > pre, post, inhibitor, preAuto, postAuto;
vector<int> reset;
void addPre(int,int);
void addPost(int,int);
void addInhibitor(int,int);
void addPreAuto(int,int);
void addPostAuto(int,int);
void addReset(int);
};
class Place:public Node{
public:
string name;
int marking, capacity;
Place(const string &p,int m=0, int c=0):name(p),marking(m),capacity(c){};
~Place(){};
bool isLossQueue() const {return marking==-2;}
bool isQueue() const {return marking<=-1;}
bool hasCapacity() const {return capacity!=0;}
};
class Transition:public Node{
public:
string name;
Transition(const string &t):name(t){};
~Transition(){};
};
/*-----------------------------------------------------------------*/
struct ltstr
{
bool operator()(const char* s1, const char* s2) const
{
return std::strcmp(s1,s2)<0;
}
};
typedef set<const char*,ltstr> Set_mot;
typedef vector<Place> PLACES;
typedef vector<Transition> TRANSITIONS;
class net: public RdPMonteur {
private:
/*Initialisation des attributs*/
bool Set_Observables(const char* file) ;
bool Set_Interface_Trans(const char* file) ;
bool Set_Formula_Trans(const char* file) ;
bool Set_ObsNonObservables(Set_mot obs) ;
void Set_Non_Observables();
public:
/* Attributs */
vector<class Place> places;
vector<class Transition> transitions;
map<string,int> placeName;
map<string,int> transitionName;
Set Observable;
Set NonObservable;
Set InterfaceTrans;
Set Formula_Trans;
/* Constructors */
net(){};
~net(){};
net(const char *file,const char*Obs="", const char* Int="");
/* Monteur */
bool addPlace(const string &place,int marking=0, int capacity=0);
bool addQueue(const string &place,int capacity=0);
bool addLossQueue(const string &place,int capacity=0);
bool addTrans(const string &transition);
bool addPre(const string &place,const string &transition,int valuation=1);
bool addPost(const string &place,const string &transition,int valuation=1);
bool addPreQueue(const string &place,const string &transition,int valuation=1);
bool addPostQueue(const string &place,const string &transition,int valuation=1);
bool addInhibitor(const string &place,const string &transition,int valuation=1);
bool addPreAuto(const string &place,const string &transition,const string &valuation);
bool addPostAuto(const string &place,const string &transition,const string &valuation);
bool addReset(const string &place,const string &transition);
/* Visualisation */
int nbPlace() const {return places.size();};
int nbTransition() const {return transitions.size();};
};
ostream& operator<<(ostream &,const net &);
#endif
RdPMonteur.h 0 → 100755
View file @ e93c1925
/* -*- C++ -*- */
#ifndef RdPMONTEUR_H
#define RdPMONTEUR_H
#include <string>
#include <iostream>
using namespace std;
class RdPMonteur {
public:
RdPMonteur(){};
virtual ~RdPMonteur(){};
virtual bool addPlace(const string &place,int marking=0, int capacity=0) =0;
virtual bool addQueue(const string &place,int capacity=0) =0;
virtual bool addLossQueue(const string &place,int capacity=0) =0;
virtual bool addTrans(const string &transition) =0;
virtual bool addPre(const string &place,const string &transition,int valuation=1) =0;
virtual bool addPost(const string &place,const string &transition,int valuation=1) =0;
virtual bool addPreQueue(const string &place,const string &transition,int valuation=1) =0;
virtual bool addPostQueue(const string &place,const string &transition,int valuation=1) =0;
virtual bool addInhibitor(const string &place,const string &transition,int valuation=1) =0;
virtual bool addPreAuto(const string &place,const string &transition,const string &valuation) =0;
virtual bool addPostAuto(const string &place,const string &transition,const string &valuation) =0;
virtual bool addReset(const string &place,const string &transition) =0;
virtual bool create(const char *file);