Consider a language L = anbm I n, m =1
Microprocessor | Question in Description | Question 1
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: aaabbb
Hello guys how are you all, My Name Is Muhammad Ali .
I'm a student like you .
In today's video I am solving a QUESTION. Well, the purpose of making the video is only that if you have the same assignment, then you can get help. Thanks. If you like the video, please subscribe and Share it.
Thanks for watching ...
Share, Like & Comment
Subscribe for new updates and also hit bell button for notification
/ @muhammadali1105
FaceBook: www.facebook.com/MuhammadaAli5110
#MuhammadAli110 #Microprocessor