Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Compiler Design:
Recent questions tagged compiler-design
3
votes
4
answers
1381
#compiler
given Grammar E → E + E E → E * E E → ( E ) E → id Find set of handles and viable prefixes for the input string id1 + id2 * id3
given GrammarE → E + EE → E * EE → ( E )E → idFind set of handles and viable prefixes for the input string id1 + id2 * id3
papesh
4.2k
views
papesh
asked
Dec 13, 2016
Compiler Design
compiler-design
viable-prefix
+
–
14
votes
2
answers
1382
Tokenization in lexical analysis
Consider the following C program: int main (void) { in/*this is an example*/z; double/*is it an error?*/y; print( “This is simple” ); return 0; } - How many Different tokens are there in the above code.
Consider the following C program: int main (void) { in/*this is an example*/z; double/*is it an error?*/y; print( “This is simple” ); return 0; }- How many Different ...
dd
3.3k
views
dd
asked
Dec 13, 2016
Compiler Design
compiler-design
compiler-tokenization
lexical-analysis
+
–
4
votes
1
answer
1383
Static and Dynamic Linking phase
Consider the following statements: S1: When you statically link a file into an executable, the contents of the file are included during link time. S2: When you link dynamically, it is only during run time when a pointer to the file which is ... is included in the executable and then the contents of said file are loaded. Which of the above statements is/are true?
Consider the following statements:S1: When you statically link a file into an executable, the contents of the file are included during link time.S2: When you link dynamic...
dd
1.5k
views
dd
asked
Dec 13, 2016
Compiler Design
compiler-design
linker
+
–
0
votes
3
answers
1384
Symbol table data structure modification
A symbol is a compile time data structure. In which of the following phase/s a symbol is modified ? Only semantic analysis None of these Only lexical analysis Lexical analysis and syntax analysis
A symbol is a compile time data structure. In which of the following phase/s a symbol is modified ?Only semantic analysisNone of theseOnly lexical analysisLexical analysi...
dd
3.7k
views
dd
asked
Dec 13, 2016
Compiler Design
compiler-design
symbol-table
+
–
0
votes
1
answer
1385
Symbol table data-structure
Which of the following symbol table implementation is based on the property of locality of reference? Search Tree Hash Tree Self-organizing List Array
Which of the following symbol table implementation is based on the property of locality of reference?Search TreeHash TreeSelf-organizing ListArray
dd
2.5k
views
dd
asked
Dec 13, 2016
Compiler Design
compiler-design
symbol-table
+
–
3
votes
1
answer
1386
Parsers Complexity
Ashwani Kumar 2
1.2k
views
Ashwani Kumar 2
asked
Dec 11, 2016
Compiler Design
compiler-design
parsing
+
–
0
votes
1
answer
1387
SLR(1) Parser
Every SLR grammar is unambiguous. True or False? Why?
Every SLR grammar is unambiguous. True or False? Why?
Shyam Singh 1
1.5k
views
Shyam Singh 1
asked
Dec 10, 2016
Compiler Design
compiler-design
parsing
lr-parser
ambiguous-grammar
descriptive
+
–
0
votes
2
answers
1388
consider the following statements
Consider the following statements: S1: A syntax tree should not have keywords as leaves. S2: A syntax tree is a condensed form of parse tree. Which of the above statement/s is/are true? Neither S1 nor S2 Only S2 Both S1 & S2
Consider the following statements:S1: A syntax tree should not have keywords as leaves.S2: A syntax tree is a condensed form of parse tree.Which of the above statement/s ...
Akriti sood
2.0k
views
Akriti sood
asked
Dec 10, 2016
Compiler Design
compiler-design
parsing
+
–
0
votes
1
answer
1389
Is this grammar LL1, LR0, SLR1, LALR1, CLR1?
$S\rightarrow (x$ $\text{ }| E]$ $\text{ }| F)$ $X\rightarrow E)$ $\text{ }| F]$ $E\rightarrow A$ $F\rightarrow A$ $A\rightarrow \lambda$
$S\rightarrow (x$$\text{ }| E]$$\text{ }| F)$$X\rightarrow E)$$\text{ }| F]$$E\rightarrow A$$F\rightarrow A$$A\rightarrow \lambda$
GateAspirant999
592
views
GateAspirant999
asked
Dec 10, 2016
Compiler Design
compiler-design
parsing
ll-parser
lr-parser
descriptive
+
–
1
votes
0
answers
1390
MadeEasy Test Series: Compiler Design - Parsing
Vineeta Garg
291
views
Vineeta Garg
asked
Dec 10, 2016
Compiler Design
made-easy-test-series
compiler-design
parsing
lr-parser
+
–
1
votes
1
answer
1391
MadeEasy Test Series: Compiler Design - Grammar
How it is left factored??
How it is left factored??
Vineeta Garg
561
views
Vineeta Garg
asked
Dec 10, 2016
Compiler Design
made-easy-test-series
compiler-design
grammar
+
–
1
votes
0
answers
1392
consider the following errors
Consider the following errors : i.) Accessing array index which is out of bounds ii.) Context errors iii.) Calling method with arguments of wrong type iv.) Misspelling a keyword Which of the following option/s is/are false? i, ii , iii are ... the pre-processor. only ii is detected in type checking phase i, ii, iii are semantic errors please explain each one...
Consider the following errors :i.) Accessing array index which is out of boundsii.) Context errorsiii.) Calling method with arguments of wrong typeiv.) Misspelling a keyw...
Akriti sood
243
views
Akriti sood
asked
Dec 10, 2016
Compiler Design
compiler-design
+
–
0
votes
0
answers
1393
Which of the following statement/s is/are false for the following language:
Which of the following statement/s is/are false for the following language: L = {am bn cq | m = n or n = q, m > 0, n > 0, q > 0} S1: The language can be parsed by any LR(K) parsers for any value of K. S2: The language cannot be recognized by deterministic PDA. Only S2 Only S1 Both S1 and S2 Neither S1 nor S2
Which of the following statement/s is/are false for the following language:L = {am bn cq | m = n or n = q, m 0, n 0, q 0}S1: The language can be parsed by any LR(K) pa...
Akriti sood
1.1k
views
Akriti sood
asked
Dec 10, 2016
Compiler Design
theory-of-computation
compiler-design
+
–
3
votes
3
answers
1394
which of the foll is correct
Consider the grammar G' given below: S → aSa | bSb | a | b | ϵ Which of the following option is incorrect? G is ambiguous G is unambiguous G generates palindrome strings There exists only one left most derivation for a given string. the ... but i am getting only on eparse tree for any string. but,if a grammar needs left factoring then grammar is ambigous..right??
Consider the grammar ‘G’ given below:S → aSa | bSb | a | b | ϵWhich of the following option is incorrect? G is ambiguous G is unambiguous G generates palindrome...
Akriti sood
1.7k
views
Akriti sood
asked
Dec 10, 2016
Compiler Design
compiler-design
parsing
ambiguous-grammar
+
–
2
votes
1
answer
1395
can LR(1) parser parse any context free grammar/language ??
can LR(1) parser parse any context-free grammar/language ?? and hence every regular language can be parsed by LR(1) parsers.
can LR(1) parser parse any context-free grammar/language ??and hence every regular language can be parsed by LR(1) parsers.
Akriti sood
4.2k
views
Akriti sood
asked
Dec 10, 2016
Compiler Design
compiler-design
parsing
+
–
0
votes
0
answers
1396
Error in compilation
What is the type of error (earliest phase) identified during the compilation of the following program ? #include <stdio.h> main( ) { int x, y, z; x = y = z = 10.3; printf(“%c”, x); }
What is the type of error (earliest phase) identified during the compilation of the following program ? #include <stdio.h main( ) { int x, y, z; x = y = z = 10.3; printf(...
vaishali jhalani
774
views
vaishali jhalani
asked
Dec 10, 2016
Compiler Design
compiler-design
+
–
2
votes
1
answer
1397
Compiler-Static Allocation Strategy:No of activation Records Present?
Is it 0 or 1?
Is it 0 or 1?
KISHALAY DAS
401
views
KISHALAY DAS
asked
Dec 9, 2016
Compiler Design
compiler-design
runtime-environment
numerical-answers
test-series
+
–
0
votes
1
answer
1398
How interpreter works compared to compiler?
Pick the correct statement about interpreter: A. No Intermediate Object Code is Generated B. No machine code is generated I. A II. B III. Both A and B Iv. Neither a nor B
Pick the correct statement about interpreter:A. No Intermediate Object Code is GeneratedB. No machine code is generatedI. AII. BIII. Both A and BIv. Neither a nor...
sh!va
403
views
sh!va
asked
Dec 8, 2016
Compiler Design
compiler-design
target-code-generation
+
–
1
votes
1
answer
1399
the same identifier X is used to represent two distinct variables in the same function in a C program,
The same identifier X is used to represent two distinct variables in the same function in a C program, then which of the following statement is / are TRUE?S1: The lexical...
Akriti sood
818
views
Akriti sood
asked
Dec 8, 2016
Compiler Design
compiler-design
lexical-analysis
descriptive
+
–
0
votes
1
answer
1400
true statement is:
Consider the following statements: S1: When you statically link a file into an executable, the contents of the file are included during link time. S2: When you link dynamically, it is only during run time when a pointer to the file which is linked in is included in the executable and then the contents of said file are loaded. Which of the above statements is/are true?
Consider the following statements:S1: When you statically link a file into an executable, the contents of the file are included during link time.S2: When you link dynamic...
Akriti sood
423
views
Akriti sood
asked
Dec 8, 2016
Compiler Design
compiler-design
runtime-environment
descriptive
+
–
2
votes
1
answer
1401
Which of the following symbol table implementation is based on the property of locality of reference?
Which of the following symbol table implementation is based on the property of locality of reference? Self-organizing list Hash tree Search tree Array
Akriti sood
12.1k
views
Akriti sood
asked
Dec 8, 2016
Compiler Design
compiler-design
symbol-table
+
–
2
votes
2
answers
1402
Which of the following features cannot be captured by CFG?
Which of the following features cannot be captured by CFG? Syntax of if - then – else statements Whether a variable is declared before its use Syntax of recursive procedures Matching nested parenthesis pls explain about first option.how is it CFG possible??
Which of the following features cannot be captured by CFG? Syntax of if - then – else statements Whether a variable is declared before its use Syntax of recursive pr...
Akriti sood
3.3k
views
Akriti sood
asked
Dec 8, 2016
Theory of Computation
compiler-design
theory-of-computation
context-free-language
+
–
2
votes
1
answer
1403
Parse tree evaluation
Rakesh K
592
views
Rakesh K
asked
Dec 6, 2016
Compiler Design
compiler-design
parsing
test-series
numerical-answers
+
–
1
votes
1
answer
1404
GATE CSE 1989 | Question: 10b
Consider the following grammar for variable declarations: <vardecl> $\rightarrow$ <vardecl><idlist> : <type>; <vardecl> $\rightarrow \in$ <idlist> $\rightarrow$ <idlist>, id <idlist> ... necessary. Make suitable assumptions regarding procedures operating on the symbol table; you need not elaborate upon these procedures.
Consider the following grammar for variable declarations:<vardecl $\rightarrow$ <vardecl><idlist : <type>;<vardecl $\rightarrow \in$<idlist $\rightarrow$ <idlist>, id<idl...
makhdoom ghaya
721
views
makhdoom ghaya
asked
Dec 5, 2016
Compiler Design
descriptive
gate1989
compiler-design
syntax-directed-translation
unsolved
+
–
3
votes
1
answer
1405
GATE CSE 1989 | Question: 10a
Will recursion work correctly in a language with static allocation of all variables? Explain.
Will recursion work correctly in a language with static allocation of all variables? Explain.
makhdoom ghaya
1.3k
views
makhdoom ghaya
asked
Dec 5, 2016
Compiler Design
gate1989
descriptive
compiler-design
runtime-environment
+
–
2
votes
4
answers
1406
made easy sheet
please expain all four questions.
please expain all four questions.
Shivam Shukla 1
862
views
Shivam Shukla 1
asked
Dec 5, 2016
Compiler Design
compiler-design
runtime-environment
numerical-answers
made-easy-booklet
+
–
1
votes
2
answers
1407
Made Easy Test Series
Consider the following CFG. S $\rightarrow$aAb|aBc|bAd|bBe A$\rightarrow$g B$\rightarrow$g The number of states exist in DFA using LALR (1) construction for the above grammar ____________?? (Doubt): In CLR(1) it takes 14 states and clubbing two states into one state will take ... ...!!! So 14 is the answer, I think.. But answer in Made Easy given as 13 Only.. Explain....???!!!
Consider the following CFG.S $\rightarrow$aAb|aBc|bAd|bBeA$\rightarrow$gB$\rightarrow$gThe number of states exist in DFA using LALR (1) construction for the above grammar...
Meghashyam Sujay
1.4k
views
Meghashyam Sujay
asked
Dec 4, 2016
Compiler Design
compiler-design
context-free-grammar
parsing
lr-parser
numerical-answers
+
–
5
votes
1
answer
1408
GATE CSE 1989 | Question: 8b
Indicate the result of the following program if the language uses (i) static scope rules and (ii) dynamic scope rules. var x, y:integer; procedure A (var z:integer); var x:integer; begin x:=1; B; z:= x end; procedure B; begin x:=x+1 end; begin x:=5; A(y); write (y) ...end.
Indicate the result of the following program if the language uses (i) static scope rules and (ii) dynamic scope rules.var x, y:integer; procedure A (var z:integer); var x...
makhdoom ghaya
1.5k
views
makhdoom ghaya
asked
Dec 3, 2016
Compiler Design
gate1989
descriptive
compiler-design
runtime-environment
+
–
0
votes
1
answer
1409
lexical analyzer
lexical error is______ 1.an error produced by LA when illegal character is appear 2.an error produced by LA when missing left parenthesis in expression 3.an error produced by scanner when both operator and parenthesis appeared consecutively 4.all of above
lexical error is______1.an error produced by LA when illegal character is appear2.an error produced by LA when missing left parenthesis in expression3.an error produced b...
Hira Thakur
685
views
Hira Thakur
asked
Dec 3, 2016
Compiler Design
compiler-design
lexical-analysis
+
–
3
votes
1
answer
1410
l and r values ULLMAN Q2.1
which of the following expressions have l-values ? which have r- values a)A[I+1] b)*A c)&A d)&(*A) e)*(&A) f)*(&(&A))
which of the following expressions have l-values ? which have r- valuesa)A[I+1] b)*A c)&Ad)&(*A) e)*(&A) f)*(&(&A))
Sanjay Sharma
2.8k
views
Sanjay Sharma
asked
Dec 3, 2016
Compiler Design
compiler-design
pointers
+
–
Page:
« prev
1
...
42
43
44
45
46
47
48
49
50
51
52
...
67
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register