How to use

append

method

in

ch.qos.logback.core.subst.Node

private Node E() throws ScanException {
 Node t = T();
 if (t == null) {
  return null;
 }
 Node eOpt = Eopt();
 if (eOpt != null) {
  t.append(eOpt);
 }
 return t;
}

private Node C() throws ScanException {
 Node e0 = E();
 Token t = peekAtCurentToken();
 if (isDefaultToken(t)) {
  advanceTokenPointer();
  Node literal = makeNewLiteralNode(CoreConstants.DEFAULT_VALUE_SEPARATOR);
  e0.append(literal);
  Node e1 = E();
  e0.append(e1);
 }
 return e0;
}

private Node T() throws ScanException {
 Token t = peekAtCurentToken();
 switch (t.type) {
  case LITERAL:
   advanceTokenPointer();
   return makeNewLiteralNode(t.payload);
  case CURLY_LEFT:
   advanceTokenPointer();
   Node innerNode = C();
   Token right = peekAtCurentToken();
   expectCurlyRight(right);
   advanceTokenPointer();
   Node curlyLeft = makeNewLiteralNode(CoreConstants.LEFT_ACCOLADE);
   curlyLeft.append(innerNode);
   curlyLeft.append(makeNewLiteralNode(CoreConstants.RIGHT_ACCOLADE));
   return curlyLeft;
  case START:
   advanceTokenPointer();
   Node v = V();
   Token w = peekAtCurentToken();
   expectCurlyRight(w);
   advanceTokenPointer();
   return v;
  default:
   return null;
 }
}

private Node E() throws ScanException {
 Node t = T();
 if (t == null) {
  return null;
 }
 Node eOpt = Eopt();
 if (eOpt != null) {
  t.append(eOpt);
 }
 return t;
}

private Node E() throws ScanException {
  Node t = T();
  if (t == null) {
    return null;
  }
  Node eOpt = Eopt();
  if (eOpt != null) {
    t.append(eOpt);
  }
  return t;
}

private Node E() throws ScanException {
 Node t = T();
 if (t == null) {
  return null;
 }
 Node eOpt = Eopt();
 if (eOpt != null) {
  t.append(eOpt);
 }
 return t;
}

private Node E() throws ScanException {
  Node t = T();
  if (t == null) {
    return null;
  }
  Node eOpt = Eopt();
  if (eOpt != null) {
    t.append(eOpt);
  }
  return t;
}

private Node E() throws ScanException {
  Node t = T();
  if (t == null) {
    return null;
  }
  Node eOpt = Eopt();
  if (eOpt != null) {
    t.append(eOpt);
  }
  return t;
}

private Node C() throws ScanException {
 Node e0 = E();
 Token t = peekAtCurentToken();
 if (isDefaultToken(t)) {
  advanceTokenPointer();
  Node literal = makeNewLiteralNode(CoreConstants.DEFAULT_VALUE_SEPARATOR);
  e0.append(literal);
  Node e1 = E();
  e0.append(e1);
 }
 return e0;
}

private Node C() throws ScanException {
 Node e0 = E();
 Token t = peekAtCurentToken();
 if (isDefaultToken(t)) {
  advanceTokenPointer();
  Node literal = makeNewLiteralNode(CoreConstants.DEFAULT_VALUE_SEPARATOR);
  e0.append(literal);
  Node e1 = E();
  e0.append(e1);
 }
 return e0;
}

private Node C() throws ScanException {
  Node e0 = E();
  Token t = peekAtCurentToken();
  if (isDefaultToken(t)) {
    advanceTokenPointer();
    Node literal = makeNewLiteralNode(CoreConstants.DEFAULT_VALUE_SEPARATOR);
    e0.append(literal);
    Node e1 = E();
    e0.append(e1);
  }
  return e0;
}

private Node C() throws ScanException {
  Node e0 = E();
  Token t = peekAtCurentToken();
  if (isDefaultToken(t)) {
    advanceTokenPointer();
    Node literal = makeNewLiteralNode(CoreConstants.DEFAULT_VALUE_SEPARATOR);
    e0.append(literal);
    Node e1 = E();
    e0.append(e1);
  }
  return e0;
}

private Node C() throws ScanException {
  Node e0 = E();
  Token t = peekAtCurentToken();
  if (isDefaultToken(t)) {
    advanceTokenPointer();
    Node literal = makeNewLiteralNode(CoreConstants.DEFAULT_VALUE_SEPARATOR);
    e0.append(literal);
    Node e1 = E();
    e0.append(e1);
  }
  return e0;
}

