Lines Matching defs:const
45 base::Optional<ParseResult> Rule::RunAction(const Item* completed_item,
46 const LexerResult& tokens) const {
48 for (const Item* child : completed_item->Children()) {
65 for (const Rule& rule : rules) {
71 std::vector<const Item*> Item::Children() const {
72 std::vector<const Item*> children;
73 for (const Item* current = this; current->prev_; current = current->prev_) {
82 std::string Item::SplitByChildren(const LexerResult& tokens) const {
84 if (const Item* child = Children()[0])
89 for (const Item* item : Children()) {
98 void Item::CheckAmbiguity(const Item& other, const LexerResult& tokens) const {
117 LexerResult Lexer::RunLexer(const std::string& input) {
119 InputPosition const begin = input.c_str();
120 InputPosition const end = begin + input.size();
159 for (std::pair<const PatternFunction, Symbol>& pair : patterns_) {
173 const std::string& keyword = it->first;
187 const Item* RunEarleyAlgorithm(
188 Symbol* start, const LexerResult& tokens,
197 std::vector<const Item*> completed_items;
198 std::unordered_map<std::pair<size_t, Symbol*>, std::set<const Item*>,
202 std::vector<const Item*> debug_trace;
216 const Item& item = *insert_result.first;
229 for (const Item* parent : waiting[{item.start(), item.left()}]) {
275 const Item& last_item = *debug_trace.back();
305 bool Grammar::MatchString(const char* s, InputPosition* pos) {