"context-free grammar" meaning in All languages combined

{
  "forms": [
    {
      "form": "context-free grammars",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "context-free grammar (plural context-free grammars)",
      "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"
        }
      ],
      "derived": [
        {
          "word": "probabilistic context-free grammar"
        },
        {
          "word": "stochastic context-free grammar"
        }
      ],
      "examples": [
        {
          "ref": "2006, Patrick Blackburn, Johan Bos, Kristina Striegnitz, Learn Prolog Now!, §7.1",
          "text": "It remains to explain one final concept, namely what a context free language is. (Don’t get confused: we’ve told you what a context free grammar is, but not what a context free language is.) Quite simply, a context free language is a language that can be generated by a context free grammar. Some languages are context free, and some are not. For example, it seems plausible that English is a context free language. That is, it is probably possible to write a context free grammar that generates all (and only) the sentences that native speakers find acceptable. On the other hand, some dialects of Swiss-German are not context free. It can be proved mathematically that no context free grammar can generate all (and only) the sentences that native speakers of Swiss-German find acceptable.¹ So if you wanted to write a grammar for such dialects, you would have to employ additional grammatical mechanisms, not merely context free rules."
        }
      ],
      "glosses": [
        "A formal grammar in which every production rule is such that the left-hand side is exactly one non-terminal symbol and the right-hand side is zero or more terminal symbols and/or nonterminal symbols."
      ],
      "id": "en-context-free_grammar-en-noun-Z2xvhKs3",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "formal grammar",
          "formal grammar"
        ],
        [
          "non-terminal symbol",
          "non-terminal symbol"
        ],
        [
          "terminal symbol",
          "terminal symbol"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A formal grammar in which every production rule is such that the left-hand side is exactly one non-terminal symbol and the right-hand side is zero or more terminal symbols and/or nonterminal symbols."
      ],
      "related": [
        {
          "word": "context-free language"
        },
        {
          "word": "context-sensitive grammar"
        },
        {
          "word": "pushdown automaton"
        }
      ],
      "synonyms": [
        {
          "word": "CFG"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "translations": [
        {
          "code": "cmn",
          "lang": "Chinese Mandarin",
          "sense": "formal grammar",
          "word": "上下文無關文法"
        },
        {
          "code": "cmn",
          "lang": "Chinese Mandarin",
          "roman": "shàngxiàwén wúguān wénfǎ",
          "sense": "formal grammar",
          "word": "上下文无关文法"
        },
        {
          "code": "cs",
          "lang": "Czech",
          "sense": "formal grammar",
          "tags": [
            "feminine"
          ],
          "word": "bezkontextová gramatika"
        },
        {
          "code": "eo",
          "lang": "Esperanto",
          "sense": "formal grammar",
          "word": "senkunteksta gramatiko"
        },
        {
          "code": "fi",
          "lang": "Finnish",
          "sense": "formal grammar",
          "word": "yhteydetön kielioppi"
        },
        {
          "code": "de",
          "lang": "German",
          "sense": "formal grammar",
          "tags": [
            "feminine"
          ],
          "word": "kontextfreie Grammatik"
        },
        {
          "code": "is",
          "lang": "Icelandic",
          "sense": "formal grammar",
          "tags": [
            "feminine"
          ],
          "word": "samhengisfrjáls mállýsing"
        },
        {
          "code": "sh",
          "lang": "Serbo-Croatian",
          "sense": "formal grammar",
          "tags": [
            "feminine"
          ],
          "word": "kontekstno neovisna gramatika"
        }
      ]
    }
  ],
  "word": "context-free grammar"
}

{
  "derived": [
    {
      "word": "probabilistic context-free grammar"
    },
    {
      "word": "stochastic context-free grammar"
    }
  ],
  "forms": [
    {
      "form": "context-free grammars",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "context-free grammar (plural context-free grammars)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "context-free language"
    },
    {
      "word": "context-sensitive grammar"
    },
    {
      "word": "pushdown automaton"
    }
  ],
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "en:Theory of computing"
      ],
      "examples": [
        {
          "ref": "2006, Patrick Blackburn, Johan Bos, Kristina Striegnitz, Learn Prolog Now!, §7.1",
          "text": "It remains to explain one final concept, namely what a context free language is. (Don’t get confused: we’ve told you what a context free grammar is, but not what a context free language is.) Quite simply, a context free language is a language that can be generated by a context free grammar. Some languages are context free, and some are not. For example, it seems plausible that English is a context free language. That is, it is probably possible to write a context free grammar that generates all (and only) the sentences that native speakers find acceptable. On the other hand, some dialects of Swiss-German are not context free. It can be proved mathematically that no context free grammar can generate all (and only) the sentences that native speakers of Swiss-German find acceptable.¹ So if you wanted to write a grammar for such dialects, you would have to employ additional grammatical mechanisms, not merely context free rules."
        }
      ],
      "glosses": [
        "A formal grammar in which every production rule is such that the left-hand side is exactly one non-terminal symbol and the right-hand side is zero or more terminal symbols and/or nonterminal symbols."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "formal grammar",
          "formal grammar"
        ],
        [
          "non-terminal symbol",
          "non-terminal symbol"
        ],
        [
          "terminal symbol",
          "terminal symbol"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A formal grammar in which every production rule is such that the left-hand side is exactly one non-terminal symbol and the right-hand side is zero or more terminal symbols and/or nonterminal symbols."
      ],
      "synonyms": [
        {
          "word": "CFG"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "translations": [
    {
      "code": "cmn",
      "lang": "Chinese Mandarin",
      "sense": "formal grammar",
      "word": "上下文無關文法"
    },
    {
      "code": "cmn",
      "lang": "Chinese Mandarin",
      "roman": "shàngxiàwén wúguān wénfǎ",
      "sense": "formal grammar",
      "word": "上下文无关文法"
    },
    {
      "code": "cs",
      "lang": "Czech",
      "sense": "formal grammar",
      "tags": [
        "feminine"
      ],
      "word": "bezkontextová gramatika"
    },
    {
      "code": "eo",
      "lang": "Esperanto",
      "sense": "formal grammar",
      "word": "senkunteksta gramatiko"
    },
    {
      "code": "fi",
      "lang": "Finnish",
      "sense": "formal grammar",
      "word": "yhteydetön kielioppi"
    },
    {
      "code": "de",
      "lang": "German",
      "sense": "formal grammar",
      "tags": [
        "feminine"
      ],
      "word": "kontextfreie Grammatik"
    },
    {
      "code": "is",
      "lang": "Icelandic",
      "sense": "formal grammar",
      "tags": [
        "feminine"
      ],
      "word": "samhengisfrjáls mállýsing"
    },
    {
      "code": "sh",
      "lang": "Serbo-Croatian",
      "sense": "formal grammar",
      "tags": [
        "feminine"
      ],
      "word": "kontekstno neovisna gramatika"
    }
  ],
  "word": "context-free grammar"
}