1
In a compiler the module that checks every character of the source text is called:
2
Consider the following grammar:
$$\eqalign{ & S \to S \cr & S \to SS\,|\,a\,|\,\varepsilon \cr} $$(a) Construct the collection of sets of LR(0) items for this grammar and draw its go to graph.
(b) Indicate the shift-reduce and reduce-reduce conflict (if any) in the various state of the LR(0) parser.
3
The complement(s) of the element 'a' in the lattice shown in Fig. is (are) ........... .
4
Solve the recurrence equations:
$$\,\,\,\,\,\,\,\,\,\,T\left( n \right) = \left( {{n \over 2}} \right) + 1$$
$$\,\,\,\,\,\,\,\,\,\,\,T\left( 1 \right) = 1$$
$$\,\,\,\,\,\,\,\,\,\,T\left( n \right) = \left( {{n \over 2}} \right) + 1$$
$$\,\,\,\,\,\,\,\,\,\,\,T\left( 1 \right) = 1$$
5
State an undesirable characteristic of each of the following criteria for measuring performance of an operating system:
(a) Turn around time. (b) Waiting time.
(a) Turn around time. (b) Waiting time.
Subject
Compiler Design
2
Discrete Mathematics
2
Operating Systems
1
More Papers of GATE CSE
2025
GATE CSE 2025 Set 2GATE CSE 2025 Set 12024
GATE CSE 2024 Set 2GATE CSE 2024 Set 12023
GATE CSE 20232022
GATE CSE 20222021
GATE CSE 2021 Set 2GATE CSE 2021 Set 12020
GATE CSE 20202019
GATE CSE 20192018
GATE CSE 20182017
GATE CSE 2017 Set 1GATE CSE 2017 Set 22016
GATE CSE 2016 Set 1GATE CSE 2016 Set 22015
GATE CSE 2015 Set 3GATE CSE 2015 Set 1GATE CSE 2015 Set 22014
GATE CSE 2014 Set 3GATE CSE 2014 Set 1GATE CSE 2014 Set 22013
GATE CSE 20132012
GATE CSE 20122011
GATE CSE 20112010
GATE CSE 20102009
GATE CSE 20092008
GATE CSE 20082007
GATE CSE 20072006
GATE CSE 20062005
GATE CSE 20052004
GATE CSE 20042003
GATE CSE 20032002
GATE CSE 20022001
GATE CSE 20012000
GATE CSE 20001999
GATE CSE 19991998
GATE CSE 19981997
GATE CSE 19971996
GATE CSE 19961995
GATE CSE 19951994
GATE CSE 19941993
GATE CSE 19931992
GATE CSE 19921991
GATE CSE 19911990
GATE CSE 19901989
GATE CSE 19891988
GATE CSE 19881987
GATE CSE 1987