Number of steps required to get 'aab' from A -> aA | a | b-
- A.4
- B.3
- C.2
- D.1
Show answer
Answer: B. 3
The derivation takes 3 steps: A -> aA -> aaA -> aab.
Related questions
- Which of the following symbol table implementation is best suited if access time is to be minimum?
- A binary search tree is constructed by inserting the numbers, 60 25 72 15 30 68 13 18 in order. The number of nodes in the left sub tree is-
- A critical section is a program segment-
- A collection of objects that use common structure and a common behavior is known as-
- Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?