Exams › GATE › Technical

Which one of the following statements is TRUE?

1. The LALR(1) parser for a grammar G cannot have reduce-reduce conflict if the LR(1) parser for G does not have reduce-reduce conflict.
2. Symbol table is accessed only during the lexical analysis phase.
3. Data flow analysis is necessary for run-time memory management.
4. LR(1) parsing is sufficient for deterministic context-free languages.

Correct answer: LR(1) parsing is sufficient for deterministic context-free languages.

Solution

LR(1) parsing is designed to handle deterministic context-free languages by using a lookahead symbol to make parsing decisions, ensuring that it can resolve ambiguities and conflicts that may arise in the parsing process.

Related GATE Technical questions

• Which one of the following regular expressions correctly represents the language of the finite automaton given below?
• In a relational data model, which one of the following statements is TRUE?
• Consider the problem of reversing a singly linked list. To take an example, given the linked list below, head -> a -> b -> c -> d -> e -> NULL, the reversed linked list should look like head -> e -> d -> c -> b -> a -> NULL. Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in O(1) space?
• Suppose we are given n keys, m hash table slots, and two simple uniform hash functions h1 and h2. Further suppose our hashing scheme uses h1 for the odd keys and h2 for the even keys. What is the expected number of keys in a slot?
• Which one of the following facilitates transfer of bulk data from hard disk to main memory with the highest throughput?
• Let R1 and R2 be two 4-bit registers that store numbers in 2’s complement form. For the operation R1+R2, which one of the following values of R1 and R2 gives an arithmetic overflow?

⚔️ Practice GATE Technical free + battle 1v1 →