Register

Recent questions tagged grammar

2 votes
1 answer
301
Ace Test Series: Compiler Design - Grammar
Is the following question even valid? Shouldn't there be a production for all variables?
Is the following question even valid? Shouldn't there be a production for all variables?
User Avatar
1 votes
1 answer
302
Compiler
User Avatar
2 votes
3 answers
305
Theory-of-computation
S-> S+S | S*S | a | € Which is false? a) G is ambiguous b) L is ambiguous c) both a and b d) none
S- S+S | S*S | a | €Which is false? a) G is ambiguous b) L is ambiguous c) both a and bd) none
User Avatar
2 votes
2 answers
307
ambiguous grammar
Consider the following context-free grammar S → SS + | SS*| a for the string aa + a*. Is the grammar ambiguous ?
Consider the following context-free grammarS → SS + | SS*| a for the string aa + a*. Is the grammar ambiguous ?
User Avatar
4 votes
1 answer
308
parser
What is the maximum number of reduce moves that can be taken by a bottom up parser for a grammar without epsilon and unit production (i.e., of type A →∈ and A →B ) to parse a string with n tokens? 2n – 1 2n n – 1 n/2
What is the maximum number of reduce moves that can be taken by a bottom up parser for a grammar without epsilon and unit production (i.e., of type A →∈ and A →B ) ...
User Avatar
3 votes
1 answer
309
Predictive parse table ?
Predictive parse table for following grammars: 1.S->FR R->*S/∈ F->id and 2.S->iEtSS' | a S'->eS | ∈ E->b
Predictive parse table for following grammars:1.S->FR R->*S/∈ F->idand2.S->iEtSS' | a S'->eS | ∈ E->b
User Avatar
0 votes
1 answer
312
MadeEasy Test Series: Theory Of Computation - Grammar
If a parse tree is made for a w ε L(G), when G is in Chomsky-Normal form then what would be it's least height?? Plz explain what and how...
If a parse tree is made for a w ε L(G), when G is in Chomsky-Normal form then what would be it's least height?? Plz explain what and how...
User Avatar
0 votes
1 answer
313
#compiler design
Can ambiguous grammars have precedence and associativity??
Can ambiguous grammars have precedence and associativity??
User Avatar
0 votes
2 answers
316
UGC NET CSE | June 2010 | Part 2 | Question: 34
Which of the following is the most general phase structured grammar ? Regular Context-sensitive Context free None of the above
Which of the following is the most general phase structured grammar ?RegularContext-sensitiveContext freeNone of the above
User Avatar
1 votes
0 answers
317
Parsing
Consider the Grammer S -> (S) | SS | () In the goto graph of LR(0) item, the number of inadequate states are (A). 1 (B). 2 (C). 3 (D). 4
Consider the Grammer S - (S) | SS | ()In the goto graph of LR(0) item, the number of inadequate states are(A). 1(B). 2(C). 3(D). 4
User Avatar
3 votes
1 answer
320
UGC NET CSE | December 2014 | Part 3 | Question: 62
Match the following $:$ ... $\text{a-iv, b-i, c-ii, d-iii}$ $\text{a-i, b-iv, c-iii, d-ii}$
Match the following $:$ $\begin{array} {clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.}& \text{Context free grammar} & \text{i.} & \text{Linear bounded a...
User Avatar
1 votes
1 answer
321
UGC NET CSE | Junet 2015 | Part 2 | Question: 33
If all the production rules have single non-terminal symbol on the left side, the grammar defined is: Context free grammar Context sensitive grammar Unrestricted grammar Phase grammar
If all the production rules have single non-terminal symbol on the left side, the grammar defined is:Context free grammarContext sensitive grammarUnrestricted grammarPhas...
User Avatar
2 votes
1 answer
322
grammer compiler design
15. A grammar will be meaningless of the (a) terminal set and non-terminal set are not disjoint (b) left hand side of a productions is a single terminal (c) left hand side of a production has no non-terminal (d) all of the above
15. A grammar will be meaningless of the(a) terminal set and non-terminal set are not disjoint(b) left hand side of a productions is a single terminal(c) left hand side o...
User Avatar
3 votes
3 answers
323
Compiler Design LR(0) Checking
Is E --> E+T / T , T --> i is LR(0) grammar ?
Is E E+T / T , T i is LR(0) grammar ?
User Avatar
2 votes
1 answer
328
UGC NET CSE | June 2013 | Part 3 | Question: 35
Which of the following is/are the fundamental semantic model(s) of parameter passing? in mode out mode in-out mode all of the above
Which of the following is/are the fundamental semantic model(s) of parameter passing?in modeout modein-out modeall of the above
User Avatar
0 votes
1 answer
329
UGC NET CSE | June 2014 | Part 3 | Question: 74
Match the following $:$ ... $\text{a-iii, b-iv, c-i, d-ii}$ $\text{a-iii, b-iv, c-ii, d-i}$
Match the following $:$$\begin{array}{clcl} & \textbf{List – I} & & \textbf{List – II} \\ \text{a.} & \text{Chomsky Normal form} & \text{i.} & S \rightarrow b S S...
User Avatar
Page: