/// <summary>
/// Parse the tokens and create a tree /*(mainly for operators)**/
/// </summary>
protected ktList MakeATree(ktList List, bool FirstRun, bool ThirdRun)
{
//ktDebug.Log( "MAT!" + List.Get_R( "\t", true ));
ktList Tree = new ktList(), Prev = null, Next = null, Temp = null, Temp2 = null;
ktToken Token = null, PrevToken = null;
/*/ If the list are the "root"
if (List == m_LineStack) {
Tree.Node = new ktNode( "ktTBlock", new ktToken( ktTokenType.Block, "", 0, 0 ) );
} else/**/
{
Tree.Node = List.Node;
}
List.Reset();
foreach (ktList L in List)
{
//ktDebug.Log( "\nLLL: "+ List.Get_R() /*+ " :" +L.Export() */);
if ((L.Node != null) && (L.Node.Value != null))
{
Token = (ktToken)L.Node.Value;
Prev = Tree.Last;
if ((Prev != null) && (Prev.Node != null) && (Prev.Node.Value != null))
{
PrevToken = (ktToken)Prev.Node.Value;
}
else
{
PrevToken = new ktToken(ktTokenType.NULLTOKEN, ":null", 0, 0);
}
}
else
{
continue;
}
//#if ParseDebug
ktDebug.Log( "TT:" + Token.Type.ToString() + "(" + Token.Value + ")" );
ktDebug.Log( "PTT:" + PrevToken.Type.ToString() + "(" + PrevToken.Value + ")" );
//#endif
if ((FirstRun) && (
((PrevToken.Type == ktTokenType.Const) || (PrevToken.Type == ktTokenType.Hard)) ||
((Token.Type == ktTokenType.Const) || (Token.Type == ktTokenType.Hard)) ||
((PrevToken.Type == ktTokenType.VarStatement) && (
(Token.Type != ktTokenType.AssignmentOperator)/* ||
(Token.Type != ktTokenType.)*/
)
)))
{
//ktDebug.Log( "CONSTCONSTCONSTCONSTCONSTCONSTCONSTCONSTCONST" );
if (PrevToken.Type == ktTokenType.VarStatement)
{
if ((Token.Type != ktTokenType.Id) && (Token.Type != ktTokenType.Hard) &&
(Token.Type != ktTokenType.Const))
{
throw new ktError("Unexpected " + Token.Name + " on line " + Token.LineNo.ToString() +
" by character " + Token.CharPos.ToString() + "!", ktERR.UNEXP);
}
Prev.Add(Token);
}
else
{
Temp = new ktList();
Temp.Node = new ktNode("ktTVarStatement", new ktToken(ktTokenType.VarStatement, "", Token.LineNo, Token.CharPos));
Temp.Add(Token);
// Temp.AddList( MakeATree( L, FirstRun ) );
Tree.AddList(Temp);
}
}
else if (
(
((PrevToken.Type == ktTokenType.Id) && (ThirdRun)) ||
((/*!*/FirstRun) && (
(PrevToken.Type == ktTokenType.CompStatement) &&
(
(PrevToken.Value == ".") ||
(PrevToken.Value == "::")
)
)
)) && (
(Token.Type == ktTokenType.List) ||
(Token.Type == ktTokenType.Statement) ||
// (Token.Type == ktTokenType.CompStatement) ||
(Token.Type == ktTokenType.Const) ||
(Token.Type == ktTokenType.Hard) ||
(Token.Type == ktTokenType.String) ||
(Token.Type == ktTokenType.Boolean) ||
(Token.Type == ktTokenType.Number) ||
(Token.Type == ktTokenType.Float) ||
(Token.Type == ktTokenType.Null) ||
(Token.Type == ktTokenType.Id) // ?? Not shure on how this actually will work!?
))
{
ktDebug.Log("Tree:" + Tree.Get_R());
Tree.Pop(false);
/* ktDebug.Log("TToxen:" + Token.ToString());
ktDebug.Log("PToxen:" + PrevToken.ToString());*/
if ( (PrevToken.Value == ".") ) {
if (Token.Type == ktTokenType.List)
{
Temp = MakeATree(L, FirstRun, ThirdRun);
Prev.Last.AddList(Temp);
}
else
{
Prev.Last.AddList(new ktList(L));
}
((ktToken)Prev.Node.Value).Value = "§";
Tree.AddList(Prev);
//((ktToken)Tree.Node.Value).Value = "§";
ktDebug.Log("Tree:" + Tree.Get_R());
}
else if ((Prev.Prev == null) || ((Prev.Prev.Node != null) && (Prev.Prev.Node.Value != null) && (((ktToken)Prev.Prev.Node.Value).Type != ktTokenType.Id)))
{
Temp = new ktList();
Temp.Node = new ktNode("ktCompStatement", new ktToken(ktTokenType.CompStatement, "F", PrevToken.LineNo, PrevToken.CharPos));
if (Token.Type == ktTokenType.List)
{
Temp2 = MakeATree(L, FirstRun, ThirdRun);
//Temp2.Node.Value = Token;
Temp.AddList(Prev); // Add function name
Temp.AddList(Temp2); // Add arguments
#if ParseDebug
ktDebug.Log("FComp_List:\n" + Temp.Get_R());
ktDebug.Log("FComp_List T2:\n" + Temp2.Get_R());
#endif
}
else
{
Temp.AddList(Prev); // Add function name
Temp.AddList(new ktList(L)); // Add argument
#if ParseDebug
ktDebug.Log("FComp_NoList:\n" + Temp.Get_R());
#endif
}
Tree.AddList(Temp);
#if ParseDebug
ktDebug.Log("FComp Tree:\n" + Tree.Get_R());
#endif
}
else
{
Temp = new ktList();
Temp.Node = new ktNode("ktTCompStatement", new ktToken(ktTokenType.CompStatement, "§", PrevToken.LineNo, PrevToken.CharPos));
//ktDebug.Log("§§§§§§§§§§§§§§§§§§§§§§§§§§§");
if (Token.Type == ktTokenType.List)
{
Temp2 = new ktList();
Temp2.Node = new ktNode("ktTCompStatement", new ktToken(ktTokenType.CompStatement, ".", PrevToken.LineNo, PrevToken.CharPos));
Temp2.AddList(Prev.Last); // Add Method
Temp2.AddList(MakeATree(L, FirstRun, ThirdRun)); // Add Arguments
Temp.AddList(Prev.First); // Add object
Temp.AddList(Temp2); // Add Method call
Tree.AddList(Temp);
#if Debug
ktDebug.Log("L_Temp2:\n" + Temp2.Get_R());
ktDebug.Log("L_Temp:\n" + Temp.Get_R());
ktDebug.Log("L_Tree:\n" + Tree.Get_R());
#endif
}
else
{
//Temp.AddList(Prev);
//Temp.AddList(MakeATree(L, FirstRun, ThirdRun));
Prev.AddList(MakeATree(L, FirstRun, ThirdRun));
/* ktDebug.Log("Temp:" + Temp.Get_R());
ktDebug.Log("Prev:" + Prev.Get_R());*/
// Tree.AddList(Temp);
Tree.AddList(Prev);
//ktDebug.Log("Tree:" + Tree.Get_R());
}
}
}
else if (
(ThirdRun) &&
(
(PrevToken.Type == ktTokenType.Id) ||
(PrevToken.Type == ktTokenType.CompStatement)
) &&
(Token.Type == ktTokenType.CompStatement)
)
{
#if ParseDebug2
ktDebug.Log( "PREV:"+ PrevToken.Value );
ktDebug.Log( "LLLL:"+ L.Get_R() );
ktDebug.Log( "NNN:"+ ((Next == null) ? "nulL" : Next.Get_R().ToString()) );
#endif
Tree.Remove((uint)(Tree.Count - 1));
Temp = new ktList();
Temp.Node = new ktNode("ktTCompStatement", new ktToken(ktTokenType.CompStatement, "$", PrevToken.LineNo, PrevToken.CharPos));
Temp.AddList(Prev);
Tree.AddList(new ktList(L));
Tree.AddList(Temp);
}
else if ((Token.Type == ktTokenType.Line) ||
(Token.Type == ktTokenType.List) ||
(Token.Type == ktTokenType.Statement) ||
(Token.Type == ktTokenType.RunStatement) /*||
(Token.Type == ktTokenType.New)*/)
{
#if ParseDebug2
ktDebug.Log( "\nMAT::MAT::MAT::MAT::MAT::MAT::MAT::MAT::\n" +L.Get_R() );
#endif
/*if ((!FirstRun) && (PrevToken != null) && (
(PrevToken.Type == ktTokenType.Id) ||
(PrevToken.Type == ktTokenType.CompStatement) ||
(PrevToken.Type == ktTokenType.Statement))) {
Tree.Remove( (uint)(Tree.Count - 1) );
Temp = new ktList( );
Temp.Node = new ktNode( "ktTCompStatement", new ktToken( ktTokenType.CompStatement, Token.Value, Token.LineNo, Token.CharPos ) );
Temp.AddList( Prev );
Temp.AddList( MakeATree( L, FirstRun ) );
Tree.AddList( Temp );
} else {*/
Tree.AddList(MakeATree(L, FirstRun, ThirdRun));
/*}*/
}
else if ((Token.Type == ktTokenType.Separator) && FirstRun)
{
Prev = L.Prev;
Next = L.Next;
// Tree.Remove( (uint)(Tree.Count - 1) );
if ((Next != null) && (Next.Node != null) && (Next.Node.Value != null) &&
(Token.Value == ":") &&
(((ktToken)Next.Node.Value).Type == ktTokenType.Null))
{
Token = (ktToken)Next.Node.Value;
Token.Value = ":null";
Tree.Add("ktTNull", Token);
List.MoveNext();
List.MoveNext();
continue;
}
#if ParseDebug2
ktDebug.Log( "MakeATree calling HandleSep!" );
#endif
HandleSep(Prev, Next, ref Tree, Token);
List.MoveNext();
}
else if ((FirstRun) && (
(Token.Type == ktTokenType.Operator) ||
(Token.Type == ktTokenType.AssignmentOperator)
) && (
(PrevToken.Type == ktTokenType.Operator) ||
(PrevToken.Type == ktTokenType.AssignmentOperator)
))
{
if ( (Token.Value == "=") || (PrevToken.Value == "=") )
{
switch (PrevToken.Value)
{
case "=": case "!": case ">": case "<":
{
// PrevToken.Value = "==";
if (PrevToken.Value == "=")
PrevToken.Value.Append(Token.Value);
else
PrevToken.Value.Append("=");
PrevToken.Type = ktTokenType.ComparisonOperator;
Prev.Node.Name = PrevToken.Name = ktToken.TokenToString(ktTokenType.ComparisonOperator);
break;
}
case "+": case "-": case "*": case "/": case "%":
case "&": case "|": case "~": case "^":
{
if (PrevToken.Value == "=")
PrevToken.Value.Append(Token.Value);
else
PrevToken.Value.Append("=");
PrevToken.Type = ktTokenType.AssignmentOperator;
Prev.Node.Name = PrevToken.Name = ktToken.TokenToString(ktTokenType.AssignmentOperator);
break;
}
default:
{
throw new ktError("Unknown operator '" + PrevToken.Value + Token.Value +
"' on line " + PrevToken.LineNo.ToString() +
" by character " + PrevToken.CharPos.ToString() + "!",
ktERR.UNKNOWN);
}
}
} else if ( PrevToken.Value == Token.Value )
{
PrevToken.Value.Append(Token.Value);
PrevToken.Type = ktTokenType.Operator;
Prev.Node.Name = PrevToken.Name = ktToken.TokenToString(ktTokenType.Operator);
}
else
{
throw new ktError("Unknown operator '" + PrevToken.Value + Token.Value +
"' on line " + PrevToken.LineNo.ToString() +
" by character " + PrevToken.CharPos.ToString() + "!",
ktERR.UNKNOWN);
}
/*Prev = L.Prev;
Next = L.Next;
HandleSep( Prev, Next, ref Tree, Token );
List.MoveNext();*/
}
else if ((ThirdRun) && (PrevToken.Type == ktTokenType.New))
{
#if ParseDebug2
ktDebug.Log( "NEW_PREV:"+ PrevToken.Value );
ktDebug.Log( "NEW_LLLL:"+ L.Get_R() );
ktDebug.Log( "NEW_NNN:" + ((Next == null) ? "null" : Next.Get_R().ToString()) );
#endif
Tree.Remove((uint)(Tree.Count - 1));
Temp = new ktList();
Temp.Node = new ktNode("ktTNewStatment", PrevToken);
// Temp.AddList( Prev );
Temp.AddList(GetTheRest(List));
Tree.AddList(Temp);
break;
}
else
{
Tree.AddList(new ktList(L));
}
}
//#if ParseDebug2
ktDebug.Log( "+++++++++++++++++++++" + Tree.Get_R( "\t", true ) + "-----------__");
//#endif
if (List == m_LineStack)
{
Tree = MakeATree(Tree, false, false);
}
return Tree;
}
