e46e58f4cd
Not intrusive. Significantly speeds up tests on MSVC (for about 3 times). Finally solves exceeding build time limits on CI with MSVC compilers. Did not set up PCH for X3, it is fast as-is (tooks only about 2 minutes). Repository tests reuse PCH from Qi/Karma tests.
90 lines
2.4 KiB
C++
90 lines
2.4 KiB
C++
// Copyright (c) 2001-2010 Hartmut Kaiser
|
|
// Copyright (c) 2009 Tor Brede Vekterli
|
|
//
|
|
// 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)
|
|
|
|
#include <boost/detail/lightweight_test.hpp>
|
|
#include <boost/config/warning_disable.hpp>
|
|
|
|
#include <boost/spirit/include/lex_lexertl.hpp>
|
|
#include <boost/spirit/include/qi_parse.hpp>
|
|
#include <boost/spirit/include/qi_operator.hpp>
|
|
#include <boost/spirit/include/qi_action.hpp>
|
|
#include <boost/spirit/include/qi_char.hpp>
|
|
#include <boost/spirit/include/qi_grammar.hpp>
|
|
#include <boost/spirit/include/phoenix_operator.hpp>
|
|
|
|
#include <iostream>
|
|
#include <string>
|
|
|
|
namespace qi = boost::spirit::qi;
|
|
namespace lex = boost::spirit::lex;
|
|
|
|
enum tokenids
|
|
{
|
|
IDANY = lex::min_token_id + 10 // Lower 8 bits is 0x0a, same as '\n'
|
|
};
|
|
|
|
template <typename Lexer>
|
|
struct word_count_tokens : lex::lexer<Lexer>
|
|
{
|
|
word_count_tokens()
|
|
{
|
|
this->self.add_pattern
|
|
("TEST", "A")
|
|
;
|
|
word = "{TEST}";
|
|
this->self.add
|
|
(word)
|
|
('\n')
|
|
(".", IDANY)
|
|
;
|
|
}
|
|
lex::token_def<std::string> word;
|
|
};
|
|
|
|
template <typename Iterator>
|
|
struct word_count_grammar : qi::grammar<Iterator>
|
|
{
|
|
template <typename TokenDef>
|
|
word_count_grammar(TokenDef const& tok)
|
|
: word_count_grammar::base_type(start)
|
|
, c(0), w(0), l(0)
|
|
{
|
|
using boost::phoenix::ref;
|
|
using qi::lit;
|
|
using qi::token;
|
|
|
|
start = *( tok.word [++ref(w)]
|
|
| lit('\n') [++ref(l)]
|
|
| token(IDANY) [++ref(c)]
|
|
)
|
|
;
|
|
}
|
|
std::size_t c, w, l;
|
|
qi::rule<Iterator> start;
|
|
};
|
|
|
|
|
|
int main()
|
|
{
|
|
typedef lex::lexertl::token<
|
|
const char*, boost::mpl::vector<std::string>
|
|
> token_type;
|
|
|
|
typedef lex::lexertl::lexer<token_type> lexer_type;
|
|
typedef word_count_tokens<lexer_type>::iterator_type iterator_type;
|
|
word_count_tokens<lexer_type> word_count; // Our lexer
|
|
word_count_grammar<iterator_type> g (word_count); // Our parser
|
|
|
|
std::string str ("A\nBCDEFGHI");
|
|
char const* first = str.c_str();
|
|
char const* last = &first[str.size()];
|
|
|
|
BOOST_TEST(lex::tokenize_and_parse(first, last, word_count, g));
|
|
BOOST_TEST(g.l == 1 && g.w == 1 && g.c == 8);
|
|
|
|
return boost::report_errors();
|
|
}
|