Package org.antlr.runtime.tree

Examples of org.antlr.runtime.tree.CommonTree.addChild()

54
55
56
57
58
59
60
61
62
63
64
        // stream has 7 real + 6 nav nodes
        // Sequence of types: 101 DN 102 DN 103 106 DN 107 UP UP 104 105 UP EOF
        Tree r0 = new CommonTree(new CommonToken(101));
        Tree r1 = new CommonTree(new CommonToken(102));
        r0.addChild(r1);
        r1.addChild(new CommonTree(new CommonToken(103)));
        Tree r2 = new CommonTree(new CommonToken(106));
        r2.addChild(new CommonTree(new CommonToken(107)));
        r1.addChild(r2);
        r0.addChild(new CommonTree(new CommonToken(104)));
        r0.addChild(new CommonTree(new CommonToken(105)));
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
        Tree r0 = new CommonTree(new CommonToken(101));
        Tree r1 = new CommonTree(new CommonToken(102));
        r0.addChild(r1);
        r1.addChild(new CommonTree(new CommonToken(103)));
        Tree r2 = new CommonTree(new CommonToken(106));
        r2.addChild(new CommonTree(new CommonToken(107)));
        r1.addChild(r2);
        r0.addChild(new CommonTree(new CommonToken(104)));
        r0.addChild(new CommonTree(new CommonToken(105)));

        TreeNodeStream stream = newStream(r0);
View Full Code Here
200
201
202
203
204
205
206
207
208
209
210
    newRoot.addChild(new CommonTree(new CommonToken(5)));

    CommonTree oldRoot = new CommonTree((Token)null);
    oldRoot.addChild(new CommonTree(new CommonToken(101)));
    oldRoot.addChild(new CommonTree(new CommonToken(102)));
    oldRoot.addChild(new CommonTree(new CommonToken(103)));

    TreeAdaptor adaptor = new CommonTreeAdaptor();
    adaptor.becomeRoot(newRoot, oldRoot);
    newRoot.sanityCheckParentAndChildIndexes();
  }
View Full Code Here
210
211
212
213
214
215
216
217
218
219
220
  }

  @Test public void testBecomeRoot5() throws Exception {
    // ^(nil 5) becomes new root of ^(101 102 103)
    CommonTree newRoot = new CommonTree((Token)null);
    newRoot.addChild(new CommonTree(new CommonToken(5)));

    CommonTree oldRoot = new CommonTree(new CommonToken(101));
    oldRoot.addChild(new CommonTree(new CommonToken(102)));
    oldRoot.addChild(new CommonTree(new CommonToken(103)));
View Full Code Here
213
214
215
216
217
218
219
220
221
222
223
    // ^(nil 5) becomes new root of ^(101 102 103)
    CommonTree newRoot = new CommonTree((Token)null);
    newRoot.addChild(new CommonTree(new CommonToken(5)));

    CommonTree oldRoot = new CommonTree(new CommonToken(101));
    oldRoot.addChild(new CommonTree(new CommonToken(102)));
    oldRoot.addChild(new CommonTree(new CommonToken(103)));

    TreeAdaptor adaptor = new CommonTreeAdaptor();
    adaptor.becomeRoot(newRoot, oldRoot);
    newRoot.sanityCheckParentAndChildIndexes();
View Full Code Here
214
215
216
217
218
219
220
221
222
223
224
    CommonTree newRoot = new CommonTree((Token)null);
    newRoot.addChild(new CommonTree(new CommonToken(5)));

    CommonTree oldRoot = new CommonTree(new CommonToken(101));
    oldRoot.addChild(new CommonTree(new CommonToken(102)));
    oldRoot.addChild(new CommonTree(new CommonToken(103)));

    TreeAdaptor adaptor = new CommonTreeAdaptor();
    adaptor.becomeRoot(newRoot, oldRoot);
    newRoot.sanityCheckParentAndChildIndexes();
  }
View Full Code Here
258
259
260
261
262
263
264
265
266
267
268
    t.sanityCheckParentAndChildIndexes();
  }

  @Test public void testReplaceInMiddle() throws Exception {
    CommonTree t = new CommonTree(new CommonToken(99, "a"));
    t.addChild(new CommonTree(new CommonToken(99, "b")));
    t.addChild(new CommonTree(new CommonToken(99, "c"))); // index 1
    t.addChild(new CommonTree(new CommonToken(99, "d")));

    CommonTree newChild = new CommonTree(new CommonToken(99,"x"));
    t.replaceChildren(1, 1, newChild);
View Full Code Here
259
260
261
262
263
264
265
266
267
268
269
  }

  @Test public void testReplaceInMiddle() throws Exception {
    CommonTree t = new CommonTree(new CommonToken(99, "a"));
    t.addChild(new CommonTree(new CommonToken(99, "b")));
    t.addChild(new CommonTree(new CommonToken(99, "c"))); // index 1
    t.addChild(new CommonTree(new CommonToken(99, "d")));

    CommonTree newChild = new CommonTree(new CommonToken(99,"x"));
    t.replaceChildren(1, 1, newChild);
    String expecting = "(a b x d)";
View Full Code Here
260
261
262
263
264
265
266
267
268
269
270
  @Test public void testReplaceInMiddle() throws Exception {
    CommonTree t = new CommonTree(new CommonToken(99, "a"));
    t.addChild(new CommonTree(new CommonToken(99, "b")));
    t.addChild(new CommonTree(new CommonToken(99, "c"))); // index 1
    t.addChild(new CommonTree(new CommonToken(99, "d")));

    CommonTree newChild = new CommonTree(new CommonToken(99,"x"));
    t.replaceChildren(1, 1, newChild);
    String expecting = "(a b x d)";
    assertEquals(expecting, t.toStringTree());
View Full Code Here
271
272
273
274
275
276
277
278
279
280
281
    t.sanityCheckParentAndChildIndexes();
  }

  @Test public void testReplaceAtLeft() throws Exception {
    CommonTree t = new CommonTree(new CommonToken(99, "a"));
    t.addChild(new CommonTree(new CommonToken(99, "b"))); // index 0
    t.addChild(new CommonTree(new CommonToken(99, "c")));
    t.addChild(new CommonTree(new CommonToken(99, "d")));

    CommonTree newChild = new CommonTree(new CommonToken(99,"x"));
    t.replaceChildren(0, 0, newChild);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.