Question: Let ?={0,1}* and the grammar G be:^ S->?^ S->SS^ S->0S1|1S0^ State which of the following is true for the given
Options
A : Language of all and only Balanced strings
B : It contains equal number of 0's and 1's
C : Ambiguous Grammar
D : All of the mentioned
From Grammars to Push Down Automata more questions
Which of the following is a parser for an ambiguous....
Which of the following is an real-world programming language ambiguity?
A DFA cannot be represented in the following format
A Language for which no DFA exist is a__
For a counter automaton, with the symbols A and Z0,....
State true or false:^ Statement: Counter Automaton can exist for....
What the following DFA accepts?^
When are 2 finite states equivalent?
Which among the following is true for the given statement?^....
Which of the following can be accepted by a DPDA?
Ambiguous Grammar more Online Exam Quiz
Applications of Pumping Lemma/Pigeonhole principle
CFG-Eliminating Useless Symbols
Deterministic Finite Automata-Introduction and Definition
Finding Patterns in Text,Algebric Laws and Derivatives
Node-Cover Problem, Hamilton Circuit Problem
Problem Solvable in Polynomial Time
Properties-Non Regular Languages