 |
| Prefix notation |
| Infix notation |
| Postfix notation |
Infix notation is the common arithmetic and logical formula notation, in which operators are written infix-style between the operands they act on (e.g. 2 + 2). It is not as simple to parse by computers as prefix notation ( e.g. + 2 2 ) or postfix notation ( e.g. 2 2 + ), but many programming languages use it due to its familiarity.
In infix notation, unlike in prefix or postfix 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.
See also
- Calculator input methods: comparison of notations as used by pocket calculators
- postfix notation, also called Reverse Polish notation
- prefix notation, also called Polish notation
- Shunting yard algorithm, used to convert infix notation to postfix notation or to a tree
External links
Open source encyclopedia content modification information:
This page was last modified on 2 September 2009 at 16:30.
Authorship and Review
Open source encyclopedia content provided here is not reviewed directly by MedLibrary.org. Content is sourced directly from Wikipedia and is authored by an open community of volunteers. It is not produced by or in any way affiliated with MedLibrary.org.
Usage Guidelines
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article on "Infix notation", which is available in its original form here:
http://en.wikipedia.org/w/index.php?title=Infix_notation
All material adapted used from Wikipedia is available under the terms of the GNU Free Documentation License. Wikipedia® itself is a registered trademark of the Wikimedia Foundation, Inc.