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

/* 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 "misc/Interval.h"
#include "Token.h"
#include "RuleContext.h"
#include "tree/ParseTreeVisitor.h"

#include "tree/ErrorNodeImpl.h"

using namespace antlr4;
using namespace antlr4::tree;

Token* ErrorNodeImpl::getSymbol() const {
  return symbol;
}

void ErrorNodeImpl::setParent(RuleContext *parent_) {
  this->parent = parent_;
}

misc::Interval ErrorNodeImpl::getSourceInterval() {
  if (symbol == nullptr) {
    return misc::Interval::INVALID;
  }

  size_t tokenIndex = symbol->getTokenIndex();
  return misc::Interval(tokenIndex, tokenIndex);
}

std::any ErrorNodeImpl::accept(ParseTreeVisitor *visitor) {
  return visitor->visitErrorNode(this);
}

std::string ErrorNodeImpl::getText() {
  return symbol->getText();
}

std::string ErrorNodeImpl::toStringTree(Parser * /*parser*/, bool /*pretty*/) {
  return toString();
}

std::string ErrorNodeImpl::toString() {
  if (symbol->getType() == Token::EOF) {
    return "<EOF>";
  }
  return symbol->getText();
}

std::string ErrorNodeImpl::toStringTree(bool /*pretty*/) {
  return toString();
}