Test my Merit My Results Create Exam

Higher Study | Compiler Design

Parser Run Time Environment Syntax Analysis Code Optimization Intermediate Code Generation Lexical Analysis Syntax Directed Translation
Which one of the following statements is true?
Which one of the following is false?
What is the output of a lexical analyzer?
Which one of the following is true at any valid state in shift-reduce parsing?
A simple two-pass assembler does which of the following in the first pass?
Which languages necessarily need heap allocation in the runtime environment?
Which of the following errors are identified by the compiler?
Assembly language is a
The software in computer that transfers the object program from secondary memory to the main memory is called
In a computer, a compiler is
Consider evaluating the following expression tree on a machine with load-store Architecture in which memory can be accessed only through load and store instructions. The variables a, b, c, d and e are initially stored in memory. The binary operators used in this expression tree can be evaluated by the machine only when the operands are in registers. The instructions produce result only in a register. If no intermediate results can be stored in memory, what is the minimum number of registers needed to evaluate this expression?
Consider the following grammar G: P → Q + R | Q – R | Q | R Q → q | r R → r | s where P, Q, and R are non-terminal symbols, and q, r, and s are terminal symbols. Which of the following statement(s) is/are correct? S1. LL(1) can parse all strings that are generated using grammar G S2. LR(1) can parse all strings that are generated using grammar G
Consider the following context-free grammar where the set of terminals is {a, b, c, d, f}. S → d a T | R f T → a S | b a T | ϵ R → c a T R | ϵ The following is a partially-filled LL(1) parsing table. Which one of the following choices represents the correct combination for the numbered cells in the parsing table ("blank" denotes that the corresponding cell is empty)?
Consider the following grammar G S → F | H F → p | c H → d | c Where S, F, and H are non-terminal symbols, p, d, and c are terminal symbols. Which of the following statement(s) is/are correct? S1. LL(1) can parse all strings that are generated using grammar G S2. LR(1) can parse all string that are generated using grammar G
Which of the following options has correctly shown the top­down parsing for the sentence "Rachel ate a peach"? (Consider NP, VP, N, V, ART means noun predicate, verb predicate, noun, verb and article respectively)
Ads