Question

2. Prove that the following grammar is ambiguous: S → SS(S) la 3. Convert the following EBNF rule taken from Pascal standard to ordinary BNF. Na.. nad h an .le and ond bitd.. ..

Answer 1

Answer:---------

2). A CFG is said to ambiguous if there exists more than one derivation tree for the given input string i.e., more than one LeftMost Derivation Tree (LMDT) or RightMost Derivation Tree (RMDT).

let, string = (aaaa)

LeftMost Derivation Tree (LMDT)===>

C کے د S S zuen ss a Note: - Both parse Treep are derived from game grammar rules but both parke treey are different • Hence, The Grammar is ambiguous. as S II a a =>: (aaaa) = (aaaa)