Metraipolis › archive › dc_da9faa287733

Ambiguous grammar — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Ambiguous_grammar
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-08T20:04:08.982Z
SHA-256 of the archived text
f685558a42dc78ca0193fe4964cd26de5411e7de46339d55ac7df1280f5bd652
Stable URL of this page
https://metraipolis.com/documento/dc_da9faa287733

How to cite

Ambiguous grammar — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Ambiguous_grammar (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_da9faa287733 (Metraipolis archive dc_da9faa287733, sha256 f685558a42dc78ca0193fe4964cd26de5411e7de46339d55ac7df1280f5bd652)
BibTeX
@misc{dcda9faa287733,
  title = {Ambiguous grammar — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Ambiguous_grammar},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_da9faa287733; sha256 f685558a42dc78ca0193fe4964cd26de5411e7de46339d55ac7df1280f5bd652},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Ambiguous_grammar. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In computer science, an ambiguous grammar is a context-free grammar for which there exists a string that can have more than one leftmost derivation or parse tree. Every non-empty context-free language admits an ambiguous grammar by introducing e.g. a duplicate rule. A language that only admits ambiguous grammars is called an inherently ambiguous language. Deterministic context-free grammars are always unambiguous, and are an important subclass of unambiguous grammars; there are non-deterministic unambiguous grammars, however. For computer programming languages, the reference grammar is often ambiguous, due to issues such as the dangling else problem. If present, these ambiguities are generally resolved by adding precedence rules or other context-sensitive parsing rules, so the overall phrase grammar is unambiguous. Some parsing algorithms (such as Earley or GLR parsers) can generate sets of parse trees (or "parse forests") from strings that are syntactically ambiguous.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Ambiguous grammar» — https://en.wikipedia.org/wiki/Ambiguous_grammar
Wikidata Q1917459: «Ambiguity in Grammar» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1917459
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Ambiguous_grammar?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1384526930, consultata il 2026-11-08T20:00:20.921Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: bca727e018e7a3f8d8b58cae3807726dc00ebd9c17f5a7323723b4d6f9f7ef0e