Test my Merit My Results Create Exam

Higher Study | Compiler Design | Syntax Analysis

Consider the following grammar: E → TE' E' →+ TE' |ϵ  T → FT' ; T' → ∗FT' | ϵ  F → (E) | (id) What will be the result of FIRST (T')?
Consider the following grammar: P → xQRS Q → yz |z R → w | ε S → y What is FOLLOW(Q)?
Consider the grammar defined by the following production rules, with two operators ∗ and + S → T * P T → U|T * U P → Q + P|Q Q → Id U → Id Which one of the following is TRUE?
Which is a permanent database in the general model of compiler?
Which one indicates a technique of building cross compilers?
Given the grammar s → T * S | T T → U + T | U U → a | b Which of the following statements is wrong?
Consider the following statements. I. Symbol table is accessed only during lexical analysis and syntax analysis. II. Compilers for programming languages that support recursion necessarily need heap storage for memory allocation in the run-time environment. III. Errors violating the condition ‘any variable must be declared before its use’ are detected during syntax analysis. Which of the above statements is/are TRUE?
Consider the following ANSI C program: int main() { Integer x; return 0; } Which one of the following phases in a seven-phase C compiler will throw an error?  
Ads