Question
Consider a language L = anbm I n, m >=1 Convert the given language into: a) PDA b) PDA -> CFG c) CFG -> Simplification of CFG d) Simplification of CFG -> CNF e) CNF 4 Test String f) Test String 4 Generate Parse Tree g) Generate Parse Tree 4 Check Ambiguity Given Sample String is: aaabbbSTEP by STEP SOLUTION On YouTube Video
Subscribe our channel for more videos
FaceBook:
No comments:
Post a Comment