Consider the following two Grammars:

G₁ : S → SbS|a

G₂ : S → aB|ab, A → AB|a, B → ABb|b
Which of the following option is correct?

Question

Question

This question was previously asked in

UGC NET Computer Science (Paper 2) July 2018 Paper

Attempt Online

Answer 1

Concept:

Ambiguous grammar:

A grammar in which there exists a string for which two derivation trees are possible, then it is known as ambiguous grammar.

Explanation:

G₁: S → SbS|a

String: “ababa”

F1 R.S Madhu 13.04.20 D2

F1 R.S Madhu 13.04.20 D3

Two derivation trees (parse tree) is possible. So, grammar G₁ is ambiguous

G₂ : S → aB|ab, A → AB|a, B → ABb|b

String: “ab”

F1 R.S Madhu 13.04.20 D4

F1 R.S Madhu 13.04.20 D5

Two derivation trees (parse tree) is possible. So, grammar G₂ is ambiguous