GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

199.

An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if
[2 marks]
(A) The SLR(1) parser for G has S-R conflicts
(B) The LR(1) parser for G has S-R conflicts
(C) The LR(0) parser for G has S-R conflicts
(D) The LALR(1) parser for G has reduce-reduce conflicts

asked in Computer Science And Engineering, 2008

View Comments [0 Reply]
200.

Which of the following are true? [2 marks]
I. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation
II. Multi-level access link (or display) arrangement is needed to arrange activation records only if the programming language being implemented has nesting of procedures/functions
III. Recursion in programming languages cannot be implemented with dynamic storage allocation
IV. Nesting procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records
V. Programming languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records
(A) II and V only
(B) I, III and IV only
(C) I, II and V only
(D) II, III and V only

asked in Computer Science And Engineering, 2008

View Comments [0 Reply]
201.

Which of the following are regular sets?
I. {aⁿb^2m | n≥0, m≥0}
II. {aⁿb^m | n=2m}
III. {aⁿb^m | n≠m}
IV. {xcy | x,y ∈ (a,b)^*} [2 marks]
(A) I and IV only
(B) I and III only
(C) I only
(D) IV only

asked in Computer Science And Engineering, 2008

View Comments [0 Reply]
202.

Match the following NFAs with the regular expressions they correspond to

1. ε + 0(01*1 + 00) * 01*
2. ε + 0(10 *1 + 00) * 0
3. ε + 0(10 *1 + 10) *1
4. ε + 0(10 *1 + 10) *10 *
[2 marks]
(A) P − 2, Q − 1, R − 3, S − 4
(B) P − 1, Q − 3, R − 2, S − 4
(C) P − 1, Q − 2, R − 3, S − 4
(D) P − 3, Q − 2, R − 1, S − 4

asked in Computer Science And Engineering, 2008

View Comments [0 Reply]

203.

Match the following:

E. Checking that identifiers are
declared before their use P. L = {aⁿb^mcⁿd^m | n≥1, m≥1}

F. Number of formal parameters in
the declaration of a function
agrees with the number of actual
parameters in use of that function Q. X ↔ XbX | XcX | dXf | g

G. Arithmetic expressions with
matched pairs of parentheses
R. L = {wcw w ∈(a b) *}

H. Palindromes
S. X → bXb | cXc | ε

[2 marks]
(A) E − P, F − R, G − Q, H − S
(B) E − R, F − P, G − S, H − Q
(C) E − R, F − P, G − Q, H − S
(D) E − P, F − R, G − S, H − Q

asked in Computer Science And Engineering, 2008

View Comments [0 Reply]

204.

Given below are two finite state automata (→ indicates the start state and F indicates a final state)

Which of the following represents the product automaton Z×Y? [2 marks]

asked in Computer Science And Engineering, 2008

View Comments [0 Reply]

801 1 ...‹‹32 3334 35 36 ›› ... 134

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now