Register

Recent questions tagged regular-grammar

1 votes
1 answer
31
Grammar to DFA Construction
For the given Grammar S->aA|bB A->bC|aS B->aC|bS C->aB|bA Construct DFA I am getting confused in understanding how to take the final state.
For the given GrammarS->aA|bBA->bC|aSB->aC|bSC->aB|bA Construct DFA I am getting confused in understanding how to take the final state.
User Avatar
1 votes
1 answer
33
conversion of right linear grammar to DFA
In converting right linear regular grammar to DFA how to determine the final states? Can anyone tell the procedure?
In converting right linear regular grammar to DFA how to determine the final states?Can anyone tell the procedure?
User Avatar
0 votes
1 answer
34
Regular Grammar
Is there any difference between Type 3 grammar and regular grammar?
Is there any difference between Type 3 grammar and regular grammar?
User Avatar
0 votes
1 answer
35
self doubt
What is the differene between { Φ } and λ and what happens when we concatenate this with a regular language ??
What is the differene between { Φ } and λ and what happens when we concatenate this with a regular language ??
User Avatar
0 votes
1 answer
37
regular grammar
What will be regular grammar for given regular expression $r=(ab^*+b)^*ab$
What will be regular grammar for given regular expression$r=(ab^*+b)^*ab$
User Avatar
0 votes
0 answers
39
#TOC Doubt
L = anbm / n,m>=1 What type pf Language is this? Also, please tell are n,m are independent or dependent i.e can we have like n=2 and m=3 or both n,m have to have same values!?
L = anbm / n,m>=1What type pf Language is this? Also, please tell are n,m are independent or dependent i.e can we have like n=2 and m=3 or both n,m have to have same valu...
User Avatar
1 votes
0 answers
40
MadeEasy Test Series 2018: Theory of Computation - Regular Grammer
What is the correct way to solve questions of this kind where equations like these are given and you are asked to determine what languages do the variables X1 X2 X3.. represent?
What is the correct way to solve questions of this kind where equations like these are given and you are asked to determine what languages do the variables X1 X2 X3.. rep...
User Avatar
1 votes
1 answer
44
Regular Grammar
A regular grammar is always linear but not all linear grammar are regular. Please explain why this statement is true
A regular grammar is always linear but not all linear grammar are regular.Please explain why this statement is true
User Avatar
3 votes
1 answer
46
Compiler
Which of the following statements are correct and why.....? Every regular set has LR(1) grammar Every regular grammar is LR(1).
Which of the following statements are correct and why.....?Every regular set has LR(1) grammarEvery regular grammar is LR(1).
User Avatar
6 votes
2 answers
47
REGULAR GRAMMARS
if a is a terminal and S, A, B are three non-terminals, then which of the following are regular grammars? (a) S → ε, A → aS|b (b) A → aB|a, B → bA|b (c) A → Ba|Bab (d) A → abB|aB please explain how u proceed? The answer is given "b"
if a is a terminal and S, A, B are three non-terminals, then which of the following are regular grammars?(a) S → ε, A → aS|b (b) A → aB|a, B → bA|b(c) A → Ba|B...
User Avatar
0 votes
0 answers
48
Regular Grammar
https://gateoverflow.in/?qa=blob&qa_blobid=12864829104497909178
https://gateoverflow.in/?qa=blob&qa_blobid=12864829104497909178
User Avatar
0 votes
0 answers
49
Left linear regular grammar to machine
Can we directly convert a given Left linear regular grammar to machine ? or First convert Left linear regular grammar to Right linear regular grammar and then to machine . http://scanftree.com/automata/conversion-of-left-linear-grammar-to-finite-automata
Can we directly convert a given Left linear regular grammar to machine ?orFirst convert Left linear regular grammar to Right linear regular grammar and then to machine .h...
User Avatar
0 votes
0 answers
51
regular grammar
how to convert FA to Left linear regular grammar??
how to convert FA to Left linear regular grammar??
User Avatar
1 votes
1 answer
53
TOC Grammer equivalence
Which of the following grammars are equivalent?S is non terminal ,e is epsilon,a is terminal 1. S-> aS |e 2. S-> aS | a |e 3. S-> aaS |e
Which of the following grammars are equivalent?S is non terminal ,e is epsilon,a is terminal1. S- aS |e2. S- aS | a |e3. S- aaS |e
User Avatar
1 votes
2 answers
55
Regular grammar form
Regular grammar can be of form :- A->tV or A->Vt or A->t where t is terminal and V is variable. Here is t string of terminals or a single terminal? I am seeing different definitions of terminal everywhere.
Regular grammar can be of form :-A->tV or A->Vt or A->t where t is terminal and V is variable.Here is t string of terminals or a single terminal? I am seeing different de...
User Avatar
20 votes
2 answers
58
GATE CSE 1990 | Question: 15a
Is the language generated by the grammar $G$ regular? If so, give a regular expression for it, else prove otherwise G: $S \rightarrow aB$ $B \rightarrow bC$ $C \rightarrow xB$ $C \rightarrow c$
Is the language generated by the grammar $G$ regular? If so, give a regular expression for it, else prove otherwiseG: $S \rightarrow aB$$B \rightarrow bC$$C \rightarro...
User Avatar
Page: