protected string FindParameterList(List <Tuple <AbstractSyntaxTreeNode, AbstractSyntaxTreeNode> > list,
List <AbstractSyntaxTreeNode> postfixList,
int actualPosition, Stack <AbstractSyntaxTreeNode> valueStack, bool firstCall)
{
var actualParameter = postfixList[actualPosition];
if (actualParameter is ThenNode)
{
return(FindParameterList(list, postfixList, actualPosition - 1, valueStack, true));
}
else if (actualParameter is ElseNode)
{
var pop = valueStack.Pop();
return(FindParameterList(list, postfixList, actualPosition - 1, valueStack, true));
}
else if (actualParameter is IntegerNode || actualParameter is StringNode || actualParameter is BooleanNode ||
actualParameter is DateTimeNode || actualParameter is DoubleNode)
{
AbstractSyntaxTreeNode pop = null;
if (!firstCall)
{
pop = valueStack.Pop();
}
list.Add(new Tuple <AbstractSyntaxTreeNode, AbstractSyntaxTreeNode>(actualParameter, null));
return(FindParameterList(list, postfixList, actualPosition - 1, valueStack, false));
}
else
{
if (actualParameter is VariableNode)
{
return(((VariableNode)actualParameter).Name);
}
else if (actualParameter is MethodCallNode)
{
foreach (var parameter in ((MethodCallNode)actualParameter).parameterList)
{
list.Add(new Tuple <AbstractSyntaxTreeNode, AbstractSyntaxTreeNode>(parameter, null));
}
return(((MethodCallNode)actualParameter).Name);
}
else
{
return(actualParameter.GetType().Name);
}
}
}
public List <AbstractSyntaxTreeNode> ConvertInfixToPostfix(List <AbstractSyntaxTreeNode> postfixList)
{
List <AbstractSyntaxTreeNode> returnList = new List <AbstractSyntaxTreeNode>();
Stack <AbstractSyntaxTreeNode> operatorStack = new Stack <AbstractSyntaxTreeNode>();
var position = 0;
var methodParameterMode = false;
MethodCallNode methodCallNode = null;
for (int i = position; i < postfixList.Count; i++)
{
var item = postfixList[i];
if (item is IntegerNode || item is DoubleNode ||
item is VariableNode ||
item is FieldNode ||
item is BooleanNode || item is StringNode || item is NullNode)
{
if (methodParameterMode)
{
}
else
{
returnList.Add(item);
}
}
else if (item is ObjectNode)
{
var filter = ((ObjectNode)item).Filter;
if (filter != null)
{
((ObjectNode)item).Filter.FilterItems = ConvertInfixToPostfix(filter.FilterItems);
}
returnList.Add(item);
}
else if (item is UpperNode || item is LowerNode || item is LengthNode ||
item is TrimNode || item is LeftTrimNode || item is RightTrimNode)
{
returnList.Add(item);
}
else if (item is CollectionNode)
{
if (methodParameterMode)
{
}
else
{
var filter = ((CollectionNode)item).Filter;
if (filter != null)
{
((CollectionNode)item).Filter.FilterItems = ConvertInfixToPostfix(filter.FilterItems);
}
returnList.Add(item);
}
}
else if (item is OpenBracketNode)
{
if (methodParameterMode)
{
}
else
{
i = ConvertInfixToPostfixBracket(i, postfixList, returnList);
}
}
else if (item is CloseBracketNode)
{
methodParameterMode = false;
}
else if (item is OrNode || item is AndNode)
{
while (operatorStack.Count > 0)
{
var abstractSyntaxTreeNode = operatorStack.Pop();
returnList.Add(abstractSyntaxTreeNode);
}
operatorStack.Push(item);
}
else if (item is GreaterThenNode || item is GreaterThenOrEqualNode ||
item is SmallerThenNode || item is SmallerThenOrEqualNode ||
item is EqualNode || item is UnEqualNode || item is IsNode || item is LikeNode ||
item is AggregateInNode || item is AggregateNotInNode)
{
if (operatorStack.Count() > 0 && (operatorStack.Peek() is MulNode ||
operatorStack.Peek() is DivNode ||
operatorStack.Peek() is ModuloNode))
{
AbstractSyntaxTreeNode node = operatorStack.Pop();
returnList.Add(node);
}
else if (operatorStack.Count() > 0 && (operatorStack.Peek() is AddNode ||
operatorStack.Peek() is SubNode))
{
AbstractSyntaxTreeNode node = operatorStack.Pop();
returnList.Add(node);
}
else if (operatorStack.Count() > 0 && (operatorStack.Peek() is AggregateInNode ||
operatorStack.Peek() is AggregateNotInNode))
{
AbstractSyntaxTreeNode node = operatorStack.Pop();
returnList.Add(node);
}
operatorStack.Push(item);
}
else if (item is AddNode || item is SubNode)
{
if (operatorStack.Count() > 0 && (operatorStack.Peek() is MulNode ||
operatorStack.Peek() is DivNode ||
operatorStack.Peek() is ModuloNode))
{
AbstractSyntaxTreeNode node = operatorStack.Pop();
returnList.Add(node);
}
operatorStack.Push(item);
}
else if (item is MulNode || item is DivNode || item is ModuloNode)
{
operatorStack.Push(item);
}
else if (item is SetNode || item is ThenNode || item is ElseNode)
{
if (postfixList[i + 1] is MethodCallNode)
{
methodCallNode = (MethodCallNode)postfixList[i + 1];
i = ConvertMethodInfixToPostfixBracket(i + 1, postfixList, methodCallNode);
returnList.Add(item);
returnList.Add(methodCallNode);
}
else if (postfixList[i + 1] is OpenBracketNode)
{
returnList.Add(item);
i = ConvertInfixToPostfixBracket(i + 1, postfixList, returnList);
//returnList.Add(item);
//returnList.Add(methodCallNode);
}
else
{
operatorStack.Push(item);
}
}
else if (item is MethodCallNode)
{
methodCallNode = (MethodCallNode)item;
i = ConvertMethodInfixToPostfixBracket(i, postfixList, methodCallNode);
returnList.Add(methodCallNode);
}
position++;
}
while (operatorStack.Count > 0)
{
var abstractSyntaxTreeNode = operatorStack.Pop();
returnList.Add(abstractSyntaxTreeNode);
}
return(returnList);
}
public int ConvertInfixToPostfixBracket(int position,
List <AbstractSyntaxTreeNode> postfixList, List <AbstractSyntaxTreeNode> returnList)
{
Stack <AbstractSyntaxTreeNode> operatorStack = new Stack <AbstractSyntaxTreeNode>();
int i = 0;
var methodParameterMode = false;
MethodCallNode methodCallNode = null;
for (i = position + 1; i < postfixList.Count; i++)
{
var item = postfixList[i];
if (item is CloseBracketNode)
{
break;
}
if (item is IntegerNode || item is DoubleNode || item is VariableNode ||
item is FieldNode || item is CollectionNode || item is ObjectNode ||
item is BooleanNode || item is StringNode)
{
if (methodParameterMode)
{
}
else
{
returnList.Add(item);
}
}
else if (item is UpperNode || item is LowerNode || item is LengthNode ||
item is TrimNode || item is LeftTrimNode || item is RightTrimNode)
{
returnList.Add(item);
}
else if (item is OpenBracketNode)
{
if (methodParameterMode)
{
}
else
{
i = ConvertInfixToPostfixBracket(i, postfixList, returnList);
}
}
else if (item is OrNode || item is AndNode)
{
while (operatorStack.Count > 0)
{
var abstractSyntaxTreeNode = operatorStack.Pop();
returnList.Add(abstractSyntaxTreeNode);
}
operatorStack.Push(item);
}
else if (item is GreaterThenNode || item is GreaterThenOrEqualNode ||
item is SmallerThenNode || item is SmallerThenOrEqualNode ||
item is EqualNode || item is UnEqualNode)
{
if (operatorStack.Count() > 0 && (operatorStack.Peek() is MulNode || operatorStack.Peek() is DivNode ||
operatorStack.Peek() is ModuloNode))
{
AbstractSyntaxTreeNode node = operatorStack.Pop();
returnList.Add(node);
}
if (operatorStack.Count() > 0 && (operatorStack.Peek() is AddNode || operatorStack.Peek() is SubNode))
{
AbstractSyntaxTreeNode node = operatorStack.Pop();
returnList.Add(node);
}
operatorStack.Push(item);
}
else if (item is AddNode || item is SubNode)
{
if (operatorStack.Count() > 0 && (operatorStack.Peek() is MulNode || operatorStack.Peek() is DivNode ||
operatorStack.Peek() is ModuloNode))
{
AbstractSyntaxTreeNode node = operatorStack.Pop();
returnList.Add(node);
}
operatorStack.Push(item);
}
else if (item is MulNode || item is DivNode || item is ModuloNode)
{
operatorStack.Push(item);
}
else if (item is MethodCallNode)
{
methodParameterMode = true;
methodCallNode = (MethodCallNode)item;
i = ConvertMethodInfixToPostfixBracket(i, postfixList, methodCallNode);
returnList.Add(methodCallNode);
methodParameterMode = false;
}
position++;
}
while (operatorStack.Count > 0)
{
var abstractSyntaxTreeNode = operatorStack.Pop();
returnList.Add(abstractSyntaxTreeNode);
}
return(i);
}
public int ConvertMethodInfixToPostfixBracket(int position,
List <AbstractSyntaxTreeNode> postfixList, AbstractSyntaxTreeNode methodCallNode)
{
Stack <AbstractSyntaxTreeNode> operatorStack = new Stack <AbstractSyntaxTreeNode>();
int i = 0;
List <AbstractSyntaxTreeNode> parameterList = new List <AbstractSyntaxTreeNode>();
for (i = position + 1; i < postfixList.Count; i++)
{
var item = postfixList[i];
if (item is CloseBracketNode)
{
break;
}
else if (item is IntegerNode || item is DoubleNode ||
item is VariableNode || item is FieldNode || item is CollectionNode || item is ObjectNode ||
item is BooleanNode || item is StringNode)
{
parameterList.Add(item);
}
position++;
}
((MethodCallNode)methodCallNode).parameterList.InsertRange(0, parameterList.ToArray());
return(i);
}
public void AddChild(AbstractSyntaxTreeNode abstractSyntacTreeNode)
{
base.rootNodes.Add(abstractSyntacTreeNode);
}
protected void MethodCallNodeExecuteCall <T>(T objectValue, AbstractSyntaxTreeNode item)
{
var method = objectValue.GetType().GetMethod(((MethodCallNode)item).Name);
if (method != null)
{
var objectList = new List <object>();
for (int parameterCount = 0; parameterCount < ((MethodCallNode)item).parameterList.Count; parameterCount++)
{
var parameter = ((MethodCallNode)item).parameterList[parameterCount];
if (parameter is StringNode)
{
var value = ((StringNode)parameter).Value;
DateTime dateTime = new DateTime();
if (DateTime.TryParse(value, out dateTime))
{
objectList.Add(dateTime);
}
else
{
objectList.Add(value);
}
}
else if (parameter is DateTimeNode)
{
var value = ((DateTimeNode)parameter).Value;
objectList.Add(value);
}
else if (parameter is BooleanNode)
{
var value = ((BooleanNode)parameter).Value;
objectList.Add(value);
}
else if (parameter is DoubleNode)
{
var value = ((DoubleNode)parameter).Value;
objectList.Add(value);
}
else if (parameter is IntegerNode)
{
var value = ((IntegerNode)parameter).Value;
objectList.Add(value);
}
}
var result = method.Invoke(objectValue, objectList.ToArray());
int intOutValue;
double doubleOutValue;
bool boolOutValue;
DateTime dateTimeOutValue;
if (result == null)
{
NullNode nullNode = new NullNode();
valueStack.Push(nullNode);
}
else if (int.TryParse(result.ToString(), out intOutValue))
{
IntegerNode integerNode = new IntegerNode();
integerNode.Value = intOutValue;
valueStack.Push(integerNode);
}
else if (double.TryParse(result.ToString(), out doubleOutValue))
{
DoubleNode doubleNode = new DoubleNode();
doubleNode.Value = doubleOutValue;
valueStack.Push(doubleNode);
}
else if (bool.TryParse(result.ToString(), out boolOutValue))
{
BooleanNode booleanNode = new BooleanNode();
booleanNode.Value = boolOutValue;
valueStack.Push(booleanNode);
}
else if (DateTime.TryParse(result.ToString(), out dateTimeOutValue))
{
DateTimeNode dateTimeNode = new DateTimeNode();
dateTimeNode.Value = dateTimeOutValue;
valueStack.Push(dateTimeNode);
}
else
{
StringNode stringNode = new StringNode();
stringNode.Value = result.ToString();
valueStack.Push(stringNode);
}
}
}
