Register

Search results for compiler-design+gate1998

18 votes
2 answers
1
GATE CSE 1998 | Question: 1.28
A linker reads four modules whose lengths are $200, 800, 600$ and $500$ words, respectively. If they are loaded in that order, what are the relocation constants? $0, 200, 500, 600$ $0, 200, 1000, 1600$ $200, 500, 600, 800$ $200, 700, 1300, 2100$
A linker reads four modules whose lengths are $200, 800, 600$ and $500$ words, respectively. If they are loaded in that order, what are the relocation constants?$0, 200, ...
User Avatar
46 votes
2 answers
2
GATE CSE 1998 | Question: 1.27
Type checking is normally done during lexical analysis syntax analysis syntax directed translation code optimization
Type checking is normally done duringlexical analysissyntax analysissyntax directed translationcode optimization
User Avatar
12 votes
4 answers
3
GATE CSE 1998 | Question: 14
Let $G_1 = (N, T, P, S_1)$ be a CFG where, $N=\{S_1, A, B\},T=\{a, b\}$ and $P$ ... $5$ production rules. Is $L_2$ inherently ambiguous?
Let $G_1 = (N, T, P, S_1)$ be a CFG where, $N=\{S_1, A, B\},T=\{a, b\}$ and $P$ is given by$$\begin{array}{l|l}S_1 \rightarrow a S_1 b &S_1 \rightarrow a B b \\S_1 \right...
User Avatar
26 votes
3 answers
4
GATE CSE 1998 | Question: 1.25, ISRO2008-41
In a resident – OS computer, which of the following systems must reside in the main memory under all situations? Assembler Linker Loader Compiler
In a resident – OS computer, which of the following systems must reside in the main memory under all situations?AssemblerLinkerLoaderCompiler
User Avatar
24 votes
2 answers
5
GATE CSE 1998 | Question: 1.26
Which of the following statements is true? SLR parser is more powerful than LALR LALR parser is more powerful than Canonical LR parser Canonical LR parser is more powerful than LALR parser The parsers SLR, Canonical CR, and LALR have the same power
Which of the following statements is true?SLR parser is more powerful than LALRLALR parser is more powerful than Canonical LR parserCanonical LR parser is more powerful t...
User Avatar
26 votes
2 answers
6
GATE CSE 1998 | Question: 6b
Consider the grammar S $\rightarrow Aa \mid b$ A $\rightarrow Ac \mid Sd \mid \epsilon$ Construct an equivalent grammar with no left recursion and with minimum number of production rules.
Consider the grammarS $\rightarrow Aa \mid b$A $\rightarrow Ac \mid Sd \mid \epsilon$Construct an equivalent grammar with no left recursion and with minimum number of pr...
User Avatar
28 votes
1 answer
9
GATE CSE 1998 | Question: 2.15
Faster access to non-local variables is achieved using an array of pointers to activation records called a stack heap display activation tree
Faster access to non-local variables is achieved using an array of pointers to activation records called a stackheapdisplayactivation tree
User Avatar
To see more, click for the full list of questions or popular tags.