public void testPushPopFromEOF()
{
// ^(101 ^(102 103) ^(104 105) ^(106 107) 108 109)
// stream has 9 real + 8 nav nodes
// Sequence of types: 101 DN 102 DN 103 UP 104 DN 105 UP 106 DN 107 UP 108 109 UP
ITree r0 = new CommonTree(new CommonToken(101));
ITree r1 = new CommonTree(new CommonToken(102));
r1.AddChild(new CommonTree(new CommonToken(103)));
r0.AddChild(r1);
ITree r2 = new CommonTree(new CommonToken(104));
r2.AddChild(new CommonTree(new CommonToken(105)));
r0.AddChild(r2);
ITree r3 = new CommonTree(new CommonToken(106));
r3.AddChild(new CommonTree(new CommonToken(107)));
r0.AddChild(r3);
r0.AddChild(new CommonTree(new CommonToken(108)));
r0.AddChild(new CommonTree(new CommonToken(109)));
CommonTreeNodeStream stream = new CommonTreeNodeStream(r0);
while (stream.LA(1) != Token.EOF)
{
stream.Consume();
}
int indexOf102 = 2;
int indexOf104 = 6;
Assert.AreEqual(Token.EOF, ((ITree)stream.LT(1)).Type);
// CALL 102
stream.Push(indexOf102);
Assert.AreEqual(102, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 102
Assert.AreEqual(Token.DOWN, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume DN
Assert.AreEqual(103, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 103
Assert.AreEqual(Token.UP, ((ITree)stream.LT(1)).Type);
// RETURN (to empty stack)
stream.Pop();
Assert.AreEqual(Token.EOF, ((ITree)stream.LT(1)).Type);
// CALL 104
stream.Push(indexOf104);
Assert.AreEqual(104, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 102
Assert.AreEqual(Token.DOWN, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume DN
Assert.AreEqual(105, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 103
Assert.AreEqual(Token.UP, ((ITree)stream.LT(1)).Type);
// RETURN (to empty stack)
stream.Pop();
Assert.AreEqual(Token.EOF, ((ITree)stream.LT(1)).Type);
}
public void testStackStretch()
{
// make more than INITIAL_CALL_STACK_SIZE pushes
ITree r0 = new CommonTree(new CommonToken(101));
CommonTreeNodeStream stream = new CommonTreeNodeStream(r0);
// go 1 over initial size
for (int i = 1; i <= CommonTreeNodeStream.INITIAL_CALL_STACK_SIZE + 1; i++)
{
stream.Push(i);
}
Assert.AreEqual(10, stream.Pop());
Assert.AreEqual(9, stream.Pop());
}
public void testPushPop()
{
// ^(101 ^(102 103) ^(104 105) ^(106 107) 108 109)
// stream has 9 real + 8 nav nodes
// Sequence of types: 101 DN 102 DN 103 UP 104 DN 105 UP 106 DN 107 UP 108 109 UP
ITree r0 = new CommonTree(new CommonToken(101));
ITree r1 = new CommonTree(new CommonToken(102));
r1.AddChild(new CommonTree(new CommonToken(103)));
r0.AddChild(r1);
ITree r2 = new CommonTree(new CommonToken(104));
r2.AddChild(new CommonTree(new CommonToken(105)));
r0.AddChild(r2);
ITree r3 = new CommonTree(new CommonToken(106));
r3.AddChild(new CommonTree(new CommonToken(107)));
r0.AddChild(r3);
r0.AddChild(new CommonTree(new CommonToken(108)));
r0.AddChild(new CommonTree(new CommonToken(109)));
CommonTreeNodeStream stream = new CommonTreeNodeStream(r0);
String expecting = " 101 2 102 2 103 3 104 2 105 3 106 2 107 3 108 109 3";
String found = stream.ToString();
Assert.AreEqual(expecting, found);
// Assume we want to hit node 107 and then "call 102" then return
int indexOf102 = 2;
int indexOf107 = 12;
for (int k = 1; k <= indexOf107; k++)
{ // consume til 107 node
stream.Consume();
}
// CALL 102
Assert.AreEqual(107, ((ITree)stream.LT(1)).Type);
stream.Push(indexOf102);
Assert.AreEqual(102, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 102
Assert.AreEqual(Token.DOWN, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume DN
Assert.AreEqual(103, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 103
Assert.AreEqual(Token.UP, ((ITree)stream.LT(1)).Type);
// RETURN
stream.Pop();
Assert.AreEqual(107, ((ITree)stream.LT(1)).Type);
}
public void testStackStretch()
{
// make more than INITIAL_CALL_STACK_SIZE pushes
ITree r0 = new CommonTree(new CommonToken(101));
CommonTreeNodeStream stream = new CommonTreeNodeStream(r0);
// go 1 over initial size
for (int i = 1; i <= CommonTreeNodeStream.INITIAL_CALL_STACK_SIZE + 1; i++)
{
stream.Push(i);
}
Assert.AreEqual(10, stream.Pop());
Assert.AreEqual(9, stream.Pop());
}
public void testPushPopFromEOF()
{
// ^(101 ^(102 103) ^(104 105) ^(106 107) 108 109)
// stream has 9 real + 8 nav nodes
// Sequence of types: 101 DN 102 DN 103 UP 104 DN 105 UP 106 DN 107 UP 108 109 UP
ITree r0 = new CommonTree(new CommonToken(101));
ITree r1 = new CommonTree(new CommonToken(102));
r1.AddChild(new CommonTree(new CommonToken(103)));
r0.AddChild(r1);
ITree r2 = new CommonTree(new CommonToken(104));
r2.AddChild(new CommonTree(new CommonToken(105)));
r0.AddChild(r2);
ITree r3 = new CommonTree(new CommonToken(106));
r3.AddChild(new CommonTree(new CommonToken(107)));
r0.AddChild(r3);
r0.AddChild(new CommonTree(new CommonToken(108)));
r0.AddChild(new CommonTree(new CommonToken(109)));
CommonTreeNodeStream stream = new CommonTreeNodeStream(r0);
while (stream.LA(1) != Token.EOF)
{
stream.Consume();
}
int indexOf102 = 2;
int indexOf104 = 6;
Assert.AreEqual(Token.EOF, ((ITree)stream.LT(1)).Type);
// CALL 102
stream.Push(indexOf102);
Assert.AreEqual(102, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 102
Assert.AreEqual(Token.DOWN, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume DN
Assert.AreEqual(103, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 103
Assert.AreEqual(Token.UP, ((ITree)stream.LT(1)).Type);
// RETURN (to empty stack)
stream.Pop();
Assert.AreEqual(Token.EOF, ((ITree)stream.LT(1)).Type);
// CALL 104
stream.Push(indexOf104);
Assert.AreEqual(104, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 102
Assert.AreEqual(Token.DOWN, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume DN
Assert.AreEqual(105, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 103
Assert.AreEqual(Token.UP, ((ITree)stream.LT(1)).Type);
// RETURN (to empty stack)
stream.Pop();
Assert.AreEqual(Token.EOF, ((ITree)stream.LT(1)).Type);
}
public void testNestedPushPop()
{
// ^(101 ^(102 103) ^(104 105) ^(106 107) 108 109)
// stream has 9 real + 8 nav nodes
// Sequence of types: 101 DN 102 DN 103 UP 104 DN 105 UP 106 DN 107 UP 108 109 UP
ITree r0 = new CommonTree(new CommonToken(101));
ITree r1 = new CommonTree(new CommonToken(102));
r1.AddChild(new CommonTree(new CommonToken(103)));
r0.AddChild(r1);
ITree r2 = new CommonTree(new CommonToken(104));
r2.AddChild(new CommonTree(new CommonToken(105)));
r0.AddChild(r2);
ITree r3 = new CommonTree(new CommonToken(106));
r3.AddChild(new CommonTree(new CommonToken(107)));
r0.AddChild(r3);
r0.AddChild(new CommonTree(new CommonToken(108)));
r0.AddChild(new CommonTree(new CommonToken(109)));
CommonTreeNodeStream stream = new CommonTreeNodeStream(r0);
// Assume we want to hit node 107 and then "call 102", which
// calls 104, then return
int indexOf102 = 2;
int indexOf107 = 12;
for (int k = 1; k <= indexOf107; k++)
{ // consume til 107 node
stream.Consume();
}
Assert.AreEqual(107, ((ITree)stream.LT(1)).Type);
// CALL 102
stream.Push(indexOf102);
Assert.AreEqual(102, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 102
Assert.AreEqual(Token.DOWN, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume DN
Assert.AreEqual(103, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 103
// CALL 104
int indexOf104 = 6;
stream.Push(indexOf104);
Assert.AreEqual(104, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 102
Assert.AreEqual(Token.DOWN, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume DN
Assert.AreEqual(105, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 103
Assert.AreEqual(Token.UP, ((ITree)stream.LT(1)).Type);
// RETURN (to UP node in 102 subtree)
stream.Pop();
Assert.AreEqual(Token.UP, ((ITree)stream.LT(1)).Type);
// RETURN (to empty stack)
stream.Pop();
Assert.AreEqual(107, ((ITree)stream.LT(1)).Type);
}
public void testPushPop()
{
// ^(101 ^(102 103) ^(104 105) ^(106 107) 108 109)
// stream has 9 real + 8 nav nodes
// Sequence of types: 101 DN 102 DN 103 UP 104 DN 105 UP 106 DN 107 UP 108 109 UP
ITree r0 = new CommonTree(new CommonToken(101));
ITree r1 = new CommonTree(new CommonToken(102));
r1.AddChild(new CommonTree(new CommonToken(103)));
r0.AddChild(r1);
ITree r2 = new CommonTree(new CommonToken(104));
r2.AddChild(new CommonTree(new CommonToken(105)));
r0.AddChild(r2);
ITree r3 = new CommonTree(new CommonToken(106));
r3.AddChild(new CommonTree(new CommonToken(107)));
r0.AddChild(r3);
r0.AddChild(new CommonTree(new CommonToken(108)));
r0.AddChild(new CommonTree(new CommonToken(109)));
CommonTreeNodeStream stream = new CommonTreeNodeStream(r0);
String expecting = " 101 2 102 2 103 3 104 2 105 3 106 2 107 3 108 109 3";
String found = stream.ToString();
Assert.AreEqual(expecting, found);
// Assume we want to hit node 107 and then "call 102" then return
int indexOf102 = 2;
int indexOf107 = 12;
for (int k = 1; k <= indexOf107; k++)
{ // consume til 107 node
stream.Consume();
}
// CALL 102
Assert.AreEqual(107, ((ITree)stream.LT(1)).Type);
stream.Push(indexOf102);
Assert.AreEqual(102, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 102
Assert.AreEqual(Token.DOWN, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume DN
Assert.AreEqual(103, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 103
Assert.AreEqual(Token.UP, ((ITree)stream.LT(1)).Type);
// RETURN
stream.Pop();
Assert.AreEqual(107, ((ITree)stream.LT(1)).Type);
}
public void testNestedPushPop()
{
// ^(101 ^(102 103) ^(104 105) ^(106 107) 108 109)
// stream has 9 real + 8 nav nodes
// Sequence of types: 101 DN 102 DN 103 UP 104 DN 105 UP 106 DN 107 UP 108 109 UP
ITree r0 = new CommonTree(new CommonToken(101));
ITree r1 = new CommonTree(new CommonToken(102));
r1.AddChild(new CommonTree(new CommonToken(103)));
r0.AddChild(r1);
ITree r2 = new CommonTree(new CommonToken(104));
r2.AddChild(new CommonTree(new CommonToken(105)));
r0.AddChild(r2);
ITree r3 = new CommonTree(new CommonToken(106));
r3.AddChild(new CommonTree(new CommonToken(107)));
r0.AddChild(r3);
r0.AddChild(new CommonTree(new CommonToken(108)));
r0.AddChild(new CommonTree(new CommonToken(109)));
CommonTreeNodeStream stream = new CommonTreeNodeStream(r0);
// Assume we want to hit node 107 and then "call 102", which
// calls 104, then return
int indexOf102 = 2;
int indexOf107 = 12;
for (int k = 1; k <= indexOf107; k++)
{ // consume til 107 node
stream.Consume();
}
Assert.AreEqual(107, ((ITree)stream.LT(1)).Type);
// CALL 102
stream.Push(indexOf102);
Assert.AreEqual(102, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 102
Assert.AreEqual(Token.DOWN, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume DN
Assert.AreEqual(103, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 103
// CALL 104
int indexOf104 = 6;
stream.Push(indexOf104);
Assert.AreEqual(104, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 102
Assert.AreEqual(Token.DOWN, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume DN
Assert.AreEqual(105, ((ITree)stream.LT(1)).Type);
stream.Consume(); // consume 103
Assert.AreEqual(Token.UP, ((ITree)stream.LT(1)).Type);
// RETURN (to UP node in 102 subtree)
stream.Pop();
Assert.AreEqual(Token.UP, ((ITree)stream.LT(1)).Type);
// RETURN (to empty stack)
stream.Pop();
Assert.AreEqual(107, ((ITree)stream.LT(1)).Type);
}
