// The Nova Project by Ken Beckett.
// Copyright (C) 2007-2012 Inevitable Software, all rights reserved.
// Released under the Common Development and Distribution License, CDDL-1.0: http://opensource.org/licenses/cddl1.php
using Nova.Parsing;
namespace Nova.CodeDOM
{
/// <summary>
/// Returns the remainder of the division of one <see cref="Expression"/> by another.
/// </summary>
public class Mod : BinaryArithmeticOperator
{
#region /* CONSTANTS */
/// <summary>
/// The internal name of the operator.
/// </summary>
public const string InternalName = NamePrefix + "Modulus";
#endregion
#region /* CONSTRUCTORS */
/// <summary>
/// Create a <see cref="Mod"/> operator.
/// </summary>
public Mod(Expression left, Expression right)
: base(left, right)
{ }
#endregion
#region /* PROPERTIES */
/// <summary>
/// The symbol associated with the operator.
/// </summary>
public override string Symbol
{
get { return ParseToken; }
}
#endregion
#region /* METHODS */
/// <summary>
/// The internal name of the <see cref="BinaryOperator"/>.
/// </summary>
public override string GetInternalName()
{
return InternalName;
}
#endregion
#region /* PARSING */
/// <summary>
/// The token used to parse the code object.
/// </summary>
public const string ParseToken = "%";
/// <summary>
/// The precedence of the operator.
/// </summary>
public const int Precedence = 300;
/// <summary>
/// True if the operator is left-associative, or false if it's right-associative.
/// </summary>
public const bool LeftAssociative = true;
internal static new void AddParsePoints()
{
Parser.AddOperatorParsePoint(ParseToken, Precedence, LeftAssociative, false, Parse);
}
/// <summary>
/// Parse a <see cref="Mod"/> operator.
/// </summary>
public static Mod Parse(Parser parser, CodeObject parent, ParseFlags flags)
{
return new Mod(parser, parent);
}
protected Mod(Parser parser, CodeObject parent)
: base(parser, parent)
{ }
/// <summary>
/// Get the precedence of the operator.
/// </summary>
public override int GetPrecedence()
{
return Precedence;
}
#endregion
}
}