How do LALR(1) and Canonical LR(1) (CLR) parser tables compare with respect to state count?
LALR(1) reduces table size dramatically (often from thousands to hundreds of states) by combining LR(1) states that have identical core LR(0) items.
When merging LR(1) item sets with identical cores to create LALR(1) states, can a Shift/Reduce conflict be introduced?
Core merging cannot produce new Shift/Reduce conflicts because the shift actions depend solely on the core LR(0) items, which are identical. However, it can potentially introduce Reduce/Reduce conflicts.
Which of the following characteristics accurately describes a Deterministic Pushdown Automaton (DPDA)?
Statements (A), (B), and (C) are all fundamental, accurate properties of DPDAs.
Given a immediate Left Recursive grammar rule A -> A \alpha | \beta, what is the standard transformed non-left-recursive rule set?
Left recursion A -> A $\alpha | \beta generates \beta \alpha*$. This is re-written right-recursively as A -> \beta A' and A' -> $\alpha A' | \epsilon$.
Which of the following grammar properties makes a grammar impossible to parse using a predictive LL(1) parser?
Left recursion, ambiguity, and unfactored common prefixes all cause conflicts in an LL(1) parsing table.