Home
last modified time | relevance | path

Searched refs:RegexNode (Results 1 - 6 of 6) sorted by relevance

/third_party/skia/src/sksl/lex/
H A DRegexParser.cpp12 RegexNode RegexParser::parse(std::string source) { in parse()
37 RegexNode RegexParser::pop() { in pop()
38 RegexNode result = fStack.top(); in pop()
55 case '*': fStack.push(RegexNode(RegexNode::kStar_Kind, this->pop())); ++fIndex; break; in quantifiedTerm()
56 case '+': fStack.push(RegexNode(RegexNode::kPlus_Kind, this->pop())); ++fIndex; break; in quantifiedTerm()
57 case '?': fStack.push(RegexNode(RegexNode::kQuestion_Kind, this->pop())); ++fIndex; break; in quantifiedTerm()
71 RegexNode righ in sequence()
[all...]
H A DRegexNode.h19 struct RegexNode { struct
32 RegexNode(Kind kind) in RegexNode() function
35 RegexNode(Kind kind, char payload) in RegexNode() function
40 RegexNode(Kind kind, const char* children) in RegexNode() function
49 RegexNode(Kind kind, RegexNode child) in RegexNode() function
54 RegexNode(Kind kind, RegexNode child1, RegexNode child2) in RegexNode() function
75 std::vector<RegexNode> fChildre
[all...]
H A DMain.cpp208 RegexNode node = RegexNode(RegexNode::kChar_Kind, pattern[1]); in process()
210 node = RegexNode(RegexNode::kConcat_Kind, node, in process()
211 RegexNode(RegexNode::kChar_Kind, pattern[i])); in process()
H A DRegexParser.h11 #include "src/sksl/lex/RegexNode.h"
23 RegexNode parse(std::string source);
32 RegexNode pop();
53 RegexNode escapeSequence(char c);
86 std::stack<RegexNode> fStack;
H A DRegexNode.cpp8 #include "src/sksl/lex/RegexNode.h"
12 std::vector<int> RegexNode::createStates(NFA* nfa, const std::vector<int>& accept) const { in createStates()
20 for (const RegexNode& child : fChildren) { in createStates()
86 std::string RegexNode::description() const { in description()
95 for (const RegexNode& c : fChildren) { in description()
H A DNFA.h12 #include "src/sksl/lex/RegexNode.h"
23 int addRegex(const RegexNode& regex) { in addRegex()

Completed in 3 milliseconds