ClickHouse/dbms/src/Parsers/ExpressionListParsers.cpp

218 lines
5.1 KiB
C++
Raw Normal View History

2010-06-24 19:12:10 +00:00
#include <DB/Parsers/IAST.h>
#include <DB/Parsers/ASTExpressionList.h>
#include <DB/Parsers/ASTFunction.h>
#include <DB/Parsers/CommonParsers.h>
#include <DB/Parsers/ExpressionElementParsers.h>
#include <DB/Parsers/ExpressionListParsers.h>
namespace DB
{
2011-08-18 18:48:00 +00:00
bool ParserList::parseImpl(Pos & pos, Pos end, ASTPtr & node, String & expected)
{
bool first = true;
ParserWhiteSpaceOrComments ws;
ASTExpressionList * list = new ASTExpressionList;
node = list;
while (1)
{
if (first)
{
ASTPtr elem;
if (!elem_parser->parse(pos, end, elem, expected))
break;
list->children.push_back(elem);
}
else
{
ws.ignore(pos, end);
if (!separator_parser->ignore(pos, end, expected))
break;
ws.ignore(pos, end);
ASTPtr elem;
if (!elem_parser->parse(pos, end, elem, expected))
return false;
list->children.push_back(elem);
}
first = false;
}
if (!allow_empty && first)
return false;
return true;
}
2010-06-24 19:12:10 +00:00
bool ParserLeftAssociativeBinaryOperatorList::parseImpl(Pos & pos, Pos end, ASTPtr & node, String & expected)
{
bool first = true;
ParserWhiteSpaceOrComments ws;
while (1)
{
if (first)
{
ASTPtr elem;
if (!elem_parser->parse(pos, end, elem, expected))
2010-06-25 19:55:19 +00:00
return false;
2010-06-24 19:12:10 +00:00
node = elem;
}
else
{
ws.ignore(pos, end);
/// пробуем найти какой-нибудь из допустимых операторов
Pos begin = pos;
Operators_t::const_iterator it;
for (it = operators.begin(); it != operators.end(); ++it)
{
2010-06-25 16:36:13 +00:00
ParserString op(it->first, true);
2010-06-24 19:12:10 +00:00
if (op.ignore(pos, end, expected))
break;
}
if (it == operators.end())
break;
ws.ignore(pos, end);
/// функция, соответствующая оператору
2010-06-25 16:36:13 +00:00
ASTFunction * p_function = new ASTFunction;
2010-06-24 19:12:10 +00:00
ASTFunction & function = *p_function;
ASTPtr function_node = p_function;
/// аргументы функции
2010-06-25 16:36:13 +00:00
ASTExpressionList * p_exp_list = new ASTExpressionList;
2010-06-24 19:12:10 +00:00
ASTExpressionList & exp_list = *p_exp_list;
ASTPtr exp_list_node = p_exp_list;
ASTPtr elem;
if (!elem_parser->parse(pos, end, elem, expected))
return false;
/// первым аргументом функции будет предыдущий элемент, вторым - следующий
function.range.first = begin;
function.range.second = pos;
function.name = it->second;
function.arguments = exp_list_node;
2011-08-13 21:05:18 +00:00
function.children.push_back(exp_list_node);
2010-06-24 19:12:10 +00:00
exp_list.children.push_back(node);
exp_list.children.push_back(elem);
exp_list.range.second = pos;
/** специальное исключение для оператора доступа к элементу массива x[y], который
* содержит инфиксную часть '[' и суффиксную ']' (задаётся в виде '[')
*/
if (it->first == "[")
{
ParserString rest_p("]");
ws.ignore(pos, end);
if (!rest_p.ignore(pos, end, expected))
return false;
}
node = function_node;
}
first = false;
}
return true;
}
bool ParserPrefixUnaryOperatorExpression::parseImpl(Pos & pos, Pos end, ASTPtr & node, String & expected)
{
ParserWhiteSpaceOrComments ws;
/// пробуем найти какой-нибудь из допустимых операторов
Pos begin = pos;
Operators_t::const_iterator it;
for (it = operators.begin(); it != operators.end(); ++it)
{
2010-06-25 16:36:13 +00:00
ParserString op(it->first, true);
2010-06-24 19:12:10 +00:00
if (op.ignore(pos, end, expected))
break;
}
2010-06-25 19:55:19 +00:00
ws.ignore(pos, end);
2010-06-24 19:37:23 +00:00
ASTPtr elem;
if (!elem_parser->parse(pos, end, elem, expected))
2010-06-24 19:12:10 +00:00
return false;
2010-06-24 19:37:23 +00:00
if (it == operators.end())
node = elem;
else
{
/// функция, соответствующая оператору
2010-06-25 16:36:13 +00:00
ASTFunction * p_function = new ASTFunction;
2010-06-24 19:37:23 +00:00
ASTFunction & function = *p_function;
ASTPtr function_node = p_function;
2010-06-24 19:12:10 +00:00
2010-06-24 19:37:23 +00:00
/// аргументы функции
2010-06-25 16:36:13 +00:00
ASTExpressionList * p_exp_list = new ASTExpressionList;
2010-06-24 19:37:23 +00:00
ASTExpressionList & exp_list = *p_exp_list;
ASTPtr exp_list_node = p_exp_list;
2010-06-24 19:12:10 +00:00
2010-06-24 19:37:23 +00:00
function.range.first = begin;
function.range.second = pos;
function.name = it->second;
function.arguments = exp_list_node;
2011-08-13 21:05:18 +00:00
function.children.push_back(exp_list_node);
2010-06-24 19:12:10 +00:00
2010-06-24 19:37:23 +00:00
exp_list.children.push_back(elem);
exp_list.range.second = pos;
2010-06-24 19:12:10 +00:00
2010-06-24 19:37:23 +00:00
node = function_node;
}
2010-06-24 19:12:10 +00:00
return true;
}
ParserAccessExpression::ParserAccessExpression()
: elem_parser(new ParserExpressionElement),
operator_parser(boost::assign::map_list_of
(".", "tupleElement")
("[", "arrayElement"),
elem_parser)
{
}
bool ParserExpressionList::parseImpl(Pos & pos, Pos end, ASTPtr & node, String & expected)
{
2011-08-18 18:48:00 +00:00
return ParserList(new ParserLogicalOrExpression, new ParserString(",")).parse(pos, end, node, expected);
2010-06-24 19:12:10 +00:00
}
bool ParserNotEmptyExpressionList::parseImpl(Pos & pos, Pos end, ASTPtr & node, String & expected)
{
return nested_parser.parse(pos, end, node, expected)
&& !dynamic_cast<ASTExpressionList &>(*node).children.empty();
}
2011-09-04 05:14:52 +00:00
bool ParserOrderByExpressionList::parseImpl(Pos & pos, Pos end, ASTPtr & node, String & expected)
{
return ParserList(new ParserOrderByElement, new ParserString(",")).parse(pos, end, node, expected);
}
2010-06-24 19:12:10 +00:00
}