You are watching: Which of the following statements is/are true?
The correct answer is option 4.
For grammar to be ambiguous, a string demands to have
More than one parse tree
More than two lefta lot of derivative
More than two rightthe majority of derivative
The grammar S → SS | a is ambiguous grammar. It generates two parse treesvia string aaa.
The grammar S → 0S1 | 01S |e is ambiguous.It generates 2 parse trees withstring 01.
The grammarS → T / U, T → x S y | xy | ϵ, U → yT geneprices a language consisting of the string yxxyy.
∴ Hence the correct answer is All of (a), (b) and (c) are TRUE.
Downfill Solution PDF
Share on Whatsapp
India’s #1 Learning Platform
Start Complete Exam Preparation
Daily Live MasterClasses
Practice Inquiry Bank
Mock Tests & Quizzes
Get Started for FreeDownfill App
Trusted by 2,37,02,477+ Students
‹‹ Previous Ques
Next Ques ››
More Ambiguity Questions
Q1. Which of the complying with grammars is (are) ambiguous?(A) s → ss | asb | bsa |(B) s → asbs | bsas |λ(C) s → aABA → bBbB→ A | λ wbelow λ denotes empty stringChoose the correct answer from the options offered below:
Q2. Which of the adhering to statements is/are TRUE?(a) The grammar S → SS | a is ambiguous. (Wbelow S is the begin symbol)(b) The grammar S → 0S1 | 01S |e is ambiguous. (The distinct symbol e represents the empty string) (Where S is the begin symbol)(c) The grammar (Wright here S is the begin symbol)S → T / UT → x S y | xy | ϵU → yTgeneprices a language consisting of the string yxxyy.
See more: Husband Stays Out All Night Without Calling, Is It Ok For Husband To Stay Out All Night
Q3. Which one of the following difficulties is undecidable?
Q4. A grammar that produces even more than one left a lot of derivation or right the majority of derivation for the exact same sentence is recognized is _____.
More Context Free Languperiods and Pushdown Automata Questions
Q1. Consider the languages L1 = 0i1j. L2 = i = j. L3 = i = 2j + 1. L4 = i≠ 2j Which among the complying with statements is true?
Q2. Let P be a regular language and also Q be a context-free language such that Q ⊆ P. (For instance, let P be the language stood for by the regular expression p*q*and Q be |pnqn | n ϵ N}). Then which of the complying with is ALWAYS regular?
Q3. Consider the complying with grammar.S→ ABA→ aA→ BaBB→ bbAWhich of the following statement is FALSE?
Q4. What is the variety of actions forced to derive the string ((() ()) ()) for the following grammar?S→ SSS→ (S)S→ϵ
Q5. Consider L = L1∩ L2Where L1= 0m1m20n1nL2= 0m1n2kThen, the language L is
Q6. Which of the complying with statements is true ?
Q7. Which of the complying with grammars is (are) ambiguous?(A) s → ss | asb | bsa |(B) s → asbs | bsas |λ(C) s → aABA → bBbB→ A | λ where λ denotes empty stringChoose the correct answer from the alternatives offered below:
Q8. Consider the following languperiods :L1= ambnL2= m = 2n + 1L3= m ≠ 2nWhich one of the adhering to statement is correct ?
Q9. Context free grammar is not closed under:
Q10. The language L = i≥ 0 over the alphabet a, b, c is :
Suggested Test Series
View All >
UGC NET 2021 Paper 1 Test Series
220 Total Tests 28 Free Tests
Start Free Test
UGC NET Hindi Previous Year Papers
32 Total Tests 1 Free Tests
Start Free Test
UGC NET Important Links
Exam DatesApplication FormApplication FeeOnline CoachingEligibilityAdmit CardExam PatternSyllabusAnswer KeyCut OffBooksPrevious Year PapersStudy MaterialPreparation TipsResultSubject Topic WeightageImportant QuestionsExam Analysis
More Theory of Computation Questions
Q1. Let w be any string of length n in 0, 1*. Let L be the set of all substrings of w. What is the minimum number of says in a non-deterministic finite automaton that accepts L?
Q2. Consider the langueras L1 = 0i1j. L2 = i = j. L3 = i = 2j + 1. L4 = i≠ 2j Which one of the following statements is true?
Q3. Let L = w has actually also variety of 1s , i.e. L is the collection of all little strings via also variety of 1s. Which among the constant expressions below represents L?
Q4. Let L1 be a recursive language. Let L2 and also L3 be languperiods that are recursively enumerable but not recursive. Which of the adhering to statements is not necessarily true?
Q5. A deterministic finite automaton (DFA) D with alphabet∑ = a,b is provided below.Which of the adhering to finite state makers is a valid minimal DFA which accepts the exact same language as D?
Q6. Definition of a language L via alphabet a is offered as complying with.L= k > 0, and also n is a positive integer constantWhat is the minimum number of claims necessary in a DFA to identify L?
Q7. Consider the languages L1, L2 and also L3 as given listed below.L1 = p, q∈ N,L2 = p, q∈ N and also p = q andL3 = p, q, r ∈ N and also p = q = r.Which of the complying with statements is NOT TRUE?
Q8. Let P be a consistent language and Q be a context-complimentary language such that Q ⊆ P. (For instance, let P be the language stood for by the continuous expression p*q*and also Q be |pnqn | n ϵ N}). Then which of the adhering to is ALWAYS regular?
Q9. The lexical evaluation for a modern-day computer language such as Java requirements the power of which among the adhering to machine models in a crucial and adequate sense?
Q10. Which of the following pairs have actually DIFFERENT expressive power?
lutz-heilmann.info Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building, Plot No. 273, Sector 10, Kharghar, Navi Mumbai - 410210
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
About usCareers We are hiringTeach Online on lutz-heilmann.infoPartnersMediaSitemap
Test Serieslutz-heilmann.info PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our AppsFollow us on