Register

Recent questions tagged grammar

10 votes
2 answers
362
How to Eliminate Indirect Left recursion from this grammar?
$\textbf{Eliminating indirect left-recursion}$ Indirect left-recursion $S\rightarrow Aa|b$ $A\rightarrow Ac| Sd |\in$
$\textbf{Eliminating indirect left-recursion}$Indirect left-recursion$S\rightarrow Aa|b$$A\rightarrow Ac| Sd |\in$
User Avatar
8 votes
3 answers
363
ISRO-2013-6
Which of the following productions eliminate left recursion in the productions given below: $S \rightarrow Aa \mid b$ $A \rightarrow Ac \mid Sd \mid \epsilon$ ... $S \rightarrow Aa \mid b, A \rightarrow cA' \mid adA' \mid bdA', A' \rightarrow A \mid \epsilon$
Which of the following productions eliminate left recursion in the productions given below:$S \rightarrow Aa \mid b$$A \rightarrow Ac \mid Sd \mid \epsilon$$S \rightarrow...
User Avatar
6 votes
7 answers
368
Number of conflict
Consider the grammar given below S⟶ SS | a | ∈ The number of inadequate states in the DFA of LR(1) items is (a) 1 (b) 2 (c) 3 (d) 4
Consider the grammar given belowS⟶ SS | a | ∈The number of inadequate states in the DFA of LR(1) items is(a) 1 (b) 2 (c) 3 (d) 4
User Avatar
2 votes
1 answer
371
When to shift and when to reduce?
In the above grammar, 1. how to determine the precedence of the operator? 2. If there is shift and reduce conflict, in who's favor to resolve? 3. Why are we not reducing E-->E+E, instead we are shifting. But incase of E-->id, we are reducing.
In the above grammar,1. how to determine the precedence of the operator?2. If there is shift and reduce conflict, in who's favor to resolve?3. Why are we not reducing E >...
User Avatar
4 votes
4 answers
374
TestBook Test Series: Theory Of Computation - Grammar
Number of nodes in the derivation tree when a word of length $2^{k}$ is derived from a grammar in CNF? $2^{k+1} -1$ $3.2^{k+1} - 1$ $2^{k+1} + 1$ $2^{k+1} + 1$
Number of nodes in the derivation tree when a word of length $2^{k}$ is derived from a grammar in CNF?$2^{k+1} -1$$3.2^{k+1} - 1$$2^{k+1} + 1$$2^{k+1} + 1$
User Avatar
1 votes
1 answer
375
Is the following grammar LL1
In the explanation, it is mentioned as follows Now , my question is how First(B) is a here. Can you please explain it ?
In the explanation, it is mentioned as followsNow , my question is how First(B) is a here. Can you please explain it ?
User Avatar
2 votes
1 answer
377
Slr(1)
S->aAb/aBc/bAd/bBe A->g B->g How many states in slr(1)
S->aAb/aBc/bAd/bBeA->gB->gHow many states in slr(1)
User Avatar
1 votes
1 answer
378
Question on deciding type of language
Given answer: A Please explain
Given answer: APlease explain
User Avatar
1 votes
1 answer
379
Uniquely derivable strings from grammar
The given answer to the problem is 1 ('a'). But I think that strings 'a+a' & 'a*a' can also be derived from the grammar. Please correct me if I am wrong.
The given answer to the problem is 1 ('a'). But I think that strings 'a+a' & 'a*a' can also be derived from the grammar. Please correct me if I am wrong.
User Avatar
0 votes
1 answer
380
Deciding grammar type
User Avatar
0 votes
1 answer
381
Deciding grammar
Given answer: D Solution to this problems says that the grammar is same as dangling else problem. Please explain me how.
Given answer: DSolution to this problems says that the grammar is same as dangling else problem. Please explain me how.
User Avatar
1 votes
1 answer
382
ambigious grammer
how to verify weather given grammer is ambigious or not???
how to verify weather given grammer is ambigious or not???
User Avatar
1 votes
1 answer
384
the next three questions are based on the following grammar:
E-->E/X | X X--> T-X | X*T | T T--> T + F | F F-->(E) | T my doubt is how can we decide left or right associativity and another doubt was how can we decide precedence of the operator...i got confusion can any one explain plzzz...
E >E/X | XX T-X | X*T | TT T + F | FF >(E) | Tmy doubt is how can we decide left or right associativity and another doubt was how can we decide precedence of the operat...
User Avatar
1 votes
1 answer
386
Recognising type of language
HI, I would like someone to give clarification on how to identify a string is which grammar. I am not able to understand the concept well. So if someone explains ii, it will be highly appreciated. Please give examples. for eg: { a^n } is CFG or not. Thank you.
HI,I would like someone to give clarification on how to identify a string is which grammar. I am not able to understand the concept well. So if someone explains ii, it wi...
User Avatar
Page: