1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
#include "parser_call_stack.h"
#include "grammar.h"
#include <util/generic/vector.h>
#include <util/generic/algorithm.h>
#include <util/generic/yexception.h>
namespace NSQLComplete {
const TVector<TRuleId> KeywordRules = {
RULE(Keyword),
RULE(Keyword_expr_uncompat),
RULE(Keyword_table_uncompat),
RULE(Keyword_select_uncompat),
RULE(Keyword_alter_uncompat),
RULE(Keyword_in_uncompat),
RULE(Keyword_window_uncompat),
RULE(Keyword_hint_uncompat),
RULE(Keyword_as_compat),
RULE(Keyword_compat),
};
const TVector<TRuleId> TypeNameRules = {
RULE(Type_name_simple),
};
const TVector<TRuleId> FunctionNameRules = {
RULE(Id_expr),
RULE(An_id_or_type),
RULE(Id_or_type),
};
bool EndsWith(const TParserCallStack& suffix, const TParserCallStack& stack) {
if (stack.size() < suffix.size()) {
return false;
}
const size_t prefixSize = stack.size() - suffix.size();
return Equal(std::begin(stack) + prefixSize, std::end(stack), std::begin(suffix));
}
bool ContainsRule(TRuleId rule, const TParserCallStack& stack) {
return Find(stack, rule) != std::end(stack);
}
bool IsLikelyTypeStack(const TParserCallStack& stack) {
return EndsWith({RULE(Type_name_simple)}, stack);
}
bool IsLikelyFunctionStack(const TParserCallStack& stack) {
return EndsWith({RULE(Unary_casual_subexpr), RULE(Id_expr)}, stack) ||
EndsWith({RULE(Unary_casual_subexpr),
RULE(Atom_expr),
RULE(An_id_or_type)}, stack);
}
std::unordered_set<TRuleId> GetC3PreferredRules() {
std::unordered_set<TRuleId> preferredRules;
preferredRules.insert(std::begin(KeywordRules), std::end(KeywordRules));
preferredRules.insert(std::begin(TypeNameRules), std::end(TypeNameRules));
preferredRules.insert(std::begin(FunctionNameRules), std::end(FunctionNameRules));
return preferredRules;
}
} // namespace NSQLComplete
|
