TOPICS
Search

Infix Notation


Infix notation is a notation for expressions in which a binary operator is placed between its two operands, as in a+b. It is the usual notation for arithmetic expressions. Parentheses and precedence rules determine the grouping of more complicated expressions. For example, 3+4×5 has value 23, whereas (3+4)×5 has value 35.

In Polish notation, also called prefix notation, each operator precedes its operands. In reverse Polish notation, also called postfix notation, each operator follows its operands.


See also

Polish Notation, Precedence, Reverse Polish Notation

Explore with Wolfram|Alpha

References

Miller, B. and Ranum, D. "Infix, Prefix and Postfix Expressions." §4.9 in Problem Solving with Algorithms and Data Structures Using Python. Runestone Academy. https://runestone.academy/ns/books/published/pythonds/BasicDS/InfixPrefixandPostfixExpressions.html.

Cite this as:

Weisstein, Eric W. "Infix Notation." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/InfixNotation.html

Subject classifications