InterviewSolution
Saved Bookmarks
| 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. |
| Answer» | |