Polish notation
E812224
Polish notation is a mathematical and logical expression format that places operators before their operands, eliminating the need for parentheses to denote order of operations.
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
logical notation
ⓘ
mathematical notation ⓘ prefix notation ⓘ |
| advantage |
facilitates stack-based evaluation
ⓘ
simplifies expression evaluation algorithms ⓘ unambiguous parsing without precedence rules ⓘ |
| alternativeName |
prefix notation
ⓘ
Łukasiewicz notation NERFINISHED ⓘ |
| category | expression notation system ⓘ |
| contrastWith |
infix notation
ⓘ
reverse Polish notation ⓘ |
| countryOfOrigin | Poland ⓘ |
| designedBy | Jan Łukasiewicz NERFINISHED ⓘ |
| designedFor | clarity of formal logical expressions ⓘ |
| evaluationOrder | left to right given fixed arity operators ⓘ |
| exampleExpression |
* + 2 3 4 represents (2 + 3) * 4
ⓘ
+ 3 4 represents 3 + 4 ⓘ |
| field |
computer science
ⓘ
mathematical logic ⓘ mathematics ⓘ |
| historicalPeriod | early 20th century ⓘ |
| humanReadability | lower than infix notation for many users ⓘ |
| influenced |
notation in some programming languages and calculators
ⓘ
reverse Polish notation ⓘ |
| introducedInContextOf | propositional logic ⓘ |
| inventor | Jan Łukasiewicz NERFINISHED ⓘ |
| logicalStatus | syntactic convention ⓘ |
| mainFeature |
eliminates need for parentheses to denote order of operations
ⓘ
expression evaluation determined solely by position of operators and operands ⓘ |
| nameOrigin | named after the nationality of Jan Łukasiewicz ⓘ |
| notationDirection | operators precede all their operands ⓘ |
| notationStyle | linear notation ⓘ |
| operatorPosition | before operands ⓘ |
| parsingComplexity | simple deterministic parsing ⓘ |
| relatedNotation |
infix notation
GENERATED
ⓘ
postfix notation GENERATED ⓘ reverse Polish notation GENERATED ⓘ |
| requires | knowledge of operator arity for correct parsing ⓘ |
| supports | n-ary operators ⓘ |
| timeOfIntroduction | 1920s ⓘ |
| typicalUse |
representation of arithmetic expressions
ⓘ
representation of logical formulas ⓘ |
| usedIn |
compiler design
ⓘ
expression parsing algorithms ⓘ formal proof systems ⓘ stack-based calculators and interpreters ⓘ |
| usesParentheses | no ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.