Register

Recent questions tagged grammar

3 votes
2 answers
241
theoryof computation
Both these languages are not equivalent...right ???
Both these languages are not equivalent...right ???
User Avatar
1 votes
2 answers
242
theory of computation
User Avatar
0 votes
1 answer
243
theory of computation
User Avatar
0 votes
2 answers
244
theory of computation
User Avatar
0 votes
3 answers
245
theory of computation
User Avatar
0 votes
2 answers
246
theory of computation
User Avatar
0 votes
3 answers
247
theory of computation
L = (a^n b^n a^n | n = 1,2,3) is an example of a language that is A. context free B. not context free C. not context free but whose complement is CF D. both (b) and (c)
L = (a^n b^n a^n | n = 1,2,3) is an example of a language that isA.context freeB.not context freeC. not context free but whose complement is CFD. both (b) and (c)
User Avatar
0 votes
3 answers
248
theory of computation
Let sigma = { a,b }.Find the grammar which generates the language, where na(w) and nb(w) denote the number of a's in w and number of b's in w respectively.
Let sigma = { a,b }.Find the grammar which generates the language,where na(w) and nb(w) denote the number of a's in w and number of b's in w respectively.
User Avatar
0 votes
1 answer
251
Automata-Grammars
For the language L = { anbmcmdn : n , m>=1 } I came with following set of productions : S-->aSd | A A--> bAc | bc whereas the answer was given as below S--> aSd | aAd A--> bAc | bc how far is my answer correct?
For the language L = { anbmcmdn : n , m>=1 }I came with following set of productions :S >aSd | AA bAc | bcwhereas the answer was given as belowS aSd | aAdA bAc | bcho...
User Avatar
0 votes
3 answers
252
Peter Linz Exercise 5.1
Is the following language context-free? L= { uvwvR : u,v,w∈ {a,b}+ |u| = |w| =2 } If yes, provide set of productions for the same.
Is the following language context-free?L= { uvwvR : u,v,w∈ {a,b}+ |u| = |w| =2 }If yes, provide set of productions for the same.
User Avatar
1 votes
2 answers
254
Peter Linz Exercise 5.1
Give a context-free grammar for the language below : (n>=0, m>=0) L= { w ∊ {a,b}* : na(w)=2nb(w)+1}
Give a context-free grammar for the language below :(n>=0, m>=0)L= { w ∊ {a,b}* : na(w)=2nb(w)+1}
User Avatar
2 votes
1 answer
255
Peter Linz Exercise 5.3
Find the context-free grammar for the following language(n>=0 and m>=0) ? L={an bm : n<=m+3}
Find the context-free grammar for the following language(n>=0 and m>=0) ?L={an bm : n<=m+3}
User Avatar
0 votes
1 answer
257
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
1 answer
258
Test by Bikram | Mock GATE | Test 3 | Question: 8
The grammar having no Epsilon$\left ( \epsilon \right )$ transition or two adjacent nonterminals in the right side of any production is ? $LL$\left ( 1 \right )$ grammar Operator grammar Unambiguous grammar Context Sensitive grammar
The grammar having no Epsilon$\left ( \epsilon \right )$ transition or two adjacent nonterminals in the right side of any production is ?$LL$$\left ( 1 \right )$ grammarO...
User Avatar
1 votes
2 answers
260
PARSING
ARE NUMBER OF SHIFT ENTRIES / ACTIONS IN PARSING TABLE OF SLR(1) AND LALR(1) SAME ALWAYS??
ARE NUMBER OF SHIFT ENTRIES / ACTIONS IN PARSING TABLE OF SLR(1) AND LALR(1) SAME ALWAYS??
User Avatar
1 votes
2 answers
263
Grammar
Can set of terminal be empty in a grammar? Is epsilon (null string) counted as a terminal symbol?
Can set of terminal be empty in a grammar? Is epsilon (null string) counted as a terminal symbol?
User Avatar
3 votes
1 answer
264
Test by Bikram | Mock GATE | Test 2 | Question: 9
Consider these three grammars. ... by $G2$, then it can be generated by $G1$. If w can be generated by $G3$, then it can be generated by $G1$.
Consider these three grammars.$$\begin{array}{|c|c|c|} \hline \textbf{Grammar G1:} & \textbf{Grammar G2:} & \textbf{Grammar G3:} \\ \hline E\rightarrow E+T \mid T & E\r...
User Avatar
5 votes
2 answers
268
Compiler Design
How to do this type of QUESTIONS? Consider following grammar : S → S1 + A | A A → D – A | D D → D1 * B | B B → num The number of internal nodes for the parse tree for 5 * 4 + 10 * 6 – 7 – 8
How to do this type of QUESTIONS?Consider following grammar : S → S1 + A | A A → D – A | D D → D1 * B | B B → num The number of internal nodes for the parse tre...
User Avatar
Page: