Back to the 2019 paper
Similar questions
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 DesignChoose the correct answer of the following: For a grammar G, shift reduce (S-R) conflicts are present in LALR(1) parser, if and only if (i) the LR(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 conflicts20192mFormal Language & Automata TheoryLet w be any string of length n in \{0, 1\}^*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic FA that accepts L? (i) n - 1 (ii) n (iii) n + 1 (iv) 2n - 120192m Compiler DesignChoose the correct option / answer the following: Which of the following parsers can parse ambiguous grammars? (i) LL(1) (ii) Operator Precedence (iii) CLR(1) (iv) None of the above20242m
PreviousConsider the following statements about the context-free grammar: (1) G = \{S \to SS, S \to ab, S \to ba, S \to \epsilon\} (2) G is ambiguous (3) G produces all strings with equal number of a's and b's G can be accepted by a deterministic PDA. Which combination below expresses all the true statements about G? (i) 1 only (ii) 1 and 3 (iii) 2 and 3 (iv) 1, 2 and 3NextLet w be any string of length n in \{0, 1\}^*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic FA that accepts L? (i) n - 1 (ii) n (iii) n + 1 (iv) 2n - 1
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.