Expression notation Created 2026-10-31 Updated 2026-11-05
Expression notation specifies how operators and operands are arranged to encode a mathematical computation. Infix notation places an operator between operands, as in ; Polish notation places it first, and reverse Polish notation places it last.
The computation can be written in prefix form as * + a b c or postfix form as a b + c *. Known operator arities make these forms parse without parentheses. Infix notation instead uses parentheses and precedence conventions to distinguish this expression from . All three can describe the same abstract syntax tree.
Numeral notation Created 2026-10-20 Updated 2026-11-05
Numeral notation specifies how a number is written, including its digit alphabet, base and separators. The same integer can appear as decimal , binary or hexadecimal . A base marker distinguishes the written numeral from an otherwise identical string in another numeral system.
This differs from expression notation, which also describes operations on represented numbers. For example 0x10 names one integer in a programming convention, while gives an expression evaluating to that same integer. Keeping representation separate from value is important in algorithms involving digit constraints or input length.