Coursify

Parsers and Ambiguous Grammars: Choosing the Correct Option

Parsers and Ambiguous Grammars: Choosing the Correct Option

Verified Sources
Nov 4, 2026

Ambiguous grammars are grammars where at least one input string can have more than one distinct parse tree (and thus more than one distinct parse). A key consequence is that many deterministic parsing strategies (including LL(1) and LR-family parsers with fixed lookahead and deterministic parsing tables) are typically designed to work correctly only when the grammar is unambiguous for the relevant parser class.
In contrast, “operator precedence” parsing is usually a disambiguating technique for a particular subset of expressions (via precedence/associativity relations), and it still does not mean it can universally “parse ambiguous grammars” while preserving multiple parse trees.

To answer the multiple-choice question, we need the relationship between parser class and whether it can handle ambiguity:

  • LL(1) relies on a single lookahead token and a deterministic predictive choice, which requires the parsing decisions to be unambiguous for the grammar/input class.
  • CLR(1) is the canonical LR(1) family that (in standard theory) is defined for (and guarantees correct parsing for) grammars that are LR(1)—which implies the grammar is effectively unambiguous in the way LR(1) tables are constructed and used (canonical LR(1) parsing is deterministic).
  • Operator precedence parsers use precedence relations to drive reductions/shifts; they are not general parsers that can preserve/represent multiple parses of an ambiguous grammar as distinct parse trees.

Therefore, among the options given, the intended “correct” choice is:

✅ (iv) None of the above

Footnotes

  1. LL(1) parsing - Wikipedia - Overview of LL(1) predictive parsing using one-token lookahead and parsing table determinism. ↩

  2. LR parser - Wikipedia - Describes LR-family parsing and LR(1)/canonical LR concepts related to deterministic shift/reduce decisions. ↩

  3. Operator-precedence parsing - Wikipedia - Explains how operator precedence parsers use precedence/associativity rules for shift/reduce decisions. ↩

LL(1) vs LR Parsing (Intro to Parser Classes)

Quick justification via parser determinism

A deterministic parser (predictive LL(1), deterministic LR/CLR(1), and operator-precedence-based parsing) uses its mechanism (lookahead sets or precedence relations) to choose one action at each point in parsing. If a grammar is ambiguous, there exists an input for which different parse trees are valid; a deterministic parsing strategy cannot generally produce “all valid parse trees” unless the parsing model is explicitly non-deterministic (e.g., chart parsing / GLR / Earley-style approaches).

Hence, LL(1) and CLR(1) are not classified as parsers for ambiguous grammars; they belong to classes whose correctness depends on unambiguous (or at least effectively deterministic) behavior for the grammar in question. 2 Likewise, operator precedence parsing is not a general ambiguous-grammar parser.

Footnotes

  1. LL(1) parsing - Wikipedia - Overview of LL(1) predictive parsing using one-token lookahead and parsing table determinism. ↩

  2. LR parser - Wikipedia - Describes LR-family parsing and LR(1)/canonical LR concepts related to deterministic shift/reduce decisions. ↩

  3. Operator-precedence parsing - Wikipedia - Explains how operator precedence parsers use precedence/associativity rules for shift/reduce decisions. ↩

How to select the correct option

  1. 1
    Step 1

    “Parse ambiguous grammars” means a parser should still work correctly even when the grammar permits multiple parse trees for the same input.

  2. 2
    Step 2

    LL(1) predictive parsing depends on a deterministic choice using one-token lookahead; ambiguity breaks the deterministic selection property expected by LL(1).

    Footnotes

    1. LL(1) parsing - Wikipedia - Overview of LL(1) predictive parsing using one-token lookahead and parsing table determinism. ↩

  3. 3
    Step 3

    CLR(1) is part of the LR family constructed to enable deterministic shift/reduce decisions for LR(1) grammars; LR(1) parsing is not a general mechanism for ambiguous grammars.

    Footnotes

    1. LR parser - Wikipedia - Describes LR-family parsing and LR(1)/canonical LR concepts related to deterministic shift/reduce decisions. ↩

  4. 4
    Step 4

    Operator-precedence parsing is guided by precedence/associativity relations for expression-like grammars; it is not a general parser that can handle arbitrary grammar ambiguity while producing multiple parses.

    Footnotes

    1. Operator-precedence parsing - Wikipedia - Explains how operator precedence parsers use precedence/associativity rules for shift/reduce decisions. ↩

  5. 5
    Step 5

    Since none of the listed parser types are characterized as general parsers for ambiguous grammars, the correct answer is (iv) None of the above.

Exam strategy

When options ask about “ambiguous grammars,” look for parser types that are explicitly non-deterministic (e.g., GLR/Earley/chart parsing). Deterministic LL/LR(lookahead) and operator-precedence parsers are usually not treated as “ambiguous grammar parsers” in standard theory. 3

Footnotes

  1. LL(1) parsing - Wikipedia - Overview of LL(1) predictive parsing using one-token lookahead and parsing table determinism. ↩

  2. LR parser - Wikipedia - Describes LR-family parsing and LR(1)/canonical LR concepts related to deterministic shift/reduce decisions. ↩

  3. Operator-precedence parsing - Wikipedia - Explains how operator precedence parsers use precedence/associativity rules for shift/reduce decisions. ↩

Ambiguity vs. conflict

In practice, ambiguity often manifests as parsing table conflicts (shift/reduce or reduce/reduce) for deterministic LR/LL methods—but “ambiguous” and “conflicting” are not identical concepts in every subtle case. For MCQs, rely on the standard characterization: LL(1)/CLR(1) and operator-precedence are not the standard solutions for ambiguous grammars. 3

Footnotes

  1. LL(1) parsing - Wikipedia - Overview of LL(1) predictive parsing using one-token lookahead and parsing table determinism. ↩

  2. LR parser - Wikipedia - Describes LR-family parsing and LR(1)/canonical LR concepts related to deterministic shift/reduce decisions. ↩

  3. Operator-precedence parsing - Wikipedia - Explains how operator precedence parsers use precedence/associativity rules for shift/reduce decisions. ↩

Concept checks (supporting ideas)

Which option fits “parsers for ambiguous grammars”?

Scores reflect whether the listed parser types are generally characterized as deterministic parsing methods for ambiguous grammars.

Knowledge Check

Question 1 of 3
Q1Single choice

Which of the following parsers can parse ambiguous grammars?

Explore Related Topics

1

Left Factoring in LL(1) Parsing: What Guarantees Does It Provide?

2

Hierarchy and Power of Bottom-Up Parsers: SLR, LALR, and CLR

Bottom‑up LR parsers form a strict hierarchy of power: LR(0) < SLR < LALR < CLR, with each level able to handle all grammars of the lower levels.

  • SLR uses LR(0) items and resolves conflicts with FOLLOW sets; it is the weakest but simplest LR parser.
  • LALR builds full LR(1) items then merges states that share the same core, keeping the same number of states as SLR while adding look‑ahead precision.
  • CLR (canonical LR) retains all LR(1) states and look‑aheads, giving it the highest grammar coverage at the cost of many more states.
  • Merging CLR states to form LALR can introduce reduce‑reduce conflicts (never shift‑reduce), making LALR strictly less powerful than CLR.
  • In practice, tools like Yacc/Bison prefer LALR because it balances power with manageable memory usage.
3

Converting an Arbitrary CFG to an LL(1) Grammar: Correct Option and Why

Browse all research articles