2011-09-04 05:14:52 +00:00
|
|
|
|
#pragma once
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
2010-06-25 16:36:13 +00:00
|
|
|
|
#include <list>
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
|
|
|
|
#include <DB/Parsers/IParserBase.h>
|
|
|
|
|
#include <DB/Parsers/CommonParsers.h>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
namespace DB
|
|
|
|
|
{
|
|
|
|
|
|
2014-03-10 14:47:04 +00:00
|
|
|
|
/** Идущие подряд пары строк: оператор и соответствующая ему функция. Например, "+" -> "plus".
|
|
|
|
|
* Порядок парсинга операторов имеет значение.
|
2010-06-25 16:36:13 +00:00
|
|
|
|
*/
|
2014-03-10 14:47:04 +00:00
|
|
|
|
typedef const char ** Operators_t;
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
|
|
|
|
|
2011-08-18 18:48:00 +00:00
|
|
|
|
/** Список элементов, разделённых чем-либо. */
|
|
|
|
|
class ParserList : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
public:
|
2014-03-10 14:47:04 +00:00
|
|
|
|
ParserList(ParserPtr && elem_parser_, ParserPtr && separator_parser_, bool allow_empty_ = true)
|
|
|
|
|
: elem_parser(std::move(elem_parser_)), separator_parser(std::move(separator_parser_)), allow_empty(allow_empty_)
|
2011-08-18 18:48:00 +00:00
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "list of elements"; }
|
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected);
|
2011-08-18 18:48:00 +00:00
|
|
|
|
private:
|
|
|
|
|
ParserPtr elem_parser;
|
|
|
|
|
ParserPtr separator_parser;
|
|
|
|
|
bool allow_empty;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
2010-06-24 19:12:10 +00:00
|
|
|
|
/** Выражение с инфиксным бинарным лево-ассоциативным оператором.
|
|
|
|
|
* Например, a + b - c + d.
|
|
|
|
|
*/
|
|
|
|
|
class ParserLeftAssociativeBinaryOperatorList : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
private:
|
2010-06-24 19:37:23 +00:00
|
|
|
|
Operators_t operators;
|
2010-06-24 19:12:10 +00:00
|
|
|
|
ParserPtr elem_parser;
|
|
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
/** operators_ - допустимые операторы и соответствующие им функции
|
|
|
|
|
*/
|
2014-03-10 14:47:04 +00:00
|
|
|
|
ParserLeftAssociativeBinaryOperatorList(Operators_t operators_, ParserPtr && elem_parser_)
|
|
|
|
|
: operators(operators_), elem_parser(std::move(elem_parser_))
|
2010-06-24 19:12:10 +00:00
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "list, delimited by binary operators"; }
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
2014-03-10 12:25:37 +00:00
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected);
|
2010-06-24 19:12:10 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
2014-02-13 11:05:51 +00:00
|
|
|
|
/** Выражение с инфиксным оператором произвольной арности.
|
|
|
|
|
* Например, a AND b AND c AND d.
|
|
|
|
|
*/
|
|
|
|
|
class ParserVariableArityOperatorList : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
private:
|
|
|
|
|
ParserString infix_parser;
|
2014-03-10 14:47:04 +00:00
|
|
|
|
const char * function_name;
|
2014-02-13 11:05:51 +00:00
|
|
|
|
ParserPtr elem_parser;
|
|
|
|
|
|
|
|
|
|
public:
|
2014-03-10 14:47:04 +00:00
|
|
|
|
ParserVariableArityOperatorList(const char * infix_, const char * function_, ParserPtr && elem_parser_)
|
|
|
|
|
: infix_parser(infix_, true, true), function_name(function_), elem_parser(std::move(elem_parser_))
|
2014-02-13 11:05:51 +00:00
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "list, delimited by operator of variable arity"; }
|
2014-02-13 11:05:51 +00:00
|
|
|
|
|
2014-03-10 12:25:37 +00:00
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected);
|
2014-02-13 11:05:51 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
2010-06-24 19:12:10 +00:00
|
|
|
|
/** Выражение с префиксным унарным оператором.
|
|
|
|
|
* Например, NOT x.
|
|
|
|
|
*/
|
|
|
|
|
class ParserPrefixUnaryOperatorExpression : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
private:
|
2010-06-24 19:37:23 +00:00
|
|
|
|
Operators_t operators;
|
2010-06-24 19:12:10 +00:00
|
|
|
|
ParserPtr elem_parser;
|
|
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
/** operators_ - допустимые операторы и соответствующие им функции
|
|
|
|
|
*/
|
2014-03-10 14:47:04 +00:00
|
|
|
|
ParserPrefixUnaryOperatorExpression(Operators_t operators_, ParserPtr && elem_parser_)
|
|
|
|
|
: operators(operators_), elem_parser(std::move(elem_parser_))
|
2010-06-24 19:12:10 +00:00
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "expression with prefix unary operator"; }
|
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected);
|
2010-06-24 19:12:10 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class ParserAccessExpression : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
private:
|
2014-03-10 14:47:04 +00:00
|
|
|
|
static const char * operators[];
|
2010-06-24 19:12:10 +00:00
|
|
|
|
ParserLeftAssociativeBinaryOperatorList operator_parser;
|
|
|
|
|
public:
|
|
|
|
|
ParserAccessExpression();
|
|
|
|
|
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "access expression"; }
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
2014-03-10 12:25:37 +00:00
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected)
|
2010-06-24 19:12:10 +00:00
|
|
|
|
{
|
|
|
|
|
return operator_parser.parse(pos, end, node, expected);
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class ParserUnaryMinusExpression : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
private:
|
2014-03-10 14:47:04 +00:00
|
|
|
|
static const char * operators[];
|
|
|
|
|
ParserPrefixUnaryOperatorExpression operator_parser {operators, ParserPtr(new ParserAccessExpression)};
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "unary minus expression"; }
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
2014-03-10 12:25:37 +00:00
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected);
|
2010-06-24 19:12:10 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class ParserMultiplicativeExpression : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
private:
|
2014-03-10 14:47:04 +00:00
|
|
|
|
static const char * operators[];
|
|
|
|
|
ParserLeftAssociativeBinaryOperatorList operator_parser {operators, ParserPtr(new ParserUnaryMinusExpression)};
|
|
|
|
|
|
2010-06-24 19:12:10 +00:00
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "multiplicative expression"; }
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
2014-03-10 12:25:37 +00:00
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected)
|
2010-06-24 19:12:10 +00:00
|
|
|
|
{
|
|
|
|
|
return operator_parser.parse(pos, end, node, expected);
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class ParserAdditiveExpression : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
private:
|
2014-03-10 14:47:04 +00:00
|
|
|
|
static const char * operators[];
|
|
|
|
|
ParserLeftAssociativeBinaryOperatorList operator_parser {operators, ParserPtr(new ParserMultiplicativeExpression)};
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "additive expression"; }
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
2014-03-10 12:25:37 +00:00
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected)
|
2010-06-24 19:12:10 +00:00
|
|
|
|
{
|
|
|
|
|
return operator_parser.parse(pos, end, node, expected);
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class ParserComparisonExpression : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
private:
|
2014-03-10 14:47:04 +00:00
|
|
|
|
static const char * operators[];
|
|
|
|
|
ParserLeftAssociativeBinaryOperatorList operator_parser {operators, ParserPtr(new ParserAdditiveExpression)};
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "comparison expression"; }
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
2014-03-10 12:25:37 +00:00
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected)
|
2010-06-24 19:12:10 +00:00
|
|
|
|
{
|
|
|
|
|
return operator_parser.parse(pos, end, node, expected);
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class ParserLogicalNotExpression : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
private:
|
2014-03-10 14:47:04 +00:00
|
|
|
|
static const char * operators[];
|
|
|
|
|
ParserPrefixUnaryOperatorExpression operator_parser {operators, ParserPtr(new ParserComparisonExpression)};
|
|
|
|
|
|
2010-06-24 19:12:10 +00:00
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "logical-NOT expression"; }
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
2014-03-10 12:25:37 +00:00
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected)
|
2010-06-24 19:12:10 +00:00
|
|
|
|
{
|
|
|
|
|
return operator_parser.parse(pos, end, node, expected);
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class ParserLogicalAndExpression : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
private:
|
2014-02-13 11:05:51 +00:00
|
|
|
|
ParserVariableArityOperatorList operator_parser;
|
2010-06-24 19:12:10 +00:00
|
|
|
|
public:
|
|
|
|
|
ParserLogicalAndExpression()
|
2014-03-10 14:47:04 +00:00
|
|
|
|
: operator_parser("AND", "and", ParserPtr(new ParserLogicalNotExpression))
|
2010-06-24 19:12:10 +00:00
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "logical-AND expression"; }
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
2014-03-10 12:25:37 +00:00
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected)
|
2010-06-24 19:12:10 +00:00
|
|
|
|
{
|
|
|
|
|
return operator_parser.parse(pos, end, node, expected);
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class ParserLogicalOrExpression : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
private:
|
2014-02-13 11:05:51 +00:00
|
|
|
|
ParserVariableArityOperatorList operator_parser;
|
2010-06-24 19:12:10 +00:00
|
|
|
|
public:
|
|
|
|
|
ParserLogicalOrExpression()
|
2014-03-10 14:47:04 +00:00
|
|
|
|
: operator_parser("OR", "or", ParserPtr(new ParserLogicalAndExpression))
|
2010-06-24 19:12:10 +00:00
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "logical-OR expression"; }
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
2014-03-10 12:25:37 +00:00
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected)
|
2010-06-24 19:12:10 +00:00
|
|
|
|
{
|
|
|
|
|
return operator_parser.parse(pos, end, node, expected);
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
2012-09-23 06:16:42 +00:00
|
|
|
|
/** Выражение с тернарным оператором.
|
|
|
|
|
* Например, a = 1 ? b + 1 : c * 2.
|
|
|
|
|
*/
|
|
|
|
|
class ParserTernaryOperatorExpression : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
private:
|
2014-03-10 14:47:04 +00:00
|
|
|
|
ParserLogicalOrExpression elem_parser;
|
2012-09-23 06:16:42 +00:00
|
|
|
|
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "expression with ternary operator"; }
|
2012-09-23 06:16:42 +00:00
|
|
|
|
|
2014-03-10 12:25:37 +00:00
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected);
|
2012-09-23 06:16:42 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
2013-05-08 09:52:02 +00:00
|
|
|
|
class ParserLambdaExpression : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
private:
|
2014-03-10 14:47:04 +00:00
|
|
|
|
ParserTernaryOperatorExpression elem_parser;
|
2013-05-08 09:52:02 +00:00
|
|
|
|
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "lambda expression"; }
|
2013-05-08 09:52:02 +00:00
|
|
|
|
|
2014-03-10 12:25:37 +00:00
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected);
|
2013-05-08 09:52:02 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
2011-11-06 20:47:07 +00:00
|
|
|
|
class ParserExpressionWithOptionalAlias : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
public:
|
|
|
|
|
ParserExpressionWithOptionalAlias();
|
|
|
|
|
protected:
|
|
|
|
|
ParserPtr impl;
|
|
|
|
|
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "expression with optional alias"; }
|
2011-11-06 20:47:07 +00:00
|
|
|
|
|
2014-03-10 12:25:37 +00:00
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected)
|
2011-11-06 20:47:07 +00:00
|
|
|
|
{
|
|
|
|
|
return impl->parse(pos, end, node, expected);
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
2010-06-24 19:12:10 +00:00
|
|
|
|
/** Список выражений, разделённых запятыми, возможно пустой. */
|
|
|
|
|
class ParserExpressionList : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "list of expressions"; }
|
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected);
|
2010-06-24 19:12:10 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class ParserNotEmptyExpressionList : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
private:
|
|
|
|
|
ParserExpressionList nested_parser;
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "not empty list of expressions"; }
|
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected);
|
2010-06-24 19:12:10 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
2011-09-04 05:14:52 +00:00
|
|
|
|
class ParserOrderByExpressionList : public IParserBase
|
|
|
|
|
{
|
|
|
|
|
protected:
|
2014-03-10 12:25:37 +00:00
|
|
|
|
const char * getName() const { return "order by expression"; }
|
|
|
|
|
bool parseImpl(Pos & pos, Pos end, ASTPtr & node, const char *& expected);
|
2011-09-04 05:14:52 +00:00
|
|
|
|
};
|
2010-06-24 19:12:10 +00:00
|
|
|
|
|
|
|
|
|
|
2011-09-04 05:14:52 +00:00
|
|
|
|
}
|