Register
Webpage for Compiler Design:

Recent questions tagged compiler-design

1 votes
1 answer
1681
features that needed to implement top down parsing
Which of the following feature(s) is/are needed to implement top down parsing Source string marker Prediction making mechanism Matching and Backtracking mechanism All of the above
Which of the following feature(s) is/are needed to implement top down parsingSource string marker Prediction making mechanismMatching and Backtracking me...
User Avatar
3 votes
3 answers
1682
ISRO2011-3
In compiler terminology reduction in strength means Replacing run time computation by compile time computation Removing loop invariant computation Removing common subexpressions replacing a costly operation by a relatively cheaper one
In compiler terminology reduction in strength meansReplacing run time computation by compile time computationRemoving loop invariant computationRemoving common subexpress...
User Avatar
1 votes
3 answers
1683
UGC NET CSE | June 2014 | Part 2 | Question: 08
A shift reduce parser suffers from Shift reduce conflict only Reduce reduce conflict only Both shift reduce conflict and reduce reduce conflict Shift handle and reduce handle conflicts
A shift reduce parser suffers from Shift reduce conflict only Reduce reduce conflict only Both shift reduce conflict and reduce reduce conflict Shift handle and reduce ha...
User Avatar
2 votes
1 answer
1684
UGC NET CSE | June 2014 | Part 2 | Question: 07
Which of the following suffices to convert an arbitrary $CFG$ to an $LL(1)$ grammar ? Removing left recursion alone Removing the grammar alone Removing left recursion and factoring the grammar None of the above
Which of the following suffices to convert an arbitrary $CFG$ to an $LL(1)$ grammar ? Removing left recursion aloneRemoving the grammar alone Removing left recursion and ...
User Avatar
0 votes
1 answer
1686
IISC-CSA-Research-Test-2
Which of the following components of a compiler runs earlier in the flow of compilation? - the lexical analyser - the type checker
Which of the following components of a compiler runs earlier in the flow of compilation?- the lexical analyser- the type checker
User Avatar
0 votes
1 answer
1688
Compiler Translation Phase
What exactly a translation Process is ? in compiler Design .Can someone explain Briefly .
What exactly a translation Process is ? in compiler Design .Can someone explain Briefly .
User Avatar
1 votes
2 answers
1693
if there is no semantic action associated with SDT can we still be able to find out what type of STD it is .
Either L attribute or S attributed .What kind of SDT it is ?S ->E# Out('#')E - E+E Out('+')E ->TT - T#F Out('*)T - FF - (E)F - a Out ('a')For the sentence...
User Avatar
2 votes
1 answer
1699
How to remove Left recursion from this Grammar ?
A-->AA+/AA*/a is it eligible to be used by SR parse. If we apply SR parse on this grammar then what will be the order of activation Record in Stack
A >AA+/AA*/ais it eligible to be used by SR parse.If we apply SR parse on this grammar then what will be the order of activation Record in Stack
User Avatar
0 votes
1 answer
1700
Compiler
While evaluating the semantic action which of the following parser is more efficient ? Top Down Parser Bottom Up Parser Explain with the example ?
While evaluating the semantic action which of the following parser is more efficient ?Top Down ParserBottom Up ParserExplain with the example ?
User Avatar
6 votes
1 answer
1701
ISRO2009-43
Substitution of values for names (whose values are constants) is done in Local optimization Loop optimization Constant folding Strength reduction
Substitution of values for names (whose values are constants) is done inLocal optimizationLoop optimizationConstant foldingStrength reduction
User Avatar
4 votes
3 answers
1702
ISRO2009-32
The expression $1 * 2 \wedge 3 * 4 \wedge 5 * 6$ will be evaluated as $32^{30}$ $162^{30}$ 49152 173458 In original quetion 5 is not given.
The expression $1 * 2 \wedge 3 * 4 \wedge 5 * 6$ will be evaluated as$32^{30}$$162^{30}$49152173458In original quetion 5 is not given.
User Avatar
0 votes
1 answer
1705
Compiler
There may exist a grammar that is non LL(1) but generating an LL(1) language. Explain whether the above statement is true or false .
There may exist a grammar that is non LL(1) but generating an LL(1) language.Explain whether the above statement is true or false .
User Avatar
0 votes
1 answer
1706
Compiler
The order in which alternative are tried in a backtracking parser affect the language accepted by the compiler or parser. Whether the given statement is valid? Explain with example?
The order in which alternative are tried in a backtracking parser affect the language accepted by the compiler or parser.Whether the given statement is valid? Explain wi...
User Avatar
2 votes
1 answer
1708
How to eliminate indirect left recursion ?
J -> Lx K -> Ly L -> J | K | f Whoever Answers Please Explain Methods solving such Questions .
J - Lx K - Ly L - J | K | fWhoever Answers Please Explain Methods solving such Questions .
User Avatar
Page: