Register

Recent questions tagged grammar

0 votes
0 answers
124
Self doubt
1. Does LR(k) grammar exist for CFL's that are not deterministic. 2. Is there one to one correspondence between LR(1) and DCFL or between LR(k) and DCFL.
1. Does LR(k) grammar exist for CFL's that are not deterministic.2. Is there one to one correspondence between LR(1) and DCFL or between LR(k) and DCFL.
User Avatar
1 votes
1 answer
125
DCFL_
state true /false 1) for every DCFL there exist at least one unambiguous grammar
state true /false1) for every DCFL there exist at least one unambiguous grammar
User Avatar
0 votes
0 answers
128
Theory of Computation : Turing Machine
Correct ans is Type - 0. My doubt is LBA is also TM and LBA belongs to type - 1 then why ans is not type - 1
Correct ans is Type - 0. My doubt is LBA is also TM and LBA belongs to type - 1 then why ans is not type - 1
User Avatar
0 votes
3 answers
130
Compiler Design Doubt
S->Aa | Bc A->a B->a 1. Is the above grammer left factored ?? If not ,then do left factoring on it ?? 2. Is above grammer deterministic ?? 3. Is every left factored grammer deterministic ??
S->Aa | Bc A->a B->a1. Is the above grammer left factored ?? If not ,then do left factoring on it ??2. Is above grammer deterministic ?? 3. Is every left factored...
User Avatar
0 votes
1 answer
131
#CD Doubt
#CD compute first and follow for S->SS+\SS*\a
#CDcompute first and follow forS->SS+\SS*\a
User Avatar
1 votes
0 answers
134
Formal Languages
Let r1 = (b*ab*ab*ab*)* and r2= (b*ab*ab*)*. What is L(r1) ∩ L(r2)? a) L[b*ab*ab*ab*)*] b) L[b*ab*ab*)*] c) L[b*ab*ab*)6] d) L[b*ab*ab*ab*ab*ab*ab*)*]
Let r1 = (b*ab*ab*ab*)* and r2= (b*ab*ab*)*. What is L(r1) ∩ L(r2)?a) L[b*ab*ab*ab*)*]b) L[b*ab*ab*)*]c) L[b*ab*ab*)6]d) L[b*ab*ab*ab*ab*ab*ab*)*]
User Avatar
0 votes
1 answer
136
Formal Languages
If G= ({S} , {a}, {S--->SS} , S), then language L(G) is a)ϕ b)aa(a)* c)(aa)* d)None of these
If G= ({S} , {a}, {S ->SS} , S), then language L(G) isa)ϕb)aa(a)*c)(aa)*d)None of these
User Avatar
0 votes
0 answers
143
self doubt
Every regular set has an LR(1) grammar. What does this line mean??
Every regular set has an LR(1) grammar.What does this line mean??
User Avatar
0 votes
0 answers
145
Doubt in Grammar
What is the difference between phase structured grammar and phrase structured grammar?
What is the difference between phase structured grammar and phrase structured grammar?
User Avatar
0 votes
2 answers
146
FIRST Set
S->Aa A->BD B->b | ɛ D->d | ɛ what is FIRST(S)?
S->AaA->BDB->b | ɛD->d | ɛwhat is FIRST(S)?
User Avatar
0 votes
1 answer
147
Doubt in Grammar
Consider the following grammar which of the following is/are ambiguous? (i) S → y | SxS (ii) S → E | ExS and E → y (iii) S → Sxy | y
Consider the following grammar which of the following is/are ambiguous?(i) S → y | SxS(ii) S → E | ExS and E → y(iii) S → Sxy | y
User Avatar
1 votes
0 answers
150
Doubt
Does this grammar generates string of atleast length 2 S->AA A->aA | bA | a | b
Does this grammar generates string of atleast length 2S->AAA->aA | bA | a | b
User Avatar
Page: