Subscribe to:
Post Comments
(
Atom
)
Define a context free grammar. What are the applications of context free languages?
Consider the grammar G: ({S, A}, {a, b}, {P, S}) where p consists of: S → aAs | a A → sbA | ss | ba Draw a parse tree for the string aabbaa and left most derivations.
No comments
Dear Members, Thanks for Your Comments. We must be reply your comment answer as soon as possible. Please Stay with us.....