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.
183 lines
8.0 KiB
183 lines
8.0 KiB
/*
|
|
* LtlParser.cpp
|
|
*
|
|
* Created on: 22.04.2013
|
|
* Author: thomas
|
|
*/
|
|
|
|
#include "LtlParser.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>
|
|
#include <map>
|
|
|
|
|
|
// 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 LtlGrammar : qi::grammar<Iterator, storm::property::ltl::AbstractLtlFormula<double>*(), Skipper > {
|
|
LtlGrammar() : LtlGrammar::base_type(start) {
|
|
//This block contains helper rules that may be used several times
|
|
freeIdentifierName = qi::lexeme[qi::alpha >> *(qi::alnum | qi::char_('_'))];
|
|
//Comment: Empty line or line starting with "//"
|
|
comment = (qi::lit("//") >> *(qi::char_))[qi::_val = nullptr];
|
|
|
|
freeIdentifierName = qi::lexeme[+(qi::alpha | qi::char_('_'))];
|
|
|
|
//This block defines rules for parsing state formulas
|
|
ltlFormula %= orFormula;
|
|
ltlFormula.name("LTL formula");
|
|
orFormula = andFormula[qi::_val = qi::_1] > *(qi::lit("|") > andFormula)[qi::_val =
|
|
phoenix::new_<storm::property::ltl::Or<double>>(qi::_val, qi::_1)];
|
|
orFormula.name("LTL formula");
|
|
andFormula = untilFormula[qi::_val = qi::_1] > *(qi::lit("&") > untilFormula)[qi::_val =
|
|
phoenix::new_<storm::property::ltl::And<double>>(qi::_val, qi::_1)];
|
|
andFormula.name("LTL formula");
|
|
untilFormula = notFormula[qi::_val = qi::_1] >
|
|
*((qi::lit("U") >> qi::lit("<=") > qi::int_ > notFormula)[qi::_val = phoenix::new_<storm::property::ltl::BoundedUntil<double>>(qi::_val, qi::_2, qi::_1)] |
|
|
(qi::lit("U") > notFormula)[qi::_val = phoenix::new_<storm::property::ltl::Until<double>>(qi::_val, qi::_1)]);
|
|
notFormula = atomicLtlFormula[qi::_val = qi::_1] | (qi::lit("!") > atomicLtlFormula)[qi::_val =
|
|
phoenix::new_<storm::property::ltl::Not<double>>(qi::_1)];
|
|
notFormula.name("LTL formula");
|
|
|
|
//This block defines rules for "atomic" state formulas
|
|
//(Propositions, probabilistic/reward formulas, and state formulas in brackets)
|
|
atomicLtlFormula %= pathFormula | atomicProposition | qi::lit("(") >> ltlFormula >> qi::lit(")");
|
|
atomicLtlFormula.name("LTL formula");
|
|
atomicProposition = (freeIdentifierName)[qi::_val =
|
|
phoenix::new_<storm::property::ltl::Ap<double>>(qi::_1)];
|
|
atomicProposition.name("LTL formula");
|
|
|
|
//This block defines rules for parsing probabilistic path formulas
|
|
pathFormula = (boundedEventually | eventually | globally | next);
|
|
pathFormula.name("LTL formula");
|
|
boundedEventually = (qi::lit("F") >> qi::lit("<=") > qi::int_ > ltlFormula)[qi::_val =
|
|
phoenix::new_<storm::property::ltl::BoundedEventually<double>>(qi::_2, qi::_1)];
|
|
boundedEventually.name("LTL formula");
|
|
eventually = (qi::lit("F") >> ltlFormula)[qi::_val =
|
|
phoenix::new_<storm::property::ltl::Eventually<double> >(qi::_1)];
|
|
eventually.name("LTL formula");
|
|
globally = (qi::lit("G") >> ltlFormula)[qi::_val =
|
|
phoenix::new_<storm::property::ltl::Globally<double> >(qi::_1)];
|
|
globally.name("LTL formula");
|
|
next = (qi::lit("X") >> ltlFormula)[qi::_val =
|
|
phoenix::new_<storm::property::ltl::Next<double> >(qi::_1)];
|
|
next.name("LTL formula");
|
|
|
|
start = (((ltlFormula) > (comment | qi::eps))[qi::_val = qi::_1] |
|
|
comment
|
|
) > qi::eoi;
|
|
start.name("LTL formula");
|
|
}
|
|
|
|
qi::rule<Iterator, storm::property::ltl::AbstractLtlFormula<double>*(), Skipper> start;
|
|
qi::rule<Iterator, storm::property::ltl::AbstractLtlFormula<double>*(), Skipper> comment;
|
|
|
|
qi::rule<Iterator, storm::property::ltl::AbstractLtlFormula<double>*(), Skipper> ltlFormula;
|
|
qi::rule<Iterator, storm::property::ltl::AbstractLtlFormula<double>*(), Skipper> atomicLtlFormula;
|
|
|
|
qi::rule<Iterator, storm::property::ltl::AbstractLtlFormula<double>*(), Skipper> andFormula;
|
|
qi::rule<Iterator, storm::property::ltl::AbstractLtlFormula<double>*(), Skipper> untilFormula;
|
|
qi::rule<Iterator, storm::property::ltl::AbstractLtlFormula<double>*(), Skipper> atomicProposition;
|
|
qi::rule<Iterator, storm::property::ltl::AbstractLtlFormula<double>*(), Skipper> orFormula;
|
|
qi::rule<Iterator, storm::property::ltl::AbstractLtlFormula<double>*(), Skipper> notFormula;
|
|
//qi::rule<Iterator, storm::property::ltl::ProbabilisticBoundOperator<double>*(), Skipper> probabilisticBoundOperator;
|
|
|
|
//qi::rule<Iterator, storm::property::ltl::AbstractNoBoundOperator<double>*(), Skipper> noBoundOperator;
|
|
//qi::rule<Iterator, storm::property::ltl::AbstractNoBoundOperator<double>*(), Skipper> probabilisticNoBoundOperator;
|
|
|
|
qi::rule<Iterator, storm::property::ltl::AbstractLtlFormula<double>*(), Skipper> pathFormula;
|
|
qi::rule<Iterator, storm::property::ltl::BoundedEventually<double>*(), Skipper> boundedEventually;
|
|
qi::rule<Iterator, storm::property::ltl::Eventually<double>*(), Skipper> eventually;
|
|
qi::rule<Iterator, storm::property::ltl::Globally<double>*(), Skipper> globally;
|
|
qi::rule<Iterator, storm::property::ltl::Next<double>*(), Skipper> next;
|
|
qi::rule<Iterator, storm::property::ltl::AbstractLtlFormula<double>*(), qi::locals< std::shared_ptr<storm::property::ltl::AbstractLtlFormula<double>>>, Skipper> boundedUntil;
|
|
qi::rule<Iterator, storm::property::ltl::AbstractLtlFormula<double>*(), qi::locals< std::shared_ptr<storm::property::ltl::AbstractLtlFormula<double>>>, Skipper> until;
|
|
|
|
qi::rule<Iterator, std::string(), Skipper> freeIdentifierName;
|
|
|
|
};
|
|
|
|
} //namespace storm
|
|
} //namespace parser
|
|
|
|
|
|
storm::property::ltl::AbstractLtlFormula<double>* storm::parser::LtlParser(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::property::ltl::AbstractLtlFormula<double>* result_pointer = nullptr;
|
|
|
|
LtlGrammar<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";
|
|
}
|
|
|
|
return result_pointer;
|
|
}
|
|
|