Register

Recent questions tagged context-free-grammar

0 votes
1 answer
301
Test by Bikram | Mock GATE | Test 3 | Question: 11
Consider the grammar: $S\rightarrow$ $PQ | SQ | PS$ $P\rightarrow k$ $Q\rightarrow m$ To get a set of $n$ terminals, the number of productions to be used are ______. $n^{2}$ $n + 1$ $2n - 1$ $2n$
Consider the grammar:$S\rightarrow$ $PQ | SQ | PS$$P\rightarrow k$$Q\rightarrow m$To get a set of $n$ terminals, the number of productions to be used are ______. $n^{2...
User Avatar
0 votes
0 answers
304
Online Test Series
L1 = {an bm | n ≤ m ≤ 2n} L2 = {an bm│m≠n & m≠2n} Which of the following is true? A. Only L1 is CFG B. Only L2 is CFG C. Both are CFG D. None of them is CFG
L1 = {an bm | n ≤ m ≤ 2n}L2 = {an bm│m≠n & m≠2n}Which of the following is true?A. Only L1 is CFGB. Only L2 is CFGC. Both are CFGD. None of them is CFG
User Avatar
1 votes
5 answers
305
Test by Bikram | Mock GATE | Test 2 | Question: 38
$S\rightarrow A0 B$ $A\rightarrow BB \mid 0$ $B\rightarrow AA \mid 1$ The number of terminal strings of length $5$ generated by the context-free grammar shown above is _______.
$S\rightarrow A0 B$$A\rightarrow BB \mid 0$$B\rightarrow AA \mid 1$ The number of terminal strings of length $5$ generated by the context-free grammar shown above is ____...
User Avatar
1 votes
4 answers
306
Compiler
Consider the following grammar 1)Left Recursive 2)Ambiguos 3)Left factored 4)None of these
Consider the following grammar1)Left Recursive2)Ambiguos3)Left factored4)None of these
User Avatar
2 votes
1 answer
307
parsing
Convert the grammar to reduced form ? S->AB S->CA B->BC B->AB A->a C->aB |b
Convert the grammar to reduced form ?S->AB S->CA B->BC B->AB A->a C->aB |b
User Avatar
2 votes
1 answer
309
context free grammar || Linz 5.1
... third grammar In Linz book it is given as $\begin{align*} & S\rightarrow aSbSa|aaSb|bSaa|SS|a \\ \end{align*}$ ..better explanation if possible.??
$\begin{align*} & L = \left \{ w \in \left \{ a,b \right \}^{*}\;\; : n_a(w) \neq n_b(w) \right \} \\ & S\rightarrow aSb|bSa|A|B \\ & A \rightarrow aA|a \\ & B \rightarro...
User Avatar
0 votes
3 answers
313
cfg toc
S->AbaC A->BC B->b/epsilon C->D/epsilon D->d I want to know that will A contain epsilon as B and C both are null variables???(In Elimination of epsilon-production)
S->AbaCA->BCB->b/epsilonC->D/epsilonD->d I want to know that will A contain epsilon as B and C both are null variables???(In Elimination of epsilon-production)
User Avatar
1 votes
1 answer
315
ullman (toc)
design cfg for (i) {aibjck|i=j+k} (ii){aibj|i<=2j}
design cfg for(i) {aibjck|i=j+k}(ii){aibj|i<=2j}
User Avatar
1 votes
5 answers
318
MADE EASY TEST SERIES
Consider the following CFG: E --> E*T/T+E/T T --> (T*F)/F F --> id Which of the following strings are not generated by above CFG? A> id+id+id B> id∗id∗id C> (id∗id∗id) D> None of these
Consider the following CFG:E E*T/T+E/TT (T*F)/FF idWhich of the following strings are not generated by above CFG?A id+id+idB id∗id∗idC (id∗id∗id)D None of t...
User Avatar
1 votes
0 answers
321
#sipser book
Can ambiguous context free grammar be converted into CNF form..?
Can ambiguous context free grammar be converted into CNF form..?
User Avatar
2 votes
4 answers
323
grammer in compiler design
Which of the following is the most general phase-structured grammar? (a) regular (b) context-free (c) context-sensitive (d) none of the above
Which of the following is the most general phase-structured grammar?(a) regular (b) context-free(c) context-sensitive (d) none of the above
User Avatar
4 votes
2 answers
324
grammer in compiler design
Which of the following grammars are not phase-structured? (a) regular (b) context-free (c) context-sensitive (d) none of the above
Which of the following grammars are not phase-structured?(a) regular (b) context-free(c) context-sensitive (d) none of the above
User Avatar
3 votes
1 answer
328
UGC NET CSE | June 2013 | Part 3 | Question: 38
For every context free grammar (G) there exists an algorithm that passes any $w \in L(G)$ in number of steps proportional to $ln\mid w \mid$ $\mid w \mid$ $\mid w \mid^2$ $\mid w \mid^3$
For every context free grammar (G) there exists an algorithm that passes any $w \in L(G)$ in number of steps proportional to$ln\mid w \mid$$\mid w \mid$$\mid w \mid^2$$\m...
User Avatar
1 votes
2 answers
329
What is the number of terminal strings generated by given context-free grammar ?
S→ A 0B A→ BB|0 B →AA|1 What is the number of terminal strings of length 5 generated by the context-free grammar shown above? 4 5 6 7
S→ A 0BA→ BB|0B →AA|1What is the number of terminal strings of length 5 generated by the context-free grammar shown above?4567
User Avatar
Page: