Ask
Login
0
9.8kviews
Let G be the grammar. Find the leftmost derivation, rightmost derivation and parse tree for the string 001222.
written 7.9 years ago by gravatar for pratikj2208 pratikj2208 • 150 modified 5.7 years ago by gravatar for prashantsaini prashantsaini • 0

G: S =>0S|1A|2B|ε

A =>1A|2B| ε

B =>2B| ε
automata theory
ADD COMMENT EDIT
1 Answer
0
459views
written 7.9 years ago by gravatar for pratikj2208 pratikj2208 • 150 modified 6.9 years ago by gravatar for abhishektiwari1 abhishektiwari1 • 100

Let G be the grammar. Find the leftmost derivation, rightmost derivation and parse tree for the string 001222.

G: S =>0S|1A|2B|ε

A =>1A|2B| ε

B =>2B| ε

If we solve the sum using the given grammar, we can produce the string using leftmost derivation alone, but not the rightmost derivation. …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.