Consider the following grammar;
S ―> XaYb
X ―> bXc | b
Y ―> dYa | d
Find the first sets for each non-terminal of the given grammar.
FIRST(Aw) = FIRST(A) if A is a nonterminal and ε is not contained in FIRST(A).
FIRST(α) = {t | (t is a terminal and α ⇒∗ tβ) or (t = ǫ and α ⇒∗ ǫ)}
Phr Yaad-e-Khuda Se Ghafil Iss Duniya Ki Hawass Mein
Iss Mukhtasir Si Zindgi Ka Ik Aor Din Beet Gaya...!!!<<<<<<<<<< sAd pAncHi >>>>>>>>>>
--
Virtual University of Pakistan*** IT n CS Blog
================================
http://www.geniusweb.tk
http://itncs.tk
You received this message because you are subscribed to the Google
Groups "vulms" group.
To post to this group, send email to vulmsit@googlegroups.com
To unsubscribe from this group, send email to
vulmsit+unsubscribe@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/vulmsit?hl=en?hl=en
No comments:
Post a Comment