123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118 |
- /*=============================================================================
- Copyright (c) 2001-2010 Joel de Guzman
- Copyright (c) 2009 Francois Barel
- 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
- //
- ///////////////////////////////////////////////////////////////////////////////
- #include <boost/config/warning_disable.hpp>
- #include <boost/spirit/include/qi.hpp>
- #include <boost/spirit/repository/include/qi_subrule.hpp>
- #include <iostream>
- #include <string>
- namespace client
- {
- namespace qi = boost::spirit::qi;
- namespace repo = boost::spirit::repository;
- namespace ascii = boost::spirit::ascii;
- ///////////////////////////////////////////////////////////////////////////////
- // Our calculator grammar
- ///////////////////////////////////////////////////////////////////////////////
- template <typename Iterator>
- struct calculator : qi::grammar<Iterator, ascii::space_type>
- {
- calculator() : calculator::base_type(entry)
- {
- using qi::uint_;
- //[calc1_sr_def
- entry = (
- expression =
- term
- >> *( ('+' >> term)
- | ('-' >> term)
- )
- , term =
- factor
- >> *( ('*' >> factor)
- | ('/' >> factor)
- )
- , factor =
- uint_
- | '(' >> expression >> ')'
- | ('-' >> factor)
- | ('+' >> factor)
- );
- //]
- }
- qi::rule<Iterator, ascii::space_type> entry;
- repo::qi::subrule<0> expression;
- repo::qi::subrule<1> term;
- repo::qi::subrule<2> 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";
- using boost::spirit::ascii::space;
- typedef std::string::const_iterator iterator_type;
- typedef client::calculator<iterator_type> calculator;
- 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;
- }
|