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.
132 lines
5.6 KiB
132 lines
5.6 KiB
/*
|
|
This file is part of cpp-ethereum.
|
|
|
|
cpp-ethereum is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
cpp-ethereum is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with cpp-ethereum. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/** @file Parser.cpp
|
|
* @author Gav Wood <i@gavwood.com>
|
|
* @date 2014
|
|
*/
|
|
|
|
#include "Parser.h"
|
|
|
|
#define BOOST_RESULT_OF_USE_DECLTYPE
|
|
#define BOOST_SPIRIT_USE_PHOENIX_V3
|
|
#include <boost/spirit/include/qi.hpp>
|
|
#include <boost/spirit/include/phoenix.hpp>
|
|
#include <boost/spirit/include/support_utree.hpp>
|
|
|
|
using namespace std;
|
|
using namespace eth;
|
|
namespace qi = boost::spirit::qi;
|
|
namespace px = boost::phoenix;
|
|
namespace sp = boost::spirit;
|
|
|
|
void eth::killBigints(sp::utree const& _this)
|
|
{
|
|
switch (_this.which())
|
|
{
|
|
case sp::utree_type::list_type: for (auto const& i: _this) killBigints(i); break;
|
|
case sp::utree_type::any_type: delete _this.get<bigint*>(); break;
|
|
default:;
|
|
}
|
|
}
|
|
|
|
void eth::debugOutAST(ostream& _out, sp::utree const& _this)
|
|
{
|
|
switch (_this.which())
|
|
{
|
|
case sp::utree_type::list_type:
|
|
switch (_this.tag())
|
|
{
|
|
case 0: _out << "( "; for (auto const& i: _this) { debugOutAST(_out, i); _out << " "; } _out << ")"; break;
|
|
case 1: _out << "@ "; debugOutAST(_out, _this.front()); break;
|
|
case 2: _out << "@@ "; debugOutAST(_out, _this.front()); break;
|
|
case 3: _out << "[ "; debugOutAST(_out, _this.front()); _out << " ] "; debugOutAST(_out, _this.back()); break;
|
|
case 4: _out << "[[ "; debugOutAST(_out, _this.front()); _out << " ]] "; debugOutAST(_out, _this.back()); break;
|
|
case 5: _out << "{ "; for (auto const& i: _this) { debugOutAST(_out, i); _out << " "; } _out << "}"; break;
|
|
default:;
|
|
}
|
|
|
|
break;
|
|
case sp::utree_type::int_type: _out << _this.get<int>(); break;
|
|
case sp::utree_type::string_type: _out << "\"" << _this.get<sp::basic_string<boost::iterator_range<char const*>, sp::utree_type::string_type>>() << "\""; break;
|
|
case sp::utree_type::symbol_type: _out << _this.get<sp::basic_string<boost::iterator_range<char const*>, sp::utree_type::symbol_type>>(); break;
|
|
case sp::utree_type::any_type: _out << *_this.get<bigint*>(); break;
|
|
default: _out << "nil";
|
|
}
|
|
}
|
|
|
|
void eth::parseTreeLLL(string const& _s, sp::utree& o_out)
|
|
{
|
|
using qi::ascii::space;
|
|
typedef sp::basic_string<std::string, sp::utree_type::symbol_type> symbol_type;
|
|
typedef string::const_iterator it;
|
|
|
|
static const u256 ether = u256(1000000000) * 1000000000;
|
|
static const u256 finney = u256(1000000000) * 1000000;
|
|
static const u256 szabo = u256(1000000000) * 1000;
|
|
|
|
qi::rule<it, qi::ascii::space_type, sp::utree()> element;
|
|
qi::rule<it, string()> str = '"' > qi::lexeme[+(~qi::char_(std::string("\"") + '\0'))] > '"';
|
|
qi::rule<it, string()> strsh = '\'' > qi::lexeme[+(~qi::char_(std::string(" ;@()[]{}:") + '\0'))];
|
|
qi::rule<it, symbol_type()> symbol = qi::lexeme[+(~qi::char_(std::string(" @[]{}:();\"\x01-\x1f\x7f") + '\0'))];
|
|
qi::rule<it, string()> intstr = qi::lexeme[ qi::no_case["0x"][qi::_val = "0x"] >> *qi::char_("0-9a-fA-F")[qi::_val += qi::_1]] | qi::lexeme[+qi::char_("0-9")[qi::_val += qi::_1]];
|
|
qi::rule<it, bigint()> integer = intstr;
|
|
qi::rule<it, bigint()> multiplier = qi::lit("wei")[qi::_val = 1] | qi::lit("szabo")[qi::_val = szabo] | qi::lit("finney")[qi::_val = finney] | qi::lit("ether")[qi::_val = ether];
|
|
qi::rule<it, qi::ascii::space_type, bigint()> quantity = integer[qi::_val = qi::_1] >> -multiplier[qi::_val *= qi::_1];
|
|
qi::rule<it, qi::ascii::space_type, sp::utree()> atom = quantity[qi::_val = px::construct<sp::any_ptr>(px::new_<bigint>(qi::_1))] | (str | strsh)[qi::_val = qi::_1] | symbol[qi::_val = qi::_1];
|
|
qi::rule<it, qi::ascii::space_type, sp::utree::list_type()> seq = '{' > *element > '}';
|
|
qi::rule<it, qi::ascii::space_type, sp::utree::list_type()> mload = '@' > element;
|
|
qi::rule<it, qi::ascii::space_type, sp::utree::list_type()> sload = qi::lit("@@") > element;
|
|
qi::rule<it, qi::ascii::space_type, sp::utree::list_type()> mstore = '[' > element > ']' > -qi::lit(":") > element;
|
|
qi::rule<it, qi::ascii::space_type, sp::utree::list_type()> sstore = qi::lit("[[") > element > qi::lit("]]") > -qi::lit(":") > element;
|
|
qi::rule<it, qi::ascii::space_type, sp::utree::list_type()> list = '(' > *element > ')';
|
|
|
|
// todo: fix compound compile errors in this line for Visual Studio 2013
|
|
//#ifndef _MSC_VER
|
|
auto x = [](int a) { return [=](sp::utree& n, typename qi::rule<it, qi::ascii::space_type, sp::utree()>::context_type& c) { (boost::fusion::at_c<0>(c.attributes) = n).tag(a); }; };
|
|
qi::rule<it, qi::ascii::space_type, sp::utree()> extra = mload[x(1)] | sload[x(2)] | mstore[x(3)] | sstore[x(4)] | seq[x(5)];
|
|
element = atom | list | extra;
|
|
/*#else
|
|
element = atom | list;
|
|
#endif*/
|
|
|
|
|
|
string s;
|
|
s.reserve(_s.size());
|
|
bool incomment = false;
|
|
bool instring = false;
|
|
bool insstring = false;
|
|
for (auto i: _s)
|
|
{
|
|
if (i == ';' && !instring && !insstring)
|
|
incomment = true;
|
|
else if (i == '\n')
|
|
incomment = instring = insstring = false;
|
|
else if (i == '"' && !insstring)
|
|
instring = !instring;
|
|
else if (i == '\'')
|
|
insstring = true;
|
|
else if (i == ' ')
|
|
insstring = false;
|
|
if (!incomment)
|
|
s.push_back(i);
|
|
}
|
|
auto ret = s.cbegin();
|
|
qi::phrase_parse(ret, s.cend(), element, space, qi::skip_flag::dont_postskip, o_out);
|
|
if (ret != s.cend())
|
|
throw std::exception();
|
|
}
|
|
|
|
|