public override void Visit(ConditionalCompilationIf node)
{
if (node != null)
{
// increment the conditional comment level and then recurse the condition
++m_conditionalCommentLevel;
base.Visit(node);
}
}
public void Visit(ConditionalCompilationIf node)
{
// invalid! ignore
IsValid = false;
}
public void Visit(ConditionalCompilationIf node)
{
// invalid! ignore
IsValid = false;
}
public void Visit(ConditionalCompilationIf node)
{
// preprocessor nodes are handled outside the real JavaScript parsing
}
public override void Visit(ConditionalCompilationIf node)
{
if (node != null)
{
// increment the conditional comment level and then recurse the condition
++m_conditionalCommentLevel;
base.Visit(node);
}
}
private void DoConditionalCompilationIf(ConditionalCompilationIf node)
{
if (m_parser.Settings.IsModificationAllowed(TreeModifications.EvaluateNumericExpressions))
{
// if the if-condition is a constant, we can eliminate one of the two branches
ConstantWrapper constantCondition = node.Condition as ConstantWrapper;
if (constantCondition != null)
{
// instead, replace the condition with a 1 if it's always true or a 0 if it's always false
if (constantCondition.IsNotOneOrPositiveZero)
{
try
{
node.Condition =
new ConstantWrapper(constantCondition.ToBoolean() ? 1 : 0, PrimitiveType.Number, node.Condition.Context, m_parser);
}
catch (InvalidCastException)
{
// ignore any invalid cast exceptions
}
}
}
}
}
public void Visit(ConditionalCompilationIf node)
{
// not applicable; terminate
}
public override void Visit(ConditionalCompilationIf node)
{
if (node != null)
{
// depth-first
base.Visit(node);
DoConditionalCompilationIf(node);
}
}
public void Visit(ConditionalCompilationIf node)
{
// nothing to do
}
public void Visit(ConditionalCompilationIf node)
{
// preprocessor nodes are handled outside the real JavaScript parsing
}
public void Visit(ConditionalCompilationIf node)
{
// not applicable; terminate
}
public void Visit(ConditionalCompilationIf node)
{
// nothing to do
}
