Polish notation
= Polish notation
{c}
{wiki}
= Prefix notation
{synonym}
Place each operator before its operands. With known operator arities and unambiguous tokens, the <abstract syntax tree> is recovered recursively without precedence rules or parentheses. A binary application is encoded by its operator, the first subtree's encoding and the second subtree's encoding: this is a <preorder traversal> of the expression tree.