Package org.antlr.runtime.tree

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

388
389
390
391
392
393
394
395
396
397
398
  }

  @Test public void testReplaceAllWithTwo() 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")));
    t.addChild(new CommonTree(new CommonToken(99, "d")));

    CommonTree newChildren = (CommonTree)adaptor.nil();
    newChildren.addChild(new CommonTree(new CommonToken(99,"x")));
    newChildren.addChild(new CommonTree(new CommonToken(99,"y")));
View Full Code Here
389
390
391
392
393
394
395
396
397
398
399
  @Test public void testReplaceAllWithTwo() 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")));
    t.addChild(new CommonTree(new CommonToken(99, "d")));

    CommonTree newChildren = (CommonTree)adaptor.nil();
    newChildren.addChild(new CommonTree(new CommonToken(99,"x")));
    newChildren.addChild(new CommonTree(new CommonToken(99,"y")));
View Full Code Here
392
393
394
395
396
397
398
399
400
401
402
    t.addChild(new CommonTree(new CommonToken(99, "b")));
    t.addChild(new CommonTree(new CommonToken(99, "c")));
    t.addChild(new CommonTree(new CommonToken(99, "d")));

    CommonTree newChildren = (CommonTree)adaptor.nil();
    newChildren.addChild(new CommonTree(new CommonToken(99,"x")));
    newChildren.addChild(new CommonTree(new CommonToken(99,"y")));

    t.replaceChildren(0, 2, newChildren);
    String expecting = "(a x y)";
    assertEquals(expecting, t.toStringTree());
View Full Code Here
393
394
395
396
397
398
399
400
401
402
403
    t.addChild(new CommonTree(new CommonToken(99, "c")));
    t.addChild(new CommonTree(new CommonToken(99, "d")));

    CommonTree newChildren = (CommonTree)adaptor.nil();
    newChildren.addChild(new CommonTree(new CommonToken(99,"x")));
    newChildren.addChild(new CommonTree(new CommonToken(99,"y")));

    t.replaceChildren(0, 2, newChildren);
    String expecting = "(a x y)";
    assertEquals(expecting, t.toStringTree());
    t.sanityCheckParentAndChildIndexes();
View Full Code Here
69
70
71
72
73
74
75
76
77
78
79
  }

  @Test public void test4Nodes() throws Exception {
    // ^(101 ^(102 103) 104)
    CommonTree r0 = new CommonTree(new CommonToken(101));
    r0.addChild(new CommonTree(new CommonToken(102)));
    r0.getChild(0).addChild(new CommonTree(new CommonToken(103)));
    r0.addChild(new CommonTree(new CommonToken(104)));

    assertNull(r0.parent);
    assertEquals(-1, r0.childIndex);
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
  @Test public void test4Nodes() throws Exception {
    // ^(101 ^(102 103) 104)
    CommonTree r0 = new CommonTree(new CommonToken(101));
    r0.addChild(new CommonTree(new CommonToken(102)));
    r0.getChild(0).addChild(new CommonTree(new CommonToken(103)));
    r0.addChild(new CommonTree(new CommonToken(104)));

    assertNull(r0.parent);
    assertEquals(-1, r0.childIndex);
  }
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
  @Test public void testAddListToExistChildren() throws Exception {
    // Add child ^(nil 101 102 103) to root ^(5 6)
    // should add 101 102 103 to end of 5's child list
    CommonTree root = new CommonTree(new CommonToken(5));
    root.addChild(new CommonTree(new CommonToken(6)));

    // child tree
    CommonTree r0 = new CommonTree((Token)null);
    CommonTree c0, c1, c2;
    r0.addChild(c0=new CommonTree(new CommonToken(101)));
View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
  @Test public void testDupTree() throws Exception {
    // ^(101 ^(102 103 ^(106 107) ) 104 105)
    CommonTree r0 = new CommonTree(new CommonToken(101));
    CommonTree 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
153
154
155
156
157
158
159
160
161
162
163
    CommonTree r0 = new CommonTree(new CommonToken(101));
    CommonTree 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)));

    CommonTree dup = (CommonTree)(new CommonTreeAdaptor()).dupTree(r0);
View Full Code Here
170
171
172
173
174
175
176
177
178
179
180
  @Test public void testBecomeRoot() throws Exception {
    // 5 becomes new root of ^(nil 101 102 103)
    CommonTree newRoot = 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);
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.