Register

Recent questions tagged grammar

0 votes
2 answers
213
GKP Book
Q:)The following CFG, S-> aB/ bA A->a/ aS/ bAA B -> b/ bS/ aBB generates strings with (a) Odd number of a's & odd number of b’s (b) Even number of a's & even number of b's (c) Equal number of a’s & b’s (d) Odd number of a’s & even number of b’s
Q:)The following CFG, S- aB/ bAA->a/ aS/ bAAB - b/ bS/ aBBgenerates strings with(a) Odd number of a's & odd number of b’s(b) Even number of a's & even number of b's(c) ...
User Avatar
1 votes
0 answers
214
TOC (GRAMMAR)
What is the language accepted by the given Grammar ? S -> aSa / bSb / a / b
What is the language accepted by the given Grammar ?S - aSa / bSb / a / b
User Avatar
0 votes
0 answers
219
Ambiguity
Ques. S --> Aa/bAc/dc A --> d Isn't this grammar Ambiguous? If First(S) has more than one production giving the same first value, isn't it ambiguous?
Ques. S Aa/bAc/dc A d Isn't this grammar Ambiguous?If First(S) has more than one production giving the same first value, isn't it ambiguous?
User Avatar
2 votes
1 answer
221
LR(zero)
Options are as:- (a) i and ii (b) i and iii (c) ii and iii (d) none of the above
Options are as:-(a) i and ii (b) i and iii(c) ii and iii (d) none of the above
User Avatar
7 votes
6 answers
222
LL(1) Grammar
Which of the following statements is true? Every LL(1) grammar is LALR(1). Every LL(1) grammar is CLR(1). AS I think 2nd is True and 1st is False if I am wrong please let me correct.
Which of the following statements is true?Every LL(1) grammar is LALR(1).Every LL(1) grammar is CLR(1). AS I think 2nd is True and 1st is False if I am wrong please let ...
User Avatar
0 votes
1 answer
224
LEFT RECURSION
To avoid left recursion can we do like this. I think this is incorrect way to do
To avoid left recursion can we do like this. I think this is incorrect way to do
User Avatar
1 votes
1 answer
225
LL one
Given answer is yes but i think should not be LL(1)
Given answer is yes but i think should not be LL(1)
User Avatar
1 votes
1 answer
227
Grammar
User Avatar
1 votes
0 answers
229
LL grammar and DCFL
True or False , 1) Is every LL grammar have one to one correspondance with DCFL? Please explain with examples.
True or False ,1) Is every LL grammar have one to one correspondance with DCFL?Please explain with examples.
User Avatar
1 votes
2 answers
231
theory of computation
contruct the PDA for CFG L={set of balanced paranthesis}
contruct the PDA for CFG L={set of balanced paranthesis}
User Avatar
1 votes
2 answers
232
theory of computtion
find regular expression of 1. S-> 01A/10B A->0B/1 B->1A/0 and 2. A->A00 /A1/0 3. S->baS/aA A->bbA/bb
find regular expression of1.S- 01A/10BA->0B/1B->1A/0and2.A->A00 /A1/0 3.S->baS/aAA->bbA/bb
User Avatar
4 votes
2 answers
233
LL(1) Grammer
S -> (L) | a L -> L . S | S Question: Make necessary changes to make it suitable for LL(1) parsing and Construct FIRST and FOLLOW sets.
S - (L) | aL - L . S | SQuestion: Make necessary changes to make it suitable for LL(1) parsing and Construct FIRST and FOLLOW sets.
User Avatar
0 votes
0 answers
234
Doubt
How Arithmetic expressions with matched pairs of parentheses is X→XbX∣XcX∣dXf∣g ???
HowArithmetic expressions with matched pairs of parentheses isX→XbX∣XcX∣dXf∣g ???
User Avatar
2 votes
2 answers
236
Peter Linz 5.1
I need two proves, i am stuckhere 1.Show that every S-grammar is Unambiguous 2.Show that a RegEx can never be Inherently Ambiguous so what to use here? Induction/Contradiction
I need two proves, i am stuckhere1.Show that every S-grammar is Unambiguous2.Show that a RegEx can never be Inherently Ambiguousso what to use here? Induction/Contradicti...
User Avatar
0 votes
1 answer
237
theory of computation
User Avatar
0 votes
1 answer
238
theory of computation
Eliminate all Null -productions from S $\rightarrow$ AaB | aaB, A $\rightarrow$ Null B $\rightarrow$ bbA |Null.
Eliminate all Null -productions fromS $\rightarrow$ AaB | aaB,A $\rightarrow$ NullB $\rightarrow$ bbA |Null.
User Avatar
0 votes
2 answers
239
theory of computation
I guess the Language , L = { } ...please verify ...
I guess the Language , L = { } ...please verify ...
User Avatar
0 votes
1 answer
240
theory of computation
Find dfa's for the following languages on Σ = {a,b}. L= {w: na(w) mod 3 >nb(w) mod 3}. L= {w :(na(w) – nb(w)) mod 3 > 0}.
Find dfa's for the following languages on Σ = {a,b}.L= {w: na(w) mod 3 >nb(w) mod 3}.L= {w :(na(w) – nb(w)) mod 3 0}.
User Avatar
Page: