Grammar Simplification
closed

Shubhanshu asked Aug 29, 2017 • closed Sep 13, 2022 by Hira Thakur

3,104 views

0 votes

closed as a duplicate of: SIMPLIFICATION OF CFG

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.

Compiler Design
theory-of-computation
context-free-language
simplification

+ –

Shubhanshu asked Aug 29, 2017 • closed Sep 13, 2022 by Hira Thakur

Shubhanshu

3.1k views

See all

25 25 Comments

Show 22 previous comments

Shubhanshu

commented Aug 30, 2017

b.

It means that every alphabet character in capital letter should be considered as Variable.

0 votes

Rishabh Gupta 2

commented Oct 18, 2017

so, what's the conclusion?

0 votes

Sandeep Suri

commented Oct 26, 2017

Answer given is 8 don't know how?

0 votes

Please log in or register to add a comment.

0 Answers

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

2 votes

7 answers

KISHALAY DAS asked Jan 11, 2017

10,377 views

SIMPLIFICATION OF CFG

KISHALAY DAS

10.4k views

KISHALAY DAS asked Jan 11, 2017

Theory of Computation
context-free-language
simplification

+ –

1 votes

0 answers

Manu Thakur asked Oct 13, 2017

4,492 views

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

Manu Thakur asked Oct 13, 2017

2,686 views

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

Manu Thakur asked Sep 5, 2017

2,591 views

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

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

25 25 Comments reply

Please log in or register to add a comment.

0 Answers

Related questions

25 25 Comments