Consider the languages

(I) L1= {w#x , where w,x ∈ (0+1)* and # is a special character and w is a prefix of x } .
(II) L2={w#x , where w,x ∈ (0+1)* and # is a special character and wR, is a prefix of x}.
(III) L3={w#x , where w,x ∈ (0+1)* and # is a special character and wR, is a substring of x}
(IV) L4={w#x , where w,x ∈ (0+1)* and # is a special character and wR, is suffix of x}

(I) is recursive and (II), (III) and (IV) are DCFL.
(I) is CFL but not DCFL , (II) and (III) is DCFL, (IV) is recursive but not CFL.