Register

Recent questions tagged grammar

0 votes
1 answer
151
Doubt
L(G)={$a^mb^n$|m>n>=1} is the language context free?
L(G)={$a^mb^n$|m>n>=1} is the language context free?
User Avatar
0 votes
2 answers
153
Grammars
Please provide example to disapprove the following points:- 1.every DCFG need not be a LR(K). 2.every DCFG need not be a LL(K). 3.every DCFL is not LL(k).
Please provide example to disapprove the following points:-1.every DCFG need not be a LR(K).2.every DCFG need not be a LL(K).3.every DCFL is not LL(k).
User Avatar
0 votes
3 answers
155
UGC NET CSE | July 2018 | Part 2 | Question: 38
The set $A = \{ 0^n \: 1^n \: 2^n \mid n=1, 2, 3, \dots \}$ is an example of a grammar that is Context sensitive Context free Regular None of the above
The set $A = \{ 0^n \: 1^n \: 2^n \mid n=1, 2, 3, \dots \}$ is an example of a grammar that isContext sensitiveContext freeRegularNone of the above
User Avatar
0 votes
1 answer
158
Grammer
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
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 ...
User Avatar
0 votes
1 answer
159
First and follow
Find first and follow of the given grammar? S->AB A->BS/a/€ B->AS/b
Find first and follow of the given grammar?S->ABA->BS/a/€B->AS/b
User Avatar
1 votes
4 answers
164
Context Free Language
L= { $a^{n}b^{m}$ | $n<=m<=2n$ } a) DCFL b) CFL but not DCFL c) Not CFL
L= { $a^{n}b^{m}$ | $n<=m<=2n$ }a) DCFLb) CFL but not DCFLc) Not CFL
User Avatar
1 votes
1 answer
166
compiler
E---->T+E T------>i a)LR(0) b)SLR c)LALR dnone
E >T+ET >ia)LR(0)b)SLRc)LALRdnone
User Avatar
2 votes
2 answers
167
First And Follow
Find First and Follow in the following grammar. $E\rightarrow E+T \mid T$ $T\rightarrow TF \mid F$ $F\rightarrow F^* \mid a \mid b$
Find First and Follow in the following grammar.$E\rightarrow E+T \mid T$$T\rightarrow TF \mid F$$F\rightarrow F^* \mid a \mid b$
User Avatar
0 votes
5 answers
168
Finding Handles in a grammer
Total number of Handles for $(w=aa)$ in the following grammar ? $S\rightarrow DT$ $D\rightarrow aa$ $T\rightarrow \epsilon$
Total number of Handles for $(w=aa)$ in the following grammar ?$S\rightarrow DT$$D\rightarrow aa$$T\rightarrow \epsilon$
User Avatar
0 votes
1 answer
169
Attribute Grammar
Can someone explain these terms clearly these terms with examples? Attribute Grammar Synthesized attributes Inherited attributes L and S Attributes
Can someone explain these terms clearly these terms with examples?Attribute GrammarSynthesized attributesInherited attributesL and S Attributes
User Avatar
0 votes
5 answers
171
Compiler desigb
consider the following grammar $E\rightarrow int|int+E|int-E |int-(E) |int*E$ Which statement is true? a) Grammer is left factored b) Cant be determined
consider the following grammar$E\rightarrow int|int+E|int-E |int-(E) |int*E$Which statement is true?a) Grammer is left factoredb) Cant be determined
User Avatar
0 votes
1 answer
172
Check if grammar is LL(1) ?
Given a grammar : $E \rightarrow E + T / T$ $T \rightarrow i$ Can I directly say that grammar is not $LL(1)$ because $LL(1)$ can't parse Left Recursive Grammar, without drawing parsing table ?
Given a grammar :$E \rightarrow E + T / T$$T \rightarrow i$Can I directly say that grammar is not $LL(1)$ because $LL(1)$ can't parse Left Recursive Grammar, without dra...
User Avatar
0 votes
1 answer
180
Grammer
Can I give any grammer for the language L = { anbncn / n>=1} Like this----
Can I give any grammer for the language L = { anbncn / n>=1} Like this
User Avatar
Page: