public Tuple <bool, MethodCallNode> CheckMethodCall(string value)
{
MethodCallNode methodCallNode = new MethodCallNode();
methodCallNode.Name = value;
var currentToken = NextToken();
if (currentToken.Type_ == TokenType.OPENBRACKET)
{
Match(TokenType.IDENT);
return(new Tuple <bool, MethodCallNode>(true, methodCallNode));
}
else if (currentToken.Type_ == TokenType.LIKE)
{
Rewind();
return(new Tuple <bool, MethodCallNode>(false, null));
}
else
{
return(new Tuple <bool, MethodCallNode>(false, null));
}
}
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);
}
