Register
Webpage for Compiler Design:

Recent questions tagged compiler-design

2 votes
1 answer
1441
Test by Bikram | Compiler Design | Test 1 | Question: 14
Consider the following grammar: $E' \rightarrow E$ $E \rightarrow E + Y \mid Y$ $Y \rightarrow Y ^* F \mid F$ $F \rightarrow id \mid (E)$ How many $LR(0)$ items are there in closure $(\{E' \rightarrow \cdot E\})$? $1$ $6$ $7$ $5$
Consider the following grammar: $E' \rightarrow E$$E \rightarrow E + Y \mid Y$$Y \rightarrow Y ^* F \mid F$$F \rightarrow id \mid (E)$How many $LR(0)$ items are there in ...
User Avatar
2 votes
2 answers
1443
Test by Bikram | Compiler Design | Test 1 | Question: 12
Read the below mentioned grammar: $S \rightarrow X$ $X \rightarrow YX \mid \epsilon$ $Y \rightarrow aY \mid b$ This grammar is NOT: $LALR$ $LR (0)$ $LR(1)$ None of the above
Read the below mentioned grammar:$S \rightarrow X$$X \rightarrow YX \mid \epsilon$$Y \rightarrow aY \mid b$This grammar is NOT:$LALR$$LR (0)$$LR(1)$None of the above
User Avatar
3 votes
1 answer
1445
Test by Bikram | Compiler Design | Test 1 | Question: 10
The grammar which has no epsilon transition or two adjacent nonterminals in the right side of any production is ___________. LL(1) grammar Unambiguous grammar Operator grammar Context Sensitive grammar
The grammar which has no epsilon transition or two adjacent nonterminals in the right side of any production is ___________.LL(1) grammarUnambiguous grammarOperator gramm...
User Avatar
2 votes
1 answer
1446
Test by Bikram | Compiler Design | Test 1 | Question: 9
___________ parsers build parse trees starting from the root node and work down to the leaves. LR LL SLR LALR
___________ parsers build parse trees starting from the root node and work down to the leaves.LRLLSLRLALR
User Avatar
2 votes
2 answers
1447
Test by Bikram | Compiler Design | Test 1 | Question: 8
Read the following grammar: $S \rightarrow Ka \mid bKc \mid dc \mid bda$ $K \rightarrow d$ This grammar is NOT: LALR(1) SLR(1) LR(1) None of the above
Read the following grammar:$S \rightarrow Ka \mid bKc \mid dc \mid bda$$K \rightarrow d$This grammar is NOT:LALR(1)SLR(1)LR(1)None of the above
User Avatar
4 votes
1 answer
1448
Test by Bikram | Compiler Design | Test 1 | Question: 7
The number of proper prefixes for a string of length $n$ are ___________. $n+1$ $n(n+1)/2$ $n-1$ $(n-1)/2$
The number of proper prefixes for a string of length $n$ are ___________.$n+1$$n(n+1)/2$$n-1$$(n-1)/2$
User Avatar
2 votes
1 answer
1450
Test by Bikram | Compiler Design | Test 1 | Question: 5
__________ is the most powerful parsing method. LL(1) LALR SLR Canonical LR
__________ is the most powerful parsing method.LL(1)LALRSLRCanonical LR
User Avatar
2 votes
1 answer
1451
Test by Bikram | Compiler Design | Test 1 | Question: 4
A top-down parser generates ________________. right-most derivation right-most derivation in reverse left-most derivation left-most derivation in reverse
A top-down parser generates ________________.right-most derivationright-most derivation in reverseleft-most derivationleft-most derivation in reverse
User Avatar
2 votes
1 answer
1453
Test by Bikram | Compiler Design | Test 1 | Question: 2
The default type of conflict resolution rule for the Yacc parser generator is _________________. in favor of shift in favor of reduce either shift or reduce dependent on a situation
The default type of conflict resolution rule for the Yacc parser generator is _________________. in favor of shift in favor of reduce either shift or reduce depen...
User Avatar
3 votes
1 answer
1454
Test by Bikram | Compiler Design | Test 1 | Question: 1
Match the following: ... $a-3; b-4; c-2; d-1$ $a-2; b-1; c-4; d-3$ $a-3; b-2; c-4; d-1$
Match the following:$$\begin{array}{|l|l|l|l|} \hline a. & \text{Canonical Parser} & 1. & \text{No adjacent nonterminals} \\ \hline b. & \text{SLR(1) Parser} & 2. & \text...
User Avatar
0 votes
1 answer
1456
In SDT what is the role of array reference in the Arithmetic Expression?
In SDT what is the role of array reference in the Arithmetic Expression please explain
In SDT what is the role of array reference in the Arithmetic Expression please explain
User Avatar
17 votes
2 answers
1457
GATE CSE 1990 | Question: 4-v
State whether the following statements are TRUE or FALSE with reason: The Link-load-and-go loading scheme required less storage space than the link-and-go loading scheme.
State whether the following statements are TRUE or FALSE with reason:The Link-load-and-go loading scheme required less storage space than the link-and-go loading scheme.
User Avatar
1 votes
3 answers
1459
MadeEasy Test Series: Compiler Design - Parsing
Let 'x', 'y', 'z' and 'u' represents the number of entries in rows of Non-terminals 'S', 'A', 'B' and 'C' respectively. The value of x + y + z + u is ______ .
Let 'x', 'y', 'z' and 'u' represents the number of entries in rows of Non-terminals 'S', 'A', 'B' and 'C' respectively. The value of x + y + z + u is ______ .
User Avatar
1 votes
0 answers
1461
DAg for this wil be _________
User Avatar
0 votes
0 answers
1467
What are the important topics of TOC?
I have started GATE preparation today, I am not comfortable with Theory of computation, Compiler design and COA, please provide me list of topics which have highest mark distribution and should be concentrated
I have started GATE preparation today, I am not comfortable with Theory of computation, Compiler design and COA, please provide me list of topics which have highest mark ...
User Avatar
0 votes
1 answer
1468
ACE test
The Grammar E->TE|a, T->ET|b is (a) LR(0) (b) SLR(1) (c) LR(1) (d) None
The Grammar E->TE|a, T->ET|b is (a) LR(0) (b) SLR(1) (c) LR(1) (d) None
User Avatar
0 votes
1 answer
1469
compilation
Which of the following class of statement usually produces no executable codes when compiled? Assignment Declaration Input and output statement Structural statements
Which of the following class of statement usually produces no executable codes when compiled?Assignment Declaration Input and output statement Structural statements
User Avatar
Page: