Chapter 4, Problem 17RQ

Explanation of Solution

Pairwise disjointness test:

Pairwise disjointness test: It is the test used to check whether there is a Left recursion exist in a grammar or not. If a grammar passes this test, it means it is non-left recursive grammar.

Concept of left recursion:

$A\to Aa|b$

Example of a left recursive grammar:

Means if first symbol on RHS is same as LHS, then the following grammar is known as left recursive