private Node T() throws ScanException {
  Token t = peekAtCurentToken();
  switch (t.type) {
  case LITERAL:
    advanceTokenPointer();
    return makeNewLiteralNode(t.payload);
  case CURLY_LEFT:
    advanceTokenPointer();
    Node innerNode = C();
    Token right = peekAtCurentToken();
    expectCurlyRight(right);
    advanceTokenPointer();
    Node curlyLeft = makeNewLiteralNode(CoreConstants.LEFT_ACCOLADE);
    curlyLeft.append(innerNode);
    curlyLeft.append(makeNewLiteralNode(CoreConstants.RIGHT_ACCOLADE));
    return curlyLeft;
  case START:
    advanceTokenPointer();
    Node v = V();
    Token w = peekAtCurentToken();
    expectCurlyRight(w);
    advanceTokenPointer();
    return v;
  default:
    return null;
  }
}

private Node T() throws ScanException {
 Token t = peekAtCurentToken();
 switch (t.type) {
  case LITERAL:
   advanceTokenPointer();
   return makeNewLiteralNode(t.payload);
  case CURLY_LEFT:
   advanceTokenPointer();
   Node innerNode = C();
   Token right = peekAtCurentToken();
   expectCurlyRight(right);
   advanceTokenPointer();
   Node curlyLeft = makeNewLiteralNode(CoreConstants.LEFT_ACCOLADE);
   curlyLeft.append(innerNode);
   curlyLeft.append(makeNewLiteralNode(CoreConstants.RIGHT_ACCOLADE));
   return curlyLeft;
  case START:
   advanceTokenPointer();
   Node v = V();
   Token w = peekAtCurentToken();
   expectCurlyRight(w);
   advanceTokenPointer();
   return v;
  default:
   return null;
 }
}

private Node T() throws ScanException {
  Token t = peekAtCurentToken();
  switch (t.type) {
  case LITERAL:
    advanceTokenPointer();
    return makeNewLiteralNode(t.payload);
  case CURLY_LEFT:
    advanceTokenPointer();
    Node innerNode = C();
    Token right = peekAtCurentToken();
    expectCurlyRight(right);
    advanceTokenPointer();
    Node curlyLeft = makeNewLiteralNode(CoreConstants.LEFT_ACCOLADE);
    curlyLeft.append(innerNode);
    curlyLeft.append(makeNewLiteralNode(CoreConstants.RIGHT_ACCOLADE));
    return curlyLeft;
  case START:
    advanceTokenPointer();
    Node v = V();
    Token w = peekAtCurentToken();
    expectCurlyRight(w);
    advanceTokenPointer();
    return v;
  default:
    return null;
  }
}

private Node T() throws ScanException {
  Token t = peekAtCurentToken();
  switch (t.type) {
  case LITERAL:
    advanceTokenPointer();
    return makeNewLiteralNode(t.payload);
  case CURLY_LEFT:
    advanceTokenPointer();
    Node innerNode = C();
    Token right = peekAtCurentToken();
    expectCurlyRight(right);
    advanceTokenPointer();
    Node curlyLeft = makeNewLiteralNode(CoreConstants.LEFT_ACCOLADE);
    curlyLeft.append(innerNode);
    curlyLeft.append(makeNewLiteralNode(CoreConstants.RIGHT_ACCOLADE));
    return curlyLeft;
  case START:
    advanceTokenPointer();
    Node v = V();
    Token w = peekAtCurentToken();
    expectCurlyRight(w);
    advanceTokenPointer();
    return v;
  default:
    return null;
  }
}

private Node T() throws ScanException {
 Token t = peekAtCurentToken();
 switch (t.type) {
  case LITERAL:
   advanceTokenPointer();
   return makeNewLiteralNode(t.payload);
  case CURLY_LEFT:
   advanceTokenPointer();
   Node innerNode = C();
   Token right = peekAtCurentToken();
   expectCurlyRight(right);
   advanceTokenPointer();
   Node curlyLeft = makeNewLiteralNode(CoreConstants.LEFT_ACCOLADE);
   curlyLeft.append(innerNode);
   curlyLeft.append(makeNewLiteralNode(CoreConstants.RIGHT_ACCOLADE));
   return curlyLeft;
  case START:
   advanceTokenPointer();
   Node v = V();
   Token w = peekAtCurentToken();
   expectCurlyRight(w);
   advanceTokenPointer();
   return v;
  default:
   return null;
 }
}