Back to the 2019 paper
Similar questions
Compiler DesignFor a grammar G, shift reduce (S-R) conflicts are present in LALR(1) parser, if and only if (i) The LAR (1) parser for G has S.R conflicts (ii) The LR(0) parser for G has S.R conflicts (iii) The SLR(1) parser for G has S.R conflicts (iv) The SLR(0) parser for G has S.R conflicts20232m Compiler DesignChoose the correct answer of the following: If a grammar is LALR(1), then it is necessarily (i) SLR(1) (ii) LR(1) (iii) LL(1) (iv) None of the above20222m Compiler DesignConsider the following grammar: E \rightarrow E + T | T T \rightarrow T * F | F F \rightarrow (E) | id Determine whether the grammar is SLR(1), clearly stating any shift-reduce or reduce-reduce conflicts.20242mFormal Language & Automata TheoryConsider the grammar G whose SLR parser has n_1 states and LALR parser has n_2 states. What is the relation between n_1 and n_2? (i) n_1 = n_2 (ii) n_1 < n_2 (iii) n_1 > n_2 (iv) None of the above20192m
PreviousChoose the correct answer of the following: In a compiler, ________ checks every character of the source text. (i) the lexical analyzer (ii) the syntax analyzer (iii) the code generator (iv) the code optimizerNextChoose the correct answer of the following: In an absolute loading scheme, which loader function is accomplished by programmer? (i) Allocation (ii) Linking (iii) Reallocation (iv) Both (i) and (ii)