lbug 0.16.0

An in-process property graph database management system built for query speed and scalability
Documentation 
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
66

/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
 * Use of this file is governed by the BSD 3-clause license that
 * can be found in the LICENSE.txt file in the project root.
 */

#include "support/CPPUtils.h"
#include "support/Casts.h"

#include "tree/ParseTreeListener.h"
#include "tree/ParseTree.h"
#include "tree/ErrorNode.h"

#include "IterativeParseTreeWalker.h"

using namespace antlr4::tree;
using namespace antlrcpp;

void IterativeParseTreeWalker::walk(ParseTreeListener *listener, ParseTree *t) const {
  std::vector<std::pair<ParseTree*, size_t>> stack;
  ParseTree *currentNode = t;
  size_t currentIndex = 0;

  while (currentNode != nullptr) {
    // pre-order visit
    if (ErrorNode::is(*currentNode)) {
      listener->visitErrorNode(downCast<ErrorNode*>(currentNode));
    } else if (TerminalNode::is(*currentNode)) {
      listener->visitTerminal(downCast<TerminalNode*>(currentNode));
    } else {
      enterRule(listener, currentNode);
    }

    // Move down to first child, if it exists.
    if (!currentNode->children.empty()) {
      stack.push_back(std::make_pair(currentNode, currentIndex));
      currentIndex = 0;
      currentNode = currentNode->children[0];
      continue;
    }

    // No child nodes, so walk tree.
    do {
      // post-order visit
      if (!TerminalNode::is(*currentNode)) {
        exitRule(listener, currentNode);
      }

      // No parent, so no siblings.
      if (stack.empty()) {
        currentNode = nullptr;
        currentIndex = 0;
        break;
      }

      // Move to next sibling if possible.
      if (stack.back().first->children.size() > ++currentIndex) {
        currentNode = stack.back().first->children[currentIndex];
        break;
      }

      // No next sibling, so move up.
      std::tie(currentNode, currentIndex) = stack.back();
      stack.pop_back();
    } while (currentNode != nullptr);
  }
}