Lines Matching full:102
73 /// Test a tree with four nodes - ^(101 ^(102 103) 104)
78 t.AddChild(new CommonTree(new CommonToken(102)));
83 string expected = " 101 102 103 104";
87 expected = " 101 2 102 2 103 3 104 3";
98 t.AddChild(new CommonTree(new CommonToken(102)));
108 string expected = " 101 102 103 104 105";
112 expected = " 101 2 102 2 103 3 104 3 105";
123 root.AddChild(new CommonTree(new CommonToken(102)));
127 string expected = " 101 102 103";
131 expected = " 101 102 103";
157 t.AddChild(new CommonTree(new CommonToken(102)));
160 string expected = " 101 102";
164 expected = " 101 2 102 3";
172 // ^(101 ^(102 103) 104)
174 t.AddChild(new CommonTree(new CommonToken(102)));
181 Assert.AreEqual(102, ((ITree)stream.LT(3)).Type);
195 // ^(101 ^(102 103 ^(106 107) ) 104 105)
197 // Sequence of types: 101 DN 102 DN 103 106 DN 107 Up Up 104 105 Up EndOfFile
199 ITree r1 = new CommonTree(new CommonToken(102));
232 // ^(101 ^(102 103 ^(106 107) ) 104 105)
234 // Sequence of types: 101 DN 102 DN 103 106 DN 107 Up Up 104 105 Up EndOfFile
236 ITree r1 = new CommonTree(new CommonToken(102));
279 // ^(101 ^(102 103 ^(106 107) ) 104 105)
281 // Sequence of types: 101 DN 102 DN 103 106 DN 107 Up Up 104 105 Up EndOfFile
283 ITree r1 = new CommonTree(new CommonToken(102));
296 int m2 = stream.Mark(); // MARK on 102
297 stream.Consume(); // consume 102
301 stream.Rewind(m2); // REWIND to 102
302 Assert.AreEqual(102, ((ITree)stream.LT(1)).Type);
312 Assert.AreEqual(102, ((ITree)stream.LT(1)).Type);
320 // ^(101 ^(102 103 ^(106 107) ) 104 105)
322 // Sequence of types: 101 DN 102 DN 103 106 DN 107 Up Up 104 105 Up EndOfFile
324 ITree r1 = new CommonTree(new CommonToken(102));
336 stream.Consume(); // consume 102
348 // ^(101 ^(102 103 ^(106 107) ) 104 105)
350 // Sequence of types: 101 DN 102 DN 103 106 DN 107 Up Up 104 105 Up EndOfFile
352 ITree r1 = new CommonTree(new CommonToken(102));
373 // ^(101 ^(102 103) ^(104 105) ^(106 107) 108 109)
375 // Sequence of types: 101 DN 102 DN 103 Up 104 DN 105 Up 106 DN 107 Up 108 109 Up
377 ITree r1 = new CommonTree(new CommonToken(102));
390 String expecting = " 101 2 102 2 103 3 104 2 105 3 106 2 107 3 108 109 3";
394 // Assume we want to hit node 107 and then "call 102" then return
402 // CALL 102
405 Assert.AreEqual(102, ((ITree)stream.LT(1)).Type);
406 stream.Consume(); // consume 102
420 // ^(101 ^(102 103) ^(104 105) ^(106 107) 108 109)
422 // Sequence of types: 101 DN 102 DN 103 Up 104 DN 105 Up 106 DN 107 Up 108 109 Up
424 ITree r1 = new CommonTree(new CommonToken(102));
438 // Assume we want to hit node 107 and then "call 102", which
448 // CALL 102
450 Assert.AreEqual(102, ((ITree)stream.LT(1)).Type);
451 stream.Consume(); // consume 102
461 stream.Consume(); // consume 102
467 // RETURN (to Up node in 102 subtree)
479 // ^(101 ^(102 103) ^(104 105) ^(106 107) 108 109)
481 // Sequence of types: 101 DN 102 DN 103 Up 104 DN 105 Up 106 DN 107 Up 108 109 Up
483 ITree r1 = new CommonTree(new CommonToken(102));
505 // CALL 102
507 Assert.AreEqual(102, ((ITree)stream.LT(1)).Type);
508 stream.Consume(); // consume 102
521 stream.Consume(); // consume 102
557 // make ^(101 102 ... n)
565 t.AddChild(new CommonTree(new CommonToken(102 + i)));
567 buf.Append(102 + i);
569 buf2.Append(102 + i);
