SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include <smtrat-common/smtrat-common.h>
#include <boost/variant.hpp>
#include <iostream>
#include <sstream>
Go to the source code of this file.
Data Structures | |
struct | smtrat::parser::TheoryError |
struct | smtrat::parser::Identifier |
struct | smtrat::parser::SExpressionSequence< T > |
Namespaces | |
smtrat | |
Class to create the formulas for axioms. | |
smtrat::parser | |
Typedefs | |
template<typename T > | |
using | smtrat::parser::SExpression = boost::variant< T, boost::recursive_wrapper< SExpressionSequence< T > >> |
Functions | |
std::ostream & | smtrat::parser::operator<< (std::ostream &os, const Identifier &identifier) |
template<typename T > | |
std::ostream & | smtrat::parser::operator<< (std::ostream &os, const SExpressionSequence< T > &ses) |