/*

* #%L

* Parsington: the SciJava mathematical expression parser.

* %%

* Copyright (C) 2015 - 2026 Parsington developers.

* %%

* Redistribution and use in source and binary forms, with or without

* modification, are permitted provided that the following conditions are met:

*

* 1. Redistributions of source code must retain the above copyright notice,

* this list of conditions and the following disclaimer.

* 2. Redistributions in binary form must reproduce the above copyright notice,

* this list of conditions and the following disclaimer in the documentation

* and/or other materials provided with the distribution.

*

* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"

* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE

* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE

* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR

* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF

* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS

* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN

* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)

* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE

* POSSIBILITY OF SUCH DAMAGE.

* #L%

*/

package org.scijava.parsington;

/**

* A function is an implicit binary operator between two "noun"

* tokens—typically between a variable on the left and a group on the

* right, in which case the function's precedence is inferred from the group.

* <p>

* Examples:

* </p>

* <ul>

* <li>{@code f()} &rarr; {@code f (0) <Fn>}</li>

* <li>{@code f(a)} &rarr; {@code f a (1) <Fn>}</li>

* <li>{@code f(a, b)} &rarr; {@code f a b (2) <Fn>}</li>

* <li>{@code f(g(a))} &rarr; {@code f g a (1) <Fn> (1) <Fn>}</li>

* </ul>

*

* @author Curtis Rueden

*/

public class Function extends Operator {

public Function(final double precedence) {

super("<Fn>", 2, Associativity.LEFT, precedence);

}

}