119 lines
3.8 KiB
C++
119 lines
3.8 KiB
C++
/*=============================================================================
|
|
Copyright (c) 2001-2011 Joel de Guzman
|
|
|
|
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
=============================================================================*/
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Plain calculator example demonstrating the grammar. The parser is a
|
|
// syntax checker only and does not do any semantic evaluation.
|
|
//
|
|
// [ JDG May 10, 2002 ] spirit1
|
|
// [ JDG March 4, 2007 ] spirit2
|
|
// [ JDG February 21, 2011 ] spirit2.5
|
|
//
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
// Spirit v2.5 allows you to suppress automatic generation
|
|
// of predefined terminals to speed up complation. With
|
|
// BOOST_SPIRIT_NO_PREDEFINED_TERMINALS defined, you are
|
|
// responsible in creating instances of the terminals that
|
|
// you need (e.g. see qi::uint_type uint_ below).
|
|
#define BOOST_SPIRIT_NO_PREDEFINED_TERMINALS
|
|
|
|
#include <boost/config/warning_disable.hpp>
|
|
#include <boost/spirit/include/qi.hpp>
|
|
#include <iostream>
|
|
#include <string>
|
|
|
|
namespace client
|
|
{
|
|
namespace qi = boost::spirit::qi;
|
|
namespace ascii = boost::spirit::ascii;
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// Our calculator grammar
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
template <typename Iterator>
|
|
struct calculator : qi::grammar<Iterator, ascii::space_type>
|
|
{
|
|
calculator() : calculator::base_type(expression)
|
|
{
|
|
qi::uint_type uint_;
|
|
|
|
expression =
|
|
term
|
|
>> *( ('+' >> term)
|
|
| ('-' >> term)
|
|
)
|
|
;
|
|
|
|
term =
|
|
factor
|
|
>> *( ('*' >> factor)
|
|
| ('/' >> factor)
|
|
)
|
|
;
|
|
|
|
factor =
|
|
uint_
|
|
| '(' >> expression >> ')'
|
|
| ('-' >> factor)
|
|
| ('+' >> factor)
|
|
;
|
|
}
|
|
|
|
qi::rule<Iterator, ascii::space_type> expression, term, factor;
|
|
};
|
|
}
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// Main program
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
int
|
|
main()
|
|
{
|
|
std::cout << "/////////////////////////////////////////////////////////\n\n";
|
|
std::cout << "Expression parser...\n\n";
|
|
std::cout << "/////////////////////////////////////////////////////////\n\n";
|
|
std::cout << "Type an expression...or [q or Q] to quit\n\n";
|
|
|
|
typedef std::string::const_iterator iterator_type;
|
|
typedef client::calculator<iterator_type> calculator;
|
|
|
|
boost::spirit::ascii::space_type space; // Our skipper
|
|
calculator calc; // Our grammar
|
|
|
|
std::string str;
|
|
while (std::getline(std::cin, str))
|
|
{
|
|
if (str.empty() || str[0] == 'q' || str[0] == 'Q')
|
|
break;
|
|
|
|
std::string::const_iterator iter = str.begin();
|
|
std::string::const_iterator end = str.end();
|
|
bool r = phrase_parse(iter, end, calc, space);
|
|
|
|
if (r && iter == end)
|
|
{
|
|
std::cout << "-------------------------\n";
|
|
std::cout << "Parsing succeeded\n";
|
|
std::cout << "-------------------------\n";
|
|
}
|
|
else
|
|
{
|
|
std::string rest(iter, end);
|
|
std::cout << "-------------------------\n";
|
|
std::cout << "Parsing failed\n";
|
|
std::cout << "stopped at: \" " << rest << "\"\n";
|
|
std::cout << "-------------------------\n";
|
|
}
|
|
}
|
|
|
|
std::cout << "Bye... :-) \n\n";
|
|
return 0;
|
|
}
|
|
|
|
|