Question: Given grammar:^ S->aS|A^ A->a^ B->aa^ Find the number of variables reachable from the Starting Variable?
Options
A : 0
B : 1
C : 2
D : None of the mentioned
CFG-Eliminating Useless Symbols more questions
Which of the following problems were reduced to Knapsack?
Which of the given problems are NP-complete?
A push down automata can be represented as:^ PDA= ?-NFA....
A pushdown automata can be defined as: (Q, ?, G,....
Given a Grammar G:^ S->aA^ A->a^ A->B^ B->A^ B->bb^ Which....
Halting states are of two types. They are:
In context to the process of removing useless symbols, which....
Inorder to simplify a context free grammar, we can skip....
The production of the form A->B , where A and....
Which of the following correctly recognize the symbol '|-' in....
Ambiguous Grammar more Online Exam Quiz
Applications of Pumping Lemma/Pigeonhole principle
Deterministic Finite Automata-Introduction and Definition
Finding Patterns in Text,Algebric Laws and Derivatives
From Grammars to Push Down Automata