You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
202 lines
10 KiB
202 lines
10 KiB
#include "src/parser/PrctlParser.h"
|
|
#include "src/utility/OsDetection.h"
|
|
#include "src/utility/ConstTemplates.h"
|
|
|
|
// If the parser fails due to ill-formed data, this exception is thrown.
|
|
#include "src/exceptions/WrongFormatException.h"
|
|
|
|
// Used for Boost spirit.
|
|
#include <boost/typeof/typeof.hpp>
|
|
#include <boost/spirit/include/qi.hpp>
|
|
#include <boost/spirit/include/phoenix.hpp>
|
|
|
|
// Include headers for spirit iterators. Needed for diagnostics and input stream iteration.
|
|
#include <boost/spirit/include/classic_position_iterator.hpp>
|
|
#include <boost/spirit/include/support_multi_pass.hpp>
|
|
|
|
// Needed for file IO.
|
|
#include <fstream>
|
|
#include <iomanip>
|
|
|
|
|
|
// Some typedefs and namespace definitions to reduce code size.
|
|
typedef std::string::const_iterator BaseIteratorType;
|
|
typedef boost::spirit::classic::position_iterator2<BaseIteratorType> PositionIteratorType;
|
|
namespace qi = boost::spirit::qi;
|
|
namespace phoenix = boost::phoenix;
|
|
|
|
|
|
|
|
namespace storm {
|
|
|
|
namespace parser {
|
|
|
|
template<typename Iterator, typename Skipper>
|
|
struct PrctlParser::PrctlGrammar : qi::grammar<Iterator, storm::formula::AbstractFormula<double>*(), Skipper> {
|
|
PrctlGrammar() : PrctlGrammar::base_type(start) {
|
|
freeIdentifierName = qi::lexeme[+(qi::alpha | qi::char_('_'))];
|
|
|
|
//This block defines rules for parsing state formulas
|
|
stateFormula %= orFormula;
|
|
stateFormula.name("state formula");
|
|
andFormula = notFormula[qi::_val = qi::_1] > *(qi::lit("&") > notFormula)[qi::_val =
|
|
phoenix::new_<storm::formula::And<double>>(qi::_val, qi::_1)];
|
|
andFormula.name("state formula");
|
|
orFormula = andFormula[qi::_val = qi::_1] > *(qi::lit("|") > andFormula)[qi::_val =
|
|
phoenix::new_<storm::formula::Or<double>>(qi::_val, qi::_1)];
|
|
orFormula.name("state formula");
|
|
notFormula = atomicStateFormula[qi::_val = qi::_1] | (qi::lit("!") > atomicStateFormula)[qi::_val =
|
|
phoenix::new_<storm::formula::Not<double>>(qi::_1)];
|
|
notFormula.name("state formula");
|
|
|
|
//This block defines rules for atomic state formulas
|
|
//(Propositions, probabilistic/reward formulas, and state formulas in brackets)
|
|
atomicStateFormula %= probabilisticBoundOperator | rewardBoundOperator | atomicProposition | qi::lit("(") >> stateFormula >> qi::lit(")");
|
|
atomicStateFormula.name("state formula");
|
|
atomicProposition = (freeIdentifierName)[qi::_val =
|
|
phoenix::new_<storm::formula::Ap<double>>(qi::_1)];
|
|
atomicProposition.name("state formula");
|
|
probabilisticBoundOperator = (
|
|
(qi::lit("P") >> qi::lit(">") >> qi::double_ > qi::lit("[") > pathFormula > qi::lit("]"))[qi::_val =
|
|
phoenix::new_<storm::formula::ProbabilisticBoundOperator<double> >(storm::formula::BoundOperator<double>::GREATER, qi::_1, qi::_2)] |
|
|
(qi::lit("P") >> qi::lit(">=") > qi::double_ > qi::lit("[") > pathFormula > qi::lit("]"))[qi::_val =
|
|
phoenix::new_<storm::formula::ProbabilisticBoundOperator<double> >(storm::formula::BoundOperator<double>::GREATER_EQUAL, qi::_1, qi::_2)] |
|
|
(qi::lit("P") >> qi::lit("<") >> qi::double_ > qi::lit("[") > pathFormula > qi::lit("]"))[qi::_val =
|
|
phoenix::new_<storm::formula::ProbabilisticBoundOperator<double> >(storm::formula::BoundOperator<double>::LESS, qi::_1, qi::_2)] |
|
|
(qi::lit("P") >> qi::lit("<=") > qi::double_ > qi::lit("[") > pathFormula > qi::lit("]"))[qi::_val =
|
|
phoenix::new_<storm::formula::ProbabilisticBoundOperator<double> >(storm::formula::BoundOperator<double>::LESS_EQUAL, qi::_1, qi::_2)]
|
|
);
|
|
probabilisticBoundOperator.name("state formula");
|
|
rewardBoundOperator = (
|
|
(qi::lit("R") >> qi::lit(">") >> qi::double_ >> qi::lit("[") >> pathFormula >> qi::lit("]"))[qi::_val =
|
|
phoenix::new_<storm::formula::RewardBoundOperator<double> >(storm::formula::BoundOperator<double>::GREATER, qi::_1, qi::_2)] |
|
|
(qi::lit("R") >> qi::lit(">=") >> qi::double_ >> qi::lit("[") >> pathFormula >> qi::lit("]"))[qi::_val =
|
|
phoenix::new_<storm::formula::RewardBoundOperator<double> >(storm::formula::BoundOperator<double>::GREATER_EQUAL, qi::_1, qi::_2)] |
|
|
(qi::lit("R") >> qi::lit("<") >> qi::double_ >> qi::lit("[") >> pathFormula >> qi::lit("]"))[qi::_val =
|
|
phoenix::new_<storm::formula::RewardBoundOperator<double> >(storm::formula::BoundOperator<double>::LESS, qi::_1, qi::_2)] |
|
|
(qi::lit("R") >> qi::lit("<=")>> qi::double_ >> qi::lit("[") >> pathFormula >> qi::lit("]"))[qi::_val =
|
|
phoenix::new_<storm::formula::RewardBoundOperator<double> >(storm::formula::BoundOperator<double>::LESS_EQUAL, qi::_1, qi::_2)]
|
|
);
|
|
rewardBoundOperator.name("state formula");
|
|
|
|
//This block defines rules for parsing formulas with noBoundOperators
|
|
noBoundOperator = (probabilisticNoBoundOperator | rewardNoBoundOperator);
|
|
noBoundOperator.name("no bound operator");
|
|
probabilisticNoBoundOperator = (qi::lit("P") >> qi::lit("=") >> qi::lit("?") >> qi::lit("[") >> pathFormula >> qi::lit("]"))[qi::_val =
|
|
phoenix::new_<storm::formula::ProbabilisticNoBoundOperator<double> >(qi::_1)];
|
|
probabilisticNoBoundOperator.name("no bound operator");
|
|
rewardNoBoundOperator = (qi::lit("R") >> qi::lit("=") >> qi::lit("?") >> qi::lit("[") >> pathFormula >> qi::lit("]"))[qi::_val =
|
|
phoenix::new_<storm::formula::RewardNoBoundOperator<double> >(qi::_1)];
|
|
rewardNoBoundOperator.name("no bound operator");
|
|
|
|
//This block defines rules for parsing path formulas
|
|
pathFormula = (boundedEventually | eventually | globally | boundedUntil | until);
|
|
pathFormula.name("path formula");
|
|
boundedEventually = (qi::lit("F") >> qi::lit("<=") > qi::int_ > stateFormula)[qi::_val =
|
|
phoenix::new_<storm::formula::BoundedEventually<double>>(qi::_2, qi::_1)];
|
|
boundedEventually.name("path formula");
|
|
eventually = (qi::lit("F") > stateFormula)[qi::_val =
|
|
phoenix::new_<storm::formula::Eventually<double> >(qi::_1)];
|
|
eventually.name("path formula");
|
|
globally = (qi::lit("G") > stateFormula)[qi::_val =
|
|
phoenix::new_<storm::formula::Globally<double> >(qi::_1)];
|
|
globally.name("path formula");
|
|
boundedUntil = (stateFormula >> qi::lit("U") >> qi::lit("<=") > qi::int_ > stateFormula)[qi::_val =
|
|
phoenix::new_<storm::formula::BoundedUntil<double>>(qi::_1, qi::_3, qi::_2)];
|
|
boundedUntil.name("path formula");
|
|
until = (stateFormula >> qi::lit("U") > stateFormula)[qi::_val =
|
|
phoenix::new_<storm::formula::Until<double>>(qi::_1, qi::_2)];
|
|
until.name("path formula");
|
|
|
|
start = (noBoundOperator | stateFormula);
|
|
start.name("PRCTL formula");
|
|
}
|
|
|
|
qi::rule<Iterator, storm::formula::AbstractFormula<double>*(), Skipper> start;
|
|
|
|
qi::rule<Iterator, storm::formula::AbstractStateFormula<double>*(), Skipper> stateFormula;
|
|
qi::rule<Iterator, storm::formula::AbstractStateFormula<double>*(), Skipper> atomicStateFormula;
|
|
|
|
qi::rule<Iterator, storm::formula::AbstractStateFormula<double>*(), Skipper> andFormula;
|
|
qi::rule<Iterator, storm::formula::AbstractStateFormula<double>*(), Skipper> atomicProposition;
|
|
qi::rule<Iterator, storm::formula::AbstractStateFormula<double>*(), Skipper> orFormula;
|
|
qi::rule<Iterator, storm::formula::AbstractStateFormula<double>*(), Skipper> notFormula;
|
|
qi::rule<Iterator, storm::formula::ProbabilisticBoundOperator<double>*(), Skipper> probabilisticBoundOperator;
|
|
qi::rule<Iterator, storm::formula::RewardBoundOperator<double>*(), Skipper> rewardBoundOperator;
|
|
|
|
qi::rule<Iterator, storm::formula::NoBoundOperator<double>*(), Skipper> noBoundOperator;
|
|
qi::rule<Iterator, storm::formula::NoBoundOperator<double>*(), Skipper> probabilisticNoBoundOperator;
|
|
qi::rule<Iterator, storm::formula::NoBoundOperator<double>*(), Skipper> rewardNoBoundOperator;
|
|
|
|
qi::rule<Iterator, storm::formula::AbstractPathFormula<double>*(), Skipper> pathFormula;
|
|
qi::rule<Iterator, storm::formula::BoundedEventually<double>*(), Skipper> boundedEventually;
|
|
qi::rule<Iterator, storm::formula::Eventually<double>*(), Skipper> eventually;
|
|
qi::rule<Iterator, storm::formula::Globally<double>*(), Skipper> globally;
|
|
qi::rule<Iterator, storm::formula::BoundedUntil<double>*(), Skipper> boundedUntil;
|
|
qi::rule<Iterator, storm::formula::Until<double>*(), Skipper> until;
|
|
|
|
qi::rule<Iterator, std::string(), Skipper> freeIdentifierName;
|
|
|
|
};
|
|
|
|
} //namespace storm
|
|
} //namespace parser
|
|
|
|
void storm::parser::PrctlParser::parse(std::string formulaString) {
|
|
// Prepare iterators to input.
|
|
BaseIteratorType stringIteratorBegin = formulaString.begin();
|
|
BaseIteratorType stringIteratorEnd = formulaString.end();
|
|
PositionIteratorType positionIteratorBegin(stringIteratorBegin, stringIteratorEnd, formulaString);
|
|
PositionIteratorType positionIteratorEnd;
|
|
|
|
|
|
// Prepare resulting intermediate representation of input.
|
|
storm::formula::AbstractFormula<double>* result_pointer = nullptr;
|
|
|
|
PrctlGrammar<PositionIteratorType, BOOST_TYPEOF(boost::spirit::ascii::space)> grammar;
|
|
|
|
// Now, parse the formula from the given string
|
|
try {
|
|
qi::phrase_parse(positionIteratorBegin, positionIteratorEnd, grammar, boost::spirit::ascii::space, result_pointer);
|
|
} catch(const qi::expectation_failure<PositionIteratorType>& e) {
|
|
// If the parser expected content different than the one provided, display information
|
|
// about the location of the error.
|
|
const boost::spirit::classic::file_position_base<std::string>& pos = e.first.get_position();
|
|
|
|
// Construct the error message including a caret display of the position in the
|
|
// erroneous line.
|
|
std::stringstream msg;
|
|
msg << pos.file << ", line " << pos.line << ", column " << pos.column
|
|
<< ": parse error: expected " << e.what_ << std::endl << "\t"
|
|
<< e.first.get_currentline() << std::endl << "\t";
|
|
int i = 0;
|
|
for (i = 0; i < pos.column; ++i) {
|
|
msg << "-";
|
|
}
|
|
msg << "^";
|
|
for (; i < 80; ++i) {
|
|
msg << "-";
|
|
}
|
|
msg << std::endl;
|
|
|
|
std::cerr << msg.str();
|
|
|
|
// Now propagate exception.
|
|
throw storm::exceptions::WrongFormatException() << msg.str();
|
|
}
|
|
|
|
// The syntax can be so wrong that no rule can be matched at all
|
|
// In that case, no expectation failure is thrown, but the parser just returns nullptr
|
|
// Then, of course the result is not usable, hence we throw a WrongFormatException, too.
|
|
if (result_pointer == nullptr) {
|
|
throw storm::exceptions::WrongFormatException() << "Syntax error in formula";
|
|
}
|
|
|
|
formula = result_pointer;
|
|
}
|
|
|
|
storm::parser::PrctlParser::PrctlParser(std::string formula) {
|
|
// delegate the string to the parse function
|
|
// this function has to be separate, as it may be called in subclasses which don't call this constructor
|
|
parse(formula);
|
|
}
|