Multiple Choice
Consider the following CFG S ? aB S ? bA**spaceB ? b A ? a**spaceB ? bS A ? aS**spaceB ? aBB A ? bAA**spaceConsider the following derivation**spaceS ?aB**space?aaBB**space?aaBb**space?aabSb**space?aabbAb**space?aabbab**spaceThis derivation is
A) A leftmost derivation
B) A rightmost derivation
C) Both leftmost and rightmost derivation
D) Neither leftmost nor rightmost derivation
Correct Answer:

Verified
Correct Answer:
Verified
Q30: Consider the NFA M shown below.<br><img src="https://d2lvgg3v3hfg70.cloudfront.net/MM963/.jpg"
Q31: Which one of the following statement is
Q32: A language is represented by a regular
Q33: Which of the following regular expression identity
Q34: The minimum state automaton equivalent to the
Q36: Which of the following are regular sets?<br>A)I
Q37: Automaton accepting the regular expression of any
Q38: The regular sets are closed under:<br>A)Union<br>B)Concatenation<br>C)Kleene closure<br>D)All
Q39: Given a Non-deterministic Finite Automation (NFA) with
Q40: The following grammar<br>G = (N, T, P,