"recursive descent" meaning in English

See recursive descent in All languages combined, or Wiktionary

Noun

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 Categories (topical): Theory of computing Related terms: predictive parser
    Sense id: en-recursive_descent-en-noun-vjLMCdIg Categories (other): English entries with incorrect language header Topics: computing, computing-theory, engineering, mathematics, natural-sciences, physical-sciences, sciences

Download JSON data for recursive descent meaning in English (1.7kB)

{
  "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": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "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 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"
      ]
    }
  ],
  "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",
        "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"
      ]
    }
  ],
  "word": "recursive descent"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-06 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). 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.