• Subjects Books
    • Login
    0
    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 3.9 years ago by gravatar for Pooja Joshi Pooja Joshi • 1.2k •   modified 3.9 years ago

    Mumbai university > Comp > SEM 4 > TCS

    Marks: 5M

    Year: Dec 2015
    mumbai university theory of computer science • 1.0k  views
    0
    ADD COMMENT  
    0
    written 3.9 years ago by gravatar for Pooja Joshi Pooja Joshi • 1.2k

    Let,

    S->0|0X1|01S1

    X->0XX1|1S

    enter image description here

    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.
    0
    ADD COMMENT  
    Please log in to add an answer.

    Continue reading

    Find answer to specific questions by searching them here. It's the best way to discover useful content.

    Find more