Question
S->aS|A
A->a
B->aa
Find the number of variables reachable from the Starting Variable?
a.
0
b.
1
c.
2
d.
None of the mentioned
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Given grammar: S->aS|A A->a B->aa Find the number of variables reachable from the Starting Variable?
Similar Questions
Discover Related MCQs
Q. Inorder to simplify a context free grammar, we can skip the following operation:
View solution
Q. Given a Grammar G:
S->aA
A->a
A->B
B->A
B->bb
Which among the following will be the simplified grammar?
View solution
Q. Simplify the given grammar:
A-> a| aaA| abBc
B-> abba| b
View solution
Q. In context to the process of removing useless symbols, which of the following is correct?
View solution
Q. The use of variable dependency graph is in:
View solution
Q. The variable which produces an epsilon is called:
View solution
Q. Statement:
For A-> e ,A can be erased. So whenever it appears on the left side of a production, replace with another production without the A.
State true or false:
View solution
Q. Simplify the given grammar:
S->aXb
X->aXb | e
View solution
Q. Consider the following grammar:
A->e
B->aAbC
B->bAbA
A->bB
The number of productions added on the removal of the nullable in the given grammar:
View solution
Q. Let G=(V, T, P, S) be a CFG such that _____________. Then there exists an equivalent grammar G’ having no e productions.
View solution
Q. For each production in P of the form:
A-> x1x2x3…xn
put into P’ that production as well as all those generated by replacing null variables with e in all possible combinations. If all x(i) are nullable,
View solution
Q. For the given grammar G:
S->ABaC
A->BC
B->b| e
C->D| e
D-> d
Remove the e productions and generate the number of productions from S in the modified or simplified grammar.
View solution
Q. Consider G=({S,A,B,E}, {a,b,c},P,S), where P consists of S →AB, A →a, B →b and E →c.
Number of productions in P’ after removal of useless symbols:
View solution
Q. Given grammar G:
S->aS| AB
A-> e
B-> e
D-> b
Reduce the grammar, removing all the e productions:
View solution
Q. Which among the following is the format of unit production?
View solution
Q. Given Grammar G:
S->aA
A->a| A
B->B
The number of productions to be removed immediately as Unit productions:
View solution
Q. Given grammar:
S->aA
A->a
A->B
B-> A
B->bb
Which of the following is the production of B after simplification by removal of unit productions?
View solution
Q. If grammar G is unambiguous, G’ produced after the removal of Unit production will be:
View solution
Q. If C is A-derivable, C->B is a production, and B ¹ A, then B is
View solution
Q. A can be A-> derivable if and only if __________
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!