Which one of the following statements is TRUE?

Let us analyze each statement:

• (A) is FALSE: Merging states with identical sets of items (cores) when constructing an $\text{LALR}(1)$ parser from an $\text{LR}(1)$ parser never creates shift-reduce conflicts, but it can introduce reduce-reduce conflicts.

• (B) is FALSE: The symbol table is created/populated during lexical analysis and accessed/modified throughout multiple subsequent phases of the compiler (syntax analysis, semantic analysis, intermediate code generation, optimization, and code generation).

• (C) is FALSE: Data flow analysis is a static technique used during compile-time for code optimization (e.g., liveness analysis, reaching definitions, constant propagation), not for run-time memory management.

• (D) is TRUE: The class of languages accepted by deterministic pushdown automata (DPDAs) is precisely the class of Deterministic Context-Free Languages (DCFLs). Every DCFL can be generated by an $\text{LR}(1)$ grammar, meaning $\text{LR}(1)$ parsing is sufficient for all DCFLs.

Thus, option (D) is the only TRUE statement.