0

2.8kviews

Consider the following grammar G = (V, T, P, S), V = {S, X}, T {0, 1} productions P are S is start symbol. Show that above grammar is ambiguous.

written 8.5 years ago by teamques10 ★ 69k

•   modified 4.1 years ago

theory of computation

ADD COMMENT FOLLOW SHARE EDIT

1 Answer

0

104views

written 8.5 years ago by teamques10 ★ 69k

Let,

S->0|0X1|01S1

X->0XX1|1S

As we get two different parse trees with one parse trees contains 0101 as input and other also contains 0101 but as a substring.

So, the given grammar is said to be ambiguous.

ADD COMMENT SHARE EDIT