Syntax Analysis6

34Find the grammar that generates the language L = (aⁱb^j | i ≠ j). In that grammar what is the length of the derivation (number of steps starring from S) to generate the string a^lb^m with l ≠ m

Option : A
Explanation :
The grammar is
S → AC/CB
C → aCb/ε
A → aA/a
B → Bb/b
and number of derivation step is max(l, m) + 2

Forgot your password?

I agree with the Terms.