Index: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Home > Infix notation

Infix notation is the arithmetic formula notation known to most people, in which operators are written infix-style between the operands they act on. It is not as simple to parse by computer as postfix notation, but many programming languages use it to take advantage of its familiarity.

In infix notation, unlike in postfix or prefix notations, parentheses surrounding groups of operands and operators are necessary to indicate the intended order in which operations are to be performed. In the absence of parentheses, certain precedence rules determine the order of operations. These are explained in the order of operations article.

1 See also

postfix notation, also called Reverse Polish notation
prefix notation, also called Polish notation

2 External links

RPN or DAL? A brief analysis of Reverse Polish Notation against Direct Algebraic Logic – James Redin

Mathematical notation

Read more »

<Hide>

Topics: Infix Notation, Guides, Tutorials...

InfixAn infix is an affix inserted inside another morpheme. This is not uncommon in Semitic languages, in which roots are composed of three or occasionally four consonants and are conjugated by changing the vowels and sometimes inserting consonants between the

Infix notationInfix notation is the arithmetic formula notation known to most people, in which operators are written infix-style between the operands they act on. It is not as simple to parse by computer as postfix notation, but many programming languages use it to tak

Non User