private void ParseLogicalAnd(ParseNode parent) // NonTerminalSymbol: LogicalAnd
{
Token tok;
ParseNode n;
ParseNode node = parent.CreateNode(_scanner.GetToken(TokenType.LogicalAnd), "LogicalAnd");
parent.Nodes.Add(node);
// Concat Rule
ParseComparison(node); // NonTerminal Rule: Comparison
// Concat Rule
tok = _scanner.LookAhead(TokenType.AND); // ZeroOrMore Rule
while (tok.Type == TokenType.AND)
{
// Concat Rule
tok = _scanner.Scan(TokenType.AND); // Terminal Rule: AND
n = node.CreateNode(tok, tok.ToString());
node.Token.UpdateRange(tok);
node.Nodes.Add(n);
if (tok.Type != TokenType.AND)
{
tree.Errors.Add(new ParseError("Unexpected token '" + tok.Text.Replace("\n", "") + "' found. Expected " + TokenType.AND.ToString(),
0x1001, tok));
return;
}
// Concat Rule
ParseComparison(node); // NonTerminal Rule: Comparison
tok = _scanner.LookAhead(TokenType.AND); // ZeroOrMore Rule
}
parent.Token.UpdateRange(node.Token);
} // NonTerminalSymbol: LogicalAnd
