Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged simplification
1
votes
0
answers
31
Automata: Conversion from CFG to CNF
Convert the following context free grammar into Chomsky Normal Form: $S \rightarrow ASA | aB$ $A \rightarrow B | S$ $B \rightarrow b | \epsilon$ Does the appearance of starting symbol S at RHS impacts the conversion from CFG to CNF?
Convert the following context free grammar into Chomsky Normal Form:$S \rightarrow ASA | aB$$A \rightarrow B | S$$B \rightarrow b | \epsilon$Does the appearance of start...
Manu Thakur
4.5k
views
Manu Thakur
asked
Oct 13, 2017
Theory of Computation
theory-of-computation
context-free-language
conjunctive-normal-form
simplification
+
–
1
votes
0
answers
32
Automata: Number of Productions in the CFG
Consider the following context free grammar: $S \rightarrow ASA | aB$ $A \rightarrow B | S$ $B \rightarrow b | \epsilon$ How many productions will be there in the modified grammar if we remove null-productions and unit-productions from this ... $B \rightarrow b$ I am getting 12 productions. can someone please confirm if it's correct?
Consider the following context free grammar:$S \rightarrow ASA | aB$$A \rightarrow B | S$$B \rightarrow b | \epsilon$How many productions will be there in the modified g...
Manu Thakur
2.7k
views
Manu Thakur
asked
Oct 13, 2017
Theory of Computation
theory-of-computation
context-free-language
simplification
+
–
0
votes
0
answers
33
CFG: Removal of Unit Productions
Remove unit productions from the following CFG: S0 --> S S --> ASA | aB | a | SA | AS | S A-->B | S B --> b Solution: if I replace S with its Right Side part, i get S0-> ASA | aB | a | SA | AS | S S --> ASA | aB | a | SA | ... | aB | a | SA | AS | S B --> b How to remove this S from RHS, S->S or S0->S or A->S all are unit productions.
Remove unit productions from the following CFG:S0 SS ASA | aB | a | SA | AS | SA >B | SB bSolution:if I replace S with its Right Side part, i getS0- ASA | aB | a | ...
Manu Thakur
2.6k
views
Manu Thakur
asked
Sep 5, 2017
Theory of Computation
theory-of-computation
context-free-language
simplification
+
–
0
votes
0
answers
34
Grammar Simplification
Consider the following grammar : S-> Aa / B B -> a / bC C -> a / epsilon The number of productions in simplified CFG is_________. I am getting 3. As S -> Aa / a / b.
Consider the following grammar :S- Aa / BB - a / bCC - a / epsilonThe number of productions in simplified CFG is_________.I am getting 3. As S - Aa / a / b.
Shubhanshu
3.1k
views
Shubhanshu
asked
Aug 29, 2017
Compiler Design
theory-of-computation
context-free-language
simplification
+
–
1
votes
1
answer
35
Test by Bikram | Mock GATE | Test 4 | Question: 36
Which of the following statements is/are CORRECT? $S_1$: Max term is a sum term which contains all the variables in either direct or complementary form. $S_2$: Min term is a product term which contains all the variables in either direct or ... $S_3$ is correct only $S_2$ is correct All $S_1$, $S_2$ and $S_3$ are correct
Which of the following statements is/are CORRECT?$S_1$: Max term is a sum term which contains all the variables in either direct or complementary form.$S_2$: Min term is ...
Bikram
453
views
Bikram
asked
May 14, 2017
Digital Logic
tbb-mockgate-4
digital-logic
simplification
min-sum-of-products-form
+
–
2
votes
7
answers
36
SIMPLIFICATION OF CFG
KISHALAY DAS
10.4k
views
KISHALAY DAS
asked
Jan 11, 2017
Theory of Computation
context-free-language
simplification
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
