Description
1. Remove left recursion from the following grammar: 3
S → (A) | a
A→ A,S | S
2. Given the following grammar, calculate the First of S, A, B, C, D: 7
S -> Ad
A -> Bb | CD
B -> (B) | a | ε
C -> bCc | ε
D -> cBc | B
3. Convert the regular expression (x|y)*xy(xy|xx)* over ∑={x, y} into its equivalent DFA using Direct method by describing each intermediate step very clearly. 10
4. Convert the regular expression a(a|b)*a(a|ab) over ∑={a, b} into its equivalent DFA using Direct method by describing each intermediate
step very clearly 10
Reviews
There are no reviews yet.