shunting-yard algorithm
E79783
The shunting-yard algorithm is a method for parsing mathematical expressions and converting infix notation to postfix (or prefix) form using a stack-based procedure.
All labels observed (1)
| Label | Occurrences |
|---|---|
| shunting-yard algorithm canonical | 3 |
How this entity was disambiguated
This entity first appeared as the object of triple T636099 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: shunting-yard algorithm Context triple: [Edsger W. Dijkstra, knownFor, shunting-yard algorithm]
-
A.
ALGOL 60
ALGOL 60 is an early high-level programming language that pioneered block structure and lexical scoping, profoundly influencing the design of many later languages.
-
B.
CAS (Computer Algebra System)
CAS (Computer Algebra System) is software that performs symbolic mathematical computations—such as algebraic manipulation, equation solving, and calculus operations—exactly rather than numerically.
-
C.
The Big Operator
The Big Operator is a 1959 American crime drama film starring Mickey Rooney as a corrupt union boss, notable for featuring Maila Nurmi in a supporting role.
-
D.
Chomsky hierarchy
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
-
E.
Compilers: Principles, Techniques, and Tools
Compilers: Principles, Techniques, and Tools is a foundational computer science textbook that systematically covers the theory and practice of compiler design and implementation.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: shunting-yard algorithm Target entity description: The shunting-yard algorithm is a method for parsing mathematical expressions and converting infix notation to postfix (or prefix) form using a stack-based procedure.
-
A.
ALGOL 60
ALGOL 60 is an early high-level programming language that pioneered block structure and lexical scoping, profoundly influencing the design of many later languages.
-
B.
CAS (Computer Algebra System)
CAS (Computer Algebra System) is software that performs symbolic mathematical computations—such as algebraic manipulation, equation solving, and calculus operations—exactly rather than numerically.
-
C.
The Big Operator
The Big Operator is a 1959 American crime drama film starring Mickey Rooney as a corrupt union boss, notable for featuring Maila Nurmi in a supporting role.
-
D.
Chomsky hierarchy
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
-
E.
Compilers: Principles, Techniques, and Tools
Compilers: Principles, Techniques, and Tools is a foundational computer science textbook that systematically covers the theory and practice of compiler design and implementation.
- F. None of above. chosen
Statements (45)
| Predicate | Object |
|---|---|
| instanceOf |
algorithm
ⓘ
expression parsing technique ⓘ parsing algorithm ⓘ |
| alternativeTo | recursive descent parsing for expressions ⓘ |
| canHandle |
binary operators
ⓘ
function argument separators ⓘ function calls ⓘ unary operators ⓘ |
| category | deterministic algorithm ⓘ |
| designedBy | Edsger W. Dijkstra ⓘ |
| documentedIn | Edsger Dijkstra's writings on ALGOL and expression parsing ⓘ |
| evaluationStrategy | non-recursive ⓘ |
| field |
compiler construction
ⓘ
computer science ⓘ programming languages ⓘ |
| handles |
left-associative operators
ⓘ
right-associative operators ⓘ |
| hasPurpose |
convert infix notation to postfix notation
ⓘ
convert infix notation to prefix notation ⓘ parse mathematical expressions ⓘ |
| input | sequence of tokens representing an expression ⓘ |
| inspiredBy | railway shunting process ⓘ |
| introducedIn | 1960s ⓘ |
| namedAfter | railway shunting yard ⓘ |
| operatesOn | infix expressions ⓘ |
| output | sequence of tokens in postfix order ⓘ |
| processingOrder | left-to-right scan of input tokens ⓘ |
| produces |
Reverse Polish Notation
ⓘ
surface form:
Reverse Polish notation
postfix expressions ⓘ prefix expressions ⓘ |
| relatedTo |
Reverse Polish Notation
ⓘ
surface form:
Reverse Polish notation
expression evaluation ⓘ operator-precedence parsing ⓘ stack-based evaluation ⓘ |
| requires |
definition of operator associativity
ⓘ
definition of operator precedence ⓘ |
| supports |
operator associativity
ⓘ
operator precedence ⓘ parentheses in expressions ⓘ |
| timeComplexity | O(n) ⓘ |
| typicalUse |
calculators
ⓘ
compilers ⓘ interpreters ⓘ |
| usesDataStructure |
queue
ⓘ
stack ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: shunting-yard algorithm Description of subject: The shunting-yard algorithm is a method for parsing mathematical expressions and converting infix notation to postfix (or prefix) form using a stack-based procedure.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.