Computer Sciences > Gate 2022 > 1
Which one of the following statements is TRUE?
A
The LALR(1) parser for a grammar G cannot have a reduce-reduce conflict if the LR(1) parser for G does not have reduce-reduce conflict.
B
The symbol table is accessed only during the lexical analysis phase.
C
Data flow analysis is necessary for run-time memory management.
D
LR(1) parsing is sufficient for deterministic context-free languages.

Correct : d

Similar Questions

Consider the following recurrence: f(1) = 1; f(2n) = 2f(n) -1, for n≥1; f(2n+1) = 2f(n) +1, for n≥1; Then, which of the following statements is/are TRUE?
#321 MSQ
Consider the following languages: L1 = {ww | w ∈ {a, b}* } L2 = {anbncn | m, n≥ 0} L3 = {ambncn | m, n≥ 0} Which of the following statements is/are FALSE?
#322 MSQ
Which of the following statements is/are TRUE with respect to deadlocks?
#323 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......