See shunting-yard algorithm on Wiktionary
{
"etymology_text": "By analogy to the operations in a railroad shunting yard.",
"forms": [
{
"form": "the shunting-yard algorithm",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1",
"head": "shunting-yard algorithm"
},
"expansion": "the shunting-yard algorithm",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A method for parsing mathematical expressions specified in infix notation."
],
"id": "en-shunting-yard_algorithm-en-name-RcImywcW",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"parsing",
"parse"
],
[
"mathematical",
"mathematical"
],
[
"expression",
"expression"
],
[
"infix notation",
"infix notation"
]
],
"raw_glosses": [
"(computing theory) A method for parsing mathematical expressions specified in infix notation."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"shunting-yard algorithm"
]
}
],
"word": "shunting-yard algorithm"
}
{
"etymology_text": "By analogy to the operations in a railroad shunting yard.",
"forms": [
{
"form": "the shunting-yard algorithm",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1",
"head": "shunting-yard algorithm"
},
"expansion": "the shunting-yard algorithm",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Theory of computing"
],
"glosses": [
"A method for parsing mathematical expressions specified in infix notation."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"parsing",
"parse"
],
[
"mathematical",
"mathematical"
],
[
"expression",
"expression"
],
[
"infix notation",
"infix notation"
]
],
"raw_glosses": [
"(computing theory) A method for parsing mathematical expressions specified in infix notation."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"shunting-yard algorithm"
]
}
],
"word": "shunting-yard algorithm"
}
Download raw JSONL data for shunting-yard algorithm meaning in All languages combined (1.2kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.