Skip to main content
Computer Science

Return to Question

added 8 characters in body
Source Link
xskxzr
xskxzr
  • 7.6k
  • 5
  • 23
  • 47

How can I prove that the following grammar is ambiguous:

$$ A \to AA|B \\ B \to aBb|ab $$$$ A \to AA\mid B \\ B \to aBb\mid ab $$

I tried finding a string that can be derived in two different ways, but to no avail.

How can I prove that the following grammar is ambiguous:

$$ A \to AA|B \\ B \to aBb|ab $$

I tried finding a string that can be derived in two different ways, but to no avail.

How can I prove that the following grammar is ambiguous:

$$ A \to AA\mid B \\ B \to aBb\mid ab $$

I tried finding a string that can be derived in two different ways, but to no avail.

added 13 characters in body; edited tags; edited title
Source Link
Yuval Filmus
Yuval Filmus
  • 279.1k
  • 27
  • 316
  • 512

Ambiguous Grammar Proving that a specific grammar is ambiguous

How can I prove ifthat the following grammar is ambiguous  : A -> AA|B B - > aBb|ab

$$ A \to AA|B \\ B \to aBb|ab $$

I tried finding a string that I can derivebe derived in 2two different ways, but am not winningto no avail. Please help

Ambiguous Grammar

How can I prove if the following grammar is ambiguous  : A -> AA|B B - > aBb|ab

I tried finding a string that I can derive in 2 ways but am not winning. Please help

Proving that a specific grammar is ambiguous

How can I prove that the following grammar is ambiguous:

$$ A \to AA|B \\ B \to aBb|ab $$

I tried finding a string that can be derived in two different ways, but to no avail.

Source Link
Nnina
Nnina
  • 11
  • 1

Ambiguous Grammar

How can I prove if the following grammar is ambiguous : A -> AA|B B - > aBb|ab

I tried finding a string that I can derive in 2 ways but am not winning. Please help