"recursive descent" meaning in All languages combined

See recursive descent on Wiktionary

Noun [English]

Head templates: {{en-noun|-}} recursive descent (uncountable)
  1. (computing theory) A kind of top-down parsing involving a set of mutually recursive procedures, each of which implements one of the non-terminals of the grammar, so that the structure of the parser program closely mirrors that of the grammar. Tags: uncountable Related terms: predictive parser Translations (Translations): 递归下降 (Chinese Mandarin), 再帰下降 (Japanese)
{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "recursive descent (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Entries with translation boxes",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Japanese translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Mandarin translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [],
          "source": "w"
        }
      ],
      "glosses": [
        "A kind of top-down parsing involving a set of mutually recursive procedures, each of which implements one of the non-terminals of the grammar, so that the structure of the parser program closely mirrors that of the grammar."
      ],
      "id": "en-recursive_descent-en-noun-vjLMCdIg",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "top-down",
          "top-down"
        ],
        [
          "parsing",
          "parse"
        ],
        [
          "mutually",
          "mutually"
        ],
        [
          "recursive",
          "recursive"
        ],
        [
          "procedure",
          "procedure"
        ],
        [
          "implement",
          "implement"
        ],
        [
          "non-terminal",
          "non-terminal"
        ],
        [
          "grammar",
          "grammar"
        ],
        [
          "structure",
          "structure"
        ],
        [
          "parser",
          "parser"
        ],
        [
          "program",
          "program"
        ],
        [
          "mirror",
          "mirror"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A kind of top-down parsing involving a set of mutually recursive procedures, each of which implements one of the non-terminals of the grammar, so that the structure of the parser program closely mirrors that of the grammar."
      ],
      "related": [
        {
          "word": "predictive parser"
        }
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "translations": [
        {
          "code": "cmn",
          "lang": "Chinese Mandarin",
          "sense": "Translations",
          "word": "递归下降"
        },
        {
          "code": "ja",
          "lang": "Japanese",
          "sense": "Translations",
          "word": "再帰下降"
        }
      ]
    }
  ],
  "word": "recursive descent"
}
{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "recursive descent (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "predictive parser"
    }
  ],
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English uncountable nouns",
        "Entries with translation boxes",
        "Pages with 1 entry",
        "Pages with entries",
        "Terms with Japanese translations",
        "Terms with Mandarin translations",
        "Translation table header lacks gloss",
        "en:Theory of computing"
      ],
      "glosses": [
        "A kind of top-down parsing involving a set of mutually recursive procedures, each of which implements one of the non-terminals of the grammar, so that the structure of the parser program closely mirrors that of the grammar."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "top-down",
          "top-down"
        ],
        [
          "parsing",
          "parse"
        ],
        [
          "mutually",
          "mutually"
        ],
        [
          "recursive",
          "recursive"
        ],
        [
          "procedure",
          "procedure"
        ],
        [
          "implement",
          "implement"
        ],
        [
          "non-terminal",
          "non-terminal"
        ],
        [
          "grammar",
          "grammar"
        ],
        [
          "structure",
          "structure"
        ],
        [
          "parser",
          "parser"
        ],
        [
          "program",
          "program"
        ],
        [
          "mirror",
          "mirror"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A kind of top-down parsing involving a set of mutually recursive procedures, each of which implements one of the non-terminals of the grammar, so that the structure of the parser program closely mirrors that of the grammar."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "translations": [
    {
      "code": "cmn",
      "lang": "Chinese Mandarin",
      "sense": "Translations",
      "word": "递归下降"
    },
    {
      "code": "ja",
      "lang": "Japanese",
      "sense": "Translations",
      "word": "再帰下降"
    }
  ],
  "word": "recursive descent"
}

Download raw JSONL data for recursive descent meaning in All languages combined (1.8kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-05-29 from the enwiktionary dump dated 2025-05-20 using wiktextract (e937b02 and f1c2b61). 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.