public void Infix29()
{
Console.WriteLine("Testing infix -> ");
BinaryTree ast = PrologTerm("ali :- 1 -> 2.");
Assert.AreEqual(":-", ast.Name);
Assert.AreEqual("ali", ast.Left.Name);
Assert.AreEqual("->", ast.Right.Name);
Assert.AreEqual("1", ast.Right.Left.Name);
Assert.AreEqual("2", ast.Right.Right.Name);
}