The Gateway to Computer Science Excellence

+1 vote

Let G be a grammar in CFG and let W_{1},W_{2} $\epsilon$ L(G) such that |W_{1}|=|W_{2}| then which of the following statement is **true** ?

(A) Any derivation of W_{1} has exactly the same number of steps as any derivation of W_{2}

(B) Different derivation have different length

(C) Some derivation of W_{1} may be shorter the derivation of W_{2}

(D) None of the options

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,644 questions

56,531 answers

195,622 comments

101,346 users